Search results for " Optimization"
showing 10 items of 2367 documents
A Bio-Inspired Cognitive Agent for Autonomous Urban Vehicles Routing Optimization
2017
Autonomous urban vehicle prototypes are expected to be efficient even in not explicitly planned circumstances and dynamic environments. The development of autonomous vehicles for urban driving needs real-time information from vehicles and road network to optimize traffic flows. In traffic agent-based models, each vehicle is an agent, while the road network is the environment. Cognitive agents are able to reason on the perceived data, to evaluate the information obtained by reasoning, and to learn and respond, preserving their self-sufficiency, independency, self-determination, and self-reliance. In this paper, a bio-inspired cognitive agent for autonomous urban vehicles routing optimization…
Changes in Treatment of Very Elderly Patients Six Weeks after Discharge from Geriatrics Department
2020
We assessed the prescriptions of patients hospitalized in a geriatric unit and subsequently discharged. This prospective and observational study was conducted over a two-month period in the geriatrics department (acute and rehabilitation units) of a university hospital. Patients discharged from this department were included over a two-month period. Prescriptions were analyzed at admission and discharge from the geriatrics department (DGD), and six weeks after DGD. We included 209 patients, 63% female, aged 86.8 years. The mean number of medications prescribed was significantly higher at DGD than at admission (7.8 vs. 7.1, p = 0.003). During hospitalization, 1217 prescriptions were changed (…
Methods matter: Testing competing models for designing short-scale Big-Five assessments
2015
Abstract Many psychological instruments are psychometrically inadequate because derived person-parameters are unfounded and models will be rejected using established psychometric criteria. One strategy towards improving the psychometric properties is to shorten instruments. We present and compare the following procedures for the abbreviation of self-report assessments on the Trait Self-Description Inventory in a sample of 14,347 participants: (a) Maximizing reliability/main loadings, (b) Minimizing modification indices/cross loadings, (c) the PURIFY Algorithm in Tetrad, (d) Ant Colony Optimization, and (e) a genetic algorithm. Ant Colony Optimization was superior to all other methods in imp…
DEVELOPMENT AND APPLICATIONS OF A VIRTUAL HYBRID PLATFORM FOR MULTISCALE ANALYSIS OF ADVANCED STRUCTURES OF AIRCRAFT (DEVISU)
2022
This paper outlines the main findings of the project “DEvelopment and applications of a VIrtual hybrid platform for multiscale analysis of advanced StructUres of aircraft” (DEVISU), which deals with failure of composite structures and noise/vibration reduction, along with investigation of new materials for aerospace applications.
Adaptive BEM for Low Noise Propeller Design
2009
A potential-based Boundary Element Method is presented for the aerodynamic and acoustic design of propel- lers at on- and off-design point conditions. Using an adaptive method, a family of airfoil sections is selected to produce the required performance (thrust, torque and efficiency versus advance ratio) at different cruise flight levels. Climb condi- tions are also considered in order to check the off-design point performance. Once the available airfoil data have been stored in a database, the code processes the families of airfoils to generate a complete geometry for a propeller of the specified performance with an optimized noise emission. The computational scheme adjusts the blade geom…
Geometric interpretation of the optimality conditions in multifacility location and applications
1991
Geometrical optimality conditions are developed for the minisum multifacility location problem involving any norm. These conditions are then used to derive sufficient conditions for coincidence of facilities at optimality; an example is given to show that these coincidence conditions seem difficult to generalize.
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
Introduction to General Duality Theory for Multi-Objective Optimization
1992
This is intended as a comprehensive introduction to the duality theory for vector optimization recently developed by C. Malivert and the present author [3]. It refers to arbitrarily given classes of mappings (dual elements) and extends the general duality theory proposed for scalar optimization by E. Balder, S. Kurcyusz and the present author [1] and P. Lindberg.
Ensuring High Performance of Consensus-Based Estimation by Lifetime Maximization in WSNs
2015
The estimation of a parameter corrupted by noise is a common tasks in wireless sensor networks, where the deployed nodes cooperate in order to improve their own inaccurate observations. This cooperation usually involves successive data exchanges and local information updates until a global consensus value is reached. The quality of the final estimator depends on the amount of collected observations, hence the number of active nodes. Moreover, the inherent iterative nature of the consensus process involves a certain energy consumption. Since the devices composing the network are usually battery powered, nodes becoming inactive due to battery depletion emerges as a serious problem. In this wo…
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
2017
In this work, we tackle multidimensional two-way number partitioning (MDTWNP) problem by combining GRASP with Exterior Path Relinking. In the last few years, the combination of GRASP with path relinking (PR) has emerged as a highly effective tool for finding high-quality solutions for several difficult problems in reasonable computational time. However, in most of the cases, this hybridisation is limited to the variant known as interior PR. Here, we couple GRASP with the "exterior form" of path relinking and perform extensive experimentation to evaluate this variant. In addition, we enhance our GRASP with PR method with a novel local search method specially designed for the MDTWNP problem. …