Computer and information sciences topic list of research papers
-
An Epistemic Predicate CTL* for Finite Control π-Processes
Abstract We examine model checking of finite control π-calculus processes against specifications in epistemic predicate CTL*. In contrast to branching time settings such as CTL or the modal μ-calculus, the general problem, even for LTL, is...
2011 / Dimitar P. Guelev, Mads Dam -
Management of Non-functional Attributes of Parallel Components
Abstract In this paper, we present an extension to the CCA component architecture. The extension defined a minimal set of non-functional attributes of parallel components. We havea implemented the common CCA components for the management of these...
2011 / Yunfeng Peng, Changjun Hu, Chongchong Zhao, Shigang Li, Shucai Yao -
Using reinforcement learning to vary the m in GMRES(m)
Abstract While the original GMRES(m) iterative solver assumes the restart parameter m stays fixed throughout the solve, in practic varying m can improve the convergence behavior of the solver. Previous work tried to take advantage of this fact by...
2011 / Lisa Peairs, Tzu-Yi Chen -
Route Identification of Freight Vehicle's Tour Using GPS Probe Data and its Application to Evaluation of on and off Ramp Usage of Expressways
Abstract GPS-based probe car data is useful for studying traffic situations that roadside sensors cannot detect. However, the ambiguity in the map-matching and route identification processing of link-based probe data analysis has been a difficult...
2012 / Takayoshi Yokota, Dai Tamagawa -
Enforcement of entailment constraints in distributed service-based business processes
Abstract Context A distributed business process is executed in a distributed computing environment. The service-oriented architecture (SOA) paradigm is a popular option for the integration of software services and execution of...
2013 / Waldemar Hummer, Patrick Gaubatz, Mark Strembeck, Uwe Zdun, Schahram Dustdar -
Early congestion detection and adaptive routing in MANET
Abstract Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, congestion occurs in any intermediate node when data packets travel from source to...
2011 / T. Senthil Kumaran, V. Sankaranarayanan -
Improving the Automatic Derivation of Choreography-conforming Web Services Systems
Abstract We present DIEGO 2.0, a new version of our tool DIEGO. Given a WS-CDL choreography, it automatically ex-tracts a set of WS-BPEL web services such that, if these services interact with each other, they necessarily produce the behavior...
2012 / Pablo Rabanal, Ismael Rodr’guez, Jose A. Mateo, Gregorio D’az -
Exploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks
Abstract Micro-blogging services have recently been experiencing increasing success among Web users. Different to traditional online social applications, micro-blogs are lightweight, require small cognitive effort and help share real-time...
2011 / S.M. Allen, M.J. Chorley, G.B. Colombo, E. Jaho, M. Karaliopoulos, et al. -
A Tight Framelet Algorithm for Color Image De-Noising
Abstract In recent years, there is a growing interest in the research of color image de-noising algorithms. A tight framelet is a wavelet frame constructed by multiresolution analysis. The properties of tight framelet and its applications on gray...
2011 / Zemin Cai, Chuliang Wei -
Intelligent security and privacy solutions for enabling personalized telepathology2011 / Bernd Blobel
-
Stabilization by controller networks
Abstract This paper addresses a design method of controller networks, i.e., networked controllers which cooperatively determine the control inputs by exchanging the information with their neighbors. The problem considered here is to design the...
2016 / Shinsaku Izumi, Shun-ichi Azuma, Toshiharu Sugie -
Progressive alignment of genomic signals by multiple dynamic time warping
Abstract This paper presents the utilization of progressive alignment principle for positional adjustment of a set of genomic signals with different lengths. The new method of multiple alignment of signals based on dynamic time warping is tested for ...
2015 / Helena Skutkova, Martin Vitek, Karel Sedlar, Ivo Provaznik -
Recent Progresses in Characterising Information Inequalities2011 / Terence Chan
-
HPC-GAP: engineering a 21st-century high-performance computer algebra system2016 / Reimer Behrends, Kevin Hammond, Vladimir Janjic, Alexander Konovalov, Steve Linton, et al.
-
Joint scheduling of MapReduce jobs with servers: Performance bounds and experiments
Abstract MapReduce-like frameworks have achieved tremendous success for large-scale data processing in data centers. A key feature distinguishing MapReduce from previous parallel models is that it interleaves parallel and sequential computation....
2016 / Xiao Ling, Yi Yuan, Dan Wang, Jiangchuan Liu, Jiahai Yang -
Modalities for an Allegorical Conceptual Data Model2014 / Bartosz Zieliński, Paweł Maślanka, Ścibor Sobieski
-
Energy-Efficient Optimization Layer for Event-Based Communications on Wi-Fi Things
Abstract The Web-of-Things or WoT offers a way to standardize the access to services embedded on everyday objects, leveraging on well accepted standards of the Web such as HTTP and REST services. The WoT offers new ways to build mashups of object...
2013 / Gérôme Bovet, Jean Hennebert -
On the use of deep feedforward neural networks for automatic language identification
Abstract In this work, we present a comprehensive study on the use of deep neural networks (DNNs) for automatic language identification (LID). Motivated by the recent success of using DNNs in acoustic modeling for speech recognition, we adapt DNNs...
2016 / Ignacio Lopez-Moreno, Javier Gonzalez-Dominguez, David Martinez, Oldřich Plchot, Joaquin Gonzalez-Rodriguez, et al. -
Factorization systems and fibrations
Abstract It is well-known that a factorization system on a category (with sufficient pullbacks) gives rise to a fibration. This paper characterizes the fibrations that arise in such a way, by making precise the logical structure that is given by...
2004 / Jesse Hughes, Bart Jacobs -
On the Number of Rule Applications in Constraint Programs
Abstract We predict the maximal number of rule applications, i.e. worst-case derivation lengths of computations, in rule-based constraint solver programs written in the CHR language. CHR are a committed-choice concurrent constraint logic programming ...
2004 / Thom Frühwirth