Optimization problems are becoming more complicated, and their resource requirements rising. Real-life optimization often NP-hard time or memory consuming. Nature has always been an excellent pattern for humans to pull out the best mechanisms engineering solve problems. The concept of seen in several natural processes, such as species evolution, swarm intelligence, social group behavior, immune...

In this paper we present a hybrid heuristic search algorithm for constraint satisfaction problems. This algorithm was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. We present the results using the well known n-queens problem.

Volume 7, no. 2, doi:10.1128/mBio.00020-16, 2016. We inadvertently omitted to acknowledge the generosity of Joseph Ferretti for providing the M49 NZ131 strain and a mutant derivative lacking the SLO toxin (D. J. Savic, W. M. McShan, and J. J. Ferretti. 2002. Autonomous expression of the slo gene of the bicistronic nga-slo operon of Streptococcus pyogenes. Infect Immun 70:2730 –2733. http://dx.d...

A recent model for cytolysin-mediated translocation in Streptococcus pyogenes proposes that NAD-glycohydrolase is translocated through streptolysin O-generated pores into a host cell (J. Madden, N. Ruiz, and M. Caparon, Cell 104:143-152, 2001). This model also assumes that the NAD-glycohydrolase (nga) and streptolysin O (slo) genes that code for these products are organized in an operon-like st...

In this paper we describe FT-COMAR an algorithm that improves fault tolerance of our heuristic algorithm (COMAR) previously described for protein reconstruction [10]. The algorithm [COMAR-Contact Map Reconstruction] can reconstruct the three-dimensional (3D) structure of the real protein from its contact map with 100% efficiency when tested on 1760 proteins from different structural classes. He...

A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementally building two Rapidly-exploring Random Trees (RRTs) rooted at the start and the goal configurations. The trees each explore space around them and also advance towards each other through the use of a simple greedy heur...

Object placement in virtual and real worlds is an important task for autonomous agents and applications. Interacting with agents using natural language commands presents an intuitive alternative to graphical and other operator control interfaces. However, understanding and interpreting language for placement actions in 3D continuous spaces is computationally hard. In this paper, we extend our p...

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...

Core-based system-on-chips (SoCs) fabricated on three-dimensional (3D) technology are emerging for better integration capabilities. Effective test architecture design and optimization techniques are essential to minimize the manufacturing cost for such gigascale integrated circuits. Test-access mechanisms (TAMs) and test wrappers (e.g., the IEEE Standard 1500 wrapper) facilitate the modular tes...

Student Learning Outcome (SLO) has been a hot issue in the research fields of higher education quality assurance and institutional research. Based on the classic college student development theories and students' learning experiences, this paper combines two educational data mining techniques, regression analysis and neural network modeling to explore the influential mechanism of SLO by the mea...