Design Optimization of CFRP Stacking Sequence Using a Multi-Island Genetic Algorithms Under Low-velocity Impact Loads

A method to improve the low-velocity impact performance of composite laminate is proposed, and a multi-island genetic algorithm is used for the optimization of composite laminate stacking sequence under low-velocity impact loads based on a 2D dynamic impact finite element analysis. Low-velocity impact tests and compression-after impact（CAI） tests have been conducted to verify the effectiveness of optimization method. Experimental results show that the impact damage areas of the optimized laminate have been reduced by 42.1% compared to the baseline specimen, and the residual compression strength has been increased by 10.79%, from baseline specimen 156.97 MPa to optimized 173.91 MPa. The tests result shows that optimization method can effectively enhance the impact performances of the laminate.

The 20 April 2013 Lushan, Sichuan, mainshock, and its aftershock sequence: tectonic implications

Using the double-difference relocation algo- rithm, we relocated the 20 April 2013 Lushan, Sichuan, earthquake （Ms 7.0）, and its 4,567 aftershocks recorded during the period between 20 April and May 3, 2013. Our results showed that most aftershocks are relocated between 10 and 20 km depths, but some large aftershocks were relocated around 30 krn depth and small events extended upward near the surface. Vertical cross sections illustrate a shovel-shaped fault plane with a variable dip angle from the southwest to northeast along the fault. Furthermore, the dip angle of the fault plane is smaller around the mainshock than that in the surrounding areas along the fault. These results suggest that it may be easy to generate the strong earthquake in the place having a small dip angle of the fault, which is somewhat similar to the genesis of the 2008 Wenchuan earthquake. The Lushan mainshock is underlain by the seismically anomalous layers with low-Vp, low-Vs, and high-Poisson＇s ratio anomalies, possibly suggesting that the fluid-filled fractured rock matrices might signifi- cantly reduce the effective normal stress on the fault plane to bring the brittle failure. The seismic gap between Lushan and Wenchuan aftershocks is suspected to be vulnerable to future seismic risks at greater depths, if any.

A new insertion sequence for incremental Delaunay triangulation

Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.

A Service Composition Approach Based on Sequence Mining for Migrating E-learning Legacy System to SOA

With the fast development of business logic and information technology, today＇s best solutions are tomorrow＇s legacy systems. In China, the situation in the education domain follows the same path. Currently, there exists a number of e-learning legacy assets with accumulated practical business experience, such as program resource, usage behaviour data resource, and so on. In order to use these legacy assets adequately and efficiently, we should not only utilize the explicit assets but also discover the hidden assets. The usage behaviour data resource is the set of practical operation sequences requested by all users. The hidden patterns in this data resource will provide users＇ practical experiences, which can benefit the service composition in service-oriented architecture （SOA） migration. Namely, these discovered patterns will be the candidate composite services （coarse-grained） in SOA systems. Although data mining techniques have been used for software engineering tasks, little is known about how they can be used for service composition of migrating an e-learning legacy system （MELS） to SOA. In this paper, we propose a service composition approach based on sequence mining techniques for MELS. Composite services found by this approach will be the complementation of business logic analysis results of MELS. The core of this approach is to develop an appropriate sequence mining algorithm for mining related data collected from an e-learning legacy system. According to the features of execution trace data on usage behaviour from this e-learning legacy system and needs of further pattern analysis, we propose a sequential mining algorithm to mine this kind of data of tile legacy system. For validation, this approach has been applied to the corresponding real data, which was collected from the e-learning legacy system; meanwhile, some investigation questionnaires were set up to collect satisfaction data. The investigation result is 90% the same with the result obtained through our approach.

STACKING SEQUENCE OPTIMIZA-TION OF LAMINATED COMPOSITE CYLINDER SHELL FOR MAXIMAL BUCKLING LOAD

A new optimization method for the optimization of stacking of composite glass fiber laminates is developed. The fiber orientation and angle of the layers of the cylindrical shells are sought considering the buckling load. The proposed optimization algorithm applies both finite element analysis and the mode-pursuing sampling （MPS）method. The algorithms suggest the optimal stacking sequence for achieving the maximal buckling load. The procedure is implemented by integrating ANSYS and MATLAB. The stacking sequence designing for the symmetric angle-ply three-layered and five-layered composite cylinder shells is presented to illustrate the optimization process, respectively. Compared with the genetic algorithms, the proposed optimization method is much faster and efficient for composite staking sequence plan.

Using Cluster Computers in Bioinformatics Research

In the last ten years, high-performance and massively parallel computing technology comes into a high speed developing phase and is used in all fields. The cluster computer systems are also being widely used for their low cost and high performance. In bioinformatics research, solving a problem with computer usually takes hours even days. To speed up research, high-performance cluster computers are considered to be a good platform. Moving into the new MPP (massively parallel processing) system, the original algorithm should be parallelized in a proper way. In this paper, a new parallelizing method of useful sequence alignment algorithm (Smith-Waterman) is designed based on its optimizing algorithm already exists. The result is gratifying.

RSMD-repeat searcher and motif detector

The functionality of a gene or a protein depends on codon repeats occurring in it.As a consequence of their vitality in protein function and apparent involvement in causing diseases,an interest in these repeats has developed in recent years.The analysis of genomic and proteomic sequences to identify such repeats requires some algorithmic support from informatics level.Here,we proposed an offline stand-alone toolkit Repeat Searcher and Motif Detector（RSMD）,which uncovers and employs few novel approaches in identification of sequence repeats and motifs to understand their functionality in sequence level and their disease causing tendency.The tool offers various features such as identifying motifs,repeats and identification of disease causing repeats.RSMD was designed to provide an easily understandable graphical user interface（GUI）,for the tool will be predominantly accessed by biologists and various researchers in all platforms of life science.GUI was developed using the scripting language Perl and its graphical module PerlTK.RSMD covers algorithmic foundations of computational biology by combining theory with practice.

VCSRA:A fast and accurate multiple sequence alignment algorithm with a high degree of parallelism

Multiple sequence alignment （MSA） is the alignment among more than two molecular biological sequences, which is a fundamental method to analyze evolutionary events such as mutations, insertions, deletions, and re-arrangements. In theory, a dynamic programming algorithm can be employed to produce the optimal MSA. However, this leads to an explosive increase in computing time and memory consumption as the number of sequences increases （Taylor, 1990）. So far, MSA is still regarded as one of the most challenging problems in bioinformatics and computational biology （Chatzou et al., 2016）.

Facility Layout Based on Sequence Analysis:Design of Flowshops

A computer-aided method to design a hybrid layout--tree-shape planar flowlines is presented. In newtype fiowshop layout, the common machines shared by several flowlines could be located together in functional sections. The approach combines traditional cell formation techniques with sequence alignment algorithms. Firstly, a sequence analysis based cell formation procedure is adopted; then the operation sequences for parts are aligned to maximize machines adjacency in hyperedge representations; finally a tree-shape planar flowline will be obtained for each part family. With the help of a sample of operation sequences obtained from industry, this algorithm is illustrated.

Generation method of minimal-complete-coverage interoperability test sequence based on digraph

Even if two implementations of a protocol pass the conformance testing,it cannot guarantee that they can interoperate properly;so direct testing of interoperation is considered indispensable.During the interoperability testing,a minimal number of test sequences are expected to check as many as possible implementation errors.By using minimal-complete-coverage criterion,the test sequence generation based on digraph can produce more effective test sequences.