Review of Women and Violent Crime in Enlightenment Scotland

Female serial killers, women suicide bombers and the increasing number, and escalating violence, of girl gangs in the late twentieth century force us to question powerful cultural stereotypes that women are inherently nonaggressive. Women are more commonly cast as the victim of violent behaviour, not the aggressor, and yet female violence, which is still regarded as an aberration, is not a recent phenomenon as Kilday’s book on lowland women’s violent criminality between 1750 and 1815 makes clear

Named Models in Coalgebraic Hybrid Logic

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for a given functor, thus covering a wide range of reasoning principles including, e.g., probabilistic, graded, default, or coalitional operators. Specifically, we establish generic criteria for a given coalgebraic hybrid logic to admit named canonical models, with ensuing completeness proofs for pure extensions on the one hand, and for an extended hybrid language with local binding on the other. We instantiate our framework with a number of examples. Notably, we prove completeness of graded hybrid logic with local binding

Modular Construction of Complete Coalgebraic Logics

We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled by coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular fashion. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems, for which no complete axiomatisation has been obtained so far

PSPACE Bounds for Rank-1 Modal Logics

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant proof-theoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way

Coalgebraic Weak Bisimulation from Recursive Equations over Monads

Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing notions are instances of the more general notion of coalgebraic bisimulation. Weak bisimulation, however, has so far been much less amenable to a coalgebraic treatment. Here we attempt to close this gap by giving a coalgebraic treatment of (parametrized) weak equivalences, including weak bisimulation. Our analysis requires that the functor defining the transition type of the system is based on a suitable order-enriched monad, which allows us to capture weak equivalences by least fixpoints of recursive equations. Our notion is in agreement with existing notions of weak bisimulations for labelled transition systems, probabilistic and weighted systems, and simple Segala systems.Comment: final versio

Does "thin client" mean "energy efficient"?

The thick client –a personal computer with integral disk storage and local processing capability, which also has access to data and other resources via a network connection – is accepted as the model for providing computing resource in most office environments. The Further and Higher Education sector is no exception to that, and therefore most academic and administrative offices are equipped with desktop computers of this form to support users in their day to day tasks. This system structure has a number of advantages: there is a reduced reliance on network resources; users access a system appropriate to their needs, and may customise “their” system to meet their own personal requirements and working patterns. However it also has disadvantages: some are outside the scope of this project, but of most relevance to the green IT agenda is the fact that relatively complex and expensive (in first cost and in running cost) desktop systems and servers are underutilised – especially in respect of processing power. While some savings are achieved through use of “sleep” modes and similar power reducing mechanisms, in most configurations only a small portion of the overall total available processor resource is utilised. This realisation has led to the promotion of an alternative paradigm, the thin client. In a thin client system, the desktop is shorn of most of its local processing and data storage capability, and essentially acts as a terminal to the server, which now takes on responsibility for data storage and processing. The energy benefit is derived through resource sharing: the processor of the server does the work, and because that processor is shared by all users, a number of users are supported by a single system. Therefore – according to proponents of thin client – the total energy required to support a user group is reduced, since a shared physical resource is used more efficiently. These claims are widely reported: indeed there are a number of estimation tools which show these savings can be achieved; however there appears to be little or no actual measured data to confirm this. The community does not appear to have access to measured data comparing thin and thick client systems in operation in the same situation, allowing direct comparisons to be drawn. This is the main goal of this project. One specific question relates to the overall power use, while it would seem to be obvious that the thin client would require less electricity, what of the server? Two other variations are also considered: it is not uncommon for thin client deployments to continue to use their existing PCs as thin client workstations, with or without modification. Also, attempts by PC makers to reduce the power requirements of their products have given rise to a further variation: the incorporation of low power features in otherwise standard PC technology, working as thick clients. This project was devised to conduct actual measurements in use in a typical university environment. We identified a test area: a mixed administrative and academic office location which supported a range of users, and we made a direct replacement of the current thick client systems with thin client equivalents; in addition, we exchanged a number of PCs operating in thin and thick client mode with devices specifically branded as “low power” PCs and measured their power requirements in both thin and thick modes. We measured the energy consumption at each desktop for the duration of our experiments, and also measured the energy draw of the server designated to supporting the thin client setup, giving us the opportunity to determine the power per user of each technology. Our results show a significant difference in power use between the various candidate technologies, and that a configuration of low power PC in thick client mode returned the lowest power use during our study. We were also aware of other factors surrounding a change such as this: we have addressed the technical issues of implementation and management, and the non-technical or human factors of acceptance and use: all are reported within this document. Finally, our project is necessarily limited to a set of experiments carried out in a particular situation, therefore we use estimation methods to draw wider conclusions and make general observations which should allow others to select appropriate thick or thin client solutions in their situation

A schema for cryptographic keys generation using hybrid biometrics

Biometric identifiers refer to unique physical properties or behavioural attributes of individuals. Some of the well known biometric identifiers are voice, finger prints, retina or iris, facial structure etc. In our daily interaction with others directly or indirectly, we implicitly use biometrics to know, distinguish and trust people. Biometric identifiers represent the concept of "who a person is" by gathering vital characteristics that don't correspond to any other person. The human brain to some extent is able to ascertain disparities or variation in certain physical attributes and yet verify the authenticity of a person. But this is difficult to be implemented in electronic systems due to the intense requirements of artificial decision making and hard-coded logic. This paper examines the possibility of using a combination of biometric attributes to overcome common problems in having a single biometric scheme for authentication. It also investigates possible schemes and features to deal with variations in Biometric attributes. The material presented is related to ongoing research by the Computer Communications Research Group at Leeds Metropolitan University. We use this paper as a starting step and as a plan for advanced research. It offers ideas and proposition for implementing hybrid biometrics in conjunction with cryptography. This is work in progress and is in a very preliminary stage

Extending du Bois-Reymond's Infinitesimal and Infinitary Calculus Theory

The discovery of the infinite integer leads to a partition between finite and infinite numbers. Construction of an infinitesimal and infinitary number system, the Gossamer numbers. Du Bois-Reymond's much-greater-than relations and little-o/big-O defined with the Gossamer number system, and the relations algebra is explored. A comparison of function algebra is developed. A transfer principle more general than Non-Standard-Analysis is developed, hence a two-tier system of calculus is described. Non-reversible arithmetic is proved, and found to be the key to this calculus and other theory. Finally sequences are partitioned between finite and infinite intervals.Comment: Resubmission of 6 other submissions. 99 page