Computer and information sciences topic list of research papers
-
Multiple Concern Adaptation for Run-time Composition in Context-Aware Systems
Abstract Context-Aware computing studies the development of systems which exploit context information (e.g., user location, network resources, time, etc.), which is specially relevant in mobile systems and pervasive computing. When these systems are ...
2008 / Javier Cámara, Carlos Canal, Gwen Salaün -
Distribution Network Reconfiguration Based on Niche Binary Particle Swarm Optimization Algorithm
Abstract Distribution network reconfiguration is an important tool to optimize the operating conditions of a distribution network. Niche Binary Particle Swarm Optimization (NBPSO) Algorithm is proposed to overcome the defect of Particle Swarm...
2012 / Liu Li, Chen Xuefeng -
The Application of VR in the Training of Power System
Abstract In order to improve the operating skills, the workers in power factory should do more and more practices. But it is impossible in reality, because the power system need to run normally and not allow mistakes. So the best way to train...
2012 / Cao FuYi, Li Bo, Wang Xiangfeng -
EEG-based neonatal seizure detection with Support Vector Machines
Abstract Objective The study presents a multi-channel patient-independent neonatal seizure detection system based on the Support Vector Machine (SVM) classifier. Methods ...
2010 / A. Temko, E. Thomas, W. Marnane, G. Lightbody, G. Boylan -
Recommender system for predicting student performance
Abstract Recommender systems are widely used in many areas, especially in e-commerce. Recently, they are also applied in e-learning tasks such as recommending resources (e.g. papers, books,..) to the learners (students). In this work, we propose a...
2010 / Nguyen Thai-Nghe, Lucas Drumond, Artus Krohn-Grimberghe, Lars Schmidt-Thieme -
Microsystem Technology for Ambient Assisted Living (AAL)
Abstract AAL is certainly an application area with sensor as well as actuator needs. Some of the requirements can be fulfilled by state of the art technology; some areas however still need a lot of R&D efforts for potential applications in...
2009 / U. Weimar, R. Simpson, N. Barsan, T. Heine, W. Simmendinger, et al. -
Autotuning in an Array Processing Language using High-level Program Transformations
Abstract An autotuning framework based on an algorithm description language dedicated to array processing is introduced. The array processing language allows algorithm developers, may not be equipped with non-trivial knowledge of the increasingly...
2011 / Yusuke Shirota, Jun’ichi Segawa, Masaya Tarui, Tatsunori Kanai -
A simple shuffle-based stable in-place merge algorithm
Abstract Sorting is one of the most fundamental problems in computer science. Divide-and-conquer based sorting algorithms use successive merging to combine sorted arrays; therefore performance of merging is critical for these types of applications....
2011 / Mehmet Emin Dalkilic, Elif Acar, Gorkem Tokatli -
Resource Selection Algorithms for Economic Scheduling in Distributed Systems
Abstract In this paper, we present slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job...
2011 / Victor Toporkov, Anna Toporkova, Alexander Bobchenkov, Dmitry Yemelyanov -
Study of Social Networking usage in Higher Education Environment
Abstract Social networking, in specific term, access social network application through internet connection, is a new trend in almost organization today. This phenomenon also aroused some debate about impact of employee productivity by using social...
2013 / Falahah, Dewi Rosmala -
Preface2004 / Furio Honsell, Marina Lenisa, Marino Miculan
-
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Abstract The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, we present a non-deterministic, monotone algorithm for this...
2008 / Karl-Heinz Pennemann -
Shared Hash Tables in Parallel Model Checking
Abstract In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. Since usage of shared state storage allows for techniques...
2008 / Jiří Barnat, Petr Ročkai -
Implementation of an Orchestration Language as a Haskell Domain Specific Language
Abstract Even though concurrent programming has been a hot topic of discussion in Computer Science for the past 30 years, the community has yet to settle on a, or a few standard approaches to implement concurrent programs. But as more and more cores ...
2009 / Marco Devesas Campos, L.S. Barbosa -
Towards Secrecy for Rewriting in Weakly Adhesive Categories
Abstract Inspired by the scope extrusion phenomenon of name passing calculi that allow to reason about knowledge of (secret) names, we propose an abstract formulation of the concept of secret in any weakly adhesive category. The guiding idea is to...
2009 / Tobias Heindel -
Reasoning in Abella about Structural Operational Semantics Specifications
Abstract The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses λ-tree syntax to treat object language binding and encodes binding related properties in...
2009 / Andrew Gacek, Dale Miller, Gopalan Nadathur -
Guarded Operations, Refinement and Simulation
Abstract Simulation rules have long been used as an effective computational means to decide refinement relations in state-based formalisms. Here we investigate how they might be amended so as to decide the event-based notion of singleton failures...
2009 / Steve Reeves, David Streader -
Performance Evaluation of Elastic GALS Interfaces and Network Fabric
Abstract This paper reports on the design of a test chip built to test a) a new latency insensitive network fabric protocol and circuits, b) a new synchronizer design, and c) how efficiently one can synchronize into a clocked domain when elastic...
2008 / Junbok You, Yang Xu, Hosuk Han, Kenneth S. Stevens -
Jalapa: Securing Java with Local Policies
Abstract We present Jalapa, a tool for securing Java bytecode programs with history-based usage policies. Policies are defined by usage automata, that recognize the forbidden execution histories. Usage automata are expressive enough to allow...
2009 / Massimo Bartoletti, Gabriele Costa, Roberto Zunino -
Theoretical Aspects of Communication-Centred Programming
Abstract This short note outlines two different ways of describing communication-centric software in the form of formal calculi and discuss their relationship. Two different paradigms of description, one centring on global message flows and another...
2008 / Marco Carbone, Kohei Honda, Nobuko Yoshida