Neutral fitness landscapes in signalling networks

Biological and technological systems process information by means of cascades of signals. Be they interacting genes, spiking neurons or electronic transistors, information travels across these systems, producing, for each set of external conditions, an appropriate response. In technology, circuits performing specific complex tasks are designed by humans. In biology, however, design has to be ruled out, confronting us with the question of how these systems could have arisen by accumulation of small changes. The key factor is the genotype-phenotype map. With the exception of RNA folding, not much is known about the exact nature of this mapping. Here, we show that structure of the genotype-phenotype map of simple feed-forward circuits is very close to the ones found in RNA; they have a large degree of neutrality, by which a circuit can be completely rewired keeping its input-output function intact, and there is a relatively small neighbourhood of a given circuit containing almost all the phenotypes.     

Genetic algorithm hybridized with multilayer perceptron to have an economical slope stability design

The present work aimed to evaluate and optimize the design of an artificial neural network (ANN) combined with an optimization algorithm of genetic algorithm (GA) for the calculation of slope stability safety factors (SF) in a pure cohesive slope. To make datasets of training and testing for the developed predictive models, 630 finite element limit equilibrium (FELE) analyses were performed. Similar to many artificial intelligence-based solutions, the database was involved in 189 testing datasets (e.g., 30% of the entire database) and 441 training datasets; for example, a range of 70% of the total database. Moreover, variables of multilayer perceptron (MLP) algorithm (for example, number of nodes in any hidden layer) and the algorithm of GA like population size was optimized by utilizing a series of trial and error process. The parameters in input, which were used in the analysis, consist of slope angle (β), setback distance ratio (b/B), applied stresses on the slope (F_y) and undrained shear strength of the cohesive soil (C_u) where the output was taken SF. The obtained network outputs for both datasets from MLP and GA-MLP models are evaluated according to many statistical indices. A total of 72 MLP trial and error (e.g., parameter study) the optimal architecture of 4 × 8 × 1 were determined for the MLP structure. Both proposed techniques result in a proper performance; however, according to the statistical indices, the GA–MLP model can somewhat accomplish the least mean square error (MSE) when compared to MLP. In an optimized GA–MLP network, coefficient of determination (R²) and root mean square error (RMSE) values of (0.975, and 0.097) and (0.969, and 0.107) were found, respectively, to both of the normalized training and testing datasets.

     

Nonlinear evolutionary swarm intelligence of grasshopper optimization algorithm and gray wolf optimization for weight adjustment of neural network

Engineering with Computers - The advent of new data-mining techniques and, more recently, swarm-based optimization algorithms have antiquated traditional models in the field of energy performance...     

Potential uses of kairomones for behavioral manipulation ofCotesia marginiventris (Cresson)

The effects of kairomone pattern and preconditioning on parasitization rates of fall armyworm larvae,Spodoptera frugiperda (J.E. Smith) byCotesia (=Apanteles)marginiventris (Cresson) were investigated in the laboratory and greenhouse using a hexane extract of frass and actual fall armyworm frass. Parasitization rates increased 55 and 26% in Petri dishes and on corn seedlings, respectively, when the entire experimental area was sprayed with the frass extract. Applying the extract in spots resulted in a 20–30% reduction in parasitization compared to treating the entire area. However, spot application produced significantly better parasitization rates compared to the control treatment. Exposing the parasitoids to actual fall armyworm frass resulted in ca. 50% greater retention in the release area and an increase of ca. 60–75% in the number of parasitoids searching.C. marginiventris parasitized factitious hosts topically treated with an extract of fall armyworm frass.Mention of a commercial or proprietary product does not constitute an endorsement by the USDA.Submitted in partial fulfillment of the requirements for the degree Doctor of Philosophy, Department of Entomology and Nematology, University of Florida, Gainesville     

Building Taskable Spaces over Ubiquitous Services

Task-based abstraction can express user tasks via underlying services with minimal effort. However, developers must first address several issues including task execution transparency, exception handling, ontologies, and abstract architecture design.     

Solving identity delegation problem in the e-government environment

At present, many countries allow citizens or entities to interact with the government outside the telematic environment through a legal representative who is granted powers of representation. However, if the interaction takes place through the Internet, only primitive mechanisms of representation are available, and these are mainly based on non-dynamic offline processes that do not enable quick and easy identity delegation. This paper proposes a system of dynamic delegation of identity between two generic entities that can solve the problem of delegated access to the telematic services provided by public authorities. The solution herein is based on the generation of a delegation token created from a proxy certificate that allows the delegating entity to delegate identity to another on the basis of a subset of its attributes as delegator, while also establishing in the delegation token itself restrictions on the services accessible to the delegated entity and the validity period of delegation. Further, the paper presents the mechanisms needed to either revoke a delegation token or to check whether a delegation token has been revoked. Implications for theory and practice and suggestions for future research are discussed.     

A geostatistical algorithm to reproduce lateral gradual facies transitions: Description and implementation

Valid representations of geological heterogeneity are fundamental inputs for quantitative models used in managing subsurface activities. Consequently, the simulation of realistic facies distributions is a significant aim. Realistic facies distributions are typically obtained by pixel-based, object-based or process-based methods. This work presents a pixel-based geostatistical algorithm suitable for reproducing lateral gradual facies transitions (LGFT) between two adjacent sedimentary bodies. Lateral contact (i.e. interfingering) between distinct depositional facies is a widespread geometric relationship that occurs at different scales in any depositional system. The algorithm is based on the truncation of the sum of a linear expectation trend and a random Gaussian field, and can be conditioned to well data. The implementation introduced herein also includes subroutines to clean and geometrically characterize the obtained LGFT. The cleaned sedimentary body transition provides a more appropriate and realistic facies distribution for some depositional settings. The geometric measures of the LGFT yield an intuitive measure of the morphology of the sedimentary body boundary, which can be compared to analogue data. An example of a LGFT obtained by the algorithm presented herein is also flow simulated, quantitatively demonstrating the importance of realistically reproducing them in subsurface models, if further flow-related accurate predictions are to be made.     

Multiple-Agent Perspectives in Reasoning About Situations for Context-Aware Pervasive Computing Systems

In open heterogeneous context-aware pervasive computing systems, suitable context models and reasoning approaches are necessary to enable collaboration and distributed reasoning among agents. This paper proposes, develops, and demonstrates the following: 1) a novel context model and reasoning approach developed with concepts from the state-space model, which describes context and situations as geometrical structures in a multidimensional space; and 2) a context algebra based on the model, which enables distributed reasoning by merging and partitioning context models that represent different perspectives of computing entities over the object of reasoning. We show how merging and reconciling different points of view over context enhances the outcomes of reasoning about the context. We develop and evaluate our proposed algebraic operators and reasoning approaches with cases using real sensors and with simulations. We embed agents and mobile agents with these modeling and reasoning capabilities, thus facilitating context-aware and adaptive mobile agents operating in open pervasive environments.     

Game theoretical pattern recognition: application to imperfect noncooperative learning and to multiclass classification

This paper studies in theory, and gives a solution to, the following concerns which may eventually be simultaneous: 1) obtain alternative classification decisions, ranked by some decreasing order of class membership probabilities; 2) imperfect teacher at the learning stage, or effects of labeling errors due to unsupervised learning by clustering; 3) noncooperative teacher, manipulating the a priori class probabilities; 4) unknown a priori class probabilities. These requirements are taken into account by considering a game between the recognition system and the teacher, in a game theoretical framework. Both players will ultimately select ``mixed strategies,' which are probability distributions over the set of N alternative pattern classes, determined for each feature vector to be classified. This solution concept is interpreted in terms of the requirements 1)-4); numerical algorithms, as well as numerical examples are given with their solutions.