Constraint-based Mining of Frequent Arrangements of Temporal Intervals

The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event intervals that appear frequently in the database. The motivation of this work is the observation that in practice most events are not instantaneous but occur over a period of time and different events may occur concurrently. Thus, there are many practical applications that require mining such temporal correlations between intervals including the linguistic analysis of annotated data from American Sign Language as well as network and biological data. Two efficient methods to find frequent arrangements of temporal intervals are described; the first one is tree-based and uses depth first search to mine the set of frequent arrangements, whereas the second one is prefix-based. The above methods apply efficient pruning techniques that include a set of constraints consisting of regular expressions and gap constraints that add user-controlled focus into the mining process. Moreover, based on the extracted patterns a standard method for mining association rules is employed that applies different interestingness measures to evaluate the significance of the discovered patterns and rules. The performance of the proposed algorithms is evaluated and compared with other approaches on real (American Sign Language annotations and network data) and large synthetic datasets.

Computing explanations for interactive constraint-based systems

Constraint programming has emerged as a successful paradigm for modelling combinatorial problems arising from practical situations. In many of those situations, we are not provided with an immutable set of constraints. Instead, a user will modify his requirements, in an interactive fashion, until he is satisfied with a solution. Examples of such applications include, amongst others, model-based diagnosis, expert systems, product configurators. The system he interacts with must be able to assist him by showing the consequences of his requirements. Explanations are the ideal tool for providing this assistance. However, existing notions of explanations fail to provide sufficient information. We define new forms of explanations that aim to be more informative. Even if explanation generation is a very hard task, in the applications we consider, we must manage to provide a satisfactory level of interactivity and, therefore, we cannot afford long computational times. We introduce the concept of representative sets of relaxations, a compact set of relaxations that shows the user at least one way to satisfy each of his requirements and at least one way to relax them, and present an algorithm that efficiently computes such sets. We introduce the concept of most soluble relaxations, maximising the number of products they allow. We present algorithms to compute such relaxations in times compatible with interactivity, achieving this by indifferently making use of different types of compiled representations. We propose to generalise the concept of prime implicates to constraint problems with the concept of domain consequences, and suggest to generate them as a compilation strategy. This sets a new approach in compilation, and allows to address explanation-related queries in an efficient way. We define ordered automata to compactly represent large sets of domain consequences, in an orthogonal way from existing compilation techniques that represent large sets of solutions.

Diagnostic based modeling for determining absolute atomic oxygen densities in atmospheric pressure helium-oxygen plasmas

Absolute atomic oxygen ground state densities in a radio-frequency driven atmospheric pressure plasma jet, operated in a helium-oxygen mixture, are determined using diagnostic based modeling. One-dimensional numerical simulations of the electron dynamics are combined with time integrated optical emission spectroscopy. The population dynamics of the upper O 3p 3P (l=844 nm) atomic oxygen state is governed by direct electron impact excitation, dissociative excitation, radiation losses, and collisional induced quenching. Absolute values for atomic oxygen densities are obtained through comparison with the upper Ar 2p1 (l=750.4 nm) state. Results for spatial profiles and power variations are presented and show excellent quantitative agreement with independent two-photon laser-induced fluorescence measurements.

Diagnostic-based modeling on a micro-scale atmospheric-pressure plasma jet

Diagnostic-based modeling (DBM) actively combines complementary advantages of numerical plasma simulations and relatively simple optical emission spectroscopy (OES). DBM is applied to determine spatial absolute atomic oxygen ground-state density profiles in a micro atmospheric-pressure plasma jet operated in He–O2. A 1D fluid model with semi-kinetic treatment of the electrons yields detailed information on the electron dynamics and the corresponding spatio-temporal electron energy distribution function. Benchmarking this time- and space-resolved simulation with phase-resolved OES (PROES) allows subsequent derivation of effective excitation rates as the basis for DBM. The population dynamics of the upper O(3p3P) oxygen state (? = 844 nm) is governed by direct electron impact excitation, dissociative excitation, radiation losses, and collisional induced quenching. Absolute values for atomic oxygen densities are obtained through tracer comparison with the upper Ar(2p1) state (? = 750.4 nm). The resulting spatial profile for the absolute atomic oxygen density shows an excellent quantitative agreement to a density profile obtained by two-photon absorption laser-induced fluorescence spectroscopy.

P2Y(1) antagonists: Combining receptor-based modeling and QSAR for a quantitative prediction of the biological activity based on consensus scoring

P2Y(1) is an ADP-activated G protein-coupled receptor (GPCR). Its antagonists impede platelet aggregation in vivo and are potential antithrombotic agents. Combining ligand and structure-based modeling we generated a consensus model (LIST-CM) correlating antagonist structures with their potencies. We docked 45 antagonists into our rhodopsin-based human P2Y(1) homology model and calculated docking scores and free binding energies with the Linear Interaction Energy (LIE) method in continuum-solvent. The resulting alignment was also used to build QSAR based on CoMFA, CoMSIA, and molecular descriptors. To benefit from the strength of each technique and compensate for their limitations, we generated our LIST-CM with a PLS regression based on the predictions of each methodology. A test set featuring untested substituents was synthesized and assayed in inhibition of 2-MeSADP-stimulated PLC activity and in radioligand binding. LIST-CM outperformed internal and external predictivity of any individual model to predict accurately the potency of 75% of the test set.

Agent-Based Modeling of Deshopping Behaviour: A Single Shop Model with Multiple Deshoppers

Deshopping is rapidly turning into a modern day scourge for the retailers worldwide due to its prevalence and regularity. The presence of flexible return policies have made retail return management a real challenging issue for both the present and the future. In this study, we propose and develop a multi-agent simulation model for deshopper behavior in a single shop context. The background, theoretical underpinning, logical and computational model, experiment design and simulation results are reported and discussed in the paper.

Constraint-based modelling of mixed microbial populations: Application to polyhydroxyalkanoates production

Dissertação para obtenção do Grau de Doutor em Engenharia Química e Bioquímica

Application of agent-based modeling to the study of gender stereotypes

Gender stereotypes are sets of characteristics that people believe to be typically true of a man or woman. We report an agent-based model (ABM) that simulates how stereotypes disseminate in a group through associative mechanisms. The model consists of agents that carry one of several different versions of a stereotype, which share part of their conceptual content. When an agent acts according to his/her stereotype, and that stereotype is shared by an observer, then the latter’s stereotype strengthens. Contrarily, if the agent does not act according to his/ her stereotype, then the observer’s stereotype weakens. In successive interactions, agents develop preferences, such that there will be a higher probability of interaction with agents that confirm their stereotypes. Depending on the proportion of shared conceptual content in the stereotype’s different versions, three dynamics emerge: all stereotypes in the population strengthen, all weaken, or a bifurcation occurs, i.e., some strengthen and some weaken. Additionally, we discuss the use of agent-based modeling to study social phenomena and the practical consequences that the model’s results might have on stereotype research and their effects on a community

An artificial economy based on reinforcement learning and agent based modeling

In this paper, we employ techniques from artificial intelligence such as reinforcement learning and agent based modeling as building blocks of a computational model for an economy based on conventions. First we model the interaction among firms in the private sector. These firms behave in an information environment based on conventions, meaning that a firm is likely to behave as its neighbors if it observes that their actions lead to a good pay off. On the other hand, we propose the use of reinforcement learning as a computational model for the role of the government in the economy, as the agent that determines the fiscal policy, and whose objective is to maximize the growth of the economy. We present the implementation of a simulator of the proposed model based on SWARM, that employs the SARSA(λ) algorithm combined with a multilayer perceptron as the function approximation for the action value function.