ppxscal/embedding_network huggingface dataset:
Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on Shared Memory Architecture
Authors: Sibabrata Ray, Ilong Jiang
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

The problem of partitioning task graphs in its general form is known to be NP-complete and it is extremely difficult to come up with simple but effective and fast heuristics too. In this paper, the tree task graphs are considered which arise from many important programming paradigms such as divide and conquer branch and bound, etc. The target architecture considered is shared memory architecture as it typifies a wide range of research prototypes and commercial products of multiprocessors. Optimal sequential and parallel algorithms for partitioning tree task graphs such that the bottleneck is minimized "with minimum number of processors are developed. The bandwidth minimization problem is NP-complete even for trees. Three effective, simple 2-pass heuristics and their parallel versions are given. The effectiveness and efficiency of those heuristics are validated through extensive simulations.
Automated Verification of Shape, Size and Bag Properties
Authors: Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, Shengchao Qin
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates. To improve expressivity, we have proposed a prover that can automatically handle user-defined predicates. These shape predicates allow programmers to describe a wide range of data structures with their associated size properties. In the current work, we shall enhance this prover by providing support for a new type of constraints, namely bag (multiset) constraints. With this extension, we can capture the reachable nodes (or values) inside a heap predicate as a bag constraint. Consequently, we are able to prove properties about the actual values stored inside a data structure.
Performance Analysis of System of 3D Scenes Networked Parallel Dynamic Visualization
Authors: Dmitry Orlov
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Brief description of methods of parallelizing of dynamic 3D scenes visualization process is given. Performance analysis of experimental implementation of such system on the basis of multicomputer network was done. Theoretical estimation of performance of the system versus network bandwidth, image size, and graphics performance are done. The dependences obtained are confirmed experimentally.
Multilingual stochastic n-gram class language models
Authors: M. Jardino
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Stochastic language models are widely used in continuous speech recognition systems where a priori probabilities of word sequences are needed. These probabilities are usually given by n-gram word models, estimated on very large training texts. When n increases, it becomes harder to find reliable statistics, even with huge texts. Grouping words is a way to overcome this problem. We have developed an automatic language independent classification procedure, which is able to optimize the classification of tens of millions of untagged words in less than a few hours on a Unix workstation. With this language independent approach, three corpora each containing about 30 million words of newspaper texts, in French, German and English, have been mapped into different numbers of classes. From these classifications, bi-gram and tri-gram class language models have been built. The perplexities of held-out test texts have been assessed, showing that tri-gram class models give lower values than those obtained with tri-gram word models, for the three languages.
A framework for capturing, querying, and restructuring metadata in xml data
Authors: Curtis E. Dyreson
Venue:  (2005)

Metadata plays an important role in describing and proscribing data in both traditional and XML applications. This dissertation presents a framework to represent the metadata and maintain its consistency with the data in querying and restructuring XML data. The data model extension is called MetaDOM. MetaDOM separates data and metadata into different scopes and supports multiple levels of metadata (i.e. meta-metadata). The query language extension is called MetaXQuery. MetaXQuery is an extensible framework in which the special semantics of different kinds of metadata are specified as "plug-in" components. Each component is a set of simple, low-level operations. We first present the theoretical foundations of the framework. The framework shows how to utilize each metadata-specific component to retrieve, certify, sanitize, filter, group, and restructure data with metadata. We then show how to convert MetaXQuery expressions into low-level algebraic operators in MetaTAX and how to extend a native XML DBMS, namely eXist, to support the framework. The implementation judiciously reuses eXist's indexes and query evaluation engine to attain high efficiency. Finally, we setup a benchmark platform as well as a data/metadata generator to test the performance of our system for further optimization and development.
Pong: diagnosing spatio-temporal internet congestion properties
Authors: Leiwen Deng, Aleksandar Kuzmanovic
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

The ability to accurately detect congestion events in the Internet and reveal their spatial (i.e., where they happen?) and temporal (i.e., how frequently they occur and how long they last?) properties would significantly improve our understanding of how the Internet operates. In this paper we present Pong, a novel measurement tool capable of effectively diagnosing congestion events over short (e.g., ~100ms or longer) time-scales, and simultaneously locating congested points within a single hop on an end-to-end path at the granularity of a single link. Pong (i) uses queuing delay as indicative of congestion, and (ii) strategically combines end-to-end probes with those targeted to intermediate nodes. Moreover, it (iii) achieves high sampling frequency by sending probes to all intermediate nodes, including uncongested ones, (iv) dramatically improves spatial detection granularity (i.e., from path segments to individual links), by using short-term congestion history, (v) considerably enhances the measurement quality by adjusting the probing methodology (e.g., send 4-, 3-, or 2-packet probes) based on the observed path topology, and (vi) deterministically detects moments of its own inaccuracy. We conduct a large-scale measurement study on over 23,000 Internet paths and present their spatial-temporal properties as inferred by Pong.
Testability considerations in delay fault testing
Authors: Spyros Tragoudas
Venue:  (2006)

In recent years, delay testing has become a very important problem. This dissertation addresses three testability considerations namely, the power consumption, test quality and fault coverage in delay fault testing. The transition fault and the path delay fault models have been used for the purpose of studying these problems. Effective design automation techniques have been proposed using efficient data structures. The exponential number of path delay faults are handled non-enumeratively in all the proposed methods. Experimental results demonstrate the advantage of the proposed techniques over existing methods.
Software Project Management Tools: Making a Practical Decision Using AHP
Authors: Norita Ahmad, Phillip A. Laplante
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The selection of an appropriate software project management tool, as in the selection of many other tools, is often approached using an ad hoc process. Such non-rigorous approaches often based on personal preference, intuition, or marketing hype, can lead to an erroneous result. In this paper a rigorous model for selecting a software project management tool using the Analytical Hierarchy Process (AHP) is presented. The AHP provides a flexible, systematic, and repeatable evaluation procedure that can easily be understood by the decision maker in selecting the appropriate software project management tool. Several relevant factors based on the most common features offered by commercial off-the-shelf solutions (COTS) are used as the selection criteria in ranking the software project management tools. The contribution of this work is to apply a well-known decision making procedure in a novel way to help decision makers better identify an appropriate software project management tool without having to go through a more extensive evaluation process. In addition, this work establishes a framework for comparing individual product decisions across projects, project managers, organizational groups, and organizations.
Virtualized Reality: Perspectives on 4D Digitization of Dynamic Events
Authors: Takeo Kanade, P. J. Narayanan
Venue: IEEE Computer Graphics and Applications (2007)

Digitally recording dynamic events, such as a sports event, a ballet performance, and a lecture, for experiencing in a spatiotemporally distant and arbitrary setting requires 4D capture: three dimensions for their geometry and appearance over the fourth dimension of time. Cameras are suitable for this task as they are nonintrusive, universal, and inexpensive. Computer Vision techniques have advanced sufficiently to make the 4D capture possible. The authors present the process of 4D digitization of dynamic events with the Virtualized Reality system developed at CMU as the running example, together with a discussion on the general problem of digitizing dynamic events.
A novel fuzzy neural network: the vague neural network
Authors: Fang Rui, Zhao Yi-biao, Li Wei-sheng
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Fuzzy neural network that combines the artificial neural network and fuzzy logic is regarded as one of promising intelligent system. Based on fuzzy theory, fuzzy neural network has its problems: fuzzy membership function is a single value which combines the evidence for and against the pattern without indicating how much there is of which, hence it cannot get the more reasonable result of classification and recognition. Vague sets is characterized by a truth-membership function and a false-membership function which can solve the problem. Based on the idea of vague set theory, in this paper, a new kind of FNN: vague neuron network (VNN) is put forward, the properties are discussed. Then the VNN is applied to the problem of fault diagnosis and shows good performance.
Building the next generation of high performance computing researchers in engineering and science: the NCSA/ARL MSRC PET summer internship program
Authors: M. B. Walker
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign (UIUC) is lead academic institution for the Army Research Laboratory Major Shared Resource Center Programming Environment and Training Program (ARL MSRC PET). This program is part of the Department of Defense (DoD) high performance computing modernization program. ARL MSRC PET has a scientific advancement, outreach and training mission. With US-wide faculty and ARL engineers and scientists, the ARL MSRC PET training team offered its summer intern program in high performance computing (HPC) in 1998, 1999, and will again in 2000. It encourages young Americans to consider computer science and engineering careers in DoD and elsewhere. A program focus is outreach to under-represented minorities and women. Mentors and program administrators play a crucial role. The paper discusses the development of this innovative government-university collaborative education program and lessons learned for those wishing to establish similar programs to introduce young Americans to real-life HPC research and applications.
Scaling effects for electromagnetic vibrational power generators
Authors: Terence O&#x2019;Donnell, Chitta Saha, Steve Beeby, John Tudor
Venue: Microsystem Technologies (2007)

This paper investigates how the power generated by electromagnetic based vibrational power generators scales with the dimension of the generator. The effects of scaling on the magnetic fields, the coil parameters and the electromagnetic damping are presented. An analysis is presented for both wire-wound coil technology and micro-fabricated coils. The power obtainable from electromagnetic generators in the dimension range of 1&#x2013;10&#x00a0;mm is calculated. It is shown that the theoretical maximum power scales with the cube of the dimension. It is also shown that the high coil resistance associated with micro-coils severely restricts the power, which can be extracted.
Matched wavelets-their construction, and application to object detection
Authors: J. O. Chapa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Wavelets matched to features in an image can be used to detect and/or classify objects. In this paper, image object features are generated by projecting the object at a finite number of angles. Wavelets matched to the projected object features in a training image are used to detect similar objects in test images. The detection is shown to be shift and scale insensitive and rotation insensitive to the number of discrete angles used for the projections.
Isla Vista Heap Sizing: Using Feedback to Avoid Paging
Authors: Chris Grzegorczyk, Sunil Soman, Chandra Krintz, Rich Wolski
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Managed runtime environments (MREs) employ garbage collection (GC) for automatic memory manage- ment. However, GC induces pressure on the virtual memory (VM) manager, since it may touch pages that are not related to the working set of the application. Paging due to GC can significantly hurt performance, even when the application's working set fits into physical memory. We present a feedback-directed heap resizing mechanism to avoid GC-induced paging, using information from the operating system (OS). We avoid costly GCs when there is physical memory available, and trade off GC for pag- ing when memory is constrained Our mechanism is simple and uses allocation stall events during GC alone to trig- ger heap resizing, without user participation or OS kernel modification. Our system enables significant performance improvements when real memory is restricted and similar to, or better performance than, the current state-of-the-art MRE, when memory is unconstrained.
Self-Managed Systems: an Architectural Challenge
Authors: Jeff Kramer, Jeff Magee
Venue: 2007 Future of Software Engineering (2007)

Self-management is put forward as one of the means by which we could provide systems that are scalable, support dynamic composition and rigorous analysis, and are flexible and robust in the presence of change. In this paper, we focus on architectural approaches to self-management, not because the language-level or network-level approaches are uninteresting or less promising, but because we believe that the architectural level seems to provide the required level of abstraction and generality to deal with the challenges posed. A self-managed software architecture is one in which components automatically configure their interaction in a way that is compatible with an overall architectural specification and achieves the goals of the system. The objective is to minimise the degree of explicit management necessary for construction and subsequent evolution whilst preserving the architectural properties implied by its specification. This paper discusses some of the current promising work and presents an outline three-layer reference model as a context in which to articulate some of the main outstanding research challenges.
Quasi-Steady Vortex Tracking in Rotorcraft CFD on the Cray X1
Authors: YikLoon Lee
Venue: Proceedings of the HPCMP Users Group Conference (2006)

High-fidelity, far-field and economical blade vortex capturing, tracking and subsequent interaction is one of the most important aerodynamics problems in rotorcraft, particularly for heavy lift. Its solution is also one of the most difficult to obtain. This paper documents the use of multiple helical vortex tracking grids and development of an automated tracking technique to achieve this objective. This technique is tested on the interactional aerodynamics of a generic Quad Tilt Rotor (QTR). This paper also highlights the special issues that arise in the parallelization of an in-house overset CFD code using the one-sided communication model of Co-Array Fortran (CAF) implemented on the Cray X1E.
Implementation of multiple pagesize support in HP-UX
Authors: Indira Subramanian, Cliff Mather, Kurt Peterson, Balakrishna Raghunath
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

To reduce performance degradation from Translation Lookaside Buffer (TLB) misses without significant increase in TLB size, most modern processors implement TLBs that support multiple pagesizes. For example, Hewlett-Packard's PA-8000 processor allows 8 hardware pagesizes, in multiples of four, ranging from 4 Kbytes to 64 Mbytes. In implementing multiple pagesize support in HP-UX, we chose to create large pages at page-fault service time. We have a buddy system allocator that provides interfaces for allocating and freeing multiple pagesizes. We maintain the Virtual Memory (VM) data structures such as the pagetable entry, virtual page frame descriptor, and physical page frame descriptor based on the smallest pagesize, and represent a large pagesize as a collection of these base page-size structures. In our implementation, VM operations on a large pagesize such as 16KB are carried out by looping over the 4KB-based constituent VM data structures. Our system offers significant application performance improvement when using large pagesizes.
Gesture image sequence interpretation using the multi-PDM method and hidden Markov model
Authors: Chung-Lin Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper introduces a multi-principal-distribution-model (PDM) method and hidden Markov model (HMM) for gesture image sequence interpretation. To track the hand-shape, it uses the PDM model which is built by learning patterns of variability from a training set of correctly annotated images. For gesture recognition, we need to deal with a large variety of hand-shapes. Therefore, we divide all the training hand shapes into a number of similar groups, with each group trained for an individual PDM shape model. Finally, we use the HMM to determine model transition among these PDM shape models. From the model transition sequence, it can identify the continuous gestures denoting one-digit or two-digit numbers.
Process Profiling Using Frequencies of System Calls
Authors: Surekha Mariam Varghese, K. Poulose Jacob
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper we discuss our research in developing general and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that we can construct concise and accurate classifiers to detect anomalies. We provide an overview of the approach that we have implemented.
End-to-end authorization
Authors: Jon Howell, David Kotz
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Many boundaries impede the flow of authorization information, forcing applications that span those boundaries into hop-by-hop approaches to authorization. We present a unified approach to authorization. Our approach allows applications that span administrative, network, abstraction, and protocol boundaries to understand the end-to-end authority that justifies any given request. The resulting distributed systems are more secure and easier to audit. We describe boundaries that can interfere with end-to-end authorization, and outline our unified approach. We describe the system we built and the applications we adapted to use our unified authorization system, and measure its costs. We conclude that our system is a practical approach to the desirable goal of end-to-end authorization.
How to build a hard-to-use mouse
Authors: Florian 'Floyd' Mueller
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Computer games do not afford much physical activity and hence do not require significant energy expenditure, which can contribute to the prevalence of a sedentary lifestyle. A "hand exerciser" handgrip can help strengthen hand and forearm muscles through a simple spring mechanism. We are presenting the mousegrip, an exertion interface to control computer games while simultaneously exercising hand and arm muscles based on a handgrip device. Unlike conventional vision or accelerometer-based exertion interface devices, the mousegrip is very low-cost and supports cheap force-feedback through a simple spring mechanism. Due to its low cost, its mobile form factor and compatibility to existing mouse drivers, the mousegrip can augment traditional mouse interactions with an exertion activity to make exercising more enjoyable, and gameplay healthier. It provides a familiar affordance of interaction and supports increased calorie expenditure, hence contributing to people's fitness. We hope to encourage other researchers to incorporate exertion activity into their interfaces in order to support a healthy lifestyle.
Extending internet services Via LDAP
Authors: James E. Dutton
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

This project report examines the use of an LDAP (Lightweight Directory Access Protocol) V2 server to provide an easily accessible data storage facility. The main purpose of the LDAP database is to store related information based on a common thread such as a person's name, an organization's name, or the description of a service offered, in a simple yet hierarchical structure. The use of LDAP enables new fields to be added to existing user information to 1) enable end-users to store pertinent user information to be used by a mainframe-to-PC intermediary file server using Samba, 2) enable new groupings of electronic mail distributions to be created with little or no change to Sendmail, and 3) enhance the granularity of InterNetworkNews (Usenet) article submission acceptance capabilities. Some additional benefits of these facilities included using a single, non-proprietary database which required very little new coding to make use of. The data used for the various facilities were easily associated with database objects defined for enterprise personnel. The administration load for each service was reduced since service related data, such as userids or mailboxes, were not maintained directly as a part of the specific service. The Internet Directory Service, as provided by the LDAP server, is accessible by several methods, rather than just one specialized or proprietary interface.