**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**497

# Search results for: shapebased sequence

##### 497 Optimization of Supersonic Ejector via Sequence-Adapted Micro-Genetic Algorithm

**Authors:**
Kolar Jan,
Dvorak Vaclav

**Abstract:**

In this study, an optimization of supersonic air-to-air ejector is carried out by a recently developed single-objective genetic algorithm based on adaption of sequence of individuals. Adaptation of sequence is based on Shape-based distance of individuals and embedded micro-genetic algorithm. The optimal sequence found defines the succession of CFD-aimed objective calculation within each generation of regular micro-genetic algorithm. A spring-based deformation mutates the computational grid starting the initial individualvia adapted population in the optimized sequence. Selection of a generation initial individual is knowledge-based. A direct comparison of the newly defined and standard micro-genetic algorithm is carried out for supersonic air-to-air ejector. The only objective is to minimize the loose of total stagnation pressure in the ejector. The result is that sequence-adopted micro-genetic algorithm can provide comparative results to standard algorithm but in significantly lower number of overall CFD iteration steps.

**Keywords:**
Grid deformation,
Micro-genetic algorithm,
shapebased
sequence,
supersonic ejector.

##### 496 Multiple Sequence Alignment Using Optimization Algorithms

**Authors:**
M. F. Omar,
R. A. Salam,
R. Abdullah,
N. A. Rashid

**Abstract:**

Proteins or genes that have similar sequences are likely to perform the same function. One of the most widely used techniques for sequence comparison is sequence alignment. Sequence alignment allows mismatches and insertion/deletion, which represents biological mutations. Sequence alignment is usually performed only on two sequences. Multiple sequence alignment, is a natural extension of two-sequence alignment. In multiple sequence alignment, the emphasis is to find optimal alignment for a group of sequences. Several applicable techniques were observed in this research, from traditional method such as dynamic programming to the extend of widely used stochastic optimization method such as Genetic Algorithms (GAs) and Simulated Annealing. A framework with combination of Genetic Algorithm and Simulated Annealing is presented to solve Multiple Sequence Alignment problem. The Genetic Algorithm phase will try to find new region of solution while Simulated Annealing can be considered as an alignment improver for any near optimal solution produced by GAs.

**Keywords:**
Simulated annealing,
genetic algorithm,
sequence alignment,
multiple sequence alignment.

##### 495 Parallezation Protein Sequence Similarity Algorithms using Remote Method Interface

**Authors:**
Mubarak Saif Mohsen,
Zurinahni Zainol,
Rosalina Abdul Salam,
Wahidah Husain

**Abstract:**

One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computationally intensive task. Sequence comparison is the basic step for all algorithms in protein sequences similarity. Parallel computing is an attractive solution to provide the computational power needed to speedup the lengthy process of the sequence comparison. Our main research is to enhance the protein sequence algorithm using dynamic programming method. In our approach, we parallelize the dynamic programming algorithm using multithreaded program to perform the sequence comparison and also developed a distributed protein database among many PCs using Remote Method Interface (RMI). As a result, we showed how different sizes of protein sequences data and computation of scoring matrix of these protein sequence on different number of processors affected the processing time and speed, as oppose to sequential processing.

**Keywords:**
Protein sequence algorithm,
dynamic programming algorithm,
multithread

##### 494 Software Evolution Based Sequence Diagrams Merging

**Authors:**
Zine-Eddine Bouras,
Abdelouaheb Talai

**Abstract:**

**Keywords:**
System behaviors,
sequence diagram merging,
dependence analysis,
sequence diagram slicing.

##### 493 A New Class F2 (M, 0, N)L„ p)F of The Double Difference Sequences of Fuzzy Numbers

**Authors:**
N. Subramanian,
C. Murugesan

**Abstract:**

The double difference sequence space I2 (M, of fuzzy numbers for both 1 < p < oo and 0 < p < 1, is introduced. Some general properties of this sequence space are studied. Some inclusion relations involving this sequence space are obtained.

**Keywords:**
Orlicz function,
solid space,
metric space,
completeness

##### 492 An Improved Fast Search Method Using Histogram Features for DNA Sequence Database

**Authors:**
Qiu Chen,
Feifei Lee,
Koji Kotani,
Tadahiro Ohmi

**Abstract:**

**Keywords:**
Fast search,
DNA sequence,
Histogram feature,
Smith-Waterman algorithm,
Local search

##### 491 Identifying New Sequence Features for Exon-Intron Discrimination by Rescaled-Range Frameshift Analysis

**Authors:**
Sing-Wu Liou,
Yin-Fu Huang

**Abstract:**

**Keywords:**
Exon-Intron Discrimination,
Rescaled-Range Frameshift Analysis,
Frameshift Sensitivity,
Accumulative Sequence Complexity

##### 490 Interactive Model Based On an Extended CPN

**Authors:**
Shuzhen Yao,
Fengjing Zhao,
Jianwei He

**Abstract:**

The UML modeling of complex distributed systems often is a great challenge due to the large amount of parallel real-time operating components. In this paper the problems of verification of such systems are discussed. ECPN, an Extended Colored Petri Net is defined to formally describe state transitions of components and interactions among components. The relationship between sequence diagrams and Free Choice Petri Nets is investigated. Free Choice Petri Net theory helps verifying the liveness of sequence diagrams. By converting sequence diagrams to ECPNs and then comparing behaviors of sequence diagram ECPNs and statecharts, the consistency among models is analyzed. Finally, a verification process for an example model is demonstrated.

**Keywords:**
Consistency,
liveness,
Petri Net,
sequence diagram.

##### 489 Sequence Relationships Similarity of Swine Influenza a (H1N1) Virus

**Authors:**
Patsaraporn Somboonsak,
Mud-Armeen Munlin

**Abstract:**

**Keywords:**
Sequence DNA,
Relationship of swine,
Swineinfluenza,
Sequence Similarity

##### 488 On Some Subspaces of Entire Sequence Space of Fuzzy Numbers

**Authors:**
T. Balasubramanian,
A. Pandiarani

**Abstract:**

In this paper we introduce some subspaces of fuzzy entire sequence space. Some general properties of these sequence spaces are discussed. Also some inclusion relation involving the spaces are obtained. Mathematics Subject Classification: 40A05, 40D25.

**Keywords:**
Fuzzy Numbers,
Entire sequences,
completeness,
Fuzzy entire sequences

##### 487 The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups

**Authors:**
M. Heydari,
S. A. Torabi

**Abstract:**

**Keywords:**
Economic lot scheduling problem,
finite horizon,
genetic algorithm,
mixed zero-one nonlinear programming,
sequence-dependent.

##### 486 Symbolic Model Checking of Interactions in Sequence Diagrams with Combined Fragments by SMV

**Authors:**
Yuka Kawakami,
Tomoyuki Yokogawa,
Hisashi Miyazaki,
Sousuke Amasaki,
Yoichiro Sato,
Michiyoshi Hayase

**Abstract:**

In this paper, we proposed a method for detecting consistency violation between state machine diagrams and a sequence diagram defined in UML 2.0 using SMV. We extended a method expressing these diagrams defined in UML 1.0 with boolean formulas so that it can express a sequence diagram with combined fragments introduced in UML 2.0. This extension made it possible to represent three types of combined fragment: alternative, option and parallel. As a result of experiment, we confirmed that the proposed method could detect consistency violation correctly with SMV.

**Keywords:**
UML,
model checking,
SMV,
sequence diagram.

##### 485 Fixed Point of Lipschitz Quasi Nonexpansive Mappings

**Authors:**
M. Moosavi,
H. Khatibzadeh

**Abstract:**

In this article, we study demiclosed and strongly quasi-nonexpansive of a sequence generated by the proximal point algorithm for a finite family of quasi-nonexpansive mappings in Hadamard spaces. Δ-convergence of iterations for the sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them to a common fixed point of sequence are also established. Our results generalize and improve several previously known results of the existing literature.

**Keywords:**
Fixed point,
Hadamard space,
proximal point algorithm,
quasi-nonexpansive sequence of mappings,
resolvent.

##### 484 On the Central Limit Theorems for Forward and Backward Martingales

**Authors:**
Yilun Shang

**Abstract:**

**Keywords:**
central limit theorem,
martingale difference sequence,
backward martingale.

##### 483 Computer Aided Assembly Attributes Retrieval Methods for Automated Assembly Sequence Generation

**Authors:**
M. V. A. Raju Bahubalendruni,
Bibhuti Bhusan Biswal,
B. B. V. L. Deepak

**Abstract:**

Achieving an appropriate assembly sequence needs deep verification for its physical feasibility. For this purpose, industrial engineers use several assembly predicates; namely, liaison, geometric feasibility, stability and mechanical feasibility. However, testing an assembly sequence for these predicates requires huge assembly information. Extracting such assembly information from an assembled product is a time consuming and highly skillful task with complex reasoning methods. In this paper, computer aided methods are proposed to extract all the necessary assembly information from computer aided design (CAD) environment in order to perform the assembly sequence planning efficiently. These methods use preliminary capabilities of three-dimensional solid modelling and assembly modelling methods used in CAD software considering equilibrium laws of physical bodies.

**Keywords:**
Assembly automation,
assembly attributes,
assembly sequence generation,
computer aided design.

##### 482 Predicting Protein Function using Decision Tree

**Authors:**
Manpreet Singh,
Parminder Kaur Wadhwa,
Surinder Kaur

**Abstract:**

**Keywords:**
Sequence Derived Features,
decision tree.

##### 481 M-ary Chaotic Sequence Based SLM-OFDM System for PAPR Reduction without Side-Information

**Authors:**
A.Goel,
M. Agrawal,
P. Gupta Poddar

**Abstract:**

Selected Mapping (SLM) is a PAPR reduction technique, which converts the OFDM signal into several independent signals by multiplication with the phase sequence set and transmits one of the signals with lowest PAPR. But it requires the index of the selected signal i.e. side information (SI) to be transmitted with each OFDM symbol. The PAPR reduction capability of the SLM scheme depends on the selection of phase sequence set. In this paper, we have proposed a new phase sequence set generation scheme based on M-ary chaotic sequence and a mapping scheme to map quaternary data to concentric circle constellation (CCC) is used. It is shown that this method does not require SI and provides better SER performance with good PAPR reduction capability as compared to existing SLMOFDM methods.

**Keywords:**
Orthogonal frequency division multiplexing
(OFDM),
Peak-to-average power ratio (PAPR),
Selected mapping
(SLM),
Side information (SI)

##### 480 On the Properties of Pseudo Noise Sequences with a Simple Proposal of Randomness Test

**Authors:**
Abhijit Mitra

**Abstract:**

**Keywords:**
Maximal length sequence,
pseudo noise sequence,
punctured de Bruijn sequence,
auto-correlation,
Bernoulli sequence,
randomness tests.

##### 479 Power Efficient OFDM Signals with Reduced Symbol's Aperiodic Autocorrelation

**Authors:**
Ibrahim M. Hussain

**Abstract:**

Three new algorithms based on minimization of autocorrelation of transmitted symbols and the SLM approach which are computationally less demanding have been proposed. In the first algorithm, autocorrelation of complex data sequence is minimized to a value of 1 that results in reduction of PAPR. Second algorithm generates multiple random sequences from the sequence generated in the first algorithm with same value of autocorrelation i.e. 1. Out of these, the sequence with minimum PAPR is transmitted. Third algorithm is an extension of the second algorithm and requires minimum side information to be transmitted. Multiple sequences are generated by modifying a fixed number of complex numbers in an OFDM data sequence using only one factor. The multiple sequences represent the same data sequence and the one giving minimum PAPR is transmitted. Simulation results for a 256 subcarrier OFDM system show that significant reduction in PAPR is achieved using the proposed algorithms.

**Keywords:**
Aperiodic autocorrelation,
OFDM,
PAPR,
SLM,
wireless communication.

##### 478 UTMGO: A Tool for Searching a Group of Semantically Related Gene Ontology Terms and Application to Annotation of Anonymous Protein Sequence

**Authors:**
Razib M. Othman,
Safaai Deris,
Rosli M. Illias

**Abstract:**

**Keywords:**
Anonymous protein sequence,
Gene Ontology,
Protein sequence annotation,
Protein sequence alignment

##### 477 Evaluation of the Zero Sequence Impedance of Overhead High Voltage Lines

**Authors:**
Rabah Diabi

**Abstract:**

**Keywords:**
Overhead line,
power system,
zero sequence,
wire guard,
grounding.

##### 476 A Green Design for Assembly Model for Integrated Design Evaluation and Assembly and Disassembly Sequence Planning

**Authors:**
Yuan-Jye Tseng,
Fang-Yu Yu,
Feng-Yi Huang

**Abstract:**

**Keywords:**
green design,
assembly and disassembly sequence
planning,
green design for assembly,
particle swarm optimization.

##### 475 A PN Sequence Generator based on Residue Arithmetic for Multi-User DS-CDMA Applications

**Authors:**
Chithra R,
Pallab Maji,
Sarat Kumar Patra,
Girija Sankar Rath

**Abstract:**

**Keywords:**
Direct-Sequence Code Division Multiple Access (DSCDMA),
Multiple-Access Interference (MAI),
PN Sequence,
Residue
Number System (RNS).

##### 474 Enhanced Imperialist Competitive Algorithm for the Cell Formation Problem Using Sequence Data

**Authors:**
S. H. Borghei,
E. Teymourian,
M. Mobin,
G. M. Komaki,
S. Sheikh

**Abstract:**

**Keywords:**
Cell formation problem,
Group technology,
Imperialist competitive algorithm,
Sequence data.

##### 473 Application and Limitation of Parallel Modelingin Multidimensional Sequential Pattern

**Authors:**
Mahdi Esmaeili,
Mansour Tarafdar

**Abstract:**

**Keywords:**
Sequential Patterns,
Data Mining,
ParallelAlgorithm,
Multidimensional Sequence Data

##### 472 Computational Analysis of the MembraneTargeting Domains of Plant-specific PRAF Proteins

**Authors:**
Ewa Wywial,
Shaneen M. Singh

**Abstract:**

The PRAF family of proteins is a plant specific family of proteins with distinct domain architecture and various unique sequence/structure traits. We have carried out an extensive search of the Arabidopsis genome using an automated pipeline and manual methods to verify previously known and identify unknown instances of PRAF proteins, characterize their sequence and build 3D structures of their individual domains. Integrating the sequence, structure and whatever little known experimental details for each of these proteins and their domains, we present a comprehensive characterization of the different domains in these proteins and their variant properties.

**Keywords:**
PRAF proteins,
homology modeling,
Arabidopsisthaliana

##### 471 Direct Sequence Spread Spectrum Technique with Residue Number System

**Authors:**
M. I. Youssef,
A. E. Emam,
M. Abd Elghany

**Abstract:**

**Keywords:**
Spread Spectrum,
Direct sequence,
Bit errorprobability and Residue number system.

##### 470 Identification of Disease Causing DNA Motifs in Human DNA Using Clustering Approach

**Authors:**
G. Tamilpavai,
C. Vishnuppriya

**Abstract:**

Studying DNA (deoxyribonucleic acid) sequence is useful in biological processes and it is applied in the fields such as diagnostic and forensic research. DNA is the hereditary information in human and almost all other organisms. It is passed to their generations. Earlier stage detection of defective DNA sequence may lead to many developments in the field of Bioinformatics. Nowadays various tedious techniques are used to identify defective DNA. The proposed work is to analyze and identify the cancer-causing DNA motif in a given sequence. Initially the human DNA sequence is separated as k-mers using k-mer separation rule. The separated k-mers are clustered using Self Organizing Map (SOM). Using Levenshtein distance measure, cancer associated DNA motif is identified from the k-mer clusters. Experimental results of this work indicate the presence or absence of cancer causing DNA motif. If the cancer associated DNA motif is found in DNA, it is declared as the cancer disease causing DNA sequence. Otherwise the input human DNA is declared as normal sequence. Finally, elapsed time is calculated for finding the presence of cancer causing DNA motif using clustering formation. It is compared with normal process of finding cancer causing DNA motif. Locating cancer associated motif is easier in cluster formation process than the other one. The proposed work will be an initiative aid for finding genetic disease related research.

**Keywords:**
Bioinformatics,
cancer motif,
DNA,
k-mers,
Levenshtein distance,
SOM.

##### 469 Optimization of Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Times Using Genetic Algorithm Approach

**Authors:**
Sanjay Kumar Parjapati,
Ajai Jain

**Abstract:**

This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.

**Keywords:**
Flexible Job Shop,
Genetic Algorithm,
Makespan,
Sequence Dependent Setup Times.

##### 468 Influence of Stacking Sequence and Temperature on Buckling Resistance of GFRP Infill Panel

**Authors:**
Viriyavudh Sim,
SeungHyun Kim,
JungKyu Choi,
WooYoung Jung

**Abstract:**

Glass Fiber Reinforced Polymer (GFRP) is a major evolution for energy dissipation when used as infill material for seismic retrofitting of steel frame, a basic PMC infill wall system consists of two GFRP laminates surrounding an infill of foam core. This paper presents numerical analysis in terms of buckling resistance of GFRP sandwich infill panels system under the influence of environment temperature and stacking sequence of laminate skin. Mode of failure under in-plane compression is studied by means of numerical analysis with ABAQUS platform. Parameters considered in this study are contact length between infill and frame, laminate stacking sequence of GFRP skin and variation of mechanical properties due to increment of temperature. The analysis is done with four cases of simple stacking sequence over a range of temperature. The result showed that both the effect of temperature and stacking sequence alter the performance of entire panel system. The rises of temperature resulted in the decrements of the panel’s strength. This is due to the polymeric nature of this material. Additionally, the contact length also displays the effect on the performance of infill panel. Furthermore, the laminate stiffness can be modified by orientation of laminate, which can increase the infill panel strength. Hence, optimal performance of the entire panel system can be obtained by comparing different cases of stacking sequence.

**Keywords:**
Buckling resistance,
GFRP infill panel,
stacking sequence,
temperature dependent.