Buettner R.,University for Business Studies
Electronic Markets | Year: 2017
While career-oriented social networking markets (CSNM) such as LinkedIn or XING are increasingly appreciated by a large number of internet users, our understanding of CSNM benefits and factors influencing the intention to use CSNM for a job search is very limited. For theoretical work on CSNM I extend Venkatesh’s et al. UTAUT2 model by presenting a new concept considering a user’s ties based on Granovetter’s social network theory. The evaluation of the extended model, which asks users of CSNM about their job search behavior and their search success, shows a predictive quality increase from 19.0 percent to 80.5 percent. Post hoc analyses reveal a substantial negative relationship between the number of a user’s ties and its job search success, which supports the experience of practitioners but contradicts scholarly findings. A level of about 150 contacts is most effective in terms of getting job offers, which confirms Dunbar’s number. The results are useful for scholars and practitioners. © 2017 The Author(s)
Scutari G.,Purdue University |
Facchinei F.,University of Rome La Sapienza |
Lampariello L.,University for Business Studies
IEEE Transactions on Signal Processing | Year: 2017
In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints, and also consider extensions to some structured, nonsmooth problems. The algorithm solves a sequence of (separable) strongly convex problems and maintains feasibility at each iteration. Convergence to a stationary solution of the original nonconvex optimization is established. Our framework is very general and flexible and unifies several existing successive convex approximation (SCA)-based algorithms. More importantly, and differently from current SCA approaches, it naturally leads to distributed and parallelizable implementations for a large class of nonconvex problems. This Part I is devoted to the description of the framework in its generality. In Part II, we customize our general methods to several (multiagent) optimization problems in communications, networking, and machine learning; the result is a new class of centralized and distributed algorithms that compare favorably to existing ad-hoc (centralized) schemes. © 2016 IEEE.
Liu Y.,University for Business Studies
Mathematical Methods in the Applied Sciences | Year: 2013
Results on the existence of solutions of a periodic-type boundary value problem of singular multi-term fractional differential equations with the nonlinearity depending on D0+αx are established and being singular at t = 0 and t = 1. The analysis relies on the well-known fixed-point theorems. An example is given to illustrate the efficiency of the main theorems. Copyright © 2013 John Wiley & Sons, Ltd.
Yuan J.-J.,University for Business Studies
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | Year: 2012
Aiming at the complexity of rational balance between product family's commonality and difference without transcendental information, a multi-objective constraints optimization model of scale-based product family with commonality maximization and average performance lose minimization was proposed under multi-platform design of scale-based product family. Based on the ideas of non-dominated sort and crowding distance sort, the compare operation and the update operation of traditional firefly brightness were improved, and a modified firefly algorithm adapt to solve multi-objective constraint optimization problem was presented. To solve the optimization model of scale-based product family, a expression pattern of two-layer artificial firefly structure with common variable ability was constructed. A simulation study on optimization design of motor product family was provided to evaluate the effectiveness of proposed model and algorithm.
Li C.S.,University for Business Studies
Procedia Engineering | Year: 2011
This paper defines nearest neighbor pair and puts forward four assumptions about nearest neighbor pairs, based on which a center initialization method for K-means algorithm over data sets with two clusters is build. Experiments on real data sets show that the proposed method is not preferable but at least comparable to the ones in literatures. The contribution of the proposed method is to open up a new approach to devising center initialization method for K-means algorithm. © 2011 Published by Elsevier Ltd.
Liu Y.,University for Business Studies
UPB Scientific Bulletin, Series A: Applied Mathematics and Physics | Year: 2011
In this article, we establish the existence of at least three positive solutions to a boundary-value problem of the nonlinear singular fractional differential equation. Our analysis rely on the well known fixed point theorem in the cone.
Deng Y.,University for Business Studies
Advanced Materials Research | Year: 2011
Digital signature schemes allow a signer to transform any message into a signed message, such that anyone can verify the validity of the signed message using the signer's public key, but only the signer can generate signed messages. A proxy re-signature, which is a type of digital signatures, has significant applications in many areas. Proxy signature scheme was first introduced by Blaze, Bleumer, and Strauss, but that scheme is inefficient and with limited features. After that, some Proxy re-signature schemes were proposed by researchers. This paper constructs a blind proxy re-signatures scheme. Comparing to the previous proxy re-signature schemes, the scheme adds a message blinded feature, and then the security of the scheme is proven.
Byard K.,University for Business Studies
Applied Optics | Year: 2012
A class of flexible coded apertures, called index class apertures, is presented. The configurations are shown to possess similar properties to the geometric apertures of Gourlay and Stephen [Appl. Opt. 22, 4042 (1983)], and it is demonstrated that the modified uniformly redundant arrays (MURAs) are a special case of the index class apertures. The apertures are shown to offer both a larger range of throughput values and better imaging capability than is available to the geometric apertures, while at the same time possessing more rigidity of structure than other designs, such as the MURAs and the uniformly redundant arrays. © 2012 Optical Society of America.
Liu Y.,University for Business Studies
Computers and Mathematics with Applications | Year: 2012
Results on the existence of solutions of a integral type boundary value problem for the multiple term fractional differential equation with the nonlinearity depending on D0 +αx are established. The analysis relies on the nonlinear alternative theory. Corollaries and examples are given to illustrate the efficiency of the main theorems. © 2011 Elsevier Ltd. All rights reserved.
Agency: European Commission | Branch: H2020 | Program: CSA | Phase: MSCA-NIGHT-2016 | Award Amount: 193.65K | Year: 2016
European Researchers Night in Bosnia and Herzegovina 2016-2017 (RiNG-16-17) will jointly represent research and innovation landscape from Republika Srpska and Federation of BiH, promote scientific careers and enhance public recognition of researchers work with the message Researchers are amongst us by engaging interactive communication with the public at large in whole BiH. RiNG-16-17 slogan is research and innovation two sides of the same coin. The event is based on discovery of unknown and building better tomorrow concepts, and will be organized in collaboration with 2-days StartupDNA conference. RiNG-16-17 is a Researchers Night of national character, involving coordinated actions in six cities in Bosnia and Herzegovina, and incorporates cross-border aspect by involving researchers and research-driven business from the Balkan region as participants in RiNG activities. Promotion campaign will largely rely on European dimension and will be coordinated with other Researchers Nights in EU and Western Balkan region. Specific activities will be organized in several cities in BiH, thus becoming national research promotion event in this country: - Edutainment parks with hands-on experiments, directly engaging general public into communication with researchers; - High school competitions for the best science projects; - Science coffee and talks to scientists, labeled as RiNG.ME; - Various competitions, games and quizzes, especially directed to younger audience; - Stand Up Science lectures, presentations; - Large EU area: EU corners with policy and gender issues advisory, as well exhibition of EU-funded projects in BiH; - Thematic activities at supporting universities, research centres and museums; - Science Movie Night and Science Party. RiNG-16-17 quantitative targets per event/year are: - Number of people to be reached through awareness raising campaign in BiH: 350.000; - Expected number of direct attendees to organized events in whole BiH: 15.000.