Algorithmic optimization method for effort estimation

This paper presents an improvement of an effort estimation method that can be used to predict the level of effort for software development projects. A new estimation approach based on a two-phase algorithm is used. In the first phase, we apply a calculation based on use case points (UCPs). In the second phase, we add correction values (a ₁, a ₂) obtained via least squares regression. This approach employs historical project data to refine the estimate. By applying the least squares regression approach, the algorithm filters out estimation errors caused by human factors and company practice.     

Energy Consumption Optimization for Mobile Robots Motion Using Predictive Control

Operation of mobile robots in off-road environment requires the attention to the torque saturation problem that occurs in the wheels DC motors while climbing hills. In the present work, off-road conditions are utilized to benefit while avoiding torque saturation. Energy optimization algorithm using predictive control is implemented on a two-DC motor-driven wheels mobile robot while crossing a ditch. The predictive control algorithm is simulated and compared with the PID control and the open-loop control. Predictive control showed more capability to avoid torque saturation and noticeable reduction in the energy consumption. Furthermore, using the wheels motors armature current instead of the supply voltage as control variable in the predictive control showed more efficient speed control. Simulation results showed that in case of known ditch dimensions ahead of time, the developed algorithm is feasible. Experimental examination of the developed energy optimization algorithm is presented. The experimental results showed a good agreement with the simulation results. The effects of the road slope and the prediction horizon length on the consumed energy are evaluated. The analytical study showed that the energy consumption is reduced by increasing the prediction horizon until it reaches a limit at which no more energy reduction is obtained. This limit is proportional to the width of the ditch in front of the mobile robot. Curve fitting is applied to the obtained results to address further the effect of the parameters on the energy consumption.     

A novel model for arc territory design: promoting Eulerian districts

The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.     

Markov Models of Queueing–Inventory Systems with Variable Order Size

Markov models of queueing–inventory systems with variable order size are investigated. Two classes of models are considered: with instant service and with nonzero service time. The model with nonzero service time assumes that impatient customers can form a queue of either finite or infinite length. The exact and approximate methods are developed to calculate the characteristics of the systems under proposed restocking policy.     

A new approach for image databases design

This paper focuses on the methodologies to organize and structure image databases. Conventional relational database techniques are optimized to deal with textual and numeric data; however, they are not effective to handle image data. Some progresses have been made in developing new approaches to establish and use image databases, but the applications of these approaches are very labor-intensive, error-prone, and impractical to large-scale databases. In this paper, we propose a new approach to develop the structure of a large-scale image automatically. It is an integrated approach from existing technologies for the new application where the management of image data is focused. In addition, we present a solution to data indexing for the image database with different image types.     

Efficient computation of distance labeling for decremental updates in large dynamic graphs

Since today’s real-world graphs, such as social network graphs, are evolving all the time, it is of great importance to perform graph computations and analysis in these dynamic graphs. Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem. Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs. A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates (i.e., edge deletions). We propose maintenance algorithms based on distance labeling, which can handle decremental updates efficiently. By exploiting properties of distance labeling in original graphs, we are able to efficiently maintain distance labeling for new graphs. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach. More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL).     

Efficient aerodynamic shape optimization of transonic wings using a parallel infilling strategy and surrogate models

Surrogate models are used to dramatically improve the design efficiency of numerical aerodynamic shape optimization, where high-fidelity, expensive computational fluid dynamics (CFD) is often employed. Traditionally, in adaptation, only one single sample point is chosen to update the surrogate model during each updating cycle, after the initial surrogate model is built. To enable the selection of multiple new samples at each updating cycle, a few parallel infilling strategies have been developed in recent years, in order to reduce the optimization wall clock time. In this article, an alternative parallel infilling strategy for surrogate-based constrained optimization is presented and demonstrated by the aerodynamic shape optimization of transonic wings. Different from existing methods in which multiple sample points are chosen by a single infill criterion, this article uses a combination of multiple infill criteria, with each criterion choosing a different sample point. Constrained drag minimizations of the ONERA-M6 and DLR-F4 wings are exercised to demonstrate the proposed method, including low-dimensional (6 design variables) and higher-dimensional problems (up to 48 design variables). The results show that, for surrogate-based optimization of transonic wings, the proposed method is more effective than the existing parallel infilling strategies, when the number of initial sample points are in the range from N _v to 8N _v (N _v here denotes the number of design variables). Each case is repeated 50 times to eliminate the effect of randomness in our results.     

Direct generation of extended STL file from unorganized point data

An extended STL file format is presented in this paper. Differing with existing solutions, it proposes a new format to produce and store triangles. The format uses a cluster unit composed of several triangles. The main advantages of the format are that it contains both geometry and topological information and has improved storage capability. Direct generation of the extended STL from the scanned data has a great advantage in that it can reduce the time and error in modeling process. In order to obtain the format from unorganized point cloud, a new triangulation algorithm was introduced. The algorithm is based on reconstructing the relative Delaunay triangulation of the sample points on the surface. Other advantages of the extended STL format were also presented in this paper.