ppxscal/embedding_network huggingface dataset:
On the Number of Views of Polyhedral Terrains
Authors: K P Agarwal, Micha Sharir
Venue:  (1993)

We show that the number of topologically-different orthographic views of a polyhedral terrain with $n$ edges is $O(n^{5+\epsilon})$, and that the number of topologically-different perspective views of such a terrain is $O(n^{8+\epsilon})$, for any $\epsilon<0$. Both bounds are almost tight in the worst case.
Performance Evaluation of Multidimensional Array Storage Techniques in Databases
Authors: Norbert Widmann, Peter Baumann
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Storing multidimensional data in databases is an important topic both in the industrial and scientific database communities. Arrays are offered as a multidimensional data structure by most programming languages. Conventional database systems, however, do not support arrays of arbitrary dimensionality and base type. RasDaMan is a DBMS integrating arrays as a first class data type offering both a declarative query language and a specialised storage structure for arrays.The work presented here evaluates the performance of queries on multidimensional array data stored in RasDaMan versus storage in a conventional RDBMS. In the relational system, the data is both mapped to relations and stored directly as binary data in BLOBs. The queries executed were modelled after queries common in scientific applications and decision support.
WorldWide Wi-Fi: Technological Trends and Business Strategies
Authors: Benny Bing, Teik-Kheong Tan
Venue:  (2003)

:Your success guide to the next wireless revolution The next watershed innovation in wireless technology is here: IEEE 802.11 wireless local area networks (LANs). Recent studies from IDC indicate that the Wi-Fi wireless LAN market will likely account for ninety percent of projected LAN equipment revenues by 2005a trend that promises to spill over into home wireless networks. Yet this amazing growth has also created confusion: Which version of 802.11 is best for vendors and end-users? What about solutions such as the a/g and a/b combinations of the 802.11 standards? In World Wide Wi-Fi: Technological Trends and Business Strategies, Teik-Kheong (TK) Tan and Benny Bing provide a clear, accessible road map of the Wi-Fi wireless LAN market. Unlike most books on wireless local area networks (WLANs), this must-have resource explains both the business and technology of WLANs, and offers ready-to-use tactics and strategies for thriving in this lucrative field. Along the way, youll also gain insight into the emerging Wi-Fi standards. World Wide Wi-Fi presents: Key technological issues related to the design and deployment of Wi-Fi wireless LANs An insiders look at market dynamics, market segmentation, service provider, enterprise, and chipset strategies The interrelationship between the 802.11a, b, and g standards And much more Supported by real statistics and case studies, plus profiles of suppliers, regulators, and other market players, this one-of-a-kind guide helps you create effective market penetration strategies and evaluate vendor-specific features. Ultimately, World Wide Wi-Fi defines the 802.11 market: its rapid expansion, its challenges, and its future. Most of all, its your invitation to profit from everything that this red-hot industry has to offer. Author Biography: Teik-Kheong (TK) Tan is Chair of the Wireless LANs Next Generation Committee of the IEEE 802.11 Standards Working Group. He also chairs the Wireless Interworking Group (a committee supported by IEEE 802.11 WG, ETSI-BRAN and MMAC). He is also the senior product manager for the Wireless LAN Product Line of Philips Semiconductors, San Jose, USA. Benny Bing is a research faculty member with the School of Electrical and Computer Engineering at the Georgia Institute of Technology. He is also the author of Wireless Local Area Networks: The New Wireless Revolution.
Robot vision using cellular neural networks
Authors: Marco Balsi, Xavier Vilasís-Cardona
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

We show how Cellular Neural Networks (CNNs) can provide the necessary image processing to guide an autonomous mobile robot in a maze made of black lines on a light surface. The system consists of a fuzzy controller performing the elementary navigation tasks fed by the result of processing the image only by CNN techniques. We use this solution to make some considerations on more difficult problems such as curved or dashed line following and obstacle avoidance.
WWW and VR technologies for network management applications
Authors: Jiann-Liang Chen
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Friendly user interface has been improved its efficiency for network management applications and reduction of the occurrence for emergency. Based on the advanced man-machine interface paradigm, virtual reality (VR), and the attractive and dynamic nature of WWW and Java language to build applications, we explore three approaches to manage broadband networks. These approaches which play the role of manager in SNMP manager-agent architecture include: 1) web-based manager; 2) Java-based manager; and 3) VR-based manager. From the results we believe that the WWW and VR technologies are the right niche for the network management applications.
Operating System Support for Mobile Agents
Authors: Dag Johansen, Robbert Van Renesse, Fred B. Schneider
Venue:  (1994)

An "agent" is a process that may migrate through a computer network in order to satisfy requests made by its clients. Agents implement a computational metaphor that is analogous to how most people conduct business in their daily lives: visit a place, use a service (perhaps after some negotiation), and then move on. Thus, for the computer illiterate, agents are an attractive way to describe network-wide computations. Agents are also useful abstractions for programmers who must implement distributed applications. This is because in the agent metaphor, the processor or "place" the computation is performed is not hidden from the programmer, but the communications channels are. Most current research on agents has focused on language design and application issues. The TACOMA project (Tromso And COrnell Moving Agents) has, instead, focused on operating system support for agents and how agents can be used to solve problems traditionally addressed by operating systems. We have implemented prototype systems to support agents using UNIX and using Tcl/Tk on top of Horus. This paper outlines insights and questions based on that experience. We discuss abstractions needed by an operating system to support agents, and discuss some problems that arise in connection with electronic commerce involving agents.
C# and Game Programming: A Beginner's Guide (Includes DirectX 9.0)
Authors: Salvatore A. Buono
Venue:  (2003)

:C# and Game Programming offers the beginning programmer a lighthearted, hands-on approach to learning the C# language through classic arcade game applications. Complete source code for games like Battle Bit, Asteroid Miner, and Battle Tennis demonstrates programming strategies and complements the comprehensive treatment of C# in the text. From the basics of writing algorithms, to adding graphics and sound to games, to advanced concepts such as the .Net framework and object-oriented programming, this book entertains while helping a novice develop into a full-fledged programmer. CDROM with working source code for arcade style games included.
Embedded Software Development Challenges in the Digital Signal Processing Era
Authors: John Linn
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The rapid growth of products that incorporate programmable Digital Signal Processor is a driving-force for improving the embedded software development process. DSP-based product development presents some difficult challenges for manufacturers. Several embedded software development trends can be anticipated as the industry seeks to overcome these difficulties.
On k-ary n-cubes: theory and applications
Authors: Weizhen Mao, David M. Nicol
Venue: Discrete Applied Mathematics (2003)

Many parallel processing applications have communication patterns that can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and tori. In this paper, combinatorial properties of k-ary n-cubes are examined. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These theoretical results are then applied to compute a lower bounding function in branch-and-bound partitioning algorithms and to establish the optimality of some irregular partitions.
A Polynomial Algorithm for Optimal Univariate Microaggregation
Authors: Stephen Lee Hansen, Sumitra Mukherjee
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Microaggregation is a technique used by statistical agencies to limit disclosure of sensitive microdata. Noting that no polynomial algorithms are known to microaggregate optimally, Domingo-Ferrer and Mateo-Sanz have presented heuristic microaggregation methods. This paper is the first to present an efficient polynomial algorithm for optimal univariate microaggregation. Optimal partitions are shown to correspond to shortest paths in a network.
Accelerated Variational Monte Carlo Method for Electronic Structure Simulation
Authors: Cyrus J. Umrigar
Venue:  (1991)

It is shown that variational quantum Monte Carlo simulations of systems containing heavy atoms can be greatly speeded up by using a generalization of the Metropolis method wherein each electron attempts moves appropriate to its length scale. Results are presented for Ne and Ar.
A Framework for Adaptive Routing
Authors: John Y. Ngai, Charles L. Seitz
Venue:  (1987)

No abstract available.
Total ordering on subgroups and cosets
Authors: Alexander Hulpke, Steve Linton
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We show how to compute efficiently a lexicographic ordering for subgroups and cosets of permutation groups and, more generally, of finite groups with a faithful permutation representation.
New GDM-Based Declustering Methods for Parallel Range Queries
Authors: S. Kuo, M. Winslett, Y. Cho, J. Lee
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Declustering is a well known technique to achieve high performance for queries on parallel databases. In this paper, we propose new General Disk Modulo (GDM) based declustering algorithms, GDM Cartesian and GDM Circle, for distributing uniformly distributed multidimensional datasets to parallel disks, for datasets of any dimension. We compare the performance of the new approaches with several existing declustering algorithms, using variable numbers of disks, and with variable shapes and dimensions of the datasets. Our results show that the new approaches significantly outperform the others for almost all configurations tested.
Parallel Multifrontal Solution of Sparse Linear Least Squares Problems on Distributed-memory Multiprocessors
Authors: Chunguang Sun
Venue:  (1994)

We describe the issues involved in the design and implementation of efficient parallel algorithms for solving sparse linear least squares problems on distributed-memory multiprocessors. We consider both the QR factorization method due to Golub and the method of corrected semi-normal equations due to Bjorck. The major tasks involved are sparse QR factorization, sparse triangular solution and sparse matrix-vector multiplication. The sparse QR factorization is accomplished by a parallel multifrontal scheme recently introduced. New parallel algorithms for solving the related sparse triangular systems and for performing sparse matrix-vector multiplications are proposed. The arithmetic and communication complexities of our algorithms on regular grid problems are presented. Experimental results on an Intel iPSC/860 machine are described. Keywords: parallel algorithms, sparse matrix, orthogonal factorization, multifrontal method, least squares problems, triangular solution, distributed-memory multiprocessors
A Reliable Clock Tree Design Methodology for ASIC Designs
Authors: Mely Chen Chi, Shih-Hsu Huang
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

In deep sub-micron era, an ASIC chip may contain millions of gates and have the requirements of low power and high performance. The ability to construct multiple clock trees effectively is very important. A clock tree design methodology is presented. At first we conducted many clock tree synthesis experiments, which explore various configurations of clock tree structure and layouts. Guidance for clock tree synthesis is then generated. By applying this guidance, the clock tree design procedure in ASIC design is simplified and the design time is shortened. The clock skews are within expected range. This methodology has been used to implement clock trees on the chips designed in the Computer and Communications Research Laboratories. Our experience shows that for single clock trees the intra-clock skew is confined within 0.1ns in one design pass for 0.35( CMOS technology chips. For multiple clock trees, which are originated from the same clock source, the inter-clock skew may also be controlled easily. This design methodology is proven to be a reliable method to implement clock trees on ASIC chips.
Primary-shadow consistency issues in the DRB scheme and the recovery time bound
Authors: K. H. Kim, L. Bacellar, C. Subbaraman
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

The distributed recovery block (DRB) scheme is an approach for realizing both hardware and software fault tolerance in real time distributed and parallel computer systems. We point out that in order for the DRB scheme to yield a high fault coverage and a low recovery time bound, some important consistency requirements must be satisfied by the replicated application tasks in a DRB computing station. Newly identified approaches for meeting the consistency requirements, which involve, among other things, integration of network surveillance and reconfiguration (NSR) techniques with the DRB scheme, are presented. The paper then presents an analysis of the recovery time bound of the DRB scheme. The analysis is based on a modular structured concrete implementation model of the DRB scheme for local area network (LAN) based distributed computer systems, which is called the DRB/T LAN scheme and incorporates an NSR scheme and the newly identified consistency ensuring mechanisms. Finally, we consider approaches for applying the DRB scheme to new types of application computation segments that were not considered before and then discuss approaches for meeting the consistency requirements in such DRB stations. These approaches broaden the application range of the DRB scheme significantly.
Simulating Value Chain Coordination with Artificial Life Agents
Authors: Torsten Eymann, Boris Padovan, Detlef Schoder
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The increasing use of information technology within and between companies yields changes in the predominant coordination mechanisms. On one hand it is argued that we witness an overall shift towards market-like coordination of business transactions, whereas others argue that we face more hierarchy-like coordination. In this paper a multi-agent system is described that globally coordinates a multiple step value chain either way by using local optimization rules of self-interested autonomous agents. In further research it will be analyzed how changes in setup parameters (e.g. transaction costs, cooperational behavior) will effect the predominant coordination mechanism among the artificial life agents.
Implementation of a hybrid encryption scheme for Ethernet
Authors: M. T. El-Hadidi, N. H. Hegazi, H. K. Aslan
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

A software-based implementation of a hybrid encryption scheme for Ethernet LAN is given. It uses a DES-type symmetric key for information exchange between communicating users. In addition, a Diffie-Hellman method is adopted for key distribution which incorporates an RSA-type public key scheme for securing the exchange of the symmetric key components. To facilitate distribution of public keys and to guarantee authenticity, a separate network entity called security management facility (SMF) is deployed. A brief description of the software components for the proposed hybrid encryption scheme is given, and a Petri net representation of the software operation is provided. In addition, evaluation of the proposed scheme is carried out on a prototype network, and the numerical values for the encryption time and the message transfer time are obtained to illustrate the feasibility of the new scheme.
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
Authors: Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivastava
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studies on human perception of audio and video streams have shown that bursty losses have the most annoying affects. Hence, addressing this issue is critical for multimedia applications such as Internet phone, video conferencing, distance learning, etc. Classical error handling schemes like retransmission and forward error recovery have the undesirable effects of (a) introducing timing variations, which is unacceptable for isochronous traffic, and (b) using up valuable bandwidth, potentially exacerbating the problem.This paper introduces a new concept called error spreading, which is a transformation technique that takes an input sequence of packets (from an audio or video stream) and permutes them before transmission. The packets are then un-permuted at the receiver before delivery to the application. The purpose is to spread out bursty network errors, in order to achieve better perceptual quality of the transmitted stream. Analysis has been done to determine the provable lower bound on bursty errors tolerable by this class of protocols.An algorithm to generate the optimal permutation for a given network loss rate is presented. While our previous work had focused on streams with no interframe dependencies, e.g. MJPEG encoded video, in this paper the technique is generalized to streams with interframe dependencies, e.g. MPEG encoded video. It is also shown how the error spreading approach can be used as a module to be plugged into any existing CM transmission protocol to help improve the perceptual quality of the data stream without changing the bandwidth requirement of the base protocol. Thus, this approach is orthogonal to traditional error handling techniques. Finally, results from an experimental evaluation are presented to validate our claims.
A cooperative packet recovery protocol for multicast video
Authors: N. F. Maxemchuk, K. Padmanabhan, S. Lo
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

In this paper we describe a protocol that improves the quality of multicast video or audio transmissions by recovering lost packets. The protocol is applied to a corporate intranet, and measurements indicate that significant improvements in audio/video quality are achieved. A unique characteristic of this protocol is that it can be used on current MBone sessions without changing the operation of the source or receivers. The improvement in quality can be restricted to a subset of the receivers, so that a service provider, that does not necessarily generate content, can use the protocol to improve reception for its own customers. A second unique characteristic is that only a small fraction of the receivers that obtain the benefits of the protocol are active participants. As a result the problems associated with large multicast groups, such as the number of control messages, is reduced. Finally, because of the differences between data and voice or video communications, many of the network parameters that vary between or during connections are changed rather than predicted. This is a much simpler operation.
Implementing Fault-Tolerant Distributed Objects
Authors: Kenneth P. Birman, Thomas A. Joseph, Thomas Raeuchle, Amr El Abbadi
Venue:  (1984)

This paper describes a technique for implementing $k$-resilient objects distributed objects that remain available, and whose operations are guaranteed to progress to completion, despite up to $k$ site failures. The implementation is derived from the object specification automatically, and does not require any information beyond what would be required for a non-resilient, non-distributed implementation. It is therefore unnecessary for an appplications programmer to have knowledge of the complex protocols normally employed to implement fault-tolerant objects. Our technique is used in ISIS, a system being developed at Cornell to support resilient objects.
Omega-storage: a self organizing multi-attribute storage technique for very large main memories
Authors: Jonas S. Karlsson, Martin L. Kersten
Venue:  (1999)

Main memory is continuously improving both in price and capacity. With this comes new storage problems as well as new directions of usage. Just before the millennium, several main memory database systems are becoming commercially available. The hot areas include boosting the performance of web-enabled systems, such as search-engines, and auctioning systems. We present a novel data storage structure -- the {\em $\Omega$-storage} structure, a high performance data structure, allowing automatically indexed storage of {\em very} large amounts of multi-attribute data. The experiments show excellent performance for point retrieval, and highly efficient pruning for {\em pattern searches}. It provides the balanced storage previously achieved by random kd-trees, but avoids their increased pattern match search times, by an effective assignment bits of attributes. Moreover, it avoids the sensitivity of the kd-tree to insert orders.
Optimal Control Dependence Computation and the Roman Chariots Problem
Authors: Keshav Pingali, Gianfranco Bilardi
Venue:  (1996)

The control dependence relation plays a fundamental role in program restructuring and optimization. The usual representation of this relation is the control dependence graph (CDG), but the size of the CDG can grow quadratically with the input program, even for structured programs. In this paper, we introduce the augmented postdominator tree, APT, a data structure which can be constructed in space and time proportional to the size of the program, and which supports enumeration of a number of useful control-dependence sets in time proportional to their size. Therefore, APT provides an optimal representation of control dependence. Specifically, the APT data structure supports enumeration of the set cd(e), which is the set of statements control dependent on control-flow edge e, of the set conds(w), which is the set of edges on which statement w is dependent, and of the set cdeq(w), which is the set of statements having the same control dependences as w. Technically, APT can be viewed as a factored representation of the CDG where queries are processed using an approach known as filtered search.