ppxscal/embedding_network huggingface dataset:
Similarity Model and Term Association For Document Categorization
Authors: Huaizhong Kou, Georges Gardarin
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Both Euclidean distance ¿ and cosine-based similarity models are widely used for measures of document similarity in information retrieval and document categorization community. These two similarity models are based on the assumption that term vectors areorthogonal. But this assumption is not true. Term associations are ignored in such similarity models. In document categorization context, we analyze the properties of term-document space, term-category space and category-document space. Then, without the assumption of term independence, we propose a new mathematical model to estimate the association between terms and define a ¿-similarity model of documents. Here we make best use of existing category membership represented by corpus as much as possible, and the objective is to improve categorization performance. Experiments have been done with k-NN classifier overReuters-5178 corpus. The empirical results show that utilization of term association can improve the effectiveness of categorization system and ¿-similarity model outperforms than ones without term association.
OpenMP for Networks of SMPs
Authors: Y. Charlie Hu, Honghui Lu, Alan L. Cox, Willy Zwaenepoel
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper, we present the first system that implements OpenMP on a network of shared-memory multiprocessors. This system enables the programmer to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between multiprocessors. It is imple-mented via a translator that converts OpenMP directives to appropriate calls to a modified version of the TreadMarks software distributed memory system (SDSM). In contrast to previous SDSM systems for SMPs, the modified TreadMarks uses POSIX threads for parallelism within an SMP node. This approach greatly simplifies the changes required to the SDSM in order to exploit the intra-node hardware shared memory.We present performance results for six applications (SPLASH-2 Barnes-Hut and Water, NAS 3D-FFT, SOR, TSP and MGS) running on an SP2 with four four-processor SMP nodes. A comparison between the threaded implementation and the original implementation of TreadMarks shows that using the hardware shared memory within an SMP node significantly reduces the amount of data and the number of messages transmitted between nodes, and consequently achieves speedups up to 30% better than the original ver-sions. We also compare SDSM against message passing. Overall, the speedups of multithreaded TreadMarks pro-grams are within 7-30% of the MPI versions.
Requirement-Based Automated Black-Box Test Generation
Authors: Luay Ho Tahat, Atef Bader, Boris Vaysburg, Bogdan Korel
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Testing large software systems is very laborious and expensive. Model-based test generation techniques are used to automatically generate tests for large software systems. However, these techniques require manually created system models that are used for test generation. In addition, generated test cases are not associated with individual requirements. In this paper, we present a novel approach of requirement-based test generation. The approach accepts a software specification as a set of individual requirements expressed in textual and SDL formats (a common practice in the industry). From these requirements, system model is automatically created with requirement information mapped to the model. The system model is used to automatically generate test cases related to individual requirements. Several test generation strategies are presented. The approach is extended to requirement-based regression test generation related to changes on the requirement level. Our initial experience shows that this approach may provide significant benefits in terms of reduction of number test cases and increase in quality of a test suite.
Simple tree-construction heuristics for the fanout problem
Authors: Robert J. Carragher, Masahiro Fujita, Chung-Kuan Cheng
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We address in this paper the fanout tree problem introduced by Berman, et. al., that is using buffer fanout trees to reduce the fanout delay in a technology mapped network. We construct two basic types of fanout trees and provide simple techniques to manipulate them for further delay reduction. These trees are inserted along critical paths throughout the network. We also perform gate-transformation, that is substitution of a gates of equivalent logical functions, if the technology permits. Experimental results show improvement over Touati's LT-tree construction technique.
The Color-Code Technique for 3D Scanning
Authors: Fábio Franco, Antonio A. F. Oliveira
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present a new method of image coding in structured light 3D scanning called Color-Coding. The method reduces the number of projected patterns needed to generate the code used to retrieve depths of an object being scanned to only three slides, each one containg RGB values that identify the vertical image stripes correctly. The technique converts the RGB values to the well-known Gray-Code algorithm values, making easier and faster the scanning process.
Non-uniform 2-D grid partitioning for heterogeneous parallel architectures
Authors: Phyllis Crandall, Michael J. Quinn
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Numerous applications in science and engineering have a problem space that can be represented as a 2-dimensional grid. While some of these problems exhibit uniform computational requirements over all regions of the grid, others are non-uniform: that is, some regions of the grid have more data points than others. We introduce a new block decomposition method, Fair Binary Recursive Decomposition (FBRD), which as suitable for a collection of heterogeneous processors, and extend it to accommodate non-uniform problems (NUFBRD). Mathematical comparisons of the NUFBRD method and other common partitioning schemes are presented to show the expected performance level of this new decomposition technique.
A Useful Approach to Developing Reverse Engineering Metrics
Authors: Shikun Zhou, Hongji Yang, Paul Luker, Xudong He
Venue: 23rd International Computer Software and Applications Conference (1999)

If software metrics are useful in a forward software engineering environment, they are vital in a reverse engineering one. We are endeavoring to discover approaches to developing reverse engineering metrics for software engineers who desperately need them for reverse engineering legacy systems. The major contribution of the paper is the presentation of a systematic research base and a hierarchical approach to the development of software metrics for reverse engineering.
Parallel Algorithms for 3D Reconstruction of Asymmetric Objects from Electron Micrographs
Authors: Robert E. Lynch, Dan C. Marinescu, Hong Lin, Timothy S. Baker
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electron micrographs. A multi-resolution orientation determination algorithm uses a parallel search to determine the `best fit' of a given image with images in a reference database. The 3D reconstruction algorithm uses Cartesian coordinates and permits the reconstruction of objects that do not posses symmetries. The method decomposes a large linear system into a set of smaller systems that can be solved independently on different processors of a parallel computer or on a cluster of workstations. The paper outlines the reconstruction process and the data partitioning and load balancing issues pertinent to the parallel implementation of the algorithm; preliminary results obtained on a SGI Origin 2000 system are given.
Binary Translation: Static, Dynamic, Retargetable?
Authors: Cristina Cifuentes, Vishv M. Malhotra
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

The porting of software to newer and faster machines using static binary translation techniques has proved successful to a large extent. Current binary translators are static in nature and require a runtime environment to successfully support the execution of the translated programs on the new machine. On the other hand, dynamic binary translation has not been considered as an alternative to static translation -- we argue that these translators can achieve at least the same performance as static translators but will require a simpler runtime environment. This paper presents techniques used to migrate legacy software running on register-based machines of the last 10 to 15years to modern RISC machines. We have developed a second-generation disassembler to aid in the construction of a retargetable binary translation front-end. Retargetability of binary translators is an issue that has not been addressed in present translators.
Concurrent Self-Organizing Maps for Pattern Classification
Authors: Victor-Emil Neagoe, Armand-Dragos Ropot
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

We present a new neural classification model called Concurrent Self-Organizing Maps (CSOM), representing a winner-takes-all collection of small SOM networks. Each SOM of the system is trained individually to provide best results for one class only. We have considered two significant applications: face recognition and multispectral satellite image classification.For first application, we have used the ORL database of 400 faces (40 classes). With CSOM (40 small linear SOMs), we have obtained a recognition score of 91%, while using a single big SOM one obtains a score of 83.5% only!For second application, we have classified the multispectral pixels belonging to a LANDSAT TM image with 7 bands into seven thematic categories. The experimental results lead to the recognition rate of 95.29% using CSOM (7 circular SOMs), while with a single big SOM, one obtains a 94.31% recognition rate. Simultaneously, CSOM leads to a significant reduction of training time by comparison to SOM.
Fault Detectability Analysis for Requirements Validation of Fault Tolerant Systems
Authors: Diego Del Gobbo, Bojan Cukic, Marcello R. Napolitano, Steve Easterbrook
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

When high assurance applications are concerned, life cycle process control has witnessed steady improvement over the past two decades. As a consequence, the number of software defects introduced in the later phases of the life cycle, such as detailed design and coding, is decreasing. The majority of the remaining defects originate in the early phases of the life cycle. This is understandable, since the early phases deal with the translation from informal requirements into a formalism that will be used by developers. Since the step from informal to formal notation is inevitable, verification and validation of the requirements continue to be the research focus. Discovering potential problems as early as possible provides the potential for significant reduction in development time and cost.In this paper, the focus is on a specific aspect of requirements validation for dynamic fault tolerant control systems: the feasibility assessment of the fault detection task. An analytical formulation of the fault detectability condition is presented. This formulation is applicable to any system whose dynamics can be approximated by a linear model. The fault detectability condition can be used for objective validation of fault detection requirements. In a case study, we analyze an inverted pendulum system and demonstrate that "reasonable" requirements for a fault detection system can be infeasible when validated against the fault detectability condition.
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
Authors: Sungwon Jung, Sakti Pramanik
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In navigation systems, a primary task is to compute the minimum cost route from the current location to the destination. One of the major problems for navigation systems is that a significant amount of computation time is required to find a minimum cost path when the topographical road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we propose a new graph model named HiTi (Hierarchical mulTi graph model), for efficiently computing an optimal minimum cost path. Based on HiTi graph model, we propose a new single pair minimum cost path algorithm. We empirically show that our proposed algorithm performs far better than the traditional A* algorithm. Further, we empirically analyze our algorithm by varying both edge cost distribution and hierarchical level number of HiTi graphs.
Achieving a Balanced Low-Cost Architecture for Mass Storage Management through Multiple Fast Ethernet Channels on the Beowulf Parallel Workstation
Authors: Thomas L. Sterling, Donald J. Becker, Chance Reschke, Daniel Savarese, Michael R. Berry
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Network-of-Workstations (NOW) seek to leverage commercial workstation technology to produce high performance computing systems at costs appreciably lower than parallel computers specifically designed for that purpose. The capabilities of technologies emerging from the PC commodity mass market are rapidly evolving to converge with those of workstations while at significantly lower cost. A new operating point in the price-performance design space of parallel system architecture may be derived through parallelism of PC subsystems. The Pile-of-PCs, PopC (pronounced ``pop-see''), approach is being explored through the Beowulf Parallel Workstation developed to provide order-of-magnitude increases in disk capacity and bandwidth for a single user environment at costs commensurate with conventional high-end workstations. This paper explores a critical aspect of the architecture trade-off space for Beowulf associated with the balance of parallel disk throughput and internal network bandwidth. The findings presented demonstrate that parallel channels of commodity 100 Mbps Ethernet are both necessary and sufficient to support the data rates of multiple concurrent file transfers on a sixteen processor Beowulf parallel workstation.
A Visual Supporting Method for Sequence Controller Programming
Authors: Yongil Shin, Atsushi Ohnishi
Venue: 24th International Computer Software and Applications Conference (2000)

The objective of this research is to establish a visual supporting method for developing sequence controller programs. Current sequence controller programming methods have such problems as user-unfriendly programming languages and low programmer productivity. Our supporting method will provide solutions to the problems that will lead to a more efficient way of writing a sequence controller program. The method lets a programmer combine software parts to define a target system. The software parts appear as icons on a monitor. Then, he develops a sequence controller program by setting conditions as well as actions to the software parts. Our method will be illustrated in detail with examples.
FlowManager: A Workflow Management System Based on Petri Nets
Authors: Lerina Aversano, Aniello Cimitile, Pierpaolo Gallucci, Maria Luisa Villani
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The use of workflow technology to provide automated support to the management and execution of software engineering processes has become of great interest for large software companies that nowadays are moving towards the new model of "virtual" organizations. Therefore, workflow systems that allow co-operation among team members in a distributed environment are now a primary concern. In this paper we present a new WfMS, named FlowManager, which has all the potential to be used in such application domain. FlowManager, in fact, will be a component of a larger European project, named Generalized Environment for Process Management in Cooperative Software Engineering (GENESIS), whose objective is to develop a non-invasive and open source environment for modeling software engineering processes and managing co-operation among geographically distributed teams.
A Modeling Approach for Product Classification Systems
Authors: Jörg Leukel, Volker Schmitz, Frank-Dieter Dorloff
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Standardized product classification systems play a major role for searching and comparing offered products on electronic markets. Especially in case of large multi-vendor product catalogs classified data becomes an important asset and success factor. The most knownsystems are UNSPSC and eCl@ss, however they are still developing, and new systems are emerging as well. Classification systems differ not only in content but also in structure from each other. The management and exchange of the systems between market partners must beable to get along with these differences. A common structure model, which can be used to specify XML business documents, is missing so far. This paper discusses the design of classification systems and develops a data model using XML Schema. The model can be used for the transmission of classification systems, thus it is an innovative extension of existing product catalog standards.
Significance Tests for Patterns in Continuous Data
Authors: Richard J. Bolton, David J. Hand
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we consider the question of uncertainty of detected patterns in data mining. In particular, we develop statistical tests for patterns found in continuous data, indicating the significance of these patterns in terms of the probability that they have occurred by chance. We examine the performance of these tests on patterns detected in several large data sets, including a data set describing the locations of earthquakes in California and another describing flow cytometry measurements on phytoplankton.
Visualizing the execution of High Performance Fortran (HPF) programs
Authors: Doug Kimelman, Pradeep Mittal, Edith Schonberg, Peter F. Sweeney, Ko-Yang Wang, Dror Zernik
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Although the data placement programming model frees programmers from writing low level communication code, it also makes it harder for them to anticipate the performance of the code they write. In particular, the communication that is required by a given data distribution, and its impact on performance, may not be obvious from the program source. Many existing performance visualization systems could be used in attempts to investigate the performance of data placement programs; however, no published system would provide views that relate communication activity to the abstraction that is the primary focus of data placement programming: data distribution. The paper introduces new high level views of HPF program behavior that show communication activity in the context of the array distribution from which the compiler derived the communication. With these views, programmers can see not only when and where communication takes place, but also what subarrays are moving between which processors by virtue of the communication. These views provide programmers with feedback in terms of the programming model-the programmers' frame of reference. The programming model as the level programmers most readily comprehend, and it is the level at which they must improve program performance by altering data distribution. Thus, these views provide a basis for effective tuning of data placement programs.
Representative Objects: Concise Representations of Semistructured, Hierarchial Data
Authors: Svetlozar Nestorov, Jeffrey D. Ullman, Janet L. Wiener, Sudarshan S. Chawathe
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Introduces the concept of representative objects, which uncover the inherent schema(s) in semi-structured, hierarchical data sources and provide a concise description of the structure of the data. Semi-structured data, unlike data stored in typical relational or object-oriented databases, does not have a fixed schema that is known in advance and stored separately from the data. With the rapid growth of the World Wide Web, semi-structured hierarchical data sources are becoming widely available to the casual user. The lack of external schema information currently makes browsing and querying these data sources inefficient at best, and impossible at worst. We show how representative objects make schema discovery efficient and facilitate the generation of meaningful queries over the data.
PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain
Authors: Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, H. Raymond Strong
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Existing programming environments for clusters are typically built on top of a point-to-point communication layer (send and receive) over local area networks (LANs) and, as a result, suffer from poor performance in the collective communication part. For example, a broadcast that is implemented using a TCP/IP protocol (which is a point-to-point protocol) over a LAN is obviously an efficient as it is not utilizing the fact that the LAN is a broadcast medium. We have observed that the main difference between a distributed computing paradigm and a message passing parallel computing paradigm is that, in a distributed environment the activity of every processor is independent while in a parallel environment the collection of the user-communication layers in the processors can be modeled as a single global program. We have formalized the requirements by defining the notion of a correct global program. This notion provides a precise specification, of the interface between the transport layer and the user-communication. Layer. We have developed PCODE, a new communication protocol that is driven by a global program, and proved its correctness. We have implemented the PCODE protocol on a collection of IBM RS/6000 workstations and on a collection of Silicon Graphics Indigo workstations, both communicating via UDP broadcast. The experimental results we obtained indicate that the performance advantage of PCODE over the current point-to-point approach (TCP) can be as high as an order of magnitude on a cluster of 16 workstations.