Search results for "optimization"

showing 10 items of 2824 documents

On Optimizing Locally Linear Nearest Neighbour Reconstructions Using Prototype Reduction Schemes

2010

This paper concerns the use of Prototype Reduction Schemes (PRS) to optimize the computations involved in typical k-Nearest Neighbor (k-NN) rules. These rules have been successfully used for decades in statistical Pattern Recognition (PR) applications, and have numerous applications because of their known error bounds. For a given data point of unknown identity, the k-NN possesses the phenomenon that it combines the information about the samples from a priori target classes (values) of selected neighbors to, for example, predict the target class of the tested sample. Recently, an implementation of the k-NN, named as the Locally Linear Reconstruction (LLR) [11], has been proposed. The salien…

Optimization problemComputer science020206 networking & telecommunications02 engineering and technologyReduction (complexity)Set (abstract data type)Data point0202 electrical engineering electronic engineering information engineeringFeature (machine learning)A priori and a posteriori020201 artificial intelligence & image processingPoint (geometry)Quadratic programmingAlgorithm
researchProduct

Energy Efficient Sink Placement in Wireless Sensor Networks by Brain Storm Optimization Algorithm

2018

Wireless sensor networks represent one of the most promising technologies whose use has significantly increased in the past years. They are used in various applications such as health care monitoring, surveillance and monitoring in agriculture, industrial monitoring, habitat and underwater monitoring, etc. Deployment of the wireless sensor networks introduces number of hard optimization problems. Placement of the elements such as sensors, gateways, sinks and base stations, depend on different conditions and constraints such as signal propagation, distance, energy preservation, reliability. In this paper, we propose a method based on brain storm optimization algorithm for placing multiple si…

Optimization problemComputer scienceDistributed computingReliability (computer networking)Particle swarm optimization020206 networking & telecommunications02 engineering and technologySwarm intelligenceBase stationComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingWireless sensor networkEnergy (signal processing)Efficient energy use2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC)
researchProduct

Multidimensional scaling and stock location assignment in a warehouse: an application

1999

By means of an application, in the present paper, the suitability of a multivariate statistical methodology, as multidimensional scaling (MDS), to solve an optimization problem is shown. In particular, considering the stock location assignment problem in the warehouse of a supermarket chain, the solution gained by applying MDS to a set of seven variables is compared with the one obtainable by considering the usual techniques applied in this context. A wide discussion of results is reported. Copyright © 1999 John Wiley & Sons, Ltd.

Optimization problemComputer scienceModeling and SimulationData miningMultidimensional scalingManagement Science and Operations ResearchMultivariate statisticalcomputer.software_genreGeneral Business Management and AccountingAssignment problemcomputerStock (geology)WarehouseApplied Stochastic Models in Business and Industry
researchProduct

Energy efficient resource allocation for secure OFDMA relay systems with eavesdropper

2016

In this paper, we address the energy efficient resource allocation problem for a secure orthogonal frequency division multiple access (OFDMA) relay system. In particular, we consider there is a eavesdropper near the base station (BS) which tries to overtake the information sent by BS. We formulate the joint optimization problem with the objective to optimize the energy efficiency of the considered system by considering subcarrier pairing, secret data rate and power allocation. In addition, the system can assign different priority to different users such that the security of information transmission can be guaranteed. The proposed iterative algorithm not only maximizes the system energy effi…

Optimization problemComputer scienceOrthogonal frequency-division multiplexingOrthogonal frequency-division multiple accessThroughput02 engineering and technologyrelaysecure communicationslaw.inventionOFDMABase station0203 mechanical engineeringRelaylawartificial noise0202 electrical engineering electronic engineering information engineeringResource managementenergy efficiencyta113business.industryQuality of servicesubcarrier pair020302 automobile design & engineering020206 networking & telecommunicationsbusinessEfficient energy useComputer network2016 IEEE International Conference on Communications (ICC)
researchProduct

Contact Shape Optimization

1995

Shape optimization is a branch of the optimal control theory in which the control variable is connected with the geometry of the problem. The aim is to find a shape from an a priori defined class of domains, for wich the corresponding cost functional attains its minimum. Shape optimization of mechanical systems, behaviour of which is described by equations, has been very well analyzed from the mathematical, as well as from the mechanical point of view, see [1], [2], [3] and references therein. The aim of this contribution is to extend results to the case, in which the system is described by the so called variational inequalities. There are two reasons for doing that: 1) The behavior of many…

Optimization problemComputer scienceVariational inequalityControl variableApplied mathematicsShape optimizationMinificationFunction (mathematics)State (functional analysis)Optimal control
researchProduct

On the Post-Elastic Behavior of LRPH Connections

2019

The paper concerns the study of the post-elastic behavior of a recently proposed innovative device, named Limited Resistance Rigid Perfectly Plastic Hinge (LRPH). In particular, LRPH is a steel device of finite length realizing a moment connection between beam elements of a steel frame; it is designed in order to possess two main and independent requirements: its bending moment resistance must be suitably lower than the one of the connected beam element and its overall bending stiffness must be equal to that of the connected beam element characterized by the same length. In order to make the proposed device reliable, LRPH must be capable of realizing a full plastic hinge for the assigned be…

Optimization problemComputer sciencebusiness.industryMechanical EngineeringGeneral Chemical EngineeringStructural engineeringUpper and lower boundsFinite element methodMoment (mathematics)Modeling and SimulationBending stiffnessPlastic hingeBending momentElectrical and Electronic EngineeringSettore ICAR/08 - Scienza Delle CostruzionibusinessBeam (structure)FEM Analysis LRPH Device Optimal Design Post-Elastic Behavior Steel ConnectionInternational Review on Modelling and Simulations (IREMOS)
researchProduct

A Web Application for the Remote Control of Multiple Unmanned Aerial Vehicles

2019

Unmanned Aerial Vehicles (UAVs) are receiving an increasing attention from the research and industry community, and today they are adopted for several civilian and military applications. However, state of the art technologies are still based on a single UAV either directly controlled by the human operator or supervised through the manual definition of a flight plan. As a result, scalability is still a significant limitation for such systems, especially when large areas need to be monitored. In this paper we propose a web based application for the control of multiple UAVs. The application has three layers. The first layer allows the user to remotely submit a monitoring mission through a web …

Optimization problemComputer sciencebusiness.industryReal-time computingTestbedFlight planComputerApplications_COMPUTERSINOTHERSYSTEMSDronelaw.inventionlawScalabilityWeb applicationUser interfacebusinessRemote control2019 International Conference on Computing, Networking and Communications (ICNC)
researchProduct

Combined Elephant Herding Optimization Algorithm with K-means for Data Clustering

2018

Clustering is an important task in machine learning and data mining. Due to various applications that use clustering, numerous clustering methods were proposed. One well-known, simple, and widely used clustering algorithm is k-means. The main problem of this algorithm is its tendency of getting trapped into local minimum because it does not have any kind of global search. Clustering is a hard optimization problem, and swarm intelligence stochastic optimization algorithms are proved to be successful for such tasks. In this paper, we propose recent swarm intelligence elephant herding optimization algorithm for data clustering. Local search of the elephant herding optimization algorithm was im…

Optimization problemComputer sciencebusiness.industryk-means clustering020206 networking & telecommunications02 engineering and technologycomputer.software_genreSwarm intelligence0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingStochastic optimizationLocal search (optimization)Data miningHerdingbusinessCluster analysiscomputerMetaheuristic
researchProduct

Interactive multiobjective optimization system WWW-NIMBUS on the Internet

2000

Abstract NIMBUS is a multiobjective optimization method capable of solving nondifferentiable and nonconvex problems. We describe the NIMBUS algorithm and its implementation WWW-NIMBUS. To our knowledge WWW-NIMBUS is the first interactive multiobjective optimization system on the Internet. The main principles of its implementation are centralized computing and a distributed interface. Typically, the delivery and update of any software is problematic. Limited computer capacity may also be a problem. Via the Internet, there is only one version of the software to be updated and any client computer has the capabilities of a server computer. Further, the World-Wide Web (WWW) provides a graphical …

Optimization problemGeneral Computer ScienceComputer sciencebusiness.industryInterface (computing)Distributed computingClientManagement Science and Operations ResearchMulti-objective optimizationSoftwareModeling and SimulationServerThe InternetbusinessGraphical user interfaceComputers & Operations Research
researchProduct

Helmholtz equation in unbounded domains: some convergence results for a constrained optimization problem

2016

We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we prove some estimates on the rate of convergence to the exact solution.

Optimization problemHelmholtz equationDomain (software engineering)Constrained optimization problemExact solutions in general relativityMathematics - Analysis of PDEsRate of convergenceBounded functionConvergence (routing)FOS: MathematicsHelmholtz equation Transparent boundary conditions Minimization of integral functionals.Applied mathematicsMathematicsAnalysis of PDEs (math.AP)
researchProduct