Towards Intelligent Databases

This article is a presentation of the objectives and techniques of deductive databases. The deductive approach to databases aims at extending with intensional definitions other database paradigms that describe applications extensionaUy. We first show how constructive specifications can be expressed with deduction rules, and how normative conditions can be defined using integrity constraints. We outline the principles of bottom-up and top-down query answering procedures and present the techniques used for integrity checking. We then argue that it is often desirable to manage with a database system not only database applications, but also specifications of system components. We present such meta-level specifications and discuss their advantages over conventional approaches

Forward-looking solvency contagion

Solvency contagion risk is a key channel through which systemic risk can come about. We introduce a model that accounts not only for losses transmitted after banks default, but also for losses due to the fact that creditors revalue their exposures when probabilities of default of their counterparties change. We apply the model to run a series of simplified stress tests of the UK banking system from 2008 to 2016, based on two datasets of real interbank exposures between the seven major UK banks. We show that risks due to solvency contagion decrease markedly from the peak of the crisis, to the point of becoming negligible. We also characterise the distributions of both vulnerabilities and systemic importances of individual banks, thereby tracking the evolution of risk concentration

Shift-Symmetric Configurations in Two-Dimensional Cellular Automata: Irreversibility, Insolvability, and Enumeration

The search for symmetry as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have long been a central focus of complexity science and physics. To better grasp and understand symmetry of configurations in decentralized toroidal architectures, we employ group-theoretic methods, which allow us to identify and enumerate these inputs, and argue about irreversible system behaviors with undesired effects on many computational problems. The concept of so-called configuration shift-symmetry is applied to two-dimensional cellular automata as an ideal model of computation. Regardless of the transition function, the results show the universal insolvability of crucial distributed tasks, such as leader election, pattern recognition, hashing, and encryption. By using compact enumeration formulas and bounding the number of shift-symmetric configurations for a given lattice size, we efficiently calculate the probability of a configuration being shift-symmetric for a uniform or density-uniform distribution. Further, we devise an algorithm detecting the presence of shift-symmetry in a configuration. Given the resource constraints, the enumeration and probability formulas can directly help to lower the minimal expected error and provide recommendations for system's size and initialization. Besides cellular automata, the shift-symmetry analysis can be used to study the non-linear behavior in various synchronous rule-based systems that include inference engines, Boolean networks, neural networks, and systolic arrays.Comment: 22 pages, 9 figures, 2 appendice

Recognising Desire: A psychosocial approach to understanding education policy implementation and effect

It is argued that in order to understand the ways in which teachers experience their work - including the idiosyncratic ways in which they respond to and implement mandated education policy - it is necessary to take account both of sociological and of psychological issues. The paper draws on original research with practising and beginning teachers, and on theories of social and psychic induction, to illustrate the potential benefits of this bipartisan approach for both teachers and researchers. Recognising the significance of (but somewhat arbitrary distinction between) structure and agency in teachers’ practical and ideological positionings, it is suggested that teachers’ responses to local and central policy changes are governed by a mix of pragmatism, social determinism and often hidden desires. It is the often underacknowledged strength of desire that may tip teachers into accepting and implementing policies with which they are not ideologically comfortable

A complementary view on the growth of directory trees

Trees are a special sub-class of networks with unique properties, such as the level distribution which has often been overlooked. We analyse a general tree growth model proposed by Klemm {\em et. al.} (2005) to explain the growth of user-generated directory structures in computers. The model has a single parameter $q$ which interpolates between preferential attachment and random growth. Our analysis results in three contributions: First, we propose a more efficient estimation method for $q$ based on the degree distribution, which is one specific representation of the model. Next, we introduce the concept of a level distribution and analytically solve the model for this representation. This allows for an alternative and independent measure of $q$. We argue that, to capture real growth processes, the $q$ estimations from the degree and the level distributions should coincide. Thus, we finally apply both representations to validate the model with synthetically generated tree structures, as well as with collected data of user directories. In the case of real directory structures, we show that $q$ measured from the level distribution are incompatible with $q$ measured from the degree distribution. In contrast to this, we find perfect agreement in the case of simulated data. Thus, we conclude that the model is an incomplete description of the growth of real directory structures as it fails to reproduce the level distribution. This insight can be generalised to point out the importance of the level distribution for modeling tree growth.Comment: 16 pages, 7 figure

The significance of 'the visit' in an English category-B prison: Views from prisoners, prisoners' families and prison staff

A number of claims have been made regarding the importance of prisoners staying in touch with their family through prison visits, firstly from a humanitarian perspective of enabling family members to see each other, but also regarding the impact of maintaining family ties for successful rehabilitation, reintegration into society and reduced re-offending. This growing evidence base has resulted in increased support by the Prison Service for encouraging the family unit to remain intact during a prisoner’s incarceration. Despite its importance however, there has been a distinct lack of research examining the dynamics of families visiting relatives in prison. This paper explores perceptions of the same event – the visit – from the families’, prisoners’ and prison staffs' viewpoints in a category-B local prison in England. Qualitative data was collected with 30 prisoners’ families, 16 prisoners and 14 prison staff, as part of a broader evaluation of the visitors’ centre. The findings suggest that the three parties frame their perspective of visiting very differently. Prisoners’ families often see visits as an emotional minefield fraught with practical difficulties. Prisoners can view the visit as the highlight of their time in prison and often have many complaints about how visits are handled. Finally, prison staff see visits as potential security breaches and a major organisational operation. The paper addresses the current gap in our understanding of the prison visit and has implications for the Prison Service and wider social policy

Towards a catalog of spreadsheet smells

Spreadsheets are considered to be the most widely used programming language in the world, and reports have shown that 90% of real-world spreadsheets contain errors. In this work, we try to identify spreadsheet smells, a concept adapted from software, which consists of a surface indication that usually corresponds to a deeper problem. Our smells have been integrated in a tool, and were computed for a large spreadsheet repository. Finally, the analysis of the results we obtained led to the refinement of our initial catalog

Model inference for spreadsheets

Many errors in spreadsheet formulas can be avoided if spreadsheets are built automati- cally from higher-level models that can encode and enforce consistency constraints in the generated spreadsheets. Employing this strategy for legacy spreadsheets is dificult, because the model has to be reverse engineered from an existing spreadsheet and existing data must be transferred into the new model-generated spreadsheet. We have developed and implemented a technique that automatically infers relational schemas from spreadsheets. This technique uses particularities from the spreadsheet realm to create better schemas. We have evaluated this technique in two ways: First, we have demonstrated its appli- cability by using it on a set of real-world spreadsheets. Second, we have run an empirical study with users. The study has shown that the results produced by our technique are comparable to the ones developed by experts starting from the same (legacy) spreadsheet data. Although relational schemas are very useful to model data, they do not t well spreadsheets as they do not allow to express layout. Thus, we have also introduced a mapping between relational schemas and ClassSheets. A ClassSheet controls further changes to the spreadsheet and safeguards it against a large class of formula errors. The developed tool is a contribution to spreadsheet (reverse) engineering, because it lls an important gap and allows a promising design method (ClassSheets) to be applied to a huge collection of legacy spreadsheets with minimal effort.We would like to thank Orlando Belo for his help on running and analyzing the empirical study. We would also like to thank Paulo Azevedo for his help in conducting the statistical analysis of our empirical study. We would also like to thank the anonymous reviewers for their suggestions which helped us to improve the paper. This work is funded by ERDF - European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness) and by National Funds through the FCT - Fundacao para a Ciencia e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP-01-0124-FEDER-010048. The first author was also supported by FCT grant SFRH/BPD/73358/2010

Models and metaphors: complexity theory and through-life management in the built environment

Complexity thinking may have both modelling and metaphorical applications in the through-life management of the built environment. These two distinct approaches are examined and compared. In the first instance, some of the sources of complexity in the design, construction and maintenance of the built environment are identified. The metaphorical use of complexity in management thinking and its application in the built environment are briefly examined. This is followed by an exploration of modelling techniques relevant to built environment concerns. Non-linear and complex mathematical techniques such as fuzzy logic, cellular automata and attractors, may be applicable to their analysis. Existing software tools are identified and examples of successful built environment applications of complexity modelling are given. Some issues that arise include the definition of phenomena in a mathematically usable way, the functionality of available software and the possibility of going beyond representational modelling. Further questions arising from the application of complexity thinking are discussed, including the possibilities for confusion that arise from the use of metaphor. The metaphor of a 'commentary machine' is suggested as a possible way forward and it is suggested that an appropriate linguistic analysis can in certain situations reduce perceived complexity