In this paper, we consider rainbow connection number of maximal outerplanar graphs (MOPS) on algorithmic aspect. For the (MOP) G, we give sufficient conditions to guarantee that rc(G) = diam(G). Moreover, we produce t...
详细信息
In this paper, we consider rainbow connection number of maximal outerplanar graphs (MOPS) on algorithmic aspect. For the (MOP) G, we give sufficient conditions to guarantee that rc(G) = diam(G). Moreover, we produce the graph with given diameter D and give their rainbow coloring in linear time. X. Deng et al. [4] give a polynomial time algorithm to compute the rainbow connection number of MOPS by the Maximal fan partition method, but only obtain a compact upper bound. J. Lauri [11] proved that, for chordal outerplanar graphs given an edge-coloring, to verify whether it is rainbow connected is NP-complete under the coloring, it is so for MOPs. Therefore we construct Central-cut spine of MOP G, by which we design an algorithm to give a rainbow edge coloring with at most 2rad(G) + 2 + c, 0 <= c <= rad(G) - 2 colors in polynomial time. (C) 2016 Elsevier B.V. All rights reserved.
An algorithm is presented that converts an object, defined by a set of intersecting planar faces, to a set of nonintersecting faces — that is, it splits the faces that intersect each other into several smaller faces ...
详细信息
An algorithm is presented that converts an object, defined by a set of intersecting planar faces, to a set of nonintersecting faces — that is, it splits the faces that intersect each other into several smaller faces that touch only at common edges and vertices. All singularities are handled in a uniform manner. The algorithm is currently used as a preprocessor for a hidden-line algorithm and as a component of a solid modeller.
Reaction classification has important applications, and many approaches to classification have been applied. Our own algorithm tests all maximum common substructures (MCS) between all reactant and product molecules in...
详细信息
Reaction classification has important applications, and many approaches to classification have been applied. Our own algorithm tests all maximum common substructures (MCS) between all reactant and product molecules in order to find an atom mapping containing the minimum chemical distance (MCD). Recent publications have concluded that new MCS algorithms need to be compared with existing methods in a reproducible environment, preferably on a generalized test set, yet the number of test sets available is small, and they are not truly representative of the range of reactions that occur in real reaction databases. We have designed a challenging test set of reactions and are making it publicly available and usable with InfoChem's software or other classification algorithms. We supply a representative set of example reactions, grouped into different levels of difficulty, from a large number of reaction databases that chemists actually encounter in practice, in order to demonstrate the basic requirements for a mapping algorithm to detect the reaction centers in a consistent way. We invite the scientific community to contribute to the future extension and improvement of this data set, to achieve the goal of a common standard.
In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn't everywhere different...
详细信息
In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn't everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper have smaller amount of computation, quicker convergence rate than the gradient method and conjugate direction method in some sense.
This paper briefly surveys the recent progress on visual perception algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian...
详细信息
This paper briefly surveys the recent progress on visual perception algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian detection, lane detection and drivable surface detection are presented as three important applications for visual perception. On the other hand, CPU, GPU, FPGA and ASIC are discussed as the major components to form an efficient hardware platform for real-time operation. Finally, several technical challenges are presented to motivate future research and development in the field.
We consider the problem of decomposing a semisimple Lie algebra defined over a field of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Cartan suba...
详细信息
We consider the problem of decomposing a semisimple Lie algebra defined over a field of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Cartan subalgebra. An implementation of the algorithm in the system ELIAS is discussed at the end of the paper.
The commercially available impact echo assessment is effective in assessing flaws in concrete but the evaluation is manual, thus, to evaluate large area by this method is neither practical nor cost effective. In order...
详细信息
The commercially available impact echo assessment is effective in assessing flaws in concrete but the evaluation is manual, thus, to evaluate large area by this method is neither practical nor cost effective. In order to enhance the method in application to reinforced concrete slab such as bridge decks, where duration of investigation plays substantial influence on traffic activity, data analysis and interpretation should not only be rapid and objective but also should provide automatic documentation of assessment results straight away at the end of the investigation. This research paper describes a new approach for impact echo method with automatic interpretation of signal through an algorithm. The algorithm detects the defect;calculates its depth and the assessment result is presented in 2D view instantaneously. The algorithm is verified by means of an experimental study, which is conducted with four reinforced concrete slabs incorporating induced delamination, void and honeycombing. A software named Imco@slab is developed based on this algorithm. Finally, a field study over reinforced concrete slab using this software has been conducted and its applicability in practical sense is verified. The field study shows that the discrepancy in assessment by Imco@slab interpretation with hammer tapping method and conventional manual impact echo method is negligible. This software is applicable in assessing delamination and void defects in reinforced concrete slabs.
The paper presents an algorithm for calculating the three-dimensional Voronoi-Delaunay tessellation for an ensemble of spheres of different radii (additively-weighted Voronoi diagram). Data structure and output of the...
详细信息
The paper presents an algorithm for calculating the three-dimensional Voronoi-Delaunay tessellation for an ensemble of spheres of different radii (additively-weighted Voronoi diagram). Data structure and output of the algorithm is oriented toward the exploration of the voids between the spheres. The main geometric construct that we develop is the Voronoi S-network (the network of vertices and edges of the Voronoi regions determined in relation to the surfaces of the spheres). General scheme of the algorithm and the key points of its realization are discussed. The principle of the algorithm is that for each determined site of the network we find its neighbor sites. Thus, starting from a known site of the network, we sequentially find the whole network. The starting site of the network is easily determined based on certain considerations. Geometric properties of ensembles of spheres of different radii are discussed, the conditions of applicability and limitations of the algorithm are indicated. The algorithm is capable of working with a wide variety of physical models, which may be represented as sets of spheres, including computer models of complex molecular systems. Emphasis was placed on the issue of increasing the efficiency of algorithm to work with large models (tens of thousands of atoms). It was demonstrated that the experimental CPU time increases linearly with the number of atoms in the system, O(n). (C) 2006 Wiley Periodicals, Inc.
The problems of finding minimum-cost and maximum-cost sets of edge-disjoint cycles in a weighted undirected graph are studied. The importance of this problem is that it presents a 'middle station' in two reduc...
详细信息
The problems of finding minimum-cost and maximum-cost sets of edge-disjoint cycles in a weighted undirected graph are studied. The importance of this problem is that it presents a 'middle station' in two reductions for planar graphs - one between the max-cut problem and that of max-weight matching, and the other between the Chinese Postman Problem and max-weight matching. The introduction of negative edge costs makes the reductions simple and efficient. We obtain new simpler algorithms for these two problems for planar graphs (where the max-weight matching problem can be solved very efficiently). We conclude that, in the case of planar weighted graphs (with arbitrary costs), all the three problems are mutually reducible and equivalent in terms of complexity.
Establishing the neighbor list to efficiently calculate the inter-atomic forces consumes the majority of computation time in molecular dynamics (MD) simulation. Several algorithms have been proposed to improve the com...
详细信息
Establishing the neighbor list to efficiently calculate the inter-atomic forces consumes the majority of computation time in molecular dynamics (MD) simulation. Several algorithms have been proposed to improve the computation efficiency for short-range interaction in recent years, although an optimized numerical algorithm has not been provided. Based on a rigorous definition of Verlet radius with respect to temperature and list-updating interval in MD simulation, this paper has successfully developed an estimation formula of the computation time for each MD algorithm calculation so as to find an optimized performance for each algorithm. With the formula proposed here, the best algorithm can be chosen based on different total number of atoms, system average density and system average temperature for the MD simulation. It has been shown that the Verlet Cell-linked List (VCL) algorithm is better than other algorithms for a system with a large number of atoms. Furthermore, a generalized VCL algorithm optimized with a list-updating interval and cell-dividing number is analyzed and has been verified to reduce the computation time by 30 similar to 60% in a MD simulation for a two-dimensional lattice system. Due to similarity, the analysis in this study can be extended to other many-particle systems. (C) 2007 Elsevier B.V. All rights reserved.
暂无评论