ppxscal/embedding_network huggingface dataset:
Performance Measurements of the Multimedia Testbed on Mach 3.0: Experience Writing Real-Time Device Drivers, Servers, and Applications
Authors: Roger B. Dannenberg, David B. Anderson, Tom Neuendorffer, Dean Rubine, Jim Zelenka
Venue:  (1993)

Keywords: Performance measurements, multimedia, real time, operating systems, interprocess communication 22 pages Multimedia has generated a widespread interest in real-time support within general purpose operating systems. In addition to real-time support, multimedia often requires large amounts of data to be moved between devices and processes. The Multimedia Testbed is a set of applications that stress consistent low-latency response and efficient interprocess communication for large blocks of data. The Multimedia Testbed was ported to the Mach 3.0 Operating System where performance was measured. Experiments were conducted to compare various techniques for IPC and disk reads. Experience with fixed priority scheduling, user-level device drivers, and a high-resolution timer are also reported.
Computer communication techniques
Authors: Kenneth J. Thurber
Venue: ACM SIGARCH Computer Architecture News (1978)

This paper examines the concept of computer communication systems as seen from the viewpoint of the system architectures of distributed processor systems and networks. The fundamental concepts of bus structures, circuit switches, and message/packet switches are examined.
Revealing component properties through architectural styles
Authors: David S. Wile
Venue: Journal of Systems and Software (2003)

An underlying assumption in even using the phrase "component certification and system prediction" is that an understanding of individual components' properties will lead to an understanding of a system's properties by some form of compositional reasoning. Unfortunately, standard analytical composition techniques suffer from two problems: (1) they require that the internal structure of components be revealed in order to reason about them and (2) they deal clumsily with properties that require analysis of patterns of interaction. Here, based on the observation that a formal software architecture description itself is a constructive composition mechanism, I illustrate how the use of software architecture styles can sometimes alleviate the first problem and solve the latter.
Two Views on Security Software Liability: Using the Right Legal Tools
Authors: Carey Heckman
Venue: IEEE Security and Privacy (2003)

A point-counterpoint presentation on whether the legal system is the answer for security software liability issues.
Moisture and Heat Transport in Unsaturated Swelling Porous Media: AParallel-Flow, Multi-Scale, Mixture-Theoretic Approach
Authors: Lynn S Bennethum, John H. Cushman
Venue:  (1998)

A three-scale theory of both moisture and heat transport is presented for an unsaturated swelling porous media. At the microscale the system consists of macromolecules and an adsorbed fluid, both of which are considered as distinct non-overlapping continua. At the mesoscale the macromolecule, and adsorbed fluid are homogenized to form particles. At this scale each phase within the particle is considered as an overlaying continua. The mesoscale particles coexist with a bulk fluid which may be either liquid or vapor; the particles and bulk fluid exist as distinct non-overlaying continua. At the macroscale, the mesoscale particles and bulk fluid are homogenized to form overlaying continua at each point in space. The homogenization procedure is modified mixture theoretic. A single energy equation is used at the macroscale where the constitutive theory is developed. The model has one time scale so it may be thought of as a parallel flow model. The particles are saturated, but the mesoscale and macroscale bulk fluid may be vapor and/or liquid.
A Framework for Building Environment-Aware Software
Authors: Tatsuo Nakajima
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

In this paper, we propose a software architecture for building environment-aware software that runs in various real-time computing environments by adapting programs to respective environments. The framework is especially suitable for embedded computing environments since the environments require to support various types of computers.
The Flash Animator
Authors: Sandro Corsaro
Venue:  (2002)

:Intrigued by digital animation? Know a little bit about Macromedia Flash but are ready to take it to the next level? The Flash Animator will teach you how to create traditional-looking animations faster, cheaper, and with more delivery options. Sandro Corsaro helps you to develop a solid understanding of the principles of traditional animation, and then guides you step by step through bringing those principles to life with Macromedia Flash. Topics range from creating basic ball bounces to managing complex character design, sound, and optimization issues.Interviews with numerous experts in the animation industry-complete with beautiful artwork and insights from feature-film animators and web pioneers-are included to inspire you along your Macromedia Flash animation path. Interviewees include: Iwoa Takamoto, creator of Scooby Doo; Brad Abelson, storyboard artist, The Simpsons; Joe Shields, Joe Cartoon; Tom Winkler, Doodie.com; and many other influential animators. This book's CD contains all source files for the book's examples, exclusive animation files, and bonus Macromedia Flash cartoons. There is also an in-depth audio interview with Iwoa Takamoto.
Adobe Photoshop 7 One Click Wow!
Authors: Jack Davis
Venue:  (2002)

:Adobe Photoshop 7 One-Click Wow! gives you a CD-ROM filled with more than 800 of the greatest time-saving, creativity-enhancing "right-now" solutions to ever hit your desktop. Adobe Photoshop 7 One-Click Wow! places this incredible range of creative capabilities right within Photoshop's many pop-out menus. You'll find them indispensable for your daily work flow and for those special "need it yesterday" projects 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
User Plane Architecture of 3rd Generation Mobile Telecommunication Network
Authors: Juha Kalliokulju
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper presents modifications that are proposed to the 3rd generation packet data network in 3GPP (3rd Generation Partnership Project). The scope of the paper is the user plane of the packet data network. The UMTS (Universal Mobile Telecommunications System) network architecture is based on the GPRS (General Packet Radio Service). In this paper, the proposed UMTS packet data network is presented and compared to the GPRS. In the comparison, modifications are highlighted and tasks of different protocols and their differences are evaluated. The comparison of protocols concentrates on the user plane or parts that affect to the user plane data transfer. A comparison of the advantages and drawbacks is made. Finally, the paper concludes the network modifications and changes on functional split. 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
Numerical study of a non-equilibrium interface model
Authors: Balakrishna Subramanian, G. T. Barkema, J. L. Lebowitz, E. R. Speer
Venue:  (1996)

We have carried out extensive computer simulations of one-dimensional models related to the low noise (solid-on-solid) non-equilibrium interface of a two dimensional anchored Toom model with unbiased and biased noise. For the unbiased case the computed fluctuations of the interface in this limit provide new numerical evidence for the logarithmic correction to the subnormal $L^{\frac{1}{2}}$ variance which was predicted by the dynamic renormalization group calculations on the modified Edwards-Wilkinson equation. In the biased case the simulations are in close quantitative agreement with the predictions of the Collective Variable Approximation (CVA), which gives the same $L^{\frac{2}{3}}$ behavior of the variance as the KPZ equation.
Towards software process modules
Authors: M. Verlage
Venue: Proceedings of the 10th International Software Process Workshop (1996)

The goal of software process model reuse should be to provide a comprehensive process model that guides and coordinates all roles within a project. This means that roles do not use their own process model, but all roles use a single, integrated one that represents all needed information. Views are derived to present information necessary for performing a role's tasks. Because every project is unique, reuse of software process models requires tailoring. Reusing generic, large software process models seems to be impractical, because of many interdependencies between generic parts of the model. Process engineering will only be successful when techniques are developed to formulate units of software process modules (staying relatively stable from project to project), to tailor them according to new contexts, and to integrate them into a comprehensive software process model. The hypothesis of this paper is that views are the process modules to be reused. Views are less complex and easier to maintain than a comprehensive process model.
Uniform Actions in Asynchronous Distributed Systems
Authors: Dalia Malki, Kenneth P. Birman, Aleta M. Ricciardi, Andre Schiper
Venue:  (1994)

We develop necessary conditions for the development of asynchronous distributed software that will perform {\em uniform} actions (events that if performed by any process, must be performed at all processes). The paper focuses on {\em dynamic uniformity}, which differs from the classical problems in that processes continually leave and join the ongoing computation. Here, we first treat a static version of the problem (lacking joins), and then extend the results so obtained to also include joins. Our results demonstrate that in contrast to Consensus, which cannot be solved in asynchronous systems with even a single faulty process, dynamic uniformity can be solved using a failure detection mechanism that makes bounded numbers of mistakes. Because dynamic uniformity arises in systems that maintain safety within a ``primary partition'''' of a network, our paper provides a rigorous characterization of the framework upon which several existing distributed programming environments are based.
CCIE Routing and Switching Exam Certification Guide
Authors: A. Anthony Bruno
Venue:  (2002)

:The only official Cisco Systems®-endorsed study guide for the CCIE Routing and Switching examCD-ROM customizable test engine with unique practice questions and full electronic version of the text.The only Cisco®-approved study guide, developed with the assistance of the CCIE program manager.Unsurpassed content for CCIE exam preparation focused the exam content addressed in both the Routing and Switching and the Communication and Services qualification examsCCIE Exam Certification Guide: Routing and Switching covers the general networking topics listed in the Routing & Switching (#350-001) and Communications & Services CCIE Qualification Exams. This book will help readers increase and reinforce their knowledge in each general networking area to prepare for the qualifying exam; it serves as a complete self-assessment tool for candidates to identify weak spots in their knowledge that require additional review. As with all Exam Certification Guides from Cisco Press, each chapter has a "Do I know this already?" pre-chapter quiz and other standard elements like the accompanying CD-ROM with practice questions that will help readers prepare for the test.In addition to building confidence as an exam preparation resource, this book provides network engineers, designers, and architects with an all-around reference to keep them on top of the latest and most important networking technologies and techniques. 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
VIP: a Verilog Interpreter for Preprocessing
Authors: S. Mittra
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The paper describes VIP, a Verilog Interpreter for Preprocessing. The single pass interpreter converts the extended standard of the Verilog language proposed in LRM2.0a by OVI to the existing standard as in LRM1.0, thus enabling the simulation of the newly written code by the existing simulators. Even if the upcoming standard of the IEEE working committee 1364 disregards the LRM2.0a standard this tool will continue to be an important option for easy code management in future. The two new features which have been included to be checked by the interpreter are the array of instances and the parameterized macro definition. Also the flexibility and performance of the interpreter has been compared with the other existing preprocessor.
50 Fast Digital Camera Techniques: Step-by-Step Techniques for taking digital photos, 1 edition
Authors: Gregory Georges, Larry Berman, Chris Maher
Venue:  (2003)

:Make the most of your digital camera! Whether you've just purchased your first one or you're an old hand at digital photography, you'll see your pictures improve almost instantly when you start using the tricks these professional photographers provide. Experiment with hot tips on lighting, filters, concepts, shooting techniques, and much more, with step-by-step instructions, lavish color illustrations, and in-depth discussions that help you make each technique your own.
Drosophila GRAIL: an intelligent system for gene recognition in Drosophila DNA sequences
Authors: Ying Xu, G. Helt, J. R. Einstein, G. Rubin, E. C. Uberbacher
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

An AI-based system for gene recognition in Drosophila DNA sequences was designed and implemented. The system consists of two main modules, one for coding exon recognition and one for single gene model construction. The exon recognition module finds a coding exon by recognition of its splice junctions (or translation start) and coding potential. The core of this module is a set of neural networks which evaluate an exon candidate for the possibility of being a true coding exon using the "recognized" splice junction (or translation start) and coding signals. The recognition process consists of four steps: generation of an exon candidate pool, elimination of improbable candidates using heuristic rules, candidate evaluation by trained neural networks, and candidate cluster resolution and final exon prediction. The gene model construction module takes as input the clustered exon candidates and builds a "best" possible single gene model using an efficient dynamic programming algorithm. 129 Drosophila sequences consisting of 441 coding exons including 216358 coding bases were extracted from GenBank and used to build statistical matrices and to train the neural networks. On this training set the system recognized 97% of the coding messages and predicted only 5% false messages. Among the "correctly" predicted exons, 68% match the actual exon exactly and 96% have at least one edge predicted correctly. On an independent test set consisting of 30 Drosophila sequences, the system recognized 96% of the coding messages and predicted 7% false messages.
Deadlock Analysis of Client/Server Programs
Authors: Jun Zhou, Kuo-Chung Tai
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Deadlocks are a common type of faults in distributed programs. To detect deadlocks in a distributed program P, one approach is to construct the reachability graph (RG) of P, which contains all possible states of P, and analyze the RG to detect deadlocks. Since the size of RG(P) is an exponential function of the number of processes in P, the use of RG for deadlock detection has limited success.In this paper, we show an efficient technique for deadlock analysis of client/server programs. We present a theory of deadlock analysis of client/server LTS systems, in which a server or client is represented as a labeled transition system (LTS). For a client/server LTS system, we define its client/server reachability graph (CSRG), which has its size being a polynomial function of the number of clients. We show that the use of CSRG not only significantly reduces the effort for deadlock analysis but also provides a basis for proving freedom from deadlock for any number of clients.
Towards a motivation-based approach for evaluating goals
Authors: Steve Munroe, Michael Luck, Mark d'Inverno
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in which a goal state can only be partially satisfied. In these situations the traditional symbolic goal representation needs modifying in order that an agent can determine a worth value of a goal state and also of any state approximating the goal. In our work we use the concept of worth in two ways. First, we propose a mechanism by which the worth of a goal is dynamically set as a function of the intensity of an underlying motivation. Second, we determine the worth of any state in relation to a goal through the use of a metric by which we can measure the proximity of an environmental state to a goal. In this way, it is possible to make judgements about the relative satisfaction an environmental state offers in regard to a goal.
A hierarchical approach in multilevel thresholding based on maximum entropy and Bayes' formula
Authors: Yan Chang, Alan M. N. Fu, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

An efficient hierarchical approach for image multi-level thresholding is proposed based on the maximum entropy principle and Bayes' formula, in which no assumptions of the image histogram are made. Five forms of conditional probability distributions are employed for optimal threshold determination. Our experiments demonstrate that the proposed method is effective and achieves a significant improvement in speed compared to the exhaustive search method.
Context-Sensitive Statistics for Improved Grammatical Language Models
Authors: Eugene Charniak, Glenn Carroll
Venue:  (1994)

We develop a language model using probabilistic context-free grammars (PCFGs) that is ``pseudo context-sensitive'''' in that the probability that a non-terminal $N$ expands using a rule $r$ depends on $N$''s parent. We derive the equations for estimating the necessary probabilities using a variant of the inside-outside algorithm. We give experimental results showing that, beginning with a high-performance PCFG, one can develop a pseudo PCSG that yields significant performance gains. Analysis shows that the benefits from the context-sensitive statistics are localized, suggesting that we can use them to extend the original PCFG. Experimental results confirm that this is both feasible and the resulting grammar retains the performance gains. This implies that our scheme may be useful as a novel method for PCFG induction.
Defect-Oriented Fault Simulation and Test Generation in Digital Circuits
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

A generalized approach is presented to fault simulation and test generation based on a uniform functional fault model for different system representation levels. The fault model allows to represent the defects in components and defects in the communication network of components by the same technique. Physical defects are modeled as parameters in generalized differential equations. Solutions of these equations give the conditions at which defects are locally activated. The defect activation conditions are used as functional fault models for the higher level fault simulation purposes. In such a way, the functional fault model can be regarded as interface for mapping faults from one system level to another, helping to carry out hierarchical fault simulation and test generation in digital systems. A methodology is proposed which allows to find the types of faults that may occur in a real circuit, to determine their probabilities, and to find the input test patterns that detect these faults. Experimental data of the hierarchical defect-oriented simulation for ISCAS'85 benchmarks are presented, which show that classical stuck-at fault based simulation and the test coverage calculation based on counting defects without considering defect probabilities may lead to considerable overestimation of results.
A theorem-proving approach to deciding properties of finite control agents
Authors: Torkel Franzen
Venue:  (1996)

The report presents a decision procedure for assertions in an extension of the mu-calculus about finite-control pi-calculus agents. The procedure is based on the classical cut-free sequent calculus and associated techniques of automatic theorem proving.
Performance analysis of two-level forward error correction for lost cell recovery in ATM networks
Authors: N. C. Oguz, E. Ayanoglu
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The major source of errors in B-ISDN/ATM systems is expected to be buffer overflow during congested conditions, resulting in ATM cell losses which degrade the quality of service. It has been shown by many authors that the performance of the end-to-end system can be made much less sensitive to cell loss by means of forward error correction. This paper discusses the use of a two-level forward error correction scheme for virtual channel and virtual path connections in ATM networks. The scheme exploits simple block coding and code interleaving simultaneously. The simple block, interleaved, and joint coding schemes are studied and analyzed by using a novel and accurate discrete-time analytical method which enables the burstiness of cell losses be captured precisely. Detailed performance calculations, which indicate that it is possible to reduce the cell loss rate by several orders of magnitude over a wide range of network load for various traffic conditions, are discussed, and compared with simulation results. The comparisons show that the method is very accurate for bursty traffic. The advantages of the three coding techniques are quantified for different traffic characteristics and scenarios.
On Managing Classes for Evolving Software
Authors: Liwu Li
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Evolution of object-oriented software involves addition, deletion, and replacement of classes. Maintenance of classes requires detect and resolve inconsistency between classes. The Unified Modeling Language (UML) is becoming the de facto standard modeling language. Here, we present a UML-based model of class interrelations for evolving object-oriented software. The model is based on notions contract and protocol. A contract can be used by a class designer to express services and requirements of the class, a protocol to register cooperations between classes. Founded on the UML extension mechanisms, we present an infrastructure for class designers to express contracts and register protocols. The infrastructure lays the foundation for class designers, implementers, and maintainers to validate class changes in software evolution. It makes automated validation possible.