ppxscal/embedding_network huggingface dataset:
Mining Knowledge Rules from Databases: A Rough Set Approach
Authors: Xiaohua Hu, Nick Cercone
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In this paper, the principle and experimental results of an attribute-oriented rough set approach for knowledge discovery in databases are described. Our method integrates the database operation, rough set theory and machine learning techniques. In our method, we consider the learning procedure consists of two phases: data generalization and data reduction. In data generalization phase, the attribute-oriented induction is performed attribute by attribute using attribute removal and concept ascension, some undesirable attributes to the discovery task are removed and the primitive data is generalized to the desirable level, thus a set of tuples may be generalized to the same generalized tuple, this procedure substantially reduces the computational complexity of the database learning process. Subsequently, in data reduction phase, the rough set method is applied to the generalized relation to find a minimal attribute set relevant to the learning task. The generalized relation is reduced further by removing those attributes which are irrelevant and/or unimportant to the learning task. Finally the tuples in the reduced relation are transformed into different knowledge rules based on different knowledge discovery algorithms. Based upon these principles, a prototype knowledge discovery system DBROUGH has been constructed. In DBROUGH, a variety of knowledge discovery algorithms are incorporated and different kinds of knowledge rules, such as characteristic rules, classification rules, decisions rules, maximal generalized rules can be discovered efficiently and effectively from large databases.
Coordination of Collaborative Activities: A Framework for the Definition of Tasks Interdependencies
Authors: Alberto Barbosa Raposo, Léo Pini Magalhães, Ivan Luiz Marques Ricarte, Hugo Fuks
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: The coordination of interdependencies between tasks in collaborative environments is a very important and difficult endeavor. The separation between tasks and interdependencies allows for the use of different coordination policies in the same collaborative environment by changing only the coordination mechanisms that control the interdependencies. This paper presents a framework for the definition of interdependencies that frequently occur in collaborative activities. By means of a clear characterization of interdependencies, it is possible to identify coordination mechanisms to manage them, opening the way toward a powerful coordination tool capable of encompassing a wide range of collaborative applications. An implementation of the coordination model of a collaborative virtual environment based on the proposed framework is given as example.
Effective Management of Location Dependent Continuous Queries in Mobile Environment
Authors: Latifur Khan, Manish Gupta
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Advances in wireless and mobile computing environments allow a mobile user to perform within a wide range of applications. For example, mobile users need to pull data about unfamiliar places or local life styles related to their location. Furthermore, a mobile user may be interested in getting location dependent query results periodically. We propose an algorithm for handling continuous queries in a tree-structure in such a way that the user will get the correct current query result, not the outdated result. In addition our proposed method strives to reducecommunication cost. Since data are related to a particular zone, the obvious approach is to replicate fragments of location dependent data (LDD) for each zone. If we follow the approach of replicating fragments of LDD information at each zone, we may not be able to meet the storage requirements in given zones. Therefore, full replication will not work. Hence, we propose an selective replication algorithm in the context of these continuous queries. Our replication algorithm is based on the user's query pattern. If a particular type of query is frequently requested from a particular zone, we will replicate its corresponding LDD in that zone. We demonstrate that this selective replication strives to balance lookup cost and storage cost using a simulation experiment.
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
Authors: Juan Miguel Martínez, P. L. López, José Duato, Timothy Mark Pinkston
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of deadlock-free routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. In particular, progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked packets, instead of killing them. Deadlock recovery is based on the assumption that deadlocks are rare. Very recently, the frequency of deadlock occurrence was measured, showing that deadlocks are highly unlikely when enough routing freedom is provided. However, deadlocks are more prone when the network is close to or beyond saturation. Additionally, some performance degradation has been observed at saturation. Similar performance degradation behavior at saturation was also observed in networks using deadlock avoidance strategies. In this paper we take a different approach to handle deadlocks and performance degradation. We propose the use of an injection limitation mechanism that prevents performance degradation near the saturation point and reduces the probability of deadlock to negligible values even when fully adaptive routing is used. We also propose an improved deadlock detection mechanism that only uses local information, detects all the deadlocks, and considerably reduces the probability of false deadlock detection over previous proposals. In the rare case when impending deadlock is detected, our proposed recovery technique absorbs the deadlocked message at the current node and later re-injects it for continued routing towards its destination. Performance evaluation results show that our new approach to deadlock handling is more efficient than previously proposed techniques. Keywords: Wormhole switching, adaptive routing, deadlock recovery, deadlock detection, virtual channels.
On Cognitive Informatics
Authors: Yingxu Wang
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Information is the third essence in modeling the natural world. This paper attempts to explore an emerging discipline know as cognitive informatics. Cognitive Informatics is a profound interdisciplinary research area that tackles the common root problems of modern informatics, computation, software engineering, artificial intelligence (AI), neural psychology, and cognitive science.Cognitive informatics studies the internal information processing mechanisms and natural intelligence of the brain. This paper describes historical development of informatics from the classical information theory, contemporary informatics, to cognitive informatics. The domain of cognitive informatics and its interdisciplinary nature are explored. Foundations of cognitive informatics, particularly the brain vs. the mind, the acquired life functions vs. the inherited ones, and generic relationships between information, mater and energy are investigated. The potential engineering applications of cognitive informatics and perspectives on future research are discussed. It is expected that the investigation into cognitive informatics will result in fundamental findings towards the development of next generation IT and software technologies, such as neural computers, bioinformatics, quantum information processing, newsoftware development approaches, and new architectures of information systems.
Parallel Algorithms for Airline Crew Planning on Networks of Workstations
Authors: Christos Goumopoulos, Panayiotis Alefragis, Efthymios Housos
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication patterns. The parallelization of the successful sequential system of Carmen Systems AB guarantees that the results are immediately useful and applicable to a large number of airlines scheduling problems. The parallel pairing generator component of the crew scheduling process achieves a linear speedup on the number of processors and can be efficiently scaled to a large number of processors. The novel parallel optimizer approach of the paper also achieves almost linear speedups for large problems solved on a small number of workstations. The Lufthansa problems that were used in our experiments validate our theoretical results and prove the value and usefulness of our work.
Implementation and Results of Hypothesis Testing from the C3I Parallel Benchmark Suite
Authors: Brain Van Voorst, Luiz Pires, Rakesh Jha, Mustafa Muhammad
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper describes the implementation of the hypothesis testing benchmark, one of ten kernels from the C3I (Command, Control, Communications and Intelligence) Parallel Benchmark Suite (C/sup 3/IPBS)/sup 1/. The benchmark was implemented and executed on a variety of parallel environments. This paper details the run times obtained with these implementations, and offers an analysis of the results.
The Virtual Tea Room - Experiences with a New Type of Social Space
Authors: Renee Gedge, David Abramson
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: This paper focuses on technical, social and psychological aspects of the use of a video wall for communications between two geographically separated halves of a university department. The overall usability of the system is related to technological limitations such as video and audio quality, and aspects connected with organizational and interpersonal psychology. A video wall creates a new type of "social space", raising new social psychology issues, and requiring new types of interpersonal behaviour. Whilst it has some close parallels with standard desk top video conferencing, it also has some unique and important differences. This paper briefly summarizes those problems and discusses the issues that are shared with other electronic collaboration tools such as desktop video conferencing, followed by a discussion of those issues unique to the video wall. Ongoing trials are being conducted with alterations to audio and video quality, and an analysis is being performed of usage of and responses to the video wall.
Maintainability as a key factor in maintenance productivity: a case study
Authors: Manuel J. Barranco García, Juan Carlos Granja Alvarez
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Software quality is not an end in itself, but a step on the way to efficient software engineering. Maintainability is a quality factor whose effects will be seen in the maintenance stage. The investment to add maintainability to the software product must be justified with a benefit during this stage, that is to say, an improvement in maintenance productivity. Otherwise, this quality characteristic will not be a method for efficiency but an end in itself, ignoring the objective of software quality. We expose a case study where costs and benefits of maintainability have been analysed. As a consequence, we propose a technique to apply these quality characteristics in an efficient manner.
Characterizing the common prior assumption
Authors: Joseph Y. Halpern
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

Logical characterizations of the common prior assumption (CPA) are investigated. Two approaches are considered. The first is called <i>frame distinguishability</i>, and is similar in spirit to the approaches considered in the economics literature. Results similar to those obtained in the economics literature are proved here as well, namely, that we can distinguish finite spaces that satisfy the CPA from those that do not in terms of disagreements in expectation. However, it is shown that, for the language used here, no formulas can distinguish infinite spaces satisfying the CPA from those that do not. The second approach considered is that of finding a sound and complete axiomatization. Such an axiomatization is provided; again, the key axiom involves disagreements in expectation. The same axiom system is shown to be sound and complete both in the finite and the infinite case. Thus, the two approaches to characterizing the CPA behave quite differently in the case of infinite spaces.
Software Bubbles: Using Predication to Compensate for Aliasing in Software Pipelines
Authors: Benjamin Goldberg, Emily Crutcher, Chad Huneycutt, Krishna V. Palem
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

This paper describes a technique for utilizing predication to support software pipelining on EPIC architectures in the presence of dynamic memory aliasing. The essential idea is that the compiler generates an optimistic software-pipelined schedule that assumes there is no memory aliasing. The operations in the pipeline kernel are predicated, however, so that if memory aliasing is detected by a run-time check, the predicate registers are set to disable the iterationsthat are so tightly overlapped as to violate the memory dependences. We refer to these disabled kernel operations as software bubbles.
POM: a processor model for image processing
Authors: Jean-Paul Theis, Lothar Thiele
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

In this paper, we describe a new processor model called Periodic Operation Model (POM) that is suitable for real time image processing. First we analyze existing image processing systems in order to situate our approach. Starting from the processor architecture, we derive the corresponding algorithm class by means of a novel hardware description. Then we address the allocation and scheduling problem. We show that allocation and scheduling can be decoupled in the mapping process related to POM-processor arrays and outline the principles of an optimal mapping trajectory. We describe the outline of a novel ILP-model for allocation of POM-processor arrays which takes into account array-topology and bus bandwidth constraints. Finally we discuss implementational aspects of the POM as well as applications in image processing. We especially show that POM-processor arrays can be integrated onto single chips, thereby allowing to achieve several GOPS processing power per chip.
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
Authors: Shiwa S. Fu, Nian-Feng Tzeng, Zhiyuan Li
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of such criteria as the number of message exchanges and the response time. Our results indicate that the Star algorithm achieves the shortest response time in most cases among all the algorithms on a small to medium sized system, when processors request for the critical section many times before involving any barrier synchronization. On the other hand, if every processor enters the critical section only once before encountering a barrier, the improved Ring algorithm is found to outperform others under a heavy load; but the Star algorithm and the CSL algorithm prevail when the request rate becomes light. The best solution to mutual exclusion in distributed memory systems is determined by how participating sites generate their mutual exclusion requests.
Cluster Fault Tolerant Routing in Hypercubes
Authors: Qian-Ping Gu, Shietung Peng
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

We say a network (graph) can tolerate $l$ faulty nodes for a specific routing problem if after removing at most $l$ arbitrary nodes from the graph, the routing paths exist for the routing problem. However, the bound $l$ is usually a worst-case measure and it is interesting, both practical and theoretical, to find the routing paths when more than $l$ faulty nodes present. Cluster fault tolerant (CFT) routing has been proposed as an approach for this purpose. In CFT routing we try to reduce the number of ``faults'' that a routing problem has to deal with using subgraphs to cover the faulty nodes. In particular, we consider the number and the size (diameter) of faulty subgraphs rather than the number of faulty nodes that a graph can tolerate. We show the necessary and sufficient conditions on the number and the size of faulty subgraphs that the hypercube can tolerate for the following routing problems: find a path from a source node $s$ to a target node $t$; and find $k$ node-disjoint paths from $s$ to $k$ nodes $t_1,...,t_k$. Our results imply that the hypercube can tolerate far more faulty nodes than the worst-case measures for these routing problems when the faulty nodes can be covered by certain subgraphs. We also give algorithms for finding the routing paths for the above routing problems.
Mobile Learning and Mobility in Teacher Training
Authors: Pauliina Seppälä, Harri Alamäki
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This article describes the mobile learning project, where mobile device is used for educational activities. Article defines the word mobility from the educational point of view. The main perspective in this article is in teacher training. We present experiences how mobile technology was used in teacher training, how trainees and supervising teachers felt the use of mobile technology. The pilot was carried out on Department of Home Economics and Craft Science in University of Helsinki. The idea of pilot was that supervising teacher and trainee students discuss and share their ideas about teaching methods etc. through mobile device and also use SMS-messaging and digital pictures as a part of supervising process. The use of digital pictures which were delivered via mobile device came up to be surprisingly successful. The goal of these innovative pilot projects is to create flexible teaching solutions, which will enable the accessing of information with all kinds of devices, and to support learning in a variety of situations.
Regression Testing of GUI Event Interactions
Authors: Lee J. White
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Graphics User Interface (GUI) design is an expected part of almost every contemporary software or computer project, and yet the testing is usually approached in an ad hoc fashion. The reason GUI testing is different and difficult is that the input is interactive whereas the output may be graphical or may be an event. An especially serious problem occurs in maintenance where changes are made to the GUI interface, and the maintenance engineer does not have a sufficient understanding of how the GUI software was designed; in this case, an automated GUI testing method is needed. This paper identifies both static and dynamic event interactions in a GUI, and shows how automated regression tests can be generated to test these interactions. It is shown how Latin Squares can be used for this automated test design, where Latin Squares techniques are borrowed from statistical experimental design. Three methods will be compared: brute force test generation, random test generation and use of Latin Squares, comparing the number of tests required to cover specified GUI event interactions in each case.
Matrix Transpose on Meshes: Theory and Practice
Authors: Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is given. The strategy is simple enough to be implemented, but details of the available hardware are not favorable. However, alternative algorithms, designed along the same lines, give an improvement on the Intel Paragon.
Quantum Computation and Lattice Problems
Authors: Oded Regev
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum routine. By combining the two results, we get a quantum reduction from \widetilde\Theta (n^{2.5} )-unique-SVP to the average case subset sum problem. This is a better connection than the known classical results.
Natural Optimization Algorithms for Optimal Regression Testing
Authors: Nashat Mansour, Khaled Fakih
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The optimal regression testing problem is that of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. We present two natural optimization algorithms, namely simulated annealing and genetic algorithms, for solving this problem. The algorithms are based on an integer programming problem formulation and the program's control-flow graph. The main advantage of these algorithms is that they do not suffer from exponential explosion for realistic program sizes. The experimental results show that they find optimal or near-optimal number of retests in a reasonable time.
VBMAR: Virtual Network Load Balanced Minimal Adaptive Routing
Authors: Xicheng Liu, Timothy J. Li, Wen Gao
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Fully adaptive routing with less virtual channels is of technical trend in MPP interconnection network design. However, imbalance of load offsets performances of many schemes. In this paper we give a fully adaptive load balanced routing algorithm called VBMAR. A new design tool called crossed turn model (CTM) is proposed to solve complex deadlock problems across virtual networks while keep the load balanced. Non-deterministic finite automaton (NDFA) is used to model the routing process. The resulting algorithm features routing uniformity and channel priority. Concurrent architecture and parallel priority channel searching techniques are used in VBMAR router design, which make it cost effective. Four algorithms are compared to evaluate the performance of VBMAR. Simulations show that VBMAR can considerably increase network throughput and shorten network delay under both uniform and nonuniform traffic patterns. We argue that VBMAR is a very competitive routing scheme for future commercial MPP systems.