Computer and information sciences topic list of research papers
-
Mining Sparse and Big Data by Case-based Reasoning
Abstract The increasing use of digital media in daily life has resulted in a need for novel multimedia data analysis techniques. Case-based Reasoning (CBR) solves problems using the already stored knowledge, and captures new knowledge, making it...
2014 / Petra Perner -
The Necessity of Using Cloud Computing in Educational System
Abstract cloud computing is a dynamically scalable system that provides internet-based services, often virtually. With emergence of electronic systems and removal of paper, virtual technologies and electronics are becoming important. This paper...
2014 / Asgarali Bouyer, Bahman Arasteh -
Beyond the hype: Big data concepts, methods, and analytics
Abstract Size is the first, and at times, the only dimension that leaps out at the mention of big data. This paper attempts to offer a broader definition of big data that captures its other unique and defining characteristics. The rapid evolution...
2014 / Amir Gandomi, Murtaza Haider -
Structural reducibility of multilayer networks2015 / Manlio De Domenico, Vincenzo Nicosia, Alexandre Arenas, Vito Latora
-
From Patterns in Data to Knowledge Discovery: What Data Mining Can Do
Abstract Data mining is defined as the computational process of analyzing large amounts of data in order to extract patterns and useful information. In the last few decades, data mining has been widely recognized as a powerful yet versatile...
2015 / Francesco Gullo -
“Fortune at the Bottom of the Classifier Pyramid”: A Novel Approach to Human Activity Recognition
Abstract “Fortune at the Bottom of the Pyramid”, penned by the noted economist Prof. C. K. Prahalad1, talked about the wealth creating potentials of entities at the bottom of the economic hierarchy. Taking the same cue into...
2015 / Vijay Borges, Wilson Jeberson -
Finger-Vein Verification Based on Multi-Features Fusion2013 / Huafeng Qin, Lan Qin, Lian Xue, Xiping He, Chengbo Yu, et al.
-
Evolutionary approach for model order reduction
Summary The phenomenon of compact model has become an extensive area of research. This article presents a mixed approach for model order reduction (MOR) of a single input and single output system (SISO). The technique is based on Padé approximation...
2016 / Shilpi Lavania, Deepak Nagaria -
Guest editorial2013 / Zhi Xiang Hou
-
Three Performance Models at Work: A Software Designer Perspective
Abstract The validation of software performance since the very early phases of the lifecycle is a crucial issue in complex software system design. Nowadays in the software development practice, the percentage of time and effort allocated to this...
2004 / Vittorio Cortellessa, Antinisca Di Marco, Paola Inverardi -
An Algebraic Theory Of Boundary Crossing Transitions
Abstract This paper gives a process-algebraic semantics for the hierarchical state machine (HSM) fragment of Statecharts, in which state transitions are permitted to cross state boundaries. Although frowned upon by researchers as promoting...
2005 / Arnab Ray, Rance Cleaveland, Arne Skou -
Algebra and Sequent Calculus for Epistemic Actions
Abstract We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic ...
2005 / Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh -
Aximo: Automated Axiomatic Reasoning for Information Update
Abstract We present an algorithm for proving epistemic properties of dynamic scenarios in multi-agent systems and an implementation of it as the C ...
2009 / Simon Richards, Mehrnoosh Sadrzadeh -
A Concurrent Model for Linear Logic
Abstract We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process...
2006 / Emmanuel Beffara -
A Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols
Abstract The verification of security protocols has attracted a lot of interest in the formal methods community, yielding two main verification approaches: i) state exploration, e.g. FDR [Gavin Lowe. Breaking and fixing the needham-schroeder...
2007 / Juan Carlos Lopez Pimentel, Raul Monroy, Dieter Hutter -
A Rewriting Calculus for Cyclic Higher-order Term Graphs
Abstract Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules, acting as elaborated abstractions, their application and the...
2005 / C. Bertolissi, P. Baldan, H. Cirstea, C. Kirchner -
Decoding billions of integers per second through vectorization2013 / D. Lemire, L. Boytsov
-
Defining locality as a problem difficulty measure in genetic programming2011 / Edgar Galván-López, James McDermott, Michael O’Neill, Anthony Brabazon
-
Coalition Description Logic with Individuals
Abstract Coalitional Description Logic [Seylan, I. and W. Jamroga, Description logic for coalitions, in: Proceedings of AAMAS'09, 2009, pp. 425–432.] is a product style combination of Coalition Logic and the description logic ...
2010 / İnanç Seylan, Wojciech Jamroga -
Performance Evaluation of Self-reconfigurable Service-oriented Software With Stochastic Petri Nets
Abstract Open-world software is a paradigm which allows to develop distributed and heterogeneous software systems. They can be built by integrating already developed third-party services, which use to declare QoS values (e.g., related to...
2010 / Diego Perez-Palacin, José Merseguer