ppxscal/embedding_network huggingface dataset:
Test operation-driven approach on building regression testing environment
Authors: Hiroshi Suganuma, Kinya Nakamura, Tsutomu Syomura
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

This paper proposes a new testing and regression testing process which includes the development of test cases and test data, and the multiple times execution of such test cases. The process is practical enough for the current emerging business application development whose schedules are typically ex-tremely short.In our process, most of the steps for testing are reversed. That is, a test engineer starts from a test operation, which is followed by test data retrieval, test case retrieval, and matrix checklist creation by combining the test cases. In this way, we can significantly reduce the cost of preparation of automatic execution of test cases for regression testing. In addition, this technique enables the test engineer to develop test cases incre-mentally. A functionality of the tool to support this process is also presented.A preliminary case study of this technique on the actual software development project in our company showed im-provements on the preparation of the test execution as well as the execution of regression testing.
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
Authors: Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchical networks. In particular, we construct optimal VLSI layouts for butterfly networks, generalized hypercubes, and star graphs that have areas within a factor of 1 +o(1) from their lower bounds. We also derive efficient layouts for a number of other important networks, such as cube-connected cycles (CCC) and hypernets, which are the best results reported for these networks thus far.
The Parallel Break Construct, or How to Kill an Activity Tree
Authors: Yair I. Friedman, Dror G. Feitelson, Iaakov Exman
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Most parallel languages provide means to express parallelism, e.g. a parallel-do construct, but no means to terminate the parallel activities spawned by such constructs. We propose three high-level primitives for this purpose, which are defined by analogies with primitives that break out of sequential iterative constructs. The primitives are pcontinue, which terminates the calling activity, pbreak, which terminates all the activities in the construct that spawned the calling activity, and return, which terminates all the activities created in the current function call. These constructs are especially useful in search problems, where an activity that finds a solution can terminate other activities that are investigating inferior approaches. Given that parallel constructs can be nested, activities form a tree rooted at the original activity that started the program. The main challenge in implementing pbreak and return is identifying the subtree of activities that should be killed. Three algorithms were designed and implemented, and experiments show that using these constructs can provide significant performance benefits.
Modeling parallel communication
Authors: Richard M. Karp
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The LogP model provides a framework for analyzing the performance of algorithms on distributed-memory multiprocessors. The model takes into account both the cost of computation and the cost of communication. It describes a multiprocessor in terms of four parameters, representing computation power, communication bandwidth, communication latency and the degree of overlap between computation and communication. In this paper we discuss the rationale for the different features of the LogP model. We then compare the model with other models having similar aims, such as network-based models, Valiant's BSP model, and the PRAM(m) model. Finally, we call upon the work of a number of students at Berkeley to illustrate the application of the model to problems of broadcasting, sorting, FFT computation, summing, prefix summing and solution of triangular and tridiagonal systems.
COTS-Based Fault Tolerance in Deep Space: Qualitative and Quantitative Analyses of a Bus Network Architecture
Authors: Ann T. Tai, Savio N. Chau, Leon Alkalai
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Among the COTS applications in the X2000 architecture for deep-space missions, the use of commercial bus standards is the highest-payoff COTS application since a bus interface has a global impact and enabling effect on system cost and capability, respectively. While COTS bus standards enable significant cost reductions, it is a great challenge for us to deliver a highly-reliable long-term survivable system employing COTS standards that are not developed for mission-critical applications. The spirit of our solution to the problem is to exploit the pertinent standard features of a COTS product to circumvent its shortcomings, though these standard features may not be originally designed for highly reliable systems. In this paper, we discuss our experiences and findings on the design and assessment of an IEEE 1394 compliant fault-tolerant bus architecture. We first derive and qualitatively analyze a ``stack-tree topology'' that not only complies with IEEE 1394 but also enables the implementation of a fault-tolerant bus architecture without node redundancy. We then present a quantitative evaluation that demonstrates significant reliability improvement from the COTS-based fault tolerance.
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators
Authors: Marzena Kryszkiewicz
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Many data mining problems require the discover of frequent patterns in order to be solved.Frequent Itemsets are useful in the discover of association rules, episode rules, sequential patterns and clusters. The number of frequent itemsets is usually huge. Therefore, it is important to work out concise representations of frequent itemsets. In the paper, we describe three basic loassless representations of frequent patters in a uniform wayand offer a new lossless representation of frequent patterns based on disjunction-free generators. The new representation is more concisethan two of the basic representations and more efficiently computablethan the third representation. We propose an algorithm for the determining the new representation.
Mobility Support: A Mutil-Domain Bridging Matter
Authors: Do Van Thanh, Jan Arild Audestad
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

In this paper, we view mobility support as a bridging matter between fixed and mobile domains. In single domain systems, mobility is implicitly supported by access and location transparencies provided by the Distributed Processing Environment (DPE). Distributed telecommunication systems span, however, several domains that are controlled by different actors and may also be fixed or mobile. Mobility is no longer automatically supported since interoperability is not always guaranteed between domains. In order to provide interoperability between fixed or mobile domains, the agent concept is proposed. Mobility is, thereafter, made transparent to the applications by using the proxy concept.
PDAs in Medical Education and Practice
Authors: Ole Smørdal, Judith Gregory, Kari Jeanette Langseth
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

We report from an on-going project, KNOWMOBILE [17], that explores how wireless and mobile technologies, in this case how Personal Digital Assistants (PDAs) may be useful in medical education and clinical practice, particularly to access net-based information asneeded. KNOWMOBILE is a research collaboration comprising academic and industrial partners including InterMedia, the Department of Informatics and the School of Medicine at University of Oslo, CUT at the University of Umeå, Telenor R & D, Ericsson, Hewlett-Packard, and MedCal. The KNOWMOBILE project aims to support Problem-Based Learning (PBL) and the integration of Evidence Based Medicine (EBM) in the medical education reform in Norway. What does just-in-time' access to information mean in clinical settings? How can health professionals be helped with access to the most up-to-date medical information? From preliminary analyses of the problematics of PDAs in use - and non-use - we discuss problems regarding information and communication infrastructure that call upon us to work from a social historical interpretation of infrastructures' in order to better inform design perspectives anddirections for future research. We conclude that the PDAs should not be regarded as Personal Digital Assistants, but rather as gateways in complicated webs of interdependent technical and social networks.
Rate of Change Load Balancing in Distributed and Parallel Systems
Authors: Luis Miguel Campos, Isaac D. Scherson
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Dynamic Load Balancing is an important system function destined to distribute workload among available processors to improve throughput and/or execution times of parallel computer programs either uniform or nonuniform (jobs whose workload varies at run-time in unpredictable ways). Non-uniform computation and communication requirements may bog down a parallel computer if no efficient load distribution is effected. A novel distributed algorithm for load balancing is proposed and is based on local Rate of Change observations rather than on global absolute load numbers. It is a totally distributed algorithm and requires no centralized trigger and/or decision makers. The strategy is discussed and analysed by means of experimental simulation.
A synthesis method of LSGP partitioning for given-shape regular arrays
Authors: Graham M. Megson, Xian Chen
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper presents a method to partition and map a computational polytope onto processor arrays. Based on the theoretical framework of an existing LSGP method, a systematic design procedure is proposed which constructs an activity matrix, proposed by Darte, according to the shapes of the computational polytope and the processor array and derives a valid timing vector. By this method the given-shape mapping can be achieved with neither difficulty nor exhausted computations by removing the need to compute HNFs.
A Mobile Scaffolding-Aid-Based Bird-Watching Learning System
Authors: Yuh-Shyan Chen, Tai-Chien Kao, Jang-Ping Sheu, Chao-Yu Chiang
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

In this paper, we develop a mobile scaffolding-aid-based bird-watching learning system, which aims to construct an outdoor mobility-learning activity under the up-to-date wirelesstechnology. The proposed Bird-Watching Learning (BWL) system is designed on the wireless mobile ad-hoc network. In the BWL system, each learner's device has PDA (Personal Digital Assistances) with Wi -Fi (IEEE 802.11b) card, within a WLAN environment. Specially, the BWL system contains a mobile learn sheet sub-system, which to integrate the scaffolding-aid learn model into the BWL system. Finally, we conduct a formative evaluation to provide statistical results, which is evaluated for the following two purposes; (1) to explore the possible roles and scaffolding aids that the mobile PDA of the BWL system can play and offer in the bird-watching activities, (2) to investigate if the affective and cognitive learning could be possibly benefited from the mobility, portability, and individualization of the mobile PDA of the BWL system.
Building an Integrated Active OODBMS: Requirements, Architecture, and Design Decisions
Authors: Alejandro P. Buchmann, Jürgen Zimmermann, José A. Blakeley, David L. Wells
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Active OODBMSs must provide efficient support for event detection, composition and rule execution. Previous experience of building active capabilities on top of existing closed OODBMSs has proven to be ineffective. We propose instead an active OODBMS architecture where event detection and rule support are tightly integrated with the rest of the core OODBMS functionality. After presenting an analysis of the requirements of active OODBMSs, we discuss the event set, rule execution modes and lifespan of the events supported in our architecture. We also discuss event composition coupling relative to transaction boundaries. Since building an active OODBMS ex nihilo is extremely expensive, we are building the REACH (REal-time ACtive Heterogeneous) OODBMS by extending Texas Instruments' Open OODB toolkit. Open OODB is particularly well-suited for our purposes because it is the first DBMS whose architecture closely resembles the active database paradigm. It provides low-level event detection and invokes appropriate DBMS functionality as actions. We describe the architecture of the event detection and composition mechanisms, and the rule-firing process of the REACH active OODBMS, and show how these mechanisms interplay with the Open OODB core mechanisms.
Design and Implementation of a Scalable Parallel System for Multidimensional Analysis and OLAP
Authors: Sanjay Goil, Alok N. Choudhary
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data values. Query processing for these applications require different views of data for decision support. The Data Cube operator provides multi-dimensional aggregates, used to calculate and store summary information on a number of dimensions.The multi-dimensionality of the underlying problem can be represented both in relational and multi-dimensional databases, the latter being a better fit when query performance is the criteria for judgment. Relational databases are scalable in size and efforts are on to make their performance acceptable. On the other hand multi-dimensional databases perform well for such queries, although they are not very scalable. Parallel computing is necessary to address the scalability and performance issues for these data sets.In this paper we present a parallel and scalable infrastructure for OLAP and multidimensional analysis. We use chunking to store data either as a dense block using multidimensional arrays (md-arrays) or a sparse set using a Bit encoded sparse structure (BESS). Chunks provide a multidimensional index structure for efficient dimension oriented data accesses much the same as md-arrays do. Operations within chunks and between chunks are a combination of relational and multi-dimensional operations depending on whether the chunk is sparse or dense. We present performance results for data sets with 3, 5 and 10 dimensions for our implementation on the IBM SP-2 which show good speedup and scalability.
A Scenario Model Advocating User-Driven Adaptive Document Recognition Systems
Authors: Frédéic Bapst, Abdel Wahab Zramdini, Rolf Ingold
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Assisted document recognition systems have to integrate automatic recognition, manual edition and incremental learning in a single interactive environment. This paper raises the question of the organization of these three kinds of operations. When an analyzer has the ability to improve with use, there is a tradeoff between the benefits of enhancing the accuracy of automatic analysis, and the additional time spent in interacting for feedback communication. The global cost depends then on the sequence of processed entities, and on the relevance of the learning transactions. Notations are introduced to describe the evolution of a recognition session, and possible organization strategies are discussed. Then a cost model is presented to allow the comparison between different organization schemes. We describe some concrete experiments of cost measures with the ApOFIS font identification tool and the ScanWorX OCR; the first results show that a user-driven approach can potentially save substantial effort in the recognition process, in comparison with machine-driven systems.
KLeOS: A Personal, Mobile, Knowledge and Learning Organisation System
Authors: Giasemi N. Vavoula, Mike Sharples
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

The design of a personal, mobile Knowledge and Learning Organisation System (KLeOS) is described. Studies of adult learning practice showed [1] that learning activity is mobile between locations, time slots, and topic areas. Moreover, learning follows a hierarchical organisation at three operational levels: learning activities are discrete acts, which are grouped to form learning episodes, which in turn are grouped to form learning projects.KLeOS reflects this hierarchical structure and allows the user to organise and manage their learning experiences and resources as a visual timeline. In addition, it incorporates a knowledge map, which is updated as the user progresses through learning experiences. The interface of the organiser is based on the idea of timelines and employs project lines andactivity lines to represent the user's learning over a lifetime. The organiser forms a bridge between the timeline and the knowledge map by tagging the nodes of knowledge with the context of the learning episode(s) within which that knowledge was acquired. The architecture of KLeOS allows it to be used on a number of different platforms, thus ensuring mobility.
Impact Evaluation of Organisational Changes Enabled by Workflow Systems
Authors: Anabela Sarmento, Altamiro Machado
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Companies are adopting workflow systems to ensure a better response to the challenges and opportunities of the economic environment. This technology has features and characteristics that allow it to improve communication, collaboration, coordination, knowledge and productivity. However, it is not yet clear what kind of organisational changes will emerge after the adoption of such systems. This paper looks at the organisational changes enabled by workflow systems using the Improvisational Change Model proposed by Orlikowski and Hofman (1997). We begin with a brief introductory review of change management approaches, detail Orlikowski and Hofman's model and discuss changes induced by workflow systems. Finally, we look at organisational changes using the Improvisational Change Model and finish with the implications for future empirical research.
Efficient routing and message bounds for optimal parallel algorithms
Authors: Xiaotie Deng, Patrick W. Dymond
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The cost of interprocessor communication has a substantial impact on execution time when implementing parallel algorithms on physical parallel computers. We study these implementation costs, examining the number of inter-processor messages, the cost of routing these messages on various architectures, and the number of communication phases. We provide an improved direct routing algorithm for realizing h-relations on crossbar networks. We also introduce a round-robin message-delivery algorithm which reduces the number of times a communication lint is established between a pair of processors (by delivering all messages of that phase for the pair in order without interruption) We summarize criteria sufficient for a parallel algorithm to be implemented optimally on several common networks. We also describe a log n-phase optimal parallel list-ranking algorithm.
Capability Maturity for Knowledge Management
Authors: Alfs T. Berztiss
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The importance of knowledge management and knowledge engineering (KMKE) is now widely recognized. This suggests that greater attention is to be given to formal planning for KMKE activities. To assist in the planning, and to help institutionalize the techniques and activities of KMKE, we introduce a capability maturity model for KMKE. The model is loosely based on the software Capability Maturity Model of the Software Engineering Institute.
Provably Fast Training Algorithms for Support Vector Machines
Authors: José L. Balcázar, Yang Dai, Osamu Watanabe
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. We focus on their use for classification that case the SVM algorithms work by maximizing the margin of a classifying hyperplane in a feature space. The feature space is handled by means of kernels f the problems are formulated in dual form. Random Sampling techniques successfully used for similar problems are studied here. The main contribute onis a random zed algorithm for training SVMs for which we can formally prove an upper bound on the expected running time that is quasilinear on the number of data points. To ourknowledge, this is the first algorithm for training SVMs in dual formulation and with kernels for which such a quasi-linear time bound has been formally proved.
All-to-All Broadcast on Switch-Based Clusters of Workstations
Authors: Matt Jacunski, P. Sadayappan, Dhabaleswar K. Panda
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-to-all broadcast is considered within a single switch cluster. Both combining and non-combining algorithms are compared via analytical modeling and simulation. The characteristics of optimal all-to-all broadcast operation are considered and applied to development of multi-switch algorithms. The single switch algorithms are considered on two switch clusters and a near-optimal algorithm is developed which schedules use of interconnecting links where the potential for link contention exists. Finally, the Link Scheduling concept is extended to handle arbitrary irregular networks. Operation of this algorithm is simulated on a 128-node irregular network, and shows a 27.1% improvement in performance compared to other algorithms.
Parallel Global Routing Algorithms for Standard Cells
Authors: Zhaoyun Xing, John A. Chandy, Prithviraj Banerjee
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using the Message Passing Interface (MPI), and have been evaluated on a wide range of parallel platforms such as the Sun SparcCenter~1000 and the Intel Paragon. Our experimental results show good speedups and qualities from two of these parallel algorithms. We have been able to reduce runtimes of some circuits from half an hour to 5 minutes, obtained speedups of about 4.0 to 5.0 on 8 processors, with less than 2-3% degradation of quality of the solutions.