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.
This study presents briefly the bolt force from finite element analysis and artificial neural network concerning the dynamic behavior and response for the bolt connection with flanges. 2D no-linear finite element (FE) analysis approach was applied and the effects of bolt bending and sharing forces were considered for the analysis of the global mechanical behaviour of the bolt joint. In order to reduce...
A kind of new five-level software architecture is presented in this paper, which is designed elaborately for ultra-large-scale rendering cloud. This software architecture consists of five levels, infrastructure layer, rendering service layer, rendering application layer, service management and access interface. Based on the proposed software architecture, we have developed a new type of rendering...
A modified earthquake prediction model based on At-value is introduced in this paper, which is improved by using the parallel computing techniques. The At-value is employed to analyze and compare the strain energy that is released in an earthquake, and gives the tempo-spatial correlation characteristics between strong earthquakes. After calculation, a picture of At-value distribution can be drawn...
Two kinds of parallel genetic algorithm (PGA) are implemented in this paper based on the MATLAB® Parallel Computing Toolbox™ and Distributed Computing Server™ software. Parallel for-loops, SPMD (Single Program Multiple Data) block and co-distributed arrays, three basic parallel programming modes in MATLAB are employed to accomplish the global and coarse-grained PGAs. To validate and compare our implementation,...
The parallel implementation of a novel mesh simplification method is introduced detailedly in this paper, which is based on a Beowulf cluster system. Taking full advantage of the distributed memory and high performance network, we can simplify out-of-core models quickly and avoid thrashing the virtual memory system. In addition, the file I/O and load balancing are also considered to make sure a near...
A parallel simplification method based on vertex clustering for out-of-core meshes is presented in this paper. To reduce file I/O, only one linear scan is performed in this method to partition the original model into equal batches. Then vertex normal vectors and coefficients of each triangle plane are calculated with some inter-task communications. The portion assigned to each processor is simplified...
With large database, the process of mining association rules is time consuming. The efficiency becomes crucial factor. By analyzing Apriori algorithm and its improvement, the improved Apriori algorithm is applied to early warning of equipment failure. Moreover, Apriori algorithm is improved by reducing the number of scanning data base and the number of candidate item-set in advance which might become...
A general parallel framework is presented in this paper for simplification of very large mesh models. This framework is implemented on a dedicated cluster. To guarantee not to thrash the virtual memory system, load balancing is performed in this framework by providing an intelligent partitioning of the inputting model using a parallel global sorting. This partitioning ensures a near optimal utilization...
An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency relationship of all points, the unit normal corresponding to each vertex can be calculated firstly. Then the algorithm adopts the octree structure to subdivide...
In this paper segmentation on both color and spatial space is implemented to compare their influence to the performance of content-based image retrieval (CBIR) system. Firstly, images are converted from RGB color space to HSV space. And then cumulative histograms on H component are extracted from four segmented blocks as one color feature of the image. At the same time, the HSV color space is further...
A new adaptive mesh simplification method based on vertex clustering is presented in this paper, which can preserve the model topology and subtle geometric features better than traditional vertex-clustering methods. Guided by the normal vectors corresponding to all vertices, the proposed method adopts a binary tree structure to split the bounding box of the inputting model adaptively. This subdivision...
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.