Search results for " Computer"
showing 10 items of 6910 documents
DESDEO: The Modular and Open Source Framework for Interactive Multiobjective Optimization
2021
Interactive multiobjective optimization methods incorporate preferences from a human decision maker in the optimization process iteratively. This allows the decision maker to focus on a subset of solutions, learn about the underlying trade-offs among the conflicting objective functions in the problem and adjust preferences during the solution process. Incorporating preference information allows computing only solutions that are interesting to the decision maker, decreasing computation time significantly. Thus, interactive methods have many strengths making them viable for various applications. However, there is a lack of existing software frameworks to apply and experiment with interactive …
P-FCM: a proximity-based fuzzy clustering for user-centered web applications
2003
Abstract In last years, the Internet and the web have been evolved in an astonishing way. Standard web search services play an important role as useful tools for the Internet community even though they suffer from a certain difficulty. The web continues its growth, making the reliability of Internet-based information and retrieval systems more complex. Nevertheless there has been a substantial analysis of the gap between the expected information and the returned information, the work of web search engine is still very hard. There are different problems concerning web searching activity, one among these falls in the query phase. Each engine provide an interface which the user is forced to le…
Care Workers’ Readiness for Robotization : Identifying Psychological and Socio-Demographic Determinants
2020
Successful implementation of robots in welfare services requires that the staff approves of them as a part of daily work tasks. In this study, we identified psychological and socio-demographic determinants associated with readiness for robotization among professional Finnish care-workers. National survey data were collected from professional care workers (n = 3800) between October and November 2016. Random samples were drawn from the member registers of two Finnish trade unions. The data were analyzed with regression models for respondents with and without firsthand experience with robots. The models explained 34–39% of the variance in the readiness for robotization. The readiness was posit…
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
A model for torque losses in variable displacement axial piston motors
2018
This paper includes a comparison of earlier presented models for torque losses in hydraulic motors and several proposed models that all rely on data typically available for a system engineer. The new models and the old ones are compared. The new models are all based on a model developed by Jeong 2007 with an expansion that include variable displacement. All of the new models yield very good accuracy down to approximately 50% of maximum displacement and down to approximately 15% of maximum speed. In these operational ranges the deviation in torque is less than 1%. The main purpose of the new models is to facilitate simulations of hydraulically actuated winches with a balance between accuracy…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Tabu Search to Plan Schedules in a Multiskill Customer Contact Center
2006
International audience; We have studied a realistic case of scheduling problem in a customer contact center, dealing with multiskill agents. Our model combines the last two steps of the standard approach by determining shifts and by assigning them to agents at the same time (scheduling and rostering). Moreover, we have considered realistic vacations, according to legal constraints and preferences of agents. We have envisioned entire weeks of work, with variable meal times and meal durations, without overtime. In this paper, we define the problem and describe a Tabu search based solution.
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.