Computer and information sciences topic list of research papers
-
Computational Science for Undergraduate Biologists via QUT.Bio.Excel
Abstract Molecular biology is a scientific discipline which has changed fundamentally in character over the past decade to rely on large scale datasets – public and locally generated - and their computational analysis and annotation. Undergraduate...
2014 / Lawrence Buckingham, James M. Hogan -
An Efficient Log File Analysis Algorithm Using Binary-based Data Structure
Abstract Log files provide valuable insight to previous history of system's usages. Using the information from a log file can help improve future access of a system. However, log files often contain huge amount of data which require significant...
2014 / Sallam Osman Fageeri, Rohiza Ahmad -
Mobile Authentication Secure Against Man-In-The-Middle Attacks
Abstract Current mobile authentication solutions put a cognitive burden on users to detect and avoid Man-In-The-Middle attacks. In this paper, we present a mobile authentication protocol named Mobile-ID which prevents Man-In-The-Middle attacks...
2014 / Kemal Bicakci, Devrim Unal, Nadir Ascioglu, Oktay Adalier -
Random product of substitutions with the same incidence matrix
Abstract Any infinite sequence of substitutions with the same matrix of the Pisot type defines a symbolic dynamical system which is minimal. We prove that, to any such sequence, we can associate a compact set (Rauzy fractal) by projection of the...
2014 / Pierre Arnoux, Masahiro Mizutani, Tarek Sellami -
Rule-based Expert Systems for Supporting University Students
Abstract There are more than 15 million college students in the US alone. Academic advising for courses and scholarships is typically performed by human advisors, bringing an immense managerial workload to faculty members, as well as other staff at...
2014 / Gökhan Engin, Burak Aksoyer, Melike Avdagic, Damla Bozanlı, Umutcan Hanay, et al. -
A simulation for content-based and utility-based recommendation of candidate coalitions in virtual creativity teams
Abstract Psychological literature shows that people do not always make rational choices with respect to whom to collaborate with. Providing the value of candidate connections may help them choosing the right people to connect with in a network. This ...
2010 / Rory L.L. Sie, Marlies Bitter-Rijpkema, Peter B. Sloep -
Theory of átomata
Abstract We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call “átomaton”, whose states are the “atoms” of the language, that is, non-empty intersections of complemented or uncomplemented left...
2014 / Janusz Brzozowski, Hellis Tamm -
The Complexity of Compressed Membership Problems for Finite Automata2013 / Artur Jeż
-
Can Deep Neural Networks Discover Meaningful Pattern Features?
Abstract Recent advances in the area of deep neural networks brought a lot of attention to some of the key issues important for their design. In particular for 2D-shapes, their accuracy has been shown to outperform all other classifiers - e.g., in...
2012 / Iveta Mrazova, Marek Kukacka -
Forecasting Students’ Future Academic Records Using Past Attendance Recording Data and Grade Data
Abstract In this study, the authors forecast students’ future academic records using past attendance recording data and grade data. We use a Bayesian network as forecasting method. During construction of the Bayesian network forecasting model,...
2013 / Hirotaka Itoh, Yuma Itoh, Kenji Funahashi, Daisuke Yamamoto, Shoichi Saito, et al. -
Preface
Abstract Computing: the Australasian Theory Symposium (CATS) is the premier theoretical computer science conference in Australasia, and originated as a meeting organised by Barry Jay in December, 1994 in Sydney. Since then, it...
2005 / James Harland -
Towards a Hierarchy of Negative Test Operators for Generative Communication
Abstract Generative communication is a coordination paradigm that permits interprocess communication via the introduction and consumption of data to and from a shared common data space. We call negative test operators those coordination primitives...
2004 / Gianluigi Zavattaro -
A Coalgebraic Approach to Kleene Algebra with Tests
Abstract Kleene Algebra with Tests is an extension of Kleene Algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene Algebra with Tests, along the lines of the coalgebraic...
2004 / Hubie Chen, Riccardo Pucella -
Attenuation Estimation From Correlated Sequences2006 / Tarek Medkour, Andrew T. Walden
-
MKF-Cuckoo: Hybridization of Cuckoo Search and Multiple Kernel-based Fuzzy C-means Algorithm
Abstract Discovering of optimal cluster through the help of optimization procedure is a recent trend in clustering process. Accordingly, several algorithms have been developed in the literature to mine optimal clusters. Most of the optimization-...
2013 / D. Binu, M. Selvi, Aloysius George -
Balanced timed regular expressions1 1Partially supported by the European community project IST-2001-35304 AMETIST
Abstract Several classes of regular expressions for timed languages accepted by timed automata have been suggested in the literature. In this article we introduce balanced timed regular expressions with colored parentheses which are equivalent to...
2004 / Eugene Asarin, Cătălin Dima -
Cryptographic Security of Reactive Systems
Abstract We describe some general relations between cryptographic and abstracted security definitions, and we present a novel model of security for reactive systems, generalizing previous definitions relying on the simulatability paradigm. ...
2004 / Birgit Pfitzmann, Matthias Schunter, Michael Waidner -
Categorical rewriting of term-like structures1 1Research partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems), by the ESPRIT Working Group APPLIGRAPH (Applications of Graph Transformation), and by the Italian MURST project TOSCA (Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi).
Abstract The article surveys a recent series of papers by the authors investigating the categorical foundations of various rule-based formalisms. The starting point is the well-known representation of term rewriting systems as cartesian...
2004 / Andrea Corradini, Fabio Gadducci -
On the Coincidence of Semantics for Uniquely Determined Programs
Abstract We study classes of logic programs, called here unique supported model classes or simply usm- classes, with the property that each member in the class is uniquely determined, that is, possesses a unique supported model. Known classes of...
2005 / Pascal Hitzler, Anthony Karel Seda -
Research and Implementation on Model for High Availability of Enterprise Information System
Abstract As information technology is applied in the modern enterprise management such as financing, marketing, enterprise resource planning widely, the high availability of enterprise information systems is more and more important. The key point of ...
2012 / Li Fan, Wang Tiejun, Wang Liuyi