Computer and information sciences topic list of research papers
-
Is SMS still alive for education: Analysis of educational potentials of SMS technology?
Abstract Mobile phone, especially SMS concept is a fairly old technology. In spite of the fact that there are some applications of using SMS capabilities of mobile phones in education, the usage is not widely in all educational areas. Still, there...
2011 / Ilker Yengin, Adem Karahoca, Dilek Karahoca, Hüseyin Uzunboylu -
A vector model for routing queries in web search engines
Abstract This paper proposes a method for reducing the number of search nodes involved in the solution of queries arriving to a Web search engine. The method is applied by the query receptionist machine during situations of sudden peaks in query...
2010 / Mauricio S. Oyarzun, Senen Gonzalez, Marcelo Mendoza, Flavio Ferrarotti, Max Chacon, et al. -
Moving from dataset metadata to semantics in ecological research: a case in translating EML to OWL
Abstract The Ecological Metadata Language (EML) is an XML-based metadata specification developed for the description of datasets and their associated context in ecology. The conversion of EML metadata to an ontological form has been addressed in...
2011 / Elena Mena-Garcés, Elena García-Barriocanal, Miguel-Angel Sicilia, Salvador Sánchez-Alonso -
Optimization and Performance Evaluation of Stereo-Matching Software on Many-core Processors
Abstract The high-performance Geospatial Information System (GIS) is expected to provide an innovative infrastructure for Earth sciences, enabling near-real-time data and processing services. Stereo-matching software has often been used in...
2011 / Kenji Iwata, Yoshio Tanaka, Ryosuke Nakamura, Tomoki Masuda, Ryosuke Machida, et al. -
Multimodal person verification system using face and speech
Abstract Reliable user identification is a common requirement for almost every secure system. Biometric offer a natural and reliable solution to certain aspects of identity management by recognizing the individuals based on their inherent physical...
2010 / R. Raghavendra, Ashok Rao, G. Hemantha Kumar -
Virtualization of food supply chains with the internet of things
Abstract Internet technologies allow supply chains to use virtualizations dynamically in operational management processes. This will improve support for food companies in dealing with perishable products, unpredictable supply variations and...
2015 / C.N. Verdouw, J. Wolfert, A.J.M. Beulens, A. Rialland -
Mobility and Load aware Routing protocol for ad hoc networks
Abstract Mobile ad hoc networks (MANETs) are very promising wireless technology and they offer wide range of possibilities for the future in terms of applications and coverage. Due to the complex nature of MANETS, their development processes face...
2011 / Yaser Khamayseh, Ghadeer Obiedat, Munner Bani Yassin -
CUDA-Accelerated Geodesic Ray-Tracing for Fiber Tracking2011 / Evert van Aart, Neda Sepasian, Andrei Jalba, Anna Vilanova
-
A novel approach for intelligent distribution of data warehouses
Abstract With the continuous growth in the amount of data, data storage systems have come a long way from flat files systems to RDBMS, Data Warehousing (DW) and Distributed Data Warehousing systems. This paper proposes a new distributed data...
2015 / Abhay Kumar Agarwal, Neelendra Badal -
A Nominal Relational Model for Local Store
Abstract The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more elementary development than the traditional presheaf models....
2010 / Rasmus Ejlers Møgelberg -
From Discrete Duration Calculus to Symbolic Automata
Abstract The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are written in the synchronous programming language Lustre, in...
2006 / Laure Gonnord, Nicolas Halbwachs, Pascal Raymond -
Completeness Results for Undecidable Bisimilarity Problems
Abstract We establish Σ1 1-completeness (in the analytical hierarchy) of weak bisimilarity checking for infinite- state processes generated by pushdown automata and parallel pushdown automata. The results imply Σ1 ...
2004 / Jiřı́ Srba -
Probabilistic Configuration Theories
Abstract We introduce a new framework for describing computations which are both concurrent and probabilistic. This framework is a natural extension of the Configuration Theories of [Pietro Cenciarelli. Configuration theories. In CSL '02:...
2007 / Alessandro Tiberi -
Liveness Checking as Safety Checking for Infinite State Spaces
Abstract In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for model checking of liveness properties, help to find shortest...
2006 / Viktor Schuppan, Armin Biere -
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
Abstract In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for specifying liveness and fairness of computing systems and defining notions of real analysis in terms of expanding modalities. After that, Roy...
2007 / Peter Höfner -
Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
Abstract The simplest proofs of the Church Rosser Property are usually done by the syntactic method of parallel reduction. On the other hand, reducibility is a semantic method which has been used to prove a number of properties in the λ-calculus and ...
2009 / Fairouz Kamareddine, Vincent Rahli -
Schnorr Trivial Reals: A construction
Abstract A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null Σ 1 0 ...
2007 / Johanna N.Y. Franklin -
Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
Abstract For asynchronous and open distributed systems, dynamicity, openness, and stringent quality of service requirements pose great challenges to model and develop such systems. The Actor-Role-Coordinator (ARC) model was previously proposed to...
2009 / Yue Yu, Shangping Ren, Carolyn Talcott -
Discount-Optimal Infinite Runs in Priced Timed Automata
Abstract We introduce a new discounting semantics for priced timed automata. Discounting provides a way to model optimal-cost problems for infinite traces and has applications in optimal scheduling and other areas. In the...
2009 / Uli Fahrenberg, Kim G. Larsen -
Action Planning for Directed Model Checking of Petri Nets
Abstract Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the...
2006 / Stefan Edelkamp, Shahid Jabbar