Computer and information sciences topic list of research papers
-
Automatic Complexity Analysis for Programs Extracted from Coq Proof
Abstract We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation of MiniML code [Pierre Letouzey. Programmation fonctionnelle ...
2006 / Jean-Pierre Jouannaud, Weiwen Xu -
A Discussion on Network's Negative Impact on College Students
Abstract The influencing ways of computer networks on college students and the negative impact of networks on contemporary college students are analyzed in detail in the paper, and the corresponding countermeasures are raised from the perfection of...
2012 / Xiao Wenxian, Liu Zhen, Gao Guohong, Wan Wenlong -
Differential qd Algorithm with Shifts for Rank-Structured Matrices2012 / Pavel Zhlobich
-
Data Mining Methods For Performance Evaluations To Asymptotic Numerical Models
Abstract This paper proposed a new approach based on data mining to evaluate the e_ciency of numerical asymptotic models. Indeed, data mining has proved to be an e_cient tool of analysis in several domains. In this work, we first derive an...
2011 / Franck Assous, Joel Chaskalovic -
Optimization of Multi-Phase Compressible Lattice Boltzmann Codes on Massively Parallel Multi-Core Systems
Abstract We develop a Lattice Boltzmann code for computational fluid-dynamics and optimize it for massively parallel systems based on multi-core processors. Our code describes 2D multi-phase compressible flows. We analyze the performance bottlenecks ...
2011 / Luca Biferale, Filippo Mantovani, Marcello Pivanti, Fabio Pozzati, Mauro Sbragaglia, et al. -
Agent system service for supporting river boats navigation
Abstract In this paper agent system service is used for solving the troubles of river boats navigation and creating the cheapest and efficient solution for boats without onboard radiolocation system, with describing of system’s main modules...
2010 / Alexander B. Degtyarev, Yury V. Logvinenko -
Variable Scheduling to Mitigate Channel Losses in Energy-Efficient Body Area Networks2012 / Yuriy Tselishchev, Athanassios Boulis, Lavy Libman
-
Particle swarm optimisation based video abstraction
Abstract Video abstraction is a basic step for intelligent access to video and multimedia databases which facilitates content-based video indexing, retrieving and browsing. This paper presents a new video abstraction scheme. The proposed method...
2010 / Magda B. Fayk, Heba A. El Nemr, Mona M. Moussa -
A software for the one-dimensional cutting stock problem
Abstract In this paper, one-dimensional cutting stock problem is taken into consideration and a new heuristic algorithm is proposed to solve the problem. In this proposed algorithm, a new dynamic programming algorithm is applied for packing each of...
2010 / Murat Erşen Berberler, Urfat Nuriyev, Ahmet Yıldırım -
Exact model reduction of combinatorial reaction networks2012 / Holger Conzelmann, Dirk Fey, Ernst D Gilles
-
Asynchronous Logic Circuits and Sheaf Obstructions
Abstract This article exhibits a particular encoding of logic circuits into a sheaf formalism. The central result of this article is that there exists strictly more information available to a circuit designer in this setting than exists in static...
2012 / Michael Robinson -
Combining Non-stably Infinite, Non-first Order Theories
Abstract A crucial step in the assertional verification of concurrent programs is deciding whether some sets of literals are satisfiable or not. In this context, the Nelson-Oppen combination scheme is often used. This scheme combines decision...
2005 / Pascal Fontaine, Pascal Gribomont -
Lightweight Specification-based Testing of Memory Cards: A Case Study
Abstract As the markets of mobile devices are expanding, needs for developing reliable memory cards are increasing, too. Samsung, one of the major players in memory card business, is also trying to improve the validation process for their memory...
2005 / Seung Mo Cho, Jae Wook Lee -
Modelling a Secure Agent with Team Automata
Abstract We use Team Automata in order to model a protocol by Cachin et al. for securing agents in a hostile environment. Our study focuses on privacy properties of the agents. We use the framework to prove a result from the work by Cachin et al. As ...
2005 / Lavinia Egidi, Marinella Petrocchi -
Dagger Compact Closed Categories and Completely Positive Maps
Abstract Dagger compact closed categories were recently introduced by Abramsky and Coecke, under the name “strongly compact closed categories”, as an axiomatic framework for quantum mechanics. We present a graphical language for dagger compact...
2007 / Peter Selinger -
Towards Component Verification in the Generic Component Framework
Abstract The intention of this paper is to extend the generic component framework presented at FASE 2002 [H. Ehrig, F. Orejas, B. Braatz, M. Klein, and M. Piirainen. A Generic Component Concept for System Modeling. In Proc. FASE 2002: Formal Aspects ...
2009 / Julia Padberg, Hartmut Ehrig, Fernando Orejas -
Reliable UML Models and Profiles
Abstract Formerly, models have been used mostly in design and documentation. MDA and its surrounding techniques put them into the center of the software development process as the platform-independent model serves as foundation for tasks such as...
2008 / Kirsten Berkenkötter -
Modular Checking with Model Checking
Abstract Automatic static checkers based on model checking, particularly SAT-based bounded model checkers, are used in industry, but they sometimes suffer from the scalability problem. Scalability can be achieved with the notions of Design by...
2009 / Yuusuke Hashimoto, Shin Nakajima -
The Non-Interference Protection in BML
Abstract Many information-flow type systems have been developed that allow to control the non-interference of information between the levels of classification in the Bell-LaPadula model. We present here a translation of typing information collected...
2009 / Aleksy Schubert, Daria Walukiewicz-Chrząszcz -
Performance Evaluation of Security Protocols Specified in LySa
Abstract We use a special operational semantics which drives us in inferring quantitative measures on system describing cryptographic protocols. The transitions of the system carry enhanced labels. We assign rates to transitions by only looking at...
2005 / Chiara Bodei, Michele Curti, Pierpaolo Degano, Mikael Buchholtz, Flemming Nielson, et al.