Stability theory and numerical analysis of non-autonomous dynamical systems

The development and use of cocycles for analysis of non-autonomous behaviour is a technique that has been known for several years. Initially developed as an extension to semi-group theory for studying rion-autonornous behaviour, it was extensively used in analysing random dynamical systems [2, 9, 10, 12]. Many of the results regarding asymptotic behaviour developed for random dynamical systems, including the concept of cocycle attractors were successfully transferred and reinterpreted for deterministic non-autonomous systems primarily by P. Kloeden and B. Schmalfuss [20, 21, 28, 29]. The theory concerning cocycle attractors was later developed in various contexts specific to particular classes of dynamical systems [6, 7, 13], although a comprehensive understanding of cocycle attractors (redefined as pullback attractors within this thesis) and their role in the stability of non-autonomous dynamical systems was still at this stage incomplete. It was this purpose that motivated Chapters 1-3 to define and formalise the concept of stability within non-autonomous dynamical systems. The approach taken incorporates the elements of classical asymptotic theory, and refines the notion of pullback attraction with further development towards a study of pull-back stability arid pullback asymptotic stability. In a comprehensive manner, it clearly establishes both pullback and forward (classical) stability theory as fundamentally unique and essential components of non-autonomous stability. Many of the introductory theorems and examples highlight the key properties arid differences between pullback and forward stability. The theory also cohesively retains all the properties of classical asymptotic stability theory in an autonomous environment. These chapters are intended as a fundamental framework from which further research in the various fields of non-autonomous dynamical systems may be extended. A preliminary version of a Lyapunov-like theory that characterises pullback attraction is created as a tool for examining non-autonomous behaviour in Chapter 5. The nature of its usefulness however is at this stage restricted to the converse theorem of asymptotic stability. Chapter 7 introduces the theory of Loci Dynamics. A transformation is made to an alternative dynamical system where forward asymptotic (classical asymptotic) behaviour characterises pullback attraction to a particular point in the original dynamical system. This has the advantage in that certain conventional techniques for a forward analysis may be applied. The remainder of the thesis, Chapters 4, 6 and Section 7.3, investigates the effects of perturbations and discretisations on non-autonomous dynamical systems known to possess structures that exhibit some form of stability or attraction. Chapter 4 investigates autonomous systems with semi-group attractors, that have been non-autonomously perturbed, whilst Chapter 6 observes the effects of discretisation on non-autonomous dynamical systems that exhibit properties of forward asymptotic stability. Chapter 7 explores the same problem of discretisation, but for pullback asymptotically stable systems. The theory of Loci Dynamics is used to analyse the nature of the discretisation, but establishment of results directly analogous to those discovered in Chapter 6 is shown to be unachievable. Instead a case by case analysis is provided for specific classes of dynamical systems, for which the results generate a numerical approximation of the pullback attraction in the original continuous dynamical system. The nature of the results regarding discretisation provide a non-autonomous extension to the work initiated by A. Stuart and J. Humphries [34, 35] for the numerical approximation of semi-group attractors within autonomous systems. . Of particular importance is the effect on the system's asymptotic behaviour over non-finite intervals of discretisation.

Spatial discretization of discrete dynamical systems

Investigates what can go wrong when dynamical systems are modelled with a computer. Number theoretic techniques were used to detail the effects "discretization" errors caused by computer round-off had on characteristics of a system. In particular, a relationship was established between the occurrence of long cycles in a system and the classical result known as Artin's conjecture. Algorithms were then developed which eliminated discretization errors.

What is so ‘primitive’ about ‘primitive democracy’? Comparing the ancient Middle East and classical Athens

This chapter seeks to delve deeper into the ancient history of democracy than is normally permitted, back to a time preceding the developments of classical Athens, when the earliest signs of organized society and complex governmental systems emerged across the ancient Middle East. It then seeks to compare and contrast these ancient Middle Eastern examples with those of classical Athens and to offer new insights into, and questions about, the nature and history of democracy. Building on some recent work (Fleming, 2004; Isakhan, 2007a; Keane, 2009: 78–155), this chapter also hopes to move the discussion beyond the phrase usually associated with ancient Middle Eastern democracies, that of ‘primitive democracy’. This chapter also argues that, while the Middle Eastern experiments were less rigid and formalized, they were in no measurable sense more ‘primitive’ than the later example offered by classical Athens. However, this essay also cautiously notes that, while not all of the elements which made ancient Athens significant occurred in the same way and at the same time in the ancient Middle East, all of them did exist at varying times and in varying guises across these earlier civilizations. To demonstrate this thesis, the remainder of the chapter utilizes several of the key criteria by which we commonly measure Athenian democracy – the functioning of its assembly, the mechanisms of justice and of the law, the varying voting and elective procedures, the rights and freedoms of the citizens, and the systematic exclusion of ‘non-citizens’ – and discusses precedents and parallels drawn from the extant evidence concerning the ancient Middle East.

Aggregation functions for recommender systems

This chapter gives an overview of aggregation functions and their use in recommender systems. The classical weighted average lies at the heart of various recommendation mechanisms, often being employed to combine item feature scores or predict ratings from similar users. Some improvements to accuracy and robustness can be achieved by aggregating different measures of similarity or using an average of recommendations obtained through different techniques. Advances made in the theory of aggregation functions therefore have the potential to deliver increased performance to many recommender systems. We provide definitions of some important families and properties, sophisticated methods of construction, and various examples of aggregation functions in the domain of recommender systems.