Integratable non-clogging microconcentrator based on counter-flow principle for continuous enrichment of CaSki cells sample

This study addresses the need to reduce the risk of clogging when preparing samples for cell concentration, i.e., the CaSki Cell-lines (epidermoid cervical carcinoma cells). Aiming to develop a non-clogging microconcentrator, we proposed a new counter-flow concentration unit characterized by the directions of penetrating flows being at an obtuse angle to the main flow, due to employment of streamlined turbine blade-like micropillars. Based on the optimization results of the counter-flow unit profile, a fractal arrangement for the counter-flow concentration unit was developed. A counter-flow microconcentrator chip was then designed and fabricated, with both the processing layer and collecting layer arranged in terms of the honeycomb structure. Visualized experiments using CaSki cell samples on the microconcentrator chip demonstrated that no cell-clogging phenomena occurred during the test and that no cells were found in the final filtrate. The test results show an excellent concentration performance for the microconcentrator chip, while a concentrating ratio of >4 with the flow rate being below 1.0 ml/min. As only geometrical structure is employed in the passive device, the counter-flow microconcentrator can be easily integrated into advanced microfluidic systems. Owing to the merit of non-clogging and continuous processing ability, the counter-flow microconcentrator is not only suitable for the sample preparation within biomedical field, but also applicable in water-particle separation.     

Computational study on the interaction of a ring-hydroxylating dioxygenase from Sphingomonas CHY-1 with PAHs

The massive computational resources available in the framework of a grid paradigm approach represent an emerging tool in the bioinformatics field. In this paper, we used the above approach in the rapid determination of the interactions between the ring-hydroxylating dioxygenase, comprised six enzymatic subunits, and polycyclic aromatic hydrocarbons (PAHs) in their optimal positions. The results were obtained by simulating enzyme dynamics at 300 K through molecular dynamics calculations. For the first time, the equilibrated structure of the dioxygenase revealed a network of channels throughout the enzyme that were sufficiently large to allow a flow of small ions or molecules from the inner core of the complex to its exterior surface. The ring-hydroxylating dioxygenase was able to interact with some of the studied PAHs. Additionally, not only the number of aromatic rings but also the PAH shape were critical in predicting the ability of the dioxygenase to interact with these types of molecules. Docking calculations shed light on a new possible binding site that is far from the enzymatic one, which is potentially interesting in considering the stability of the enzyme itself.     

Minutia Cylinder-Code: a new representation and matching technique for fingerprint recognition

In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriented coding, some simple but very effective metrics can be defined to compute local similarities and to consolidate them into a global score. Extensive experiments over FVC2006 databases prove the superiority of MCC with respect to three well-known techniques and demonstrate the feasibility of obtaining a very effective (and interoperable) fingerprint recognition implementation for light architectures.     

Stochastic algorithms for robustness of control performances

In recent years, there has been a growing interest in developing statistical learning methods to provide approximate solutions to “difficult” control problems. In particular, randomized algorithms have become a very popular tool used for stability and performance analysis as well as for design of control systems. However, as randomized algorithms provide an efficient solution procedure to the “intractable” problems, stochastic methods bring closer to understanding the properties of the real systems. The topic of this paper is the use of stochastic methods in order to solve the problem of control robustness: the case of parametric stochastic uncertainty is considered. Necessary concepts regarding stochastic control theory and stochastic differential equations are introduced. Then a convergence analysis is provided by means of the Chernoff bounds, which guarantees robustness in mean and in probability. As an illustration, the robustness of control performances of example control systems is computed.     

On the collective sort problem for distributed tuple spaces

In systems coordinated with a distributed set of tuple spaces, it is crucial to assist agents in retrieving the tuples they are interested in. This can be achieved by sorting techniques that group similar tuples together in the same tuple space, so that the position of a tuple can be inferred by similarity. Accordingly, we formulate the collective sort problem for distributed tuple spaces, where a set of agents is in charge of moving tuples up to a complete sort has been reached, namely, each of the N tuple spaces aggregate tuples belonging to one of the N kinds available. After pointing out the requirements for effectively tackling this problem, we propose a self-organizing solution resembling brood sorting performed by ants. This is based on simple agents that perform partial observations and accordingly take decisions on tuple movement. Convergence is addressed by a fully adaptive method for simulated annealing, based on noise tuples inserted and removed by agents on a need basis so as to avoid sub-optimal sorting. Emergence of sorting properties and scalability are evaluated through stochastic simulations.     

Active fault tolerant control of discrete event systems using online diagnostics

The aim of this paper is to deal with the problem of fault tolerant control in the framework of discrete event systems modeled as automata. A fault tolerant controller is a controller able to satisfy control specifications both in nominal operation and after the occurrence of a fault. This task is solved by means of a parameterized controller that is suitably updated on the basis of the information provided by online diagnostics: the supervisor actively reacts to the detection of a malfunctioning component in order to eventually meet degraded control specifications. Starting from an appropriate model of the system, we recall the notion of safe diagnosability as a necessary step in order to achieve fault tolerant control. We then introduce two new notions: (i) “safe controllability”, which represents the capability, after the occurrence of a fault, of steering the system away from forbidden zones and (ii) “active fault tolerant system”, which is the property of safely continuing operation after faults. Finally, we show how the problem can be solved using a general control architecture based on the use of special kind of diagnoser, called “diagnosing controller”, which is used to safely detect faults and to switch between the nominal control policy and a bank of reconfigured control policies. A simple example is used to illustrate the new notions and the control architecture introduced in the paper.     

Experiments on the reliability of stochastic spiking neural P systems

In the area of membrane computing, time-freeness has been defined as the ability for a timed membrane system to produce always the same result, independently of the execution times associated to the rules. In this paper, we use a similar idea in the framework of spiking neural P systems, a model inspired by the structure and the functioning of neural cells. In particular, we introduce stochastic spiking neural P systems where the time of firing for an enabled spiking rule is probabilistically chosen and we investigate when, and how, these probabilities can influence the ability of the systems to simulate, in a reliable way, universal machines, such as register machines.     

Adaptive course generation through learning styles representation

This paper presents an approach to automatic course generation and student modeling. The method has been developed during the European funded projects Diogene and Intraserv, focused on the construction of an adaptive e-learning platform. The aim of the platform is the automatic generation and personalization of courses, taking into account pedagogical knowledge on the didactic domain as well as statistic information on both the student’s knowledge degree and learning preferences. Pedagogical information is described by means of an innovative methodology suitable for effective and efficient course generation and personalization. Moreover, statistic information can be collected and exploited by the system in order to better describe the student’s preferences and learning performances. Learning material is chosen by the system matching the student’s learning preferences with the learning material type, following a pedagogical approach suggested by Felder and Silverman. The paper discusses how automatic learning material personalization makes it possible to facilitate distance learning access to both able-bodied and disabled people. Results from the Diogene and Intraserv evaluation are reported and discussed.     

Simulating Emergent Properties of Coordination in Maude: the Collective Sort Case

Recent coordination languages and models are moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organization are exploited in order to tackle the openness, dynamism and unpredictability of today's distributed systems. In this area, systems are to be described using stochastic models, and simulation is a valuable tool both for analysis and design. Accordingly, in this work we focused on modelling and simulating emergent properties of coordination techniques.We first develop a framework acting as a general-purpose engine for simulating stochastic transition systems, built as a library for the Maude term rewriting system. We then evaluate this tool to a coordination problem called collective sort, where autonomous agents move tuples across different tuple spaces according to local criteria, and resulting in the emergence of the complete clustering property.     

Site-specific electronic structure analysis by channeling EELS and first-principles calculations

Site-specific electronic structures were investigated by electron energy loss spectroscopy (EELS) under electron channeling conditions. The Al-K and Mn-L(2,3) electron energy loss near-edge structure (ELNES) of, respectively, NiAl2O4 and Mn3O4 were measured. Deconvolution of the raw spectra with the instrumental resolution function restored the blunt and hidden fine features, which allowed us to interpret the experimental spectral features by comparing with theoretical spectra obtained by first-principles calculations. The present method successfully revealed the electronic structures specific to the differently coordinated cationic sites.