ppxscal/embedding_network huggingface dataset:
Confidence Interval Estimation of NHPP-Based Software Reliability Models
Authors: Liang Yin, Kishor S. Trivedi
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The software reliability growth models (such as NHPP models) are frequently used in software reliability prediction. Estimation of parameters in these models is often done by point estimation. However, some numerical problems arise and make the actual computation hard, especially for automated reliability prediction tools. Here confidence interval computation in Goel-Okumoto model and S-shaped model is studied.The upper and the lower bounds of the parameters can be obtained. For reliability prediction, we implement a simplified Bayesian approach, which delivers improved results. The bounds on the predicted reliability are also computed. Furthermore, numerical problems encountered in earlier point estimation methods are removed by this approach. Our results thus can be used as an important part of the assessment of software quality.
2D Texture Refinement Using Procedural Functions
Authors: E. Clua
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In Computer Graphics, aliasing is a problem which is always present when discrete elements are mapped to continuous functions or vice-versa. Although there is no general solution for this kind of problem, there are many techniques that aim at reducing the effects of aliasing.This work first discusses how interpolation methods are usually applied in order to correct this problem and shows the limitations of those techniques. It is then presented another solution for this problem, that can be used together with the interpolation. It increases the texture details, making use of procedural functions.
DPL: A Language for Instruction in CONTEMPORARY DATA PROCESSING CONCEPTS
Authors: Howard L. Morgan
Venue:  (1968)

The Data Processing Language (DPL) id designed with two aims. The first is to aid in teaching the concepts and techniques of contemporary data processing systems to those who need an appreciation of the field, but who do not need to become trined programmers. The second is to test a new method for organizing and programming large systems which share a common data base among several simultaneous users. The criteria for a contemporary data processing language are set forth and DPL is shown to meet them. These include remote terminal management, handling of shared data bases, file and device oriented input and output, and standard arithmetic and text processing features. In addition, simple syntax and extensive error detection and correction features fulfill important requirements of instructional computing systems. Interrupts are the basis for the new method of systems organization. The DPL programmer can specify conditions when interrupts should be generated, e.g., when the relation $X+Y=34$ is true, and can specify the routine which should be called to process each interrupt. The DPL monitoring system detects the occurrence of these conditions and generates the interrupts. Some of these variables involved in conditions which can generate interrupts may be in files. The programmer can attach to those files the interrupt processing routines and the interrupt conditions. When the file is read in, the system begins monitoring these attached interrupt conditions and may execute the attached interrupt processing routines, which are called file tags, even though the user who placed the tags on the file is no longer in control. Several interrupts may be generated as the result of the execution of a single DPL statement, and interrupts may be generated while executing an interrupt processing routine. Therefore, an algorithm is presented which schedules the execution of the interrupt processing routines. A management information system may thus be composed of two parts: a data base of tagged files, and a supervisor program which handless interaction with remote terminals and performs background tasks. This new organization is shown to have value both for its instructional clarity and for designing and programming large integrated information systems.
A finite automaton learning system using genetic programming
Authors: Herman H. Ehrenburg, H. A.N. Maanen
Venue:  (1994)

This report describes the Finite Automaton Learning System (FALS), an evolutionary system that is designed to find small digital circuits that duplicate the behavior of a given finite automaton. FALS is developed with the aim to get a better insight in learning systems. It is also targeted to become a general purpose automatic programming system. The system is based on the genetic programming approach to evolve programs for tasks instead of explicitly programming them. A representation of digital circuits suitable for genetic programming is given as well as an extended crossover operator that alleviates the need to specify an upper bound for the number of states in advance.
A Geo-Data Server for Antarctic Data
Authors: Luciano Fortunati, Ovidio Salvetti, Valeria Costa, Roberto Demontis, Andrea Galligani, Carlo Carlesi, Stefania Biagioni
Venue:  (1999)

This project is the natural evolution of the South Pole System for Antarctic Data Exchange [1] and has as main objectives the organisation, homogenisation, standardisation and diffusion of all the data acquired by the National Program for Research in Antarctica. A main activity is to design and implement a Geo-Data Server [2, 3, 4], constituted by a system storing consolidated data for remote consultation. Main features of Geo-Data Server are the definition of an Antarctic cartographic and image database, according to the international standards, a relational catalog, containing meta-information about the data archived in Geo-Data Server and a high-level interface to access the system. At present, a simulation prototype is under construction [5], composed of a UNIX workstation and three high-performance PCs networked, where the data managed are supplied by two Data Centres of South Pole System for Antarctic Data Exchange (GEO Centre, ENEA Casaccia, for remote sensing data, and TER Centre, Dept. of Earth Science, University of Siena, for cartographic data). In this paper, the first results of the approach followed are shown.
A Parallel Tabu Search and Its Hybridization with Genetic Algorithms
Authors: Takashi Matsumura, Morikazu Nakamura, Shiro Tamaki
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

This paper proposes two parallel meta-heuristics. One is a cooperative parallel tabu search which incorporates with the historical information exchange among processors in addition to its own searching of eachprocessor. The other is a cooperative parallel searchbetween genetic algorithm and tabu search processes.Through computational experiment, we observe the improvement of solutions by our proposed method.
Data Networks are Lightly Utilized, and Will Stay That Way
Authors: Odlyzko Andrew
Venue:  (1999)

The popular press often extolls packet networks as much more efficient than switched voice networks in utilizing transmission lines. This impression is reinforced by the delays experienced on the Internet and the famous graphs for traffic patterns through the major exchange points on the Internet, which suggest that networks are running at full capacity. This paper shows the popular impression is incorrect; data networks are very lightly utilized compared to the telephone network. Even the backbones of the Internet are run at lower fractions (10% to 15%) of their capacity than the switched voice network (which operates at over 30% of capacity on average). Private line networks are utilized far less intensively (at 3% to 5%). Further, this situation is likely to persist. The low utilization of data networks compared to voice phone networks is not a symptom of waste. It comes from different patterns of use, lumpy capacity of transmission facilities, and the high growth rate of the industry.
Efficient Hierarchical Radiosity in Complex Environments
Authors: Brian E Smits
Venue:  (1994)

This thesis presents methods for speeding up the global illumination computations by using bounds on error to eliminate work that is not needed for a solution of a given accuracy. This work makes the hieerarchical radiosity approach feasible for complex environments. First, a new radiosity algorithm for efficiently computing global solutions with respect to a constrained set of views is presented. Radiosities of directly visible surfaces are computed to high acccuracy, while those of surfaces having only an indirect effect are computed to an accuracy commensurate with their contribution. The algorithm uses an adaptive subdivision scheme that is guided by the interplay between two closely related transport processes: one propagating power from the light sources, and the other propagating importance from the visible surfaces. By simultaneously refining approximate solutions to the dual transport equations, computation is significantly reduced in areas that contribute little to the region of interest. This approach is very effective for complex environments in which only a small fraction is visible at any time. Our statistics show dramatic speedups over the fastest previous radiosity algorithms for diffuse environments with details at a wide range of scales. A new approach for accelerating hierarchical radiosity by clustering objects is also presented. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not exploit a hierarchical grouping on existing surfaces. This limitation resulted in an excessive number of initial links in complex environments. Initial linking is potentially the most expensive portion of hierarchical radiosity algorithms, and constrains the complexity of the environments that can be simulated. The clustering algorithm presented here operates by estimating energy transfers between collections of objects which maintaining reliable error bounds on each transfer. Two methods of bounding the transfers are employed with different tradeoffs between accuracy and time. In contrast with the $O(s^2)$ time and space complexity of the initial linking in previous hierarchical radiosity algorithms, the new methods have complexities of $O(s$ log $s)$ and $O(s)$ for both time and space. Using these methods we have obtained speedups of two orders of magnitude for environments of moderate complexity while maintaining comparable accuracy. Finally, the thesis describes a method for reconstructing the radiance functions across the visible surfaces given a global solution to the energy balance equations. This approach greatly reduces artifacts resulting from the choice of constant basis functions used for the global solution.
Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences
Authors: Shalabh Bhatnagar, Michael C. Fu, Steven I. Marcus, I-Jeng Wang
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2003)

Simultaneous perturbation stochastic approximation (SPSA) algorithms have been found to be very effective for high-dimensional simulation optimization problems. The main idea is to estimate the gradient using simulation output performance measures at only two settings of the N-dimensional parameter vector being optimized rather than at the N + 1 or 2N settings required by the usual one-sided or symmetric difference estimates, respectively. The two settings of the parameter vector are obtained by simultaneously changing the parameter vector in each component direction using random perturbations. In this article, in order to enhance the convergence of these algorithms, we consider deterministic sequences of perturbations for two-timescale SPSA algorithms. Two constructions for the perturbation sequences are considered: complete lexicographical cycles and much shorter sequences based on normalized Hadamard matrices. Recently, one-simulation versions of SPSA have been proposed, and we also investigate these algorithms using deterministic sequences. Rigorous convergence analyses for all proposed algorithms are presented in detail. Extensive numerical experiments on a network of M/G/1 queues with feedback indicate that the deterministic sequence SPSA algorithms perform significantly better than the corresponding randomized algorithms.
Range Searching
Authors: K P Agarwal
Venue:  (1996)

This paper surveys the known results and techniques on range searching, and describes some of their applications.
Compressed Domain Transcoding of MPEG
Authors: Soam Acharya, Brian Smith
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, while MPEG optimizes for compression at the expense of random access. Converting from one format to another, a process called transcoding, is often desirable over the life of a video segment. This paper shows how to transcode MPEG-1 video to motion-JPEG without fully decompressing the MPEG-1 source. The described technique for compressed domain transcoding differs from previous work because it uses a new approximation approach that is optimized for software implementations. This new approach is 1.5 to 3 times faster than spatial domain transcoders and offers an additional degree of freedom: higher transcoding speeds can be obtained at the price of lower picture quality. This speed/quality trade-off is useful in many real-time applications such as off-line editing and video gateways.
Verification of multi-valued logic networks
Authors: R. Drechsler
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A method for verification of Multi-Valued Logic Networks (MVLNs) using Ordered Multi-Valued Decision Diagrams (OMDDs) is presented. For tree-like MVLNs an upper bound on the OMDD size can be proven. Thus, heuristics known for OBDDs can also be used for OMDDs. A large set of experiments is presented that underlines the efficiency of the approach.
Simulation of a Video-on-Demand System
Authors: Song B Toh
Venue:  (1995)

This paper presents a simulation study of a video-on-demand system. The focus of the study is the effectiveness of different caching strategies on a video-on-demand system with two levels of cache, RAM and disks, in front of a tape library. Using an event-driven simulator, I show that caching was helpful in increasing the service capacity of the system. On-demand caching showed its advantages especially when the requests were clustered around a few popular titles (in other words, there was temporal locality).
A Replication Technique Based on a Functional and Attribute Grammar Computation Model
Authors: Adel Cherif, Masato Suzuki, Takuya Katayama
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Presents a replication technique based on the FTAG (fault-tolerant attribute grammar) computation model, where instances of a replicated application are active on different groups of processors called replicas. FTAG is a functional and attribute-based model. The developed replication technique implements "active parallel replication", i.e. all replicas are active and concurrently compute a different piece of the application's parallel code. In our model, replicas cooperate not only to detect and mask failures but also to perform parallel computation. The replication mechanisms are supported by the FTAG run-time system and are fully application-transparent. Different novel mechanisms for checkpointing and recovery are developed. Rollback is achieved only if the system experiences multiple failures, otherwise forward recovery is performed. The replication technique takes full advantage of parallel computation to reduce the computation time.
BEA Weblogic® Server Bible, 1 edition
Authors: Joe Zuffoletto, Rich Helton, Brian Gill, Gary Wells, Geoff Schneider
Venue:  (2002)

:As the worlds leading J2EE application server, BEA WebLogic Server gives you unmatched flexibility in the design, implementation, and deployment of high-volume, dynamic, Web-based applications. This nuts-and-bolts reference tells you all you need to know to build a WebLogic development environment and to put WebLogics features, services, and architecture to work for your enterprise. Detailed examples and real-world productivity tips help you get started fast - and finish the job right.Inside, youll find complete coverage of BEA WebLogic Server 6.1Develop applications on Windows NT/2000 for deployment to other platformsBuild enterprise applications enabled for both Web and wireless accessMaster WebLogics implementations of the J2EE APIs, including JDBC, JNDI, JMS, and EJBExtend secure, user-friendly access to data in legacy systemsDisplay and manipulate data from multiple back-end sources seamlesslyHost Web sites for multiple Internet domains on one computer with one IP addressCluster WebLogic servers for high availability, load balancing, and failoverImplement robust security with SSL, user authentication, and authorization
Optimal Byzantine Quorum Systems
Authors: Dahlia Malkhi, Michael Reiter, Avishai Wool
Venue:  (1997)

Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b+1 servers, have been proposed to construct replicated services tolerant of b arbitrary (Byzantine) server failures. In this paper we consider a hybrid fault model allowing benign failures in addition to the Byzantine ones. We present four novel constructions for b-masking quorum systems, each of which has optimal load (the probability of access of the busiest server) or optimal availability (probability of some quorum surviving failures). To show optimality we also prove lower bounds on the load and availability of any b-masking quorum system in this model.
Theory and Use of Conditional Composition
Authors: Rajit Manohar, K. R Leino
Venue:  (1994)

No abstract available.
Automatic Surface Generation in Computer Aided Design
Authors: Christoph M. Hoffmann, John E. Hopcroft
Venue:  (1985)

No abstract available
Interacting with the FIELD Environment
Authors: Steven P. Reiss
Venue:  (1989)

This paper describes the ideas behind and the use of the FIELD programming environment. FIELD is an integrated environment that is based on UNIX programming tools and that runs on top of the X11 windowing system. It provides a consistent and complete interface to its tools. In addition, FIELD provides a variety of tools for program and data visualization. The key concepts behind FIELD are an integration mechanism based on a simple, central message server, an annotation editor for integrating access to the source file with the other tools, and the use of a high-level user interface toolset.
A Heuristics-Based Approach to Query Optimization in Structured Document Databases
Authors: Dunren Che, Karl Aberer
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents - structured documents in general - are becoming of great importance. This paper reports our most recent advance in pursuit of effective processing and optimization of structured-document queries, which are important for large repositories of structured documents. Our methodology emphasizes applying exclusively deterministic transformations on query expressions to achieve the best possible optimization efficiency. A new approach is thus proposed that facilitates the exploitation of the DTD-knowledge, structural properties, and structure indices of structured documents for the purpose of fast query optimization.
Centralized Failure Injection for Distributed,Fault-Tolerant Protocol Testing
Authors: Guillermo A. Alvarez, Flaviu Cristian
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We describe a centralized approach to testing that distributed fault-tolerant protocols satisfy their safety and timeliness specifications in the presence of the very failures they are designed to tolerate. Cesium is a testing environment based on the centralized simulation of distributed executions and failures. Processes are run in a single address space while providing the appearance of a truly distributed execution. The human tester can force the occurrence of arbitrary failures and security attacks. The implementations under test are not instrumented for testing purposes, and their source codes need not be available. We prove that Cesium can execute exactly the set of runs feasible in the real distributed system being simulated. We also show that there are safety and timeliness properties in the specifications of many existing distributed protocols that cannot be tested in practical distributed systems. All of these properties can, however, be accurately tested by Cesium without introducing any perturbation in test experiments.
Faster Approximation Algorithms for the Unit-Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
Authors: Philip Klein, Serge Plotkin, Clifford Stein, Eva Tardos
Venue:  (1991)

We describe new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. Our algorithms are much faster than previously known algorithms. Besides being an important problem in its own right, the uniform-capacity concurrent flow problem has many interesting applications. Leighton and Rao used uniform-capacity concurrent flow to find an approximately ``sparsest cut'''' in a graph, and thereby approximately solve a wide variety of graph problems, including minimum feedback arc set, minimum cut linear arrangement, and minimum area layout. However, their method appeared to be impractical, as it required solving a large linear program. We show that their method might be practical by giving an $O(m^2 \log m)$ expected-time randomized algorithm for their concurrent flow problem on an $m$-edge graph. Raghavan and Thompson used uniform-capacity concurrent flow to approximately solve a channel width minimization problem in VLSI. We give an $O(k^{3/2} (m + n \log n))$ expected-time randomized algorithm and an $O(k\min\{n,k\} (m+n\log n)\log k)$ deterministic algorithm for this problem when the channel width is $\Omega(\log n)$, where $k$ denotes the number of wires to be routed in an $n$-node, $m$-edge network.
Latour - a tree visualisation system
Authors: Ivan Herman, Guy Melancon, M. M. Ruiter, M. Delest
Venue:  (1999)

This paper presents some of the most important features of a tree visualisation system called Latour, developed for the purposes of information visualisation. This system includes a number of interesting and unique characteristics, for example the provision for visual cues based on complexity metrics on graphs, which represent general principles that, in our view, graph based information visualisation systems should generally offer.