ppxscal/embedding_network huggingface dataset:
The Role of Metadata for Data Warehousing
Authors: Martin Staudt, Anca Vaduva, Thomas Vetterli
Venue:  (1999)

Metadata has been identified as a key success factor in data warehouse projects. It captures all kinds of information necessary to extract, transform and load data from source systems into the data warehouse, and afterwards to use and interpret the data warehouse contents. This paper gives an overview about the role metadata plays for data warehousing and reviews existing standards, commercial solutions and research actions relevant to metadata management. It turns out that an overall solution for managing all metadata in a central or federated repository is still missing regarding a global metadata schema as well as system aspects and interoperability among involved tools producing metadata. The divergence of proposed standards will probably prevent a breakthrough within the near future.
Instructional Footprinting and Semantic Preservation in Linda
Authors: Kenneth D. Landry, James D. Arthur
Venue:  (1993)

Linda is a coordination language designed to support process creation and inter-process communication within conventional computational languages. Although the Linda paradigm touts architectural and language independence, it often suffers performance penalties, particularly on local area network platforms. Instructional Footprinting is an optimization technique with the primary goal of enhancing the execution speed of Linda programs. The two main aspects of Instructional Footprinting are instructional decomposition and code motion. This paper addresses the semantic issues encountered when the Linda primitive, IN and RD, are decomposed and moved past other Linda operations. Formal semantics are given as well as results showing significant speedup (as high as 64%) when Instructional Footprinting is used.
An Algorithm for Blob Hierarchy Layout
Authors: D. Harel, G. Yashchin
Venue:  (1999)

We present an algorithm for the aesthetic drawing of basic hierarchical blob structures, of the kind found in higraphs and statecharts and in other diagrams in which hierarchy is depicted as topological inclusion. Our work could also be useful in window system dynamics, and possibly also in things like newspaper layout, etc. Several criteria for aesthetics are formulated, and we discuss their motivation, our methods of implementation and the algorithm''s performance.
Predicting the Performance of Index Structures for High-Dimensional Datasets
Authors: C. Lang, A. Singh
Venue:  (1999)

We present two new models for predicting the number of index page accesses during nearest neighbor queries for high-dimensional datasets, a density-based model that depends weakly on the underlying index structure and results in coarser predictions, and a sampling-based model that depends strongly on the underlying index structure and gives more accurate predictions. We give detailed evaluations of both models and validate them experimentally by considering a number of synthetic and real datasets. We analyze the error in the models and illustrate how it can be minimized. As an application of our models, we show how the sampling-based model can be used to determine the optimal number of index dimensions for a high-dimensional dataset. Since existing models are tailored either to uniform datasets or to a small number of dimensions, this research makes a significant contribution to the understanding of high-dimensional multimedia data.
Concepts for a Database System Compiler
Authors: Don S. Batory
Venue:  (1988)

We propose a very simple formalism based on parameterized types and a rule-based algebra to explain the storage structures and algorithms of database management systems. Implementations of DBMSs are expressed as equations. If all functions referenced in the equations have been implemented, the software for a DBMS can be synthesized in minutes at little cost, in contrast to current methods where man-years of effort and hundreds of thousands of dollars are required. Our research aims to develop a DBMS counterpart to today''s compiler-compiler techniques.
Data mining based on rough sets
Authors: Jerzy W. Grzymala-Busse, Wojciech Ziarko
Venue: Data mining: opportunities and challenges (2003)

The chapter is focused on the data mining aspect of the applications of rough set theory. Consequently, the theoretical part is minimized to emphasize the practical application side of the rough set approach in the context of data analysis and model-building applications. Initially, the original rough set approach is presented and illustrated with detailed examples showing how data can be analyzed with this approach. The next section illustrates the Variable Precision Rough Set Model (VPRSM) to expose similarities and differences between these two approaches. Then, the data mining system LERS, based on a different generalization of the original rough set theory than VPRSM, is presented. Brief descriptions of algorithms are also cited. Finally, some applications of the LERS data mining system are listed.
RATE-PROPORTIONAL SERVERS: A DESIGN METHODOLOGY FOR FAIR QUEUEING ALGORITHMS
Authors: Dimitrios Stiliadis, Anujan Varma
Venue:  (1995)

Weighted Fair Queueing is considered as the ideal traffic scheduling algorithm in terms of its delay and fairness properties. Timestamp computations in a Weighted Fair Queueing scheduler serving N sessions have a time complexity of 0(N) per packet-transmission time, making its implementation difficult. Efforts in the past to simplify the implementation of Weighted Fair Queueing, such as Self-Clocked Fair Queueing, have resulted in degrading its isolation properties, thus affecting the delay bound. In this paper we present a class of scheduling algorithms - called Rate-Proportional Servers (RPS) - with bounds on end-to-end delays, buffer requirements and internal traffic burstiness equal to those of Weighted Fair Queueing. This class of algorithms is based on the notion of the potential associated with each connection sharing the same outgoing link, as well as, the system potential that tracks the progress of work in the system. We show that, depending on the implementation, different algorithms in the RPS class may have significantly different fairness properties. Network designers can use this methodology to implement efficient fair-queueing algorithms, balancing their fairness with implementation complexity. This work is completed in the sequel of this paper, where we present detailed implementations of two novel traffic scheduling algorithms with 0(1) timestamp computations, that exhibit the same delay and fairness properties as those of Weighted Fair Queueing.
Distress and restoration of an old building damaged by the 07.09.99 Athens earthquake
Authors: I. D. Lefas, V. N. Georgiannou
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The behaviour of an old two-storey house in a suburb of Athens damaged by the September 1999 earthquake has been analysed with the use of a powerful computer program. The results of the analysis are in agreement with the observed damage. The program was then used to analyze the package of remedial works recommended for the restoration and future use of the building.
PERFORMANCE EVALUATION OF BUFFERED SWITCHES INPACKET SWITCHING NETWORKS WITH MESH TOPOLOGIES
Authors: Anil K Sahai
Venue:  (1990)

The goal of this thesis is to evaluate the performance of buffered switches in regular mesh topology packet switching networks. The thesis consists of three parts. The first part presents a simulation model of a mesh topology packet switching network. The simulation results suggest that providing a small source and output buffer at switching nodes can significantly improve the total throughput of the network. We also investigate the performance of buffered switches in a Manhattan network, a particular case of mesh networks. We propose a design of a 2 X 2 packet switch and a routing protocol which limits to 3 the number of times a packet needs to be buffered in an arbitrary sized Manhattan network before reaching its destination. The second part presents an approximate method to compute the throughput, and average end-to-end delays in the network. This method is based on solving a system of recurrence equations using a fixed point iterative scheme. Comparison with the simulation results show that the approximations are sharp. The third part addresses blocking in tandem queues. Finite buffers can cause blocking in networks. The exact numerical solution of such networks very quickly becomes intactable due to the large state space. We study a speed-up technique to an approximate method for solving such networks. We find that our technique can speed-up the solution by an order of magnitude, especially for large networks. The major contributions of this thesis are: (1) an extensive simulation study which suggests that providing small buffers at the switching nodes can significantly improve the throughput in regular mesh topology networks; (2) proposed design of a packet switch and a routing protocol which limits the number of times a packet needs to be buffered in a Manhattan network; (3) analytical models to estimate the performance of regular mesh networks using both buffered and unbuffered packet switches; and (4) a study of a speed-up technique to one of the approximation methods for solving tandem queues with blocking.
A Stuttering-Robust Temporal Logic with ``Next'''' but without ``Previous''''
Authors: M. Marcus, A. Pnueli
Venue:  (1996)

The logic TLR, introduced in [1], is a temporal logic that is insensitive to stuttering but still possesses a well-defined next operator. Due to the combination of these two features, it presents an attractive foundation for studying refinement between reactive programs in a TL framework. A drawback of TLR is that completeness is achieved at the price of introducing the previous operator, as the only past operator, and is otherwise not used for specification or verification. This drawback is corrected in this paper which presents a pure future version of the logic, called FTLR, eliminating the previous operator. An alternative axiomatic system, not dependent on the removed operator, is presented and shown to be complete.
Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators
Authors: Mark W. Bailey, Jack W. Davidson
Venue:  (1995)

Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and correct compilers. Using formal specifications of procedure calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators: the procedure calling sequence generator. By exercising compilers with these target-specific test suites, our automated testing tool has been able to expose and isolate 8 bugs in heavily used production-quality compilers. These bugs cause more than 700 test cases to fail.
SWIFT: A STORAGE ARCHITECTURE FOR LARGE OBJECTS
Authors: Luis Cabrera, Darrell D. E. Long
Venue:  (1991)

Managing large objects with high data-rate requirements is difficult for current computing systems. We describe an Input/Output architecture, called Swift, that addresses the problem of storing and retrieving very large data objects from slow secondary storage at very high data-rates. Applications that require this capability are poorly supported in current systems, even though they are made possible by high-speed networks. These range from storage and visualization of scientific computations to recodring and play-back of color video in real-time. Swift addresses the problem of providing the data rates required by digital video by exploiting the available interconnection capacity and by using several slower storage devices in parallel. We have done two studies to validate the Swift architecture: a simulation study and an Ethernet-based proof-of-concept implementation. Both studies indicate that the aggregation principle proposed in Swift can yield very high data-rates. We present a brief summary of these studies. (Supersedes 89-04.)
Syntactic Recognition of Common cardiac Arrhythmias within Ambulatory ECG traces.
Authors: Arkell
Venue:  (1993)

Abstract unavailable. 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
High-Performance Matrix Multiplication Algorithms for Architectures withHierarchical Memories
Authors: John A. Gunnels, Greg M. Henry, Robert A. van de Geijn
Venue:  (2001)

During the last half-decade, a number of research efforts have centered around the development of software for generating automatically tuned matrix multiplication kernels. These include the PHiPAC project and the ATLAS project. The software products of both projects employ brute force to search a parameter space for blockings that accommodate multiple levels of memory hierarchy. We take a different approach. Using a simple model of hierarchical memories we employ mathematics to determine a locally-optimal strategy for blocking matrices. The theoretical results show that, depending on the shape of the matrices involved, different strategies are locally-optimal. Rather than determining a blocking strategy at library generation time, the theoretical results show that ideally one should pursue a heuristic that allows the blocking strategy to be determined dynamically at run-time as a function of the shapes of the operands. When the resulting family of algorithms is combined with a highly optimized inner-kernel for a small matrix multiplication, the approach yields performance that is superior to that of methods that automatically tune such kernels. Preliminary results, for the Intel Pentium (R) III processor, support the theoretical insights.
CP-Rays in Simplicial Cones
Authors: Leroy M. Kelly, Katta G. Murty, Layne T. Watson
Venue:  (1987)

In classical mathematics, interest in the concept of regularity of a triangle, is mainly centered on the property that for every interior point of the triangle, its orthogonal projection on the line containing each side must lie in the relative interior of that side. We generalize the concept of regularity using this property, and extend this work to simplicial cones in R^n, and derive very efficient necessary and sufficient conditions for this property to hold in them. We show that these concepts have important ramifications in algorithmic studies of the linear complementarity problem. We relate our results to other well known properties of square matrices.
Combining Workstations and Supercomputers to Support Grid Applications: The Parallel Tomography Experience
Authors: Shava Smallen, Walfredo Cirne, Jaime Frey, Fran Berman, Rich Wolski, Mei Su, Carl Kesselman, Steve Young, Mark Ellisman
Venue:  (2000)

Computational Grids are becoming an increasingly important and powerful platform for the execution of large-scale, resource-intensive applications. However, it remains a challenge for applications to tap the potential of Grid resources in order to achieve performance. In this paper, we illustrate how applications can leverage Grids to achieve performance through coallocation. We describe our experiences developing a scheduling strategy for a real-life parallel tomography application targeted to Grids which contain both workstations and parallel supercomputers. Our strategy uses dynamic information exported by a supercomputer''s batch scheduler to simultaneously schedule on workstations and immediately available supercomputer nodes. This strategy is of great practical interest because it combines resources available to the typical research lab: time-shared workstations and CPU time in remote space-shared supercomputers. We show that this strategy improves the performance of the parallel tomography application compared to traditional scheduling strategies, which target the application to either type of resource alone.
Will the Robot Do the Right Thing?
Authors: Ying Zhang, Alan K. Mackworth
Venue:  (1992)

Constraint Nets have been developed as an algebraic on-line computational model of robotic systems. A robotic system consists of a robot and its environment. A robot consists of a plant and a controller. A constraint net is used to model the dynamics of each component and the complete system. The overall behavior of the system emerges from the coupling of each of its components. The question posed in the title is decomposed into two questions: first, what is the right thing? second, how does one guarantee the robot will do it? We answer these questions by establishing a formal approach to the specification and verification of robotic behaviors. In particular, we develop a real-time temporal logic for the specification of behaviors and a new verification method, based on timed forall-automata, for showing that the constraint net model of a robotic system satisfies the specification of a desired global behavior of the system. Since the constraint net model of the controller can also serve as the on-line controller of the real plant, this is a practical way of building well-behaved robots. Running examples of a coordinator for a two-handed robot performing an assembly task and a reactive maze traveler illustrate the approach.
A Method for Assessing the Development Process of Small Organizations
Authors: Joel Henry, Susan L. Keenan, Michael A. Keenan, Sallie M. Henry
Venue:  (1992)

This paper describes a two-phase method for assessing the s.oftware development process of small organizations. The initial phase involves using the Software Engineering Institute (SEI) assessment method to establish the activities comprising the development process. The second phase consists of follow-up interviews to discover the implementation technique for each existing activity and investigate the effectiveness of the techniques. Procedures for generating recommendations are outlined. The data acquired is statistically valid and allows discovery of significant problem areas. Recommendations based on the SEI framework and accepted software engineering practices are described. The assessment method is evaluated and future work is outlined.
The Conical Methodology: A Framework for Simulation Model Development
Authors: Richard E. Nance
Venue:  (1987)

The Conical Methodology, intended for large discrete event simulation modeling, is reviewed from two perspectives. The designer perspectivebegins with the question: What is a methodology? From an answer to that question is framed an inquiry based on an objective/principles/attributes linkage that has proved useful in evaluating software development methodologies. The user perspective addresses the role of a methodology vis a vis the software utilities (the tools) that comprise the environment. Principles of a methodology form the needs analysis by which the requirements for tool design can be derived. A comparison with software development methodologies and some applications for the Conical Methodologies comprise the concluding summary.
Real-time Interactive Neuro-evolution
Authors: Adrian Agogino, Kenneth Stanley, Risto Miikkulainen
Venue:  (1998)

In standard neuro-evolution, a population of networks is evolved in the task, and the network that best solves the task is found. This network is then fixed and used to solve future instances of the problem. Networks evolved in this way do not handle real-time interaction very well. It is hard to evolve a solution ahead of time that can cope effectively with all the possible environments that might arise in the future and with all the possible ways someone may interact with it. This paper proposes evolving feedforward neural networks online to create agents that improve their performance through real-time interaction. This approach is demonstrated in a game world where neural-network-controlled individuals play against humans. Through evolution, these individuals learn to react to varying opponents while appropriately taking into account conflicting goals. After initial evaluation offline, the population is allowed to evolve online, and its performance improves considerably. The population not only adapts to novel situations brought about by changing strategies in the opponent and the game layout, but it also improves its performance in situations that it has already seen in offline training. This paper will describe an implementation of online evolution and shows that it is a practical method that exceeds the performance of offline evolution alone.
Geometric Performance Analysis of Periodic Behavior in Detail
Authors: Marc Abrams
Venue:  (1995)

A fundamental problem in designing parallel programs that achieve a desired performance goal is the ability to exactly analyze program performance, given a specification of the process synchronization structure and the execution timings of all code segments. This paper presents a novel performance analysis method based on geometry. Given a definition of program state, an execution of a program can be represented by a timed execution sequence (TES). A TES is a sequence of states that the program passes through in an execution, along with the duration of time spent in each state. In some parallel programs, all TESs that can arise in any execution contain a suffix that consists of the repetition of a finite sequence of states, excluding deadlocks and nondeterministic behavior. The repeated sequence is termed the limit cycle execution sequence. This paper derives, for all possible process starting times, a representation of the set of all possible limit cycle execution sequences in which a process blocks. The paper makes two contributions. First, it employs a novel analysis method to derive TESs from a geometric program execution model, using timed progress graphs (TPGs). TPGs represent the progress of each process by an axis in a Cartesian graph; process synchronization by line segments; and a TES by a direct, continuous path that does not cross a segment. Second, it solves for TESs in TPGs not by a computational geometric algorithm, as employed by most solutions in the literature to (untimed) progress graphs, but by an analytic solution.
On the Complexity of Commutativity Analysis
Authors: Oscar Ibarra, Pedro Diniz, Martin Rinard
Venue:  (1995)

Two operations commute if they generate the same result regardless of the order in which they execute. Commutativity is an important property --- commuting operations enable significant optimizations in the fields of parallel computing, optimizing compilers, parallelizing compilers and database concurrency control. Algorithms that statically decide if operations commute can be an important component of systems in these fields because they enable the automatic application of these optimizations. In this paper we define the commutativity decision problem and establish its complexity for a variety of basic instructions and control constructs. Although deciding commutativity is, in general, undecidable or computationally intractable, we believe that efficient algorithms exist that can solve many of the cases that arise in practice.