Computer and information sciences topic list of research papers
-
Rate-Pricing Spectrum Management Algorithm for Green VDSL
Abstract Dynamic Spectrum Management (DSM) in terms of reducing the power consumption has been utilized to lower the system energy consumption. A largely distributed energy-efficient DSM algorithm based on rate-pricing is proposed in this paper. In...
2012 / Yanjuan Lv, Youming Li, Xiaoli Wang, Ming Jin -
An Approach for Extracting Exact Answers to Question Answering (QA) System for English Sentences
Abstract Recent advances in Natural Language Processing (NLP) and AI are trying to build systems to the point where people may converse with a machine in natural language to get answers to their questions. The question answering system based on...
2012 / Raju Barskar, Gulfishan Firdose Ahmed, Nepal Barskar -
Singular Value Decomposition based Features for Vehicle Classification under Cluttered Background and Mild Occlusion
Abstract Vehicle recognition and classification in a multi-environment containing cluttered background and occlusion is an important part of machine vision. The goal of this paper is to build a vehicle classifier that identifies a “car” vehicle from ...
2012 / B. Nagarajan, V. Devendran -
Design of ECG Signal Acquisition System Based on DSP
Abstract A real-time ECG signal acquisition system with the DSP chip TMS320VC5509A as its core is introduced in this paper. It introduces the design of ECG signal acquisition circuit in detail. ECG signal is analog filtered and amplified and then...
2012 / Kening Wang, Shengqian Ma, Jing Feng, Weizhao Zhang, Manhong Fan, et al. -
Pupil Extraction and Tracking for Interactive Optical See- Through HMD
Abstract In this paper, we propose a simple and effective system to extract a pupil and gaze detection. This system is developed using an optical based method to extract user's pupil. For extracting the pupil of the eye and detecting gaze, we use a...
2012 / Sung-Sub Song, Jong-Soo Choi, Jin-Tae Kim -
Feature Selection Using K-Means Genetic Algorithm for Multi-objective Optimization
Abstract Multi-objective genetic -clustering algorithms are based on optimization which optimizes several objectives simultaneously. In multi-objective optimization problem (MOP), different objective function may have different...
2015 / M. Anusha, J.G.R. Sathiaseelan -
Virtual 3D puzzles: a new method for exploring geometric models in VR2002 /
-
The influence of social networks in visiting, planning and living in cities. Alexplore: A pilot project in Alexandria
Abstract The presented work aims at identifying the potentials of mobile social networking and geo-coding to promote cities, as well as to test their usefulness as decision support systems for planners. Alexplore is an application that was developed ...
2013 / Dina Sameh Taha -
Controlling Generative Processes of Generative Art Somnuk Phon-
Abstract Computers have now become a crucial component in the process of digital media contents creation. Computer programs have been written to generate artistic artifacts, for examples, poetry, painting and music. These artifacts could be...
2012 / Somnuk Phon-Amnuaisuk, Jirapat Panjapornpon -
Evaluation of Two Acceleration Techniques in a Multithreaded 2D Poisson Equation Solver
Abstract Two acceleration techniques, based on additive corrections are evaluated with a multithreaded 2D Poisson equation solver. The popular multigrid algorithm with 2-level grid is compared with the traditional block-correction strategy. In both, ...
2012 / Andrés Vidal, Damian Dechev, Alain Kassab -
Decentralized estimation over orthogonal multiple-access fading channels in wireless sensor networks--optimal and suboptimal estimators2011 / Xin Wang, Chenyang Yang
-
Generating recommendations for consensus negotiation in group personalization services2011 / Maria Salamó, Kevin McCarthy, Barry Smyth
-
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis2007 / Roland Barriot, David J Sherman, Isabelle Dutour
-
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
Abstract The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and ...
2006 / Gergely Varró, Katalin Friedl, Dániel Varró -
Typed Mobile Ambients in Maude
Abstract Maude has revealed itself as a powerful tool for implementing different kinds of semantics so that quick prototypes are available for trying examples and proving properties. In this paper we show how to define in Maude two semantics for...
2006 / Fernando Rosa-Velardo, Clara Segura, Alberto Verdejo -
A Process Algebra for Reasoning About Quantum Security
Abstract We present a process algebra for specifying and reasoning about quantum security protocols. Since the computational power of the protocol agents must be restricted to quantum polynomial-time, we introduce the logarithmic cost quantum random ...
2007 / P. Adão, P. Mateus -
Architectural Interoperability Checking in Visual Coordination Networks
Abstract In this paper, the approach [Alessandro Aldini and Marco Bernardo. On the usability of process algebra: An architectural view. Theor. Comput. Sci. 335 (2–3) (2005) 281–329] of architectural interoperability checking is revisited and...
2007 / David Šafránek -
Recursive Definitions and Fixed-Points
Abstract An expression such as ∀ x ( P ( x ) ↔ ...
2009 / Francicleber Martins Ferreira, Ana Teresa Martins -
A Framework for Interpreting Traces of Functional Logic Computations
Abstract This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic programs by side effects and then give different views on the...
2007 / Bernd Braßel -
Intruder Deduction for the Equational Theory of Exclusive-or with Commutative and Distributive Encryption
Abstract The first step in the verification of cryptographic protocols is to decide the intruder deduction problem, that is the vulnerability to a so-called passive attacker. We extend the Dolev-Yao model in order to model this problem in presence...
2007 / Pascal Lafourcade