In this paper we present AOAB, the Automated optimization algorithm Benchmarking system. AOAB can be used to automatically conduct experiments with numerical optimization algorithms by applying them to different bench...
详细信息
ISBN:
(纸本)9781450300735
In this paper we present AOAB, the Automated optimization algorithm Benchmarking system. AOAB can be used to automatically conduct experiments with numerical optimization algorithms by applying them to different benchmarks with different parameter settings. Based on the results, AOAB can automatically perform comparisons between different algorithms and settings. It can aid the researcher to identify trends for good parameter settings and to find which algorithms are suitable for which type of problem. We introduce the system structure of AOAB (the server and the graphical client interface), define the way in which optimizers and benchmark functions can be implemented for the use in AOAB, and conduct an illustrative example experiment with our system: a comparison between Random Search and two Hill Climbers.
This paper presents the development of an optimization methodology for selecting the lowest monetary cost combinations of building technologies to meet set operational energy reduction targets. The new optimization al...
详细信息
This paper presents the development of an optimization methodology for selecting the lowest monetary cost combinations of building technologies to meet set operational energy reduction targets. The new optimization algorithm introduced in this paper departs from the notion that optimal design choices over a large set of design parameters and properties can be driven by energy targets. We assume that design parameters are determined by many concurrent considerations fighting over the attention span of the design team. Our approach starts from a design outcome and asks the question, which set of discrete technologies are the right mix to reach an energy target in the cost optimal way? Such an approach has to face the challenge that the properties of market-available building technologies have a discrete nature that makes their optimal selection a combinatorial problem. The optimization algorithm searches the discrete combinatoric space by maximizing the following objective function: calculated energy savings divided by premium cost, where cost is defined as the additional cost over a baseline solution. The algorithm is codified into a custom MATLAB script and when compared to prescriptive methodologies is shown to be more cost effective and generically applicable given a palette of building technology alternatives and their corresponding cost data.
A new optimization algorithm for combined processes of deep-drawing and ironing has been created in order to improve these types of axisymmetric components manufacturing procedures. The model provides a comprehensive ...
详细信息
ISBN:
(纸本)9781849964319
A new optimization algorithm for combined processes of deep-drawing and ironing has been created in order to improve these types of axisymmetric components manufacturing procedures. The model provides a comprehensive analysis of those phenomena occurring in multi-stage processes of axisymmetric geometry work pieces. The scientific development starts out from works that provide LDR (limiting drawing ratio) solutions based on normal anisotropy value, strain hardering exponent and others parameters which have just been applied to the drawing and redrawing stages so far. The authors extend this work to the ironing stages, and also provide a global and integral scientific solution for the whole process. At the beginning the algorithm provides an initial solution which is afterwards optimized by means of objective functions and constraints. The resolution of the optimization process is carried out by a recursive function that minimizes the total time of the global process. The enhanced solution performs a significant reduction in time and costs of the process. The model allows the modification and correction of certain process variables in order to predict the impact of those that are not fully controllable. The final results are compared using experimental results obtained by the authors, so as to show the reliability of the complete solution.
Autonomous manipulation in unestructured underwater scenarios is a high challenging skill that has been poorly studied and is becoming more and more important in the last years. One of the main problems regarding the ...
详细信息
ISBN:
(纸本)9781479987375
Autonomous manipulation in unestructured underwater scenarios is a high challenging skill that has been poorly studied and is becoming more and more important in the last years. One of the main problems regarding the autonomous manipulation, is to find out the characteristics of the object which is going to be manipulated. This paper presents a new approach to obtain an accurate 3D reconstruction of this object. This approach consists in attaching a laser stripe emitter and a camera in the forearm of a robotic arm. Moving the arm, the laser scans the scene where the object is and, at the same time, the camera records the scan. Thanks to the arm and the position of the camera, the scene can be reconstructed from different views and from a position close to the object. The recorded images are processed to obtain the 3D position of the part of the scene projected by the laser. Before the intervention, a process of calibration is needed to calculate the relationship between each part of the system. Furthemore, in order to reduce the time of processing of the images recorded during the scan, an optimization algorithm is presented which consists in discarding, before the processing, the pixels of the image which do not contain relevant information. The approach herein presented and the optimization algorithm are tested using an underwater simulator.
Many kinds of optimization algorithm have been applied to design diffractive optical elements (DOEs) for beam shaping. However, only the selected sampling points are controlled by these optimization algorithms, the in...
详细信息
ISBN:
(纸本)9781628418965
Many kinds of optimization algorithm have been applied to design diffractive optical elements (DOEs) for beam shaping. However, only the selected sampling points are controlled by these optimization algorithms, the intensity distribution of other points on the output plane is always far away from the ideal distribution. In our previous research, the non-selected points were well controlled by using a hybrid algorithm merging hill-climbing with simulated annealing, but this hybrid algorithm is time-consuming. In this paper, a new hybrid algorithm merging Gerchberg-Saxton algorithm with gradient method is presented. Because of the use of iterative algorithm, the optimization time is largely reduced. The intensity distribution of the non-selected points as well as that of the selected points is well controlled, and good performance of beam shaping is obtained. Finally the experimental results demonstrate the good performance of this algorithm.
To achieve the flexibility in resource optimization, fault tolerance and load balancing, virtual machines(VMs) should be effectively migrated in data center networks(DCN). VMs are regulated by security policies and al...
详细信息
ISBN:
(纸本)9781479999644
To achieve the flexibility in resource optimization, fault tolerance and load balancing, virtual machines(VMs) should be effectively migrated in data center networks(DCN). VMs are regulated by security policies and also required to relocate the policy during VM migration, which is a challenge problem to maintain not only the isolation among different domains and tenants, but also the consistency of policy configuration. In this paper, we consider the problem of policy relocation in Software-defined Network(SDN) context since it provides flexible control. We introduce a formal model describing the problem and present a novel policy relocation scheme called VPRS(a Virtual Policy Relocation Scheme), which is based on policy-aware principle and space-optimized method. It can prevent fragmentation of policy and reduce the memory usage while accurately relocating influenced policies. On the other hand, it also simplifies the management of policy. Specifically, VPRS contains novel algorithms for policy relocation, an app-layer policy management, policy translator and component for controllers notification. We define three actions of policy relocation based on the policy abstraction, and then describe the advantage of our scheme about selecting an optimized network address as target address. Then we introduce the core space-optimized algorithms, and evaluate the effectiveness of our scheme by providing consumption on their running overhead and utilization of rule space. Our scheme performs well on real policy sets, and has dramatic reduction by even up to 90% on rule space costs with high utilization.
Erasure codes are widely deployed in storage systems and the encoding/decoding process is a common operation in erasure-coded systems. Parity-check matrix method is a general method employed in erasure codes to conduc...
详细信息
ISBN:
(纸本)9781467375887
Erasure codes are widely deployed in storage systems and the encoding/decoding process is a common operation in erasure-coded systems. Parity-check matrix method is a general method employed in erasure codes to conduct encoding/decoding process. However, the process is serial and generates high computational cost in dealing with matrix operations, and hence, causes low encoding/decoding performance. Especially for some recently proposed erasure codes, including SD code, PMDS code, and LRC code, the disadvantages are more obvious. To address this issue, in this paper, we present an optimization algorithm, called Partitioned and Parallel Matrix (PPM) algorithm, to accelerate the encoding/decoding processes of these codes by partitioning the parity-check matrix, parallelizing the encoding/decoding operations, and optimizing the calculation sequence, so as to achieve the goal of fast encoding/decoding. Experimental results show that PPM can speed up the encoding/decoding process of these codes by up to 210.81%.
Increased fuel prices and public awareness of environment impacts from shipping have attracted large efforts in maritime sector to increase its energy efficiency as a factor of competitiveness. Weather routing has bec...
详细信息
ISBN:
(纸本)9780791856499
Increased fuel prices and public awareness of environment impacts from shipping have attracted large efforts in maritime sector to increase its energy efficiency as a factor of competitiveness. Weather routing has become a recognized measure, which can partly help to achieve the targets as well as enhancing safety. A routing system requires a reliable optimization algorithm to consider a ship's operational costs, expected time of arrival, and cargo safety etc. simultaneously. Hence, the service provided by a weather routing system is highly dependent on a properly selected optimization algorithm and associated input parameters. In this paper the concept of weather routing is broken down into many elements for further analysis. Focus is given to algorithms, constraints and weather forecasts used in the optimized routing plan. Two different aspects of state-of-the-art have been considered. The first is a study of software already in use and the second is a study of methods investigated in the research community. Furthermore, this paper also provides examples of development trends, for example the fatigue based routing, and the risk based routing, as well as its integration with onboard monitoring systems for more reliable weather and ship specific response information.
The paper proposes a model for the thermal network of the Savona Campus Smart Polygeneration Microgrid (SPM) in terms of an equivalent electric circuit. Such model allows to represent in a simple but accurate way the ...
详细信息
ISBN:
(纸本)9781479976959
The paper proposes a model for the thermal network of the Savona Campus Smart Polygeneration Microgrid (SPM) in terms of an equivalent electric circuit. Such model allows to represent in a simple but accurate way the behavior of the SPM thermal network in order to insert it into the Energy Management System (EMS) that is presently running in the SPM control room. The parameters of the thermal circuit are identified by means of an algorithm that minimizes the difference between the temperature profile as calculated with the circuit and the measured one.
Bayesian Model Averaging (BMA) is a statistical method used for multi-model ensemble forecast system. Firstly, the likelihood function of BMA is improved by eliminating the explicit constraint, that the sum of weights...
详细信息
ISBN:
(纸本)9783319196206;9783319196190
Bayesian Model Averaging (BMA) is a statistical method used for multi-model ensemble forecast system. Firstly, the likelihood function of BMA is improved by eliminating the explicit constraint, that the sum of weights is 1, and use SCE-UA for the minimization of its, which presents a new method for solving the Bayesian model averaging, that is the BMA-SCE-UA method. With three land surface models of soil moisture simulation test of multiple numerical model. By comparing the common Expectation Maximization (EM) method with the SCE-UA method, the results show that: SCE-UA method can improve the simulation performance of soil moisture in a large extent, and the soil moisture obtained by the BMA collection simulation and observation matches well, no matter from the amplitude variation and seasonal variability, which makes it possible that generating high accuracy data set of soil moisture with the method of BMA-SCE-UA and using multiple land surface models.
暂无评论