ppxscal/embedding_network huggingface dataset:
NetRAP - A Network Resource Allocation Protocol for IP over Ethernet
Authors: Martin Gitsels, Hans Eberle, Christian Kleitsch
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

For more than a decade, IP over Ethernet has been the dominating local area network technology because it is cost-efficient, simple and reliable. Unfortunately, it does not support the transport of continuous data as generated by multimedia applications. The large number of IP installations makes it necessary to find ways to provide support for multimedia applications in existing network environments without making interfaces used by existing applications incompatible. In this paper, we present the design, implementation and evaluation of the Network Resource Allocation Protocol NetRAP. NetRAP extends IP in that it allows applications to allocate bandwidth. Access to the network happens in two phases. In the first phase, a token-based access protocol is used to give applications with bandwidth reservations access to the network. In the second phase, the network is operated in normal CSMA/CD mode giving all other applications without bandwidth reservations the opportunity to access the network. For this purpose, we have extended an existing IP stack with a transport protocol able to control access times. Our performance measurements show that NetRAP adds little overhead. Since the implementation of NetRAP only requires few modifications of existing protocol software and, moreover, does not invalidate existing networked applications, it offers a simple and cost-efficient alternative to other more complex solutions.
Design Considerations of Scaled Sub-0.1 µm PD/SOI CMOS Circuits
Authors: C. T. Chuang, R. V. Joshi, R. Puri, K. Kim
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper reviews the circuit design considerationsof scaled sub-0.1 µm partially-depleted SOI (PD/SOI)CMOS circuits for high-performance digital applications.The impact of technology/device scaling and design challengesare highlighted.Unique design aspects and issuesresulting from the scaling of PD/SOI device structure,such as parasitic bipolar effect and reduced-VTleakage, hysteretic VT variation, low-voltage impact ionization,higher VT,lin to maintain adequate VT,sat; scaling/thinning of Si film, gate-to-body tunneling current,self-heating, soft error rate (SER), and the introductionof strained-Si channel on SOI are addressed.
Research report: DataSpace: 3-D visualizations of large databases
Authors: V. Anupam, S. Dar, T. Leibfried, E. Petajan
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

DataSpace is a system for interactive 3-D visualization and analysis of large databases. DataSpace utilizes the display space by placing panels of information, possibly generated by different visualization applications, in a 3-D graph layout, and providing continuous navigation facilities. Selective rearrangements and transparency can be used to reduce occlusion or to compare or merge a set of images (e.g. line graphs or scatter plots) that are aligned and stacked in depth. A prototype system supporting the basic 3-D graphic operations (layout, zoom, rotation, translation, transparency) has been implemented. We provide several illustrative examples of DataSpace displays taken from the current system. We present the 3-D display paradigm, describe the query, layout and rendering steps required to create a display, and discuss some performance issues.
Pervasive Query Processing
Authors: Tobias Mayr, Praveen Seshadri
Venue:  (1999)

We propose a radical departure from the architecture of conventional server-centered database query processing systems. Instead, we propose pervasive query processing on every component of the system: the server, the clients, and the storage components. The demands of modern applications and the current technology trends suggest that it is a significant limitation to require that all query processing is confined to the server. Consequently, we develop an architecture that is based on query processing engines that are integrated on every site of the database system. These software platforms that allow the execution of portable database programs on a variety of underlying physical platforms are called Database Virtual Machines.
Dynamic Model for Maintenance and Testing Effort
Authors: F. Calzolari, P. Tonella, G. Antoniol
Venue: Proceedings of the International Conference on Software Maintenance (1998)

The dynamic evolution of ecological systems in which predators and prey compete for surviving has been investigated by applying suitable mathematical models. Dynamic systems theory provides a useful way to model interspecie competition and thus the evolution of predators and prey populations. This kind of mathematical framework has been shown to be well suited to describe evolution of economical systems as well, where instead of predators and prey there are consumers and resources.Maintenance and testing activities absorbe the most relevant part of total life-cycle cost of software. Such economic relevance strongly suggests to investigate the maintenance and testing processes in order to find new models allowing software engineers to better estimate, plan and manage costs and activities. In this paper we show how dynamic systems theory could be usefully applied to maintenance and testing context, namely to model the dynamic evolution of the effort. When programmers start trying to recognize and correct code defects, while the number of residual defects decreases, the effort spent to find out any new defect has an initial increase, followed by a decline, in a similar way as prey and predators populations do.The feasibility of this approach is supported by the experimental data about two real world software projects.
Cycle-accurate Energy Measurement and High-Level Energy Characterization of FPGAs
Authors: Hyung Gyu Lee, Sungyuep Nam, Naehyuck Chang
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Field programmable gate arrays (FPGAs) play many importantroles, ranging from small glue logic replacement to System-on-Chipdesigns. Nevertheless, FPGA vendors can not accuratelyspecify the energy consumption information of their products onthe device data sheets because the energy consumption of FPGAs isstrongly dependent on target circuit including resource utilization,logic partitioning, mapping, placement and route. While majorCAD tools have started to report average power consumptionunder given transition activities, energy optimal FPGA designdemands more detailed energy estimation.In this paper, we introduce an in-house cycle-accurate energymeasurement tool and energy characterization schemes from lowlevel to operation level. The tool offers all the necessary capabilityto investigate the energy consumption of FPGAs for high-level,operation-based energy characterization, which is useful for high-level,system-wide energy estimation. It also includes features forlow-level energy characterization. We compare our tool with XilinxXPower and demonstrate state machine energy characterization ofan LCD controller and an SDRAM controller.
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
Authors: Stavros G. Kolliopoulos, Clifford Stein
Venue:  (1997)

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T}$ of connection requests. Every connection request in ${\cal T}$ is a vertex pair $(s_i,t_i),$ $1 \leq i \leq K.$ The objective is to connect a maximum number of the pairs via edge(vertex)-disjoint paths. The edge-disjoint path problem can be generalized to the multiple-source unsplittable flow problem where connection request $i$ has a demand $\rho_i$ and every edge $e$ a capacity $u_e.$ All these problems are NP-hard and have a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness of the problem, we study polynomial-time approximation algorithms. In this context, a $\rho$-approximation algorithm is able to route at least a $1/\rho$ fraction of the connection requests. Although the edge- and vertex-disjoint path problems, and more recently the unsplittable flow generalization, have been extensively studied, they remain notoriously hard to approximate with a bounded performance guarantee. For example, even for the simple edge-disjoint path problem, no $o(\sqrt{|E|})$-approximation algorithm is known. Moreover some of the best existing approximation ratios are obtained through sophisticated and non-standard randomized rounding schemes. In this paper we introduce techniques which yield algorithms for a wide range of disjoint-path and unsplittable flow problems. For the general unsplittable flow problem, even with weights on the commodities, our techniques lead to the first approximation algorithm and obtain an approximation ratio that matches, to within logarithmic factors, the $O(\sqrt{|E|})$ approximation ratio for the simple edge-disjoint path problem. In addition to this result and to improved bounds for several disjoint-path problems, our techniques simplify and unify the derivation of many existing approximation results. We use two basic techniques. First, we propose simple greedy algorithms for edge- and vertex-disjoint paths and second, we propose the use of a framework based on packing integer programs for more general problems such as unsplittable flow. A packing integer program is of the form maximize $c^{T}\cdot x,$ subject to $Ax \leq b,$ $A,b,c \geq 0.$ As part of our tools we develop improved approximation algorithms for a class of packing integer programs, a result that we believe is of independent interest.
Visualizing usability log data
Authors: M. Gray, A. Badre, M. Guzdial
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Our approach to testing graphical user interfaces involves logging large amounts of data. These logs capture information at the key press and mouse click level about how an application is used. Since the raw data is voluminous and not at a useful level of detail, we use analysis and visualization to find information that is interesting and useful to a usability analyst but was previously buried in the data. We call some of our custom visualizations "contextual" meaning they use key elements of the context the data was collected in as an organizing structure. We expect this type of visualization to be easier and faster to understand and more helpful than traditional charts. We hope that our finding a natural geometry for these visualizations will inspire others whose data apparently has no inherent geometry to find natural ways to visualize their data.
A Trust Region and Affine Scaling Method for Nonlinearly Constrained Minimization
Authors: Yuying Li
Venue:  (1994)

(The following contains mathematical formulae and symbols that may become distorted in ASCII text.) A nonlinearly constrained optimization problem can be solved by the exact penalty approach involving nondifferentiable functions (summation(i) of |ci(x)|) and (summation(i) of max(0,ci(x))). In the paper, a trust region affine scaling approach based on a 2-norm subproblem is proposed for solving a nonlinear l 1 problem. The (quadratic) approximation and the trust region subproblem are defined using affine scaling techniques. Explicit sufficient decrease conditions based on the approximations are suggested for obtaining a limit point satisfying complementarity, Kuhn-Tucker conditions, and second order necessary conditions. In global convergence analysis of the method is presented in [4]. Keywords: nonlinearly constrained minimization, trust region, sufficient decrease conditions, affine scaling, exact penalty, nonlinear l 1 problem, Newton step
Detecting Moving Shadows: Algorithms and Evaluation
Authors: Andrea Prati, Ivana Mikic, Mohan M. Trivedi, Rita Cucchiara
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Moving shadows need careful consideration in the development of robust dynamic scene analysis systems. Moving shadow detection is critical for accurate object detection in video streams since shadow points are often misclassified as object points, causing errors in segmentation and tracking. Many algorithms have been proposed in the literature that deal with shadows. However, a comparative evaluation of the existing approaches is still lacking. In this paper, we present a comprehensive survey of moving shadow detection approaches. We organize contributions reported in the literature in four classes two of them are statistical and two are deterministic. We also present a comparative empirical evaluation of representative algorithms selected from these four classes. Novel quantitative (detection and discrimination rate) and qualitative metrics (scene and object independence, flexibility to shadow situations, and robustness to noise) are proposed to evaluate these classes of algorithms on a benchmark suite of indoor and outdoor video sequences. These video sequences and associated ¿ground-truth¿ data are made available at http://cvrr.ucsd.edu/aton/shadow to allow for others in the community to experiment with new algorithms and metrics.
Prism: A Distributed VLSI Design System
Authors: G N Sullivan, B J Rosenberg, T M Jones, F D Kotz, James R Nusbaum, W J O''Neil, Herve Tardif
Venue:  (1987)

Chip and cell design take several forms. There are mask-level systems, symbolic-level systems, silicon compilers, and standard cell systems, just to name a few. Many of these forms can be used together to help create an entire design. This design paper describes a symbolic design system called Prism. The motivation for designing Prism arose from the desire to improve symbolic-to-mask compaction - specifically in the VIVID system. Current compactors run as totally batch processes. Running batch, a compactor must either smash the chip hierarchy and compact the entire chip as one cell or compact individual cells, making assumptions about the environment and connections for each cell. In either case, the area of the mask suffers. Also, compactors can take an extraordinary amount of time, and one small change - even if it would make no change in the area of the compacted mask - requires a total recompaction. Experiences with using and creating VIVID indicated more reasons to build Prism. VIVID is considered one of the best existing symbolic systems, but strides in state-of-the-art communications, user interfaces, and design automation software engineering have left it behind. Prism is a descendant of VIVID, but Prism is a new model for symbolic design.
Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks
Authors: J. Kadirire, G. Knight
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms.
A novel upgrade path for transparent optical networks based on wavelength reuse
Authors: V. Tandon, M. Wilby, F. Burton
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Passive optical networks (PONs) provide an economical method of delivering a wide variety of services to a small number of customers. Using optical fibre amplifiers, PONs can be aggregated to form transparent optical networks (TONs) serving a very large customer base. However, the effective bandwidth per user is limited, particularly in the upstream direction. In the future, customers will demand increasingly high bandwidth services requiring TONs to be regularly upgraded. A WDM TON upgrade is proposed based on a novel wavelength reuse scheme in which information is routed passively using optical filters without the need for electronic switching, buffering, wavelength conversion or network synchronisation. Wavelengths are dynamically allocated to customers, enabling bandwidth to be offered on demand.
Modular Composition and Verification of Transaction Processing Protocols
Authors: Vasudevan Janarthanan, Purnendu Sinha
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Establishing the correctness of reliable distributed protocolssupporting critical applications necessitates modular/compositional approaches to tackle the inherent complexityof these protocols. Efforts involved in the specificationand verification of these reliable distributed protocolscan be considerably reduced if the protocol is composed utilizingsmaller components (building-blocks) possessing individualfunctionalities that are integral parts of the overallprotocol operation. In this paper we present the modularcomposition of a transaction processing protocol, namelythe three-phase commit (3PC) protocol utilizing concepts ofcategory theory. Specifically, we illustrate how the overallglobal properties of the protocol can be proved by utilizingconstructs of local sub-properties of the inherent buildingblocks of the 3PC protocol.
A TTCN-3 Based Online Test and Validation Platform for Internet Services
Authors: Peter H. Deussen, George Din, Ina Schieferdecker
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Management of services over large distributed systems together with the growing complexity of underlying technologies has become a challenge in the present time. Faults can occur anywhere in a distributed system. Online validation addresses the activity of evaluating the behavior of services and service environments in the production phase in order to determine functional faults immediately.In this paper, we present our work on the design and implementation of an online validation platform. We describe a generic architecture, which can be instntiated for implementing validation systems for any type of distributed environments. We also present our experiences in using TTCN-3 to implement an online validation system for Active Network environments.
Virtual memory transaction management
Authors: Michael Stonebraker
Venue: ACM SIGOPS Operating Systems Review (1984)

In this paper we examine the consequences of an operating system providing transaction management in an environment where files are bound into a user's address space. The discussion focuses on inherent limitations in providing concurrency control and crash recovery services in this environment and on hardware extensions needed to overcome these deficiencies.
Dependent Intersection: A New Way of Defining Records in Type Theory
Authors: Alexei Kopylov
Venue:  (2000)

Record types are an important tool for programming and dependent record types are proven to be very useful for program specification and verification. Unfortunately all known embedding of the dependent record type in the type theory had some imperfections. In this paper we present a new type constructor, dependent intersection that allows us to define records that combine the most advantages of previously known approaches, while avoiding most of their disadvantages.
Family of complex Hadamard transforms: relationship with other transforms and complex composite spectra
Authors: S. Rahardja, B. J. Falkowski
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Relationship of the recently introduced family of unified complex Hadamard transforms with other transforms used in binary and multiple-valued logic design are investigated in this paper. All the complex Hadamard matrices can be generated by a common unifying formula presented here. Only half of all possible 64 unified complex Hadamard transforms have half-spectrum property. The existence of such a property for 32 transformation matrices is proven for the first time in this paper. Half-spectrum property is important as h reduces the required computer storage by half when compared to other transforms operating on complex numbers. The method is also presented to evaluate complex Hadamard spectra of AND, OR, and XOR of Boolean functions directly from the spectra of the separate Boolean functions. The results are given using a general coding scheme, and different possible codings of Boolean functions are discussed. Moreover, new definition of the convolution operation called complex convolution is derived. Different properties of such a convolution are presented. Theorem giving final formulae for composite complex Hadamard spectra of Boolean functions is stated in terms of complex convolution. By using presented methods, many of the Boolean operations in original domain can be represented much simpler in terms of their composite complex spectra.
On Log-Tape Isomorphisms of Complete Sets
Authors: Juris Hartmanis
Venue:  (1977)

In this paper we study $\log n$-tape computable reductions between sets and investigate conditions under which $\log n$-tape reductions between sets can be extended to $\log n$-tape computable isomorphisms of these sets. As an application of these results we obtain easy to check necessary and sufficient conditions that sets complete under $\log n$-tape reductions in NL, CSL, P, NP, PTAPE, etc. are $\log n$-tape isomorphic to the previously known complete sets in the respective classes. As a matter of fact, all the "known" complete sets for NL, CSL, P, NP, PTAPE, etc. are now easily seen to be, respectively, $\log n$-tape isomorphic. These results strengthen and extend substantially the previously known results about polynomial time computable reductions and isomorphisms of NP and PTAPE complete sets. Furthermore, we show that any set complete in CSL, PTAPE, etc. must be dense and therefore, for example, cannot be over a single letter alphabet.
Video-on-Demand Server Efficiency through Stream Tapping
Authors: Steven W. Carter, Darrell D. E. Long
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Efficiency is essential for Video-on-Demand (VOD) to be successful. Conventional VOD servers are inefficient; they dedicate a disk stream for each client, quickly using up all available streams. However, several systems have been proposed that allow clients to share streams. We present a new system called stream tapping that allows a client to greedily ``tap'' data from any stream on the VOD server containing video data the client can use. This is accomplished through the use of a small buffer on the client set-top box and requires less than 20% of the disk bandwidth used by conventional systems for popular videos. We present a description and analysis of the stream tapping system as well as comparisons between it and other efficiency-improving systems.