A floor sensor system for gait recognition

This paper describes the development of a prototype floor sensor as a gait recognition system. This could eventually find deployment as a standalone system (eg. a burglar alarm system) or as part of a multimodal biometric system. The new sensor consists of 1536 individual sensors arranged in a 3 m by 0.5 m rectangular strip with an individual sensor area of 3 cm2. The sensor floor operates at a sample rate of 22 Hz. The sensor itself uses a simple design inspired by computer keyboards and is made from low cost, off the shelf materials. Application of the sensor floor to a small database of 15 individuals was performed. Three features were extracted : stride length, stride cadence, and time on toe to time on heel ratio. Two of these measures have been used in video based gait recognition while the third is new to this analysis. These features proved sufficient to achieve an 80 % recognition rate

The prospects for mathematical logic in the twenty-first century

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.Comment: Association for Symbolic Logi

From cyber-security deception to manipulation and gratification through gamification

Over the last two decades the field of cyber-security has experienced numerous changes associated with the evolution of other fields, such as networking, mobile communications, and recently the Internet of Things (IoT) [3]. Changes in mindsets have also been witnessed, a couple of years ago the cyber-security industry only blamed users for their mistakes often depicted as the number one reason behind security breaches. Nowadays, companies are empowering users, modifying their perception of being the weak link, into being the center-piece of the network design [4]. Users are by definition "in control" and therefore a cyber-security asset. Researchers have focused on the gamification of cyber- security elements, helping users to learn and understand the concepts of attacks and threats, allowing them to become the first line of defense to report anoma- lies [5]. However, over the past years numerous infrastructures have suffered from malicious intent, data breaches, and crypto-ransomeware, clearly showing the technical "know-how" of hackers and their ability to bypass any security in place, demonstrating that no infrastructure, software or device can be consid- ered secure. Researchers concentrated on the gamification, learning and teaching theory of cyber-security to end-users in numerous fields through various techniques and scenarios to raise cyber-situational awareness [2][1]. However, they overlooked the users’ ability to gather information on these attacks. In this paper, we argue that there is an endemic issue in the the understanding of hacking practices leading to vulnerable devices, software and architectures. We therefore propose a transparent gamification platform for hackers. The platform is designed with hacker user-interaction and deception in mind enabling researchers to gather data on the techniques and practices of hackers. To this end, we developed a fully extendable gamification architecture allowing researchers to deploy virtualised hosts on the internet. Each virtualised hosts contains a specific vulnerability (i.e. web application, software, etc). Each vulnerability is connected to a game engine, an interaction engine and a scoring engine

Completeness Results for Parameterized Space Classes

The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have, however, resisted such a classification. At least in some cases, the reason is that upper and lower bounds for their parameterized space complexity have recently been obtained that rule out completeness results for parameterized time classes. In this paper, we make progress in this direction by proving that the associative generability problem and the longest common subsequence problem are complete for parameterized space classes. These classes are defined in terms of different forms of bounded nondeterminism and in terms of simultaneous time--space bounds. As a technical tool we introduce a "union operation" that translates between problems complete for classical complexity classes and for W-classes.Comment: IPEC 201

Non-Hausdorff Symmetries of C*-algebras

Symmetry groups or groupoids of C*-algebras associated to non-Hausdorff spaces are often non-Hausdorff as well. We describe such symmetries using crossed modules of groupoids. We define actions of crossed modules on C*-algebras and crossed products for such actions, and justify these definitions with some basic general results and examples.Comment: very minor changes. To appear in Math. An

Post-laparotomy haemoptysis due to broncho-abdominal fistula caused by retained abdominal surgical swab

The case presented describes the migration of a surgical swab across the left hemidiaphragm over four years. The patient had at least two episodes of haemoptysis in that period and was misdiagnosed and treated for Pulmonary Tuberculosis. When the proper diagnosis was made and a lobectomy was planned for removal of the swab, the act of anaesthesia revealed a major bronchoabdominal fistula that was resolved by simply isolating that lung with an endobronchial tube. According to our search, such a left-sided broncho-abdominal fistula has, to date, not been described in the literature.Keywords: broncho-abdominal fistula, gossypibom

Stopping Type 1 Diabetes: Attempts to Prevent or Cure Type 1 Diabetes in Man

long as the work is properly cited, the use is educational and not for profit, and the work is not altered. Se

NEXP-completeness and Universal Hardness Results for Justification Logic

We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is hard for the Sigma 2 p class of the second level of the polynomial hierarchy - given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound for the single-agent justification logics, proven by Buss and Kuznets in 2009, thus answering one of their open questions.Comment: Shorter version has been accepted for publication by CSR 201