Respect My Authority! HITS Without Hyperlinks, UtilizingCluster-Based Language Models (2009)
ABSTRACT We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform re-ranking...
Categories and Subject Descriptors I.2.6 [Artificial Intelligence]: LearningGeneral Terms (2009)
ABSTRACT Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like text...
Type Structures and Normalization by Evaluation for System F! (2009)
Abstract We present the first verified normalization-by-evaluationalgorithm for System F!, the simplest impredicative type theory with computation on the type level. Types appearin three shapes: As...
Checking equiv-alence for partial implementations (2009)
Christoph Scholl, Computer Science
Abstract We consider the problem of checking whether a partial implementation can (still) beextended to a complete design which is equivalent to a given full specification. Several algorithms trading...
Ontology-Assisted Data Transformation and Integration (2009)
Lucas Zamboulis, Ra Poulovassilis, Jianing Wangschool, Computer Science, Information Systems
With the advances in microelectronics devices, often computers, sensors, and actuators are integrated into mechanical systems. Modern engineering design thus requires efforts from a multidisciplinary...
1 Waikato Applied Network Dynamics (2009)
Klaus Mochalski, Jörg Micheel, Stephen Donnelly, Computer Science, G Block
Abstract− − In this paper we study packet delay and loss for IP data traversing the University of Auckland Internet ac− cess path. The ISP uplink of the university has been the subject of...
Dynamic Weaving for Aspect-Oriented Programming\Lambda (2009)
Andrei Popovici, Thomas Gross, Computer Science
a developer must understand the program units actually changed by weaving, how they behave, and possibly correct the aspects used. Support for rapid AOP prototyping and debugging is therefore crucial...
XML Transformations in Scheme with LAML-a Minimalistic Approach (2009)
Categories and Subject Descriptors D.1.1 [Functional Programming]: Scheme, XML 1. INTRODUCTION XML [4] is a meta language, which is used to define high-level markup languages for a variety of...
Modeling Scientific Discourse (2009)
Peter Mcburney, Computer Science
The Problem Domain We aim to build intelligent systems which can reason autonomously about the riskof carcinogenicity of chemicals, drawing on whatever theoretical or experimental
Name Ali, Asghar Younus Tambawala, Computer Science
Computer Science website. To suggest, and cost, improvements to the Website. A written report and a web-based report will be produced. Time table: Week 6 (21 aug – 27 aug) Planning of the project....
Hilbert's third problem: brief reminder. It is known that in aplane, every two polygons P and P 0 of equal area A(P) = A(P 0) arescissors congruent (equidecomposable)- i.e., they can be both...
Integrated Quality-of-Service Adaptation inDistributed, Heterogeneous Systems (2009)
Larisa Rizvanovic, Computer Science
Abstract In this paper we have developed a method for an efficient Quality-of-Serviceprovision and adaptation in dynamic, heterogenous systems, based on our Matrix framework for resource management....
Efficient Adaptations of the Non-Blocking Buffer for Event Message Communication (2009)
Enabling message communication among concurrent computing threads without relying on mutual exclusion (i.e., locking) is highly desirable in real-time computing systems. This paper presents a refined...
An Operational Semantics for Knowledge Bases (2009)
Rice UniversityHouston, TX 77251-1892 vardi@cs.rice.edu Abstract The standard approach in AI to knowledge representation isto represent an agent's knowledge symbolically as a collection of...
1. Research Team Geospatial Data Integration (2009)
Prof Craig Knoblock, Computer Science, Prof Cyrus Shahabi, Computer Science, Jose Luis Ambite, Sharifzadeh Snehal Thakkar
Recent growth of the geo-spatial information on the web has made it possible to easily access a wide variety of geo-spatial data. Accurately integrating diverse geo-spatial data remains a challenging...
A Decision Theoretic Approach for Task Coordination in Social Robots (2009)
Enrique Sucar, Alberto Reyesdept, Computer Science, Temixco Morelos Mexico
1 Introduction We are concerned with the problem of building mobilerobotic systems with capacities to interact with humans. Such robots will need navigation, mapping, localizationand obstacle...
Cryptanalysis of Symmetric Block Ciphers (2009)
Kungl Tekniska Högskolan, Computer Science, Gustaf Dellkrantz, Supervisor K. U, Leuven Christophe, De Cannière, ...
This thesis is focused on the cryptanalysis of block ciphers. We give an introduction to the theory of block ciphers and an overview of cryptanalytic attacks. Our contribution is the analysis of two...
The Revenge of the Overlay:Automatic Compaction of OS Kernel Code via On-Demand (2009)
Code Loading, Haifeng He, Saumya Debray, Computer Science
Technological trends in recent years have led to the growing useof general-purpose operating systems, such as Linux, in embedded
General Terms Performance, Design (2009)
Edmund B. Nightingale, Peter M. Chen, Electrical Engineering, Computer Science
Artbotics: Challenges and Opportunities for Multi-Disciplinary, Community-Based Learning in (2009)
Computer Science, Fred Martin, Hyun Ju Kim, Linda Silka, Holly Yanco
Artbotics is a collaboration between faculty in computer science, the arts, and the social sciences. It is a complex project that involves the following elements: • High school and university...
Barbed Bisimulations for Timed Distributed ss-calculus (2009)
Gabriel Ciobanu, Computer Science, Romanian Academy
Abstract Modelling distributed systems requires notions as lo-cations, communication among the distributed processes, and resource access. To express time constraints for suchsystems, we have...
Chihab Benmoussa, Turku Centre, Computer Science
Firms are increasingly rushing to invest in a variety of technologies or sales force automation (SFA) to increase the performance of their sales forces. Research has shown, however, that a high...
Authors and Affiliation (2009)
Oskar Hermansson, Stefan Holmer, Computer Science, Engineering At The, Oskar Hermansson
A comparison between the scheduling algorithms used in RTLinux and in VxWorks- both from a
A Computational Characterization of Multiagent Gameswith Fallacious Rewards (2008)
ABSTRACT Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others ' rewards. Misinformation about rewards leads to a gap...
A Practical One-Semester “VLSI Design ” Course for (2008)
Computer Science, Other Majors
This paper describes the development and content of a “VLSI Design ” course. We had two main goals for the course: to develop a one-semester course for computer science (and other) majors, and to...
A Framework for Dynamic Energy Efficiencyand Temperature Management \Lambda (2008)
Michael Huangy, Jose Renauy, Seung-moon Yooz, Computer Science
ABSTRACT While technology is delivering increasingly sophisticated andpowerful chip designs, it is also imposing alarmingly high energy requirements on the chips. One way to address this prob-lem is...
Supervisor at Nada was Henrik Eriksson (2008)
Kungl Tekniska Högskolan, Computer Science, Edvard Sjögren
This Master’s thesis investigates how the state machine modeling concept, as defined in the UML specification, can be used to simulate systems which exhibit a hybrid of continuous and discrete...
State-based and process-based value-passing (2008)
Steve Reeves, Computer Science
Abstract State-based and process-based formalisms each comewith their own distinct set of assumptions and properties. To combine them in a useful way it is important to be sureof these assumptions in...
Comparing Knowledge Acquisition and MachineLearning with Simulations (2008)
Achim Hoffmann, Rex Kwok, Paul Comptonschool, Computer Science, New South Wales
General Terms Management, Performance (2008)
Manish An, Edmund B. Nightingale, Electrical Engineering, Computer Science
1. Research Team SAI: Software Architecture for Immersipresence (2008)
Prof Alex, Computer Science, Graduate Students, Cheng Zhu
The goal of the SAI (Software Architecture for Immersipresence) project is to provide a universal framework for the distributed implementation of algorithms and their easy integration into complex...
An Investigation of Practical ApproximateNearest Neighbor Algorithms (2008)
Ting Liu, Andrew W. Moore, Er Gray, Ke Yangschool, Computer Science
1 Introduction The k-nearest-neighbor searching problem is to find the k nearest points in a dataset X aeRD containing n points to a query point
1 A CRITICAL REVIEW OF THE NOTION OF THE ALGORITHM IN (2008)
Computer science inherited its present conceptual foundations from a branch of pure mathematics that, historically, had been exploring the fundamental nature of mathematical computation since before...
I/O System Performance DebuggingUsing Model-driven Anomaly Characterization* (2008)
Kai Shen, Ming Zhong, Computer Science
It is challenging to identify performance problems andpinpoint their root causes in complex systems, especially when the system supports wide ranges of workloadsand when performance problems only...
Dan Österberg, Johan Lilius, Turku Centre, Computer Science
While there exists a fair number of partial solutions to enabling dynamic updating in arbitrary applications, none of them have proved to be superior. This paper does not suggest "yet...
Conflict Resolution and Reconciliation in Disconnected Databases* (2008)
Shirish Hemant, Computer Science
Abstract As mobile computing devices become more and morepopular, mobile databases have started gaining popularity. An important feature of these database systems is their abil-ity to allow...
CS294, Deeply Embedded Wireless Networks (2008)
Kamin Whitehouse, Computer Science
This paper presents the experience of a real deployment of Calamari, an ad-hoc localization system for sensor networks. It provides a practical evaluation of many ideas from the literature, serving...
General Terms Languages, Algorithms (2008)
Ovidiu Gheorghioiu, Ru S *alcianu, Martin Rinardlaboratory, Computer Science
$5.00.
This text is based on the chapter Domain Theory in the Handbook for Logic in (2008)
Samson Abramsky, Achim Jung, Computer Science, Edited S. Abramsky, Dov M. Gabbay
E. Maibaum, published by Clarendon Press, Oxford in 1994. While the numbering of all theorems and definitions has been kept the same, we have included comments and corrections which we have received...
1. Research Team UDN: User-Directed News (2008)
Prof Larry Pryor, Prof Albert Rizzo, Other Faculty, Sen Lec, Patrick Dent, Information Technology, ...
integrated media systems (IT&IMS) stand to revolutionize methods for acquiring, packaging, organizing and delivering information content. With these advancements in IT&IMS will come both...
Learning a Nonlinear Embedding by PreservingClass Neighbourhood Structure (2008)
Ruslan Salakhutdinov, Computer Science
Abstract We show how to pretrain and fine-tune a mul-tilayer neural network to learn a nonlinear transformation from the input space to a low-dimensional feature space in which K-nearest neighbour...
Analytical Cache Models with Applicationsto Cache Partitioning (2008)
G. Edward Suh, Srinivas Devadas, Larry Rudolphlaboratory, Computer Science
Prof Albert Rizzo, Prof Cyrus Shahabi, Computer Science, Yonghua Wei, Stephan Themis
The primary goals of this project are to design, develop, implement and evaluate psychometrically reliable and valid Integrated Media System (IMS) testing and training environments that target human...
An Objective Comparison of Languages for Teaching Introductory Programming (2008)
Linda Mannila, Turku Centre, Computer Science, Åbo Akademi
The question of which language to use in introductory programming has been cause for protracted debate, often based on emotive opinions. Several studies on the benefits of individual languages or...
Feature-Based Sequence-to-Sequence Matching \Lambda (2008)
Yaron Caspi, Denis Simakov, Michal Iranidept, Computer Science
Real-Time Video Phase-Locked Loops (2008)
Jeffrey E. Boyd, Maxwell Saylesdept, Computer Science
In the perception of gaits, timing is everything; specifi-cally, the relative timing of the individual motions in a gait, and when events occur periodically, as they do in a gait,then relative timing...
Scheduling Transactions with Temporal Constraints:Exploiting Data Semantics \Lambda (2008)
Ming Xiongy, Krithi Ramamrithamzjohn, A. Stankovicx, Don Towsley, Computer Science
Enforcing Interaction Properties in AOSD-EnabledSystems * (2008)
ABSTRACT The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various components....
Characterizing Vulnerability of Parallelism to Resource Constraints (2008)
V. Vivekan, K. Gopinath, Computer Science
The theoretical available instruction level parallelism in most benchmarks is very high. Vulnerability is related to the difficulty with which we can extract this parallelism with finite resources....
Rational Secret Sharing and Multiparty Computation:Extended Abstract (2008)
ABSTRACT We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that...
Trajectory Queries and Octagonsin Moving Object Databases \Lambda (2008)
Hongjun Zhu, Jianwen Su, Computer Science
ABSTRACT An important class of queries in moving object databases involves trajectories. We propose to divide trajectory predicates into topological and non-topological parts; extend the...
Alleviating Self-Interference in MANETs (2008)
Alex Varshavsky, Computer Science
Abstract The interference range in multi-hop ad hoc networks(MANETs) is typically twice as large as the transmission range. This phenomena causes packets of a multi-hop flowto interference with each...
Computer Science, Joseph Kiniry
ESC/Java2 is an extended static checker based upon DEC/Compaq SRC ESC/Java operates on JML-annotated Java code behaves like a compiler error messages similar to javac & gcc completely automated...
Exception Analysis, Non-strict Languages, Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Computer Science, ...
Abstract In this paper we present the first exception analysis for a non-strictlanguage. We augment a simply-typed functional language with exceptions, and show that we can define a type-based...
Artbotics: Challenges and Opportunities for Multi-Disciplinary, Community-Based Learning in (2008)
Computer Science, Fred Martin, Hyun Ju Kim, Linda Silka, Holly Yanco
Artbotics is a collaboration between faculty in computer science, the arts, and the social sciences. It is a complex project that involves the following elements: • High school and university...
An Investigation of Practical ApproximateNearest Neighbor Algorithms (2008)
Andrew W. Mooredept, Computer Science
1 Introduction The k-nearest-neighbor searching problem is to find the k nearest points in a dataset X ae RD containing n points to a query point q 2 RD, usually under the Euclidean distance.It has...
The Geometric Thickness of Low Degree Graphs (2008)
Computer Science, David Eppstein
Abstract We prove that the geometric thickness of graphs whose maximum degree is no more than four is two.All of our algorithms run in O (n) time, where n is the number of vertices in the graph. In...
Data Management in Hierarchical Bus Networks F. Meyer auf der Heide*Department of Mathematics (2008)
ABSTRACT A hierarchical bus network T = (V, E) uses hierarchically, tree-like connected buses as a communication network. New communication technologies like SCI (Scalable Coherent Interface) (see,...
Courses Education Recent (2008)
Bei Wang, Summa Cum Laude, Computer Science, Bei Wang
Research Data structure, design and analysis of algorithms, specifically but not limited to: algorithms interests in computational geometry and topology; algorithms in computational biology;...
Advances in Indexing for Mobile Objects (2008)
Computer Science, Cecilia M. Procopiucat
In this paper we discuss the latter line of research, and we review recent advances and remaining challenges.Since moving objects can be viewed as points moving along algebraic curves, the problem...
Supervisor at Nada was Stefan Nilsson (2008)
Kungl Tekniska Högskolan, Computer Science, Karl Hasselström
I have investigated, theoretically and experimentally, under what circumstances Newton division (inversion of the divisor with Newton’s method, followed by division with Barrett’s method) is the...
Pin Zhou, Feng Qin, Wei Liu, Yuanyuan Zhou, Computer Science
Abstract Recent impressive performance improvements in computer ar-chitecture have not led to significant gains in ease of debugging. Software debugging often relies on inserting run-time...
An Investigation of Practical ApproximateNearest Neighbor Algorithms (2008)
Ting Liu, Andrew W. Moore, Er Gray, Ke Yangschool, Computer Science
1 Introduction The k-nearest-neighbor searching problem is to find the k nearest points in a dataset X aeRD containing n points to a query point
Narendran Sachindran, J. Eliot, Computer Science
Mark-Copy: Fast copying GC with less space overhead
Scalable Continuous Query Processing byTracking Hotspots* (2008)
Pankaj K. Agarwal, Junyi Xie, Jun Yang, Computer Science
ABSTRACT This paper considers the problem of scalably processing a largenumber of continuous queries. We propose a flexible framework with novel data structures and algorithms for group-processing...
What do the Neighbours Think? Computing Web PageReputations (2008)
Abstract The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful sourceof information for querying and searching. This paper presents a search process...
Supervisor at Nada was Prof. Anders Lansner (2008)
Kungl Tekniska Högskolan, Computer Science, Anders Eriksson
A crucial issue in reinforcement learning applications is how to set meta-parameters, such as the learning rate and ”temperature ” for exploration, to match the demands of the task and the...
Courses taught: EDP358, Psychological Measurement in Education (2008)
Philip E Callahan, Minor Administration, Bgs Salem, State College, Dual Major, Computer Science, ...
Dissertation: Learning and development of probability concepts: effects of computer assisted instruction and diagnosis MA. University of Arizona, 1982 Thesis: Microcomputer assisted instruction in...
Materials Cees van Walree, Physical Organic Chemistry, (2008)
Kate Mullen, Hans Spoelder, Emiel Corten, Zsófia Derzsi, Fons Ullings, Frans Groen, ...
- Original version by AUTHORS, DATE (2008)
Turku Centre, Computer Science, Åbo Akademi
Copyright © 2002 AUTHORS.
Publications Refereed Articles (2008)
Phd (computer Sciences, Expected May, Computer Science, St. Olaf College, William C. Benton, ...
My primary research interests are program analysis, type systems, and concurrency, especially fine-grained concurrency for multi-core architectures. I am also interested in declarative tools for...
Transformation of Prolog Programs to Perform Update in Place: A Prototype Code Synthesizer (2008)
Benjamin R. Liblit, Mary Jane, Irwin Head, Computer Science
and from the University William H. Winsborough Barry Pangrle Thesis Supervisor Honors Advisor Honors Chairman
Similarity Estimation Techniques from RoundingAlgorithms (2008)
Moses S. Charikardept, Computer Science
ABSTRACT A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh2F [h(x) = h(y)] = sim(x, y),...
OBJECTIVE To obtain a full-time position in Formal Verification or Software Systems EDUCATION (2008)
Dec M. S, Computer Science, Overall Gpa, Overall Gpa
• Worked with the ITU-T H.323 protocol as part of the Gatekeeper product team in the Voice over IP (VoIP) group. Involved in the product development from the design specification to the...
The Communication Complexity of Coalition Formationamong Autonomous Agents (2008)
ABSTRACT It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of the payoff...
Authors and Affiliation (2008)
Oskar Hermansson, Stefan Holmer, Computer Science, Engineering At The, Oskar Hermansson
A comparison between the scheduling algorithms used in RTLinux and in VxWorks- both from a
Mobile Ambients and P-Systems Ion Petre (2008)
Turku Centre, Computer Science, Luigia Petre
Abstract: The ambient calculus and the P-systems are models developed in di erent areas of computer science. Still, they are based on similar concepts and structures and are inspired from the same...
Turku Centre, Computer Science, Ahmed Jerraya (tima, Kees Goosens (nxp, The Netherl, Rudy Lauwereins (imec
Tom Rodden, Yvonne Rogers, John Halloran, Ian Taylor, The School, Computer Science, ...
Designing novel interactional workspaces to
1. Research Team Semantic Information Representation and Ontologies (2008)
Prof Cyrus Shahabi, Computer Science, Graduate Students, Seokkyung Chung, Vesile Evrim, ...
The primary goal of this project is to design, develop, deploy, and test methodologies for exploiting semantic aspects of the data. Toward this end, we have developed an information system based on...
Supervisor at Nada was Anders Lansner (2008)
Kungl Tekniska Högskolan, Computer Science, Stefan Elfwing
Because the learning time is exponential in the size of the state space, a hierarchical learning structure is often introduced into reinforcement learning (RL) to handle large scale problems....
Reflection as the Basis for Developing a Dynamic SoC Persistence System (2008)
Benjamin Lopez, Francisco Ortin, Javier Noval, Computer Science
Persistence is a common application requirement that is usually taken into account when the program is being developed. Different emerging techniques following the Separation of Concerns principle...
�Communication Performance (2008)
Axel Jantsch, Hannu Tenhunen, Turku Centre, Computer Science
Algorithm on a Chip
Reducing the Complexity of the Register File in Dynamic Superscalar Processors £ (2008)
Rajeev Balasubramonianý, Hya Dwarkadasý, David H. Albonesiþ, Computer Science
Dynamic superscalar processors execute multiple instructions out-of-order by looking for independent operations within a large window. The number of physical registers within the processor has a...
Abstract Border Correlation of Binary Words (2008)
Tero Harju, Dirk Nowotka, Turku Centre, Computer Science
The border correlation function β: A ∗ → A ∗ , for A = {a, b}, specifies which conjugates (cyclic shifts) of a given word w of length n are bordered, in other words, β(w) = c0c1... cn−1,...
The Convergence of Ethernet and Ethernot: A 10-Gigabit Ethernet Perspective ∗ (2008)
P. Balaji, W. Feng, D. K. Panda, P. Balaji, Computer Science, W. Feng
Recently, a vast number of interconnect technologies such as InfiniBand, Myrinet and Quadrics have been introduced into the system-area network (SAN) environment; the primary driving requirements of...
Dissertation Title: Enforcing Semantics-aware Security in Multimedia Documents. (2008)
Naren Kodali, Information Technology, Advisors Duminda Wijesekera, Csilla Farkas, Computer Science
Information Security, Integrity and Privacy. Specifically, Multimedia security with emphasis on physical and electronic surveillance, information flow control and critical infrastructure protection....
Oskar Åkerlund, Computer Science, Oskar Åkerlund, Mattias Unger, Rui Wang, Oskar Åkerlund
This education gave me a strong theoretical foundation in mathematics, physics and programming methods as well as experience in key subjects such as
A Normal Form for P-Systems Ion Petre (2008)
Turku Centre, Computer Science
The P-systems have been recently introduced in [4] as a new model for distributed parallel computing. We describe in this paper a normal form for the class of non-cooperative P-systems and prove a...
Cellular automata reversible over limit set (2008)
Siamak Taati, Turku Centre, Computer Science
Reversibility of dynamics is a fundamental feature of nature, as it is currently believed that all physical processes are reversible in the ultimate microscopic scale. In this paper, we consider...
1. Research Team High-Speed Immersive Media Stream Recorder (2008)
Prof Christos Papadopoulos, Computer Science, Graduate Students, Dwipal A. Desai, Kun Fu, Shihua Liu, ...
applications. In recent years, a considerable amount of research has focused on the efficient retrieval of such media [10, 13]. Scant attention has been paid to servers that can record such streams...
Prof Isaac Cohen, Computer Science, Prof Jon Gratch, Prof Stacey Marsalas, Prof Cyrus Shahabi, Computer Science, ...
This User Centered Sciences (UCS) area has multiple projects with unique goals. These involve: • Gestural HCI – This project aims to design, develop and evaluate a hand gesture based language for...
4. Discussion of Methodology Used Overview (2008)
Prof Isaac Cohen, Computer Science
This goal of this project is to develop techniques for estimating the pose of people in static images automatically. 3. Project Role in Support of IMSC Strategic Plan Imagery data is an important...
Early Safety Analysis: from Use Cases to Component-based Software Development (2008)
We propose an easy-to-use but formal approach for early safety analysis in the context of component-based software development and illustrate its application with a case example. Our approach aims at...
Knarig Arabshian, Computer Science
GloServ is a global service discovery system which aggregates different types of services in a globally distributed network. It improves on current service discovery systems by scaling across a...
Thesis: From a Distributed Information Space to Multihop Wireless VoIP (2008)
Present Ph. D, Computer Science, Expected Spring, Advisor Gustavo Alonso, Advisor Gustavo Alonso, Eth Zurich
Enterprise Application Integration Developed a fault-tolerant, cluster-transparent and transaction-safe adapter for JMS applications to access IBM MQSeries 1999 ETH Juniors, Switzerland Developed a...
Doctor Of Philosophy, Computer Science
engineering, data mining, cognitive modeling, and health management. Past researcher in the Advanced Research and Development group. Developed novel model-based diagnostic system that included a...
Hon Wai Leong, Computer Science, Hon Hon, Wai Wai Leong
If you want to learn the basics…
Approach to Understanding the Botnet Phenomenon ” from Moheeb Abu Rajab, (2008)
Betreuer Gregor Maier, Jay Zarfoss, Fabian Monrose, Andreas Terzis, Computer Science, Javier Zugasti Raposo
The following text is a summary of the original paper: “A Multifaceted
Eric D. Kolaczyk, Mark Crovella (bu, Computer Science
Our interest is in network-wide monitoring of ‘end-to-end ’ properties on paths. Full measurement quickly becomes infeasible, since #paths ∼ (#nodes) 2. ⇒ Motivates the development of methods...
On the Relation Between Low Density Separation, SpectralClustering and Graph Cuts (2008)
Abstract One of the intuitions underlying many graph-based methods for clustering and semi-supervisedlearning, is that class or cluster boundaries pass through areas of low probability density. In...
Additional Key Words and Phrases (2008)
Nemanja Isailovic, Mark Whitney, Yatish Patel, John Kubiatowicz, Dean Copsey, Frederic T. Chong, ...
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all...
Implementing Knowledge Database in Neural Networks (2008)
implemented in neural network. In the described program all the arguments of relations are coded in patterns- orthogonal sequences of bits. After giving patterns of Agent and Relationship to the...
ProtEx: A TOOLKIT FOR THE ANALYSIS OFDISTRIBUTED REAL-TIME SYSTEMS (2008)
Yves Meylan, Aneema Bajpai, Computer Science
Abstract Large-scale distributed real-time systems are increas-ingly difficult to analyze within the Rate Monotonic Analysis framework. This is due partly to their heterogeneity,complex interaction...
On The Cooperation of Web Clients and Proxy Caches (2008)
Yiu Fai Sit\lambda, Computer Science
Abstract Web proxy cache has become universal to the Internet'sinfrastructure. It reduces the time to deliver content and the demand on the costly external network bandwidth. The wideemployment...
QoS Provisioning in Clusters: An Investigation of Router and NIC Design \Lambda (2008)
Ki Hwan, Yum Eun, Jung Kim, Computer Science
Simulation results of an 8-port router and a (2 \Theta 2) meshnetwork indicate that the preemptive router can provide better performance than the non-preemptive router for dynami-cally changing...
Adversarial Contention Resolution for Simple Channels (2008)
ABSTRACT This paper analyzes the worst-case performance of randomizedbackoff on simple multiple-access channels. Most previous analysis of backoff has assumed a statistical arrival model.For batched...
Improving Attack Detection in Host-Based IDS byLearning Properties of System Call Arguments * (2008)
1 Dialogue Management for Ani-mated Conversational Agents (2008)
Scott A. King, Alistair Knott, Brendan Mccanedept, Computer Science
Abstract This paper describes an animated conversa-tional agent called Kare1 which integrates a talking head interface with a linguistically motivatedhuman-machine dialogue system. The agent has a...
Photometric Stereo via Locality Sensitive High-Dimension Hashing (2008)
The motivation of this paper is to overcome the limita-tion of high computational demands in example-based photometric stereo when large numbers of images are used.Under the assumption that two...
Intuitionistic Letcc via Labelled Deduction (2008)
Abstract Intuitionistic logic can be presented as a calculus of la-belled deduction on multiple-conclusion sequents. The corresponding natural deduction system constitutes a type sys-tem for programs...
A Retraining Improvement of Feedforward Neural Networks, TUCS (2008)
Iulian Nastac, Razvan Matei, Turku Centre, Computer Science
The artificial neural networks (ANNs) ability to extract significant information from an initial set of data allows both an interpolation in the a priori defined points, as well as an extrapolation...
Supervisor at Nada was Stefan Arnborg (2008)
Kungl Tekniska Högskolan, Computer Science
In this Master’s thesis, Bayesian data mining techniques are used to analyze a database containing information from schizophrenia affected and healthy persons. The aim is to find dependencies...
Varieties of Formalisms for Knowledge Representation (2008)
Aaron Slomanschool, Computer Science
AbstractWhilst I agree largely with Janice Glasgow's position paper, there are a number of relevant subtle and important issues that she does not address, concerning the variety of formsand...
Bruce Lowekamp, Thomas Grossschool, Computer Science
Abstract The development and performance of network-aware applications depends on the availabil-ity of accurate predictions of network resource properties. Obtaining this information directly from...
Constant-Time Distributed Dominating Set Approximation* (2008)
ABSTRACT Finding a small dominating set is one of the most fundamental problems of traditional graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP...
CONTENTS UCSD Connectionist Paper: A Connectionist Perspective on Prosodic Structure (2008)
Mary Hare, David Corina, Garrison W. Cottrell, Computer Science
Artificial Evolution of Intelligence: Lessons from natural evolution (2008)
David Andre, John Koza, Computer Science, David Andre
An illustrative approach using Genetic Programming
Specifying Multithreaded Java Semantics forProgram Verification (2008)
The main difficulty with the JMM is that it is informally described in an abstract rule-based declarative style, which is unsuitable for formal verification. In this paper, we develop an equivalent...
Computer Science, J. A. Smith, Sk. Shrivastava
Performance of fault-tolerant data and compute intensive
Er Felfernig, Computer Science
Abstract — The effective integration of configuration sys-tem development with industrial software development is crucial for a successful implementation of a Mass Customization strategy. On the...
Rational Secret Sharing and Multiparty Computation:Extended Abstract (2008)
ABSTRACT We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that...
Using Tarjan's Red Rule for Fast DependencyTree Construction (2008)
Dan Pelleg, Andrew Mooreschool, Computer Science
as mixture components [3], or as components in classifiers [4]. It is our intent to eventually apply the technology introduced in this paper to the full problem of Bayes Netstructure search.
Additional Key Words and Phrases (2008)
Nemanja Isailovic, Mark Whitney, Yatish Patel, John Kubiatowicz, Dean Copsey, Frederic T. Chong, ...
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all...
How Should We Classify These? Fuel injectors (2008)
What is the difference between embedded and non-embedded software?
Model-Free Least Squares Policy Iteration (2008)
1 Introduction Linear least squares function approximators offer many advantages in the context of re-inforcement learning. While their ability to generalize is less powerful than black box methods...
Does Topology, Control Reduce, Interference? Martin Burkhart, Pascal Von Rickenbach, Roger Wattenhofer, ...
ABSTRACT Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly...
Dynamic Analysis of the Arrow Distributed Protocol* (2008)
ABSTRACT Arrow is a prominent distributed protocol which globally orders requests initiated by the nodes in a distributed system. In this paper we present a dynamic analysis of the Arrow protocol. We...
On Goal-Directed Proofs in Multiple-ConclusionedIntuitionistic Logic (2008)
James Harl, Tatjana Lutovac, Computer Science
fjah,tanja,winikoffg Abstract A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming...
Categories and Subject Descriptors G.1.5 [Mathematics of Computing]: Numerical Analysis (2008)
Stefan Kiefer, Michael Luttenberger, Formal Methods, Computer Science
ASSISTED LEARNING SYSTEMS Abstract (2008)
Tom Richards, Computer Science, Geoff Webb, Noel Craske
This paper investigates an approach to providing a general-purpose authoring/tutoring shell for intelligent computer assisted learning systems. The approach is to outline an object-oriented...
Turku Centre, Computer Science, Kalle Saari, Professor Juhani Karhumäki, Doctor Gwénaël Richomme, Professor Jeffrey Shallit, ...
This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a...
Markov chain Monte Carlo for Bayesian inference (2008)
Herbert Gleiter Karlsruhe, A. Ziegler (lübeck, G. Unland (freiberg, President Tu, Bergakademie Freiberg, W. Mönch (freiberg, ...
Recent statistical methods in cancer epidemiology with an emphasis on radiation epidemiology 1:40 p.m. Lunch 2:40 p.m. V. Didelez (London):- 9-Graphical models for causal inference in epidemiology
Adding Type-Bound Actions to Action-Oberon (2007)
Ralph Back, Martin B Uchi, Emil Sekerinski, Turku Centre, Computer Science
We extend the Action-Oberon language for executing action systems with typebound actions. Type-bound actions combine the concepts of type-bound procedures (methods) and actions, bringing object...
Deriving Distributed Systems using B-Method (2007)
M. Walden, K. Sere, Turku Centre, Computer Science
Action systems is a formalism designed for the construction of parallel and distributed systems in a stepwise manner within the refinement calculus. In this paper we show how action systems can be...
Linear Hybrid Action Systems (2007)
Mauno Rönkkö, Xuandong Li, Mauno Ronkko, Ong Li, Lemminkaisenkatu A, Turku Centre, ...
Action Systems is a predicate transformer based formalism for the development of reactive and distributed systems. Recently, Action Systems were extended with a new action called the differential...
Locally Periodic Infinite Words and a Chaotic Behaviour (2007)
J. Karhumäki, A. Lepisto, W. Plandowski, Turku Centre, Computer Science
We call a one-way infinite word w over a finite alphabet (ae; p)-repetitive if all long enough prefixes of w contain as a suffix a aeth power (or more generally a repetition of order ae) of a word of...
Verifying Time Petri Nets by Linear Programming (2007)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
We propose an approach for solving some verification problems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only...
Vesa Halava, Turku Centre, Computer Science
This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of them are undecidable. The method to prove undecidabilities is...
Thanks Jrgen, Lindskov Knudsen, Computer Science
of my project until several months after it should have been finished, and for many constructive comments, especially in the form of excellent and indispensable methodological advice. Jrgen has been...
Profitability Analysis in Distribution: A Neural Network Approach (2007)
Turku Centre, Computer Science
The purpose of this paper is to investigate whether neural networks and, especially the Kohonen's self-organizing map network, can be used in profitability analysis in distribution. We focus on...
Goodness of Time-Processor Optimal PRAM Simulations (2007)
Ville Leppanen, Turku Centre, Computer Science, Algorithmics Group
We address the question 'how to measure goodness of time-processor optimal PRAM simulations'. Instead of measuring only the asymptotic complexity of simulation time, we attempt to take into...
We suggest an approach to sequencing based on a "divide and conquer method". This approach eliminates the need for solving a hard NP-complete problem which arises when using traditional...
Ieee November San, Computer Science
Although the industrial partners of academe are unanimous in their desire to hire engineering graduates who are experienced in working productively in small groups, implementing small group work in a...
A Practical One-Semester "VLSI Design" Course for Computer Science (and Other) Majors (2007)
Robert Walker Kent, Computer Science, Other Majors, Robert A. Walker
This paper describes the development and content of a "VLSI Design" course. We had two main goals for the course: to develop a one-semester course for computer science (and other) majors,...
Electronic Document Distribution (2007)
Why Can't Read, Tim Bell (hod, Computer Science
This document presents arguments for why some methods of document exchange are appropriate and efficient, and others are not. I am not arguing that Word should not be used; in fact this document was...
Anand Sivasubramaniam, Computer Science, Dr. Sudhakar Yalamanchili
ing Network Characteristics and Locality Properties of Parallel Systems. In Proceedings of the First International Symposium on High Performance Computer Architecture, pages 54-63, January, 1995. 5....
Codes and Equations on Trees (2007)
Sabrina Mantaci, Sabrina Mantaci, Antonio Restivo, Antonio Restivo, Turku Centre, Computer Science
The objective of this paper is to study, by new formal methods, the notion of tree code introduced by M. Nivat in [23]. In particular we introduce the notion of stability for sets of trees closed...
Merging of galaxies with central black holes I. Hierarchical mergings of equal-mass galaxies (2007)
Junichiro Makino, Toshikazu Ebisuzaki, Computer Science
We investigated the merging of galaxies with central massive black holes. We performed simulation of hierarchical mergings, in which the merger remnant of one simulation was used as the progenitor...
IOS Press PathLog: a Query Language for Schemaless Databases of Partially Labeled Objects (2007)
Tadeusz Pankowski, Chair Control, Computer Science
Abstract. In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are used for modeling...
Stefano Bertolo, Bjørn Aldag, Nancy Salay, Computer Science, Michael Witbrock, ...
We present an approach for learning criteria for part-of-speech classification by induction over the lexicon contained within the Cyc knowledge base. This produces good results (73.3%) using a...
Qos-enabled Middleware, Douglas C. Schmidt, Associate Professor, Computer Science
Our proposed effort is aimed at the design, prototype implementation, and demonstration of an integrated high-speed networking and middleware infrastructure. This infrastructure will provide QoS...
THIS DISSERTATION IS A PART REQUIREMENT FOR THE (2007)
Matthew Stanford, Msc Inadvanced, Computer Science
In the last few decades, the importance of software design on the success of larger programming projects has grown rapidly. To support this process appropriate tools which support the designer in the...
Linear size test sets for certain commutative languages. Theor (2007)
Juha Kortelainen, Juha Kortelainen, Turku Centre, Computer Science
languages
Abo Akademi University, (2007)
Mauno Ronkko, Lemminkaisenkatu A, Anders P. Ravn, Turku Centre, Computer Science
Hybrid action systems extend a conventional action system with a guarded differential equation--- a differential action--- that defines evolution of continuous variables while the guard remains true....
On the Structure of Rough Approximations (2007)
Jouni J Arvinen, Turku Centre, Computer Science
We study rough approximations based on indiscernibility relations which are not necessarily reflexive, symmetric or transitive. For this, we define in a latticetheoretical setting two maps which...
A note on uniform HDT0L systems (2007)
Juha Honkala, Turku Centre, Computer Science
Very little is known about the algorithmic complexity of the HDT0L sequence equivalence problem. We determine this complexity for uniform HDT0L systems by giving the exact bound indicating how many...
TUCS On weighted possibilistic mean and variance of fuzzy numbers (2007)
Robert Fullér, Eötvös Loránd, Péter Majlender, Computer Sceince, Turku Centre, Turku Centre, ...
Dubois and Prade defined an interval-valued expectation of fuzzy numbers, viewing them as consonant random sets. Carlsson and Fullér defined an interval-valued mean value of fuzzy numbers, viewing...
Annita Fjuk, Markku I. Nurminen, Ole Smrdal, Turku Centre, Computer Science
All work needs to be articulated in terms of "Who should do what, how, when and where", and this becomes more complicated as more actors are involved. The use of computers in...
Abo Akademi University, Department of Computer Science, (2007)
Linas Laibinis, Turku Centre, Computer Science
In this paper we present an approach for modelling procedures (as they occur in imperative programs) in a weakest precondition semantics. We show how this approach can be implemented in the...
Department of Computer Science, Abo Akademi University, (2007)
Luigia Petre, Marina Wald En, Turku Centre, Computer Science
In several state-based approaches to distributed computing, e.g., action systems, or UNITY, the computing nodes are commonly left unspecified or implicit. For instance, an action system comes with an...
The Role of Geitonogamy in the Gradual Evolution to Dioecy in Cosexual Plants (2007)
Turku Centre, Computer Science
We present a model for the gradual evolution towards dioecy in cosexual plants with geitonogamous selfing. We show how geitonogamous selfing (i.e., transfer of pollen between flowers on the same...
Arto Salomaa, Turku Centre, Computer Science
We introduce the notion of a network of Watson-Crick D0L systems, a distributed system of language determining devices motivated by Watson-Crick complementarity. In this paper we compare the...
On D0L and HDT0L sets in monoids (2007)
Juha Honkala, Turku Centre, Computer Science
We continue the study of interconnections between semigroup and language theory by studying D0L, DT0L and HDT0L sets in arbitrary monoids. We show that equivalence of D0L sets and strong equivalence...
Mikael Collan, Stefan Långström, Turku Centre, Computer Science
Flexibility is an important issue when investments are being planned and valued. How flexibility inherent in investments is utilised and exploited is, therefore, of great importance to the accuracy...
Department of Computer Science, Abo Akademi University, (2007)
M. Ronkko, A. P. Ravn, Turku Centre, Computer Science
Differential equations are used in control theory to describe a system and its behaviour. They define explicitly the relationships between continuous variables during the evolution of the system. In...
Turku Centre For, Arto Salomaa, Arto Salomaa, Turku Centre, Computer Science
Watson-Crick complementarity is one of the central components of DNA computing, the other central component being the massive parallelism of DNA strands. While the parallelism drastically reduces...
Turku Centre, Computer Science
This paper contains answers to several problems in the theory of the computational complexity of innite words. We show that the problem whether all innite words generated by iterating dgsm's...
Tommi Meskanen, Turku Centre, Computer Science
A public key cryptosystem FAPKC3 by Tao and Chen is presented in details. It is based on automata theory, in particular the automaton inversion problem. Two methods for breaking certain instances of...
Governmental Visions for Future Info-Communication A Survey of the European Union, the United (2007)
Tuomas P. Valtonen, Turku Centre, Computer Science
Info-communication-- the convergence of information technology and telecommunication-- is increasingly transforming the lives of individuals, and creating new challenges for the industry and...
Subword histories and Parikh matrices (2007)
Alexandru Mateescu, Arto Salomaa, Sheng Yu, Turku Centre, Computer Science
Parikh matrices recently introduced give much more information about a word than just the number of occurrences of each letter. In this paper we introduce the general notion of a subword history and...
A New Bound for the Sequence Equivalence Problem of Polynomial D0L Systems (2007)
Juha Honkala, Turku Centre, Computer Science
We give a bound for the sequence equivalence problem of polynomially bounded D0L systems which depends only on the size of the alphabet.
Jukka Hekanaho, Turku Centre, Computer Science
We describe a GA-based concept learning/theory revision system DOGMA and discuss how it can be applied to relational learning. The search for better theories in DOGMA is guided by a novel fitness...
Formal Specification of an Asynchronous On-Chip Bus (2007)
Turku Centre For, Juha Plosila, Juha Plosila, Tiberiu Seceleanu, Tiberiu Seceleanu, Turku Centre, ...
The latest improvements in the technology of digital devices allow designers to build whole systems on a single silicon chip. New problems arise in this context, one of them being the complexity of...
Artificial neural network models for predicting patterns in auditing monthly balances (2007)
Eija Koskivaara, Turku Centre, Computer Science
Artificial neural networks (ANNs) are a computing paradigm that can be used as a basis for building intelligent information systems. The purpose of this paper is to provide additional evidence as to...
On the Stability of Pallet Loading Layouts (2007)
Jussi Jaakkola, Timo Leipl, Olli Nevalainen, Turku Centre, Computer Science
The packing layout for loading boxes of identical format on a pallet can be determined algorithmically. This is important when performing automated packing by a robot. The well-known four-block...
Abo Akademi University, (2007)
Mauno Ronkko, Anders P. Ravn, Turku Centre, Computer Science
An action system framework is a predicate transformer based method for modelling and analysing distributed and reactive systems. The actions are statements in Dijkstra's guarded command...
(G)PCP for words of length at most (2007)
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumki, Turku Centre, Computer Science
two
Hannu Tarnanen, Turku Centre, Computer Science
Let P = fP 0;:::; P n g be a partition of a finite abelian group A and L(P) the complex vector space generated by the indicator functions of the sets P 0;:::; P n. In [1] it was proved that P defines...
The Production Cell: An Exercise in the Formal Verication of a UML Model (2007)
Johan Lilius, Ivan Porres Paltor, Turku Centre, Computer Science
The Unied Modelling Language (UML) is becoming the de-facto standard for object-oriented software modelling, including software for embedded systems. In this paper, we show how to model the...
Layering Distributed Algorithms (2007)
Turku Centre, Computer Science
Superposition is a powerful program modularization and structuring method for developing parallel and distributed systems by adding new functionality to an algorithm while preserving the original...
Congestion and Dimension Characterizations by Economical Factors (2007)
Aulis Pirinen, Turku Centre, Computer Science
A new econometric method to find the optimum number of transmission lines of a transmission route is presented. The method bases on the redefined classical economic principle (Moe's Principle)...
In B. Radig, S. Florczyk, Pattern Recognition, Lecture Notes, Computer Science, Christian Bauckhage, ...
Springer-Verlag Heidelberg. Permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or...
Synchronous Pipeline Design in Action Systems (2007)
Tiberiu Seceleanu, Tiberiu Seceleanu, Juha Plosila, Juha Plosila, Turku Centre, Computer Science
The action systems formalism has recently been applied to the area of asynchronous and synchronous VLSI design. In this paper, we study formal aspects of synchronous pipelining. We show how the...
Copying quantum computer makes (2007)
Mika Hirvensalo, Turku Centre, Computer Science
NP-complete problems tractable
Fuzzy structural distance (2007)
Turku Centre For, Irina Georgescu, Irina Georgescu, Turku Centre, Computer Science
In this paper we study the fuzzy structural distance SD(R 1; R 2) of two fuzzy preorders R 1 and R 2, a concept which gives information about the relation of the cognitive systems represented by R 1...
Department of Computer Science, Abo Akademi University, (2007)
M. Ronkko, A. P. Ravn, Turku Centre, Computer Science
Based on the differential action introduced in [12] we extend the action system framework into a hybrid action system framework. Hybrid action systems are to be used in modelling and analysing hybrid...
On Conjugacy of Languages Supported by the Academy of Finland under grant 44087. (2007)
Julien Cassaigne, Turku Centre, Computer Science
We say that two languages X and Y are conjugated if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation. For example, we...
Fuzzy structural distance (2007)
Turku Centre For, Irina Georgescu, Irina Georgescu, Turku Centre, Computer Science
In this paper we study the fuzzy structural distance SD(R 1; R 2) of two fuzzy preorders R 1 and R 2, a concept which gives information about the relation of the cognitive systems represented by R 1...
Judit Csima, Arto Salomaa, Turku Centre, Computer Science
Watson-Crick D0L systems are language-theoretic models where the paradigm of complementarity is considered in the operational sense [5]. The notion is based on the iterated D0L morphism (a D0L...
Jukka Hekanaho, Turku Centre, Computer Science
We describe an application of DOGMA, a GA-based theory revision system, to MDL-based rule enhancement in supervised concept learning. The system takes as input classification data and a rule-based...
Sanna Ranto, Turku Centre, Computer Science
Identifying codes can be used to locate malfunctioning processors. We determine the cardinalities of optimal linear (1; l)-identifying and strongly (1; l)-identifying codes in Hamming spaces of any...
Rational and congruous fuzzy consumers (2007)
Turku Centre For, Irina Georgescu, Irina Georgescu, Turku Centre, Computer Science
Rational and congruous fuzzy consumers
Session 13b3 The Design of Online Tests for Computer Science I and Their Effectiveness (2007)
Computer Science, I. Therefore
Abstract – Solving problems on a computer is the focus of
Modelling Dependent Uncertainties by Multivariate Gaussian Distributions in SMAA (2007)
Risto Lahdelma, Pekka Salminen, Turku Centre, Computer Science
We consider multicriteria decision-aid (MCDA) problems with multiple decision makers. In such problems, the uncertainty or inaccuracy of the criteria measurements can be represented as probability...
Abstract. We describe a tool, programmed in Java, for the formal verification of the absence of deadlock and livelock in networks of CSP processes. The innovative techniques used scale well to very...
Comparing Tableaux, Automata and Games for Modal and Temporal Logics (extended abstract) (2007)
Computer Science, Computational Linguistics, Artificial Intelligence, Etc Because
Logics have proved to be a valuable mathematical tool for various areas in
Dennis Volpano, Cynthia Irvine, Series In Engineering, Computer Science, Matthew M. Wilding, David S. Hardin, ...
[104] Jonathan T. Throstle. Modeling a fuzzy time system. In SSP'93 [45], pages
Digital Sound Recorder: A case (2007)
Ivan Porres Paltor, Johan Lilius, Turku Centre, Computer Science
study on designing embedded systems using the UML notation.
TUCS The Greybox Approach: When Blackbox Specifications Hide Too Much (2007)
Martin Büchi, Wolfgang Weck, Oberon Microsystems Ag, Turku Centre, Computer Science
Development of different parts of large software systems by separate teams, replacement of individual software parts during maintenance, and marketing of independently developed software components...
Jonna Järveläinen, Turku Centre, Computer Science
Cruise reservation systems used by European passenger ferry companies in
Turku Centre, Computer Science, Martin Büchi, Martin Büchi, Professor Ralph Back, Professor Cliff, ...
I would like to thank my supervisor, Professor Ralph Back, for his encouragement, support, and guidance. As a professor, he provided me with the best possible apprenticeship to scientific research....
Fast Implementation of the Exact PNN Algorithm (2007)
Pasi Frnti, Timo Kaukoranta, Turku Centre, Computer Science
Straightforward implementation of the exact pairwise nearest neighbor (PNN) takes O(N 3) time, where N is the number of training vectors. This is rather slow in practical situations. Fortunately much...
What's in a Specification? (2007)
Linas Laibinis, Joakim Von Wright, Turku Centre, Computer Science
We investigate the relationship between specifications by means of Hoare triples and specification statements in the Refinement Calculus style, focusing on the issue of sharpness. In particular, we...
Szilard Languages Associated to Parallel Communicating Grammar Systems (2007)
Valeria Mihalache, Turku Centre, Computer Science
We associate Szilard and extended Szilard languages to parallel communicating grammar systems, starting from labels associated to productions of the components of the systems. We study families of...
Petteri Kaitovaara, Turku Centre, Computer Science
This paper discusses a business-relevant process model and its principles for design activity in information system (IS) development. It is based upon the findings of an interpretive and empirical...
Lucian Ilie, Turku Centre, Computer Science
is confluent with respect to a given quasi order on \Sigma if, for any x; y 2 L, there is z 2 L such that x z and y z. L is confluent with respect to in generalized sense if it is a finite union of...
Some new results on post correspondence problem and its modi (2007)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
In this work we shall consider some new result on the famous word problem called the Post Correspondence Problem (PCP), initially defined by E. Post. Halava, Hirvensalo and de Wolf [4] proved that...
Mortality in matrix semigroups (2007)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
We present a new shorter and simplified proof for the undecidability of the mortality problem in matrix semigroups, originally proved by Paterson in 1970. We use the clever coding technique...
An Interactive Metatool for Exploring Program Algebras (2007)
Joakim Von Wright, Turku Centre, Computer Science
We describe how an existing tool is extended to allow exploratory reasoning in program algebras with theorem proving support. The existing tool (TkWinHOL and the Refinement Calculator) provides a...
On infinite words generated by polynomial D0L systems (2007)
Juha Honkala, Turku Centre, Computer Science
We study innite words generated by polynomially bounded D0L systems and the relations between equivalent and!-equivalent D0L systems.
An Undecidability Result Concerning Periodic Morphisms (2007)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
The following universe problem for the equality sets is shown to be undecidable: given a weak coding h, and two morphisms g 1; g 2, where g 2 is periodic, determine whether or not h(EG (g 1; g 2)) =...
Leonid Mikhajlov, Linas Laibinis, Turku Centre, Computer Science
Independent development of components according to their specifications is complicated by the fact that a thread of control can exit and re-enter the same component. This kind of re-entrance may...
IS Requirements and Work Transformation (2007)
Vesa Torvinen, Turku Centre, Computer Science
In this paper IS requirement analysis is discussed from the perspective of work transformation. A process modelling approach, which treat computer systems as a part of human activity, is introduced....
Digital Libraries: A Human Centred Study of Computerisation in a Finnish Academic Library (2007)
Mika Kirveennummi, Vesa Torvinen, Turku Centre, Computer Science
From the perspective of librarianship some alarming, rather global changes have taken place in the library field. Firstly, the increasing use of information technology (IT) in publishing is a...
Turku Centre, Computer Science
Some open problems in combinatorics of words and related areas
Universality on Tree Automata of Moore Type (2007)
Eija Jurvanen, Turku Centre, Computer Science
We define a new type of tree automaton with output as a generalization of Moore automata. The new structure allows us to study how Moore's gedanken-experiments, where the experimenter knows only...
Thomas Finne, Turku Centre, Computer Science
An inadequate level of information security can lead to considerable economic losses for a company. Therefore information security has to be considered an important function in a company. Since...
Theory Group: Mathematical Structures in Computer Science (2007)
Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa, Turku Centre, Computer Science
Solving an open problem of [3], we prove that any slender context-free language L is strongly linear, i.e., both L and its complement are linear languages.
Associative and Fair Shuffle of!-Words (2007)
Alexandru Mateescu, George Daniel Mateescu, Turku Centre, Computer Science
We introduce and investigate some sets of!-trajectories that have the following properties: each of them defines an associative and commutative operation of parallel composition (shuffle) of!-words...
Unusual Algorithms for Lexicographical Enumeration (2007)
L. Kossuth, Turku Centre, Computer Science
Using well-known results, we show that one can effectively construct algorithms related to the lexicographical order with surprisingly low time complexity. In particular, we consider algorithms for...
Multiple Factorizations of Words and Defect Effect (2007)
Juhani Karhumaki, Turku Centre, Computer Science
We prove that if X is a finite prefix set and w is a non-periodic bi-infinite word possessing 3 disjoint X-factorizations, then the combinatorial rank of X is at most card(X) \Gamma 2. This is one of...
DEDICATION THIS WORK IS DEDICATED TO PROFESSOR FERENC G ECSEG ON HIS 60TH BIRTHDAY (2007)
L. Kossuth, Chrystopher L. Nehaniv, Turku Centre, Computer Science, Basic Notions
An automata network graph is said to be n-complete (under projection) if every automata network having underlying graph with n vertices can be simulated (under projection) on it. In this paper...
Factors Affecting End-User Computing Skills (2007)
Timo Auer, Turku Centre, Computer Science
This paper reports on the results of a study examining factors having an impact on the skills in end-user computing. Based on existing literature a research model is presented and empirically tested....
The Compression of Subsegments of Images Described by Finite Automata (2007)
Juhani Karhumaki, Wojciech Plandowski, Wojciech Rytter, Instytut Informatyki, Uniwersytet Warszawski, Turku Centre, ...
We investigate how the size of the compressed version of a 2-dimensional image changes when we cut off a part of it, e.g. extracting a photo of one person from a photo of a group of people....
Characterization of a word by its subwords (2007)
Turku Centre, Computer Science
We consider what is the amount of subwords of a word needed to completely determine the word. More precisely, we study the maximal length such that all words of this length can be uniquely determined...
Compile time sparse vectors in C++ (2007)
Jaakko Jrvi, Turku Centre, Computer Science
Templates are a powerful feature of C++. In this article a template library for a special class of sparse vectors is outlined. For these vectors, the sparseness structure of the vectors can be...
SL | A Structural Hardware Design Language for the XC6216 (2007)
Turku Centre, Computer Science
SL is a simple language designed to improve the productivity of hardware design. It is easy to use and it adopts reusable word-level and bit-level descriptions. This results in concise and easily...
On sequences defined by D0L power series (2007)
Juha Honkala, Turku Centre, Computer Science
We study D0L power series over commutative semirings. We show that a sequence (c n) n0 of nonzero elements of a field A is the coefficient sequence of a D0L power series if and only if there exist a...
New infinite families of 3-designs from the Z 4-Goethals Codes (2007)
Kalle Ranto, Turku Centre, Computer Science
We construct several new families of simple 3-designs from codewords of the Z 4-Goethals codes. These designs have parameters 3 (2 m; 8; ) with odd m 5. The smallest design has = 14(2 m 8)=3 and the...
Fuzzy Partitioning of Quantitative Attribute Domains by a Cluster Goodness Index (2007)
Turku Centre For, Attila Gyenesei, Attila Gyenesei, Turku Centre, Computer Science
The problem of mining association rules for fuzzy quantitative items was introduced and an algorithm proposed in [7]. However, the algorithm assumes that fuzzy sets are given. In this paper we...
Tommi Meskanen, Computer Science Tucs, Ari Renvall, Paula Steinby, Turku Centre, Turku Centre, ...
We present a new general exponentiation algorithm by combining the ideas of some existing algorithms. The algorithm is specially tailored for computing scalar multiplications on some binary elliptic...
Tommi Meskanen, Computer Science Tucs, Ari Renvall, Paula Steinby, Turku Centre, Turku Centre, ...
be a device of limited computing power, and assume it to have access to another device A
Three variants of the DT0L sequence equivalence problem (2007)
Juha Honkala, Turku Centre, Computer Science
We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes the!-sequence equivalence problem of D0L systems for DT0L systems.
Computational Intelligence in Business (2007)
Turku Centre, Computer Science
The neural network technology has been widely studied in the last decade. The research has already led to successful practical applications in several areas. This paper presents the technique of...
On Parikh slender context-free languages, submitted (2007)
Juha Honkala, Turku Centre, Computer Science
In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free...
Tuples and multiple return values in C++ (2007)
Turku Centre, Computer Science, Algorithmics Group
A generic tuple class, capable of storing an arbitrary number of elements each being of arbitrary type, is presented. The class oers a concise means to return multiple values from a function. Instead...
Lambda Abstraction in C++ (2007)
Turku Centre, Computer Science, Jaakko Jrvi, Jaakko Jrvi, Gary Powell, Gary Powell
The Lambda Library (LL) adds a form of lambda abstraction to C++. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL...
On the equivalence problem of context-free and DT0L languages (2007)
Juha Honkala, Turku Centre, Computer Science
It is undecidable whether or not a given context-free language and a propagating DT0L language are equal. We show that equivalence is decidable between context-free and everywhere growing DT0L...
Generalized factors of words (2007)
Lucian Ilie, Turku Centre, Computer Science
We introduce and study relations on words which generalize the factor relation, being restrictions of the subword relation. We give an equivalent condition for the finite basis property for these...
Codes and Equations on Trees (2007)
Sabrina Mantaci, Antonio Restivo, Turku Centre, Computer Science
The objective of this paper is to study, by new formal methods, the notion of tree code introduced by M. Nivat in [23]. In particular we introduce the notion of stability for sets of trees closed...
and Structural Induction (2007)
Alexandru Mateescu, Turku Centre, Computer Science
The main motivation for this work is the search for an induction proof schema that is suitable for implementation in a mechanical proof tool. The distinction between weak and strong induction is made...
Juha Honkala, Turku Centre, Computer Science
Ehrenfeucht's Conjecture is equivalent with the ascending chain condition for word equations. A related conjecture concerns the descending chain condition for word equations. We show that if...
Testing Different Sharing Methods in Concept Learning (2007)
Jukka Hekanaho, Turku Centre, Computer Science
Sharing is a popular method for introducing divergency in genetic algorithms for multimodal function optimization. In this paper we define three sharing methods and investigate their applicability...
A Kleene-Schutzenberger Theorem for Lindenmayerian Rational Power Series (2007)
Juha Honkala, Turku Centre, Computer Science
We dene L rational and L recognizable power series, and establish a KleeneSch utzenberger theorem for Lindenmayerian power series by showing that a power series is L rational if and only if it is L...
Shuffle on trajectories: a simplified approach to the Schutzenberger (2007)
Tero Harju, Alexandru Mateescu, Arto Salomaa, Turku Centre, Computer Science
product and related operations
Turku Centre For, Juha Honkala, Juha Honkala, Turku Centre, Computer Science
On D0L power series over various
On the Crossover Distance (2007)
Victor Mitrana, Grzegorz Rozenberg, Arto Salomaa, Turku Centre, Computer Science
A basic problem in the area of combinatorial algorithms for genome evolution is to determine the minimum number of large scale evolutionary events (genome rearrangements) that transform a genome into...
Results concerning thinness of DOL languages (2007)
Juha Honkala, Turku Centre, Computer Science
A language L is called thin if there exists an integer n 0 such that for all n n 0 L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show...
Wojciech Plandowski, Turku Centre, Computer Science
the satisfiability problem for word equations
On slender 0L languages over the binary alphabet (2007)
Juha Honkala, Turku Centre, Computer Science
A language L is called slender if there exists a constant k such that L contains no k words of equal length. In this paper we continue the study of relationships between slender languages and bounded...
Mobile Ambients and P-Systems Ion Petre (2007)
Turku Centre For, Luigia Petre, Luigia Petre, Turku Centre, Computer Science
The mobile ambients and the P-systems are models developed in different areas of computer science, based on very similar concepts and structures. Given their resemblance, we point out how to transfer...
ML-style Tuple Assignment in Standard C++ | Extending the Multiple Return Value Formalism (2007)
Turku Centre, Computer Science, Algorithmics Group
It has been shown previously that tuples can be implemented with templates in standard C++. This article extends the author's previous work on tuples and multiple return values by dening generic...
WHY SAFEGUARD INFORMATION? (2007)
Turku Centre, Computer Science, Thomas Finne, Thomas Finne
The security of information is becoming increasingly discussed. In this paper I will show why the subject is of importance and what economic losses inadequate ISEC can bring an organisation. Key...
Binary Self-Adding Sequences and Languages (2007)
Lucian Ilie, Victor Mitrana, Turku Centre, Computer Science
We introduce the self-adding sequences, the binary case, and their associated languages. These languages are neither context-free nor D0L languages, but the inclusion (implicitly, the equivalence)...
Rational, Linear and Algebraic Languages with Mix Operation (2007)
Manfred Kudlek, Alexandru Mateescu, Turku Centre, Computer Science
We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets, one of them having some priority. Such operations are generalizations of the classical...
TUCS Technical Reports No 343, (2007)
Turku Centre, Turku Centre, Computer Science, Computer Science
The difference operation on semilinear power series Ion Petre
sequence equivalence problem (2007)
Juha Honkala, Juha Honkala, Turku Centre, Computer Science
equivalence problem
On sparse 0L languages over the binary alphabet (2007)
Juha Honkala, Turku Centre, Computer Science
Latteux and Thierrin have characterized sparse context-free languages by showing that a context-free language L is sparse if and only if L is bounded. We prove a similar result for binary 0L...
Easy cases of the D0L sequence equivalence problem (2007)
Juha Honkala, Turku Centre, Computer Science
To test the equivalence of two binary D0L sequences it suces to compare the rst four terms of the sequences. We introduce a larger class of D0L systems for which sequence equivalence can be decided...
On Morphisms Preserving Primitive Words (2007)
Victor Mitrana, Turku Centre, Computer Science
A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a...
Descriptive Statistics on Companies in the Forest Products Industry (2007)
Kristoffer Strm, Barbro Back, Hannu Vanharanta, Ari Visa, Turku Centre, Computer Science
A prerequisite of many statistical methods is that the underlying data material is normally or approximately normally distributed. If the data material violates this assumption, the results of an...
On Marked Post Correspondence Problem (2007)
Vesa Halava, Turku Centre, Computer Science
It was proved by Halava, Hirvensalo and de Wolf [3] that if the morphisms are marked, then the Post Correspondence Problem (PCP) is decidable. Moreover, Halava, Harju and Hirvensalo [2] proved that...
Grammars Working on Layered Strings (2007)
Paolo Bottoni, Giancarlo Mauri, Piero Mussio, Gheorghe Paun, Turku Centre, Computer Science
We consider first an operation with strings and languages suggested by superposed windows on the computer screen (as well as by cryptographic systems of Richelieu type): we assume that the strings...
Paolo Bottoni, Giancarlo Mauri, Piero Mussio, Gheorghe Paun, Turku Centre, Computer Science
We introduce a computability model-- called shape grammar-- based on adjoining polyominoes. A computation in a shape grammar is correct when: (1) it starts by using a specified polyomino; (2) it ends...
Perspectives on and Prospects for Software Agent Systems (2007)
Shuhua Liu, Turku Centre, Computer Science
In this paper we propose a framework for analyzing the impacts of software agent system. The framework is applied to examine the impacts of an agentbased scanning and interpretation system on...
Zeros of Z-rational sequences and thin 0L languages (2007)
Juha Honkala, Turku Centre, Computer Science
A language L is called thin if for almost all n, L contains at most one word of length n. In a previous paper we have shown that thinness is decidable for exponential D0L languages. In this note we...
Languages Accepted by Integer Weighted Finite Automata (2007)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
We study the family of languages accepted by the integer weighted nite automata. Especially the closure properties of this family are investigated.
The DF0L language equivalence problem (2007)
Juha Honkala, Turku Centre, Computer Science
We show that equivalence is decidable for D0L systems with nite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable elds.
Global Asymptotical Stability of The Non-Trivial Steady State of an Epidemic Model (2007)
Yan Ping, Turku Centre, Computer Science
In this paper I prove a conjecture of Diekmann and Heesterbeek about the global asymptotocal stability of the non-trivial steady state of an epidemic model.
Checking Time Petri Nets for Linear Duration Properties (2007)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
In this paper, we consider the problem of checking time Petri nets for linear duration properties, which are linear inequalities on integrated durations of system states. By showing that a time Petri...
The American Genetic Association 93:260--269 (2007)
Comparisons Of Likelihood, Computer Science, Wildlife Service, B. Guin, A. Topchy, ...
this article is to describe several of the more widely used machine learning classifiers that may have utility when used with empirical population genetics data. We compare likelihoodbased...
1 Waikato Applied Network Dynamics (2007)
Klaus Mochalski, Jrg Micheel, Stephen Donnelly, Computer Science, G Block
Abstract-- In this paper we study packet delay and loss for IP data traversing the University of Auckland Internet access path. The ISP uplink of the university has been the subject of previous...
Domain Theory Corrected and expanded version (2007)
Samson Abramsky, Achim Jung, Computer Science, Edited S. Abramsky, Dov M. Gabbay
E. Maibaum, published by Clarendon Press, Oxford in 1994. While the numbering of all theorems and definitions has been kept the same, we have included comments and corrections which we have received...
Estimating Surface Reflectance Properties from Images under (2007)
Unknown Illumination Ron, Ron O. Drora, Edward H. Adelsonb, Computer Science
Physical surfaces such as metal, plastic, and paper possess di#erent optical qualities that lead to di#erent characteristics in images. We have found that humans can e#ectively estimate certain...
Spatial and Temporal Structures in Cognitive Processes * (2007)
R Valk (eds, Lecture Notes, Computer Science, Christian Freksa
Abstract. The structures of space and time are identified as essential for the realization of cognitive systems. It is suggested that the omnipresence of space and time may have been responsible for...
Koen Erik, Adriaan Sande, Computer Science, Koen Erik, Adriaan Sande, Prof Dr, ...
4 Video concept detection aims to detect high-level semantic information present in video. State-of-the-art systems are based on visual features and use machine learning to build concept detectors...
Masters Science, Computer Science
implemented the database access layer in a workload management system for Oracle RAC databases. Research Assistant at the Computational Learning Lab (CLL), Center for Study of Language
Programming for Wireless Sensor Network Comprehensive Exam Report (2007)
Kajari Ghoshdastidar, Steve Bruell, Computer Science, Sukumar Ghosh, Geb W Thomas, Industrial Engineering
This report presents a comprehensive overview of the different research done in the area of programming small, low-cost embedded and sensor devices. The discussion starts with a brief introduction to...
David Weiss, Ken Norman Psychology, David Blei, Computer Science
In recent years, an important new application of machine learning research has emerged from the field of cognitive neuroscience. In ‘mind-reading ’ experiments, a machine learn-ing classifier is...
Probabilistic models for anomaly detection in remote sensor data streams (2007)
Ethan W. Dereszynski, Masters Science, Computer Science, Thomas G. Dietterich, Ethan W. Dereszynski
Abstract approved:
Julie Greensmith, Uwe Aickelin, Gianni Tedescoschool, Computer Science
Dendritic cells are antigen presenting cells that provide a vital link between the innate and adaptive immune system, providing the initial detection of pathogenic invaders. Research into this family...
Scan strategies for adaptive meteorological radars (2007)
Victoria Manfredi, Computer Science
Abstract We address the problem of adaptive sensor control in dynamic resource-constrained sensor networks. We focus on a meteorological sensing network comprising radars that can perform sector...
Reconfigurable resource scheduling with variable delay bounds (2007)
C. Greg Plaxton, Yu Sun, Mitul Tiwari, Computer Science
Abstract Certain emerging network applications involve dynamically allocating shared resources to a variety of services toprovide QoS guarantees for each service. Motivated by such applications, we...
How does one go about creating projects in Entertainment Technology?
cover. Lecture Notes in Computer Science, 3989:178–193, 2006. (2006)
I. Aktug, Computer Science, Pages Springer, Mattias Johansson, Gunnar Kreitz, ...
[7] J. Håstad. The security of the IAPM and IACBC modes. Journal of
Turku Centre, Computer Science, Viorel Preoteasa, Academy Professor, Ralph-johan Back, Doctor John, ...
To my family
Profile-guided specialization of an operating system kernel (2006)
Somu Perianayagam, Haifeng He, Mohan Rajagopalan, Gregory Andrews, Computer Science
Abstract General-purpose operating systems such as Linux are in-creasingly replacing custom embedded counterparts on a wide variety of devices. Despite their convenience and flex-ibility, however,...
Constructing collaborative desktop storage caches for large scientific datasets (2006)
Sudharshan S. Vazhkudai, Xiaosong Ma, Vincent W. Freeh, Jonathan W. Strickland, Tyler Simon, Stephen L. Scott, ...
or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and
The Triptych Process Model 1 Process Assessment and Improvement (2006)
Computer Science, Engineering Informatics, Mathematical Modelling
Loud and clear: Human-verifiable authentication based on audio (2006)
Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Computer Science
Index Terms: Human-assisted authentication, Man-in-the-middle attack, Audio, Text-to-speech, Public key, Key agreement,Personal device, Wireless networks.
Computer Science, Lukasz Golab, Kumar Gaurav Bijay, Tamer Özsu, Kumar Gaurav Bijay, Antoine Vigneron
Awarded AP grade in Mathematics and Sociology in second year (given for top
Improving Loss Resilience with Multi-Radio Diversity in Wireless Networks (2005)
Allen Miu, Hari Balakrishnan, Can Emre, Koksal Mit, Computer Science
Learning causally linked Markov random fields (2005)
G. E. Hinton, S. Osindero, Computer Science
1 Introduction Generative models are widely used within machinelearning. However, in many applications the graphical models involve exclusively causal, or exclusivelyundirected edges. In this paper...
Hibernator: helping disk arrays sleep through the winter (2005)
Qingbo Zhu, Zhifeng Chen, Lin Tan, Computer Science, Kimberly Keeton, ...
Relying on Autonomous Multipath Routing to Achieve Global Load Balancing in the Internet (2005)
Robert Löfman, Turku Centre, Computer Science, Robert Löfman
Currently in the Internet, only few intra-domain routing protocols support multipath routing where sub-optimal routes are used for load balancing. On the inter-domain level there is no such protocol...
Word Sense Discrimination (WSD) � One word with multiple senses/meanings. (2005)
Anagha Kulkarni, Dr. Ted Pedersen, Computer Science, U Of Minnesota
� Dr. Guergana Savova, for her support and guidance.
A break-even formulation for evaluating branch predictor energy efficiency (2005)
Recent work has demonstrated that a better branch pre-dictor can increase the energy-efficiency of the system, even if the new predictor consumes more energy. Conse-quently, understanding the...
Enhance TCP Performance with Multiple Path Routing (2005)
Frank E. Watson, Frank E. Watson, Jugal K. Kalita, Sudhanshu K. Semwal, Computer Science
has been approved for the
THEORY OF ADAPTIVE EVOLUTIONARY ALGORITHMS (2005)
James Neal Richter, Chair John Paxton, Computer Science
ii This Dissertation proposal has been read by each member of the Dissertation committee and has been found to be satisfactory.
Asymmetric batch incremental view maintenance (2005)
Hao He, Junyi Xie, Jun Yang, Computer Science
Materialized views [9] have been studied extensivelyby the database community because of a wide range of traditional applications, such as query processing, datawarehousing, caching and replication....
A framework for sequential planning in multi-agent settings (2005)
Piotr Gmytrasiewicz, Prashant Doshiartificial, Piotr J. Gmytrasiewicz, Computer Science
Talya Meltzer, Chen Yanover, Yair Weissschool, Computer Science
Abstract A wide range of low level vision problems have been for-mulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest en-ergy configuration)....
Parameterized object sensitivity for points-to analysis for java (2005)
Ana Milanova, Atanas Rountev, Computer Science
ABSTRACT The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference objet field. Improving the precision of practical points-to...
A new approach to thread extraction for general-purpose programs (2005)
Guilherme Ottoni, Ram Rangan, Adam Stoler, Computer Science, Electrical Engineering
Photometric stereo is a shape-from-shading method for recovering threedimensional surface orientation information from two-dimensional images with differing illumination but the same viewing...
♦ Re: writing a C compiler in Common Lisp (2005)
From Paul Tarvydas, Rosselet J. A, Pt A Pascal, Rep Csrg, Computer Science
Other papers that would interest you, if S/SL compiler−writing interests you: A complete compiler written in S/Sl:
An Energy Consumption Model for Java Virtual Machine (2004)
Sébastien Lafond, Johan Lilius, Turku Centre, Computer Science
In recent years we have seen an explosion of markets for portable electronic devices such as PDAs, personal communicators and mobile phones. The size and complexity of applications, but also...
End system service examples (2004)
Abstract This technical report investigates services suitable for end systems. We look into ITU Q.1211 services, AT&T5ESS switch services, services defined in CSTA Phase III, and new services...
Foundations of security for hash chains in ad hoc networks,” To Appear (Full version of [9 (2004)
Phillip G. Bradford, Computer Science
Nodes in ad hoc networks generally transmit data at reg-ular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power andhave very limited memory....
Reducing Energy Consumption of Disk Storage Using Power-Aware Cache Management (2004)
Qingbo Zhu, Francis M. David, Christo F. Devaraj, Zhenmin Li, Yuanyuan Zhou, Computer Science
User News) [32], today's data centers have power require-ments that range from 75 W/ft
Generalized typestate checking using set interfaces and pluggable analyses (2004)
Patrick Lam, Viktor Kuncak, Martin Rinardlaboratory, Computer Science
Abstract We present a generalization of standard typestate systems in which the typestate of each object is determined by its membership in a collection of abstract typestate sets. This...
Energy-efficiency and storage flexibility in the blue file system (2004)
Edmund B. Nightingale, Electrical Engineering, Computer Science
Abstract A fundamental vision driving pervasive computing re-search is access to personal and shared data anywhere
Elastic Block Ciphers: The Feistel Cipher Case (2004)
Debra L. Cook, Moti Yung, Computer Science
Abstract We discuss the elastic versions of block ciphers whose round function processes subsets of bits fromthe data block differently, such as occurs in a Feistel network and in MISTY1. We focus on...
Message errors in belief propagation (2004)
Abstract Belief propagation (BP) is an increasingly popular method of perform-ing approximate inference on arbitrary graphical models. At times, even further approximations are required, whether from...
Fault Tolerance in a Layered Architecture: a General Specification Pattern in B (2004)
Linas Laibinis, Elena Troubitsyna, Turku Centre, Computer Science
Dependable control systems are usually complex and prone to errors of various natures. Such systems are often built in a modular and layered fashion. To guarantee system dependability, we need to...
Refinement of fault tolerant control systems in B (2004)
Linas Laibinis, Elena Troubitsyna, Turku Centre, Computer Science
Application of formal methods helps us to gain confidence in building correct software. On the other hand, to guarantee dependability of the overall system we need to build fault tolerant software,...
Predicting Properties of the Rat Somatosensory System by Sparse Coding (2004)
Verena Vanessa Hafner, Miriam Fend, Peter König, Konrad Paul Körding, Konrad Paul, Computer Science, ...
Many studys address how neurons in the barrel cortex of rats...
Andrei Sabelfeld (Editor) (2004)
Andrei Sabelfeld (editor, Turku Centre Computer, Computer Science, Andrei Sabelfeld, Francisco Martins, António Ravara
Tom Chothia, Dominic Duggan, and Jan Vitek ii Weak Secrets and Computational Soundness . . . . . . . . . . . . . . . . . . . . . . . . . . . 243 Mart n Abadi Workshop on Logical Foundations of an...
Mining Karlton Sequeira, Karlton Sequeira, Mohammed Zaki, Mohammed J. Zaki, Computer Science, Rpi He
High-dimensional data pose challenges to traditional clustering algorithms due to their inherent sparsity and data tend to cluster in different and possibly overlapping subspaces of the entire...
Artificial Neural Networks in Auditing: State of the Art (2004)
Eija Koskivaara, Turku Centre, Computer Science
Very many things in our business and auditing environment are changing at an increasing rate. One central theme in auditing is how information technology developments affect the nature of the audit...
Discretionary object confinement: A minimalistapproach to capabilities for the JVM (2004)
Boting Yang, Boting Yang, Computer Science
Abstract Secure cooperation is the problem of protecting mutually suspicious code units from one another. The notion ofcapabilities is an effective means for facilitating secure cooperation in...
Capabilities as Alias Control: Secure Cooperation inDynamically Extensible Systems (2004)
Abstract Secure cooperation is the problem of protecting mutually suspicious code units within thesame execution environment from their potentially malicious peers. A statically enforceable
LETTER Predicting Properties of the Rat Somatosensory System by Sparse Coding (2004)
Verena Vanessa Hafner, Miriam Fend, Konrad Paul, Computer Science, Laboratory Paris
Abstract − Many studies address how neurons in the barrel cortex of rats react to stimulation of the rat’s whiskers. In this study we analyse how the statistical properties of whisker deflections...
Approximate solutions for partially observable stochastic games with common payoffs (2004)
Rosemary Emery-montemerlo, Geoff Gordon, Jeff Schneiderschool, Computer Science
Abstract Partially observable decentralized decision making inrobot teams is fundamentally different from decision making in fully observable problems. Team members cannot simplyapply single-agent...
Detection and visualization of anomalous structures in molecular dynamics simulation data (2004)
Sameep Mehta, Computer Science, Kaden Hazzard, John Wilkins, Srini Parthasarathy
Figure 1: Si System with an interstitial defect (dataset I1) (a) Lattice with bulk and defect (b) Salient Iso-surface with ability to distinguish between bulk and defect (c) An arbitrary slice of...
P2P Simulations with Trust and Reputation Algorithms (2004)
Computer Science, Instructor Ulf Reiman, Examiner Tingting Zhang, Marcus Öjes, Marcus Öjes, Marcus Öjes, ...
File sharing on all kind of networks is an increasing activity. The most used file sharing system is Peer-to-Peer (P2P) networking and for now the users of such systems is rather uncontrolled without...
Inferring specifications to detect errors in code (2004)
Mana Taghdiri, Daniel Jackson, Computer Science, Ai Lab
Abstract. A new technique is presented to statically check a given procedure against a user-provided property. The method requires no annotations; it automatically infers a context-dependent...
Detection and visualization of anomalous structures in molecular dynamics simulation data (2004)
Sameep Mehta, Computer Science, Kaden Hazzard, Srinivasan Parthasarathy, John Wilkins
Figure 1: Si system with a tri-interstitial defect (dataset I1) (a) Lattice with bulk and defect (b) Salient Iso-surface with ability to distinguish between bulk and defect (c) An arbitrary slice of...
Formal Verification of a Ubiquitous Hardware Component (2004)
Turku Centre, Computer Science, Lu Yan
The paper begins by discussing various approaches to hardware specification and verification. The main emphasis is on using mechanical verification tools to assist the verification process. The case...
TUCS General Publication (2004)
Turku Centre, Computer Science, Ralph-johan Back, Kaisa Sere
The Formal Methods in Programming research group at ˚Abo Akademi University was elected as a Centre of Excellence in Research by the Academy of Finland for the six year period 2002-07. The present...
Strong spatial mixing for lattice graphs with fewer colours (2004)
Leslie Ann Goldberg, Russell Martin, Computer Science
Abstract Recursively-constructed couplings have been used in thepast for mixing on trees. We show for the first time how to extend this technique to non-tree-like graphs such as the in-teger lattice....
Spheres: A New/Old Model for Distributed Computing (2004)
Mark Miller, Christian Scheidelerdept, Computer Science
Abstract Peer-to-peer systems have recently attracted an enormous amount of attention both inside and outsideof the research community. Systems such as Gnutella and KaZaA have demonstrated that...
Computer Science, Tu Delft, I. Fern, Ez Diaz
Wireless ad-hoc networks, which are becoming very popular, have no central administration or predefined network structure. An example of this type of network is the Context Aware Communication,...
Functional and Object-Oriented Modeling of Embedded Software (2003)
João M. Fernandes, Turku Centre For, João M. Fernandes, Turku Centre, Computer Science
The main aim of this report is to discuss how the functional and the object-oriented views can be inter-played in order to model the various modeling perspectives of an embedded system. We discuss if...
On Designing for Modularity (2003)
Cristina Cerschi Seceleanu, Tiberiu Seceleanu, Turku Centre, Computer Science, Cristina Cerschi Seceleanu, Tiberiu Seceleanu, ...
Action systems, a state-based formalism for modeling reactive, distributed systems, provides a simple, yet powerful conceptual model for concurrency. Interleaved execution of actions gives the basic...
Obfuscation of Executable Code to Improve Resistance to Static Disassembly (2003)
Abstract A great deal of software is distributed in the form ofexecutable code. The ability to reverse engineer such
Anonymous usage of location-based services through spatial and temporal cloaking (2003)
Marco Gruteser, Computer Science
and dissemination of a user's or object's position [1, 2].There is an immense interest in exploiting this positional data through location-based services (LBS) [3, 4, 5, 6].For instance,...
Model Refactorings as Rule-Based Update Transformations (2003)
Ivan Porres, Turku Centre, Computer Science
A model refactoring is a model transformation that preservers some behavioral properties of a model. Equally important, a model refactoring should only affect a previously chosen subset of the source...
Marcus Alanen, Ivan Porres, Turku Centre, Computer Science
We review the central concepts required from a project and configuration management system for MOF-based models. The necessary features for a model repository and MOF framework are given, as well as...
A Healthcare Case Study: Fillwell Pontus Boström, (2003)
Micaela Jansson, Marina Waldén, Turku Centre, Computer Science
We describe a case study on a liquid handling workstation, Fillwell, that has been conducted within the EU-project MATISSE as a co-operation between academia and industry. Since the workstation is a...
Bayesian clustering of optical flow fields (2003)
Abstract We present a method for unsupervised learning of classesof motions in video. We project optical flow fields to a complete, orthogonal, a-priori set of basis functions in a prob-abilistic...
Component-Oriented Development of Action Systems (2003)
Turku Centre, Computer Science
We present an approach to compositional refinement of action systems and their interfaces. Our approach is intended to provide a support for the component-oriented development of action systems. We...
Nonparametric belief propagation (2003)
Erik B. Sudderth, Er T. Ihler, William T. Freeman, Computer Science
Abstract In applications of graphical models arising in fields such as computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions....
Optimal, efficient reconstruction of phylogenetic networks with constrained recombination (2003)
Dan Gusfield, Satish Eddhu, Charles Langley, Dan Gusfield, Computer Science
Stepwise Development of Peer-to-Peer Systems (2003)
Lu Yan, Kaisa Sere, Turku Centre, Computer Science
Peer-to-peer systems like Napster, Gnutella and Kazaa have recently become popular for sharing information. In this paper, we show how to design peer-to-peer systems within the action systems...
Optimal, efficient reconstruction of phylogenetic networks with constrained recombination (2003)
Dan Gusfield, Computer Science
Abstract A phylogenetic network is a generalization of a phyloge-netic tree, allowing structural properties that are not treelike. With the growth of genomic data, much of which doesnot fit ideal...
Distributed Energy-Conserving Routing Protocols for Sensor Networks (2003)
Qun Li, Javed Aslam, Computer Science
max-min zPmin al-gorithm presented in [12]. The first two algorithms are used to define the third, although they are very inter-esting and useful on their own for applications where the optimization...
Distributed Energy-Conserving Routing Protocols for Sensor Networks (2003)
Qun Li, Javed Aslam, Computer Science
max-min zPmin al-gorithm presented in [12]. The first two algorithms are used to define the third, although they are very inter-esting and useful on their own for applications where the optimization...
Incremental multiset hash functions and their application to memory integrity checking (2003)
Dwaine Clarke, Srinivas Devadas, Marten Van Dijk, Blaise Gassend, G. Edward, Suh Mit, ...
Abstract. We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). They map...
Incremental multiset hash functions and their application to memory integrity checking (2003)
Dwaine Clarke, Srinivas Devadas, Marten Van Dijk, Blaise Gassend, G. Edward, Suh Mit, ...
Abstract. We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). They map...
Dvs: An object-oriented framework for distributed verilog simulation (2003)
Lijun Li, Hai Huang, Computer Science
Abstract There is a wide-spread usage of hardware design lan-guages(HDL) to speed up the time-to-market for the design of modern digital systems. Verification engineers can sim-ulate hardware in...
Sending Messages in UML (2003)
Gonzalo Génova, Juan Llorens, Vicente Palacios, Computer Science
In this paper we try to clarify the issue of associations as a communication infrastructure between objects, in search for a unified view of the static and dynamic aspects of associations....
Modular inference for array checks optimization (2003)
Dana N. Xu, Corneliu Popeea, Siau-cheng Khoo, Computer Science
In this paper, we propose a new inference mechanism, based on a restricted form of dependent type, called sized type[12, 5], that is crafted to maximise the elimination of arrayrelated checks. Our...
Enhanced Secure DNS: A Defense Against DDOS Attacks (2003)
David Boyd Wilkinson, David B. Wilkinson, C. Edward Chow, Computer Science, C. Edward Chow
The success of distributed denial of service (DDOS) attacks carried out against ebusiness websites...
An UML Profile for Action Systems (2003)
Tomi Westerlund, Tiberiu Seceleanu, Tomi Westerlund, Tiberiu Seceleanu, Turku Centre, Computer Science
ISBN 952-12-1285-3
A Relation Between Context-Free Grammars and Meta Object Facility Metamodels (2003)
Marcus Alanen, Ivan Porres, Turku Centre, Computer Science
Metamodels present the language of models, much in the way that grammars present the language of programs. In this paper, we study the relation between context-free (Backus-Naur Form) grammars and...
On Network Latency In Distributed Interactive (2003)
J. D. Delaney, Computer Science, T. Ward, S. Mcloone, ...
This paper has three objectives. Firstly it describes the historical development of Distributed Interactive Applications. It then defines network latency. Finally it describes a new approach to...
Towards a Definition of a Computer Game (2003)
Jouni Smed, Harri Hakonen, Turku Centre, Computer Science
This paper approaches computer games from three perspectives: First, by defining the properties common to all games. Second, by fitting computer games into Model--View--Controller architectural...
A genetic approach to planning in heterogeneous computing environments (2003)
Han Yu, Dan C. Marinescu, Computer Science
Abstract Planning is an artificial intelligence problem with a widerange of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic searchmethods often...
A Neural Network Model for Prediction: Architecture and Training Analysis (2003)
Iulian Nastac, Eija Koskivaara, Turku Centre, Computer Science
The main purpose of the present paper is to establish an optimum feedforward neural architecture and a well suited training algorithm for financial forecasting. The artificial neural networks (ANNs)...
Geometric Ad-Hoc Routing: Of Theory and Practice (2003)
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Computer Science
ABSTRACT All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In...
A generic deep copy algorithm for MOF-based models (2003)
Ivan Porres, Marcus Alanen, Turku Centre, Computer Science
This paper discusses the problem of copying a subset of a model based on the Meta Object Facility (MOF), such as a UML model. We show how the usual shallow and deep copy operators implemented in many...
Abstract The paper describes tableaux based proof methods fortemporal logics of knowledge allowing interaction axioms between the modal and temporal components. Such logicscan be used to specify...
Enforcing fair sharing of peer-to-peer resources (2003)
Dan S. Wallach, Computer Science
Abstract Cooperative peer-to-peer applications are designed toshare the resources of each computer in an overlay network for the common good of everyone. However, usersdo not necessarily have an...
Aiying Rong, Henri Hakonen, Risto Lahdelma, Turku Centre, Computer Science
An efficient linear model and
Abstract The use of feedback control theory for performanceguarantees in QoS-aware systems has gained much attention in recent years. In this paper, we investigate merging,within a single framework,...
Using Peer-to-Peer Data Routing for Infrastructure-Based Wireless Networks (2003)
Sethuram Balaji Kodeswaran, Olga Ratsimor, Anupam Joshi, Tim Finin, Computer Science, ...
Proxy-Assisted Power-Friendly Streaming to Mobile Devices (2003)
Prashant Shenoy, Computer Science
Abstract Since multimedia applications are known to be resource-hungry and mobile devices are resource-poor, in thispaper, we propose techniques to reduce the energy consumption of streaming media...
K.: Hybrid action systems (2003)
M. Ronkko, A. P. Ravn, Turku Centre, Computer Science
Based on the di erential action introduced in [12] we extend the action system framework into a hybrid action system framework. Hybrid action systems are to be used in modelling and analysing hybrid...
Postprocessing decision trees to extract actionable knowledge (2003)
Qiang Yang, Computer Science, Hong Kong, Technologyclearwater Bay, Kowloon Hong Kong
Extensive research in data mining has been done ondiscovering distributional knowledge about the underlying data. Models such as the Bayesian models, decision trees,support vector machines and...
Formal Specification of an Asynchronous On-Chip Bus (2002)
Juha Plosila, Tiberiu Seceleanu, Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
The latest improvements in the technology of digital devices allow designers to build whole systems on a single silicon chip. New problems arise in this context, one of them being the complexity of...
- Original version by AUTHORS, DATE (2002)
Turku Centre, Computer Science, Åbo Akademi
Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the...
Profile-directed optimization of event-based programs (2002)
Mohan Rajagopalan, Computer Science
ABSTRACT Event-based systems provide a simple way to create flexible, ex-tensible, and customizable system architectures and give a "userdriven " feel to the system. However, the...
- Original version by AUTHORS, DATE (2002)
Turku Centre, Computer Science, Åbo Akademi
Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of...
From Kleene Algebra to Re nement Algebra (2002)
Joakim Von Wright, Turku Centre, Computer Science
KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Re nement Algebra), a variation of KAT for total...
Garbage collector memory accounting in language-based systems (2002)
David W. Price, Algis Rudys, Computer Science
Multitasking language run-time systems appear in a vari-ety of commercial systems, ranging from applets running in web browsers and servlets in web servers to plugins runningin extensible databases...
Formalizing Programming Variables in Process Algebra (2002)
Victor Bos, Turku Centre, Computer Science
We use an existing ACP-style process algebra as a formal framework for imperative sequential programming. The framework is realized by instantiating this process algebra with a suitable set of atomic...
Computer Science, James Glimm Director, Brookhaven Science Associates
Contract No. DE-AC02-98CH10886
Modelling Dependent Uncertainties by Multivariate Gaussian Distributions in SMAA (2002)
Risto Lahdelma, Pekka Salminen, Turku Centre, Computer Science
We consider multicriteria decision-aid (MCDA) problems with multiple decision makers. In such problems, the uncertainty or inaccuracy of the criteria measurements can be represented as probability...
Novelty and redundancy detection in adaptive filtering (2002)
Yi Zhang, Jamie Callanschool, Computer Science
ABSTRACT This paper addresses the problem of extending an adaptive information filtering system to make decisions about the novelty and redundancy of relevant documents. It argues that relevance and...
On strongly identifying codes (2002)
Iiro Honkala, Iiro Honkala, Tero Laihonen, Tero Laihonen, Sanna Ranto, Sanna Ranto, ...
Lemminkaisenkatu 14 A, 4th oor
Invasion dynamics and attractor inheritance (2002)
M. Gyllenberg, K. Parvinen, Turku Centre, Computer Science
We study the dynamics of a population of residents that is being invaded by an initially rare mutant. We show that under relatively mild conditions the sum of the mutant and resident population sizes...
From Kleene algebra to refinement algebra (2002)
Joakim Von Wright, Turku Centre, Computer Science
KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Refinement Algebra), a variation of KAT for total...
Watson-Crick D0L systems: the power of one transition (2002)
Arto Salomaa, Turku Centre, Computer Science
We investigate the class of functions computable by uni-transitional WatsonCrick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in...
A toolkit for manipulating UML models (2002)
Ivan Porres, Turku Centre, Computer Science
We present a Python module manipulating software models described using the Unied Modeling Language. The toolkit is generated automatically from a UML metamodel le and it supports all UML model...
Building Models: A Direct but Neglected Approach to Teaching Computer (2002)
Computer Science, John E. Howland
The use of software models for teaching a variety of computer science topics is a valuable technique. Such models may be studied by reading and examining the model itself. Additionally, the models...
Decision questions on integer matrices (2002)
Tero Harju, Turku Centre, Computer Science
We give a survey of simple undecidability results and open problems concerning matrices of low order with integer entries. Connections to the theory of nite automata (with multiplicities) are also...
Infinite solutions of marked Post correspondence problems (2002)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
In an instance of the Post Correspondence Problem we are given two morphisms h; g: A
Classifying Alternatives in SMAA Using Cross Confidence Factors (2002)
Risto Lahdelma, Pekka Salminen, Turku Centre, Computer Science
Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to...
MASTER'S THESIS:NOMADIC OPERATING SYSTEMS (2002)
Byjacob Gorm Hansen, Asger Kahl, Computer Science
Abstract This thesis attempts to solve the configuration and reconfiguration difficulties encountered inutility computing, by allowing problem instances to be submitted as running nomadic operating...
Policy recognition in the Abstract Hidden Markov Model (2002)
Geoff West, Hung H. Bui, Hung H. Bui, Svetha Venkatesh, Svetha Venkatesh, ...
Layer-4 service differentiation and resource isolation (2002)
Haining Wang, Kang G. Shin, Real-time Computing, Computer Science
Constructing precise object relation diagrams (2002)
Ana Milanova, Atanas Rountev, Computer Science
Abstract The Object Relation Diagram (ORD) of a program is aclass interdependence diagram which has applications in a wide variety of software engineering problems (e.g., in-tegration testing,...
Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems (2002)
Barry G. Lawson, Computer Science
1 Introduction The ubiquity of parallel systems, from clusters ofworkstations to large-scale supercomputers interconnected via the Internet, makes parallel resourceseasily available to researchers...
Matthew O Ward, Matthew O Ward, Computer Science
taxonomy of glyph placement strategies for
An Investigation of the Unified Parallel C Memory Consistency Model (2002)
Yongsheng Huang, Science In, Computer Science
The Uni ed Parallel C (UPC) language is a parallel extension to the standard ANSI C language with support for the distributed shared memory (DSM) abstraction. The memory consistency model speci es...
Novelty and redundancy detection in adaptive filtering (2002)
Yi Zhang, Jamie Callanschool, Computer Science
ABSTRACT This paper addresses the problem of extending an adaptive information filtering system to make decisions about the novelty and redundancy of relevant documents. It argues that relevance and...
Programming Methodology Group (2001)
Luigia Petre, Turku Centre For, Turku Centre For, Luigia Petre, Turku Centre, Computer Science
The mobile ambients and the P-systems are models developed in di erent areas of computer science, based on very similar concepts and structures. Given their resemblance, we point out how to transfer...
A Hierarchical Slice-Based Framework for ObjectOriented Coupling Measurement (2001)
Turku Centre For, Bixin Li, Bixin Li, Turku Centre, Computer Science
There is great interest in use of the object-oriented approach tosoftware engineering. This is due to a variety of claims about how itmay improve the development ofsoftware, including such factors as...
Multiplayer Computer Games, Jouni Smed, Timo Kaukoranta, Harri Hakonen, Telecom R, ...
Networking forms an essential part of multiplayer computer games. In this paper, we review the techniques developed for improving networking in distributed interactive real-time applications. We...
Dynamic Cache Partitioning for Simultaneous Multithreading Systems (2001)
G. Edward Suh, Larry Rudolph, Srinivas Devadaslaboratory, Computer Science
ABSTRACTThis paper proposes a dynamic cache partitioning method for simultaneous multithreading systems. We present ageneral partitioning scheme that can be applied to setassociative caches at any...
Modal logic and the two-variable fragment (2001)
Carsten Lutz, Ulrike Sattler, Frank Wolter, Lufg Theoretical, Computer Science, Rwth Aachen
Abstract. We introduce a modal language L which is obtained from standard modal logic by adding the Boolean operators on accessibility relations, the identity relation, and the converse of relations....
Lock-free scheduling of logical processes in parallel simulation (2001)
Jason Liu, David M. Nicol, Computer Science
1.
Precise call graph construction in the presence of function pointers (2001)
Ana Milanova, Atanas Rountev, Computer Science
In languages like C, the use of pointers creates seriousproblems for software productivity tools that use some form of semantic code analysis for the purposes of software un-derstanding,...
Bradley Broom, Rob Fowler, Computer Science
Abstract To ameliorate the need to spend significant program-mer time modifying parallel programs to achieve highperformance, while maintaining compact, comprehensiblesource codes, this paper...
Abhishek Ch, Micah Adler, Computer Science
A key character*This research was supported in part by a NSF Career award CCR9984030, NSF grants ANI 9977635, CDA-9502639, EIA-0080119, Intel,IBM, EMC, Sprint, and the University of Massachusetts.
Dynamic Cache Partitioning for Simultaneous Multithreading Systems (2001)
G. Edward Suh, Larry Rudolph, Srinivas Devadaslaboratory, Computer Science
ABSTRACTThis paper proposes a dynamic cache partitioning method for simultaneous multithreading systems. We present ageneral partitioning scheme that can be applied to setassociative caches at any...
Programming Methodology Group (2001)
Bixin Li, Xiaocong Fan, Turku Centre, Computer Science
Program slicing can be effectively used to debug, test, analyze, understand and maintain object-oriented software. In this paper, a new slicing model is proposed to slice Java programs based on their...
Establishing enterprise communities (2001)
Constantin Serban, Xuhui Ao, Computer Science
Abstract One of the most important challenges facing the buildersof enterprise software is the reliable implementation of the policies that are supposed to govern the various commu-nities operating...
SMAA-2: Stochastic multicriteria acceptability analysis for group decision making (2001)
Risto Lahdelma, Kaisa Miettinen, Pekka Salminen, Turku Centre, Computer Science
We consider multiple criteria decision-making problems where a group of decision-makers wants to find the most preferred solution from a discrete set of alternatives. We develop a method that uses...
Multiplayer Computer Games, Jouni Smed, Timo Kaukoranta, Harri Hakonen, Telecom R, ...
Networking forms an essential part of multiplayer computer games. In this paper, we review the techniques developed for improving networking in distributed interactive real-time applications. We...
A Hierarchical Slice-Based Framework for ObjectOriented Coupling Measurement (2001)
Turku Centre For, Bixin Li, Bixin Li, Turku Centre, Computer Science
There is great interest in use of the object-oriented approach to software engineering. This is due to a variety of claims about how it may improve the development of software, including such factors...
Families of Optimal Codes for (2001)
Turku Centre, Computer Science, Strong Identi Cation, Strong Identi Cation, Tero Laihonen, Tero Laihonen, ...
Codes for strong identication are considered. The motivation for these codes comes from locating faulty processors in a multiprocessor system. Constructions and lower bounds on these codes are given....
On splitting and cloning agents (2001)
Xiaocong Fan, Xiaocong Fan, Turku Centre, Computer Science
Embedded with cloning mechanisms, an agent can balance its own loads by discharging computing tasks to its clones when it is over-loaded. In addition, it's more reasonable to transfer the...
Watson-Crick D0L systems with regular triggers (2001)
Juha Honkala, Arto Salomaa, Turku Centre, Computer Science
Watson-Crick complementarity has been used as a basis for massive parallelism in DNA computing. Also its use in an operational sense has turned out to be very promising in the study of Watson-Crick...
On splitting and cloning agents (2001)
Xiaocong Fan, Xiaocong Fan, Turku Centre, Computer Science
Embedded with cloning mechanisms, an agent can balance its own loads by discharging computing tasks to its clones when it is over-loaded. In addition, it's more reasonable to transfer the...
Certified by........................................................................ (2001)
Erna Viterbi, Professor Electrical Engineering, Computer Science, Zulfikar Amin Ramzan
2 A Study of Luby-Rackoff Ciphers
Optimal Harvesting in the Presence of Density- Dependent Extinction Probabilities (2001)
Mats Gyllenberg, Mats Gyllenberg, Turku Centre, Computer Science
We consider the optimal harvesting strategy of a stochastically fluctuating population in the presence of a density-dependent extinction probability. We demonstrate that in contrast to ordinary...
Mixed initiative interfaces for learning tasks: Smartedit talks back (2001)
Steven A. Wolfman, Tessa Lau, Pedro Domingos, Computer Science
Machine learning (ML) is widely used in areas such as wrapper induction, credit approval, image analysis, data mining, and intelligent user interfaces. A learning module
Bosschere. alto: A Link-Time Optimizer for the Compaq Alpha (2001)
Robert Muth, Saumya Debray, Computer Science, Koen De, Bosscherevakgroep Elektronica Informatiesystemen
Abstract Traditional optimizing compilers are limited in the scope of their optimizations by the fact that only a singlefunction, or possibly a single module, is available for analysis and...
Computer Science, South Africa
[Bloom 56] Taxonomy of educational objectives: The classification of educational
Testing the Efficiency of Pairwise Comparison Methods in Discrete Multiple Criteria Problems (2000)
Risto Lahdelma, Pekka Salminen, Markku Kuula, Turku Centre, Computer Science
We test the efficiency of two pairwise comparison methods. The methods studied are Salminen’s piecewise linear prospect theory (PLP) method and the convex cone method by Korhonen, Wallenius, and...
� Developed a Client-Centric Approach for Media Streaming in Centralized Server Environments (2000)
Objective To seek a summer intern in your company where I can fully utilize and expand my software development skills.
Mobile Components as Topological Action Systems (2000)
Luigia Petre, Marina Walden, Luigia Petre, Marina Walden, Turku Centre, Computer Science
Component-based software engineering means assembling software systems from existing, service-providing components. The increased exibility and reliability of the component-based systems are among...
Luigia Petre, Luigia Petre, Turku Centre, Computer Science
Component-based software engineering means constructing new systems from already existing, service-providing components. Object-based software engineering means constructing a new system in terms of...
Mining Weighted Association Rules for Fuzzy Quantitative Items (2000)
Turku Centre For, Attila Gyenesei, Attila Gyenesei, Turku Centre, Computer Science
During the last ten years, data mining, also known as knowledge discovery in databases, has established its position as a prominent and important research area. Mining association rules is one of the...
Results concerning E0L and C0L power series (2000)
Juha Honkala, Turku Centre, Computer Science
By a classical result of Ehrenfeucht and Rozenberg the families of E0L and C0L languages are equal. We generalize this result for E0L and C0L power series satisfying the "-condition which...
Composition sequences for functions over a finite domain (2000)
Arto Salomaa, Turku Centre, Computer Science
Diverse problems ranging from many-valued logics to finite automata can be expressed as questions concerning compositions of functions over a finite domain. We develop a theory dealing with the depth...
Uniformly scattered factors (2000)
Lucian Ilie, Ion Petre, Grzegorz Rozenberg, Turku Centre, Computer Science
A word u appears as a factor of another word v as it is; in one piece. When u is a subword of v, u may be scattered as several factors. We consider the in-between case and put some restrictions on...
Checking Compositions of UML Sequence Diagrams for Timing Inconsistency (2000)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
For real-time systems, UML sequence diagrams describe interaction among objects, which show the scenarios of system behaviour. A simple UML sequence diagram describes exactly one scenario. For...
Compositions over a finite domain: from completeness to synchronizable automata (2000)
Arto Salomaa, Turku Centre, Computer Science
We will consider functions whose domain is a fixed finite set N with n elements, n 2; and whose range is included in N. Such a setup occurs in many and very diverse situations. Depending on the...
Enforcing behavior with contracts (2000)
Ralph-johan Back, Turku Centre, Computer Science
Contracts have been introduced earlier as a way of modeling a collection of agents that work within the limits set by the contract. We have analyzed the question of when an agent or a coalition of...
On the centralizer of a finite set (2000)
Juhani Karhumaki, Juhani Karhumaki, Ion Petre, Ion Petre, Turku Centre, Turku Centre, ...
We prove two results on commutation of languages. First, we show that the maximal language commuting with a three element language, i.e. its centralizer, is rational, thus giving an affirmative...
On semilinearity in formal power series (2000)
Ion Petre, Turku Centre, Computer Science
A notion of semilinearity is introduced for formal power series as a natural generalization of the semilinear sets over a commutative monoid. We prove that the results known for semilinear sets are,...
Towards a Building Methodology for Software Agents (2000)
Turku Centre For, Xiaocong Fan, Xiaocong Fan, Turku Centre, Computer Science
The importance of agent-oriented methodology can't be more emphasized, and is becoming the most promising research area in agent eld. In this paper, we propose a component-role-agent model,...
Piecewise directable automata (2000)
Turku Centre For, Magnus Steinby, Magnus Steinby, Turku Centre, Computer Science
In this paper a strong form of directability of automata is introduced and studied. A word w is called piecewise directing if any input word containing w as a piecewise subword takes the automaton to...
On formal power series generated by Lindenmayer systems (2000)
Juha Honkala, Turku Centre, Computer Science
To study power series generated by Lindenmayer systems we define L algebraic systems and series over arbitrary commutative semirings. We establish closure and fixed point properties of L algebraic...
Verification and refinement of action contracts (2000)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
Action contracts are a formalism for describing an interactive system as a game between two coalitions of agents. A basic contract statement, involving choice points for the different agents, is...
Turku Centre For, Luigia Petre, Luigia Petre, Turku Centre, Computer Science
Component-based software engineering means constructing new systems from already existing, service-providing components. Object-based software engineering means constructing a new system in terms of...
Generalizing Action Systems to Hybrid Systems (2000)
Ralph-Johan Back, Luigia Petre, Ivan Porres, Turku Centre, Computer Science
Action systems have been used successfully to describe discrete systems, i.e. systems with discrete control acting upon a discrete state space. In this paper we define continuous action systems,...
Computer Science, Gene Golub, Paul Van Dooren
. In this paper we derive a new algorithm for constructing a unitary decomposition of a sequence of matrices in product or quotient form. The unitary decomposition requires only unitary left and...
Martin Büchi, Wolfgang Weck, Turku Centre, Computer Science
Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, possibly by end users at run...
Implications of proxy caching for provisioning networks and servers (2000)
Mohammad S. Raunak, Prashant Shenoy, Pawan Goyalz, Computer Science
Abstract In this paper, we examine the potential benefits of web proxy caches in improving the effective capacity ofservers and networks. Since networks and servers are typically provisioned based on...
T.: Spatio-Temporal Databases: Contentions, Components and Consolidation (2000)
Norman W. Paton, Computer Science
This section presents a number of contentions relating toresearch in spatio-temporal databases. By definition, not everyone will agree with all of these, but it is important that aresearch community...
Data replication strategies for fault tolerance and availability on commodity clusters (2000)
Cristiana Amza, Alan L. Cox, Computer Science
We address the problem of building a reliable transac-tion server using a cluster of commodity computers, i.e., standard servers and system area networks (SAN). We usethe Vista system as the...
Adding Mobility to Non-mobile Web Robots (2000)
Nils P. Sudmann, Computer Science
Abstract In this paper we will show that it is possible to combinemobile agent technology with existing non-mobile data mining applications. The motivation for this is the advantagemobile agents...
Fully reflexive intensional type analysis (2000)
Bratin Saha, Valery Trifonov, Computer Science
Abstract Compilers for polymorphic languages can use runtime type in-spection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and...
Building and Managing an Electronic Commerce System- (2000)
Jussi Puhakainen, Turku Centre, Computer Science
PC-SuperStore is a leading Finnish computer and equipment retailer. They are also one of the Finnish pioneers using Internet-technology. This article describes an electronic commerce system and its...
Cooperative Computing with Fragmentable and Mergeable Groups (2000)
Chryssis Georgiou, Computer Science
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P ≤ N). The processors use a group communication service (GCS) to...
Timing analysis of UML sequence diagrams (1999)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
For real-time systems, UML sequence diagrams describe interaction among objects, which show the scenarios of system behaviour. In this paper, we give the solution for timing analysis of simple UML...
H.: Linear Hybrid Action Systems (1999)
Mauno Ronkko, Ong Li, Lemminkaisenkatu A, Turku Centre, Turku Centre, Computer Science, ...
Action Systems is a predicate transformer based formalism for the development of reactive and distributed systems. Recently, Action Systems were extended with a new action called the di erential...
Coordination Among Mobile Objects (1999)
Luigia Petre, Kaisa Sere, Turku Centre, Computer Science
When designing distributed object-based systems one is often faced with the problem of modeling the movement of objects from site to site in a distributed network. In order to model such an activity,...
Developing object-based distributed system (1999)
Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an object-oriented system with active objects. In this paper we make the...
Checking Time Petri Nets for Linear Duration Properties (1999)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
In this paper, we consider the problem of checking time Petri nets for linear duration properties, which are linear inequalities on integrated durations of system states. By showing that a time Petri...
Functional procedures in higher-order logic (1999)
Linas Laibinis, Linas Laibinis, Joakim Von Wright, Joakim Von Wright, Turku Centre, ...
In this paper we present an approach for modelling functional procedures (as they occur in imperative programming languages) in a weakest precondition framework. Functional procedures are modelled in...
Specifying Safety-Related Hazards Formally (1999)
Elena Troubitsyna, Turku Centre, Computer Science
We show how safety analysis can guide the formal development of controlling software of a safety-critical system. The system is specified in action system framework. The framework is based on a firm...
TUCS Veri cation of Linear Hybrid Action Systems (1999)
Mauno Ronkko, Xuandong Li, Current Address, Turku Centre, Computer Science
Action Systems is a predicate transformer based formalism for the development of reactive and distributed systems by re nement. Lately, Action Systems was extended with a di erential action that...
Ensuring Correctness of Java Frameworks: A Formal Look at JCF (1999)
Anna Mikhajlova, Emil Sekerinski, Turku Centre, Computer Science
In this paper we propose a novel approach to speci cation, development, and veri cation of object-oriented frameworks employing separate interface inheritance and implementation inheritance...
Elena Troubitsyna, Turku Centre, Computer Science
The paper presents an extension of the action system formalism to reason about probabilistic systems which can be implemented in a parallel or distributed manner. We focus on modelling safety issues...
Timing Analysis of Message Sequence Charts (1999)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
Message sequence chart (MSC) is a graphical and textual language for the description and speci cation of the interactions between system components. The MSC standard as de ned by ITU-T in...
Abo Akademi University, (1999)
Luigia Petre, Milla Qvist, Kaisa Sere, Turku Centre, Computer Science
ISBN 952-12-0387-0
An Interactive Metatool for Exploring Program Algebras (1999)
Joakim Von Wright, Turku Centre, Computer Science
We describe how anexisting tool is extended to allow exploratory reasoning in program algebras with theorem proving support. The existing tool (Tk-WinHOL and the Re nement Calculator) provides a...
Distributed service composition (1999)
Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
In this paper we explore the use of action systems for distributed service composition. Distributed systems can be composed out of a basic computation and a set of services. Even though this way of...
Approximate retrieval from multimedia databases using relevance feedback (1999)
Ana Lelescu, Ouri Wolfson, Electrical Engineering, Computer Science
Software Architectures for Coordinated Distributed Systems (1999)
Joost N. Kok, Milla Qvist, Kaisa Sere, Turku Centre, Computer Science
We present a component-based formal approach to the design of distributed systems focusing on so called coordination languages. This is a class of architectural description languages that provides a...
TUCS The Greybox Approach: When Blackbox Specifications Hide Too Much (1999)
Martin Büchi, Wolfgang Weck, Oberon Microsystems Ag, Turku Centre, Computer Science
Development of different parts of large software systems by separate teams, replacement of individual software parts during maintenance without changing other parts, and marketing of independently...
Enhancing Dependability via Parameterized Re nement (1999)
Elena Troubitsyna, Turku Centre, Computer Science
A probabilistic extension of the re nement calculus has been successfully applied in the design of safety-critical systems. The approach is based on a rm mathematical foundation within which the...
Sewing contexts and mildly context--sensitive languages (1999)
Carlos Martin-vide, Alexandru Mateescu, Arto Salomaa, Turku Centre, Computer Science
Sewing grammars introduced below are very simple grammars, still able to define families of mildly context-sensitive languages. These grammars are inspired from Marcus contextual grammars and simple...
On algebraicness of D0L power series (1999)
Juha Honkala, Turku Centre, Computer Science
We study D0L power series. We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and...
Timing analysis of UML sequence diagrams (1999)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
For real-time systems, UML sequence diagrams describe interaction among objects, which show the scenarios of system behaviour. In this paper, we give the solution for timing analysis of simple UML...
Encoding, decoding, and data refinement (1999)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
Data refinement is the systematic replacement of a data structure with another one in program development. Data refinement between program statements can on an abstract level be described as a...
Distributed service composition (1999)
Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
In this paper we explore the use of action systems for distributed service composition. Distributed systems can be composed out of a basic computation and a set of services. Even though this way of...
Undecidability in integer weighted finite automata (1999)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
It is shown that the universe problem L(A fl) = A is undecidable for 4-state nite automata A with integer weights such that the weights of the paths are unimodal. The language L(A fl) is dened as the...
The Parikh's Theorem Does Not Hold for Multiplicities (1999)
Ion Petre, Turku Centre, Computer Science
We consider the question of whether the famous Parikh's theorem holds with multiplicities i.e., for formal power series instead of languages. We introduce two families of semilinear formal power...
Contracts as mathematical entities in programming logic (1999)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We consider the notion of a contract that governs the behavior of a collection of agents. In particular, we study the question of whether a coalition among these agents can achieve a given goal by...
Specifying Safety-Related Hazards Formally (1999)
Elena Troubitsyna, Turku Centre, Computer Science
We show how safety analysis can guide the formal development of controlling software of a safety-critical system. The system is specified in action system framework. The framework is based on a firm...
Distributed Object-Based Control Systems (1999)
Luigia Petre, Milla Qvist, Kaisa Sere, Turku Centre, Computer Science
We show how to specify distributed control systems within the object-based OO-action systems framework by combining informal and formal specification methods in a novel way. UML diagrams serve partly...
Elena Troubitsyna, Turku Centre, Computer Science
The paper presents an extension of the action system formalism to reason about probabilistic systems which can be implemented in a parallel or distributed manner. We focus on modelling safety issues...
Hazard Analysis in Formal Specification (1999)
Kaisa Sere, Elena Troubitsyna, Turku Centre, Computer Science
Action systems have proven their worth in the design of safety-critical systems. The approach is based on a firm mathematical foundation within which the reasoning about the correctness and behaviour...
Enhancing Dependability via Parameterized refinement (1999)
Elena Troubitsyna, Turku Centre, Computer Science
A probabilistic extension of the refinement calculus has been successfully applied in the design of safety-critical systems. The approach is based on a firm mathematical foundation within which the...
On algebraicness of D0L power series (1999)
Juha Honkala, Turku Centre, Computer Science
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebraic in case A = Q + or A = N. The proof relies heavily on the use of elementary morphisms in a power...
Structured derivations: A method for doing highschool mathematics carefully (1999)
Ralph-johan Back, Turku Centre, Computer Science
We show how solutions to typical problems of High School and first-year University Mathematics can be written using structured derivations. Such a derivation extends the calculational proof format...
Undecidability of the equivalence of finite substitutions on regular language (1999)
Vesa Halava, Tero Harju, Turku Centre, Computer Science
A simplied proof is given for the following result due to L. Lisovik: It is undecidable for two given "free nite substitutions, whether they are equivalent on the regular language bf0; 1g
Satisfiability of word equations is (1999)
Lucian Ilie, Wojciech Plandowski, Turku Centre, Computer Science
We consider languages expressed by word equations in two variables and give a complete characterization for their complexity functions, that is, the functions that give the number of words of the...
On the Power of Membrane Computing (1999)
Jurgen Dassow, Gheorghe Paun, Turku Centre, Computer Science
We continue the investigation of the power of the computability models introduced in [10] under the name of transition super-cell systems. We compare these systems with classic mechanisms in formal...
Seppo Virtanen, Turku Centre, Computer Science
This report discusses the main functional characteristics of important communications protocols as well as current protocol processing products and research directions in order to determine whether...
Seppo Virtanen Gih, Turku Centre, Computer Science
this report can also be seen in
Structured Derivations: a Method for Doing High-School Mathematics Carefully (1999)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We show how solutions to typical problems of High School and #rst-year University Mathematics can be written using structured derivations. Such a derivation extends the calculational proof format...
Timing Analysis of Message Sequence Charts (1999)
Xuandong Li, Johan Lilius, Turku Centre, Computer Science
Message sequence chart (MSC) is a graphical and textual language for the description and specification of the interactions between system components. The MSC standard as defined by ITU-T in...
Virtual Notes: Annotations on the WWW for Learning Environments (1999)
Andreas Geyer-schulz, Stefan Koch, Georg Schneider, Computer Science
This paper describes Virtual Notes, small yellow stickers which can be freely placed on instrumented HTML-pages using standard Internet technology. In a teaching and research environment they provide...
Software Architectures for Coordinated Distributed Systems (1999)
Joost N. Kok, Milla Qvist, Kaisa Sere, Turku Centre, Computer Science
We present a component-based formal approach to the design of distributed systems focusing on so called coordination languages. This is a class of architectural description languages that provides a...
Digital Sound Recorder: A case study on designing embedded systems using the UML notation. (1999)
Ivan Porres, Ivan Porres Paltor, Johan Lilius, Turku Centre, Computer Science
This document is an example of the object-oriented analysis and design of an embedded system using the Unified Modelling Language (UML). The analysed system is a digital sound recorder, or...
vUML: a Tool for Verifying UML Models (1999)
Johan Lilius, Ivan Porres, Ivan Porres Paltor, Turku Centre, Computer Science
The Unified Modelling Language (UML) is a standardised notation for describing object-oriented software designs. We present vUML, a tool that automatically verifies UML models. vUML verifies models...
The Semantics of UML State Machines (1999)
Johan Lilius, Ivan Porres, Ivn Porres Paltor, Turku Centre, Computer Science
The paper discusses a complete formalisation of UML state machine semantics. This formalisation is given in terms of an operational semantics and it can be used as the basis for code generation,...
Analysis and Design For a Next Generation Software Release Management System (1999)
Robert Arthur Smith, Computer Science
</Label></Attribute> Figure 7.19 Sample Schema Definition for a Document Repository. As can be seen, the schema definition in Figure 7.19 is very similar to the schema definition of...
Refining Concurrent Objects (1999)
Martin Büchi, Emil Sekerinski, Turku Centre, Computer Science
We study the notion of class refinement in a concurrent object-oriented setting. Classes, defining attributes and methods, serve as templates for creating objects. For expressing concurrency, actions...
Developing Object-based Distributed Systems (1999)
Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an object-oriented system with active objects. In this paper we make the...
Mobile Ambients and P-Systems (1999)
Ion Petre, Luigia Petre, Turku Centre, Turku Centre, Computer Science, Computer Science
The mobile ambients and the P-systems are models developed in different areas of computer science, based on very similar concepts and structures. Given their resemblance, we point out how to transfer...
A Practical One-Semester "VLSI Design" Course for Computer Science (and Other) Majors (1999)
Computer Science, Other Majors, Robert A. Walker
This paper describes the development and content of a "VLSI Design" course. We had two main goals for the course: to develop a one-semester course for computer science (and other) majors,...
Functional Procedures in Higher-Order Logic (1999)
Linas Laibinis, Joakim Von Wright, Turku Centre, Computer Science
In this paper we present an approach for modelling functional procedures (as they occur in imperative programming languages) in a weakest precondition framework. Functional procedures are modelled in...
Distributed Object-Based Control Systems (1999)
Luigia Petre, Milla Qvist, Kaisa Sere, Turku Centre, Computer Science
We show how to specify distributed control systems within the object-based OO-action systems framework by combining informal and formal specification methods in a novel way. UML diagrams serve partly...
Perspectives on and Prospects for Software Agent Systems (1999)
Shuhua Liu, Åbo Akademi, Turku Centre, Computer Science
In this paper we propose a framework for analyzing the impacts of software agent system. The framework is applied to examine the impacts of an agentbased scanning and interpretation system on...
A. Brakensiek, A. Kosmala, D. Willett, W. Wang, G. Rigolldept, Computer Science, ...
During recent years, Hidden Markov Models (HMMs,see [4, 5]) have emerged as one of the most popular
Developing components in the presence of re-entrance (1999)
Leonid Mikhajlov, Emil Sekerinski, Linas Laibinis, Turku Centre, Computer Science
Independent development of components according to their speci cations is complicated by the fact that a thread of control can exit and re-enter the same component. This kind of re-entrance may cause...
Direct queries for discovering network resource properties in a distributed environment (1999)
Bruce Lowekamp, Thomas Grossschool, Computer Science
Abstract The development and performance of network-aware applications depends on the availabil-ity of accurate predictions of network resource properties. Obtaining this information directly from...
Greedy importance sampling (1999)
Finnegan Southey, Dale Schuurmans, Ali Ghodsischool, Computer Science
Abstract Greedy importance sampling is an unbiased estimation technique that re-duces the variance of standard importance sampling by explicitly searching for modes in the estimation objective....
Synchronous Action Systems (1998)
Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework supporting formal circuit derivations has been successfully applied to synchronous VLSI design. The present paper presents a C++ application that translates descriptions...
Proving Isomorphism of First-Order Logic Proof Systems in HOL (1998)
Anna Mikhajlova, Turku Centre, Computer Science
We prove in HOL that three proof systems for classical rst-order predicate logic, the Hilbertian axiomatization, the system of natural deduction, and a variant of sequent calculus, are isomorphic....
An approach to objectorientation in action systems (1998)
Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
We extend the action system formalism with a notion of objects that can be active and distributed. With this extension we can model class-based systems as action systems. Moreover, as the introduced...
Synchronous Action Systems (1998)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework has recently been applied to the area of synchronous VLSI design. Synchronous action systems explicitly model synchronous twophase behavior, making a formal description...
Switches and Jumps in Hybrid Action Systems (1998)
Mauno Ronkko, Anders P. Ravn, Turku Centre, Computer Science
Hybrid action systems extend a conventional action system with a guarded di erential equation | a di erential action | that de nes evolution of continuous variables while the guard remains true. The...
Annabelle Mciver, Carroll Morgan, Elena Troubitsyna, Turku Centre, Computer Science
The probabilistic steam boiler:
Action Systems Synthesis of DI Circuits (1998)
Juha Plosila, Kaisa Sere, Turku Centre, Computer Science
A sub-class of action systems has recently been shown to model the behaviour of asynchronous delay-insensitive circuits. Hence, the action systems formalism can be used to design such circuits. The...
Abo Akademi University, (1998)
Mauno Ronkko, Turku Centre, Computer Science, Lemminkaisenkatu A, Kaisa Sere, Turku Centre, ...
Re nement Calculus is a formal framework for the development ofprovably correct software. It is also used in the development of Action Systems, which is a predicate transformer based framework for...
Java needs compound types (1998)
Martin Büchi, Wolfgang Weck, Turku Centre, Computer Science
We propose to extend the Java type system with a new construction: compound types, compositions of a class and any number of interfaces. Java users will benefit from the type system’s increased...
Pattern Systems and Methodologies for Multiparadigm Analysis and Design (1998)
Charles D. Knutson, Doctor Philosophy, Computer Science, Curtis R. Cook, Charles D. Knutson
Abstract approved: ______________________________________________________
DOGMA: A GA-based relational learner (1998)
Jukka Hekanaho, Turku Centre, Computer Science
We describe a GA-based concept learning/theory revision system DOGMA and discuss how it can be applied to relational learning. The search for better theories in DOGMA is guided by anovel tness...
Synchronous Action Systems (1998)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework has recently been applied to the area of asynchronous VLSI design. In this paper, we present a set of concepts necessary in the formal modeling of synchronous hardware,...
An approach to objectorientation in action systems (1998)
Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science
We extend the action system formalism with a notion of objects that can be active and distributed. With this extension we can model class-based systems as action systems. Moreover, as the introduced...
Packaging of IT services (1998)
Petteri Nieminen, Timo Auer, Turku Centre, Computer Science
Information technology (IT) organizations provide their customers professional services. In many cases, the business units (i.e. internal customers) and IT organizations do not have the same world...
Decision problems concerning thinness and slenderness of formal languages (1998)
Juha Honkala, Turku Centre, Computer Science
A language L is called thin if for almost all n there is at most one word of length n in L. A language L is called slender if there is a positive integer k such that for any n there are at most k...
Iterated GSM Mappings: A Collapsing Hierarchy (1998)
Vincenzo Manca, Carlos Mart, Gheorghe Paun, Turku Centre, Computer Science
With motivations from various areas (Lindenmayer systems, iterated reading of literary works, self-generated infinite sequences, "computing by carving " as suggested in the DNA...
Contexts on Trajectories (1998)
Carlos Martin-vide, Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa, Turku Centre, Computer Science
We introduce and investigate a new way of generating mildly context-sensitive languages. The main idea is that the contexts are adjoined by shuffling them on certain trajectories. In this way we...
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We study program states that are described as tuples, i.e., product state spaces. Modeling programs as predicate transformers, we define a product operator on program statements that describes the...
Synchronous Action Systems (1998)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework has recently been applied to the area of asynchronous VLSI design. In this paper, we present a set of concepts necessary in the formal modeling of synchronous hardware,...
Synchronous Action Systems (1998)
Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework supporting formal circuit derivations has been successfully applied to synchronous VLSI design. The present paper presents a C++ application that translates descriptions...
On the decomposition of finite languages (1998)
Alexandru Mateescu, Arto Salomaa, Sheng Yu, Turku Centre, Computer Science
Representations of finite languages as a product (catenation) of languages are investigated, where the factor languages are "prime", that is, cannot be decomposed further in a...
Gheorghe Paun, Turku Centre, Computer Science
A colony is meant to be a symbol manipulating system consisting of as simple as possible components which behave in a cooperative way such that the collective competence is stricty larger than the...
Quantum Error Correction (1998)
Mika Hirvensalo, Turku Centre, Computer Science
An introduction to formalism of quantum computation and to the theory of quantum error-correcting codes is presented. Error-correction schemes due to Shor and Calderbank are also represented.
Action Systems Synthesis of DI Circuits (1998)
Juha Plosila, Rimvydas Ruks Enas, Kaisa Sere, Turku Centre, Computer Science
A sub-class of action systems has recently been shown to model the behaviour of asynchronous delay-insensitive circuits. Hence, the action systems formalism can be used to design such circuits. The...
Synchronous Action Systems (1998)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
The action systems framework has recently been applied to the area of synchronous VLSI design. Synchronous action systems explicitly model synchronous twophase behavior, making a formal description...
Finite substitutions and integer weighted finite automata (1998)
Vesa Halava, Turku Centre, Computer Science
In this work we present a new chain of undecidability reductions, which begins from the classical halting problem of Turing machines and ends to the undecidability proof of the equivalence problem...
Computing with Membranes (1998)
Gheorghe Paun, Turku Centre, Computer Science
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several cell-like membranes, recurrently placed...
Computer Science, Charles A. Cusack, Charles A. Cusack, Adviser Spyros Magliveras
learned many things in the last several years that have helped me in several areas of this thesis. Along with the faculty, I would like to thank the o#ce sta # who do much in the department that is...
Decidability and Undecidability of Marked PCP (1998)
Vesa Halava, Th Aeoor, Mika Hirvensalo, Turku Centre, Computer Science, Ronald De Wolf
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to dioeer in the rst letter, is decidable. On the other hand, if we only require the words...
Modeling Component Environments and Interactive Programs Using Iterative Choice (1998)
Ralph Back, Anna Mikhajlova, Joakim Von Wright, Turku Centre, Computer Science
The unifying ground for component-based systems and interactive programs is the interaction between the user and the system or between a component and its environment. Modeling both kinds of systems...
Java Needs Compound Types (1998)
Martin Büchi, Martin B Uchi, Wolfgang Weck, Turku Centre, Computer Science
We propose to extend the Java type system with a new construction: compound types, compositions of a class and any number of interfaces. Java users will benefit from the type system's increased...
Watson-Crick Walks and Roads on DOL Graphs (1998)
Arto Salomaa, Turku Centre, Computer Science
Apart from the massive parallelism of DNA strands, the phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. The parallelism makes exhaustive...
On the Least Asymmetric Wavelets (1998)
Milos Doroslovacki, Computer Science
The asymmetry of Daubechies' scaling functions and wavelets can be diminished by minimizing a special second moment in time for the wavelet generating discrete-time filter. The moment is...
PACKRAT: A Software Reengineering Case Study (1998)
Gerald C. Gannod, Gora Sudindranath, Mark E. Fagnani, Computer Science
Reengineering is the process of examination, understanding, and alteration of a system with the intent of implementing the system in a new form. Many approaches for design recovery or reverse...
Intelligent Processing, Storage and Visualisation of Dictionary Information (1998)
this paper is that if regular speaking is 120 words/minute, then a million words corresponds to just two weeks of normal exposure to the language. Another indication of word familiarity discussed is...
: In the last few years, many researchers have begun to study how to introduce hierarchy into reinforcement learning methods. Generally, this work has pushed the envelope in one of several important...
Packaging of IT services (1998)
Petteri Nieminen, Timo Auer, Turku Centre, Computer Science
Information technology (IT) organizations provide their customers professional services. In many cases, the business units (i.e. internal customers) and IT organizations do not have the same world...
Coordinating Action Systems (1998)
Eric Hedman, Joost Kok, Kaisa Sere, Turku Centre, Computer Science
We develop an action systems based approach that supports the separation of design of the functional or computation aspects of a system under construction from the coordination and synchronisation...
BIT: Bytecode instrumenting tool (1997)
Han Bok Lee, Han Bok Lee, Benjamin Zorn, Computer Science
by
Di erential Equations as Actions (1997)
M. Ronkko, A. P. Ravn, Turku Centre, Computer Science
Di erential equations are used in control theory to describe a system and its behaviour. They de ne explicitly the relationships between continuous variables during the evolution of the system. In...
GA-based rule enhancement in concept learning (1997)
Jukka Hekanaho, Turku Centre, Computer Science
We describe an application of DOGMA, a GA-based theory revision system, to MDL-based rule enhancement in supervised concept learning. The system takes as input classi cation data and a rule-based...
Action Systems with Continuous (1997)
Mauno Ronkko, Anders P. Ravn, Turku Centre, Computer Science
An action system framework is a predicate transformer based method for modelling and analysing distributed and reactive systems. The actions are statements in Dijkstra's guarded command...
An Asynchronous Linear Predictive Analyzer (1997)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
Linear predictive analysis is a standard technique in modern digital speech processing. This makes it an interesting implementation area for asynchronous design. We present an asynchronous...
Layering Distributed Algorithms (1997)
M. Walden, Turku Centre, Computer Science
Superposition isapowerful program modularization and structuring method for developing parallel and distributed systems by adding new functionality toan algorithm while preserving the original...
Context handling in the renement calculus framework (1997)
Linas Laibinis, Joakim Von Wright, Turku Centre, Computer Science
We describe two approaches for context handling in the Re nement Calculus framework. They show how information relevant for total correctness can be transported from one place of a program to another...
Toward Feature Engineering of Software Systems (1997)
Carlton Reid Turner, Alexander L. Wolf, Ken Anderson, Computer Science, ...
The nal copy of this thesis has been examined by the signatories, and we nd that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned...
Leonid Mikhajlov, Turku Centre, Computer Science
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System developers unaware...
A Tool for Data Re nement (1997)
Turku Centre, Computer Science
We describe a tool for data re nement based on the Re nement Calculator. The tool supports the calculational approach to data re nement. As a consequence of the program calculation, a re nement...
Decision problems concerning a power series generalization of DT0L languages, Fund (1997)
Juha Honkala, Turku Centre, Computer Science
We study a power series generalization of DT0L systems with main interest on decidability questions.
On the computational complexity of Marcus contextual languages. Fundamenta Informaticae (1997)
Lucian Ilie, Turku Centre, Computer Science
We investigate the computational complexity of the basic type of contextual languages, that is, the ones introduced by Marcus in [M2] and called subsequently external contextual languages. Our main...
Doing high school mathematics carefully (1997)
Ralph-johan Back, Turku Centre, Computer Science
We show how solutions to typical problems of High School and first-year University mathematics can be written using structured derivations. Such a derivation extends the calculational proof format...
On lengths of words in context-free languages (1997)
Lucian Ilie, Turku Centre, Computer Science
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for...
The accepting power of finite automata over groups (1997)
Victor Mitrana, Ralf Stiebe, Turku Centre, Computer Science
Some results from [2], [5], [6] are generalized for finite automata over arbitrary groups. The accepting power is smaller when abelian groups are considered, in comparison with the non-abelian...
Refining reactive systems in HOL using action systems (1997)
Thomas Langbacka, Turku Centre, Computer Science
This report discusses how to refine reactive systems using the HOL theorem prover. We show how Action Systems-- the formal framework supported--can be formalised in HOL. We describe a simple...
Contextual grammars with distributed catenation and shuffle (1997)
Manfred Kudlek, Solomon Marcus, Alexandru Mateescu, Turku Centre, Computer Science
We introduce a new type of contextual grammars. Instead of considering the catenation operation we use the distributed catenation operation. The contexts are distributed catenated with words from the...
An Asynchronous Linear Predictive Analyzer (1997)
Juha Plosila, Tiberiu Seceleanu, Turku Centre, Computer Science
Linear predictive analysis is a standard technique in modern digital speech processing. This makes it an interesting implementation area for asynchronous design. We present an asynchronous...
Associative shuffle of infinite words (1997)
Alexandru Mateescu, George Daniel Mateescu, Turku Centre, Computer Science
Some shuffle-like operations on infinite (!-words) are investigated. The operations are introduced using a uniform method based on the notion of an!-trajectory. We prove an interconnection between...
Context handling in the refinement calculus framework (1997)
Linas Laibinis, Joakim Von Wright, Turku Centre, Computer Science
We describe two approaches for context handling in the Refinement Calculus framework. They show how information relevant for total correctness can be transported from one place of a program to...
Turing, Watson-Crick And Lindenmayer. Aspects Of DNA Complementarity (1997)
Arto Salomaa, Turku Centre, Computer Science
Watson-Crick complementarity is one of the very central components of DNA computing, the other central component being the massive parallelism of DNA strands. While the latter component drastically...
Juhani Karhumaki, Turku Finland, Wojciech Plandowski, Turku Centre, Computer Science
We study the Shallit's conjecture which states that an infinite word! is ultimately periodic if and only if lim n!1 inf ju n (!)j n
Contracts, Games and Refinement (1997)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We consider the notion of a contract that governs the behavior of a collection of agents. In particular, we study the question of whether a group among these agents can achieve a given goal by...
Bit: Bytecode Instrumenting Tool (1997)
Han Bok Lee, Han Bok Lee, Benjamin Zorn, Vincent Heuring, Computer Science
this paper, a customized tool that could aid in branch prediction is presented as in (Srivastava and Eustace, 1994). This tool counts the number of branches taken and not taken at all the branches in...
Programs on Product Spaces (1997)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We study program states that are described as tuples, i.e., product state spaces. We show how to add program variables and assignment notation to simply typed lambda calculus in order to describe...
A Plea for Grey-Box Components (1997)
Martin Uchi, Wolfgang Weck, Turku Centre, Computer Science
Interface Description Languages (IDLs) describe the syntactic part of a component 's interface, but they do not help to specify semantics. Additional informal descriptions or pre- and...
Reasoning Algebraically about Loops (1997)
Ralph-johan Back, Joakim Von Wright, Turku Centre, Computer Science
We show how to formalise different kinds of loop constructs within the refinement calculus, and how to use this formalisation to derive general transformation rules for loop constructs. The emphasis...
Formal Methods for Component Software: The Refinement Calculus Perspective (1997)
Martin Büchi, Martin B Uchi, Emil Sekerinski, Turku Centre, Computer Science
We exhibit the benefits of using formal methods for constructing and documenting component software. Formal specifications provide concise and complete descriptions of black-box components and,...
Design and Evaluation of Distributed Component-Oriented Software Systems (1997)
Michael Goedicke, Torsten Meyer, Turku Centre, Computer Science
With the emergence of the Object Management Group's CORBA (Common Object Request Broker Architecture) and comparable platforms heterogeneous and distributed computing is facilitated. Providing...