ppxscal/embedding_network huggingface dataset:
Analyzing the Impact of Overlap, Offload, and Independent Progress for Message Passing Interface Applications
Authors: Ron Brightwell Rolf Riesen
Venue: International Journal of High Performance Computing Applications (2005)

The overlap of computation and communication has long been considered to be a significant performance benefit for applications. Similarly, the ability of the Message Passing Interface (MPI) to make independent progress (that is, to make progress on outstanding communication operations while not in the MPI library) is also believed to yield performance benefits. Using an intelligent network interface to offload the work required to support overlap and independent progress is thought to be an ideal solution, but the benefits of this approach have not been studied in depth at the application level. This lack of analysis is complicated by the fact that most MPI implementations do not sufficiently support overlap or independent progress. Recent work has demonstrated a quantifiable advantage for an MPI implementation that uses offload to provide overlap and independent progress. The study is conducted on two different platforms with each having two MPI implementations (one with and one without independent progress). Thus, identical network hardware and virtually identical software stacks are used. Furthermore, one platform, ASCI Red, allows further separation of features such as overlap and offload. Thus, this paper extends previous work by further qualifying the source of the performance advantage: offload, overlap, or independent progress.
Semialgebraic complexity of functions
Authors: Y. Yomdin
Venue: Journal of Complexity (2005)

In this paper we study the rate of the best approximation of a given function by semialgebraic functions of a prescribed "combinatorial complexity". We call this rate a "Semialgebraic Complexity" of the approximated function. By the classical Approximation Theory, the rate of a polynomial approximation is determined by the regularity of the approximated function (the number of its continuous derivatives, the domain of analyticity, etc.). In contrast, semialgebraic complexity (being always bounded from above in terms of regularity) may be small for functions not regular in the usual sense. We give various natural examples of functions of low semialgebraic complexity, including maxima of smooth families, compositions, series of a special form, etc. We show that certain important characteristics of the functions, in particular, the geometry of their critical values (Morse-Sard Theorem) are determined by their semialgebraic complexity, and not by their regularity.
A generative framework for real time object detection and classification
Authors: Ian Fasel, Bret Fortenberry, Javier Movellan
Venue: Computer Vision and Image Understanding (2005)

We formulate a probabilistic model of image generation and derive optimal inference algorithms for finding objects and object features within this framework. The approach models images as a collage of patches of arbitrary size, some of which contain the object of interest and some of which are background. The approach requires development of likelihood-ratio models for object versus background generated patches. These models are learned using boosting methods. One advantage of the generative approach proposed here is that it makes explicit the conditions under which it is optimal. We applied the approach to the problem of finding faces and eyes on arbitrary images. Optimal inference under the proposed model works in real time and is robust to changes in lighting, illumination, and differences in facial structure, including facial expressions and eyeglasses. Furthermore, the system can simultaneously track the eyes and blinks of multiple individuals. Finally we reflect on how the development of perceptive systems like this may help advance our understanding of the human brain.
Integrating heterogeneous data warehouses using XML technologies
Authors: Frank S.C. Tseng, Chia-Wei Chen
Venue: Journal of Information Science (2005)

Data warehousing has been widely adopted by contemporary enterprises. For inter-organizational information sharing, the need cannot be over-emphasized to conduct researches on the integration of heterogeneous data warehouses to overcome the challenging situations today. That makes it urgent to establish a systematic integration methodology for integrating heterogeneous data warehouses via the Internet or proprietary extranets. Traditionally, researchers usually employed a canonical format as the integration medium for logical data integrations among heterogeneous systems. In this paper, to fully utilize the power of the Internet, we propose a framework and develop a prototype to integrate heterogeneous data warehouses by XML technologies. We first formally define the elements in data warehousing and discuss various semantic conflicts occurring among heterogeneous data cubes. Then, we propose the system architecture and related resolution procedures for all kinds of semantic conflicts. For local data cubes with different schemas, we define a global XML Schema to integrate the local cube structures, and transform each local cube respectively into an XML document conforming to the global XML Schema. These transformed XML documents obtained from local cubes will be manipulated by pre-defined XQuery commands to form a unified XML document, which can be regarded as the global cube. The integrated global cube can be easily stored and manipulated in native XML databases. The proposed methodology enables global users to browse or pose multi-dimensional expressions (MDX) on the global cube to obtain a result in the same way as they perform locally.
A comparison of global gene expression measurement technologies in Arabidopsis thaliana: Conference Reviews
Authors: Sean J. Coughlan, Vikas Agrawal, Blake Meyers
Venue: Comparative and Functional Genomics (2004)

Microarrays and tag-based transcriptional profiling technologies represent diverse but complementary data types. We are currently conducting a comparison of high-density in situ synthesized microarrays and massively-parallel signature sequencing (MPSS) data in the model plant, Arabidopsis thaliana. The MPSS data (available at ) and the microarray data have been compiled using the same RNA source material. In this review, we outline the experimental strategy that we are using, and present preliminary data and interpretations from the transcriptional profiles of Arabidopsis leaves and roots. The preliminary data indicate that the log ratio differences of transcripts between leaves and roots measured by microarray data are in better agreement with the MPSS data than the absolute intensities measured for individual microarrays hybridized to only one of the cRNA populations. The correlation was substantially improved by focusing on a subset of genes excluding those with very low expression levels; this selection may have removed noisy data. Future reports will incorporate more than 10 tissues that have been sampled by MPSS. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Visualization of mappings between schemas
Authors: George G. Robertson, Mary P. Czerwinski, John E. Churchill
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper we describe a novel approach to the visualization of the mapping between two schemas. Current approaches to visually defining such a mapping fail when the schemas or maps become large. The new approach uses various information visualization techniques to simplify the view, making it possible for users to effectively deal with much larger schemas and maps. A user study verifies that the new approach is useful, usable, and effective. The primary contribution is a demonstration of novel ways to effectively present highly complex information.
Absolute Stability Criteria for a Generalized Lur'e Problem with Delay in the Feedback
Authors: A. A. Zevin, M. A. Pinsky
Venue: SIAM Journal on Control and Optimization (2005)

A nonautonomous linear system controlled by a nonlinear sector-restricted feedback with a time-varying delay is considered. Delay-independent sufficient conditions for absolute stability and instability (expressed in the transfer function of the linear part and the sector bounds) are established. For a system with an exponentially stable linear part, an upper bound for the Lyapunov exponent is found. It is shown that if the transfer function is sign-constant, asymptotic stability of the system with the margin-linear feedback guarantees absolute stability of the considered system; thus, such systems satisfy the known Aizerman conjecture. They include, in particular, a closed-loop system consisting of any number of time-varying first order links and feedback with arbitrary delay. Under some additional condition (which is certainly true for a time-invariant linear block), the obtained stability criterion is precise. The approach employed in the proofs is based on a direct analysis of the corresponding Volterra equation which contains only the transfer function of the linear block and, therefore, embraces a wide range of control systems. As an example, a second order system is considered; it is shown that here the obtained stability bound is reached for a linear feedback with a periodic delay function.
Floorplan assisted data rate enhancement through wire pipelining: a real assessment
Authors: Mario R. Casu, Luca Macchiarulo
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

The recent shift towards wire pipelining (WP) mandated by technological factors has attracted attention towards latency-controlled floorplanning. However, no systematic study has been published so far that takes into account block and logic delay limitations. The present workaims at filling the gap by showing that blockdelay can limit and possibly prevent any real gain WP might promise. Recurring to adaptive WP schemes, on the other hand, allows relevant gains. We built floorplanner that optimizes for maximum data rate, taking into account various models of block delay, and compares them to the optimal results obtained when no wire pipelining is employed. Experiments with suitable floorplanning benchmarks and case studies are performed to substantiate theoretical intuitions.
SRI International: description of the FASTUS system used for MUC-4
Authors: Jerry R. Hobbs, Douglas Appelt, Mabry Tyson, John Bear, David Israel
Venue: Proceedings of the 4th conference on Message understanding (1992)

FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting information from free text in English, and potentially other languages as well, for entry into a database, and potentially for other applications. It works essentially as a cascaded, nondeterministic finite state automaton.
A new scheme on privacy preserving association rule mining
Authors: Nan Zhang, Shengquan Wang, Wei Zhao
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We address the privacy preserving association rule mining problem in a system with one data miner and multiple data providers, each holds one transaction. The literature has tacitly assumed that randomization is the only effective approach to preserve privacy in such circumstances. We challenge this assumption by introducing an algebraic techniques based scheme. Compared to previous approaches, our new scheme can identify association rules more accurately but disclose less private information. Furthermore, our new scheme can be readily integrated as a middleware with existing systems.
Parsing and Semantic Modelling for Software Engineering Applications
Authors: Warwick Irwin, Carl Cook, Neville Churcher
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The ability to parse source code, in order to extract information from it, is an essential element of software engineering research and practice. However, serious practical difficulties often arise from factors such as ambiguities in standard grammars and inflexible parsing tools. For example, substantial changes to standard grammars may be needed in order to meet the limitations of parsing engines; this threatens the accuracy, completeness and consistency of the information available. Good parsing on its own is not enough: an inadequate semantic model limits the information available to tool builders. In our work, we have developed an approach to parsing and semantic modelling which addresses issues such as these. Our approach is based on a more flexible LR parser generator which includes the use of Generalised LR (GLR) parsing to accommodate ambiguous grammars. This allows us to decouple syntactic and semantic analysis. In this paper, we present our parser generator, yakyacc, and our semantic model for Java, JST, and discuss the benefits of their use in software engineering research. The resulting parsers may be used in a variety of contexts, either as the basis for integrated applications or as components in an application pipeline containing a number of other tools. We illustrate the benefits of our approach with representative examples from two of our current software engineering research projects.
WaldBoost " Learning for Time Constrained Sequential Detection
Authors: Jan Sochman, Jiri Matas
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of sequential decision-making. If the false positive and false negative error rates are given, the optimal strategy in terms of the shortest average time to decision (number of measurements used) is the Waldýs sequential probability ratio test (SPRT). We built on the optimal SPRT test and enlarge its capabilities to problems with dependent measurements. We show how to overcome the requirements of SPRT ¿ (i) a priori ordered measurements and (ii) known joint probability density functions. We propose an algorithm with near optimal time and error rate trade-off, called WaldBoost, which integrates the AdaBoost algorithm for measurement selection and ordering and the joint probability density estimation with the optimal SPRT decision strategy. The WaldBoost algorithm is tested on the face detection problem. The results are superior to the state-of-the-art methods in the average evaluation time and comparable in detection rates.
Layered Protocols Approach to Analyze Haptic Communication over a Network
Authors: H. A. van Essen, A. F. Rovers
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A Layered Protocols interaction model to describe haptic communication between two persons over a network is presented. This approach allows to consider all aspects of the haptic communication process: The intention to do an action, limitations of the human body, the communication device, and the network. The goal of the model is threefold, firstly it is a tool to identify problems and opportunities in existing haptic interaction projects, secondly it directs to solution areas of these problems and opportunities, and thirdly it aids to propose design guidelines for new devices for haptic interaction. We show that the model can be used during the synthesis of devices. As a first step in this process, existing communication devices are being analyzed and classified. Their strong and weak points are identified and linked to signals in the model. In the future, this should result in a set of design guidelines for haptic communication devices.
On an Extension of Condition Number Theory to Nonconic Convex Optimization
Authors: Robert M. Freund, Fernando Ordóñez
Venue: Mathematics of Operations Research (2005)

The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization:z *? min x c t x, s.t.Ax-b ? C Y ,x ? C X ,to the more general nonconic format:z *? min x c tx, ( GP d ) s.t.Ax - b ? C Y ,x ? P,whereP is any closed convex set, not necessarily a cone, which we call the ground-set. Although any convex problem can be transformed to conic form, such transformations are neither unique nor natural given the natural description of many problems, thereby diminishing the relevance of data-based condition number theory. Herein we extend the modern theory of condition numbers to the problem format ( GP d ). As a byproduct, we are able to state and prove natural extensions of many theorems from the conic-based theory of condition numbers to this broader problem format.
Stable hp mixed finite elements based on the Hellinger-Reissner principle
Authors: Manil Suri
Venue: Journal of Computational and Applied Mathematics (2005)

In the Hellinger-Reissner formulation for linear elasticity, both the displacement u and the stress σ are taken as unknowns, giving rise to a saddle point problem. We present new pairings of quadrilateral 'trunk' finite element spaces for this method and prove stability (and optimality) in terms of both h and p. The effect of mesh shape regularity on the stability constant is explicitly tracked. Our results provide a theoretical basis for recent numerical experiments (in the context of a mixed p formulation for viscoelasticity) that showed these spaces worked well computationally.
Morphological Pyramids in Multiresolution MIP Rendering of Large Volume Data: Survey and New Results
Authors: Jos B. Roerdink
Venue: Journal of Mathematical Imaging and Vision (2005)

We survey and extend nonlinear signal decompositions based on morphological pyramids, and their application to multiresolution maximum intensity projection (MIP) volume rendering with progressive refinement and perfect reconstruction. The structure of the resulting multiresolution rendering algorithm is very similar to wavelet splatting. Several existing classes of pyramids are discussed, and their limitations indicated. To enhance the approximation quality of visualizations from reduced data (higher levels of the pyramid), two approaches are explored. First, a new class of morphological pyramids, involving connectivity enhancing operators, is considered. In the pyramidal analysis phase, a conditional dilation operator is used, with a given number n of iterations. The corresponding pyramids for n = 0 and n = 1 are known as the adjunction pyramid and Sun-Maragos pyramid, respectively. We show that the approximation quality when rendering from higher levels of the pyramid does increase as a function of the number of iterations n of the conditional dilation operator, but the improvement for n > 1 is limited. The second new approach, called streaming MIP-splatting, again starts from the adjunction pyramid. The new element is that detail coefficients of all levels are considered simultaneously and are resorted with respect to decreasing magnitude of a suitable error measure. All resorted coefficients are projected successively, until a desired accuracy of the resulting MIP image is obtained. We show that this method outperforms the previous methods based on morphological pyramids, both with respect to image quality with a fixed amount of detail data, and in terms of flexibility of controlling approximation error or computation time.
Performance evaluation and tuning of GRAPE-6 - towards 40 "real" Tflops
Authors: Junichiro Makino, Eiichiro Kokubo, Toshiyuki Fukushige
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

In this paper, we describe the performance characteristics of GRAPE-6, the sixth-generation special-purpose computer for gravitational many-body problems. GRAPE-6 consists of 2048 custom pipeline chips, each of which integrates six pipeline processors specialized for the calculation of gravitational interaction between particles. The GRAPE hardware performs the evaluation of the interaction. The frontend processors perform all other operations, such as the time integration of the orbits of particles, I/O, on-the-fly analysis etc. The theoretical peak speed of GRAPE-6 is 63.4 Tflops. We present the result of benchmark runs, and discuss the performance characteristics. We also present the measured performance for a few real scientific applications. The best performance so far achieved with real applications is 35.3 Tflops.
E-motional advantage: performance and satisfaction gains with affective computing
Authors: Lesley Axelrod, Kate Hone
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Emotions are now recognized as complex human control systems, crucial to decision making, creativity, playing and learning. Affective technologies may offer improved interaction and commercial promise. In the past, research has focused on technical development work, leaving many questions about user preferences unanswered. For this user-centered study, 60 participants played a simple 'word ladder' game under different controlled conditions. Using 2 x 2 factorial design, and a Wizard of Oz scenario, half the participants interacted with a system that adapted on the basis of the user's emotional expression and half were told the system could react to their emotional expressions. We established that when using an apparently affective system, users perform significantly better and report themselves as feeling significantly happier. We also discuss behavioral responses to the different conditions. These results are relevant to the design of future affective systems.
A Pattern-Based Domain Partition Approach to Parallel Optical Proximity Correction in VLSI Designs
Authors: Shao-Ming Yu, Yiming Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

A novel parallel optical proximity correction (OPC) technique is proposed for process distortion compensation of layout mask in design and fabrication of very large scale integration (VLSI) circuits. Based on a genetic algorithm (GA), rule- and model-based correction methods, and domain decomposition algorithms, a parallel OPC system is successfully developed for the layout mask correction of VLSI circuits on a Linux-based PC cluster with the message passing interface (MPI) libraries. Tested on several layout patterns, the implemented pattern-based partition scheme shows good accuracy for the OPC-corrected layout mask of VLSI designs. Computational and parallel benchmarks, such as speedup and efficiency, are achieved and exhibit excellent performance of the developed system. Our approach provides an alternative in developing advanced computer aided design (CAD) tools and benefits design and fabrication of system-on-chip (SoC).