In the proposed system for online inspection of steel balls, a diffuse illumination is developed to enhance defect appearances and produce high quality images. To fully view the entire sphere, a novel unfolding method...In the proposed system for online inspection of steel balls, a diffuse illumination is developed to enhance defect appearances and produce high quality images. To fully view the entire sphere, a novel unfolding method is put forward based on geometrical analysis, which only requires one-dimensional movement of the balls and a pair of cameras to capture images from different directions. Moreover, a realtime inspection algorithm is customized to improve both accuracy and efficiency. The precision and recall of the sample set were 87.7% and 98%, respectively. The average time cost on image processing and analysis for a steel ball was 47 ms, and the total time cost was less than 200 ms plus the cost of image acquisition and balls' movement. The system can sort 18 000 balls per hour with a spatial resolution higher than 0.01 mm.展开更多
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linea...This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.展开更多
The seismic analysis of a rigid-framed prestressed concrete bridge in Tianjin Light Railway is performed. A 3-D dynamic finite element model of the bridge is established considering the weakening effect caused by the ...The seismic analysis of a rigid-framed prestressed concrete bridge in Tianjin Light Railway is performed. A 3-D dynamic finite element model of the bridge is established considering the weakening effect caused by the soft soil foundation. After the dynamic characteristics are calculated in terms of natural frequencies and modes, the seismic analysis is carried out using the modal response spectrum method and the time-history method, respectively. Based on the calculated results, the reasonable design values are finally suggested as the basis of the seismic design of the bridge, and meanwhile the problems encountered were also analyzed. Finally, some conclusions are drawn as: 1) Despite the superiority of rigid-framed prestressed concrete bridge, the upper and lower ends of the piers of the bridge are proved to be the crucial parts of the bridge, which are easily destroyed under designed earthquake excitations and should be carefully analyzed and designed; 2) The soft soil foundation can possibly result in rather weakening of the lateral rigidity of the rigid-framed bridge, and should be paid considerable attention; 3) The modal response spectrum method, combined with time-history method, is suggested for the seismic analysis in engineering design of the rigid-framed prestressed concrete bridge.展开更多
A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a...A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.展开更多
A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex s...A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.展开更多
Detection and clarification of cause-effect relationships among variables is an important problem in time series analysis. Traditional causality inference methods have a salient limitation that the model must be linea...Detection and clarification of cause-effect relationships among variables is an important problem in time series analysis. Traditional causality inference methods have a salient limitation that the model must be linear and with Gaussian noise. Although additive model regression can effectively infer the nonlinear causal relationships of additive nonlinear time series, it suffers from the limitation that contemporaneous causal relationships of variables must be linear and not always valid to test conditional independence relations. This paper provides a nonparametric method that employs both mutual information and conditional mutual information to identify causal structure of a class of nonlinear time series models, which extends the additive nonlinear times series to nonlinear structural vector autoregressive models. An algorithm is developed to learn the contemporaneous and the lagged causal relationships of variables. Simulations demonstrate the effectiveness of the nroosed method.展开更多
A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider...A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.展开更多
文摘In the proposed system for online inspection of steel balls, a diffuse illumination is developed to enhance defect appearances and produce high quality images. To fully view the entire sphere, a novel unfolding method is put forward based on geometrical analysis, which only requires one-dimensional movement of the balls and a pair of cameras to capture images from different directions. Moreover, a realtime inspection algorithm is customized to improve both accuracy and efficiency. The precision and recall of the sample set were 87.7% and 98%, respectively. The average time cost on image processing and analysis for a steel ball was 47 ms, and the total time cost was less than 200 ms plus the cost of image acquisition and balls' movement. The system can sort 18 000 balls per hour with a spatial resolution higher than 0.01 mm.
文摘This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.
文摘The seismic analysis of a rigid-framed prestressed concrete bridge in Tianjin Light Railway is performed. A 3-D dynamic finite element model of the bridge is established considering the weakening effect caused by the soft soil foundation. After the dynamic characteristics are calculated in terms of natural frequencies and modes, the seismic analysis is carried out using the modal response spectrum method and the time-history method, respectively. Based on the calculated results, the reasonable design values are finally suggested as the basis of the seismic design of the bridge, and meanwhile the problems encountered were also analyzed. Finally, some conclusions are drawn as: 1) Despite the superiority of rigid-framed prestressed concrete bridge, the upper and lower ends of the piers of the bridge are proved to be the crucial parts of the bridge, which are easily destroyed under designed earthquake excitations and should be carefully analyzed and designed; 2) The soft soil foundation can possibly result in rather weakening of the lateral rigidity of the rigid-framed bridge, and should be paid considerable attention; 3) The modal response spectrum method, combined with time-history method, is suggested for the seismic analysis in engineering design of the rigid-framed prestressed concrete bridge.
基金National Natural Science Foundation of China(No.10971025)
文摘A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.
文摘A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
基金supported by the National Natural Science Foundation of China under Grant Nos.60972150 and 10926197
文摘Detection and clarification of cause-effect relationships among variables is an important problem in time series analysis. Traditional causality inference methods have a salient limitation that the model must be linear and with Gaussian noise. Although additive model regression can effectively infer the nonlinear causal relationships of additive nonlinear time series, it suffers from the limitation that contemporaneous causal relationships of variables must be linear and not always valid to test conditional independence relations. This paper provides a nonparametric method that employs both mutual information and conditional mutual information to identify causal structure of a class of nonlinear time series models, which extends the additive nonlinear times series to nonlinear structural vector autoregressive models. An algorithm is developed to learn the contemporaneous and the lagged causal relationships of variables. Simulations demonstrate the effectiveness of the nroosed method.
基金supported by the Minister of Science and Higher Education of Poland (Grant No. JP2010009070)
文摘A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.
