Search results for "SOFTWARE"
showing 10 items of 7396 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…
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…
Hard material small-batch industrial machining robot
2018
Abstract Hard materials can be cost effectively machined with standard industrial robots by enhancing current state-of-the-art technologies. It is demonstrated that even hard metals with specific robotics-optimised novel hard-metal tools can be machined by standard industrial robots with an improved position-control approach and enhanced compliance-control functions. It also shows that the novel strategies to compensate for elastic robot errors, based on models and advanced control, as well as the utilisation of new affordable sensors and human-machine interfaces, can considerably improve the robot performance and applicability of robots in machining tasks. In conjunction with the developme…
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…
Aesthetic considerations for the min-max K-Windy Rural Postman Problem
2017
[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses sever…
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Improving the performance of embedded systems with variable neighborhood search
2017
Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood se…
DESDEO : An Open Framework for Interactive Multiobjective Optimization
2018
We introduce a framework for interactive multiobjective optimization methods called DESDEO released under an open source license. With the framework, we want to make interactive methods easily accessible to be applied in solving real-world problems. The framework follows an object-oriented software design paradigm, where functionalities have been divided to modular, self-contained components. The framework contains implementations of some interactive methods, but also components which can be utilized to implement more interactive methods and, thus, increase the applicability of the framework. To demonstrate how the framework can be used, we consider an example problem where the pollution of…