ppxscal/embedding_network huggingface dataset:
On the Interaction Between an Operating System and Web Server
Authors: David J. Yates, Virgilio Almeida, Jussara M. Almeida
Venue:  (1997)

Abstract This paper examines how and why web server performance changes as the workload at the server varies. We measure the performance of a PC acting as a standalone web server, running Apache on top of Linux. We use two important tools to understand what aspects of software architecture and implementation determine performance at the server. The first is a tool that we developed, called WebMonitor, which measures activity and resource consumption, both in the operating system and in the web server. The second is the kernel profiling facility distributed as part of Linux. We vary the workload at the server along two important dimensions: the number of clients concurrently accessing the server, and the size of the documents stored on the server. Our results quantify and show how more clients and larger files stress the web server and operating system in different and surprising ways. Our results also show the importance of fixed costs (i.e., opening and closing TCP connections, and updating the server log) in determining web server performance.
Nested Annealing: A Provable Improvement to Simulated Annealing
Authors: Sanguthevar Rajasekaran, H J Reif
Venue:  (1987)

Simulated Annealing is a family of randomized algorithms for solving multivariate global optimization problems. Empirical results from the application of Simulated Annealing algorithms to certain {\em hard} problems including certain types of NP-complete problems demonstrate that these algorithms yield better results than known heuristic algorithms. But for the worst case input, the time bound can be exponential. In this paper, for the first time, we show how to improve the performance of Simulated Annealing algorithms by exploiting some special properties of the cost function to be optimized. In particular, the cost functions we consider are {\em small-separable}, with parameter $s(n)$. Simulated Annealing can be shown to have expected run time $2 ^ {\Omega (n)}$ whereas our improved algorithm has expected performance $2 ^ {0(s(n))}$. Thus for example, in many vision and VLSI layout problems, for which $s(n) ~=~ 0( \sqrt n )$, our time bound is $2 ^ 0 ( \sqrt n )$ rather than $2 ^ 0(n)$.
A Modest Proposal for Preventing Internet Congestion
Authors: Andrew Odlyzko
Venue:  (1997)

A simple approach, called PMP (Paris Metro Pricing), is suggested for dealing with congestion in packet networks such as the Internet. It is to partition a network into several logical networks, each of which would treat all packets equally on a best effort basis, just as the current Internet does. There would be no formal guarantees of quality of service. The separate networks would differ only in the prices paid for using them. Networks with higher prices would attract less traffic, and thereby provide better service. Price would be the primary tool of traffic management.
The converging flows problem: an analytical study
Authors: C. Roche, N. T. Plotkin
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

When multiple systems are interconnected through a high-speed backbone network and communicate without resource reservation, under certain conditions a severe overload can appear at the destination system. This problem, called the converging flows problem, can be alleviated by use of a feedback control mechanism that coordinates the emission of the sources. The authors present a dynamic resource management mechanism that both controls the losses at the congested node and attempts to optimize resource utilization. In fact it steers the entire system into a desirable operating regime. They study analytically the behavior of the system under such a control and show that it can be reduced with a few approximations to a well-known physical system. This allows to infer optimal values for the parameters of the command algorithm, and the authors show that these values have a natural physical meaning to the system.
Trading Consistency for Availability in Distributed Systems
Authors: Roy Friedman, Ken Birman
Venue:  (1996)

This paper shows that two important classes of actions, {\em non left commuting}\/ and {\em strongly non commuting}, cannot be executed by concurrent partitions in a system that provides serializable services. This result indicates that there is an inherent limitation to the ability of systems to provide services in a consistent manner during network partitions.
Efficient Implementation of Software Release Consistency on Asymmetric Distributed Shared Memory
Authors: Junpei Niwa, Tatsushi Inagaki, Takashi Matsumoto, Kei Hiraki
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We have proposed an ``Asymmetric Distributed Shared Memory: ADSM'', that provides users with efficient shared memory model. The ADSM is a hybrid system that needs not only the operating system support but also the compiler support. The ADSM executes a load instruction as the shared-read with the assistance of virtual memory mechanism. As for the shared-write, the ADSM executes a sequence of instructions for consistency management after the corresponding store instruction. We describe the algorithm to reduce overheads for consistency management. The algorithm coalesces a sequence of instructions for consistency management using the information of affine memory accesses. The coalescing algorithm is evaluated using the SPLASH-2 benchmark. The performance evaluation shows that the coalescing algorithm achieves the execution time improvement compared to the not-optimized result, ranging from 76% to 85%.
Experimental Determination of Micromachined Discrete and Continuous Device Spring Constants Using Nanoindentation Method
Authors: M. L. Chan, Francis E. H. Tay, V. J. Logeeswaran, K. Y. Zeng, Lu Shen, F. S. Chau
Venue: Analog Integrated Circuits and Signal Processing (2003)

A rapid and accurate static and quasi-static method for determining the out-of-plane spring constants of cantilevers and a micromachined vibratory sensor is presented. In the past much of the effort in nanoindentation application was to investigate the thin-film mechanical properties. In this paper, we have utilized the nanoindentation method to measure directly some micromachined device (e.g. microgyroscope) spring constants. The cantilevers and devices tested were fabricated using the MUMPS process and an SOI process (patent pending). Spring constants are determined using a commercial nanoindentation apparatus UMIS-2000 configured with both Berkovich and spherical indenter tip that can be placed onto the device with high accuracy. Typical load resolution is: 20 &mu;N to 0.5 N and a displacement resolution of 0.05 nm. Information was deduced from the penetration depth versus load curves during both loading and unloading.
Probabilistic Bottom-Up RTL Power Estimation
Authors: Ricardo Ferreira, A-M. Trullemans, Jose Costa, Jose Monteiro
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

We address the problem of power estimation at the register-transfer level (RTL). At this level, the circuit is described in terms of a set of interconnected memory elements and combinational modules of different degrees of complexity. We propose a bottom-up approach to create a simplified high-level model of the block behavior for power estimation, which is described by a symbolic local polynomial. We use an efficient gate-level modeling based on the {\it Polynomial Simulation} method and ZBDDs. We present a set of experimental results that show a large improvement on performance and robustness when compared to previous approaches.
Compaction-Based Parallelization
Authors: Alexander Aiken
Venue:  (1988)

We present a transformational system for extracting parallelism from programs. Our transformations generate code for synchronous parallel computers, such as Very Long Instruction Word and pipelined machines. The transformational system, which is based on percolation scheduling,is simple and uniform. There are four primitive transformations-three that perform code motion plus loop unrolling-from which all parallelizing algorithms are constructed. Our transformations are studied as a formal system. We define a formal measure of program improvement, and show that our transformations improve programs with respect to the measure. This formal approach allows a number of results on the expressive power of our transformations. Most importantly, we show that it is possible to compute limits of infinite sequences of the primitive transformations. This leads to a number of new algorithms for software pipelining, including: an algorithm that generates optimal code for loops without tests, an algorithm for software pipelining of multiple nested loops, and a general solution to the problem of software pipelining in the presence of tests. Using the four primitives and the limit-taking transformation, it is possible to express the classical parallelization techniques for vector, multiprocessor, and VLIW machines, such as doacross, the wavefront method, loop interchange, trace scheduling, and a simple form of vectorization. Thus, our transformational system can be viewed as a formal foundation for the area of parallelization.
Programming Role Play Games With Direct X
Authors: Jim Adams
Venue:  (2002)

:How many times have you spent countless hours completely absorbed in conquering the latest role-playing game? Want to experience the thrill of creating your own captivating role-playing game? This book is your guide to doing just that. Covering everything that you need to create a role-playing game -- working with graphics and combat engines, handling players, and making your game multiplayer-capable -- this book provides a detailed look at the essential components of role-playing games. It begins with helpful information on storyline development and design issues specific to role-playing games and then progresses to programming basics and RPG-specific gaming code. Finally, wrap up your project with valuable tips for promoting, marketing, and publishing your game.
A Variable Window Approach to Early Vision
Authors: Yuri Boykov, Olga Veksler, Ramin Zabih
Venue:  (1997)

Early vision relies heavily on rectangular windows for tasks such as smoothing and computing correspondence. While rectangular windows are efficient, they yield poor results near object boundaries. We describe an efficient method for choosing an arbitrarily shaped connected window, in a manner which varies at each pixel. Our approach can be applied to many problems, including image restoration and visual correspondence. It runs in linear time, and takes a few seconds on traditional benchmark images. Performance on both synthetic and real imagery with ground truth appears promising.
Design and Analysis of the High-Performance Interconnected Banyan Switching Fabric(IBSF)
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents a novel MIN with multiple outlets called the Interconnected Banyan Switching Fabric(IBSF). A MIN with multiple outlets provides multiple paths to the same destination so that it can support more bandwidth than nonblocking networks. The IBSF consists of several banyan networks interconnected among them. The IBSF provides L*(N/2) paths between a source and a destination where L is the number of banyan networks and N is the size of the network. The throughput of the IBSF is analyzed with an analysis model as well as simulations and is compared with other types of MINs with multiple outlets such as Tandem Banyan Switching Fabric(TBSF) and Piled Banyan Switching Fabric(PBSF). We show that the IBSF provides the best throughput and latency. The suitability of the IBSF as an ATM switch has also been studied and its throughput is analyzed.
Reducibility among Geometric Location-Allocation Optimization Problems
Authors: Chanderjit Bajaj
Venue:  (1984)

Three different classes of multiple points location-allocation problems in the Euclidean plane are considered under a discrete optimization criterion which minimizes the maximum cost based on certain interpoint distances. Each of these classes of geometric optimization problems is studied with three different distance metrics (Euclidean, Rectilinear, Infinity) as well as for feasible solution sets in the plane which are both discrete and infinite. All of these problems are shown to be polynomial-time reducible to each other and furthermore D^{p} complete.
A New Method for Concurrent Checking by Use of a 1-out-of-4 Code
Authors: M. Gössel, A. Dmitiriev, Vl. Saposhnikov, V. Saposhnikov
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

In this paper, a new method for concurrent checking is proposed. For an arbitrarily given combinational circuit f an additional complementary circuit g is determined such that for every input the componentwise modulo 2 sum of the corresponding outputs of f and g is an element of a considered code as long as no error occurs. The new method of concurrent checking is developed for the concrete case of 1-out-of-4 codes.
Scheduling sport tournaments using constraint logic programming
Authors: Andrea Schaerf
Venue:  (1997)

We tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally define the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The first step is the creation of a tournament pattern and is based on known graph-theoretic results. The second one is a constraint-based depth-first branch and bound procedure that assigns actual teams to numbers in the pattern. The procedure is implemented using the finite domain library of the constraint logic programming language \eclipse. Experimental results show that, in practical cases, the optimal solution can be found in reasonable time, despite the fact that the problem is NP-complete.
Practical Cryptography, 1 edition
Authors: Niels Ferguson, Bruce Schneier
Venue:  (2003)

:In today's world, security is a top concern for businesses worldwide. Without a secure computer system, you don't make money, you don't expand, and -- bottom line -- you don't survive. Cryptography holds great promise as the technology to provide security in cyberspace. Amazingly enough, no literature exists about how to implement cryptography and how to incorporate it into real-world systems. With Practical Cryptography, an author team of international renown provides you with the first hands-on cryptographic product implementation guide, bridging the gap between cryptographic theory and real-world cryptographic applications.
The NOESY Jigsaw: Automated Protein Secondary Structure and Main-Chain Assignment from Sparse, Unassigned NMR Data
Authors: Chris Bailey-Kellogg, Alik Widge, John J. Kelley, Marcelo J. Berardi, John H. Bushweller, Bruce R Donald
Venue:  (1999)

High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and function at rates comparable to current gene-sequencing technology. This paper presents the Jigsaw algorithm, a novel high-throughput, automated approach to protein structure characterization with nuclear magnetic resonance (NMR). Jigsaw consists of two main components: (1) graph-based secondary structure pattern identification in unassigned heteronuclear NMR data, and (2) assignment of spectral peaks by probabilistic alignment of identified secondary structure elements against the primary sequence. Jigsaw''s deferment of assignment until after secondary structure identification differs greatly from traditional approaches, which begin by correlating peaks among dozens of experiments. By deferring assignment, Jigsaw not only eliminates this bottleneck, it also allows the number of experiments to be reduced from dozens to four, none of which requires 13C-labeled protein. This in turn dramatically reduces the amount and expense of wet lab molecular biology for protein expression and purification, as well as the total spectrometer time to collect data. Our results for three test proteins demonstrate that we are able to identify and align approximately 80 percent of alpha-helical and 60 percent of beta-sheet structure. Jigsaw is extremely fast, running in minutes on a Pentium-class Linux workstation. This approach yields quick and reasonably accurate (as opposed to the traditional slow and extremely accurate) structure calculations, utilizing a suite of graph analysis algorithms to compensate for the data sparseness. Jigsaw could be used for quick structural assays to speed data to the biologist early in the process of investigation, and could in principle be applied in an automation-like fashion to a large fraction of the proteome.
Multi-Level Fault Injection Experiments Based on VHDL Descriptions: A Case Study
Authors: R. Leveugle, K. Hadjiat
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

The probability of transient faults increases with the evolution of technologies. There is a corresponding increased demand for an early analysis of erroneous behaviors. This paper reports on results obtained with SEU-like fault injections in VHDL descriptions of digital circuits. Several circuit description levels are considered, as well as several fault modeling levels. These results show that an analysis performed at a very early stage in the design process can actually give a helpful insight into the response of a circuit when a fault occurs.
RaBeCa: A Hybrid Case-Based Reasoning Development Environment
Authors: Ricardo B. Sovat, Sandra Maria Aluísio, André C. P. L. F. de Carvalho
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This article presents the main features of a new environment for case-based reasoning systems development, RaBeCa. The software, developed to run under Windows, aims to provide an architecture open enough to accept external contributions and allow experiments with CBR, including several Artificial Intelligence common approaches. The system already uses a Neural Network. A small introduction to the Case-Based Reasoning paradigm and a brief description of previous analogous systems are shown.
Aspects of Computational Circuit Analysis
Authors: M W Coughran,  Jr., Eric Grosse, J D Rose
Venue:  (1986)

A hierarchical formulation of the differential-algebraic systems describing circuit behavior is presented. A number of algorithms that have proven effective are reviewed. These include multidimensional splines that preserve monotonicity, sparse direct and iterative methods for the linear equations, damped-Newton and Newton-iterative techniques for the nonlinear equations, continuation methods, and low-order time-integration formulae. Some aspects of time macromodeling are described.
A Non-Parametric Approach to Software Reliability Prediction
Authors: May Barghout, Bev Littlewood, Abdallah Abdel-Ghal, y
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

The large literature on software reliability assessment and prediction is essentially concerned with parametric models: the inter-failure time random variables are assumed to come from parametric families of distributions. Such models involve quite strong assumptions. The motivation for the present work is to relax these assumptions and - in the tradition of non-parametric statistics generally - 'allow the data to speak for themselves'. We present a new non-parametric model for reliability prediction which is based upon the use of kernel density estimators, and compare its accuracy on some real data sets with the predictions that come from several of the better conventional models. These initial results are encouraging: the new models seem to perform as well as the best of the earlier models.
Redundant Complex Arithmetic and Its Application to Complex Multiplier Design
Authors: Takafumi Aoki, Ken-ichi Hoshi, Tatsuo Higuchi
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper presents a class of complex number representations called Redundant Complex Number Systems (RCNSs), which are useful for designing VLSI signal processors with complex arithmetic capability. A redundant complex number system is defined as an imaginary-radix number system having a redundant integer digit set. This makes possible the construction of high-speed complex arithmetic circuits: examples include a complex-number parallel adder with no carry propagation chain, and a complex-number multiplier using fast binary-tree addition structure. This paper also presents the experimental fabrication of the RCNS-based complex multiplier in 0.5um CMOS technology.
Incorporating Contextual Character Geometry in Word Recognition
Authors: Hanhong Xue, Venu Govindaraju
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Contextual character geometry is the geometric information available only when a character presents in the context of a word. Such information includes a character's location and relative size in the entire word image, forming a bounding box of the character. The differences between the geometry of an image segment and the expected geometry of a candidate character are considered as additional features to refine the recognition of individual characters. A typical word recognizer based on over-segmentation and segment-combination is used to illustrate the use of these new features and experimental results have shown significant improvement of recognition accuracy, especially on large lexicons.
WiFi Security, 1 edition
Authors: Stewart S. Miller
Venue:  (2003)

:Wireless technology offers businesses a world of strategic advantages -- and a host of security problems. But thanks to McGraw-Hill's WiFi Security, your company's mission-critical data can be safeguarded, even against hackers intent on exploiting vulnerabilities in your business network brought on by wireless communications. 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
Bottom-up scientific databases based on sets and their top-down usage
Authors: M. Nakata, T. Hochin, T. Tsuji
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The paper proposes a data model for a scientific database. Scientific applications require the DBMS support of the discovery process. Unstructured or semi-structured scientific data is required for storage in databases, and manipulation as structured data. To meet these requirements, the proposed data model has the following features. It is based on the concept of sets in order that a database has flexible structure, a perspective of an object is represented with the subset of the object, and a collection of objects are naturally represented. A data value is the principal element for expressing polymorphism and sharing data flexibly. A preliminary database is adopted in order to store unstructured or semi-structured data without any definition. The attribute of data called shape, which varies according to the creation or updating of data, is introduced to query a database. The authors present the application of the model to the archeological data in order to demonstrate its advantages.