ppxscal/embedding_network huggingface dataset:
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
Authors: Wai-Shing Luk, Tien-Tsin Wong
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modification of Maekawa's grid based quorum scheme. The size of quorums is approximately $\sqrt{2}\sqrt{N}$ where $N$ is the number of sites in a network, as compared to $2\sqrt{N}$ of the original method. The method is simple and geometrically evident. The second one is based on the idea of difference sets in combinatorial theory. The resulting scheme is very close to optimal in terms of quorum size.
An Adaptable Architecture for Secure Delivery of Converged Services
Authors: Jenny Li, Wu Chou, Xueshan Shan, Feng Liu, W. Eric Wong
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

We present an approach for secure delivery of multimodal services to end users over heterogeneous converged networks. Our approach leads to an easily adaptable and extensible system architecture, in which system components interact with each other through loosely coupled interfaces based on asynchronous exchange of messages. It also effectively separates service logic from service delivery, through the introduction of a secure broker between the end user devices and the enterprise level application that contains the service logic. This separation also provides additional levels of security at the application level. This paper describes how our approach provides the features mentioned above. We have also validated our approach through the implementation of a prototype system, a description of which is also provided here.
Data Structures and Algorithms in Java, 3 edition
Authors: Michael T. Goodrich, Roberto Tamassia
Venue:  (2003)

:Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative. It incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.
A Denotational Semantics of Inheritance
Authors: William R. Cook
Venue:  (1989)

This thesis develops a semantic model of inheritance and investigates its applications for the analysis and design of programming languages. Inheritance is a mechanism for incremental programming in the presence of self-reference. This interpretation of inheritance is formalized using traditional techniques of fixed-point theory, resulting in a compositional model of inheritance that is directly applicable to object-oriented languages. Novel applications of inheritance revealed by the model are illustrated to show that inheritance has wider significance beyond object-oriented class inheritance. Constraints induced by self-reference and inheritance are investigated using type theory and yield a formal characterization of abstract classes and a demonstration that the subtype relation is a direct consequence of the basic mechanism of inheritance. The model is proven equivalent to the operational semantics of inheritance embodied by the interpreters of object-oriented languages like Smalltalk. Concise descriptions of inheritance behavior in several object-oriented languages, including Smalltalk, Beta, Simula, and Flavors, are presented in a common framework that facilitates direct comparison of their features.
Reducing Cache Conflicts by Multi-Level Cache Partitioning and Array Elements Mapping
Authors: Chih-Yung Chang, Jang-Ping Sheu, Hsi-Chiuen Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

This paper presents an algorithm to reduce cache conflicts and improve cache localities. The proposed algorithm analyzes locality reference space for each reference pattern, partitions the multi-level cache into several parts with different size, and then maps array data onto the scheduled cache positions such that cache conflicts can be eliminated. To reduce the memory overhead for mapping arrays onto partitioned cache, a greedy method for rearranging array variables in declared statement is also developed. Besides, we combine the loop tiling and the proposed schemes for exploiting both temporal and spatial reuse opportunities. To demonstrate that our approach is effective at reducing number of cache conflicts and exploiting cache localities, we use Atom as a tool to develop a simulator for simulation of the behavior of direct-mapping cache. Experimental results show that applying our cache-partitioning scheme can largely reduce the cache conflicts and thus save program execution time in both one-level cache and multi-level cache hierarchies.
Management Information Systems for the Information Age, 4 edition
Authors: Stephen Haag, Donald J. McCubbrey, Maeve Cummings
Venue:  (2003)

:This text will fit best in an MIS course where students have to do a lot of hands-on,problem-solving projects,especially on the Internet. Haag works well for professors who want an interactive,engaging experience. If a professor has large classes or wants a way to get everyone involved (bus/non-business majors),this is the book for them. The overall content and organization of the book has been retained,providing a clearly focused overview of Information Systems. The Second Edition continues to cover Management Information Systems concepts with a different approach and organization of topics compared to traditional introductory I. S. books for example. Electronic Commerce and its effect on organizations is a major theme in this text,threaded through each chapter. The authors assume that students know a little about hardware and software and focus more on the way organizations use information systems. There are many sidebars,boxes,and examples pulled from real-world organizations and many individual and group projects for students to work on-tying theory to practice. This is perhaps our most practical,hands-on text.
A conforming finite element method for overlapping and nonmatching grids
Authors: Yunqing Huang, Jinchao Xu
Venue: Mathematics of Computation (2003)

In this paper we propose a finite element method for nonmatching overlapping grids based on the partition of unity. Both overlapping and nonoverlapping cases are considered. We prove that the new method admits an optimal convergence rate. The error bounds are in terms of local mesh sizes and they depend on neither the overlapping size of the subdomains nor the ratio of the mesh sizes from different subdomains. Our results are valid for multiple subdomains and any spatial dimensions.
About Face 2.0: The Essentials of Interaction Design, 1 edition
Authors: Alan Cooper, Robert Reimann, Hugh Dubberly
Venue:  (2003)

:Dear Reader,In the eight years since this book was first published, the ideas that seemed do radical at first have become standard models across the industry. Many practicioners have adopted them and seen dramatic improvements in their products. This book would not have been possible without the commitment of the many organizations over the past decade that hired Cooper, my design consulting company. They demonstrated a great measure of self-confidence to break from the pack. By the same token, the many brilliant and talented people who have worked at Cooper have pushed the limits of my original thinking far beyond where I started. They have put their professional reputations on the line to prove that there is a higher standard and better ways to achieve it. In this significantly revised and expanded edition of the book, Robert Reimann and I have rewritten and reorganized every page. Together we have: Updated examples to reflect the current state of the art, and included more examples from Cooper design solutions Included references to recent technology and industry developments Added an entirely new section covering Cooper's Goal-Directed Design methods such as personas, goals, and scenarios in detail Added new chapters on visual design, as well as interaction design issues for embedded systems and the Web Added a bibliography of design reference sources Thanks for joining me in the pursuit of better software, happier programmers and designers, more successful businesses, and extremely satisfied users. Sincerely, Alan Cooper Founder & Chairman of the Board Cooper Author Biography: Alan Cooper is a pioneering software inventor, programmer, designer, and theorist. He is credited with creating what many regard as the first serious business software for microcomputers, and is widely known as the "Father of Visual Basic." For the last decade, Alan's interaction design consulting firm, Cooper, has helped companies invent powerful, usable, desirable software and improve digital product behavior through the use of Alan's unique methodology  the Goal-Directed process. A cornerstone of this method, the use of personas, has been widely adopted since it was first described in Alan's second book, The Inmates are Running the Asylum. A best-selling author and popular speaker, Alan is a tireless advocate for integrating design into business practice and for humanizing technology. Robert Reimann has spent the past 15 years pushing the boundaries of digital products as a designer, writer, lecturer, and consultant. He has led dozens of design consulting projects for startups and Fortune 500 clients alike. Upon joining Cooper in 1996, Robert led the development and refinement of many Goal-Directed Design methods described in About Face 2.0. He has lectured at major universities and to international industry audiences, and he is a member of the industry advisory board for the Institute of Design at the University of California, Berkeley.
Numerical simulation of turbulent flow in complex geometries used in power plants
Authors: C. Bhasker
Venue: Advances in Engineering Software (2002)

Performance degradations or improvements of coal-fired power stations depend on effective functioning of pulveriser equipment and combustion efficiency of furnaces in boilers. The function of a pulveriser is to grind the lumped coal and transfer the fine coal to the furnace for efficient combustion. However, the presence of several solid objects inside the mill, flow of air and particles takes turn around from inlet to outlet. The flow simulation process involves the geometrical modelling, grid generation and particle trajectories for the given flow conditions, and has been investigated to understand the flow path in grinding chamber, separator and classifier. The behaviour of turbulent air flow motion with fly ash particle paths on Lagrangian scale in computational domain are obtained through CFD/CAD software packages. The understanding developed with reference to recirculation flows in the inlet duct, non-uniform flow over the height of bowl mill and unequal flow at exit, provides valuable insights to designers for optimisation of components for better efficiency.
Lower Bounds for Dynamic Connectivity Problems in Graphs
Authors: Michael L. Fredman, Monika H. Rauch
Venue:  (1994)

We prove lower bounds on the complexity of maintaining fully dynamic $k$-edge or $k$-vertex connectivity in plane graphs and in $(k-1)$-vertex connected graphs. We show an amortized lower bound of $\Omega(\log n/k(\log\log n + \log b))$ per edge insertion or deletion or per query operation in the cell probe model, where $b$ is the word size of the machine and $n$ is the number of vertices in $G$. We also show an amortized lower bound of $\Omega(\log n/(\log\log n + \log b))$ per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for dynamic connectivity problems.
Approximately Optimal Elimination Orderings for Sparse Matrices
Authors: Wee Heng
Venue:  (1999)

PhD thesis of Wee-Liang Heng
Parallel and Distributed Programming Using C++
Authors: Cameron Hughes, Tracy Hughes
Venue:  (2003)

:Parallel and Distributed Programming Using C++ provides an up-close look at how to build software that can take advantage of multiprocessor computers. Simple approaches for programming parallel virtual machines are presented, and the basics of cluster application development are explained. Through an easy-to-understand overview of multithreaded programming, this book also shows you how to write software components that work together over a network to solve problems and do work.Parallel and Distributed Programming Using C++ provides an architectural approach to parallel programming for computer programmers, software developers, designers, researchers, and software architects. It will also be useful for computer science students.Demonstrates how agents and blackboards can be used to make parallel programming easierShows object-oriented approaches to multitasking and multithreadingDemonstrates how the UML is used to document designs that require parallel or distributed programmingContains the new POSIX/UNIX IEEE Standard for the Pthreads library
On the convergence of traffic measurement and queueing analysis: a Statistical-MAtch Queueing (SMAQ) tool
Authors: Chia-Lin Hwang, San-qi Li
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The analytical tool developed in this paper provides a general solution technique for the integration of traffic measurement and queueing analysis. The frequency-domain approach is used to combine the advanced techniques in two areas: signal processing and queueing analysis. Essentially, signal processing techniques are used to obtain the steady-state and second-order statistics of a traffic stream. The focus here is on the construction of a special class of Markov chains that can statistically match with each given traffic stream (or superposition of different traffic streams). The analytical queueing solutions can therefore be obtained by the folding-algorithm based on the Markov chain input modeling. Comprehensive numerical examples show the great potential of the SMAQ tool to solve measurement-based traffic management issues.
Constraint-oriented specification style and notation
Authors: Tommaso Bolognesi, Franco Accordino
Venue:  (1996)

We introduce an elementary and versatile notation meant to support the specification of concurrent, reactive and information systems in a so called constraint-oriented style. The co-notation has been in part inspired by the LOTOS specification language, and in part by the Z notation. Indeed, these two specification techniques are largely orthogonal and somehow complementary, the former being centred on the notions of action and process, the latter on state variables; however, limited to their respective focuses, each of them can support some constraint-oriented reasoning. In the co-notation actions and state variables are brought together into a unique framework, and promoted as equally important descriptive elements: constraint-oriented reasoning can then be uniformly applied to both. A system behaviour is characterised by sets of actions and state variables, and described as a hierarchical composition of elementary constraints and compound constraints on these elements. Interestingly, the co-notation can be presented also as a layer on top of Prolog, and has indeed been implemented in this way. The original syntax is minimal. TEL:: +39-050-593.426 EMAIL:: t.bolognesi@iei.pi.cnr.it
Static Electromigration Analysis for Signal Interconnects
Authors: Chanhee Oh, David Blaauw, Murat Becer, Vladimir Zolotov, Rajendran Panda, Aurobindo Dasgupta
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

With the increase in current densities, electromigration hasbecome a critical concern in high-performance designs. Typically,electromigration has involved the process of time-domain simulationof drivers and interconnect to obtain average, RMS, and peakcurrent values for each wire segment. However, this approach cannotbe applied to large problem sizes where hundreds of thousandsof nets must be analyzed, each consisting of many thousands of RCelements. In this paper, we propose a static electromigration analysisapproach. We show that under conditions that are typically metby VLSI interconnects, the charge transfer through wire segments ofa net can be calculated directly by solving a system of linear equations,thereby eliminating the need for time domain simulation.Also, we prove that under these conditions the charge transferthrough a wire segment is independent of the shape of the drivercurrent waveform. From the charge transfer through each wire segment,the average current is obtained directly, as well as approximateRMS and peak currents. We account for the different possibleswitching scenarios that give rise to unidirectional or bi-directionalcurrent by separating the charge transfer from the rising and fallingtransitions, and also propose approaches for modeling multiplesimultaneous switching drivers. The results on a number of industrialcircuits demonstrate the accuracy and efficiency of theapproach.
Complexity of some problems in positive and related calculi
Authors: L. Maksimova
Venue: Theoretical Computer Science (2003)

A problem of recognizing important properties of propositional calculi is considered, and complexity bounds for some decidable properties are found. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of new axiom schemes decides whether the calculus L + Ax has the property P or not. In Maksimova and Voronkov (Bull Symbol. Logic 6 (2000) 118) the complexity of tabularity, pretabularity, and interpolation problems over the intuitionistic logic (Int) and over modal logic S4 was studied.In the present paper, positive and positively axiomatizable calculi are investigated. We prove NP-completeness of tabularity, DP-hardness of pretabularity and PSPACE-completeness of interpolation and projective Beth's property over the positive fragment Int+ of the intuitionistic logic. Some complexity bounds for properties of propositional calculi over the intuitionistic or the minimal logic are found.
Visualization of Massive Retrieved Newsfeeds in Interactive 3D
Authors: Adrian M. Rossi
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This report describes work carried out under the Automatic Information Retrieval project at DERA, in building a 4D landscape (a TextScape) which acts as a graphical user interface (GUI) to the DERA-OKAPI search engine. Traditionally search engines present a 2D visual interface (usually a Windows-Icons-Menus-Pointer (WIMP) interface) to the user. Keywords are entered and the 'hits' are displayed usually in a list form. Unfortunately the number of documents retrieved is often overwhelming and a significant amount of time is still required to read abstracts and sections of documents in order to determine if they are relevant, even after the search engine has performed relevance ranking. The challenge is how to improve on this. We propose to render the information most immediately required onto the visual attributes of a 3D landscape. Shape, colour and size can then project the information that is sought, and mining the object hierarchy visually returns information more rapidly.
Delivery Excellence: A Practical Program for Continuous Improvement
Authors: Bruce Russell
Venue: IT Professional (2003)

Simple measures and inspections can improve software delivery. These actions also provide a basis for strategic improvements to overall development practices.
Making Structured Graphics and Constraints Practical for Large-Scale Applications
Authors: Brad A. Myers, Dario A. Giuse, Andrew Mickish, David S. Kosbie
Venue:  (1994)

Providing a structured graphics model and a constraint system makes the programming of graphical applications significantly easier. In a structured graphics model, each graphic element on the screen is represented by a real object in the object system, while a constraint system automatically maintains relationships among the objects. Although many research systems and a few commercial environments provide structured graphics and constraints, none scale up to large interfaces with thousands of objects and thousands of constraints. This paper presents four techniques to overcome this problem: automatic elimination of constraints that depend only on values that do not change, layout hints to help with refresh and hit detection, "virtual aggregates" that only pretend to allocate objects for their components, and compiling composite aggregates into a single object with a complex draw method. These have been implemented as part of the Garnet environment, and we have demonstrated that together they allow structured graphics and constraints to scale up to applications with tens of thousands of objects and constraints without compromising the ease-of-use.
Validation of distributed algorithms and protocols
Authors: Qiang Gao, R. Groz, G. von Bochmann, J. Dargham, E. H. Htite
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The use of formal description techniques allows the partial automation of the design, the validation, and the implementation of communication protocols and distributed algorithms. In this paper, we present a methodology for validation of distributed algorithms and protocols, and our experiences of using the Estelle language, and a simulation and validation tool, called Veda, to simulate and validate complex distributed algorithms for the distributed implementation of multi-rendezvous. Some design errors in published distributed rendezvous algorithms were found. We obtain from these experiences heuristic guidelines for trouble shooting of distributed algorithms
Lazy Evaluation and the Logic Variable
Authors: Keshav Pingali
Venue:  (1987)

Functional languages can be enriched with logic variables to provide new computational features such as incremental construction of data structures. In this paper, we present a novel application for logic variables that highlights their importance: we argue that they are essential for efficient implementations of pure functional languages. This point is made by demonstrating that logic variables are required for explicating the process of demand propagation in lazy evaluation of functional programs. There are two applications of this result. For dataflow researchers, it offers a simple and efficient implementation of laziness on dataflow machines. For researchers investigating lazy graph reduction, it suggests new strictness analysis algorithms in which logic variables play an important role.
BASE: Using abstraction to improve fault tolerance
Authors: Miguel Castro, Rodrigo Rodrigues, Barbara Liskov
Venue: ACM Transactions on Computer Systems (TOCS) (2003)

Software errors are a major cause of outages and they are increasingly exploited in malicious attacks. Byzantine fault tolerance allows replicated systems to mask some software errors but it is expensive to deploy. This paper describes a replication technique, BASE, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors. BASE reduces cost because it enables reuse of off-the-shelf service implementations. It improves availability because each replica can be repaired periodically using an abstract view of the state stored by correct replicas, and because each replica can run distinct or nondeterministic service implementations, which reduces the probability of common mode failures. We built an NFS service where each replica can run a different off-the-shelf file system implementation, and an object-oriented database where the replicas ran the same, nondeterministic implementation. These examples suggest that our technique can be used in practice---in both cases, the implementation required only a modest amount of new code, and our performance results indicate that the replicated services perform comparably to the implementations that they reuse.