ppxscal/embedding_network huggingface dataset:
A Modular Analysis of Network Transmission Protocols
Authors: Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We propose a new model for the analysis of data transmission protocols in lossy communication networks. The overall goal of a data transmission protocol is to successfully transmit a message from the sender to the receiver. We study the performance of protocols in an adversarial setting where the loss pattern and latencies of packets are determined by an adversary.We advocate the modular decomposition of data transmission protocols into a time scheduling policy, which determines when packets are to be sent, and a data selection policy, which determines what data is to be placed in each sent packet. We concentrate on the data selection policy and require that the protocol will achieve high bandwidth utilization in transmitting any prefix of the transmitted message. The simple and universal data selection policy we introduce is provably close to optimal in the following sense: For any time scheduling policy and any network behavior, in the worst case prefix measure our data selection policy performs as well as any other data selection policy up to a constant additive term.Our explicit modular decomposition of a transmission protocol into two policies should be contrasted with existing network protocols such as TCP/IP. Our result shows that the performance of the overall transmission protocol would not degrade in performance (and could improve dramatically) if it used our universal data selection policy in place of its own. We therefore reduce the problem of designing a data transmission protocol to the task of designing a time scheduling policy.
Parallel Graph-Embedding and the Mob Heuristic
Authors: John E. Savage, Markus G. Wloka
Venue:  (1991)

We show that important local search heuristics for grid and hypercube embeddings based on the successive swapping of pairs of vertices, such as simulated annealing, are P-hard and unlikely to run in polylogarithmic time. This puts experimental results reported in the literature into perspective: attempts to construct the exact parallel equivalent of serial simulated-annealing-based heuristics for graph embedding have yielded disappointing parallel speedups. We have developed and implemented on the Connection Machine CM-2 a new massively parallel heuristic for such embeddings, called the Mob heuristic. We report on an extensive series of experiments with our heuristics on the 32K-processor CM-2 Connection Machine for grid and hypercube embeddings that show impressive reductions in edge costs and run in less than 30 minutes on random graphs of 1 million edges. Due to excessive run times, previous heuristics reported in the literature were able to construct graph embeddings only for graphs that were 100 to 1000 times smaller than those used in our experiments.
Incremental Maintenance of Nested Relational Views
Authors: Jixue Liu, Millist Vincent, Mukesh Mohania
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Incremental view maintenance techniques are required for many new types of data models that are being increasingly used in industry. One of these models is the nested relational model that is used in the modelling complex objects in databases. In this paper we derive a group of expressions for incrementally evaluating query expressions in the nested relational model. We also present an algorithm to propagate base relation updates to a materialized view when the view is defined as a complex query.
Cooperative negotiation in a multi-agent system for real-time load balancing of a mobile cellular network
Authors: John Bigham, Lin Du
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A cooperative negotiation approach for the real-time control of cellular network coverage is described. The performance of the whole cellular network is improved by contracting and shaping the antenna radiation pattern around traffic "hot spots" and expanding adjacent cell coverage to fill in the coverage loss. The paper shows that the local area real time cooperative negotiation between base stations leads to a near global optimal coverage agreement which is reached in the context of the whole cellular network. Results showing the advantage of this technique are presented. Global optimization using constrained real-coded genetic algorithms provides the benchmark. In our work, instead of using a formal negotiation model of alternating offers, we create certain number of possible local hypotheses and start negotiations based on them. Some negotiation may reach agreements before their deadlines, and the system commits to the best agreement found at the end. This approach is more predictable and controllable than the formal negotiation model. Architecturally the negotiation component described is part of the planning layer of an agent system for resource management in 3G wireless networks. This has a layered architecture with both planning and reactive components. The results are allowing the development of a novel geographic load-balancing scheme for cellular networks that intelligently changes cellular coverage according to the geographic traffic distribution in real time.
Novel Approaches to Optimized Self-Configuration in High Performance Multiple-Expert Classifiers
Authors: A. F. R. Rahman, M. C. Fairhurst, S. Hoque
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Classifier combination and the design of multiple expert decision combination strategies are now considered to be very important issues in pattern recognition. This paper describes an investigation covering two important aspects of decision combination: optimization andgenerality.
Living with the 2-digit Year Year 2000 Maintenance Using a Procedural Solution
Authors: Eugene C. Lynd
Venue: Proceedings of the International Conference on Software Maintenance (1997)

This paper is based on experience at the (US) Defense Logistics Agency Systems Design Center (DSDC) in developing and implementing a tool set and processes for remediation of the Year 2000 problem using the procedural approach. The problem and four general solution strategies are briefly described. DSDC's reasons for early focus on a "windowing" approach are discussed. The tools are discussed in terms of the problems they address and the degree of automation they can (and cannot) supply. A step-by-step process for mainframe batch COBOL, based on the tools, is summarized.
Learning optimized features for hierarchical models of invariant object recognition
Authors: Heiko Wersing, Edgar Körner
Venue: Neural Computation (2003)

There is an ongoing debate over the capabilities of hierarchical neural feedforward architectures for performing real-world invariant object recognition. Although a variety of hierarchical models exists, appropriate supervised and unsupervised learning methods are still an issue of intense research. We propose a feedforward model for recognition that shares components like weight sharing, pooling stages, and competitive nonlinearities with earlier approaches but focuses on new methods for learning optimal feature-detecting cells in intermediate stages of the hierarchical network. We show that principles of sparse coding, which were previously mostly applied to the initial feature detection stages, can also be employed to obtain optimized intermediate complex features. We suggest a new approach to optimize the learning of sparse features under the constraints of a weight-sharing or convolutional architecture that uses pooling operations to achieve gradual invariance in the feature hierarchy. The approach explicitly enforces symmetry constraints like translation invariance on the feature set. This leads to a dimension reduction in the search space of optimal features and allows determining more efficiently the basis representatives, which achieve a sparse decomposition of the input. We analyze the quality of the learned feature representation by investigating the recognition performance of the resulting hierarchical network on object and face databases. We show that a hierarchy with features learned on a single object data set can also be applied to face recognition without parameter changes and is competitive with other recent machine learning recognition approaches. To investigate the effect of the interplay between sparse coding and processing nonlinearities, we also consider alternative feedforward pooling nonlinearities such as presynaptic maximum selection and sum-of-squares integration. The comparison shows that a combination of strong competitive nonlinearities with sparse coding offers the best recognition performance in the difficult scenario of segmentation-free recognition in cluttered surround. We demonstrate that for both learning and recognition, a precise segmentation of the objects is not necessary.
Java Enterprise Best Practices, 1 edition
Authors: Robert Eckstein
Venue:  (2002)

:The Java 2 Enterprise Edition (J2EE) APIs have changed the way we think about enterprise computing. However, many programmers are discovering that simply learning the J2EE APIs isn't enough anymore. Writing efficient, robust enterprise code using servlets, JDBC, XML, EJB, and JSP can be a daunting task. In fact, it seems that the only way to become an expert at coding J2EE applications is to suffer through years of trial-and-error. Not anymore. Java Enterprise Best Practices helps to alleviate that frustration by offering you the benefit of our own authors' experience. This book recognizes the difference between learning a set of Java Enterprise libraries and learning how to use them both effectively and efficiently in your distributed applications. Should you unit test your marshalling code? Why should you bootstrap DOM correctly? What is an MBean Facade Pattern and when is it useful? Why do many database developers fail to take internationalization into consideration when creating their schemas? Java Enterprise Best Practices is a must-have book for all serious Java Enterprise developers. Whether it is covering rules for marshalling or unmarshalling RMI objects or advice for handling database connection pools, this book is a compendium of advice on how to make your Java Enterprise applications move from the ordinary to the extraordinary.
On the Use of Spreading Activation Methods in Automatic Information Retrieval
Authors: Gerard Salton, Chris Buckley
Venue:  (1988)

Spreading activation methods have been recommended in information retrieval to expand the search vocabulary and to complement the retrieved document sets. The spreading activation strategy is reminiscent of earlier associative indexing and retrieval systems. Some spreading activation procedures are briefly described, and evaluation output is given, reflecting the effectiveness of one of the proposed procedures.
A Binary Software Associative Memory
Authors: Shlomo Geva, K. J Gough
Venue:  (1995)

In this paper we describe the implementation of a binary inverted file that acts as a fast software associative memory when combined with a set of efficient search algorithms. We implemented a very fast and powerful retrieval engine, that takes the inverted file scheme to performance levels beyond those possible with the traditional technique. We present the results of testing a production system implementation of this software by the Queensland Police Department. Our results show that the software outperforms conventional techniques in the form of an IDMS implementation, and a hardware solution, namely ICL''s CAFS search engine, in providing immediate response to partial match and complex boolean queries, including text searching. The solution presented is for static files, although the technique may be used with dynamic files too.
Microsoft Excel VBA Programming for the Absolute Beginner
Authors: Duane Birnbaum, Andy Harris
Venue:  (2002)

:If you are new to programming with Excel VBA and are looking for a solid introduction, this is the book for you. Developed by computer science instructors, books in the for the absolute beginner series teach the principles of programming through simple game creation. With this book as your guide, you will acquire the skills you need to program practical applications with Excel VBA, and you will learn how these skills can be put to use in real world scenarios. Best of all, by the time you finish this book you will be able to apply the basic principles you've learned to the next programming language you tackle.
Sonification of Remote Sensing Data: Initial Experiment
Venue: Proceedings of the International Conference on Information Visualisation (2000)

We are generating music from a particular view of a multi-dimensional geographic information system (GIS) data set to alert a viewer to the existence of hidden clusters of data points. This paper describes some results from an early experiment with generating music from a 2-D slice of the data and testing whether these representations are easily understood by beginning users. 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
A Linear Constraint Satisfaction Approach for Abductive Reasoning
Authors: Eugene Santos,  Jr.
Venue:  (1992)

Abductive explanation has been formalized in AI as the process of searching for a set of assumptions that can prove a given observation. A basic problem which naturally arises is that there maybe many different possible sets available. Thus, some preferential ordering on the explanations is necessary to precisely determine which one is best. Unfortunately, any model with sufficient representational power is in general NP-hard. Causal trees and AND/OR graphs are among the most commonly used for representing causal knowledge. Consequently, finding a best explanation has been treated as some heuristic search through the graph. However, this approach exhibits an expected exponential run-time growth rate. In this thesis, we present a new approach to modeling abductive reasoning which admits an extremely efficient implementation. We treat the problem in terms of constrained optimization instead of graph traversal. Our approach models knowledge using linear constraints and finds a best explanation by optimizing some measure within these constraints. Although finding the best explanation remains NP-hard, our approach allows us to utilize the highly efficient tools developed in operations research. Such tools as the Simplex method and Karmarkar''s projective scaling algorithm form the foundations for the practical realization of our approach. Experimental results strongly indicate that our linear constraint satisfaction approach is quite promising. Studies comparing our approach against heuristic search techniques has shown our approach to be superior in both time and space, and actually exhibiting an expected polynomial run-time growth rate. Our goal is to show that our framework is both flexible and representationally powerful. We can model both cost-based abduction and Bayesian networks. Furthermore, it is possible for us to handle difficult problems such as alternative explanations, continuous random variables, consistency, partial covering and cyclicity which are commonly encountered in abductive (diagnostic) domains. 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
Synthesis support for design partitioning
Authors: J. Willoughby
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

As designs become larger and larger it becomes necessary to partition the design, not only to meet synthesis tool restrictions, but also to perform parallel design processing by multiple engineers and/or on multiple machines. Partitioning requires the assignment of timing and loading budgets across module boundaries. This is an inefficient and time-consuming task if performed by hand. Logic synthesis tools can utilize techniques of constraint propagation combined with hierarchical controls to perform this task automatically. This approach will result in improved results and shorter design times.
Reducing Average and Peak Test Power Through Scan Chain Modification
Authors: Ozgur Sinanoglu, Ismet Bayraktaroglu, Alex Orailoglu
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Parallel test application helps reduce the otherwise considerable test times in SOCs&semi; yet its applicability is limited by average and peak power considerations. The typical test vector loading techniques result in frequent transitions in the scan chain, which in turn reflect into significant levels of circuit switching unnecessarily. Judicious utilization of logic in the scan chain can help reduce transitions while loading the test vector needed. The transitions embedded in both test stimuli and the responses are handled through scan chain modifications consisting of logic gate insertion between scan cells as well as inversion of capture paths. No performance degradation ensues as these modifications have no impact on functional execution. To reduce average and peak power, we herein propose computationally efficient schemes that identify the location and the type of logic to be inserted. The experimental results confirm the significant reductions in test power possible under the proposed scheme.
Zero one laws for graphs with edge probabilities decaying with distance
Authors: Saharon Shelah
Venue:  (1995)

Let G(n) be the random graph on [n]={1,...,n} with the possible edge {i,j} having probability being p(|i-j|)=1/(|i-j|^a), 0 is less than a is less than 1 irrational. We prove that the zero one law (for first order logic) holds.
The causes of path inflation
Authors: Neil Spring, Ratul Mahajan, Thomas Anderson
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Researchers have shown that the Internet exhibits path inflation -- end-to-end paths can be significantly longer than necessary. We present a trace-driven study of 65 ISPs that characterizes the root causes of path inflation, namely topology and routing policy choices within an ISP, between pairs of ISPs, and across the global Internet. To do so, we develop and validate novel techniques to infer intra-domain and peering policies from end-to-end measurements. We provide the first measured characterization of ISP peering policies. In addition to "early-exit," we observe a significant degree of helpful non-early-exit, load-balancing, and other policies in use between peers. We find that traffic engineering (the explicit addition of policy constraints on top of topology constraints) is widespread in both intra- and inter-domain routing. However, intra-domain traffic engineering has minimal impact on path inflation, while peering policies and inter-domain routing lead to significant inflation. We argue that the underlying cause of inter-domain path inflation is the lack of BGP policy controls to provide convenient engineering of good paths across ISPs.
Battle Engine Aquila: Prima's Official Strategy Guide
Authors: Jonathan Robinson
Venue:  (2003)

:Start Your Engines! ·How to beat each episode, which mech to use, and which copilot works best ·Detailed specs on main military equipment ·Comprehensive character profiles and back history ·Detailed walkthroughs of each mission ·How to beat every boss 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 Role of Inhibition in Asynchronous Consistent-Cut Protocols
Authors: Kimberly E. Taylor
Venue:  (1989)

We present results relevant to the development of consistent-cut protocols. Consistent-cut protocols are those which are based on finding a consistent global state in an underlying distributed computation; they are used for a variety of applications such as system checkpointing and deadlock detection. We formally define what it means for a protocol to be non-inhibitory, which intuitively means that it does not prevent any actions from occurring in an underlying system computation. We prove that there is no non-inhibitory consistent-cut protocols for FIFO systems of one message per bidirectional channel (up to $\frac {1}{2} (n^{2} n$, for completely connected networks). We present two protocols, one non-inhibitory requiring up to two messages between each pair of neighboring nodes in a network and the other inhibitory and requiring only $3(n 1)$ messages total. In most networks, these results illustrate a tradeoff between the amount of necessary communication and the willingness to inhibit actions of the underlying system. Additionally, our inhibitory protocol also works for non-FIFO systems, thus illustrating that the inhibitory condition is exactly what is required to develop consistent-cut protocols for non-FIFO systems which satisfy our model.
NetMars: Next-Generation Digital Image Library System
Authors: Hirokazu Nagasawa, Nobuhiro Omori, Masakazu Nishino
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

A next-generation digital image library system called NetMars has been developed. This system enables moving pictures on the network to be retrieved and viewed, and provides simple compiling functions for rearranging retrieved moving pictures.With NetMars, specific proposals are made for copyright processing, focusing on secondary usage as a new method for distributing video contents. NetMars applies CORBA-based [1] object-oriented technology in a distributed processing environment. It emphasizes mutual interconnectivity and provides a mechanism for the issuing, distribution, and sharing of information among image libraries existing on multiple networks.
A BICS for CMOS Opamps by Monitoring the Supply Current Peak
Authors: J. Font, J. Ginard, E. Isern, M. Roca, J. Segura, E. García
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We present a Built-In-Current-Sensor (BICS) based on monitoring the supply current peak of CMOS opamps using the oscillation-test-strategy. The BICS takes a weighed sample of the current through each opamp current branch and monitors the peak value under oscillation. An envelope detector and additional digital circuitry is used to provide a pass/fail flag. Simulationresults demonstrate a high defect coverage with a very small impact on the opamp nominal operation.
An Intuitionistic Predicate Logic Theorem Prover
Authors: Dan Sahlin, Torkel Franzen, Seif Haridi
Venue:  (1989)

A complete theorem prover for intuitionistic predicate logic based on the cut-free calculus is presented. It includes a treatment of "quasi-free" identity based on a delay mechanism and a special form of unification. Several important optimizations of the basic algorithm are introduced. The resulting system is available in source form from SICS; an Appendix gives some idea of its performance.