arXiv subjects

Mark Burgess

Publications and source records attributed to Mark Burgess.

At least 37 records · Page 2Linked to original sources

arXiv2017

Spacetimes with Semantics (III) - The Structure of Functional Knowledge Representation and Artificial Reasoning

Using the previously developed concepts of semantic spacetime, I explore the interpretation of knowledge representations, and their structure, as a semantic system, within the framework of promise theory. By assigning interpretations to phenomena, from observers to observed, we may approach a simple description of knowledge-based functional systems, with direct practical utility. The focus is especially on the interpretation of concepts, associative knowledge, and context awareness. The inference seems to be that most if not all of these concepts emerge from purely semantic spacetime properties, which opens the possibility for a more generalized understanding of what constitutes a learning, or even `intelligent' system. Some key principles emerge for effective knowledge representation: 1) separation of spacetime scales, 2) the recurrence of four irreducible types of association, by which intent propagates: aggregation, causation, cooperation, and similarity, 3) the need for discrimination of identities (discrete), which is assisted by distinguishing timeline simultaneity from sequential events, and 4) the ability to learn (memory). It is at least plausible that emergent knowledge abstraction capabilities have their origin in basic spacetime structures. These notes present a unified view of mostly well-known results; they allow us to see information models, knowledge representations, machine learning, and semantic networking (transport and information base) in a common framework. The notion of `smart spaces' thus encompasses artificial systems as well as living systems, across many different scales, e.g. smart cities and organizations.

cs.AI↗

arXiv2017

A Spacetime Approach to Generalized Cognitive Reasoning in Multi-scale Learning

In modern machine learning, pattern recognition replaces realtime semantic reasoning. The mapping from input to output is learned with fixed semantics by training outcomes deliberately. This is an expensive and static approach which depends heavily on the availability of a very particular kind of prior raining data to make inferences in a single step. Conventional semantic network approaches, on the other hand, base multi-step reasoning on modal logics and handcrafted ontologies, which are ad hoc, expensive to construct, and fragile to inconsistency. Both approaches may be enhanced by a hybrid approach, which completely separates reasoning from pattern recognition. In this report, a quasi-linguistic approach to knowledge representation is discussed, motivated by spacetime structure. Tokenized patterns from diverse sources are integrated to build a lightly constrained and approximately scale-free network. This is then be parsed with very simple recursive algorithms to generate `brainstorming' sets of reasoned knowledge.

cs.AI↗

arXiv2016

On the scaling of functional spaces, from smart cities to cloud computing

The study of spacetime, and its role in understanding functional systems has received little attention in information science. Recent work, on the origin of universal scaling in cities and biological systems, provides an intriguing insight into the functional use of space, and its measurable effects. Cities are large information systems, with many similarities to other technological infrastructures, so the results shed new light indirectly on the scaling the expected behaviour of smart pervasive infrastructures and the communities that make use of them. Using promise theory, I derive and extend the scaling laws for cities to expose what may be extrapolated to technological systems. From the promise model, I propose an explanation for some anomalous exponents in the original work, and discuss what changes may be expected due to technological advancement.

cs.CY↗

arXiv2015

Spacetimes with Semantics (II), Scaling of agency, semantics, and tenancy

Using Promise Theory as a calculus, I review how to define agency in a scalable way, for the purpose of understanding semantic spacetimes. By following simple scaling rules, replacing individual agents with `super-agents' (sub-spaces), it is shown how agency can be scaled both dynamically and semantically. The notion of occupancy and tenancy, or how space is used and filled in different ways, is also defined, showing how spacetime can be shared between independent parties, both by remote association and local encapsulation. I describe how to build up dynamic and semantic continuity, by joining discrete individual atoms and molecules of space into quasi-continuous lattices.

cs.MA↗

arXiv2014

Spacetimes with Semantics

Relationships between objects constitute our notion of space. When these relationships change we interpret this as the passage of time. Observer interpretations are essential to the way we understand these relationships. Hence observer semantics are an integral part of what we mean by spacetime. Semantics make up the essential difference in how one describes and uses the concept of space in physics, chemistry, biology and technology. In these notes, I have tried to assemble what seems to be a set of natural, and pragmatic, considerations about discrete, finite spacetimes, to unify descriptions of these areas. It reviews familiar notions of spacetime, and brings them together into a less familiar framework of promise theory (autonomous agents), in order to illuminate the goal of encoding the semantics of observers into a description of spacetime itself. Autonomous agents provide an exacting atomic and local model for finite spacetime, which quickly reveals the issues of incomplete information and non-locality. From this we should be able to reconstruct all other notions of spacetime. The aim of this exercise is to apply related tools and ideas to an initial unification of real and artificial spaces, e.g. databases and information webs with natural spacetime. By reconstructing these spaces from autonomous agents, we may better understand naming and coordinatization of semantic spaces, from crowds and swarms to datacentres and libraries, as well as the fundamental arena of natural science.

cs.MA↗

arXiv2014

A Promise Theory Perspective on Data Networks

Networking is undergoing a transformation throughout our industry. The need for scalable network control and automation shifts the focus from hardware driven products with ad hoc control to Software Defined Networks. This process is now well underway. In this paper, we adopt the perspective of the Promise Theory to examine the current and future states of networking technologies. The goal is to see beyond specific technologies, topologies and approaches and define principles. Promise Theory's bottom-up modeling has been applied to server management for many years and lends itself to principles of self-healing, scalability and robustness.

cs.NI↗

arXiv2014

A static theory of promises

We discuss for the concept of promises within a framework that can be applied to either humans or technology. We compare promises to the more established notion of obligations and find promises to be both simpler and more effective at reducing uncertainty in behavioural outcomes.

cs.MA↗

arXiv2014

Promises, Impositions, and other Directionals

Promises, impositions, proposals, predictions, and suggestions are categorized as voluntary co-operational methods. The class of voluntary co-operational methods is included in the class of so-called directionals. Directionals are mechanisms supporting the mutual coordination of autonomous agents. Notations are provided capable of expressing residual fragments of directionals. An extensive example, involving promises about the suitability of programs for tasks imposed on the promisee is presented. The example illustrates the dynamics of promises and more specifically the corresponding mechanism of trust updating and credibility updating. Trust levels and credibility levels then determine the way certain promises and impositions are handled. The ubiquity of promises and impositions is further demonstrated with two extensive examples involving human behaviour: an artificial example about an agent planning a purchase, and a realistic example describing technology mediated interaction concerning the solution of pay station failure related problems arising for an agent intending to leave the parking area.

cs.MA↗

arXiv2009

Local and Global Trust Based on the Concept of Promises

We use the notion of a promise to define local trust between agents possessing autonomous decision-making. An agent is trustworthy if it is expected that it will keep a promise. This definition satisfies most commonplace meanings of trust. Reputation is then an estimation of this expectation value that is passed on from agent to agent. Our definition distinguishes types of trust, for different behaviours, and decouples the concept of agent reliability from the behaviour on which the judgement is based. We show, however, that trust is fundamentally heuristic, as it provides insufficient information for agents to make a rational judgement. A global trustworthiness, or community trust can be defined by a proportional, self-consistent voting process, as a weighted eigenvector-centrality function of the promise theoretical graph.

cs.MA↗

arXiv2008

Program Promises

The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML).

cs.SE↗

arXiv2007

A process algebra based framework for promise theory

We present a process algebra based approach to formalize the interactions of computing devices such as the representation of policies and the resolution of conflicts. As an example we specify how promises may be used in coming to an agreement regarding a simple though practical transportation problem.

cs.LO↗

arXiv2001

Covariant approach to equilibration in effective field theories

The equilibration of two coupled reservoirs is studied using a Green function approach which is suitable for future development with the closed time path method. The problem is solved in two parameterizations, in order to demonstrate the non-trivial issues of parameterization in both the intermediate steps and the interpretation of physical quantities. We use a covariant approach to find self-consistent solutions for the statistical distributions as functions of time. We show that by formally introducing covariant connections, one can rescale a slowly varying non-equilibrium theory so that it appears to be an equilibrium one, for the purposes of calculation. We emphasize the importance of properly tracking variable redefinitions in order to correctly interpret physical quantities.

hep-ph↗

arXiv2000

On the theory of system administration

This paper describes necessary elements for constructing theoretical models of network and system administration. Armed with a theoretical model it becomes possible to determine best practices and optimal strategies in a way which objectively relates policies and assumptions to results obtained. It is concluded that a mixture of automation and human, or other intelligent incursion is required to fully implement system policy with current technology. Some aspects of the author's immunity model for automated system administration are explained, as an example. A theoretical framework makes the prediction that the optimal balance between resource availability and garbage collection strategies is encompassed by the immunity model.

cs.OH↗

arXiv1998

Effective field theories of non-equilibrium physics

Non equilibrium effective field theory is presented as an inhomogeneous field theory, using a formulation which is analogous to that of a gauge theory. This formulation underlines the importance of structural aspects of non-equilibrium, effective field theories. It is shown that, unless proper attention is paid to such structural features, hugely different answers can be obtained for a given model. The exactly soluble two-level atom is used as an example of both the covariant methodology and of the conclusions.

hep-th↗

arXiv1998

Effective field theory of resonant 2-level atoms

The phenomenological two-level atom is re-analysed using the methods of effective field theory. By presenting the Dicke-Jaynes-Cummings model in real space, an exact diagonalization is accomplished going beyond the rotating wave approximation. The meaning of the symmetries and conserved quantities in the theory is discussed and the model is related to non-equilibrium field theory. The structure of the solution raises a question about the rotating wave approximation in quantum mechanics.

quant-ph↗

arXiv1997

Object orientation and visualization of physics in two dimensions

We present a generalized framework for cellular/lattice based visualizations in two dimensions based on state of the art computing abstractions. Our implementation takes the form of a library of reusable functions written in C++ which hides complex graphical programming issues from the user and mimics the algebraic structure of physics at the Hamiltonian level. Our toolkit is not just a graphics library but an object analysis of physical systems which disentangles separate concepts in a faithful analytical way. It could be rewritten in other languages such as Java and extended to three dimensional systems straightforwardly. We illustrate the usefulness of our analysis with implementations of spin-films (the two-dimensional XY model with and without an external magnetic field) and a model for diffusion through a triangular lattice.

cond-mat↗

arXiv1997

The Effective Action for a Relativistic Jaynes-Cummings Model

We describe an effective field theory for atomic lasers which reduces to the Jaynes-Cummings model in the non-relativistic, single mode limit. Our action describes a multi-mode system, with general polarizations and Lorentz invariance and can therefore be used in all contexts from the astrophysical to the laboratory. We show how to compute the effective action for this model and perform the calculation explicitly at the one loop level. Our model provides a way of analyzing a many-particle, two-state model with arbitrary boundary conditions.

quant-ph↗

arXiv1995

Quantum fields in disequilibrium: neutral scalar bosons with long-range, inhomogeneous perturbations

Using Schwinger's quantum action principle, dispersion relations are obtained for neutral scalar mesons interacting with bi-local sources. These relations are used as the basis of a method for representing the effect of interactions in the Gaussian approximation to field theory, and it is argued that a marked inhomogeneity, in space-time dependence of the sources, forces a discrete spectrum on the field. The development of such a system is characterized by features commonly associated with chaos and self-organization (localization by domain or cell formation). The Green functions play the role of an iterative map in phase space. Stable systems reside at the fixed points of the map. The present work can be applied to self-interacting theories by choosing suitable properties for the sources. Rapid transport leads to a second order phase transition and anomalous dispersion. Finally, it is shown that there is a compact representation of the non-equilibrium dynamics in terms of generalized chemical potentials, or equivalently as a pseudo-gauge theory, with an imaginary charge. This analogy shows, more clearly, how dissipation and entropy production are related to the source picture and transform a flip-flop like behaviour between two reservoirs into the Landau problem in a constant `magnetic field'. A summary of conventions and formalism is provided as a basis for future work.

hep-th↗