The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The scale of modern networks grows exponentially, challenging our ability of efficiently managing large-scale network systems. Building an efficient monitoring system for such a large-scale network to report problems is difficult because of the scale of the network. Conventional approaches based on a fixed period polling strategy cannot fast adapt to the change of network and fail to discover abnormal...
In paper[1], Yang proposed a dynamic auction algorithm under price rigidities for item allocation. The problem under consideration is a very difficult one in the sense that it is NP-Complete. The algorithm is based on a specific allocation rule and a rationing system of Rn. In this paper, we discuss a practical implementation of the algorithm and present a computer program using binary operations...
In this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces...
Data mining research has produced a significant repertoire of algorithms to predict the classification of data instances with reasonable accuracy. However, data quantity and availability is continuing to rapidly expand such that we no longer have fixed and manageable data sets, but rather continual streams of data. Mining streaming data becomes challenging when using a piece-wise or online approach,...
The glowworm swarm optimization algorithm is used to solve multi-objective optimization problem (MOP-GSO). It is shown by simulation that, MOP-GSO algorithm is effective to solve multi-objective optimization. Compared with NSGA2, it is better in term of the spread of the solutions.
This research presents a framework for coordinating multiple intelligent agents within a single virtual environment. Coordination is accomplished via a "next available agent" scheme while learning is achieved through the use of the Q-learning and Sarsa temporal difference reinforcement learning algorithms. To assess the effectiveness of each learning algorithm, experiments were conducted...
The Rapidly-exploring Random Tree (RRT) has been widely used to solve path planning problems and well suited to lots of problem domains for its probabilistically complete. However, it is not so rapid in changing environments, troubled with moving obstacles and difficult regions. In this paper, a variant of RRT is proposed which is called obstacle guided RRT (OG-RRT), aiming to plan a path in changing...
Identification of protein complexes from protein-protein interaction network has become a key problem for understanding cellular life in post-genomic era. Many computational methods have been proposed for identifying protein complexes. Up to now, the existing computational methods are mostly applied on static PPI networks. However, proteins and their interactions are dynamic in reality. Identifying...
We investigate the mean-squared error (MSE) performance of the Kiefer-Wolfowitz (KW) stochastic approximation (SA) algorithm and two of its variants, namely the scaled-and-shifted KW (SSKW) in Broadie, Cicek, and Zeevi (2011) and Kesten's rule. We conduct a sensitivity analysis of KW with various tuning sequences and initial start values and implement the algorithms for two contrasting functions....
Movement data have been widely collected from GPS and sensors, allowing us to analyze how moving objects interact in terms of space and time and to learn about the relationships that exist among the objects. In this paper, we investigate an interesting relationship that has not been adequately studied so far: the following relationship. Intuitively, a follower has similar trajectories as its leader...
This paper presents a method of trajectory planning and design for Unmanned Aerial Vehicle (UAV) based on the A∗ algorithm. Using grids to process the trajectory path planning of UAV under the environment with presence of obstacles, and then find the shortest path from the initial point to the target point based on rasterized environment using A∗ algorithm. The simulation of trajectory planning is...
Age estimation is a complex issue of multiclassification or regression. To address a common problem of uneven distribution of age database, this paper shows a hierarchic age estimation system, comprising age group and specific age estimation. In our system, two novel classifiers, Sequence K-Nearest Neighbor (SKNN) and Ranking-KNN, are introduced to predict age group and age value respectively. Notably,...
The main subject of this thesis is to study a single axis double, two-wheeled self-balancing vehicle system. The circuit part of this system is mainly composed of attitude sensors parts (including Gyroscope and Accelerometer), control circuit and the driver board. Firstly attitude sensors measure Car's tilt angle and the changing rate of Car's inclination, and then the controller calculates the appropriate...
As a fundamental problem, reach ability query has been always the research emphasis in many applications in the near 20 years. Especially with the coming of the big data era, its efficiency plays a critical role. Although there are many research results for this issue, they all reach a scalability bottleneck. In this paper, we propose an index structure utilizing community center, i.e. to select a...
How to optimally place the tenant replication data to retain the load-balance and reduce cost of communication and distributed transaction, it is an important issue to achieve the high performance and availability of multi-tenant data, there are plenty of issues need to be solved. This paper proposes the Multi-Objective Genetic Algorithm. It uses a rank-based fitness assignment method for MOGAs to...
The exemplar breakpoint distance problem (EBD for short) is NP-hard, even when one of the genomes, called G_1, has no repetition, and the other genome, called G_2, has genes that appear at most twice in the genome ((1, 2)-Exemplar Breakpoint Distance Problem or EBD(1, 2) for short). Unless P=NP, there is no polynomial time algorithm for EBD(1, 2). In this paper, we focus on unsigned EBD(1, 2), where...
Path planning is an optimal problem how to plan optimal flight path of unmanned aerial vehicle (UAV) in the complex environment of war. A hybrid group search optimizer (GSO) with differential evolution (DE) is proposed to solve UAV path planning problem. Firstly, GSO is applied to update flight path of UAV by the search angle and the distance. DE is used to modify the feasible path of UAV within the...
With the increasing of data in the network, and mainly using the fault-tolerance of replication, the Cloud Storage will be hard to satisfied requirements of storing all data. To improve the data fault-tolerance of cloud storage, we propose a dynamic data fault-tolerance for cloud storage (DDFMCS) that dynamically determines the data fault tolerance mechanisms by the file access frequency ratio stored...
In this paper, we propose a logic-based Benders decomposition (LBBD), as well as an LBBD/gossip method to solve the heterogeneous multi-vehicle routing problem (HMVRP). HMVRP is a newly formalized extension of the NP-hard multi-traveling salesman problem (mTSP). First, a hybrid algorithm based on LBBD is formulated that decomposes the HMVRP into an assignment problem and a cluster of sequencing problems...
Conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.