Search For Critical Slip Surface In Slope Stability Analysis By Spline-Based Ga Method

The stability of a soil slope is usually analyzed by limit equilibrium methods, in which the identification of the critical slip surface is of principal importance. In this study the spline curve in conjunction with a genetic algorithm is used to search the critical slip surface, and Spencer's method is employed to calculate the factor of safety. Three examples are presented to illustrate the reliability and efficiency of the method. Slip surfaces defined by a series of straight lines are compared with those defined by spline curves, and the results indicate that use of spline curves renders better results for a given number of slip surface nodal points comparing with the approximation using straight line segments.

A combined statistical model for multiple motifs search

Transcription factor binding sites (TFBS) play key roles in genebior 6.8 wavelet expression and regulation. They are short sequence segments with de¯nite structure and can be recognized by the corresponding transcription factors correctly. From the viewpoint of statistics, the candidates of TFBS should be quite di®erent from the segments that are randomly combined together by nucleotide. This paper proposes a combined statistical model for ¯nding over- represented short sequence segments in di®erent kinds of data set. While the over-represented short sequence segment is described by position weight matrix, the nucleotide distribution at most sites of the segment should be far from the background nucleotide distribution. The central idea of this approach is to search for such kind of signals. This algorithm is tested on 3 data sets, including binding sites data set of cyclic AMP receptor protein in E.coli, PlantProm DB which is a non-redundant collection of proximal promoter sequences from di®erent species, collection of the intergenic sequences of the whole genome of E.Coli. Even though the complexity of these three data sets is quite di®erent, the results show that this model is rather general and sensible.

The search of 'novel' mtDNA mutations in hypertrophic cardiomyopathy: MITOMAPping as a risk factor

MITOMAP is by far the most frequently cited Web resource that is referred to in substantiating novelty of an mtDNA mutation. This database, as is now known, has quite an incomplete coverage of the mtDNA mutations from the literature. This circumstance has

The search for the IFN-gamma receptor in fish: Functional and expression analysis of putative binding and signalling chains in rainbow trout Oncorhynchus mykiss

Interferons (IFNs), consisting of three major subfamilies, type I, type II (gamma) and type III (lambda) IFN, activate vertebrate antiviral defences once bound to their receptors. The three IFN subfamilies bind to different receptors, IFNAR1 and IFNAR2 for type I IFNs, IFN gamma R1 and IFN gamma R2 for type II IFN, and IL-28R1 and IL-10R2 for type III IFNs. In fish, although many types I and II IFN genes have been cloned, little is known about their receptors. In this report, two putative IFN-gamma receptor chains were identified and sequenced in rainbow trout (Oncorhynchus mykiss), and found to have many common characteristics with mammalian type II IFN receptor family members. The presented gene synteny analysis, phylogenetic tree analysis and ligand binding analysis all suggest that these molecules are the authentic IFN gamma Rs in fish. They are widely expressed in tissues, with IFN gamma R1 typically more highly expressed than IFN gamma R2. Using the trout RTG-2 cell line it was possible to show that the individual chains could be differentially modulated, with rIFN-gamma and rIL-1 beta down regulating IFN gamma R1 expression but up regulating IFN gamma R2 expression. Overexpression of the two receptor chains in RTG-2 cells revealed that the level of IFN gamma R2 transcript was crucial for responsiveness to rIFN-gamma, in terms of inducing gamma IP expression. Transfection experiments showed that the two putative receptors specifically bound to rIFN-gamma. These findings are discussed in the context of how the IFN gamma R may bind IFN-gamma in fish and the importance of the individual receptor chains to signal transduction. (c) 2009 Elsevier Ltd. All rights reserved.

A time-varying controllable fault-tolerant field associative memory model and its simulation

A time-varying controllable fault-tolerant field associative memory model and the realization algorithms are proposed. On the one hand, this model simulates the time-dependent changeability character of the fault-tolerant field of human brain's associative memory. On the other hand, fault-tolerant fields of the memory samples of the model can be controlled, and we can design proper fault-tolerant fields for memory samples at different time according to the essentiality of memory samples. Moreover, the model has realized the nonlinear association of infinite value pattern from n dimension space to m dimension space. And the fault-tolerant fields of the memory samples are full of the whole real space R-n. The simulation shows that the model has the above characters and the speed of associative memory about the model is faster.

The design algorithm of an associative memory neural network

A design algorithm of an associative memory neural network is proposed. The benefit of this design algorithm is to make the designed associative memory model can implement the hoped situation. On the one hand, the designed model has realized the nonlinear association of infinite value pattern from n dimension space to m dimension space. The result has improved the ones of some old associative memory neural network. On the other hand, the memory samples are in the centers of the fault-tolerant. In average significance the radius of the memory sample fault-tolerant field is maximum.

a backtracking search tool for constructing combinatorial test suites

Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.