Breaking Bad in Cyberspace: Understanding why and how Black Hat Hackers Manage their Nerves to Commit their Virtual Crimes

Information Systems Frontiers - What is happening in hacker’s minds when they are committing criminal activities? How black hat hackers manage nerves, which is about managing fear and...     

A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs

Pattern Analysis and Applications - Nearest neighbor search is a powerful abstraction for data access; however, data indexing is troublesome even for approximate indexes. For intrinsically...     

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.     

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.     

Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

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.     

Line patterning of graphite and the fabrication of cheap, inexpensive, “throw-away” sensors

A new simple method (“line patterning technique”) using only standard office equipment is described whereby clearly defined, electrically conducting patterns of graphite can be deposited on polymer (plastic) or paper substrates. The properties of the conductive patterns have been characterized by electrical conductivity and SEM measurements. Sensors were constructed by using interdigitated patterns of graphite deposited on plastic and paper, and coated with a thin film of conducting electronic polymer, e.g. polyaniline emeraldine salt.     

The effect of surfaces on the tunneling density of states of an anisotropically paired superconductor

We present calculations of the tunneling density of states in an anisotropically paired superconductor for two different sample geometries: a semi-infinite system with a single specular wall, and a slab of finite thickness and infinite lateral extent. In both cases we are interested in the effects of surface pair breaking on the tunneling spectrum. We take the stable bulk phase to be of d_x ²–y² symmetry. Our calculations are performed within two different band structure environments: an isotropic cylindrical Fermi surface with a bulk order parameter of the form k _x ² –k _y ² , and a nontrivial tight-binding Fermi surface with the order parameter structure coming from an antiferromagnetic spin-fluctuation model. In each case we find additional structures in the energy spectrum coming from the surface layer. These structures are sensitive to the orientation of the surface with respect to the crystal lattice, and have their origins in the detailed form of the momentum and spatial dependence of the order parameter. By means of tunneling spectroscopy, one can obtain information on both the anisotropy of the energy gap, ¦(p)¦, as well as on the phase of the order parameter, (p) = ¦(p)¦ e^i(p).