Computer and information sciences topic list of research papers
-
Energy Efficient Load-Balanced Clustering Algorithm for Wireless Sensor Networks
Abstract Clustering is an efficient technique to improve scalability and life time of a wireless sensor network. In this paper, we present an Energy Efficient Load-Balanced Clustering (EELBC) Algorithm that addresses energy efficiency as well as...
2012 / Pratyay Kuila, Prasanta K. Jana -
On the Design of a Low Cost Gaze Tracker for Interaction
Abstract The human gaze is a basic mean for non verbal interaction. However, in several situations, especially in the context of upper limb motor impairment, the gaze represents also an alternative mean for human interaction with the environment...
2012 / A. Carbone, F. Martínez, E. Pissaloux, D. Mazeika, R. Velázquez -
Mobile edoclink: A Mobile Workflow and Document Management Application for Healthcare Institutions
Abstract The exponential growth of mobile devices, like smart phones and tablets, has led to a growing ubiquitous computing paradigm, in which computing is distributed and available anytime, anywhere and supported by different devices. The document...
2012 / Pedro Gomes, Mário Antunes -
Projected Clustering Using Particle Swarm Optimization
Abstract Clustering methods divide the dataset into groups of similar objects, where objects in the same group are similar and objects in different groups are dissimilar. Traditional clustering techniques that find clusters in full dimensional space ...
2012 / Satish Gajawada, Durga Toshniwal -
An Empirical Comparison Study on Kernel Based Support Vector Machine for Classification of Gene Expression Data Set
Abstract Classification is a vital tool for understanding the relationships of living things using which similar things can be grouped together. Classification of elements into groups makes the study relatively easy. Therefore, classification is...
2012 / Smruti Rekha Das, Kaberi Das, Debahuti Mishra, Kailash Shaw, Sashikala Mishra -
Designing pixel-oriented visualization techniques: theory and applications2002 / D.A. Keim
-
Inference of Timed Transition Systems
Abstract We extend Angluin's algorithm for on-line learning of regular languages to the setting of timed transition systems. More specifically, we describe a procedure for inferring systems that can be described by event-recording automata by asking ...
2005 / Olga Grinchtein, Bengt Jonsson, Martin Leucker -
Boost the Integration of Planning and Scheduling: a Heuristics Approach
Abstract Temporal planning embodies aspects of both planning and scheduling. Many temporal planners handle these two subproblems in a loose coupling way. This way simplifies the temporal planning problem but restricts the modeling power. In...
2012 / Yuechang Liu, Yishan Fang -
Distributed Beamforming for Randomly Distributed Sensors with Position Error Correction
Abstract Beam forming is a technique designed for antenna an array in which phase of each antenna element is adjusted such that the resultant waves are coherently added to get maximum signal strength at the desired direction. This technique has been ...
2012 / G.Vaikundam, G.F. Sudha -
Enhancement in Footprint Image using Diverse Filtering Technique
Abstract Footprint identification is the measurement of footprint features for recognizing the identity of a user. Footprint is universal, easy to capture and does not change across time. The image enhancement is carried out to obtain an accurate...
2012 / V.D.Ambeth Kumar, M. Ramakrishnan -
Topological approximations of multisets
Abstract Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we...
2013 / El-Sayed A. Abo-Tabl -
Resilient Dynamic Data Driven Application Systems (rDDDAS)
Abstract There is a growing interest in Cloud Computing for delivering computing as a utility. Security in Cloud Computing is a challenging research problem because it involves many interdependent tasks including vulnerability scanning, application...
2013 / Glynis Dsouza, Salim Hariri, Youssif Al-Nashif, Gabriel Rodriguez -
Detecting and Preventing Error Propagation via Competitive Learning
Abstract Semi-supervised learning is a machine learning approach which is able to employ both labeled and unlabeled samples in the training process. It is an important mechanism for autonomous systems due to the ability of exploiting the already...
2012 / Thiago Christiano Silva, Liang Zhao -
Climate Classifications: the Value of Unsupervised Clustering
Abstract Classifying the land surface according to different climate zones is often a prerequisite for global diagnostic or predictive modelling studies. Classical classifications such as the prominent K̈oppen–Geiger (KG) approach rely on heuristic...
2012 / Jakob Zscheischler, Miguel D. Mahecha, Stefan Harmeling -
Compiling a Test: How to Solve Calibration Issues
Abstract When compiling a test, there are several questions that have to be solved before proceeding to include the items. For instance: do I have to evaluate a minimum required knowledge (i.e. pass or fail) or do I just have to classify the...
2012 / Anaje Armendariz, Tomás A. Pérez, Javier López-Cuadrado -
Multi-camera multi-object voxel-based Monte Carlo 3D tracking strategies2011 / Cristian Canton-Ferrer, Josep R Casas, Montse Pardàs, Enric Monte
-
Structural Measures for Network Biology Using QuACN2011 / Laurin AJ Mueller, Karl G Kugler, Armin Graber, Frank Emmert-Streib, Matthias Dehmer
-
Mass-Up: an all-in-one open software application for MALDI-TOF mass spectrometry knowledge discovery2015 / H. López-Fernández, H. M. Santos, J. L. Capelo, F. Fdez-Riverola, D. Glez-Peña, et al.
-
Deriving Safety Cases for the Formal Safety Certification of Automatically Generated Code
Abstract We present an approach to systematically derive safety cases for automatically generated code from information collected during a formal, Hoare-style safety certification of the code. This safety case makes explicit the formal and informal...
2009 / Nurlida Basir, Ewen Denney, Bernd Fischer -
Dynamic Slicing Techniques for Petri Nets
Abstract Petri nets provide a means for modelling and verifying the behavior of concurrent systems. Program slicing is a well-known technique in imperative programming for extracting those statements of a program that may affect a given program...
2008 / M. Llorens, J. Oliver, J. Silva, S. Tamarit, G. Vidal