ppxscal/embedding_network huggingface dataset:
Conjunctive Predicate Transformers for Reasoning about Concurrent Computation
Authors: K. M Chandy
Venue:  (1993)

In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calculus for reasoning about sequential programs. We suggest predicate transformers for reasoning about progress properties and for deducing properties obtained by parallel composition. The paper presents theorems about the predicate transformers and suggests how they can be used in program design. Familiarity with the wp calculus is assumed.
Reverse Engineering Tools for Ada Final Report
Venue:  (1992)

The GRASP/Ada project (Graphical Representations of Algorithms, Structures, and Processes for Ada) has successfully created and prototyped a new algorithmic level graphical representation for Ada software, the Control Structure Diagram (CSD). The primary impetus for creation of the CSD was to improve the comprehension efficiency of Ada software and, as a result, improve reliability and reduce costs. The emphasis has been on the automatic generation of the CSD from Ada PDL or source code to support reverse engineering and maintenance. The CSD has the potential to replace traditional prettyprinted Ada source code. In Phase 1 of the GRASP/Ada project, the CSD graphical constructs were created and applied manually to several small Ada programs. A prototype (Version 1) was designed and implemented using FLEX and BISON running under VMS on a VAX 11-780. In Phase 2, the prototype was improved and ported to the Sun 4 platform under UNIX. A user interface was designed and partially implemented using the HP widget toolkit and the X Windows System. In Phase 3, the user interface was extensively reworked using the Athena widget toolkit and X Windows. The prototype was applied successfully to numerous Ada programs ranging in size from several hundred to several thousand lines of source code. Following Phase 3, the prototype was evaluated by software engineering students at Auburn University and then updated with significant enhancements to the user interface including editing capabilities. Version 3.2 of the prototype has been prepared for limited distribution to facilitate further evaluation. The current prototype provides the capability for the user to generate CSDs from Ada PDL or source code in a reverse engineering as well as forward engineering mode with a level of flexibility suitable for practical application. 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
TCP-friendly SIMD Congestion Control and Its Convergence Behavior
Authors: Shudong Jin, Liang Guo, Ibrahim Matta, Azer Bestavros
Venue:  (2001)

Abstract The increased diversity of Internet application requirements has spurred recent interest in flexible congestion control mechanisms. Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back off when congestion is detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and packet loss rate. In this paper, we propose a novel window-based congestion control algorithm called SIMD (Square-Increase/Multiplicative-Decrease). Contrary to previous memory-less controls, SIMD utilizes history information in its control rules. It uses multiplicative decrease but the increase in window size is in proportion to the {\em square} of the time elapsed since the detection of the last loss event. Thus, SIMD can efficiently probe available bandwidth. Nevertheless, SIMD is TCP-friendly as well as TCP-compatible under RED, and it has much better convergence behavior than TCP-friendly AIMD and binomial algorithms proposed recently.
Meaningful information, sensor evolution, and the temporal horizon of embodied organisms
Authors: Chrystopher L. Nehaniv, Daniel Polani, Kerstin Dautenhahn, René te Beokhorst, Lola Cañamero
Venue: Proceedings of the eighth international conference on Artificial life (2002)

We survey and outline how an agent-centered, information-theoretic approach to meaningful information extending classical Shannon information theory by means of utility measures relevant for the goals of particular agents can be applied to sensor evolution for real and constructed organisms. Furthermore, we discuss the relationship of this approach to the programme of freeing artificial life and robotic systems from reactivity, by describing useful types of information with broader temporal horizon, for signaling, communication, affective grounding, two-process learning, individual learning, imitation and social learning, and episodic experiential information (memories, narrative, and culturally transmitted information).
Advanced Module Packaging Method
Authors: Peter C. Salmon
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

An intermediate solution between conventional printedcircuit board technology and wafer level packaging,WLP, is to fabricate interconnection circuits and flip chipassembly structures on large glass substrates using LCDmanufacturing equipment. Trace widths of 5 microns anda trace pitch of 10 microns are achievable on flexiblesubstrates as large as 1800 x 1500 mm. Back planes fordisplays and keyboards can also utilize thin filmtransistors, TFTs, as developed for LCDs and enhancedfor flexible assemblies (200°C processing). A flexiblecircuit is built on a glass carrier with an intermediaterelease layer. The carrier is discarded after allprocessing is complete, including interconnectioncircuits, IC chip assembly, test and rework. The assemblymethod uses gold stud bumps on IC chips, andcorresponding wells filled with solder on themotherboard. 100-micron pad pitch is achievable for ICchips, module cables, and test connections. Avoidance ofepoxy under layers contributes to a robust capability forreworking defective IC chips. The methods areapplicable to a wide range of products, from cell phonesto blade servers.
The Kalman-Bucy Filter for Linear Stochastic Dynamic Systems with Discontinuous Trajectories
Authors: V. Yu. Bereza, V. K. Yasinskii
Venue: Cybernetics and Systems Analysis (2003)

An optimal linear filtration problem is considered in the paper based on Kalman-Bucy results. The sequential linear regression method being a modification of fundamental Wiener results is used.
True Coverage: A Goal of Verification
Authors: Gary Feierbach, Vijay Gupta
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

There are a number of RTL coverage tools on themarket today that essentially tells you only that a set ofsignals has been toggled by a particular diagnostic test.This is useful in showing what areas of the RTL designare definitely not covered by the diagnostic test but tellsyou very little about the set of signals that have beentoggled. In an extreme case a diagnostic test may fail tofail when any one of these signals are in error. Thefollowing is a strategy for examining the coverageindicated by a commercial coverage testing softwarepackage and obtaining a truer picture of a diagnostictest's real coverage. This concept is extended to a fullregression test suite.
SIMPLE: a universal tool box for event trace analysis
Authors: P. Dauphin, R. Hofmann, F. Lemmen, B. Mohr
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

The event trace analysis system SIMPLE allows the evaluation of arbitrarily formatted event traces. SIMPLE is designed as a software package which comprises independent tools that are all based on a new kind of event trace access: the trace format is described in a trace description language (TDL) and evaluation tools access the event trace through a standardized problem-oriented event trace interface (POET). The language TDL is designed for problem-oriented description of event traces. The POET library is a monitor-independent function interface which enables the user to access measured data stored in event trace files in a problem-oriented manner. In order to be able to access and decode differently structured measured data, POET uses the event trace description in TDL. The event trace access tool TDL/POET is designed in order to meet the following requirements: object system independence; monitor independence; and source reference.
Utility-Based Call Admission Control for Adaptive Mobile Services
Authors: Jiangeng Wang, Ming Li, Xuejun Yang, Zailu Huang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Limited and time-varying wireless resources, user mobility and various application requirements promote the development of adaptive techniques. Focusing on the cell specific mobility, we propose a target utility-based rather than call drop probability-based solution to address the QoS stability intra/inter cell and tradeoff between carried traffic and degradation. Prediction and compensation methods are used in the proposed scheme with little assumption of traffic and user mobility model. The generality, scalability and computation issues are analyzed and concluded that the proposed solution is independent of application specific utility-bandwidthdefinition and ongoing user numbers.
Structural and Behavioral Decomposition in Object Oriented Models
Authors: J. Fischer, E. Holz, B. M"ller-Pedersen
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The decomposition of large systems into parts is a general principle of software design. Even more, in the scope of distributed systems a partition of the whole system into distributable components is necessary. Decisions about what constitutes a component of a system are usually either based on the behavior or on the structure of the system. Nevertheless there is a strong mutual influence between both kinds of decomposition. Despite the importance of structural and behavioral decomposition, many modeling notations and languages define the semantics of these concepts rather vague, and this may lead to incorrect implementation.This paper presents the new structuring mechanisms in the object oriented specification language SDL as of November 1999 (SDL-2000).SDL has had its primary force in structural decomposition. Object-oriented concepts as classes (types in SDL) and inheritance were introduced into the language in 1992.It has been demonstrated in the paper that it is possible for a language to provide (with formal semantics) combined mechanisms like objects with both state machines and internal structure of connected objects, composite states with well-defined interfaces, mechanisms for inheritance of such combined state machine and internal object structure. Moreover, the language also provides mechanisms for the dynamic creation of such composite structures, and mechanisms for the communication and data sharing between the contained elements. Combining the new concept of agent with the concept of interfaces makes SDL well suited for the design and development of applications in the context of distributed systems and middleware platforms (e.g. CORBA) The paper also gives a critical evaluation of these concepts and a comparison with similar approaches in UML and ROOM.
PhotoShop 7: Tips and Techniques
Authors: Wendy Willard
Venue:  (2002)

:Improve your use of Photoshop in Web and print design. Prepare and plan for Web page development and print output, then skillfully apply the latest design and production techniques. Perform simple adjustments as well as complex tasks -- optimize photographic imagery, build animation, add rollovers, adjust images to achieve perfect skin tones and transparent drop shadows, make appropriate color adjustments, create duotones, and more. Geared toward designers of all levels looking for exciting visual solutions, Photoshop 7 Tips & Techniques demystifies the complicated but enormously powerful features of Photoshop.
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering
Authors: Derek Rayside, Steve Reuss, Erik Hedges, Kostas Kontogiannis
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the call graph for a procedural program is simple. However, this is not the case for programs written in object-oriented languages, due to polymorphism. A number of algorithms for the static construction of an object-oriented program's call graph have been developed in the compiler optimization literature in recent years. In this study, we investigate the effect of three such algorithms on the automatic clustering of the Java Expert System Shell (JESS). Object-oriented programs have an inherently richer structure than those written in procedural languages, and so even medium sized programs such as JESS produce large graphs. Existing tools that we are aware of are not able to process such graphs. Consequently, we have developed our own algorithm for automatic clustering that is scalable to large graphs. This algorithm also supports user specified constraints using 'weighted' arcs.
Nineteen Ways to Compute the Exponential of a Matrix
Authors: C. B. Moler, Charles Van Loan
Venue:  (1976)

In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polynomial have been proposed. In practice, consideration of computational stability and efficiency indicates that some of the methods are preferable to others, but that none are completely satisfactory.
Fast Progressive Lossless Image Compression
Authors: G P Howard, Scott J Vitter
Venue:  (1994)

We present a method for progressive lossless compression of still grayscale images that combines the speed of our earlier FELICS method with the progressivity of our earlier MLP method. We use MLP''s pyramid-based pixel sequence, and image and error modeling and coding based on that of FELICS. In addition, we introduce a new prefix code with some advantages over the previously used Golomb and Rice codes. Our new progressive method gives compression ratios and speeds similar to those of non-progressive FELICS and those of JPEG lossless mode, also a non-progressive method. The image model in Progressive FELICS is based on a simple function of four nearby pixels. We select two of the four nearest known pixels, using the two with the middle (non-extreme) values. Then we code the pixel''s intensity relative to the selected pixels, using single bits, adjusted binary codes, and simple prefix codes like Golomb codes, Rice codes, or the new family of prefix codes introduced here. We estimate the coding parameter adaptively for each context, the context being the absolute value of the difference of the predicting pixels; we adjust the adaptation statistics at the beginning of each level in the progressive pixel sequence.
Clinical Data Management, 2 edition
Authors: Richard K. Rondel, Sheila A. Varley, Colin F. Webb
Venue:  (2002)

:The first comprehensive volume on the subject of clinical data management, this book contains concise, well-researched information covering all aspects of data management from handling early phase I studies in volunteers to the presentation of final reports for regulatory purposes. In addition, however, other areas fundamental to the success of any data management group are covered, such as study set-up, quality assurance, regulatory requirements and the impact of clinical research in general, and with all the subject matter an international approach has been taken. This easy-to-use text has been written by contributors who are known for their extensive experience in industry and who have been drawn from multinational companies worldwide. It will be of interest to anyone in the field of clinical data management, within the pharmaceutical industry, or associated industries and to all biomedical professionals working in clinical research.
MBA's Guide to the Internet
Authors: Stephen L. Nelson, Pat Coleman
Venue:  (2002)

:Beginning with fast-paced but thorough tutorials of the basics of working with the Internet, this guide gives the executive user an overview of Web browsing, the Internet's architecture, e-mail, newsgroups, and FTP (File Transfer Protocol) servers. Ways to use these tools to perform business research and techniques for using online business and government resources are discussed. Also included are step-by-step instructions for six common Internet business projects, including setting up a Web site, setting up a Web store, publishing an e-mail newsletter, using the Internet for publicity and promotion, using the Internet to recruit and as an employment tool, and setting up and managing an investment portfolio.Author Biography: Stephen L. Nelson is the author of Effective Executive's Guide to Project 2000, Quicken 2000 for Windows for Dummies, and QuickBooks 2000 for Dummies. His books on using computers in business have sold more than three million copies. He lives in Seattle, Washington. Pat Coleman is a technical editor and the coauthor of Effective Executive's Guide to Project 2000 and Windows 2000: In Record Time. She lives in Houston, Texas.
A Mechanism for Processing Argumentative Discourse
Authors: I C Guinn
Venue:  (1990)

The {\sc debater} system is an implementation of a model for argumentative discourse which aids in processing argumentative discussions on both the discourse level (the processing of what is said) and the surface syntactic level (the processing of certain syntactic phenomena like anaphora). The mechanism developed for processing argumentative discourse is called a {\em multi-stack hierarchy}. This tree-like structure proves useful in evaluating statements in the context of a debate and in responding to arguments in a coherent, organized manner. The multi-stack hierarchy provides a mechanism superior to Augmented Transition Network (ATN) grammars for processing discussions. The multi-stack hierarchy also can account for the usage of {\em pronominal references} as well as the presence of {\em deictic references}. These accounts are more satisfactory than explanations of pronominal and deictic references using a single focus stack. The multi-stack hierarchy is an amalgam of the structures postulated by Cohen and Birnbaum {\em et al.} to process argumentative discourses with the structure Reichman uses to account for certain surface syntactic level phenomenon. %\cite{kn:birnbaum80}\cite{kn:cohen87}\cite{kn:reichman85}. Overall, this approach to discourse processing is consistent with Grosz and Sidner''s division of discourse into three separate but interrelated parts: the intentional structure, the linguistic structure, and the attentional state. % \cite{kn:grosz86}. However, instead of maintaining one structure to represent the intentional structure and another to maintain the attentional state, the multi-stack hierarchy provides a single, relatively simple structure, to handle both tasks. 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
Faster Smarter Microsoft Office FrontPage 2003
Authors: William R. Stanek, Greg Holden
Venue:  (2003)

Now you can do the things you do every day with Microsoft Office FrontPage 2003-format Web pages, create hyperlinks, use style sheets-and ramp up on new and more advanced techniques-faster, smarter, better!
Millimix: Mixing in Small Batches
Authors: Jakobsson Markus, Juels Ari
Venue:  (1999)

We present Millimix, a mix network that is highly efficient on small input batches. The construction is conceptually simple, and both robust and private in the face of collusion by any minority set of malicious players. Additionally, Millimix the feature of being publicly verifiable. In other words, the mixing operation yields a transcript that demonstrates correctness to a third party that the mix proceeded correctly.
Scheduling to Reduce Memory Coherence Overhead on Coarse-Grain Multiprocessors
Authors: Christopher Connelly, Schlatter C Ellis
Venue:  (1995)

Some Distributed Shared Memory (DSM) and Cache-Only Memory Architecture (COMA) multiprocessors keep processes near the data they reference by transparently replicating remote data in the processes'' local memories. This automatic replication of data can impose substantial memory system overhead on an application since all replicated data must be kept coherent. We examine the effect of task scheduling on data replication and memory system overhead due to coherency requirements. We show that simple policies using programmer hints can reduce memory coherence overhead in our workload applications.
DLA'S YEAR 2000 REMEDIATION PROGRAM: Managing Organization-Wide Conversion and Compliance
Authors: Sarah J. Reed
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The potential for wide-spread computing error attributed to the calendar change-over from December 31, 1999 to January 1, 2000 has been described as a millennium crisis, catastrophe and a virus. For any business with computing systems incapable of correctly identifying, manipulating, or calculating dates outside of the 1900-1999 range the problem is a daunting and expensive challenge. Within the Defense Logistics Agency (DLA) we believe the problem is very serious -- what we call mission-critical -- and we have treated it as such in planning and executing the largest maintenance effort we've ever undertaken. DLA kicked off a formal Year 2000 project in November 1995 with nearly a full year of planning, preparation and piloting. This paper discusses our Year 2000 initiative and experiences in raising awareness and in assessing, renovating and validating our systems. Our program, built upon available industry research and our own experiences, has been modified as we have gained fresh insight and assimilated new lessons learned.
Design Through VERILOG HDL
Authors: T. R. Padmanabhan, B. Bala Sundari, Ti AR Patmaanapaan
Venue:  (2003)

:Verilog provides platforms for designs to be described at different layers of complexity, combine them in a seamless manner, test them at every stage and build up a bug-free design. This book guides readers towards mastering Verilog as an HDL and using it for design.
V: A Visual Query Language for Multimodal Interfaces
Authors: Robert P. Nilsson, Kent S. S Hammarstrom
Venue:  (1994)

This thesis proposes a two-dimensional, visual, direct manipulation query language intended to be used as an alternate modality to natural language in a multimodal interface. The language focuses on the visualisation of the logic of queries, and is intended to be flexible, extensible, and to have at least the expressive power of first order predicate logic with constraints. The language provides a basis for future inclusion of higher order logic (and thus a framework for database navigation with the language itself), DBMS features, and generalised quantifiers. As far as we have been able to judge, no such visual language of equal expressive power already exists. A "proof of concept" prototype has been implemented that illustrates some of the key concepts of the language.