Computer and information sciences topic list of research papers
-
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
Abstract We revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arrows and McBride and Patersonʼs idioms (also called applicative functors). We show that idioms are equivalent to arrows that satisfy the type...
2011 / Sam Lindley, Philip Wadler, Jeremy Yallop -
The Research of a Multiple Disjoint Paths Routing Protocol for Ad Hoc Sensor Networks
Abstract Due to the limited transmission range of wireless Ad hoc network nodes, multiple hops are usually needed for a node to exchange information with any other node in the network.Thus routing is a crucial issue to the design of a MANET.In this...
2012 / Zhongdong Wang, Qiushuang Wang -
Privacy protection of biometric traits using modified hill cipher with involutory key and robust cryptosystem
Abstract In this paper we have proposed a technique for securing biometric traits using the modified Hill Cipher with an involutory key and a robust cryptosystem. The Modified Hill Cipher solves the drawbacks of conventional Hill ciphers by using...
2010 / Bibhudendra Acharya, Mukul Dhar Sharma, Sourabh Tiwari, Vinay Kumar Minz -
An Innovative Teaching Tool based on Semantic Tableaux for Verification and Debugging of Imperative Programs
Abstract While Computational Logic plays an important role in several areas of Computer Science (CS), most educational software developed for teaching logic is not suitable to be used directly in large portions of the CS education domain where the...
2011 / Rafael del Vado Vírseda, Fernando Pérez Morente -
GPU-accelerated Chemical Similarity Assessment for Large Scale Databases
Abstract The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural information. Comparing molecules is the basis for a wide range of ...
2011 / Marco Maggioni, Marco Domenico Santambrogio, Jie Liang -
Component-based design for adaptive large-scale infectious disease simulation
Abstract Component-based design improves productivity by concentrating development efforts on one component at a time without having to worry about a change having an application-wide effect. In this paper, we demonstrate the usefulness of...
2010 / Thorsten Matthias Riechers, Shyh-hao Kuo, Rick Siow Mong Goh, Terence Hung -
International conference on computational science, ICCS 2010 data-driven pill monitoring
Abstract We describe a viable dynamic system to guarantee that pills delivered to a patient are what were prescribed, of sucient quality to be eective, and within the correct time frame. A handheld device that identifies pills is also described that ...
2010 / Craig C. Douglas, Li Deng, Gundolf Haase, Hyoseop Lee, Robert A. Lodder -
International conference on computational science, ICCS 2010 data-driven pill monitoring
Abstract We describe a viable dynamic system to guarantee that pills delivered to a patient are what were prescribed, of sufficient quality to be effective, and within the correct time frame. A handheld device that identifies pills is also described ...
2010 / Craig C. Douglas, Li Deng, Gundolf Haase, Hyoseop Lee, Robert A. Lodder -
A frequency domain face recognition technique based on correlation plane features as input to a regression neural network
Abstract In the area of Face Recognition (FR), the frequency domain approach is a widely used technique. The value of peak-to-sidelobe ratio (PSR) of the correlation peak at the output plane is often used as a measure of recognition. However, the...
2010 / Pradipta K. Banerjee, Jayanta K. Cahndra, Asit K. Datta -
Secure web-based communication
Abstract With the increase in Internet Technologies, great amount of information is following electronically everyday over the network. Information security is a way to protect information against its confidentiality, reliability and availability. ...
2011 / Nighat Mir, Sayed Afaq Hussain -
Mobile Augmented Reality Based Monitoring of Assembly Lines
Abstract Showing process-relevant information of assembly lines is an important task in production, e.g. for diagnostic purposes. Accessing the relevant manufacturing values during production requires extensive knowledge of the used machines and...
2014 / Christian Kollatsch, Marco Schumann, Philipp Klimant, Volker Wittstock, Matthias Putz -
Bayesian based intrusion detection system
Abstract In this paper an intrusion detection system is developed using Bayesian probability. The system developed is a naive Bayesian classifier that is used to identify possible intrusions. The system is trained a priori using a subset of the KDD...
2011 / Hesham Altwaijry, Saeed Algarny -
Session-based Choreography with Exceptions
Abstract Choreography has recently emerged as a pragmatic and concise way of describing communication-based systems such as web services and financial protocols. Recent studies have investigated the transition from the design stage of a system to...
2009 / Marco Carbone -
Using Heuristics to Automate Parameter Generation for Benchmarking of Java Methods
Abstract Automated generation of method parameters is needed in benchmarking scenarios where manual or random generation of parameters are not suitable, do not scale or are too costly. However, for a method to execute correctly, the generated input...
2009 / Michael Kuperberg, Fouad Omri -
Automata and Fixed Point Logics for Coalgebras
Abstract It is the aim of this paper to generalize existing connections between automata and logic to a more general, coalgebraic level. Let F : Set ...
2004 / Yde Venema -
Foreword2004 / Florence Maraninchi, Alain Girault, Eric Rutten
-
Matching Systems for Concurrent Calculi
Abstract Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and...
2008 / Bjørn Haagensen, Sergio Maffeis, Iain Phillips -
Propositional Dynamic Logic with Program Quantifiers
Abstract We consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μ ...
2008 / Daniel Leivant -
Intensional Properties of Polygraphs
Abstract We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic...
2008 / Guillaume Bonfante, Yves Guiraud -
Deduction Graphs with Universal Quantification
Abstract Deduction Graphs are meant to generalise both Gentzen-Prawitz style natural deductions and Fitch style flag deductions. They have the structure of acyclic directed graphs with boxes. In [Herman Geuvers and Iris Loeb. Natural Deduction via...
2008 / Herman Geuvers, Iris Loeb