Agent Based Models of Competition and Collaboration

Swarm intelligence is a popular paradigm for algorithm design. Frequently drawing inspiration from natural systems, it assigns simple rules to a set of agents with the aim that, through local interactions, they collectively solve some global problem. Current variants of a popular swarm based optimization algorithm, particle swarm optimization (PSO), are investigated with a focus on premature convergence. A novel variant, dispersive PSO, is proposed to address this problem and is shown to lead to increased robustness and performance compared to current PSO algorithms. A nature inspired decentralised multi-agent algorithm is proposed to solve a constrained problem of distributed task allocation. Agents must collect and process the mail batches, without global knowledge of their environment or communication between agents. New rules for specialisation are proposed and are shown to exhibit improved eciency and exibility compared to existing ones. These new rules are compared with a market based approach to agent control. The eciency (average number of tasks performed), the exibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved eciency and robustness. Evolutionary algorithms are employed, both to optimize parameters and to allow the various rules to evolve and compete. We also observe extinction and speciation. In order to interpret algorithm performance we analyse the causes of eciency loss, derive theoretical upper bounds for the eciency, as well as a complete theoretical description of a non-trivial case, and compare these with the experimental results. Motivated by this work we introduce agent "memory" (the possibility for agents to develop preferences for certain cities) and show that not only does it lead to emergent cooperation between agents, but also to a signicant increase in efficiency.

Ultra-long mode-locked Er-droped fibre lasers

The development of ultra-long (UL) cavity (hundreds of meters to several kilometres) mode-locked fibre lasers for the generation of high-energy light pulses with relatively low (sub-megahertz) repetition rates has emerged as a new rapidly advancing area of laser physics. The first demonstration of high pulse energy laser of this type was followed by a number of publications from many research groups on long-cavity Ytterbium and Erbium lasers featuring a variety of configurations with rather different mode-locked operations. The substantial interest to this new approach is stimulated both by non-trivial underlying physics and by the potential of high pulse energy laser sources with unique parameters for a range of applications in industry, bio-medicine, metrology and telecommunications. It is well known, that pulse generation regimes in mode-locked fibre lasers are determined by the intra-cavity balance between the effects of dispersion and non-linearity, and the processes of energy attenuation and amplification. The highest per-pulse energy has been achieved in normal-dispersion UL fibre lasers mode-locked through nonlinear polarization evolution (NPE) for self-modelocking operation. In such lasers are generated the so-called dissipative optical solitons. The uncompensated net normal dispersion in long-cavity resonatorsusually leads to very high chirp and, consequently, to a relatively long duration of generated pulses. This thesis presents the results of research Er-doped ultra-long (more than 1 km cavity length) fibre lasers mode-locked based on NPE. The self-mode-locked erbium-based 3.5-km-long all-fiber laser with the 1.7 µJ pulse energy at a wavelength of 1.55 µm was developed as a part of this research. It has resulted in direct generation of short laser pulses with an ultralow repetition rate of 35.1 kHz. The laser cavity has net normal-dispersion and has been fabricated from commercially-available telecom fibers and optical-fiber elements. Its unconventional linear-ring design with compensation for polarization instability ensures high reliability of the self-mode-locking operation, despite the use of a non polarization-maintaining fibers. The single pulse generation regime in all-fibre erbium mode-locking laser based on NPE with a record cavity length of 25 km was demonstrated. Modelocked lasers with such a long cavity have never been studied before. Our result shows a feasibility of stable mode-locked operation even for an ultra-long cavity length. A new design of fibre laser cavity – “y-configuration”, that offers a range of new functionalities for optimization and stabilization of mode-locked lasing regimes was proposed. This novel cavity configuration has been successfully implemented into a long-cavity normal-dispersion self-mode-locked Er-fibre laser. In particular, it features compensation for polarization instability, suppression of ASE, reduction of pulse duration, prevention of in-cavity wave breaking, and stabilization of the lasing wavelength. This laser along with a specially designed double-pass EDFA have allowed us to demonstrate anenvironmentally stable all-fibre laser system able to deliver sub-nanosecond high-energy pulses with low level of ASE noise.

Nonlinear spectral management:linearization of the lossless fiber channel

Using the integrable nonlinear Schrodinger equation (NLSE) as a channel model, we describe the application of nonlinear spectral management for effective mitigation of all nonlinear distortions induced by the fiber Kerr effect. Our approach is a modification and substantial development of the so-called eigenvalue communication idea first presented in A. Hasegawa, T. Nyu, J. Lightwave Technol. 11, 395 (1993). The key feature of the nonlinear Fourier transform (inverse scattering transform) method is that for the NLSE, any input signal can be decomposed into the so-called scattering data (nonlinear spectrum), which evolve in a trivial manner, similar to the evolution of Fourier components in linear equations. We consider here a practically important weakly nonlinear transmission regime and propose a general method of the effective encoding/modulation of the nonlinear spectrum: The machinery of our approach is based on the recursive Fourier-type integration of the input profile and, thus, can be considered for electronic or all-optical implementations. We also present a novel concept of nonlinear spectral pre-compensation, or in other terms, an effective nonlinear spectral pre-equalization. The proposed general technique is then illustrated through particular analytical results available for the transmission of a segment of the orthogonal frequency division multiplexing (OFDM) formatted pattern, and through WDM input based on Gaussian pulses. Finally, the robustness of the method against the amplifier spontaneous emission is demonstrated, and the general numerical complexity of the nonlinear spectrum usage is discussed. © 2013 Optical Society of America.

Stability of multi-agent systems

This work attempts to shed light to the fundamental concepts behind the stability of Multi-Agent Systems. We view the system as a discrete time Markov chain with a potentially unknown transitional probability distribution. The system will be considered to be stable when its state has converged to an equilibrium distribution. Faced with the non-trivial task of establishing the convergence to such a distribution, we propose a hypothesis testing approach according to which we test whether the convergence of a particular system metric has occurred. We describe some artificial multi-agent ecosystems that were developed and we present results based on these systems which confirm that this approach qualitatively agrees with our intuition.

Cyberstalking:a new challenge for criminal law

Cyberstalking has recently emerged as a new and growing problem and is an area that will probably receive a higher profile within criminal law as more cases reach court (see Griffiths, 1999; Griffiths, Rogers and Sparrow, 1998; Bojic and McFarlane, 2002a; 2002b). For the purposes of this article we define cyberstalking as the use of information and communications technology (in particular the Internet) in order to harass individuals. Such harassment may include actions such as the transmission of offensive e-mail messages, identity theft and damage to data or equipment. Whilst a more comprehensive definition has been presented elsewhere (Bocij and McFarlane, 2002), it is hoped that the definition here is sufficient for those unfamiliar with this field. The stereotypical stalker conjures up images of someone harassing a victim who is the object of their affection. However, not all stalking incidents are motivated by unrequited love. Stalking can also be motivated by hate, a need for revenge, a need for power and/or racism. Similarly, cyberstalking can involve acts that begin with the issuing of threats and end in physical assault. We also make distinctions between conventional stalking and cyberstalking. Whilst some may view cyberstalking as an extension of conventional stalking, we believe cyberstalking should be regarded as an entirely new form of deviant behaviour. It is not surprising that cyberstalking is sometimes thought of as a trivial problem. A number of writers and researchers have suggested that cyberstalking and associated activities are of little genuine concern. Koch (2000), for example, goes as far as accusing those interested in cyberstalking as promoting hysteria over a problem that may be minuscule or even imaginary. The impression gained is that cyberstalking represents a relatively small problem where victims seldom suffer any real harm. Whilst there are no genuinely reliable statistics that can be used to determine how common cyberstalking incidents are, a great deal of evidence is available to show that cyberstalking is a significant and growing problem (Griffiths et al, 1998). For instance, CyberAngels (a well-known Internet safety organization) receives some 500 complaints of cyberstalking each day, of which up to 100 represent legitimate cases (Dean, 2000). Another Internet safety organization (Working to Halt Online Abuse) reports receiving an average of 100 cases per week (WHOA, 2001). To highlight the types of cyberstalking behaviours that take place and some of the major issues facing criminal law, we briefly examine four high profile cases of cyberstalking (adapted from Bocij and MacFarlane, 2002b).

Evolutionary market agents for resource allocation in decentralised systems

We introduce self-interested evolutionary market agents, which act on behalf of service providers in a large decentralised system, to adaptively price their resources over time. Our agents competitively co-evolve in the live market, driving it towards the Bertrand equilibrium, the non-cooperative Nash equilibrium, at which all sellers charge their reserve price and share the market equally. We demonstrate that this outcome results in even load-balancing between the service providers. Our contribution in this paper is twofold; the use of on-line competitive co-evolution of self-interested service providers to drive a decentralised market towards equilibrium, and a demonstration that load-balancing behaviour emerges under the assumptions we describe. Unlike previous studies on this topic, all our agents are entirely self-interested; no cooperation is assumed. This makes our problem a non-trivial and more realistic one.

Application of Classification Methods to a Problem Related to Specific Groups of E-Government Users

This paper was partly supported by ELOST – a SSA EU project – No 27287.

On Finite Element Methods for 2nd order (semi–) periodic Eigenvalue Problems

We deal with a class of elliptic eigenvalue problems (EVPs) on a rectangle Ω ⊂ R^2 , with periodic or semi–periodic boundary conditions (BCs) on ∂Ω. First, for both types of EVPs, we pass to a proper variational formulation which is shown to fit into the general framework of abstract EVPs for symmetric, bounded, strongly coercive bilinear forms in Hilbert spaces, see, e.g., [13, §6.2]. Next, we consider finite element methods (FEMs) without and with numerical quadrature. The aim of the paper is to show that well–known error estimates, established for the finite element approximation of elliptic EVPs with classical BCs, hold for the present types of EVPs too. Some attention is also paid to the computational aspects of the resulting algebraic EVP. Finally, the analysis is illustrated by two non-trivial numerical examples, the exact eigenpairs of which can be determined.

Examples Illustrating some Aspects of the Weak Deligne-Simpson Problem

Research partially supported by INTAS grant 97-1644

Groups with the Minimal Condition on Non-“Nilpotent-by-Finite” Subgroups

We characterize the groups which do not have non-trivial perfect sections and such that any strictly descending chain of non-“nilpotent-by-finite” subgroups is finite.

Spline Subdivision Schemes for Compact Sets. A Survey

Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, Israel

Fragmentability of the Dual of a Banach Space with Smooth Bump

We prove that if a Banach space X admits a Lipschitz β-smooth bump function, then (X ∗ , weak ∗ ) is fragmented by a metric, generating a topology, which is stronger than the τβ -topology. We also use this to prove that if X ∗ admits a Lipschitz Gateaux-smooth bump function, then X is sigma-fragmentable.

On Extension of Functors onto the Kleisli Category of the Inclusion Hyperspace Monad

It is proved that there exists no extension of any non-trivial weakly normal functor of finite degree onto the Kleisli category of the inclusion hyperspace monad.

On the Structure of Spatial Branching Processes

The paper is a contribution to the theory of branching processes with discrete time and a general phase space in the sense of [2]. We characterize the class of regular, i.e. in a sense sufficiently random, branching processes (Φk) k∈Z by almost sure properties of their realizations without making any assumptions about stationarity or existence of moments. This enables us to classify the clans of (Φk) into the regular part and the completely non-regular part. It turns out that the completely non-regular branching processes are built up from single-line processes, whereas the regular ones are mixtures of left-tail trivial processes with a Poisson family structure.

Speculating About Mountains

∗Partially supported by Grant MM 409/94 of the Mininstry of Education, Science and Technology, Bulgaria. ∗∗Partially supported by Grants MM 521/95, MM 442/94 of the Mininstry of Education, Science and Technology, Bulgaria.