This paper calculates the finite element stiffness of a rotating shaft with a straight-fronted slant crack based on neutral axis method. In a steady rotation cycle, a 45-degree straight-fronted slant breathing crack i...
详细信息
Parallel corpora are essential resources for the construction of bilingual term dictionary of historical classics. To obtain large-scale parallel corpora, this paper proposes a sentence alignment method based on mode ...
详细信息
A novel palmprint recognition method based on sparse two-dimensional local discriminant projections (S2DLDP) is proposed. After a description of the basic theory and resolution method for S2DLDP, the paper presents th...
详细信息
In consideration of the different servicing types and various orbital spatial relationships, the paper proposes an orbital maneuver strategies model of on-orbit service vehicle (OSV) based on multiple decision variabl...
详细信息
In some scattered point cloud triangular mesh restoration algorithm, small triangular mesh holes problem will often affect the quality of the model. For small holes at the details, this paper propose a method for iden...
详细信息
In some scattered point cloud triangular mesh restoration algorithm, small triangular mesh holes problem will often affect the quality of the model. For small holes at the details, this paper propose a method for identifying and extracting hollow edge,and use a triangle growth way based on boundary edge angle to fill the empty void. First, according the relationship of the point, side and face of the triangle mesh model to identify the hole, then extracting the holes boundary edge and classifying it. Finally, using a triangle growth method based on holes boundary edge angle to fill each small holes separated from the boundary. Compared with other algorithm of filling holes, this method is high efficiency for small holes of smooth surface,and itimprovesthe quality of the triangular mesh model.
In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary...
详细信息
In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary codingatthebeginning of the coding;we use multi-point crossoverto replace the originalsingle-point ***, theexperimentshows that the improved genetic algorithmnot only has a strong search capability, but also thestability has been effectively improved.
We propose a new concept design about carbon-free vacuum cleaner. The carbon-free vacuum cleaner moves under the act of external forces instead of the motor, and transmits the rotation speed from low to the ideal spee...
详细信息
Plant growth simulation algorithm (PGSA) is a kind of bionic intelligent optimization algorithm. Based on the plant phototropism as heuristic criterion, this algorithm takes the feasible region of different optimizati...
详细信息
The key frames extraction technique extracts key postures to describe the original motion sequence, which has been widely used in motion compression, motion retrieval, motion edition and so on. In this paper, we propo...
The key frames extraction technique extracts key postures to describe the original motion sequence, which has been widely used in motion compression, motion retrieval, motion edition and so on. In this paper, we propose a method based on the amplitude of curve to find key frames in a motion captured sequence. First we select a group of joint distance features to represent the motion and adopt the Principal Component Analysis (PCA) method to obtain the one dimension principal component as a features curve which will be used. Then we gain the initial key-frames by extracting the local optimum points in the curve. At last, we get the final key frames by inserting frames based on the amplitude of the curve and merging key frames too close. A number of experimental examples demonstrate that our method is practicable and efficient not only in the visual performance but also in the aspect of the compression ratio and error rate.
A network motif is a recurring subnetwork within a network, and it takes on certain functions in practical biological macromolecule applications. Previous algorithms have focused on the computational efficiency of net...
详细信息
A network motif is a recurring subnetwork within a network, and it takes on certain functions in practical biological macromolecule applications. Previous algorithms have focused on the computational efficiency of network motif detection, but some problems in storage space and searching time manifested during earlier studies. The considerable computational and spacial complexity also presents a significant challenge. In this paper, we provide a new approach for motif mining based on compressing the searching space. According to the characteristic of the parity nodes, we cut down the searching space and storage space in real graphs and random graphs, thereby reducing the computational cost of verifying the isomorphism of sub-graphs. We obtain a new network with smaller size after removing parity nodes and the "repeated edges" connected with the parity nodes. Random graph structure and sub-graph searching are based on the Back Tracking Method; all sub-graphs can be searched for by adding edges progressively. Experimental results show that this algorithm has higher speed and better stability than its alternatives.
暂无评论