HLA_ACTOR_REPAST: An approach to distributing RePast models for high-performance simulations

RePast is a popular agent toolkit with proven capabilities to fulfil the modelling challenges of large multi-agent systems (MASs). The toolkit, though, is normally used on a standalone workstation and therefore its practical use can be constrained (in space and time) by the limited available computing resources. This paper proposes an original approach – HLA_ACTOR_REPAST – aimed to distributing RePast models for high-performance simulation of complex scalable models. Novel in HLA_ACTOR_REPAST is an exploitation of a lean actor infrastructure implemented in Java. Actors bring to RePast agents such features as migration, location-transparent naming, efficient communications, and a control-centric framework. Actors can be orchestrated by an in-the-large custom control structure which is in charge of ensuring the necessary message causality constraints. Distribution and time management concerns depend on the IEEE standard HLA middleware. The paper first discusses details of the software engineering process underlying the development of HLA_ACTOR_REPAST. The mapping techniques, assisted by Java text annotations and aspect-oriented programming, try to minimize “code intrusions” in the original model and favour model transparency. The paper then furnishes some experimental data which witness the good performance results achieved by applying HLA_ACTOR_REPAST to a distributed version of a classic MAS benchmark model.     

Registered e-mail (REM) — Reliable e-mail for everybody

The need for REM: For many years now the market felt the need for a registered and reliable e-mail, suitable to provide evidence just like the paper registered mail. Several implementations have been set up to this purpose: Incamail (Switzerland), Posta Elettronica Certificata — PEC (Italy), Euronot@ries’ MAILWITNESS, De-Mail (Germany), etc. Within the EU project “Pan-European Public Procurement Online” — PEPPOL — its Work Project (WP8) is developing a “secure and reliable transport of electronic business documents”.     

Survey on using constraints in data mining

This paper provides an overview of the current state-of-the-art on using constraints in knowledge discovery and data mining. The use of constraints in a data mining task requires specific definition and satisfaction tools during knowledge extraction. This survey proposes three groups of studies based on classification, clustering and pattern mining, whether the constraints are on the data, the models or the measures, respectively. We consider the distinctions between hard and soft constraint satisfaction, and between the knowledge extraction phases where constraints are considered. In addition to discussing how constraints can be used in data mining, we show how constraint-based languages can be used throughout the data mining process.     

Mobile Agent Coordination for Distributed Network Management

Mobile agents are a promising technology to face the problems raised by the increasing complexity and size of today's networks. In particular, in the area of network management, mobile agents can lead to a fully distributed paradigm to overcome the limits of traditional centralized approaches. A basic requirement for the management of a complex network is the definition of high-level and flexible models to coordinate the accesses to the resources—data and services—provided by the network nodes. On this basis, this paper describes the MARS coordination architecture for mobile agents. MARS is based on the definition of programmable tuple spaces associated with the network nodes: mobile agents can access the local resources and services via the tuple space, thus adopting a standard and high-level interface. The network administrator—via mobile agents—can dynamically program the behavior of the tuple space in reaction to the agents' access to the tuple space, thus leading to a flexible network model. Several examples show the effectiveness of the MARS approach in supporting network management activities.     

Mixture of KL subspaces for relevance feedback

Relevance feedback has recently emerged as a solution to the problem of improving the retrieval performance of an image retrieval system based on low-level information such as color, texture and shape features. Most of the relevance feedback approaches limit the utilization of the user’s feedback to a single search session, performing a short-term learning. In this paper we present a novel approach for short and long term learning, based on the definition of an adaptive similarity metric and of a high level representation of the images. For short-term learning, the relevant and non-relevant information given by the user during the feedback process is employed to create a positive and a negative subspace of the feature space. For long-term learning, the feedback history of all the users is exploited to create and update a representation of the images which is adopted for improving retrieval performance and progressively reducing the semantic gap between low-level features and high-level semantic concepts. The experimental results prove that the proposed method outperforms many other state of art methods in the short-term learning, and demonstrate the efficacy of the representation adopted for the long-term learning.

Testing Planning Domains (without Model Checkers)

We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on "Unique First Cause" (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study.     

γ-Radiolysis of Polyynes in Heptane

The polyynes in heptane solution were γ-radiolyzed at a total dose of 150, 300 and 600 kGy. After radiolysis the products were analyzed by electronic absorption spectroscopy, by HPLC (liquid chromatography) and by FT-IR spectroscopy. Even at 150 kGy the polyynes disappear completely from the solution and the chromatographic analysis shows that the acetylenic chains undergo fragmentation, addition and crosslinking reactions with other chains and with solvent. The oxidative interference from air has been detected by FT-IR.     

Impairment in long-term retention but not short-term performance on a water maze reversal task following hippocampal or mediodorsal striatal n-methyl-d-aspartate receptor blockade.

Male Long-Evans rats were injected with 32 ng/μl of the N-methyl-D-aspartate (NMDA) receptor antagonist 3-(2-carboxypiperazin-4-yl) propyl-1-phosphonic acid (CPP) or vehicle and trained to locate a hidden platform in a different location (reversal training) than used on the initial 4 days of training. Rats treated with vehicle or CPP into the dorsal hippocampus, basolateral amygdala, or mediodorsal striatum had similar latencies to locate the platform on the reversal day. Rats infused with CPP into the dorsal hippocampus or mediodorsal striatum failed to search preferentially in the novel location during a 24-hr, drug-free retention test, whereas all other groups searched preferentially in this location. Therefore, blocking dorsal hippocampal or mediodorsal striatal NMDA receptors selectively blocked long-term spatial retention without producing short-term performance deficits. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Soot and other Products Formation from the Submerged Carbon Arc in Halogenated Solvents

A series of selected halomethanes were treated with the submerged carbon arc using graphite electrodes at 10A. CCl₄ and CHCl₃ produce abundant soot which is double in comparison to the soot produced by arcing CH₂Cl₂ and is one order of magnitude higher than the amount of soot produced by arcing hydrocarbons such as n-hexane or decalin and two orders of magnitudes higher in comparison to the amounts of soot produced by arcing alcohols. It was found a anticorrelation between the amount of polyynes present in the solution of the arced solvent and the amount of soot produced by arcing. In the case of CCl₄ and CHCl₃ no polyynes were detected by liquid chromatographic analysis (HPLC-DAD), while polyynes were detected in CH₂Cl₂ and are present in higher concentration in arced hydrocarbon solutions. The soot produced from halomethanes was analyzed by FT-IR spectroscopy in comparison to the soot produced by arcing hydrocarbons and alcohols. Furthermore, the soot from halomethanes was analyzed by HPLC-DAD after extraction with acetonitrile and found to contain a mixture of halogenated polycyclic aromatic hydrocarbons (PAHs). Also CHClBr and CH₂I₂ were arced between graphite electrodes. The former compound produces free bromine and soot; bromine causes halogenation of the polyynes. In the case of the latter compound, free iodine is released from the arc and the amount of soot produced is comparable to that obtained by arcing CH₂Cl₂.     

Harmonic solution of semiconductor transport equations for microwave and millimetre-wave device modelling

The hydrodynamic transport equations for charges in a semiconductor have been solved for a periodic excitation by means of a harmonic approach, in order to model microwave and millimetre-wave active devices. The solution is based on the expansion of physical variables in a Fourier series in the time domain, and on discretisation in the space domain. A waveform-balance technique in the TD is used to solve the nonlinear equations system. This approach allows for a longer time step with respect to standard TD solutions for most cases of interest, greatly reducing simulation time by at least two orders of magnitude in typical cases. © 2003 Wiley Periodicals, Inc. Int J RF and Microwave CAE 14: 36–48, 2004.