ppxscal/embedding_network huggingface dataset:
Pandore: a system to manage data distribution
Authors: Françoise André, Jean-Louis Pazat, Henry Thomas
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

The goal of the Pandore system is to allow the execution of parallel algorithms on DMPCs (Distributed Memory Parallel Computers) without having to take into account the low-level characteristics of the target distributed computer to program the algorithm. No explicit process definition and interprocess communications are needed. Parallelization is achieved through logical data organization. The Pandore system provides the user with a mean to specify data partitioning and data distribution over a domain of virtual processors for each parallel step of his algorithm. At compile time, Pandore splits the original program into parallel processes. Each process will execute some appropriate parts of the original code, according to the given data decomposition. In order to achieve a correct utilization of the data structures distributed over the processors, the Pandore system provides an execution scheme based on a communication layer, which is an abstraction of a message-passing architecture. This intermediate level is them implemented using the effective primitives of the real architecture (in our specific case, an Intel iPSC/2).
Approximate Signal Processing
Authors: S. Hamid Nawab, Alan V. Oppenheim, Anantha P. Chandrakasan, Joseph M.Winograd, Jeffrey T.Ludwig
Venue: Journal of VLSI Signal Processing Systems (1997)

It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tradeoffs. One of the objectives of this paper is to suggest that there is the potential for developing a more formal approach, including utilizing current research in Computer Science on Approximate Processing and one of its central concepts, Incremental Refinement. Toward this end, we first summarize a number of ideas and approaches to approximate processing as currently being formulated in the computer science community. We then present four examples of signal processing algorithms/systems that are structured with these goals in mind. These examples may be viewed as partial inroads toward the ultimate objective of developing, within the context of signal processing design and implementation, a more general and rigorous framework for utilizing and expanding upon approximate processing concepts and methodologies.
Impact of video scheduling on band width allocation for multiplexed MPEG streams
Authors: Marwan Krunz, Satish K. Tripathi
Venue: Multimedia Systems (1997)

We present efficient schemes for scheduling thedelivery of variable-bit-rate MPEG-compressed video withstringent quality-of-service (QoS) requirements. Video scheduling is being used to improve bandwidth allocation ata video server that uses statistical multiplexing to aggregate video streams prior to transporting them over a network. A video stream is modeled using a traffic envelopethat provides a deterministic time-varying bound on the bitrate. Because of the periodicity in which frame types in anMPEG stream are typically generated, a simple traffic envelope can be constructed using only five parameters. Usingthe traffic-envelope model, we show that video sources canbe statistically multiplexed with an <i>effective bandwidth</i> thatis often less than the source peak rate. Bandwidth gain isachieved without sacrificing the stringency of the requestedQoS. The effective bandwidth depends on the <i>arrangement</i>of the multiplexed streams, which is a measure of the lagbetween the GOP periods of various streams. For homogeneous streams, we give an optimal scheduling scheme forvideo sources at a video-on-demand server that results in theminimum effective bandwidth. For heterogeneous sources,a sub-optimal scheduling scheme is given, which achievesacceptable bandwidth gain. Numerical examples based ontraces of MPEG-coded movies are used to demonstrate theeffectiveness of our schemes.
A Construction of Difference Sets
Authors: Yu Qing Chen
Venue: Designs, Codes and Cryptography (1998)

In this paper, we will give a construction of a family of(4q^{2n+2}\frac{q^{2n+2}-1}{q^2-1} ,q^{2n+1}[\frac{2(q^{2n+2}-1)}{q+1}+1] , ( q^{2n+2}-q^{2n+1})\frac{q^{2n+1}+1}{q+1})-difference sets in the group K\times G, where q is any power of2 , K is any group with|K|=\frac{q^{2n+2}-1}{q^2-1} and G is an abelian2 -group of order 4q^{2n+2} which contains an elementary abelian subgroup of index 2.
Messages, communication, information security and value
Authors: John Dobson
Venue: Proceedings of the 1994 workshop on New security paradigms (1994)

This paper addresses the problem of analysing an information system for security flaws or vulnerabilities in a way that is analogous to the analysis of a safety-critical system. In particular, instead of adopting the approach that security is a property that must be proved to hold (fault avoidance), it shows how to analyse a system for possible security failures so that fault prevention, tolerance, recovery or even fault acceptance techniques can be chosen where appropriate.
Hyperdocuments as automata: verification of trace-based browsing properties by model checking
Authors: P. David Stotts, Richard Furuta, Cyrano Ruiz Cabarrus
Venue: ACM Transactions on Information Systems (TOIS) (1998)

We present a view of hyperdocuments in which each document encodes its own browsing semantics in its links. This requires a mental shift in how a hyperdocument is thought of abstractly. Instead of treating the links of a document as defining a static directed graph, they are thought of as defining an abstract program, termed the links-automaton of the document. A branching temporal logic notation, termed HTL*, is introduced for specifying properties a document should exhibit during browsing. An automated program verification technique called model checking is used to verify that browsing specifications in a subset of HTL* are met by the behavior defined in the links-automation. We illustrate the generality of these techniques by applying them first to several Trellis documents and then to a Hyperties document.
di/dt Noise in CMOS Integrated Circuits
Authors: Patrik Larsson
Venue: Analog Integrated Circuits and Signal Processing (1997)

This is an overview paper presenting di/dt noise from a designer&lsquo;s perspective. Analysis and circuit design techniques are presented taking package parasitics into account. The main focus is on digital CMOS design, but analysis and design suggestions can easily be extended to mixed-mode design.
Virtual reality and simulation: an overview
Authors: Robert Macredie, Simon J. E. Taylor, Xiaoning Yu, Richard Keeble
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Virtual environments can be used as an effective tool for training and education. This paper cites many recent examples of such systems and divides current work into virtual environment development and the development of supporting technology for distributed access. A novel supporting technology for distribution is introduced.
COCOON: creator of concurrent object-oriented systems
Authors: Lonnie R. Welch
Venue: ACM SIGAda Ada Letters (1997)

The software engineering techniques of reuse, encapsulation and information hiding are increasingly being employed in the construction of large, concurrent software systems. Simultaneously, hardware platforms continue to increase in sophistication, particularly in the area of concurrency. Thus, systems engineers are confronted with the problem of bridging the gap between (1) large computer-based software systems composed of tasks and ADTs/objects and (2) parallel and distributed computer platforms. Thus, this paper describes the COCOON (Creator Of Concurrent Object-OrieNted Systems) toolset. COCOON bridges the gap between object-oriented Ada software and distributed architectures. It partitions tasks, packages and subprograms, and assigns partitions to physical processors. The toolset automatically produces a distribution specification.
An efficient ILP-based scheduling algorithm for control-dominated VHDL descriptions
Authors: Michael Münch, Norbert Wehn, Manfred Glesner
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

To adopt behavioral synthesis techniques in existing design flows, the synthesis methodology must provide the designer with a mechanism to specify a component's interface timing. This will permit pre- and postsynthesis validation through cosimulation with other subsystems or even through formal verification. In control-flow dominated designs, additional timing constraints will result in a complex specification/constraint system for which the scheduling problem has been shown to be NP-complete. In this article, we present a mathematical framework for solving a special instance of the scheduling problem in control-flow dominated behavioral VHDL descriptions given that the timing of I/O signals has been completely or partially specified. It is based on a code-transformation approach that fully preserves the VHDL semantics. The scheduling problem is mapped onto an integer linear program (ILP) solvable in polynomial time assuming a restricted partial order on selected statements. It captures both control-flow and timing constraints in a single model and also exploits dataflow information to optimize the statement sequence across basic block boundaries.
Data Quality of Administratively Collected Hospital Discharge Data for Liver Cirrhosis Epidemiology
Authors: Kim Vestberg, Ane Marie Thulstrup, Henrik Toft Sørensen, Peter Ottesen, Svend Sabroe, Hendrik Vilstrup
Venue: Journal of Medical Systems (1997)

We estimated the validity, i.e., whether the diagnostic criteria were fulfilled for the patients registered with the diagnosis of liver cirrhosis in a Danish hospital discharge registry, and the completeness, i.e., whether all patients with liver cirrhosis were included in the registry. Information in the regional hospital discharge registry in the Country of Aarhus, Denmark was compared with hospital records and information in a pathology registry. 85.4% of the patients registered with a diagnosis of liver cirrhosis fulfilled the diagnostic criteria for the diagnosis (validity). 93.2% of the patients registered with biopsy proven liver cirrhosis in the pathology registry were found in the discharge registry (completeness) with a diagnosis of liver cirrhosis. The hospital discharge registry showed relatively few misclassifications and the Danish National Registry of Patients (NRP), which is based on the regional registries, may provide a unique study base for future research.
Reducing the Elliptic Curve Cryptosystem of Meyer-M&uuml;llerto the Cryptosystem of Rabin-Williams
Authors: Marc Joye, Jean-Jacques Quisquater
Venue: Designs, Codes and Cryptography (1998)

At Eurocrypt &lsquo;96, Meyer and M&uuml;ller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Rabin-Williams.
Communication oriented organizational modeling
Authors: Nardo B. J. van der Rijst
Venue: ACM SIGGROUP Bulletin (1997)

Modeling of organizations currently has a strong focus on the business process. In contrast to e.g. data modeling, process modeling tries to provide a clear understanding of the whole business process without giving attention to the current organizational structure. Not only because of efforts in the area of total quality management, continuous improvement and business process engineering, it is possible to observe this shift. More important are developments in the direction of new organizational forms (i.e. networked organizations) and hence the coordination of activities.In this paper the DEMO modeling approach is presented. The approach entails a framework with several models incorporated in a methodology. Primary aim of the method is to provide insight in the business process, combining the notions of action, information and communication.The DEMO approach is founded in the Language Action Perspective (Winograd and Flores, 1986). This view on organizations strongly opposes the mechanical way in which many information system analysis and development methods approach organizations. Important insights from the original impetus by Flores and Ludlow (1980) stimulated many research groups around the world to incorporate the Speech Act theory (Searle, 1969) in their methods and tools.The methodology DEMO (Dynamic Essential Modeling nf Organizations) has been described and reported upon several times (Dietz, 1992; 1994a; 1994b). Its practical value has been demonstrated for a few small scale application domains like in (van der Rijst and Dietz, 1993; van Reijswoud and van der Rijst, 1995), and recently in a large scale project (Jansen and Poot, 1996) as well.The major motivation behind the development of DEMO was the strongly felt need for information systems analysts to have a theory about organizations (and, by way of analogy, about discrete dynamic systems in general) that is only and purely based on the role of information, taken in a very general sense. Having such a theory at one's disposal would make it possible to understand organizations in a new and original way.The theory would be independent of other theories, in particular the economic theories about organizations, like the Value Chain Theory (Porter, 1985), or the Transaction Cost Theory (1985). It would have its own value and just be complementary to those other theories. Because of this property, DEMO is most valuable for providing an original informatical contribution to Business Process Redesign and Reengineering, next to and in harmony with contributions from other disciplines, e.g. the economically founded discipline of business administration. The core concepts are discussed in the next sections.
Two Image-Template Operations for Binary Image Processing
Authors: Hongchi Shi
Venue: Journal of Mathematical Imaging and Vision (1997)

This paper presents two new image algebra image-template operationsmatch and mismatch derived from the general image-template product. These image algebra operations extend the binary morphological erosion and dilation operations and can be used to express elegantly most of binary image processing algorithms in a more natural way than binary morphological operations from the image processing viewpoint. In addition, the match and mismatch operations are easy to implement efficiently on SIMD bit-serial parallel computers.
Re-engineering needs generic programming language technology
Authors: Mark van den Brand, Paul Klint, Chris Verhoef
Venue: ACM SIGPLAN Notices (1997)

Generic language technology and compiler construction techniques are a prerequisite to build analysis and conversion tools that are needed for the re-engineering of large software systems. We argue that generic language technology is a crucial means to do fundamental re-engineering. Furthermore, we address the issue that the application of compiler construction techniques in re-engineering generates new research questions in the field of compiler construction.
An online, simulation-based patient scheduling system
Authors: Hans Manansang, Joseph A. Heim
Venue: Proceedings of the 28th conference on Winter simulation (1996)

In this research, the application of on-line simulation for patient scheduling decision support in a clinical environment is investigated. A prototype system was designed and constructed to demonstrate the concepts and to address various problems to be faced in implementation of the system.
Assessing the Importance of Design Through Product Archaeology
Authors: Karl T. Ulrich, Scott Pearson
Venue: Management Science (1998)

This paper assesses the importance of design in determining product costs by measuring the variation in design performance among a set of competing design efforts. This assessment is completed for a set of functionally similar products in a single product category: automatic drip coffee makers. The approach of this study is to measure the manufacturing content-the attributes of the design that drive cost-through analysis of the physical products themselves, and to estimate how variation in manufacturing content relates to variation in cost in a hypothetical manufacturing setting. We call this approach product archaeology. For the domain of coffee makers, we find significant variation in manufacturing content. This variation in manufacturing content corresponds to a range of estimated manufacturing costs, for a hypothetical manufacturing system, of approximately 50 percent of the average manufacturing cost of the products. We also find that differences in capabilities among product development efforts are the most plausible explanation for the differences in manufacturing content.
The MATLAB ODE Suite
Authors: Lawrence F. Shampine, Mark W. Reichelt
Venue: SIAM Journal on Scientific Computing (1997)

This paper describes mathematical and software developments for a suite of programs for solving ordinary differential equations in MATLAB.
Monitoring the efficiency of a reuse program
Authors: L. Benedicenti, G. Succi, A. Valerio, T. Vernazza
Venue: ACM SIGAPP Applied Computing Review (1996)

Introducing software reuse at a corporate wide level represents one of the most promising means of addressing rising costs plaguing the software industry. A series of mechanisms are needed for shortening development cycles and providing reliable software of high quality which will be more maintainable and flexible for future extensions.This paper presents an overview of a reuse program that is intended to institutionalise a software reuse process that incorporates reuse-specific activities all along an object oriented software development process, drawing heavily on a reusable software artifact library system which has been designed to support the classification, management and search for artifacts to be employed in reuse efforts.Due to the increasing competition and rapid technological innovations that mark nowadays the software applications' field, this sector has undergone radical changes, forcing operators to cope with a growing demand of new applications and services, in terms of quality, variety, reliability, and, last but not least, low prices.In this situation the traditional custom software development methodologies show all its inadequateness and ineffectiveness: to become really competitive in developing new applications, able to survive in a global market, an organisation needs to adopt leading edge technologies inside a defined, well planned and specific software development process.Moreover, traditional software development methodologies do not allow an efficient maintenance of the products, while any modification or extension of these products often results in a full redevelopment of them.A new iterative development philosophy based on software reuse and using the emerging object oriented technologies seems to be the right trade-off among the opposed factors characterising a successful telecommunication product or service: high-quality, low-cost, reduced time-to-market, flexibility and maintainability, just to tell some. In this view, a systematic reuse program to support and to integrate the software development activities, incorporating a reuse library to support the classification and management of the heterogeneous reusable components, is a particularly interesting and promising methodology.
User-level Real-Time Network System on Microkernel-basedOperating Systems
Authors: Tatsuo Nakajima, Hideyuki Tokuda
Venue: Selected papers from the 4th workshop on Parallel and distributed real-time systems (1998)

This paper presents the design and implementation of a user-level real-time network system in Real-Time Mach. Traditional network systems for microkernel based operating systems, which tend to focus on high performance and flexibility, are not suitable for real-time communication. Our network system provides a framework for implementing real-time network protocols which require to bound protocol processing time, and it is suitable for implementing on microkernel based operating systems. In this paper, we especially focus on the aspects to avoid the priority inversion problem in order to make network systems more preemptable and predictable. We also describe the feasibility of our network system for building distributed multimedia systems.
Using null effects estimators in the analysis of simulation output
Authors: Lee W. Schruben, David Goldsman, Douglas J. Morrice
Venue: Proceedings of the 28th conference on Winter simulation (1996)

In a simulation experiment there are certain null effects whose true values are known to be zero. This paper investigates various estimators of the null effects. We apply these estimators of zero in two ways. First, null effects estimators are used to construct confidence intervals. We derive a null effects version of the batch means confidence interval that has certain desirable properties. Second, null effects estimators are used as control variates in variance reduction schemes. The achieved variance reductions are modest, but we present some interesting applications; for example, the output from one simulation model can be used to compute control variates for the output of another.
Information architecture for the World Wide Web
Authors: Louis Rosenfeld, Peter Morville
Venue:  (1998)

Learn how to merge aesthetics and mechanics to design web sites that "work." This book shows how to apply principles of architecture and library science to design cohesive web sites and intranets that are easy to use, manage, and expand. Covers building complex sites, hierarchy design and organization, and techniques to make your site easier to search. For webmasters, designers, and administrators.
File server scaling with network-attached secure disks
Authors: Garth A. Gibson, David F. Nagle, Khalil Amiri, Fay W. Chang, Eugene M. Feinberg, Howard Gobioff, Chen Lee, Berend Ozceri, Erik Riedel, David Rochberg, Jim Zelenka
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

By providing direct data transfer between storage and client, network-attached storage devices have the potential to improve scalability for existing distributed file systems (by removing the server as a bottleneck) and bandwidth for new parallel and distributed file systems (through network striping and more efficient data paths). Together, these advantages influence a large enough fraction of the storage market to make commodity network-attached storage feasible. Realizing the technology's full potential requires careful consideration across a wide range of file system, networking and security issues. This paper contrasts two network-attached storage architectures---(1) Networked SCSI disks (NetSCSI) are network-attached storage devices with minimal changes from the familiar SCSI interface, while (2) Network-Attached Secure Disks (NASD) are drives that support independent client access to drive object services. To estimate the potential performance benefits of these architectures, we develop an analytic model and perform trace-driven replay experiments based on AFS and NFS traces. Our results suggest that NetSCSI can reduce file server load during a burst of NFS or AFS activity by about 30%. With the NASD architecture, server load (during burst activity) can be reduced by a factor of up to five for AFS and up to ten for NFS.