BAIS: A Bayesian Artificial Immune System for the effective handling of building blocks

Significant progress has been made in theory and design of Artificial Immune Systems (AISs) for solving hard problems accurately. However, an aspect not yet widely addressed by the research reported in the literature is the lack of ability of the AISs to deal effectively with building blocks (partial high-quality solutions coded in the antibody). The available AISs present mechanisms for evolving the population that do not take into account the relationship among the variables of the problem, potentially causing the disruption of high-quality partial solutions. This paper proposes a novel AIS with abilities to identify and properly manipulate building blocks in optimization problems. Instead of using cloning and mutation to generate new individuals, our algorithm builds a probabilistic model representing the joint probability distribution of the promising solutions and, subsequently, uses this model for sampling new solutions. The probabilistic model used is a Bayesian network due to its capability of properly capturing the most relevant interactions among the variables. Therefore, our algorithm, called Bayesian Artificial Immune System (BAIS), represents a significant attempt to improve the performance of immune-inspired algorithms when dealing with building blocks, and hence to solve efficiently hard optimization problems with complex interactions among the variables. The performance of BAIS compares favorably with that produced by contenders such as state-of-the-art Estimation of Distribution Algorithms.     

Relationships between driving simulator performance and driving test results

This article is considered relevant because: 1) car driving is an everyday and safety-critical task; 2) simulators are used to an increasing extent for driver training (related topics: training, virtual reality, human-machine interaction); 3) the article addresses relationships between performance in the simulator and driving test results--a relevant topic for those involved in driver training and the virtual reality industries; 4) this article provides new insights about individual differences in young drivers' behaviour. Simulators are being used to an increasing extent for driver training, allowing for the possibility of collecting objective data on driver proficiency under standardised conditions. However, relatively little is known about how learner drivers' simulator measures relate to on-road driving. This study proposes a theoretical framework that quantifies driver proficiency in terms of speed of task execution, violations and errors. This study investigated the relationships between these three measures of learner drivers' (n=804) proficiency during initial simulation-based training and the result of the driving test on the road, occurring an average of 6 months later. A higher chance of passing the driving test the first time was associated with making fewer steering errors on the simulator and could be predicted in regression analysis with a correlation of 0.18. Additionally, in accordance with the theoretical framework, a shorter duration of on-road training corresponded with faster task execution, fewer violations and fewer steering errors (predictive correlation 0.45). It is recommended that researchers conduct more large-scale studies into the reliability and validity of simulator measures and on-road driving tests.     

Hybrid learning for interval type-2 fuzzy logic systems based on orthogonal least-squares and back-propagation methods

This paper presents a novel learning methodology based on a hybrid algorithm for interval type-2 fuzzy logic systems. Since only the back-propagation method has been proposed in the literature for the tuning of both the antecedent and the consequent parameters of type-2 fuzzy logic systems, a hybrid learning algorithm has been developed. The hybrid method uses a recursive orthogonal least-squares method for tuning the consequent parameters and the back-propagation method for tuning the antecedent parameters. Systems were tested for three types of inputs: (a) interval singleton, (b) interval type-1 non-singleton, and (c) interval type-2 non-singleton. Experiments were carried out on the application of hybrid interval type-2 fuzzy logic systems for prediction of the scale breaker entry temperature in a real hot strip mill for three different types of coil. The results proved the feasibility of the systems developed here for scale breaker entry temperature prediction. Comparison with type-1 fuzzy logic systems shows that hybrid learning interval type-2 fuzzy logic systems provide improved performance under the conditions tested.     

Flow simulations in arbitrarily complex cardiovascular anatomies – An unstructured Cartesian grid approach

Image guided computational fluid dynamics is attracting increasing attention as a tool for refining in vivo flow measurements or predicting the outcome of different surgical scenarios. Sharp interface Cartesian/Immersed-Boundary methods constitute an attractive option for handling complex in vivo geometries but their capability to carry out fine-mesh simulations in the branching, multi-vessel configurations typically encountered in cardiovascular anatomies or pulmonary airways has yet to be demonstrated. A major computational challenge stems from the fact that when such a complex geometry is immersed in a rectangular Cartesian box the excessively large number of grid nodes in the exterior of the flow domain imposes an unnecessary burden on both memory and computational overhead of the Cartesian solver without enhancing the numerical resolution in the region of interest. For many anatomies, this added burden could be large enough to render comprehensive mesh refinement studies impossible. To remedy this situation, we recast the original structured Cartesian formulation of Gilmanov and Sotiropoulos [Gilmanov A, Sotiropoulos F. A hybrid Cartesian/immersed boundary method for simulating flows with 3D, geometrically complex, moving bodies. J Comput Phys 2005;207(2):457–92] into an unstructured Cartesian grid layout. This simple yet powerful approach retains the simplicity and computational efficiency of a Cartesian grid solver, while drastically reducing its memory footprint. The method is applied to carry out systematic mesh refinement studies for several internal flow problems ranging in complexity from flow in a 90° pipe bend to flow in an actual, patient-specific anatomy reconstructed from magnetic resonance images. Finally, we tackle the challenging clinical scenario of a single-ventricle patient with severe arterio-venous malformations, seeking to provide a fluid dynamics prospective on a clinical problem and suggestions for procedure improvements. Results from these simulations demonstrate very complex cardiovascular flow dynamics and underscore the need for high-resolution simulations prior to drawing any clinical recommendations.     

MOE prediction in Abies pinsapo Boiss. timber: Application of an artificial neural network using non-destructive testing

Determining the modulus of elasticity of wood by applying an artificial neural network using the physical properties and non-destructive testing can be a useful method in assessments of the timber structure in old constructions. The modulus of elasticity of Abies pinsapo Boiss. timber was predicted in this study through the parameters of density, width, thickness, moisture content, ultrasonic wave propagation velocity and visual grading of the test pieces. A feedforward multilayer perceptron network was designed for this purpose, achieving 75.0% success in the testing or unknown group.     

Semisimple algebras of almost minimal rank over the reals

A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are called algebras of minimal rank. After 25 years of research, these algebras are now well understood. Here we start the investigation of the algebras for which the Alder–Strassen bound is off by one. As a first result, we completely characterize the semisimple algebras over R$\mathbb{R}$ whose bilinear complexity is by one larger than the Alder–Strassen bound. Furthermore, we characterize all algebras A$A$ (with radical) of minimal rank plus one over R$\mathbb{R}$ for which A/radA$A/radA$ has minimal rank plus one. The other possibility is that A/radA$A/radA$ has minimal rank. For this case, we only present a partial result.     

Constructing algebraic groups from their Lie algebras

A connected algebraic group in characteristic 0$0$ is uniquely determined by its Lie algebra. In this paper algorithms are given for constructing an algebraic group in characteristic 0$0$, given its Lie algebra. In particular, this leads to an algorithm for finding a maximal reductive subgroup and the unipotent radical of an algebraic group.     

The effect of code-mixing on accent identification accuracy

We investigate whether accent identification is more effective for English utterances embedded in a different language as part of a mixed code than for English utterances that are part of a monolingual dialogue. Our focus is on Xhosa and Zulu, two South African languages for which code-mixing with English is very common. In order to carry out our investigation, we extract English utterances from mixed-code Xhosa and Zulu speech corpora, as well as comparable utterances from an English-only corpus by Xhosa and Zulu mother-tongue speakers. Experiments using automatic accent identification systems show that identification is substantially more accurate for the utterances originating from the mixed-code speech. These findings are supported by a corresponding set of perceptual experiments in which human subjects were asked to identify the accents of recorded utterances. We conclude that accent identification is more successful for these utterances because accents are more pronounced for English embedded in mother-tongue speech than for English spoken as part of a monolingual dialogue by non-native speakers. Furthermore we find that this is true for human listeners as well as for automatic identification systems.     

On graph reasoning

In this paper, we study the (positive) graph relational calculus. The basis for this calculus was introduced by Curtis and Lowe in 1996 and some variants, motivated by their applications to semantics of programs and foundations of mathematics, appear scattered in the literature. No proper treatment of these ideas as a logical system seems to have been presented. Here, we give a formal presentation of the system, with precise formulation of syntax, semantics, and derivation rules. We show that the set of rules is sound and complete for the valid inclusions, and prove a finite model result as well as decidability. We also prove that the graph relational language has the same expressive power as a first-order positive fragment (both languages define the same binary relations), so our calculus may be regarded as a notational variant of the positive existential first-order logic of binary relations. The graph calculus, however, has a playful aspect, with rules easy to grasp and use. This opens a wide range of applications which we illustrate by applying our calculus to the positive relational calculus (whose set of valid inclusions is not finitely axiomatizable), obtaining an algorithm for deciding the valid inclusions and equalities of the latter.     

A formal analysis of database replication protocols with SI replicas and crash failures

This paper provides a formal specification and proof of correctness of a basic Generalized Snapshot Isolation certification-based data replication protocol for database middleware architectures. It has been modeled using a state transition system, as well as the main system components, allowing a perfect match with the usual deployment in a middleware system. The proof encompasses both safety and liveness properties, as it is commonly done for a distributed algorithm. Furthermore, a crash failure model has been assumed for the correctness proof, although recovery analysis is not the aim of this paper. This allows an easy extension toward a crash-recovery model support in future works. The liveness proof focuses in the uniform commit: if a site has committed a transaction, the rest of sites will either commit it or it would have crashed.