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.

Interaction between human interleukin-16 and CD4 receptor of HIV-1

AIM: To study the interaction between human interleukin-16 (IL-16) and the receptor CD4 (T-lymphocyte differentiation antigen) of human immunodeficiency virus type 1 (HIV-1). METHODS: Two structurally con served regions (SCRs) of human IL-16 were built by the SYBYL/Biopolymer module using the corresponding transmembrane (TM) domain of human interleukin-1 (HIL-4) and HIL-2 as the templates. The coordinates for amino-terminal residue sequence, carboxyl-terminal residue sequences, and cytoplasm loops were generated using Biopolymer's LOOP SEARCH algorithm. RESULTS: HIL-16 first formed a homodimer, then contacted with CD4 dimer further forming a dimeric complex. Subsequently, the dimeric complex constructed the tetrameric complex by two disulfide bridges between the cysteines of HIL-16 (Cys31-Cys31). CONCLUSION: The interaction model is useful to propose the action mechanism of HIL-16 and is beneficial for rational designing of novel anti-HIV drugs.

Molecular modeling on human CCR5 receptors and complex with CD4 antigens and HIV-1 envelope glycoprotein gp120

AIM: To investigate the interaction between human CCR5 receptors (CCR5) and HIV-1 envelope glycoprotein gp120 (HIV-1 gp120) and HIV-1 receptor CD4 antigens (CD4). METHODS: The structurally con served regions (SCR) of human CCR5 was built by the SYBYL/Biopolymer module using the corresponding transmembrane (TM) domain of bacteriorhodopsin (bR) as the template. The coordinates for amino-ter minal residue sequence, and carboxyl-terminal residue sequence, extracellular and cytoplasmic loops were generated using LOOP SEARCH algorithm. Subsequently the structural model was merged into the complex with HIV-1 gp120 and CD4. RESULTS: Human CCR5 interacted with both an HIV-1 gp120 and CD4. The N-terminal residues (especially Met1 and Gln4) of human CCR5, contacted with CD4 residues, mainly 7Nith one span (56 - 59) of CD4 in electrostatic interaction and hydrogen-bonds. The binding sites of human CCR5 were buried in a hydrophobic center surrounded by a highly basic periphery. On the other hand, direct interatomic contacts were made between ? CCR5 residues and 6 gp120 amino-acid residues, which included van der Waals contacts, hydrophobic interaction, and hydrogen bonds. CONCLUSION: The interaction model should be helpful for rational design of novel anti-HIV drugs.

Quantum computing

Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization.

A Complex BPF with On Chip Auto-tuning Architecture for Wireless Receivers

A 3(rd) order complex band-pass filter (BPF) with auto-tuning architecture is proposed in this paper. It is implemented in 0.18um standard CMOS technology. The complex filter is centered at 4.092MHz with bandwidth of 2.4MHz. The in-band 3(rd) order harmonic input intercept point (IIP3) is larger than 16.2dBm, with 50 Omega as the source impedance. The input referred noise is about 80uV(rms). The RC tuning is based on Binary Search Algorithm (BSA) with tuning accuracy of 3%. The chip area of the tuning system is 0.28 x 0.22 mm(2), less than 1/8 of that of the main-filter which is 0.92 x 0.59 mm(2). After tuning is completed, the tuning system will be turned off automatically to save power and to avoid interference. The complex filter consumes 2.6mA with a 1.8V power supply.

A Complex BPF with On Chip Auto-tuning Architecture for Low-IF Receivers

A 3(rd) order complex band-pass filter (BPF) with auto-tuning architecture is proposed in this paper. It is implemented in 0.18 mu m standard CMOS technology. The complex filter is centered at 4.092MHz with bandwidth of 2.4MHz. The in-band 3(rd) order harmonic input intercept point (IIP3) is larger than 19dBm, with 50 Omega as the source impedance. The input referred noise is about 80 mu V-rms. The RC tuning is based on Binary Search Algorithm (BSA) with tuning accuracy of 3%. The chip area of the tuning system is 0.28x0.22mm(2), less than 1/8 of that of the main-filter which is 0.92x0.59mm(2). After tuning is completed, the tuning system will be turned off automatically to save power and to avoid interference. The complex filter consumes 2.6mA with a 1.8V power supply.

一种三维航迹快速搜索方法

本文提出了基于SAS的自动三维航迹规划方法。该方法通过把约束条件结合到搜索算法中去，有效地减小了搜索空间，缩短了搜索时间，从而使三维规划能够用于实时航迹规划。在搜索过程中地形信息得到了充分利用，使算法生成的航迹能够自动回避地形和威胁。实验证明，该方法能够快速有效地完成规划任务，获得满意的三维航迹。

Quantum computing

Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization.

一种基于神经网络的生产调度方法

提出解决具有开、完工期限制的约束Ｊｏｂ－ｓｈｏｐ生产调度问题的一种神经网络方法．该方法通过约束神经网络，描述各种加工约束条件，并对不满足约束的开工时间进行相应调节，得到可行调度方案；然后由梯度搜索算法优化可行调度方案，直至得到最终优化可行调度解．理论分析、仿真实验表明了方法的有效性。

延时过程纯滞后的一种降阶搜索算法

本文讨论了在特殊信号下,非真阶非真滞后模型参数的最小二乘估计与纯滞后之间的关系,提出了一种新的辨识纯滞后的方法——降阶搜索算法。

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.

An Integrated Evolutionary Algorithm for Expensive Global Optimization

We propose an integrated algorithm named low dimensional simplex evolution extension (LDSEE) for expensive global optimization in which only a very limited number of function evaluations is allowed. The new algorithm accelerates an existing global optimization, low dimensional simplex evolution (LDSE), by using radial basis function (RBF) interpolation and tabu search. Different from other expensive global optimization methods, LDSEE integrates the RBF interpolation and tabu search with the LDSE algorithm rather than just calling existing global optimization algorithms as subroutines. As a result, it can keep a good balance between the model approximation and the global search. Meanwhile it is self-contained. It does not rely on other GO algorithms and is very easy to use. Numerical results show that it is a competitive alternative for expensive global optimization.