ppxscal/embedding_network huggingface dataset:
Modeling and Maintaining Multi-View Data Warehouses
Authors: I. Stanoi, D. Agrawal, A. E Abbadi
Venue:  (1999)

Data warehouses are designed mostly as centralized systems, and the majority of updating maintenance algorithms are tailored for this specific model. Maintenance methods have been proposed either under the assumption of a single view data warehouse, a multi-view centralized model, or a multi-view distributed system with strict synchronization restrictions. We argue that extending this model to a multi-view distributed one, is a practical generalization of the data warehouse system, but also the base of a growing number of applications based on the idea of cooperative views. In this context, existing maintenance protocols either solve the multi-view synchronization and consistency problem by grouping out of order updates in batches, or by creating multiple versions of the data. In this paper we develop a general framework for modeling the maintenance of multi-views in a distributed, decentralized data warehouse, together with an efficient incremental algorithm. To our knowledge, there is no other proposal for a method that incorporates individually and asynchronously updates to different views that are related through derivation dependencies.
Objekterkennung mittels Fourierdeskriptoren auf einem parallelenTransputersystem mit Videobus
Authors: Bernhard Lang, Axel Fenske, T. Ohlen, Hans Burkhardt
Venue:  (1993)

This paper presents a recognition system which allows the classification of planar objects independent from their spatial orientation using Fourier Descriptors. The extraction of features is based on the combination of the contour and the grey values. Thus objects with the same contour but different interior grey values may be distinguished. It should be emphasized that the proposed solution is object independent. For efficient execution the method is parallelized and mapped to a Transputer network. The system contains a switchable interconnection network based on Links for the algorithmic communications and a videobus for the real time distribution of the camera data among the parallel Transputer.
GEOMETRIC TRANSFORMATIONS FOR A RUBBER-BAND SKETCH (M.S. Thesis)
Authors: David J Staepelaere
Venue:  (1992)

The flexible rubber-band sketch is a useful representation for routing interconnect. In addition to supporting an incremental design style, rubber-bands provide a flexible framework for generating layout under performance constraints. However, due to reasons of compatibility between CAD tools, it may be necessary at times to convert a rubber-band sketch to a more restricted geometry such as rectilinear or octilinear wiring. This paper presents an efficient method, based on the enhanced plane sweep, for converting a rubber- band sketch to a topologically equivalent rectilinear or octilinear wiring with minimum wire length. A sketch with n rubber-band segments can be converted to a restricted geometry with m segments in O(n \log n + m) time. In addition to guaranteeing minimum wire length, the technique uses heuristic methods to reduce the total number of jogs.
Solvable Cases of the Travelling Salesman Problem
Authors: Paul C. Gilmore
Venue:  (1981)

This paper is a chapter in a book on the travelling salesman problem edited by Eugene L. Lawler, Jan Karel Lenstra and Alexander H.G. Rinooy Kan. By a solvable case of the travelling salesman problem is meant a case of the distance matrix for which a polynomial algorithm exists. In this paper several previously known special cases are related and extended. Further, an upper bound is obtained on the cost of an optimal tour for a broad class of matrices.
Self-Organizing Processes
Authors: Jurgen W. Meyer
Venue:  (1994)

Self-organizing feature maps are presented as an effcient tool for mapping process graphs onto processor networks. Arbitrary process graphs can be mapped to most of the common parallel architectures (two-dimensional lattice, three-dimensinal torus, hypercube, etc.). Two extensions of the Kohonen algorithm for self-organizing feature maps were necessary. A special graph metric allows the support of arbitrary process graphs and a modification of the learning rule added a load balancing facility. The order of computational complexity is restricted to O(m^3) (m denoting the number of processes) in the worst case. The method can be adapted to a wide variety of further graph mapping problems (e.g. circuit design, production planning, scheduling). 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
DIRECT VOLUME RENDERING VIA 3D TEXTURES
Authors: Orion Wilson, Allen VanGelder, Jane Wilhelms
Venue:  (1994)

The advent of very fast texture mapping hardware in modern graphics workstations has warranted research into rendering techniques that use texture mapping to full advantage. We have developed a new and easy to implement method for direct volume rendering that produces high-quality images at speeds approaching two orders of magnitude faster than existing techniques, on workstations with hardware support for three-dimensional texture maps. A rectilinear data set is converted into a three-dimensional texture map containing color and opacity information. In the rendering phase, the texture map is then applied to a stack of parallel planes, which effectively cut the texture into many slices. The slices are composited to form an image of the original data set. This paper describes the theory and implementation of this technique.
Concurrent-convergent strategy in IT consulting
Authors: Ziqi Liao, Michael Tow Cheung
Venue: Communications of the ACM (2003)

The concurrent-convergent strategy in IT consulting can be exploited to increase client efficiency, to draw conceptual and practical lessons for other information-based applications, and to develop synergy between IT consulting and business process reengineering.
On the Expressive Power of Z
Authors: Peter Baumann, Karl Lermer
Venue:  (1995)

The formal specification language Z is successfully used to specify transformational programs. Complex systems can only be adequately modeled by infinite sequences of states. In this paper we develop a systematic approach to use standard Z to specify complex systems by adapting central ideas of TLA to Z.
Architecture of an Object-Oriented Expert System for COmposite Document Analysis, Representation, and Retrieval
Authors: Edward A. Fox, Robert K. France
Venue:  (1986)

The CODER project is a multi-year effort to investigate how best to apply artificial intelligence methods to increase the effectiveness of information retrieval systems when handling collections of composite documents. In order to ensure system adaptability and to allow reconfiguration for controlled experimentation, the project has been designed as an expert system. The use of individually tailored specialist experts coupled with standardized blackboard modules for communication and internal and external knowledge bases for managing effective knowledge allows for quick prototyping, incremental development and flexibility under change. The system as a whole is structured as a set of communicating modules, designed under an object-oriented paradigm and implemented under UNIX™ using pipes and the TCP/IP protocol. Inferential modules are being coded in MU-Prolog; non-inferential modules are being prototyped in MU-Prolog and will be re-implemented as needed in C++.
A Comparative Evaluation of Indexing Schemes
Authors: Comarapalyam K. Guru Prasad, John W. Roach
Venue:  (1990)

An empirical experment is reported that compares three indexing techniques used to help answer queries for a medium-sized database. The experiment compares memory and time utilization for B+ trees, superimposed codeword and perfect hashing indexing techniques. Costs for creating and querying the database are compared over a range at different page and buffer sizes for the database. We compare and contract the advantages and disadvantages of the indexing techniques.
Alloyed Branch History: Combining Global and Local Branch History for Robust Performance
Authors: Zhijian Lu, John Lach, Mircea R. Stan, Kevin Skadron
Venue:  (2002)

This paper introduces "alloyed" prediction, a new two-level predictor organization that combines global and local history in the same structure, combining the advantages of two-level predictors and hybrid predictors. The alloyed organization is motivated by measurements showing that "wrong-history mispredictions" are even more important than conflict-induced mispredictions. Wrong-history mispredictions arise because current two-level, history-based predictors provide only global or only local history. The contribution of wrong-history to the overall misprediction rate is substantial because most programs have some branches that require global history and others that require local history. This paper explores several ways to implement alloyed prediction, including the previously proposed bi-mode organization. Simulations show that "mshare" is the best alloyed organization among those we examine, and that mshare gives reliably good prediction compared to bimodal ("two-bit"), two-level, and hybrid predictors. The robust performance of alloying across a range of predictor sizes stems from its ability to attack wrong-history mispredictions at even very small sizes without subdividing the branch predictor into smaller and less effective components.
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
Authors: Idit Keidar, Jeremy Sussman, Keith Marzullo, Danny Dolev
Venue:  (1999)

We describe a novel scalable group membership algorithm designed for wide area networks (WANs). Our membership service does not evolve from existing LAN-oriented membership services; it was designed explicitly for WANs. Our algorithm provides agreement on membership in a single message round in most cases, yielding a low message overhead. It avoids flooding the network and uses a scalable failure detection service designed for WANs. Furthermore, our algorithm avoids notifying the application of obsolete membership views when the network is unstable, and yet it converges when the network stabilizes. In contrast to most group membership services, we separate membership maintenance from reliable communication in multicast groups: membership is not maintained by every process, but only by dedicated servers. The membership servers are not involved in the communication among the members of the groups. This design makes our membership service scalable in the number of groups supported, in the number of members in each group, and in the topology spanned by each group. Our service is complemented by a virtually synchronous communication service which provides clients with full virtual synchrony semantics.
Classification-Based Hybrid Branch Prediction (Thesis)
Authors: Juang Philo
Venue:  (2000)

One of the largest limiting factors in microprocessor instruction execution throughput is the existence of conditional branches in the instruction stream. Conditional branches disrupt the normal control flow of a program by introducing irregularities; instead of a natural, steady progression, conditional branches order the processor to "jump" to different places in the instruction stream. These irregularities force the processor to stall while the target to jump to is resolved. The most common solution utilizes a branch predictor in conjunction with speculative execution to accelerate processing. First, the branch predictor attempts to forecast where the target of the branch is; it then immediately begins processing the instruction stream at that target. When the real target is finally resolved, if the processor was correct, then the effects of the disruption have been mitigated. Unfortunately, branch mis-predictions do occur, and the penalty for mis-predicting may be very high. Current branch predictors invest quite a bit of logic in sophisticated, general purpose constructs designed to handle all branches in the instruction stream. While effective, a more efficient method of attack is to split the branches into distinct sets and direct them to a specialized branch predictor most suited to that particular type. This paper proposes to divide branches into sets based on complexity. Instead of one general purpose predictor, it is expected that this hybrid branch predictor will produce higher accuracy with the same amount of resources. Furthermore, this thesis will show the impact of several classes of branches on the overall accuracy of the branch predictor. These branches fall into several categories: constant and almost constant, infrequent, repeating pattern, and iterative. These branches can be accurately predicted with a smaller branch predictor than typical general purpose predictors. Each branch class will be removed from the instruction stream to examine its impact on overall accuracy. It is anticipated that removing one or more of these classes will improve overall accuracy. These types of branches will then be assigned a specialized predictor. The combination of multiple specialized predictors should contribute not only to improving the accuracy of their own branches but also in reducing the pollution of the "normal" branch predictor. 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
The Computer and the State
Authors: Richard S. Rosenberg
Venue:  (1981)

It is obviously difficult (if not impossible) to predict the impact on society of technological innovation. However, it is clear that such major events as the industrial revolution recreate society in a profound and enduring manner. In our own time, the development of the computer promises to transform dramatically the major industrial countries of the world. The resulting effects on the so-called Third World countries will hardly be less significant. .br The purpose of this paper is twofold. First, we wish to catalogue many of the ways computers have affected and are likely to affect our daily lives. A second purpose is to employ this analysis to explore the effect of the massive ``computerization'''' of society on a number of its institutions. It is hoped that the material provided will be useful to those whose major concern is the evolution of the modern state in response to technological innovation.
Behaviour of landfill liners under earthquake loading
Authors: S. P. G. Madabhushi, S. Singh
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Behaviour of landfills under earthquake loading is a major concern especially when the landfills are located in the vicinity of densely inhabited areas. This paper aims at understanding the failure mechanisms of landfill liner systems following earthquake loading with emphasis on the landfills underlain by liquefiable soils. A model clay liner was subjected to earthquake loading at 50g's. Following the earthquake loading partial liquefaction of the foundation soil was achieved. From the results of the centrifuge tests presented here it will be shown that the breaching of the clay liner has been achieved following liquefaction of foundation soil. Matlab based contouring routines are used to investigate the generation and redistribution of excess pore water pressures in the foundation soil.
Using Dynamic Configurability to Support Object-Orientation in Legion
Authors: Michael J. Lewis, Andrew S. Grimshaw
Venue:  (1996)

Wide area distributed object systems will require mechanisms for creating, describing, and managing objects. The mechanisms must be scalable and must not mandate particular policies or algorithms because users will have different cost, security, performance, and functionality demands. Legion is a wide area distributed object system that supports this requirement using a first-class active class system. A Legion class is an active Legion object that manages its instances, provides their system-level support, and defines their behavior. To enable encapsulation and code reuse, and to simplify the requirements of many Legion programmers, Legion classes can be shared among Legion objects. To support instances that outlive the program that creates them, classes are persistent. To enable scalability, classes are distributed throughout the system. Shared, persistent, active, distributed (SPAD) class systems have many benefits for wide area distributed object systems such as Legion. But supporting traditional class roles, including instantiation and inheritance, requires new and different implementation solutions. This paper describes one way to support object-oriented languages and systems in the Legion SPAD class system. Our method is based on dynamic configurability of objects and classes. We describe dynamic configurability, motivate the need for new implementation solutions for a SPAD class system, describe the implementation of our solution, and illustrate its functionality with an example.
Adapting Protocols to Massively Interconnected Systems
Authors: Dennis G. Kafura, Marc Abrams
Venue:  (1991)

This paper describes ongoing research focused on two critical problems posed by the interconnection of a massive number of computer systems. The interconnection may be achieved through wide area or local area networks. The two problems considered in this research are as follows: (1) performance analysis of the protocols used in an internetwork connecting thousands to millions of nodes, and (2) application development in a massively distributed, heterogeneous environment where components implemented in different programming languages must be integrated and/or reused. The performance analysis problem is addressed by employing large-scale parallel simulation, extended finite state machines and objected-oriented simulation techniques. The approach to solving the application development problem is based on an environment which exploits the synergism between object-oriented programming and layered communication protocols (specifically, OSI).
Investigation of speech and speaker recognition based on trajectory modelling of utterances
Authors: W. J. Tey, N. P. Jong, Roberto Togneri
Venue:  (1996)

We present in this paper a modelling technique used to capture the dynamic and temporal behaviour of transitions between phonemes. This model relies on the trajectory instead of the geometrical position of the observations in the parameter space. Transition based models provide an alternative method for acoustic-phonetic modelling of the speech signal. In our modelling technique, the trajectory is modelled by regression analysis of low-order polynomials followed by statistical clustering of these coefficients. This technique is used for both speech recognition as well as speaker recognition. Results on a small trial set of isolated alphabet sounds and speakers for both speech and speaker recognition are presented. The speech recognition rate using the trajectory model is found comparable to traditional HMM modelling. However, the poor results for the speaker identification suggest that the current trajectory model is not suitable for this recognition task.
Recognition Using Region Correspondences
Authors: R. Basri, D. Jacobs
Venue:  (1995)

Recognition systems attempt to recover information about the identity of the observed objects and their location in the environment. A fundamental problem in recognition is the following. Given a correspondence between some portions of an object model and some portions of an image, determine whether the image contains an instance of the object, and, in case it does, determine the transformation that relates the model to the image. The current approaches to this problem are divided into methods that use ``global'''' properties of the object (e.g., centroid and moments of inertia) and methods that use ``local'''' properties of the object (e.g., corners and line segments). Global properties are sensitive to occlusion and, specifically, to self occlusion. Local properties are difficult to locate reliably, and their matching involves intensive computation. A novel method for recognition that uses region information is presented. In our approach the model is divided into volumes, and the image is divided into regions. Given a match between subsets of volumes and regions (without any explicit correspondence between different pieces of the regions) the alignment transformation is computed. The method applies to planar objects under similarity, affine, and projective transformations and to projections of 3-D objects undergoing affine and projective transformations. The new approach combines many of the advantages of the previous two approaches, while avoiding some of their pitfalls. Like the global methods, our approach makes use of region information that reflects the true shape of the object. But like local methods, our approach can handle occlusion.
Mathematical reasoning in software engineering education
Authors: Peter B. Henderson
Venue: Communications of the ACM (2003)

Discrete mathematics, especially logic, plays an implicit role in software engineering similar to the role of continuous mathematics in traditional physically based engineering disciplines.
Theoretical study of anisotropic laminated shells with shear deformation
Authors: I. N. Kwun, J. Y. Kim, T. J. Kwun
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Various laminates consisting of thin, unidirectional layers may be achieved by laying up laminae in different reinforcement directions and stacking sequences. Thus, the behavior of nonhomogeneous, anisotropic laminated structures is quite different from that of isotropic ones. In this paper, the governing equations for anisotropic laminated shell including the effects of transverse shear deformation is derived. And then, by using closed-form solutions for shallow shells having simple supported boundary, extensive numerical study for anisotropic laminated shells were made to investigate the stacking sequence effects for hyperbolic paraboloidal shells, cylindrical shells and spherical shells. Also, static analysis is carried out for cross-ply laminated shells considering the effects of various geometrical parameters, e.g., the ratio of length-to-radius, length-to-thickness. The results are compared with existing one and show good agreement.