Regularized continuous estimation of distribution algorithms

Regularization is a well-known technique in statistics for model estimation which is used to improve the generalization ability of the estimated model. Some of the regularization methods can also be used for variable selection that is especially useful in high-dimensional problems. This paper studies the use of regularized model learning in estimation of distribution algorithms (EDAs) for continuous optimization based on Gaussian distributions. We introduce two approaches to the regularized model estimation and analyze their effect on the accuracy and computational complexity of model learning in EDAs. We then apply the proposed algorithms to a number of continuous optimization functions and compare their results with other Gaussian distribution-based EDAs. The results show that the optimization performance of the proposed RegEDAs is less affected by the increase in the problem size than other EDAs, and they are able to obtain significantly better optimization values for many of the functions in high-dimensional settings.     

HPC on the Grid: The Theophys Experience

The Grid Virtual Organization (VO) “Theophys”, associated to the INFN (Istituto Nazionale di Fisica Nucleare), is a theoretical physics community with various computational demands, spreading from serial, SMP, MPI and hybrid jobs. That has led, in the past 20 years, towards the use of the Grid infrastructure for serial jobs, while the execution of multi-threaded, MPI and hybrid jobs has been performed in several small-medium size clusters installed in different sites, with access through standard local submission methods. This work analyzes the support for parallel jobs in the scientific Grid middlewares, then describes how the community unified the management of most of its computational need (serial and parallel ones) using the Grid through the development of a specific project which integrates serial e parallel resources in a common Grid based framework. A centralized national cluster is deployed inside this framework, providing “Wholenodes” reservations, CPU affinity, and other new features supporting our High Performance Computing (HPC) applications in the Grid environment. Examples of the cluster performance for relevant parallel applications in theoretical physics are reported, focusing on the different kinds of parallel jobs that can be served by the new features introduced in the Grid.     

Evaluation of messaging middleware for high-performance cloud computing

Cloud computing is posing several challenges, such as security, fault tolerance, access interface singularity, and network constraints, both in terms of latency and bandwidth. In this scenario, the performance of communications depends both on the network fabric and its efficient support in virtualized environments, which ultimately determines the overall system performance. To solve the current network constraints in cloud services, their providers are deploying high-speed networks, such as 10 Gigabit Ethernet. This paper presents an evaluation of high-performance computing message-passing middleware on a cloud computing infrastructure, Amazon EC2 cluster compute instances, equipped with 10 Gigabit Ethernet. The analysis of the experimental results, confronted with a similar testbed, has shown the significant impact that virtualized environments still have on communication performance, which demands more efficient communication middleware support to get over the current cloud network limitations.     

A Web services-based framework for building componentized digital libraries

We present a new Web services-based framework for building componentized digital libraries (DLs). We particularly demonstrate how traditional RDBMS technology can be easily deployed to support several common digital library services. Configuration and customization of the framework to build specialized systems is supported by a wizard-like tool which is based on a generic metamodel for DLs. Such a tool implements a workflow process that segments the DL design tasks into well-defined steps and drives the designer along these steps. Both the framework and the configuration tool are evaluated in terms of several performance and usability criteria. Our experimental evaluation demonstrates the feasibility and superior performance of our framework, as well as the effectiveness of the wizard tool for setting up DLs.     

A class of high performance Maekawa-type algorithms for distributed systems under heavy demand

Summary Distributed Mutual Exclusion algorithms have been mainly compared using the number of messages exchanged per critical section execution. In such algorithms, no attention has been paid to the serialization order of the requests. Indeed, they adopt FCFS discipline. Conversely, the insertion of priority serialization disciplines, such as Short-Job-First, Head-Of-Line, Shortest-Remaining-Job-First etc., can be useful in many applications to optimize some performance indices. However, such priority disciplines are prone to starvation. The goal of this paper is to investigate and evaluate the impact of the insertion of a priority discipline in Maekawa-type algorithms. Priority serialization disciplines will be inserted by means of agated batch mechanism which avoids starvation. In a distributed algorithm, such a mechanism needs synchronizations among the processes. In order to highlight the usefulness of the priority based serialization discipline, we show how it can be used to improve theaverage response time compared to the FCFS discipline. The gated batch approach exhibits other advantages: algorithms are inherently deadlock-free and messages do not need to piggyback timestamps. We also show that, under heavy demand, algorithms using gated batch exchange less messages than Maekawa-type algorithms per critical section excution. Roberto Baldoni was born in Rome on February 1, 1965. He received the Laurea degree in electronic engineering in 1990 from the University of Rome La Sapienza and the Ph.D. degree in Computer Science from the University of Rome La Sapienza in 1994. Currently, he is a researcher in computer science at IRISA, Rennes (France). His research interests include operating systems, distributed algorithms, network protocols and real-time multimedia applications. Bruno Ciciani received the Laurea degree in electronic engineering in 1980 from the University of Rome La Sapienza. From 1983 to 1991 he has been a researcher at the University of Rome Tor Vergata. He is currently full professor in Computer Science at the University of Rome La Sapienza. His research activities include distributed computer systems, fault-tolerant computing, languages for parallel processing, and computer system performance and reliability evaluation. He has published in IEEE Trans. on Computers, IEEE Trans. on Knowledge and Data Engineering, IEEE Trans. on Software Engineering and IEEE Trans. on Reliability. He is the author of a book titled Manufactoring Yield Evaluation of VLSI/WSI Systems to be published by IEEE Computer Society Press.This research was supported in part by the Consiglio Nazionale delle Ricerche under grant 93.02294.CT12This author is also supported by a grant of the Human Capital and Mobility project of the European Community under contract No. 3702 CABERNET     

Light Controlled Biohybrid Microbots

Biohybrid microbots integrate biological actuators and sensors into synthetic chassis with the aim of providing the building blocks of next-generation micro-robotics. One of the main challenges is the development of self-assembled systems with consistent behavior and such that they can be controlled independently to perform complex tasks. Herein, it is shown that, using light-driven bacteria as propellers, 3D printed microbots can be steered by unbalancing light intensity over different microbot parts. An optimal feedback loop is designed in which a central computer projects onto each microbot a tailor-made light pattern, calculated from its position and orientation. In this way, multiple microbots can be independently guided through a series of spatially distributed checkpoints. By exploiting a natural light-driven proton pump, these bio-hybrid microbots are able to extract mechanical energy from light with such high efficiency that, in principle, hundreds of these systems can be controlled simultaneously with a total optical power of just a few milliwatts.     

Photocatalytic activity of a new composite material of Fe (III) oxide nanoparticles wrapped by a matrix of polymeric carbon nitride and amorphous carbon

Polymeric carbon nitride was synthesized from urea and doped with Cu and Fe to act as co-catalysts. The material doped with Fe was a new composite material composed of Fe(III) oxides (acting as a co-catalyst) wrapped by the polymer layers and amorphous carbon. Furthermore, the copper doped material was described in a previous report. The photocatalytic degradation of the azo dye direct blue 1 (DB) was studied using as photocatalysts: pure carbon nitride (CN), carbon nitride doped with Cu (CN-Cu) and carbon nitride doped with Fe (CN-Fe). The catalysts were characterized by Fourier transform infrared (FTIR) spectroscopy, X-ray diffraction (XRD), by X-ray photoelectron spectroscopy (XPS) and Brunauer–Emmett–Teller method (BET), etc. The adsorption phenomenon was studied using the Langmuir and Freundlich models. For the kinetic study, a solution of 500 mg L^?1 of DB1 was treated with each catalyst, visible light and H₂O₂. The dye concentration was measured by spectrophotometry at the wavelength of 565 nm, and the removal of the total organic content (TOC) was quantified. BET analysis yielded surface areas of 60.029, 20.116 and 70.662 m²g^?1 for CN, CN-Cu and CN-Fe, respectively. The kinetics of degradation were pseudo-first order, whose constants were 0.093, 0.039 and 0.110 min^?1 for CN, CN-Cu and CN-Fe, respectively. The total organic carbon (TOC) removal reached the highest value of 14.46% with CN-Fe.     

How can Cleaner Production practices contribute to meet ISO 14001 requirements? Critical analysis from a survey with industrial companies

The companies’ needs to adopt changes in their way of production to maximize the environmental performance required by their stakeholders, and at the same time, to maximize their economic and market performance, have made them seek for environmental strategies and certifications. In this sense, the Cleaner Production and the Environmental Management System based on ISO 14001 have been, respectively, presented, since the main objective of this research is to identify and analyze Cleaner Production contributions to comply with ISO 14001 requirements. For such, a survey research has been carried out in Brazilian industrial companies certified by ISO 14001. We have identified the main performance factors by leading practices and variables of Cleaner Production that contribute to the compliance with the standard requirements by companies. Thus, it has been noted that Cleaner Production is an important strategy for the preparation of companies for certification as well as for improving their environmental performance.     

Comparing Syntactic and Semantic Action Refinement

The semantic definition of action refinement on labelled configuration structures is compared with the notion ofsyntactic substitution, which can be used as another notion of action refinement in a process algebraic setting. The comparison is done by studying a process algebra equipped with sequential composition, parallel composition with an explicit synchronisation set, and an operator for action refinement. On the one hand, the language (including the refinement operator) is given a configuration structure semantics. On the other hand, a reduction procedure transforms a process termPinto aflatterm (i.e., with the refinement operator not occurring in it)red(P) by means of syntactic substitution, defined in a structural inductive way. The main aim of the paper is to investigate general conditions under which the termsPandred(P) have the same semantics. The results we present are essentially dependent on the question whether the refined action can be synchronised or not. In the latter case,Pandred(P) give rise to isomorphic configuration structures under mild assumptions. The former case is considerably more difficult, since then refinement cannot be expected to distribute over parallel composition. We give necessary and sufficientsemanticconditions under which distribution still holds up to semantic equivalence. Subsequently, we also give sufficient (but not necessary)syntacticconditions for reducible terms. Finally, we generalise these results to a language with recursion.