ppxscal/embedding_network huggingface dataset:
Designing a Non-intrusive Monitoring Tool for Developing Complex Distributed Applications
Authors: Wanqing Wu, Rajiv Gupta, Madalene Spezialetti
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The development of a distributed application that exhibits both desired functionality as well as performance is a complex task. Therefore the construction of monitoring tools to assist in the development of complex distributed applications is of great practical significance. Monitoring tools can be used to observe the behavior and fine tune the performance of an application. One of the fundamental problems that must be addressed in order to construct an effective monitoring tool is to ensure that the tool is able to report the true behavior of an application, that is, it is able to monitor the application non-intrusively. In order to do so we must avoid the affects of monitoring on the outcomes of non-deterministic aspects of a computation, including non-determinism introduced explicitly by the application programmer and non-determinism in the scheduling of application processes. We present protocols that enable the preservation of the overall program behavior.
EER-ConcepTool: A "Reasonable" Environment for Schema and Ontology Sharing
Authors: Helmut Meisel, Ernesto Compatangelo
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

We propose a system which supports knowledge sharing through the articulation of the overlapping components in two or more schemas or ontologies. EER-CONCEPTOOL uses Description Logics (DLs) to formalise and capture some relevant features of knowledge described using an Enhanced Entity-Relationship (EER) model. We describe how DL-based reasoning can provide a relevant part of the semi-automated deductive support needed to specify the articulation (i.e. the shared content) of two EER knowledge bases. We also show how a more effective level of support can be provided by the EER-CONCEPTOOL architecture, which combines DL-based deductions with lexical analysis and heuristic inferences. We illustrate the approach to knowledge articulation in our system by way of an example.
Efficient Parallel Algorithms for Closest Point Problems
Authors: Peter Su
Venue:  (1994)

This dissertation develops and studies fast algorithms for solving closest point problems. Algorithms for such problems have applications in many areas including statistical classification, crystallography, data compression, and finite element analysis. In addition to a comprehensive empirical study of known sequential methods, I introduce new parallel algorithms for these problems that are both efficient and practical. I present a simple and flexible programming model for designing and analyzing parallel algorithms. Also, I describe fast parallel algorithms for nearest-neighbor searching and constructing Voronoi diagrams. Finally, I demonstrate that my algorithms actually obtain good performance on a wide variety of machine architectures. The key algorithmic ideas that I examine are exploiting spatial locality, and random sampling. Spatial decomposition provides allows many concurrent threads to work independently of one another in local areas of a shared data structure. Random sampling provides a simple way to adaptively decompose irregular problems, and to balance workload among many threads. Used together, these techniques result in effective algorithms for a wide range of geometric problems. The key experimental ideas used in my thesis are simulation and animation. I use algorithm animation to validate algorithms and gain intuition about their behavior. I model the expected performance of algorithms using simulation experiments, and some knowledge as to how much critical primitiive operations will cost on a given machine. In addition, I do this without the burden of esoteric computational models that attempt to cover every possible variable in the design of a computer system. An iterative process of design, validation, and simulation delays the actual implementation until as many details as possible are accounted for. Then, further experiments are used to tune implementations for better performance.
Integrating Structured Data and Text: A Multi-Dimensional Approach
Authors: Jinho Lee, David Grossman, Ophir Frieder, M. Catherine McCabe
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Multidimensional databases are used for Online Analytic Processing (OLAP) applications with great success. We introduce a method of using OLAP techniques on a text collection - combining text searching and ranking techniques from information retrieval and the slicing, dicing, and drill-down from OLAP. Our approach integrates structured and unstructured data and takes advantage of the data hierarchies found in the structured data. We describe a prototype where standard multi-dimensional database tools are used to implement typical Information Retrieval functionality such as Boolean retrieval and relevance ranking.
Resource Prediction and Admission Control for Interactive Video Browsing Scenarios Using Application Semantics
Authors: bibliothek ARRAY(0x84778f8) EMAIL::
Venue:  (1998)

Highly interactive multimedia applications, like browsing in video databases, generate strongly varying loads on the media server during the presentation of media data. Existing admission control approaches for limiting the number of concurrent users and thus guaranteeing acceptable service quality are only suited for applications with uniform load characteristics like video-on-demand. We propose an approach to admission control that is based on the stochastical model of Continuous Time Markov Chains, which allows to describe the different presentation states occurring in the interactive access to the multimedia database. The model is derived from seman-tic information on the forthcoming browsing session, in particular, it considers the relevance of the videos to the user. In this way a more precise prediction on resource usage can be given for achieving the two goals of Quality of Service (QoS) and good server utilization. The admission control mechanism is part of a multimedia database architecture for supporting efficient browsing in large video collections. LOCLANGUAGE:: German LOC :: Interaktive multimediale Anwendungen, wie beispielsweise das Browsen in Videodatanbanken, erzeugen wahrend der Prasentation von Mediendaten stark schwankende Serverlasten. Die Aufgabe von Zulassungskontrollmechanismen ist die Begrenzung der gleichzeitig zu bedienenden Nutzer, um dadurch akzeptable Servicequalitaten zu erreichen. Bereits existierende Verfahren zur Zulassungskontrolle sind jedoch nur fur Anwendungen mit relativ konstanten Lasten, wie beispielsweise Video-on-Demand Anwendungen, geeignet. In diesem Artikel wird ein Ansatz zur Zulassungskontrolle vorgestellt, der auf dem stochastischen Modell von sogenannten Zeitkontinuierlichen Markov-Ketten (Continuous Time Markov Chains) basiert. Dadurch wird die Modellierung verschiedener Prasentationszustande, die aufgrund des interaktiven Nutzerverhaltens entstehen, ermglicht. Zur Modellierung werden semantische Informationen einer aktuellen Session verwendet, indem die Relevanzwerte einzelner Videos hinsichtlich einer vorherigen Anfrage berucksichtigt werden. Somit ist eine prazisere Vorhersage der Ressourcenverbrauchs mglich, wodurch sowohl Dienstguteparameter (Quality of Service) als auch Serverauslastung verbessert werden knnen. Der Zulassungskontrollmechanismus ist Bestandteil einer multimedialen Datenbankarchitektur, die Video-Browsing in gro?en Datenbestanden unterstutzt.
State Machines and Assertions (An Integrated Approach to Modeling and Verification of Distributed Systems
Authors: Thomas A. Joseph, Thomas Raeuchle, Sam Toueg
Venue:  (1984)

This paper describes a methodology for modeling and verifying protocols for asynchronous message passing systems. It combines the techniques of finite state analysis and axiomatic verification. It overcomes the problem of state explosion by using variables and logical assertions where the finite state approach would require a large number of states. By explicitly including states where interactions between processes occur, the complexity of assertional proofs is significantly reduced. Properties like freedom from deadlock, freedom from unspecified message receptions, boundedness of channel size, and partial correctness can be proved. Properties of channels like losing or garbling messages can be modeled, as can premature and non-premature timeouts. The technique is illustrated by proving a sliding window flow control protocol and an alternating bit protocol that is correct only if timeouts are non-premature.
Business Strategies for Information Technology Management
Authors: Kalle Kangas
Venue:  (2003)

:This business guide presents theoretical and empirical research on the business value of information technology (IT) and introduces strategic opportunities for using IT management to increase organizational performance. Implementation management is addressed with attention to customer relationship outsourcing, decision support systems, and information systems strategic planning. Domestic, international, and multinational business contexts are covered.Author Biography: Kalle Kangas is a professor of information systems science at the Pori Unit of Turku School of Economics and Business Administration.
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
Authors: C. J. Butz, S. K. M. Wong
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional relational data model, it immediately follows that we can take full advantage of the existing distributed and concurrency control techniques to address the undesirable characteristics exhibited by current multi-agent probabilistic reasoning systems. Thereby, our probabilistic relational data model has important theoretical and practical ramifications. One unified model allows the cross-fertilization of techniques, and serves as a basis for implementing one system for both of these similar domains.
Architecting Software with Interface Objects
Authors: Alexander Ran, Jianli Xu
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

One of the main concerns of software architects is managing complexity inherent in development and evolution of large software by minimizing and isolating dependencies between different parts into concise descriptions of their interfaces. Interfaces are commonly described as flat sets of externally visible elements, such as signatures of callable functions, or types of messages accepted by the component. Interfaces of large components often list hundreds of elements. Possible grouping, ordering or other relations and constraints between the interface elements themselves or the intended user appear as informal comments or are left unspecified. To address these problems we have developed a model for structuring and describing interfaces that is suitable for complex software components. In each interaction domain we use interface objects for hierarchical groupings of interface elements related to specific function or role played by the component in its interactions with other components. When components aggregated into composite components their interface objects may be aggregated in a similar way into composite interface objects. The state of an interface object allows to specify (and control) conditional availability of its interface elements. Non-uniform visibility of interface elements to different collaborators may be achieved by alternative grouping of interface elements and selective visibility of interface objects. In essence, interface objects isolate and open a part of the component implementation that is relevant for understanding the interactions of the component and thus serve as precise descriptions of its interface. An important principle of our approach was to address the problems without introducing new tools or languages in order to make it immediately useful for software engineers working on product development.
ALBORZ: Address Level Bus Power Optimization
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this paper we introduce a new low power address bus encoding technique, and the resulting code, named ALBORZ. The ALBORZ code is constructed based on transition signaling the limited-weight codes and, with enhancements to make it adaptive and irredundant, results in up to 89% reduction in the instruction bus switching activity at the expense of a small area overhead.
Design of Ternary CCD Circuits Referencing to Current-Mode CMOS Circuits
Authors: Xunwei Wu, Massoud Pedram
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper investigates the relationship between current-mode and charge-mode circuits. In particular, it shows that four basic CCD logic elements have their counterparts in the current-mode circuits. This is in turn used to show how to apply design principles used for current-mode CMOS circuits to the design of charge-mode CCD circuits.
Goal-Based Requirements Analysis
Authors: Annie I. Anton
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Goals are a logical mechanism for identifying, organizing and justifying software requirements. Strategies are needed for the initial identification and construction of goals. In this paper we discuss goals from the perspective of two themes: goal analysis and goal evolution. We begin with an overview of the goal-based method we have developed and summarize our experiences in applying our method to a relatively large example. We illustrate some of the issues that practitioners face when using a goal-based approach to specify the requirements for a system and close the paper with a discussion of needed future research on goal-based requirements analysis and evolution. Keywords: goal identification, goal elaboration, goal refinement, scenario analysis, requirements engineering, requirements methods
Three-dimensional Grid Drawings of Graphs
Authors: Janos Pach, Torsten Thiele, Geza Toth
Venue:  (1997)

A three-dimensional {\em grid drawing} of a graph $G$ is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of $G$ are pairwise non-crossing. It is shown that for any fixed $r\geq 2$, every $r$-colorable graph of $n$ vertices has a three-dimensional grid drawing that fits into a box of volume $O(n^2)$. The order of magnitude of this bound cannot be improved.
The Framework for EPOQ - an Extensible Object- Oriented Query Optimizer
Authors: Solveig Bj{\o}rnestad
Venue:  (1994)

This report describes the design and implementation of a framework for EPOQ - the architecture for an extensible, object-oriented query optimizer. Extensibility in this context is related to the types of objects that can be queried, the types of queries that can be optimized, and the optimization strategies that can be applied. For object-oriented data base systems different optimization strategies may be used on different data types, and the architecture makes this possible through the combination of several optimization regions that can apply different strategies. This work was initiated to implement the overall design described in [Mitch93] where the emphasis is made on the overall architecture, and the description is on a relatively high abstraction level. How this could be realized was not emphasized. In this paper focus is made on the detailed design decisions that were made to ensure that the overall goals were met. The architecture is intended to be extensible to make it possible to build flexible optimizers that can be adaptable to new types of objects and experimentation with new optimization strategies. A second goal has been to design a reusable framework for building query optimizers. To achieve this, focus has been put on designing the architecture as a set of interacting components that can be specialized whenever a new type of optimization strategy has to be implemented. Until the framework has actually been used to build example optimizers, it is hard to tell whether this goal has been achieved. The report can also be used as a manual for implementation of optimizers based on this architecture. Currently this work is continued at Brown and hopefully we will gain more insight in how such a framework should be organized. 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
On the Structure of Feasible Computations
Authors: Juris Hartmanis, Janos Simon
Venue:  (1974)

During the last four years research on the lower level computational complexity has yielded a rich set of interesting results which have revealed deep and unexpected connections between various problems and thus brought new unity to this area of computer science. This work has also yielded new techniques and insights which are likely to have further applications, and it has identified some very central problems in the quantitative theory of computing. The purpose of this paper is to give the reader an overview of these developments, an insight into some of these results and applications, as well as an appreciation of the unity and structure which has emerged in this area of research.
A Model for the Shapes of Islands and Pits on (111) Surfaces of fcc Metals
Authors: G. T. Barkema, M. E. J. Newman, M. Breeman
Venue:  (1994)

It is experimentally observed that adsorbate atoms and vacancies on (111) surfaces of fcc metals cluster into islands which are approximately hexagonal, but which on closer inspection turn out to have equilibrium facets which alternate in length ABABAB around the six sides of the island. By contrast, previous theoretical models for island faceting predict a rotating sequence of three lengths ABCABC around the island. We propose a new model for the observed shapes, whose physical basis is the variation of the local arrangements of substrate atoms seen by an adsorbate atom. We map our model onto a generalized form of two-dimensional Ising model having threeas well as two-spin interactions, and estimate using atom-embedding calculations the strengths of these interactions for Cu adsorbed on a Cu (111) surface. We then describe a new, highly efficient Monte Carlo technique for calculating the equilibrium crystal shapes of general Ising-type models in two or three dimensions, and apply it to the model in hand. Our results do indeed show altering facet lengths closely similar to those seen in experiments.
An Analysis of Dynamic Page Placement on a NUMA Multiprocessor
Authors: P R LaRowe, A M Holliday, S C Ellis
Venue:  (1991)

\indent The class of NUMA ({\underline n}on{\underline u}niform {\underline m}emory {\underline a}ccess time) shared memory architectures is becoming increasingly important with the desire for larger scale multiprocessors. In such machines, the placement and movement of code and data are crucial to performance. The operating system can play a role in managing placement through the policies and mechanisms of the virtual memory subsystem. In this paper, we develop an analytical model of memory system performance of a Local/Remote NUMA architecture based on approximate mean-value analysis techniques. The model assumes that a simple workload model based on a few parameters can often provide insight into the general behavior of real applications. The model is validated against experimental data obtained with the DUnX operating system kernel for the BBN GP1000 while running a synthetic workload. The results of this validation show that in general, model predictions are quite good, though in some cases the model fails to include the effect of unexpected behaviors in the implementation. Experiments investigate the effectiveness of dynamic page placement, and in particular, dynamic multiple-copy page placement. We investigate the cost of incorrect policy decisions by introducing different percentages of policy error and measuring their effect on performance.
A highly configurable cache architecture for embedded systems
Authors: Chuanjun Zhang, Frank Vahid, Walid Najjar
Venue: ACM SIGARCH Computer Architecture News (2003)

Energy consumption is a major concern in many embedded computing systems. Several studies have shown that cache memories account for about 50% of the total energy consumed in these systems. The performance of a given cache architecture is largely determined by the behavior of the application using that cache. Desktop systems have to accommodate a very wide range of applications and therefore the manufacturer usually sets the cache architecture as a compromise given current applications, technology and cost. Unlike desktop systems, embedded systems are designed to run a small range of well-defined applications. In this context, a cache architecture that is tuned for that narrow range of applications can have both increased performance as well as lower energy consumption. We introduce a novel cache architecture intended for embedded microprocessor platforms. The cache can be configured by software to be direct-mapped, two-way, or four-way set associative, using a technique we call way concatenation, having very little size or performance overhead. We show that the proposed cache architecture reduces energy caused by dynamic power compared to a way-shutdown cache. Furthermore, we extend the cache architecture to also support a way shutdown method designed to reduce the energy from static power that is increasing in importance in newer CMOS technologies. Our study of 23 programs drawn from Powerstone, MediaBench and Spec2000 show that tuning the cache's configuration saves energy for every program compared to conventional four-way set-associative as well as direct mapped caches, with average savings of 40% compared to a four-way conventional cache.
Stabilisation of Nonlinear Systems: The Piecewise Linear Approach, 1 edition
Authors: Christos A. Yfoulis
Venue:  (2002)

:This book considers "piecewise linear systems" as a class in its own right when dealing with robust and constrained stabilization problems. It presents a framework for efficient techniques to cope with controllable region estimation and constrained stabilization problems in industrial applications, and facilitates the design of controllers that achieve desirable tradeoffs between safety, performance and robustness. The control engineering community has shown recently an increased interest in development of advanced techniques for the analysis and design of highly complex and uncertain control systems that arise in industrial applications. This is verified by the development of areas such as "robust control" and "hybrid systems." Advances in computer technology have facilitated the development of highly sophisticated simulation tools and software environments. However, new technologies cannot be promoted by advanced computer tools only; parallel advances of new theories are necessary. This book brings together recent research results on stability design for the class of piecewise linear control systems, offering a promising solution for dealing with systematic control design for classes of nonlinear systems in the presence of additional state and control limitations. It motivates and develops the underlying principles in simple language and presents the benefits gained from the use of piecewise linear system models coupled with piecewise linear Lyapunov functions.