ppxscal/embedding_network huggingface dataset:
First-order verification of cryptographic protocols
Authors: Ernie Cohen
Venue: Journal of Computer Security (2003)

We describe a verification method for cryptographic protocols, based on first-order invariants. For typical protocols, a suitable invariant can be generated mechanically from the program text, allowing safety properties to be proved by ordinary first-order reasoning.The method has been implemented in an automatic verifier, TAPS, that proves safety properties comparable to those in published Isabelle verifications, but does so much faster with little or no guidance from the user. TAPS has verified properties of about 100 protocols, including all but three protocols from the Clark and Jacob survey; on average, these verifications require less than a second of CPU time and less than 4 bytes of hints from the user.
Causally Consistent Recovery of Partially Replicated Logs
Authors: Kenneth P. Kane, Kenneth P. Birman
Venue:  (1988)

An algorithm is presented for the consistent recovery of replicated data in a client-server system. The algorithm is based on logging and is similar to the optimistic techniques that are well known in the literature. However, unlike in existing optimistic techniques, explicit dependency information is not maintained. Instead, dependency information is estimated from the ordering of messages found in servers'' logs. These dependency estimates can, in general, be expensive to compute. It is therefore shown how inexpensive estimates can be applied when a system is well structured.
Portable Parallel Ray Tracing Algorithms
Authors: Michael J. Garland
Venue:  (1993)

For a variety of reasons, realistic computer rendering is an important technology; it creates a wide range of new possibilities for effectively communicating information. The crucial goal is to provide realistic images in a short period of time. Ray tracing is a powerful technique for rendering. It is conceptually simple, and can produce effects beyond the capability of some other more traditional methods. Unfortunately, ray tracing is rather expensive by comparison. This project is aimed at producing a reasonably fast and efficient ray tracer based on parallel ray tracing algorithms. The code is written in NESL, a data-parallel language developed by Guy Blelloch. It is supported on Cray YMP, Connection Machine CM-2, and serial workstation platforms.
An assessment of the applicability of object-oriented analysis to the development of information systems
Authors: I. Santos, J. A. Carvalho
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

In recent years, several object-oriented (OO) approaches to the analysis of information systems (IS) have been proposed by different authors. However, there is still some controversy about the adequacy of OO approaches to IS modelling. While some authors claim that OO modelling techniques are very close to the way human beings organise their ideas, other authors point out some difficulties in the exclusive use of OO models for IS modelling. The experiment described in the paper constitutes a contribution to the understanding of the adequacy of OO approaches to IS modelling. The deliverables of an IS analysis project (carried out according to the Coad/Yourdon OO analysis method) have been presented to three opinion groups: undergraduate IS students, post-graduate IS students, and domain experts (insurance business). The results of the experiment suggest that the approach used in the project can lead to "good" IS models (e.g. dimension, level of detail, consistency, understandability) although there are some aspects that need to be improved. One particular aspect where OO IS models seem to fail is the adequate representation of organisation processes.
Radix R Parallel FFT Algorithms with a Global Interconnection Networks and Its Evaluation
Authors: Toshihiro Taketa, Kuninobu Tanno, Susumu Horiguchi
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In order to efficiently compute Fast Fourier transform (FFT) various parallel algorithms and their implementation to multiprocessors and multicomputers have been developed. In general, the local interconnection network is more high speed than a global one, but its capability depends on network architecture. On the other hand, the global interconnection network is not so high speed, but it does not depends on network architecture. It provides a flexible communication interface to the programmer. In this paper, we discuss parallel radix R FFT algorithms on a multiprocessor or multicomputer system with a global interconnection network. We propose two algorithms a stage-by-stage method and a multi-stage method. We also estimate the communication time. Then we show that the communication time is very sensitive to and affected by data exchange strategy. Finally, we implement these algorithms on two commercial massively parallel computers(nCUBE/2 and CM5) and measure these communication time.
Functional Site Prediction on the DNA sequence by Artificial Neural Networks
Authors: A. Hatzigeorgiou, N. Mache, M. Reczko
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

A modular system of neural networks is used to identify genes in DNA sequences of eukaryotic organisms. The identification task is decomposed into the detection of distinct signals using separate neural network modules. Such signals are coding regions, splice sites and transcription start regions (cap-site). A focus of the work is the use of back-percolation, cascade correlation, and time-delay neural networks. These give, in this particular application, better generalization than the well known backpropagation algorithm. This system achieves a prediction accuracy comparable to the traditionally designed gene identification packages and is able to produce more accurate protein sequences from the constructed gene structures.
Resource Managers for QoS in CORBA
Authors: Didier Le Tien, Olivier Villin, Christian Bac
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Multimedia applications require support for quality of service (QoS). The need for reusable and maintainable code also means that these kinds of applications are developed in a distributed object system.To address the support of quality of service in middleware, we propose a lightweight model to manage the QoS constraints in this kind of environment. This model is based on two types of objects, micro QoS managers (µQoS-Mngr) and resource managers. A µQoS-Mngr is associated to an application, it handles the QoS contract, the QoS mapping and the QoS monitoring. Each resource manager is responsible for QoS management for a specific resource, including, admission control, real-time scheduling and monitoring. The µQoS-Mngrs and the resource managers (R-Mngr), co-operate, using the middleware, in order to ensure an end-to-end QoS management.This paper focuses on the resource manager, and gives an overview of our implementation on a CORBA platform in the context of a video on demand application.
Multiple-Valued and Spectral Approach to Lossless Compression of Binary, Gray Scale and Color Biomedical Images
Authors: Bogdan J. Falkowski, Beata T. Olejnicka
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

In this paper, we propose a new method based on multiple-valued functions and spectral analysis for the lossless compression of binary, gray scale and color biomedical images. Preprocessing of the raw image data is first applied to make the data more amenable for compression. The preprocessed image is then segmented into blocks to which various coding and compression is applied. Detailed description of segmentation and compression schemes is presented. The proposed scheme has been implemented in the C language and compared with other state-of-the-art techniques. Experimental results indicate significant improvements in compression ratios.
Computational Foundations of Basic Recursive Function Theory
Authors: Robert L. Constable, Scott F Smith
Venue:  (1988)

The theory of computability, or basic recursive function theory as it is often called, is usually motivated and developed using Church''s Thesis. Here we show that there is an alternative computability theory in which some of the basic results on unsolvability become more absolute, results on completeness become simpler, and many of the central concepts become more abstract. In this approach computations are viewed as mathematical objects, and the major theorems in recursion theory may be classified according to which axioms about computation are needed to prove them. The theory is a typed theory of functions over the natural numbers, and there are unsolvable problems in this setting independent of the existence of indexings. The unsolvability results are interpreted to show that the partial function concept, so important in computer science, serves to distinguish between classical and constructive type theories (in a different way than does the decidability concept as expressed in the law of excluded middle). The implications of these ideas for the logical foundations of computer science are discussed, particularly in the context of recent interest in using constructive type theory in programming.
Evaluation of Regressive Methods for Automated Generation of Test Trajectories
Authors: Brian J. Taylor, Bojan Cukic
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Automated generation of test cases is a prerequisite for fast testing. Whereas the research has addressed the creation of individual test points, test trajectory generation has attracted limited. In simple terms, a test trajectory is defined as a series of data points, with each (possibly multidimensional) point relying upon the value(s) of previous point(s). Software systems that use data trajectories as inputs include closed-loop process controllers. For these systems, software testers can handcraft test trajectories, use input trajectories from older versions of the system or, perhaps, collect test data in a high fidelity system simulator. While these are valid approaches, they are expensive and time-consuming, especially if the assessment goals require substantial number of tests.In this paper, we propose a framework for expanding a small, conventionally developed set of test trajectories into a large set suitable, for example, for system safety assurance. In the core of this framework is statistical regression analysis. The regression analysis builds a relationship between controllable independent variables and closely correlated dependent variables, which represent test trajectories. By perturbing the independent variables, new test trajectories can be generated automatically. Automated test trajectory generation has been applied in the safety assessment of a fault tolerant flight control system. We compare the performance of simple linear regression, multiple linear regression, and autoregressive techniques. The performance metrics include the speed of test generation and the percentage of ¿acceptable¿ trajectories, measured by the domain specific reasonableness checks.
Fractal Symbolic Analysis for Program Transformations (*new file*)
Authors: Nikolay Mateev, Vijay Menon, Keshav Pingali
Venue:  (2000)

Restructuring compilers use dependence analysis to prove that the meaning of a program is not changed by a transformation. A well-known limitation of dependence analysis is that it examines only the memory locations read and written by a statement, and does not assume any particular interpretation for the operations in that statement. Exploiting the semantics of these operations enables a wider set of transformations to be used, and is critical for optimizing important codes such as LU factorization with pivoting. Symbolic execution of programs enables the exploitation of such semantic properties, but it is intractable for all but the simplest programs. In this paper, we propose a new form of symbolic analysis for use in restructuring compilers. Fractal symbolic analysis compares a program and its transformed version by repeatedly simplifying these programs until symbolic analysis becomes tractable, ensuring that equality of simplified programs is sufficient to guarantee equality of the original programs. We present a prototype implementation of fractal symbolic analysis, and show how it can be used to optimize the cache performance of LU factorization with pivoting.
STAIR: Practical AIMD Multirate Multicast Congestion Control
Authors: John Byers, Gu Kwon
Venue:  (2001)

Abstract Existing approaches for multirate multicast congestion control are either friendly to TCP only over large time scales or introduce unfortunate side effects, such as significant control traffic, wasted bandwidth, or the need for modifications to existing routers. We advocate a layered multicast approach in which steady-state receiver reception rates emulate the classical TCP sawtooth derived from additive-increase, multiplicative decrease (AIMD) principles. Our approach introduces the concept of dynamic {\em stair} layers to simulate various rates of additive increase for receivers with heterogeneous round-trip times (RTTs), facilitated by a minimal amount of IGMP control traffic. We employ a mix of cumulative and non-cumulative layering to minimize the amount of excess bandwidth consumed by receivers operating asynchronously behind a shared bottleneck. We integrate these techniques together into a congestion control scheme called STAIR which is amenable to those multicast applications which can make effective use of arbitrary and time-varying subscription levels.
A New List Scheduling Method Based on Structural Properties of Task Graphs
Authors: Satoshi Fujita, Tadanori Nakagawa, Masafumi Yamashita
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we propose a new list scheduling method for obtaining a quasi-optimal solution to the multiprocessor scheduling problem that has been recognized as a key problem for realizing parallelizing compilers. Our approach for achieving a nearly optimal performance is to take a linear combination of several characteristics to obtain a heuristic function instead of taking a lexicographical combination. The goodness of the resultant heuristics is evaluated by experiments.
Writers Authentication and Fractal Compression
Authors: A. Seropian, Pr. N. Vincent
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper we propose a new approach that allows authenticating a writer. To achieve this goal the autosimilarity properties in writings are used, that is to say we are extracting some invariant pieces of the writing, invariant patterns that are characterizing the texts of a writer. From a practical point of view, these invariant shapes are determined by adaptation of techniques that have been developed in the fractal compression process. During a learning phase the invariant patterns are extracted and in a second step they are used as a referencebase in order to analyze an unknown writing. The results of the analysis are quantified by measurement of the quality of a compression/decompression process elaborated using the reference base associated with different.
A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees
Authors: Philip N. Klein, Robert E. Tarjan
Venue:  (1993)

We present a randomized linear-time algorithm for finding a minimum spanning tree in a connected graph with edge weights. The algorithm is a modification of one proposed by Karger and uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
Why Is It so Easy to Introduce Requirements Engineering Technology Transfer Panels into Mainstream Practice?
Authors: Sol J. Greenspan
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

This position paper has summarized conclusions reached by prior panels and has suggested moving on. One suggested focus is attention to the network of research dependencies that must be in place for us to succeed. A second focus is the need for a close working relationship between business and systems concerns.
A structured channel borrowing scheme for dynamic load balancing in cellular networks
Authors: S. K. Das, S. K. Sen, R. Jayaram
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We propose an efficient dynamic load balancing scheme in cellular networks for managing a teletraffic hot spot in which channel demand exceeds a certain threshold. A hot spot, depicted as a stack of hexagonal 'ring' of cells, is classified as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called 'peripheral rings'. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the 'rings' or 'peripheral rings' to the hot cells in the hot spot. For the more general case of an incomplete hot spot, a cold cell is further classified as cold safe, cold semi-safe or cold unsafe, and a demand graph is constructed from the channel demand of each hot cell from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme.
Blended Learning: How to Integrate Online and Traditional Learning
Authors: Kaye Thorne
Venue:  (2003)

:The buzz phrase of the moment in the world of training is is "blended learning" but...* What exactly is it? * How can it help? * How does it relate to e-learning? * Is it right for your organization? * How can you implement it? These questions and more are answered in this up-to-the-minute guide to the latest trend in training. Essentially, blended learning is a workable solution that allows trainers and staff developers to integrate online learning with a broad range of more traditional learning techniques. Demonstrating how old and new methods of improving staff performance and learning can work seamlessly together to give better results, this book is the ideal guide to creating a new way of training. In her usual practical style Kaye Thorne shows how the concept of blended learning can be applied most effectively to help you take the first steps towards developing a blended training program. Case studies from a wide variety of organizations (from Rolls Royce to small businesses) illustrate what is emerging as the new (post-digital revolution) training of the future.
Software Requirements Prioritizing
Authors: Joachim Karlsson
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The importance of candidate software requirements can vary by orders of magnitude, yet most software providers do not have accurate and efficient means for selecting among them. This papers describes a case study at Ericsson Radio Systems AB of two techniques for software requirements prioritizing as a means for determining the importance of candidate requirements, a pair-wise comparison technique and a numeral assignment technique. The results from the case study indicate that the pair-wise comparison technique is an efficient, informative and accurate means for finding the candidate requirements importance. We therefore recommend the pair-wise comparison technique for software requirements prioritizing. At Ericsson we have extended its use in other development projects.
Exploiting Orthogonality in Three Dimensional Graphics for Visualizing Abstract Data
Authors: James Wen
Venue:  (1995)

Using Three dimensional graphics to visualize abstract data presents an interesting challenge because, by definition, there is no physically intuitive counterpart to abstract data. Relatively little work has been done in exploring how to best utilize the third dimension to increase visualization capabilities beyond simply increasing the volume of data presented. This paper prsents a design principle that enriches the amount of semantic information that could be visualized by treating the third dimension not so much as one of three equivalent dimensions in three-space but as an independent channel of information.
Calibration of a Head-Mounted Projective Display for Augmented Reality Systems
Authors: Hong Hua, Chunyu Gao, Narendra Ahuja
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

In augmented reality (AR) application, registering a virtual object with its real counterpart accurately and comfortably is one of the basic and challenging issues in the sense that the size, depth, geometry, as well as physical attributes of the virtual objects have to be rendered precisely relative to a physical reference, which is well-known as the calibration or registration problem. This paper presents a systematic calibration process to address static registration issue in a custom-designed augmented reality system, which is based upon the recent advancement of head-mounted projective display (HMPD) technology. Following a concise review of the HMPD concept and system configuration, we present in detail a computational model for the system calibration, describe the calibration procedures to obtain the estimations of the unknown transformations, and include the calibration results, evaluation experiments and results.
Enhancements to 4.4 BSD UNIX for Efficient Networked Multimedia in Project MARS
Authors: Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Cluster based architectures that employ inexpensive Personal Computers (PCs) interconnected by high speed commodity interconnect have been recognized as a cost-effective way of building high performance scalable Multimedia-On-Demand (MOD) storage servers [3,4,6,8]. Typically, the PCs in these architectures run operating systems such as UNIX that have traditionally been optimized for interactive computing and lack fast disk-to-network data paths and support for guaranteed CPU and storage access. In this paper we report design, implementation and performance measurements of innovative enhancements to 4.4 BSD UNIX carried out to rectify these limitations in the context of our Massively-parallel And Real-time Storage (MARS) project [6]. We have proposed and implemented the following enhancements to a 4.4 BSD compliant public domain NetBSD UNIX operating system: (1) A new kernel buffer management system called Multimedia M-buf (mmbuf) which shortens the data path from a storage device to network interface, (2) fair queueing within the SCSI driver for equitable resource sharing between real-time and non-real-time streams, and (3) integration of these new OS services with a CPU scheduling mechanism called Real Time Upcall [16] and a software disk striping driver called Concatenated Disk (ccd). Our experimental results demonstrate that these enhancements provide throughput improvements and QOS guarantees on the data path from the disk to network.