ppxscal/embedding_network huggingface dataset:
Efficient Distributed Ranking and Sorting Schemes for a Coterie
Authors: David S. L. Wei
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

We consider the problems of distributed ranking and sorting on a Coterie, a communication structure which has proven to be a good candidate as underlying interconnection network for distributed processing. Ranking and sorting problems are harder than a consensus one, a vital and well studied problem in distributed processing, in that the later one computes for only one function (e.g. summation), while the former one actually performs n functions, as ranking is to rank the key in each of n sites. The currently best known decentralized consensus protocols on a coterie uses O(n * square-root of n) messages, and requires two rounds of message exchange. In this paper we show that both ranking and sorting can be done on a coterie with the same message complexity although the problems we investigate are much harder. We first present a two-round ranking algorithm which requires only O(n * square-root of n) messages. Then using this ranking algorithm, we obtain a sorting algorithm which also uses only O(n * square-root of n) messages, but requires two more rounds of message exchange. Our schemes are optimal in the sense that the lower bound of messages needed for achieving a consensus is at least(n * square-root of n) (a trivial lower bound shown in the paper of Lakshman's).
Efficient Mining for Association Rules with Relational Database Systems
Authors: Karthick Rajamani, Alan Cox, Bala Iyer, Atul Chadha
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

With the tremendous growth of large-scale data repositories, a need for integrating the exploratory techniques of data mining with the capabilities of relational systems to efficiently handle large volumes of data has now risen. In this paper, we look at the performance of the most prevalent association rule mining algorithm - Apriori, with IBM's DB2 Universal Database system. We show that a multi-column (MC) data model is preferable over the commonly used single column (SC) data model for association rule mining. We obtain factors of 4.8 to 6 improvement in performance for the MC data model over commercial implementations for the SC data model. We provide a new relational operator, called Combinations, for efficient SQL implementation of Apriori in the database engine - this results in trivial parallelizability, reliability, and portability for the mining application.
Recovery of Communications Protocol Design from Run Time Protocol Traces
Authors: K. Saleh, M. Ilangovan, R. Probert
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Reverse engineering and design recovery are two important concepts for the understanding of software. In particular, the reverse engineering of distributed software, such as communications protocols, is a very interesting and practical problem. Lots of existing communications software were written without any use of formal methods and are badly documented. In this paper, we provide a practical method for communications software reverse engineering and design recovery. Using compiler assisted trace collection at various observation points, we can generate a higher level design representation consisting of communicating finite state machines (CFSMs) corresponding to the protocol and service. Each record of the collected traces includes the event and its type, a vector clock and the observation point at which the event has occurred. In addition to design recovery, such traces are very powerful in providing a unified framework for reasoning about correctness, distributed debugging, fault detection and diagnosis in communications protocols.
The Collapsing Hierarchies
Authors: Juris Hartmanis
Venue:  (1987)

No Abstract Available
Integrated Distributed Application Management under Multi-ORB-vendor Environment
Authors: Hiroki Tanaka, Hidetsugu Kobayashi, Hiroshi Ishii
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

A mechanism is proposed for managing distributed applications (DAPs) in environment having multiple object request brokers (ORBs). The mechanism ensures the normal-state functioning of DAPs composed of servers. It facilitates DAP management including fault, performance, and configuration management throughout the DAP lifecycle. The mechanism includes three kinds of key components. The first is a domain manager, which is responsible for fault and configuration management of DAPs. The second is a server manager, which is responsible for fault and configuration management for servers that make up DAPs. The third is a monitor that manages the performance and normal/abnormal state of servers. The common interface for monitors functioning on different kinds of DAP platforms facilitates managing DAPs over multiple ORBs. The prototype of the proposed mechanism functions properly and performs well when used with a CORBA-2.0-compliant ORB.
Disk-directed I/O for MIMD Multiprocessors
Authors: David Kotz
Venue:  (1994)

Many scientific applications that run on today''s multiprocessors are bottlenecked by their file I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and improved file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, disk-directed I/O, that flips the usual relationship between server and client to allow the disks (actually, disk servers) to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains are possible. Indeed, disk-directed I/O provided consistent high performance that was largely independent of data distribution, and close to the maximum disk bandwidth.
Some Problems with the Realtime Features of Modula-2
Authors: G. M. Mohay, K. J Gough, W. Pease
Venue:  (1991)

The unit of pseudo-parallelism in Modula-2 is the coroutine; coroutines switch control to one another through use of coroutine transfer operations. Standard Modula-2 supports three different coroutine transfer operations -- TRANSFER, IOTRANSFER and tile asynchronous transfer --- and provides a module priority mechanism to ensure, inter alia, that interrupts occurring during execution of all i/o (interrupt handier) coroutine are only recognised if they are of higher priority than the interrupt already being serviced. A modified set of Modula-2 coroutine transfer operations, prototyped using tile PDP-11 M23 Modula-2 system, has: been described previously. That model included the new primitive operation AttachInterrupt which effectively replaces IOTRANSFER, leading to an arguably simpler and more elegant structure for real-time pseudo-parallel Modula-2 programs. That model has now been extended to incorporate the additional primitive frictions Priority and Previous, respectively. The former allows a real-time coroutine to interrogate tile priority of all interrupted coroutine, while tile letter is invoked by a real-time coroutine in order to determine the identify of that interrupted coroutine. This paper discusses the rationale for the extended model, illustrates its use and describes its implementation in one of tile most popular Modula-2 systems in use today, the Logitech Version 3 compiler for tire IBM PC.
Technical Diagnosis of Telecommunication Equipment - An Implementation of a Task specific Problems solving method (TDFL) using GCLA II
Authors: Goran Falkman, Jonas Warnby
Venue:  (2001)

This paper describes an implementation of a small knowledge-based system in GCLA II. GCLA II is perhaps best described as a logical programming language, with some properties usually found among functional languages, and it includes hypothetical and non-monotonic reasoning as integral parts, which makes it easy to handle hypothetical queries, negation and AI-techniques like simulation and planning in a natural way. It also makes implementation of reasoning in knowledge-based systems (KBS) more direct than in Prolog. The application is an already existing KBS that guides a service technician in the task of diagnosing a specific device which is a measuring instrument for testing telecommunications equipment. The method used in the application is a problem solving method called TDFL. The TDFL method is a task specific problem solving method for technical diagnosis that gives strong support for knowledge acquisition. The method is adapted to cope with some features of the application. For example, it gives support for reducing the time required for observations and it handles parts that are not directly testable. This paper describes how to adjust the TDFL method to remedy some errors present in the original version; avoiding unnecessary search of the device and eliminating unnecessary confirmations. Some future extensions to both the TDFL method and the implementation are also presented; allowing the search for more than one fault and the possibility of turning the diagnosis backwards.
On the Intellectual Terrain Around NP
Authors: Juris Hartmanis, Suresh Chari
Venue:  (1993)

In this paper, we view $P \stackrel{?}{=} NP$ as the problem which symbolizes the attempt to understand what is and what is not feasibly computable. The paper shortly reviews the history of the developments from Godel''s 1956 letter asking for the computational complexity of finding proofs of theorems, through computational complexity, the exploration of complete problems for NP and PSPACE, through the results of structural complexity to the recent insights about interactive proofs.
Selection of catalysts through cellular reproduction
Authors: Naoaki Ono, Takashi Ikegami
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A series of simulation studies (Ono & Ikegami 1999; 2001) show that a proto cell spontaneously emerges from a chemical soup by acquiring membrane structures. In 2-dimensional space, the emergence of proto cells is followed by the reproduction of cells. A major unsolved problem is the evolution of proto cells; how the proto cells evolve into modern cells with higher functionalities. Here we examine, as the first step, the evolution of catalysts within the proto-cells. Catalytic chemicals have different catalytic activity in generating membrane chemicals. We show that cells with higher activity of membrane production evolve through cellular selection.
Performance evaluation of strategies for integration of elastic and stream traffic
Authors: Rudesindo N\''{u}\~{n}ez Queija, J. L. Berg, Michel R.H. Mandjes
Venue:  (1999)

This paper deals with the integration of `stream'' traffic and `elastic'' traffic in one single network, e.g. an ATM-based or an IP-based network. Here stream traffic refers to traffic with a certain bandwidth guarantee, whereas elastic traffic flows can adapt their rates to the link bandwidth left over by the stream flows. First, models are developed that describe different strategies for sharing link capacities between the stream and elastic flows. Then we give mathematical methods for obtaining performance measures, in particular call blocking probabilities and file transfer delays. Finally, these methods are used for assessing and comparing the efficiency gains achieved by the integration strategies.
Professional Design Patterns in VB.NET- Building Adaptable Applications, 1 edition
Authors: Tom Fischer, John Slater, Cha-Ur Wu, Peter Stromquist, Chaur G. Wu
Venue:  (2002)

:Visual Basic .NET is the first version of the VB language to be fully object-oriented. This allows VB programmers to make effective and full use of design patterns in their code for the first time. This book is not a treatment of the theory of design patterns. We show design patterns applied in real world architectural scenarios so that you can see them in action and see the benefits that they bring. We explain why it's worth spending time building design patterns into your applications, even though this may seem at odds with Rapid Application Development. What does this book cover?: An introduction to design patterns Design patterns applied in the data, business logic, and presentation tiers Design patterns in .NET Remoting Lessons learned and best practices A UML primer This book is aimed at experienced Visual Basic developers who are moving into object-oriented VB.NET, and are considering using design patterns in their applications.
Law in Cyber Space
Authors: Commonwealth Secretariat
Venue:  (2002)

:With the rapid advancements in computer technology over the past few years, there has been increasing concern on the need to develop the law in order to take full advantage of technological improvements , and also to ensure that states can respond to computer crime and related criminal law issues. This book sets out the reports of these two expert working groups hosted by the Legal and Constitutional Affairs Division of the Commonwealth Secretariat.The first part of the book looks at the legislative framework necessary for effective e-commerce (particularly how to implement the UNCITRAL Model Law) and related issues such as consumer protection, privacy, dispute resolution and general evidence provisions. The second part focuses on criminal law issues relating to information technology, with regard in particular to the draft Council of Europe Convention on Cyber-crime. 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
Modelling biological processes by using a probabilistic P system software
Authors: Ioan I. Ardelean, Matteo Cavaliere
Venue: Natural Computing: an international journal (2003)

In this paper we present a probabilistic P system simulator that implements the evolution-communication model proposed in (Cavaliere, 2003) enriched with some probabilistic parameters inspired by the cell biology. After describing the software and its working, we compare the mathematical model used with the biological reality of the cell. Then, we present some mathematical and biological applications showing how one can use this software to simulate simple but interesting biological phenomena, related to respiration and photosynthesis processes in some bacteria.
HDL and integrating system-level simulation technologies
Authors: C. Ussery, K. McKinley, K. Lang, E. Komp, W. Larue
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

System level design is a critical component of any electronics product development project. However, HDL based ASIC design has remained a distinctive and separate function within projects. With the advent of deep submicron technology, large systems and subsystems can now be placed on a single chip. This requires a closer interaction between system level design and ASIC development. The paper describes an effective methodology and technology support for integrating system level simulation techniques with HDL based simulation to provide a smooth transition between each level. We start by examining an integrated verification methodology and the use models for utilizing mixed dataflow and HDL models. We then discuss combining a model of interaction derived from the work done on the Ptolemy project with a standards based implementation approach using the Open Model Forum (OMF) standard. Finally, an example is used to highlight the effectiveness of this approach.
Backtracking Without Trailing in CLP(${\Re}_{\rm Lin}$)
Authors: Pascal Van Hentenryck, Viswanath Rasachandran
Venue:  (1993)

Constraint logic programming (CLP) is a generalization of logic programming where unification is replaced by constraint solving as the basic operation of the language. The combination of constraint solving and nondeterminism (approximated by backtracking) makes these languages appealing for a variety of combinatorial search problems. Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored on backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This paper proposes a fundamentally new implementation scheme for backtracking in CLP languages over linear (rational or real) arithmetic. The new scheme, called semantic backtracking, does not use trailing but rather exploits the semantics of the constraints to undo the effect of newly added constraints. Semantic backtracking reduces the space complexity by an order of magnitude compared to implementations based on trailing and makes space complexity essentially independent of the number of choice points. In addition, semantic backtracking introduces negligible space and time overhead on deterministic programs. The price for this improvement is an increase in backtracking time, although constraint-solving time may actually decrease. The scheme has been implemented as part of a complete CLP system (about 20,000 lines of C) and compared analytically and experimentally with an optimized trailing implementation. Experimental results indicate that semantic backtracking produces significant reduction in memory space, while keeping the time overhead reasonably small.
Chebyshev polynomial expansions for simultaneous approximation of two branches of a function with application to the one-dimensional Bratu equation
Authors: John P. Boyd
Venue: Applied Mathematics and Computation (2003)

We introduce two methods for simultaneously approximating both branches of a two-branched function using Chebyshev polynomials. Both schemes remove the pernicious, convergence-wrecking effects of the square root singularity at the limit point where the two branches meet. The "Chebyshev-Shafer" method gives the approximants as the solution to a quadratic equation; the "mapping" algorithm makes a quadratic change of variable. For both, the only input information is the set of values of f(x) at a set of discrete points. There is little to choose between the two schemes in accuracy, but the single expansion/mapping method is more flexible in that it can accommodate different ranges on the two branches. The eigenrelation for the one-dimensional Bratu equation is an interesting example because the upper branch is also singular at another point besides the limit point; this, too, can be removed by subtracting the asymptotic solution, which is the Lambert W-function, from the upper branch only. When the domain of the variable is infinite, the quadratic change of variable can still be applied by substituting rational Chebyshev functions, which are basis functions for an unbounded interval, for Chebyshev polynomials. We illustrate this by approximating the real-valued root of the Brill quintic, u5 - u - λ, λ ∈ [-∞, ∞], which was first solved by Hermite using elliptic modular functions more than a century ago.
Dynamic Networking: Architecture and Prototype Systems
Authors: Susumu Konno, Gen Kitagata, Takuo Suganuma, Tetsuo Kinoshita, Kenji Sugawara, Norio Shiratori
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper, we propose a new architecture of the global communication networks, the Dynamic Networking Architecture.The dynamic functions enhance the capabilities of communication networks to deal with various changes detected by human users, applications and networked environment. In this architecture, a new functional layer called Flexible Network Layer (FNL) is introduced between the application layer and the transport layer of the global communication networks.To realize the FNL, we adopt an agent framework to develop and manage various components and related knowledge of agent-based middleware of FNL.We explain the experimental applications of the FNL to discuss the characteristics of the proposed architecture.
The Effectiveness of the Thesaurus Method in Automatic Information Retrieval
Authors: C. T. Yu, Gerard Salton
Venue:  (1975)

Term grouping and thesaurus methods have frequently been incorporated into automatic content analysis programs as devices for the recognition of synonymous expressions and of linguistic entities that may be semantically similar but syntactically distinct. While it has frequently been asserted that the recognition of synonyms is essential in language analysis, actual proofs of the usefulness of a thesaurus in automatic information retrieval are outstanding. In the present study, formal proofs are given of the effectiveness under well-defined conditions of the thesaurus method in information retrieval. It is shown, in particular, that when certain semantically related terms are added to the information queries originally submitted by the user population, a superior retrieval system is obtained in the sense that for every level of the recall the retrieval precision is at least as good for the altered queries as for the original ones.
Local Detection of Exclusive Global Predicates
Authors: Eunjung Lee
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Detecting global predicates in distributed program executions is a useful tool for debugging and testing. A new form of global predicates, called exclusive global predicates, is considered in this paper to provide a natural and efficient way to describe mutual exclusion conditions. One exclusive global predicate is enough to express mutual exclusion condition for n local predicates, one for each process; the O(n2) conjunctive global predicates are required to describe the same condition.In this paper, a local on-line detection algorithm of exclusive global predicates is presented with formal proof. This algorithm detects a violation of mutual exclusion during the execution at each local process. This algorithm uses timestamps to get dependence relations between events. The n+2 numbers are piggybacked to each message, and no extra communication overhead for control information is required. This allows the proposed model to be useful and efficient for testing and debugging of distributed programs compared to the previous method with conjunctive global predicates. 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
How to Use Adobe After Effects 5.0 and 5.5
Authors: Donna Baker
Venue:  (2002)

:About the Author:Donna L. Baker has worked as an information development consultant for many years. She has expertise in online and Web training and design, motion graphics design, and interactive knowledge products. She writes eleven magazine articles each year on graphics applications; monthly articles can be found in the online magazine WindoWatch, and several have also been featured by StudyWeb and CreativePro Web sites. Donna is the author of CourseBuilder for Dreamweaver f/x and Design and Acrobat 5: The Professional User's Guide.