A critical component in a coal export supply chain is the stockyard at a terminal, as this is where coal from different mines is ''mixed'' in a stockpile before being loaded onto vessels. We develop a ...
详细信息
A critical component in a coal export supply chain is the stockyard at a terminal, as this is where coal from different mines is ''mixed'' in a stockpile before being loaded onto vessels. We develop a tree search algorithm for managing the stockyard aimed at maximizing the throughput. The algorithm relies on the analysis and use of geometric properties of a coal assembly plan when represented in a space-time diagram. A computational study establishes the efficacy of the algorithm and analyzes the merit of commonly used stockyard management rules.
This paper considers the problem of path planning for autonomous ground vehicles on highways with regular traffic. The goal is to select a desired trajectory from a set of parameterized candidate trajectories such tha...
详细信息
ISBN:
(纸本)9783952426937
This paper considers the problem of path planning for autonomous ground vehicles on highways with regular traffic. The goal is to select a desired trajectory from a set of parameterized candidate trajectories such that some criterion is optimized. This selection is subject to avoiding collisions, respecting the traffic rules, and eliciting smooth behavior for passenger comfort. The desired trajectory is fed as a state reference to a path follower which uses Model Predictive Control (MPC) to compute the steering and braking actions. This work proposes a human mimicry approach for the path planning problem by considering a Binary Decision Diagram (BDD). The binary decision diagram applies a tree search algorithm coupled with a truth table decision process. Simulation and experimental results are presented to verify the real-time feasibility and demonstrate the effectiveness of the proposed algorithm.
A fast tree-searchalgorithm for joint leak detection and localisation using surface-borne ultrasonic acoustic signals is developed through a wireless sensor network. Owing to environmental noise and multipath fading ...
详细信息
A fast tree-searchalgorithm for joint leak detection and localisation using surface-borne ultrasonic acoustic signals is developed through a wireless sensor network. Owing to environmental noise and multipath fading of ultrasonic signals, false sensor observations are frequent in the observation data. The problem is modelled as a Bayesian inference model and the maximum a posteriori solution is approximated through a tree-search structure. The algorithm initially divides the area into large cells and approximates the observation likelihood function over these large cells. In a tree structure, a large cell with high likelihood is divided into smaller cells and the tree is expanded until the required estimation precision is obtained. Simulation and experimental results reveal advantages of the proposed technique in terms of estimation error and convergence speed in comparison with other conventional Bayesian techniques such as particle filtering.
The most advanced techniques in the design of multiplierless finite impulse response (FIR) filters explore common subexpression sharing when the filter coefficients are optimized. Existing techniques, however, either ...
详细信息
The most advanced techniques in the design of multiplierless finite impulse response (FIR) filters explore common subexpression sharing when the filter coefficients are optimized. Existing techniques, however, either suffer from a heavy computational overhead, or have no guarantees on the minimal hardware cost in terms of the number of adders. A recent technique capable of designing long filters optimizes filter coefficients in pre-specified subexpression spaces. The pre-specified subexpression spaces determine if a filter with fewer adders may be achieved. Unfortunately, there is no known technique that can find subexpression spaces that can guarantee the solution with the minimum number of adders in the implementation. In this paper, a tree search algorithm is proposed to update and expand the subexpression spaces dynamically, and thus, to achieve the maximum subexpression sharing during the optimization. Numerical examples show that the proposed algorithm generates filters using fewer adders than other non-optimum algorithms. On the other hand, as a consequence of its efficiency, our proposed technique is able to design longer filters than the global optimum algorithm.
Ms. Pac-Man was developed in the 1980s, becoming one of the most popular arcade games of its time. It still has a significant following today and has recently attracted the attention of artificial intelligence researc...
详细信息
Background: Comparative genomics has become an essential approach for identifying homologous gene candidates and their functions, and for studying genome evolution. There are many tools available for genome comparison...
详细信息
Background: Comparative genomics has become an essential approach for identifying homologous gene candidates and their functions, and for studying genome evolution. There are many tools available for genome comparisons. Unfortunately, most of them are not applicable for the identification of unique genes and the inference of phylogenetic relationships in a given set of genomes. Results: GenomeBlast is a Web tool developed for comparative analysis of multiple small genomes. A new parameter called "coverage" was introduced and used along with sequence identity to evaluate global similarity between genes. With GenomeBlast, the following results can be obtained: (1) unique genes in each genome;(2) homologous gene candidates among compared genomes;(3) 2D plots of homologous gene candidates along the all pairwise genome comparisons;and (4) a table of gene presence/absence information and a genome phylogeny. We demonstrated the functions in GenomeBlast with an example of multiple herpesviral genome analysis and illustrated how GenomeBlast is useful for small genome comparison. Conclusion: We developed a Web tool for comparative analysis of small genomes, which allows the user not only to identify unique genes and homologous gene candidates among multiple genomes, but also to view their graphical distributions on genomes, and to reconstruct genome phylogeny. GenomeBlast runs on a Linux server with 4 CPUs and 4 GB memory. The online version of GenomeBlast is available to public by using a Web browser with the URL http://bioinfosrv1. ***/genomeblast/.
In this paper, an effective approach is proposed for designing discrete coefficient 2-D FIR digital filters for sampling structure conversion. After obtaining the initial continuous solution, the conventional Lagrange...
详细信息
In this paper, an effective approach is proposed for designing discrete coefficient 2-D FIR digital filters for sampling structure conversion. After obtaining the initial continuous solution, the conventional Lagrange multiplier approach associated with an appropriate tree search algorithm is used iteratively to optimize the remaining unquantized coefficients of the designed filter in the least-squares sense when one or more of the coefficients take on discrete values, till all of the filter coefficients are quantized. The method is simple and the performance is comparable with that of the existing methods.
The family of solutions, also known as 1-bases or kernels, of a finite irreflexive relation has a variety of many interesting applications. Furthermore, the decision as towhether the associated digraph posesses a solu...
详细信息
The family of solutions, also known as 1-bases or kernels, of a finite irreflexive relation has a variety of many interesting applications. Furthermore, the decision as towhether the associated digraph posesses a solution belongs to the class of computationally intractable problems known as NP-complete. In this paper we present (a) a tree search algorithm to generate the family of solutions of a digraph and (b) a dynamic programming algorithm to generate the family of solutions ranked in increasing order of their cardinality. Extensive computational experience with the tree search algorithm on more than 1000 randomly generated digraphs ranging from 50 to 150 vertices and from 15% to 60% densities has shown that the proposed algorithm is effective.
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of th...
详细信息
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances. Experimental results demonstrate the efficiency of the algorithm. Typically, an average of only 61 distance computations were made to find the nearest neighbor of a test sample among 1000 design samples.
暂无评论