ppxscal/embedding_network huggingface dataset:
Interoperability of Data Parallel Runtime Libraries
Authors: Guy Edjlali, Alan Sussman, Joel H. Saltz
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use multiple libraries is required in many application areas, such as multidisciplinary complex physical simulations and remote sensing image database applications. An application can consist of one program or multiple programs that use different libraries to parallelize operations on distributed data structures. The framework is embodied in a runtime library called Meta-Chaos that has been used to exchange data between data parallel programs written using High Performance Fortran, the Chaos and Multiblock Parti libraries developed at Maryland for handling various types of unstructured problems, and the runtime library for pC++, a data parallel version of C++ from Indiana University. Experimental results show that Meta-Chaos is able to move data between libraries efficiently, and that Meta-Chaos provides effective support for complex applications.
Service Overlay Networks: SLAs, QoS and Bandwidth Provisioning
Authors: Zhenhai Duan, Zhi-Li Zhang, Yiwei Thomas Hou
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end QoS, plaguing the current Internet, andto facilitate the creation and deployment of value-added Internet services such as VoIP, Video-on-Demand, and other emerging QoS-sensitive services. A SON purchases bandwidthwith certain QoS guarantees from individual network domains via bilateral service level agreement (SLA) to build a logical end-to-end service delivery infrastructure on top of existing data transport networks. Via a service contract, users directly pay the SON provider for using the value-added services provided by the SON.In this paper we study the bandwidth provisioning problem for a service overlay network which is critical to the cost recovery in deploying and operating value-added services over the SON. We mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidthcosts on the bandwidth provisioning of a SON.
Adaptive Source Routing in Multistage Interconnection Networks
Authors: Yucel Aydogan, Craig B. Stunkel, Cevdet Aykanat, Bülent Abali
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is determined at the source processor. Every packet can be routed in a fully adaptive or partially adaptive or non--adaptive manner, all within the same network at the same time. We evaluate and compare performance of the proposed adaptive source routing networks and oblivious routing networks by simulations. We also describe a route generation algorithm that determines maximally adaptive routes in multistage networks.
Compiler techniques for increasing CU/PE overlap in SIMD machines
Authors: Gene Saghi, Howard Jay Siegel
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Conceptually, an SIMD machine has the capability to overlap operation of the control unit (CU) with the operation of the processing elements (PEs). Computation of a single program is most efficient when the work load of the CU and the PEs is balanced. Load balancing between the CU and PEs is accomplished by migrating certain computations (e.g., PE-common array index calculations, loop index variable manipulation) from the PEs to the CU and vice versa. The goal of this research is to develop some of the techniques needed for the automatic specification of CU/PE overlap at compile time. As a proof of concept, the ELP compiler has been modified to support experimentation with CU/PE overlap.
An OPEN Learning Model for the Distance Learning Architecture
Authors: Ruimin Shen, Peng Han, Fan Yang
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Web based learning enables many more students to have access to a distance-learning environment, providing students and teachers with unprecedented flexibility and convenience. At the same time, the web based learning framework also poses many problems. For example, a teach used to old-style teaching methods may find it difficult to put the course material online, and a student may find too much information overload. In this paper, we present an open framework that solves these two problems. In particular, our framework allows studentsto interact with a automatic question answering system to get their answers, and the teachers to analysis students learning patterns and organize the web-based contents efficiently. The framework is both intelligent through data mining and case-based reasoning features, anduser-friendly through personalized services to both teachers and students.
ACE: a high-performance parallel Prolog system
Authors: Enrico Pontelli, Gopal Gupta, Manuel V. Hermenegildo
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In recent years a lot of research has been invested in parallel processing of numerical applications. However, parallel processing of Symbolic and AI applications has received less attention. This paper presents a system for parallel symbolic computing, named ACE, based on the logic programming paradigm. ACE is a computational model for the full Prolog language, capable of exploiting Or-parallelism and Independent And-parallelism. In this paper we focus on the implementation of the and-parallel part of the ACE system (called &ACE) on a shared memory multiprocessor, describing its organization, some optimizations, and presenting some performance figures, proving the ability of &ACE to efficiently exploit parallelism.
Lexicon Reduction in an HMM-Framework Based on Quantized Feature Vectors
Authors: Guido Kaufmann, Horst Bunke, M. Hadorn
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

For many applications in cursive script recognition the vocabulary is restricted to a small and fixed set of words. In a recognition approach such as Hidden Markov Models, for each of these words a model is constructed and trained. In the recognition task an unknown pattern is matched with all of these models to find the most likely class. In our paper, we describe a method for reducing the size of vocabulary depending on the actual input. In contrast to many other techniques, our approach is not using any topological features. The reduction system is directly based on the quantized feature vectors which are used as input for the HMMs. Thus very little additional work is required for lexicon reduction. The proposed approach was successfully tested on two different systems with small lexicons. In both cases, the lexicon could be reduced to 25% of its original size without increasing in the error rate.
Fast Antirandom (FAR) Test Generation
Authors: Anneliese von Mayrhauser, Andre Bai, Tom Chen, Charles Anderson, Amjad Hajjar
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Anti-random testing has proved useful in a series of empirical evaluations. The basic premise of anti-random testing is to chose new test vectors that are as far away from existing test inputs as possible. The distance measure is Hamming or Cartesian Distance. Unfortunately, this method essentially requires enumeration of the input space and computation of each input vector when used on an arbitrary set of existing test data. This prevents scale-up to large test sets and/or long input vectors.We present and empirically evaluate a technique to generate anti-random vectors that is computationally feasible for large input vectors and long sequences of tests. We also show how this fast anti-random test generation (FAR) can consider retained state (i. e. effects of subsequent inputs on each other). We evaluate effectiveness using branch coverage as the testing criterion.
Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties
Authors: Miklós Ajtai
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We formulate a conjecture about random n-dimensional lattices with a suitable distribution. The conjecture says that every polynomial time computable property of a random lattice holds with a probabiltiy either close to 0 or close to 1. Accepting the conjecture we get a large classof hard lattice problems. We describe an analogy between our conjecture and a set theoretical axiom, which cannot be proved in ZFC. This axiom says that there exists a nontrivial \sigma -additive 0 - 1 measure defined on the set of all subsets of some set S.
Quantitative Evaluation of Dependability Critical Systems Based on Guarded Statechart Models
Authors: Mario Dal Cin, Gábor Huszerl, K. Kosmidis
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The paper introduces a method to model embedded dependability-critical systems as AND-composition of Guarded Statecharts which are special UML-statecharts. With Guarded Statecharts we can model the reactive behavior of embedded systems so that their quantitative analysis can be performed. First, we present our motivation for using Guarded Statecharts to express the interaction between hardware and software components of embedded systems, and to model faults and errors as state perturbations. Then we discuss how these models are transformed into Stochastic Reward Nets amenable to a quantitative dependability analysis. Finally, our approach is illustrated by an example.
Algorithms for All-to-All Personalized Exchange in 2D and 3D Tori
Authors: Young-Joo Suh, Sudhakar Yalamanchili
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The inter-processor all-to-all communication patterns can be found in many important parallel algorithms. This paper presents new algorithms for all-to-all personalized exchange for circuit switched or wormhole routed 2D and 3D torus connected multiprocessors. The algorithms use message combining to minimize message startups at the expense of larger message sizes. The unique feature of these algorithms is that they are the first algorithms that we know of that operate in a bottom-up fashion rather than a recursive top-down manner.
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses
Authors: Peter Damaschke
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Consider an \sqrt{n}\times\sqrt{n} processor mesh where, in addition to the local links, each row and column is enhanced by a {\sc common} CRCW bus. Assume that each processor stores an element of a commutative semigroup, and only k
Developing and Accessing Scientific Databases with the OPM Data Management Tools
Authors: I-Min A. Chen, Anthony Kosky, Victor M. Markowitz, Ernest Szeto
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Summary form only given. The Object-Protocol Model (OPM) data management tools provide facilities for rapid development, documentation, and flexible exploration of scientific databases. The tools are based on OPM, an object-oriented data model which is similar to the ODMG standard, but also supports extensions for modeling scientific data. Databases designed using OPM can be implemented using a variety of commercial relational DBMSs, using schema translation tools that generate complete DBMS database definitions from OPM schemas. Further, OPM schemas can be retrofitted on top of existing databases defined using a variety of notations, such as the relational data model or the ASN.1 data exchange format, using OPM retrofitting tools. Several archival molecular biology databases have been designed and implemented using the OPM tools, including the Genome Database (GDB) and the Protein Data Bank (PDB), while other scientific databases, such as the Genome Sequence Database (GSDB), have been retrofitted with semantically enhanced views using the OPM tools.
Process-Oriented, Consistent Integration of Software Components
Authors: Ralph Depke, Gregor Engels, Sebastian Thöne, M. Langham, B. Lütkemeier
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The integration of software components becomes a more and more important issue in software engineering. Process-oriented approaches should provide automated information processes. Therefore, the software components have to be integrated in a consistent way,i.e., their export interfaces have to be respected by the importing components. Furthermore, the type system of component interfaces has to support a tunable degree of freedom. This allows the insertion of components with interfaces of restrictedbut sufficient degree of compatibility. In this paper, we develop a concept for consistent and flexible integration of components. We present a process modeling language that combines UML and XML in order to support consistent, flexible, and executable processes. Finally, we provide a formalization of the proposed component type system.
Pattern-Based Annotations on E-Books: From Personal to Shared Didactic Content
Authors: Cyrille Desmoulins, Dominique Mille
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

Our research aims at defining models and software tools in order to provide learners with a training memory. This memory is a computer-based space where a learner can organize and manage the annotations he adds to his training documents. Following a literature review andafter our first experiments, we set up the specifications of the basic concepts: didactic annotations and e-books. This review enlightened the fact that the crucial issue is to solve the paradox that people use personal annotation visual forms whereas they have the same annotating objectives within their community. Our proposition is to provide learners with annotation pattern s combining personal annotation visual forms and sharable annotationcontent. This annotation pattern model is based on ontologies structuring annotations content, particularly the didactic objectives. We are currently implementing these models on e-books on which usability and learning efficiency could more easily be obtained because of theirproperties (bare-handed interaction and mobility).
IPv4+4
Authors: Zoltán Turányi, Andras Valkó
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The IPv4+4 architecture presented in this paper provides an evolutionary approach to the extension of IPv4 address space. It builds on the existence of Network Address Translators(NATs) and private address realms. During and after the transition from IPv4 to IPv4+4 there is no need to change routers, only NATs and end-hosts. End-to-end address transparency is regained incrementally as deployment progresses. The transition process is simple and it provides incentives for networks with both private and public addresses to upgrade and increase transparent reachability. Early implementation experiences are also included.
Enhancing Competitiveness via a Public Fault Failure Data Repository
Authors: Dolores R. Wallace
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

You are leading a project with managers from other company divisions and want to conduct software inspections on the code. Some managers do not believe inspections add value. To support your case, you access a public data base containing software fault and failure data to locate systems in your application domain with project characteristics similar to yours.You separate the systems into two groups: those who used software inspection and those who didn't. You build a profile for each with their timelines, discovered fault count for inspection, unit test, integration test, and system test, and finally, time to delivery. You apply additional tools to help gauge whether inspections paid off in product quality, cost of the project, and delivery time. The result: you have quickly built a profile for a decision that may affect product quality, cost, and time to market; these factors affect the bottom line of the product for which you are responsible.Can you use this approach today? Only if your company has such a data base with related query tools, for no such public data base exists. This paper describes a project at the United States National Institute of Standards and Technology which is building tools and collecting data for such a facility. The facility will serve industry by providing profiles for answering similar questions about method effectiveness, benchmarks on faults and failures, and tools for understanding the data. It will provide researchers with data to support their efforts to develop new software methods in development, data analysis and measurement, and software reliability.
An Industrial Perspective of Software Architecture
Authors: Christine Hofmeister, Robert L. Nord, Dilip Soni
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The software architecture of a system describes how it is decomposed into components, how these components are interconnected, and how they communicate and interact with each other and with the environment. Software architecture represents critical, system-wide design decisions which affect quality, reconfigurability and reuse, and the cost for development and maintenance. In order to understand architecture as it is practised in the real world, we conducted a survey of a variety of industrial software systems. Our survey revealed the need for rigorous descriptions, systematic techniques, and well-defined processes to make architecture-level software development an engineering practice rather than an art.
Sentient Map and Its Application to E-Learning
Authors: Shi-Kuo Chang
Venue: 24th International Computer Software and Applications Conference (2000)

The sentient map is a new paradigm for visual information retrieval. It enables the user to view data as maps, so that gestures, more specifically c-gestures, can be used for the interaction between the user and the multimedia information system. Different c-gestures are then dynamically transformed into spatial/temporal queries, or s -queries, for multimedia information sources and databases. An e-learning environment involving many academic institutions serves as a test bed to evaluate this approach. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analysis of Several Scheduling Algorithms under the Nano-Thread Programming Model
Authors: Xavier Martorell, Jesús Labarta, Nacho Navarro, Eduard Ayguadé
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The authors present the analysis, in a dynamic processor allocation environment, of four scheduling algorithms running on top of the nano-threads programming model. Three of them are well-known: uniform-sized chunking, guided self-scheduling and trapezoid self-scheduling. The fourth is their proposal: adaptable size chunking. In that environment, applications are automatically decomposed into tasks by a parallelizing compiler which uses the hierarchical task graph to represent the source application. The parallel code is an executable representation of this graph with the support of a user-level library (the nano-threads library). The execution environment includes a user-level process (CPU manager) which controls the allocation of processors to applications. The analysis of the scheduling algorithms shows it is possible to provide enough information to the library to allow a fast adaptation to dynamic changes in the processors allocated to the application.
Performance results of several High Performance Fortran benchmarks
Authors: Larry Meadows, Douglas Miles, Mark Young
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The pghpf High Performance Fortran (HPF) compiler from The Portland Group, Inc. (PGI) has been ported to a variety of shared- and distributed-memory platforms. To track compiler improvements and assist in tuning of the pghpf runtime system, 3 types of benchmarks are used. Low level runtime benchmarks measure the efficiency of the runtime system relative to hardware specifications. Kernel benchmarks, usually only a few hundred lines long, measure effectiveness on sequences of code that dominate the execution time of many common applications. Full application benchmarks measure effectiveness on production-class codes from a variety of disciplines. Application benchmarks are typically long-running, include I/O of varying amounts, and are significantly more complicated than the kernel benchmarks. We describe these benchmarks below in further detail.
Locally Testable Codes and PCPs of Almost-Linear Length
Authors: Oded Goldreich, Madhu Sudan
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Locally testable codes are error-correcting codes that admit very efficient codeword tests. Specifically, using a constant number of (random) queries, non-codewords are rejected with probability proportional to their distance from the code.Locally testable codes are believed to be the combinatorial core of PCPs. However, the relation is less immediate than commonly believed. Nevertheless, we show that certain PCP systems can be modified to yield locally testable codes. On the other hand, we adapt techniques we develop for the construction of the latter to yield new PCPs. Our main results are locally testable codes and PCPs of almost-linear length. Specifically, we present:Locally testable (linear) codes in which \kappainformation bits are encoded by a codeword of length approximately \kappa\cdot \exp (\sqrt {\log \kappa } ). This improves over previous results that either yield codewords of exponential length or obtained almost quadratic length codewords for sufficiently large non-binary alphabet.PCP systems of almost-linear length for SAT. The length of the proof is approximately n \cdot \exp (\sqrt {\log n} ) and verification in performed by a constant number (i.e., 19) of queries, as opposed to previous results that used proof length n^{1 + ({\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 q}}\right.\kern-\nulldelimiterspace} \!\lower0.7ex\hbox{$q$}})} for verification by q queries.The novel techniques in use include a random projection of certain codewords and PCP-oracles, an adaptation of PCP constructions to obtain "linear PCP-oracles" for provingconjunctions of linear conditions, and a direct construction of locally testable (linear) codes of sub-exponential length.