Compatibilization of an immiscible blend of EPDM and POM with an Ionomer

Immiscible blends of ethylene-propylene-diene-monomer (EPDM) and polyoxymethylene (POM), when EPDM is the major phase were compatibilized on the addition of an ionomer, poly(ethylene-co-methacrylic acid). The inclusion of the ionomer reduced the interfacial tension between the two phases, such that the diameter of the POM domains were significantly reduced to between 0.5 and 2 μm, typical of that required to toughen ductile polymers. The mechanical properties of the resultant compatibilized blends were significantly enhanced with increases in Young's modulus (↑54%), tensile strength (σ, ↑139%), elongation at break (ε, ↑97%), and tensile toughness (↑500%) with increasing ionomer content, relative to EPDM rubber alone. The ShoreA hardness of the compatibilized blend was 70.1 compared with 56.8 for the immiscible binary blend and, 50.2 for neat EPDM rubber.     

The Nyquist stability criterion in the Nichols chart

The Nyquist stability criterion is a widely used technique for determining in the complex s‐plane the stability of a dynamical system with feedback. This paper presents a practical and comprehensive method to compute the Nyquist stability criterion directly in the Nichols (magnitude/phase) chart. The proposed method also gives guidelines to design controllers to stabilize unstable plants when dealing with frequency domain techniques like the quantitative feedback theory robust control. Copyright © 2015 John Wiley & Sons, Ltd.     

Notes on spiking neural P systems and finite automata

Spiking neural P systems (in short, SN P systems) are membrane computing models inspired by the pulse coding of information in biological neurons. SN P systems with standard rules have neurons that emit at most one spike (the pulse) each step, and have either an input or output neuron connected to the environment. A variant known as SN P modules generalize SN P systems by using extended rules (more than one spike can be emitted each step) and a set of input and output neurons. In this work we continue relating SN P modules and finite automata. In particular, we amend and improve previous constructions for the simulatons of deterministic finite automata and state transducers. Our improvements reduce the number of neurons from three down to one, so our results are optimal. We also simulate finite automata with output, and we use these simulations to generate automatic sequences.     

Parallel simulation of Population Dynamics P systems: updates and roadmap

Population Dynamics P systems are a type of multienvironment P systems that serve as a formal modeling framework for real ecosystems. The accurate simulation of these probabilistic models, e.g. with Direct distribution based on Consistent Blocks Algorithm, entails large run times. Hence, parallel platforms such as GPUs have been employed to speedup the simulation. In 2012, the first GPU simulator of PDP systems was presented. However, it was able to run only randomly generated PDP systems. In this paper, we present current updates made on this simulator, involving an input modu le for binary files and an output module for CSV files. Finally, the simulator has been experimentally validated with a real ecosystem model, and its performance has been tested with two high-end GPUs: Tesla C1060 and K40.     

Advantages of Model Driven Engineering for studying complex systems

The evaluation of the emergent behaviour in complex systems requires an analytical framework which allows the observation of different phenomena that take place at different levels. In order to observe the dynamics of complex systems, it is necessary to perform simulations so that both local and the emergent behaviour can be observed. To this end, the way in which complex system simulators are built must be examined so that it will be feasible to model large scale scenarios. In this paper, the use of Model Driven Engineering methodology is proposed to deal with this issue. Among other benefits, it is shown that this methodology allows the representation and simulation of a complex system providing support for the analysis. This analysis is supported by a metamodel which describes the system components that are under study. The application of this methodology to the development of large scale simulators is explored through a case study. This case study analyses a complex socio-technical system: a power grid.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.     

Artificial institutions: a model of institutional reality for open multiagent systems

Software agents’ ability to interact within different open systems, designed by different groups, presupposes an agreement on an unambiguous definition of a set of concepts, used to describe the context of the interaction and the communication language the agents can use. Agents’ interactions ought to allow for reliable expectations on the possible evolution of the system; however, in open systems interacting agents may not conform to predefined specifications. A possible solution is to define interaction environments including a normative component, with suitable rules to regulate the behaviour of agents. To tackle this problem we propose an application-independent metamodel of artificial institutions that can be used to define open multiagent systems. In our view an artificial institution is made up by an ontology that models the social context of the interaction, a set of authorizations to act on the institutional context, a set of linguistic conventions for the performance of institutional actions and a system of norms that are necessary to constrain the agents’ actions.     

Analytical formulation to compute QFT bounds: The envelope method

This paper describes an analytical formulation to compute quantitative feedback theory (QFT) bounds in one‐degree‐of‐freedom feedback control problems. The new approach is based on envelope curves and shows that a QFT control specification can be expressed as a family of circumferences. Then, the controller bound is defined by the envelope curve of this family and can be obtained as an analytical function. This offers the possibility of studying the QFT bounds in an analytical way with several useful properties. Gridding methods are avoided, resulting in a lower computational effort procedure. The new formulation improves the accuracy of previous methods and allows the designer to calculate multivalued bounds. Copyright © 2009 John Wiley & Sons, Ltd.     

Support vector classification of proteomic profile spectra based on feature extraction with the bi-orthogonal discrete wavelet transform

Automatic classification of high-resolution mass spectrometry data has increasing potential to support physicians in diagnosis of diseases like cancer. The proteomic data exhibit variations among different disease states. A precise and reliable classification of mass spectra is essential for a successful diagnosis and treatment. The underlying process to obtain such reliable classification results is a crucial point. In this paper such a method is explained and a corresponding semi automatic parameterization procedure is derived. Thereby a simple straightforward classification procedure to assign mass spectra to a particular disease state is derived. The method is based on an initial preprocessing stage of the whole set of spectra followed by the bi-orthogonal discrete wavelet transform (DWT) for feature extraction. The approximation coefficients calculated from the scaling function exhibit a high peak pattern matching property and feature a denoising of the spectrum. The discriminating coefficients, selected by the Kolmogorov–Smirnov test are finally used as features for training and testing a support vector machine with both a linear and a radial basis kernel. For comparison the peak areas obtained with the it ClinProt-System ¹ [33] were analyzed using the same support vector machines. The introduced approach was evaluated on clinical MALDI-MS data sets with two classes each originating from cancer studies. The cross validated error rates using the wavelet coefficients where better than those obtained from the peak areas².     

Efficient simulation of tissue-like P systems by transition cell-like P systems

In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.