ppxscal/embedding_network huggingface dataset:
Formalising Process Scheduling Requirements for an Aircraft Operational Flight Program
Authors: Jin Song Dong, Neale Fulton, Lin Zucconi, John Colton
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Safety critical systems, such as aviation systems controlled by software, often have hard real-time requirements. Producing the correct result at the right time is the fundamental goal of such systems. Formally specifying the system functions and the timing requirements is the crucial step towards achieving such a goal. Furthermore, aviation systems often need to be modified or upgraded on a regular basis, i.e. functionality and timing constraints may be altered. Therefore, the formal specification of such systems needs to be easily maintained and modified. In this paper, we are interested in applying formal object modelling techniques to specify scheduling requirements of the multi-parallel processes of an aircraft operational flight program (OFP). Our aim is not only to formalise the scheduling requirements for a particular aircraft, but more importantly to demonstrate an incremental and extendible modelling approach such that our model can be readily reused to specify other aircraft OFP scheduling requirements.
Expressive global protocols via logic-based electronic institutions
Authors: Wamberto W. Vasconcelos
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We propose a notation to specify and reason about an expressive class of protocols. Our notation is logic-based, employing a restricted form of first-order constructs added with sets. We formally associate the syntax of our constructs with a precise semantics. The semantics enables us to automatically build explicit models which can be used to restrict the possible executions of a given Multi-Agent System. Our notation has been incorporated to a variant of electronic institutions -- an encompassing and flexible approach to specify open agent organisations -- and we have implemented a proof-of-concept platform to enact arbitrary protocols using our notation.
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Venue: Applications, Technologies, Architectures, and Protocols for Computer Communication (2003)

Welcome to the SIGCOMM 2003 Data Communications Festival in Karlsruhe, Germany!This year's SIGCOMM is hosted in a typical German town: Karlsruhe, a multifaceted vibrant and friendly city. Karlsruhe, population 425,000, was founded in 1715 and is located in the famous Rhine Basin in the South of Germany at the borders of the beautiful Black Forest close to France. Overall this region has more days of sunshine than any other German city. The highlight of the 2003 social program gives you a chance to explore the world-famous castle and the picturesque old town of Heidelberg. The conference is hosted by the University of Karlsruhe, the oldest Technical University in Germany. We appreciate the generosity of our host as well as the corporate sponsors of the conference: Intel Research and Microsoft Research, Cambridge.This year's conference broadens the traditional scope of the annual SIGCOMM conference in a number of ways: an expanded technical program including position papers exploring various viewpoints and a poster session showcasing work-in-progress; a set of six workshops and two tutorials that are interleaved with the technical conference to encourage participation by a broad set of attendees. Five workshops are held for the first time, covering networking research (MoMe Tools and NREDS), future architectures (FDNA), network - I/O convergence (NICELI), and a QoS retrospective (RIPQoS). The highly successful education workshop (NetEd) returns for a second year. Tutorials given by renowned experts cover network security and self-similar traffic.
Wearable Computers in Battle: Recent Advances in the Land Warrior System
Authors: John Murray
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

The U.S. Army's Land Warrior program focuses upon providing the dismounted soldier with up-to-date technology for wireless communication, navigation, and data sharing. Recent program activity has centered upon applying commercially available solutions wherever possible. This review presents the latest system design, and discusses the results of recent evaluation exercises.
Blocking-based Simultaneous Reachability Analysis of Asynchronous Message-passing Programs
Authors: Yu Lei, Kuo-Chung Tai
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Existing reachability analysis techniques for asynchronousmessage-passing programs assume causal communication,which means that messages sent to a destinationare received in the order they are sent. In this paper,we present a new reachability analysis approach, calledblocking-based simultaneous reachability analysis (BSRA).BSRA can be applied to asynchronous message-passingprograms based on any communication scheme. From aglobal state g, BSRA allows processes to proceed simultaneouslyuntil each of them terminates or is ready to executereceive operation. Global states reached by such executionsfrom g are called next blocking points of g.Foreachnext blocking point of g, waiting messages and receive operationsare matched to produce immediate BSRA-based successorstates of g. Intermediate global states from g to eachg's immediate BSRA-based successors are not saved. Wedescribe an algorithm for generating BSRA-based reachabilitygraphs and show that this algorithm guarantees thedetection of deadlocks. Our empirical results indicate thatBSRA significantly reduces the number of states in reachabilitygraphs. Extensions of BSRA for partial order reductionand model checking are discussed.
Hierarchical Front-End Physical Design Solution Drives Modified Hand-Off
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

A design methodology for the implementation of multi-million gate system-on-chip designs is described. The new methodology is based on the creation of a physical prototype early in the back-end design process. The prototype is generated in a fraction of the time required to complete the traditional back-end flow but still maintains very high correlation with the final design. The physical prototype becomes the 'hub' where many design implementation decisions can be optimized by leveraging the short iteration times. Hierarchical design methodologies benefit from the prototyping stage by enabling a more optimal partitioning. The physical prototype also alters the nature of the hand-off model between front-end and back-end designers. The netlist can now be quickly validated using the prototype: the physical reality is being injected early in the design process resulting in fewer iterations between front-end and back-end. 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
Investigating the relationship between language model perplexity and IR precision-recall measures
Authors: Leif Azzopardi, Mark Girolami, Keith van Risjbergen
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

An empirical study has been conducted investigating the relationship between the performance of an aspect based language model in terms of perplexity and the corresponding information retrieval performance obtained. It is observed, on the corpora considered, that the perplexity of the language model has a systematic relationship with the achievable precision recall performance though it is not statistically significant.
Can Intuition Become Rigorous? Foundations for UML Model Verification Tools
Authors: José Luis Fernández Alemán, Ambrosio Toval Álvarez
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

The Unified Modeling Language, UML, is the object-oriented notation adopted as the standard for object-oriented Analysis and Design by the Object Management Group. This paper reports on research to facilitate the formal revision of UML informal specifications. The approach is based on the algebraic specification formal theory, which is used to formalize the UML Statechart Diagrams and subsequently verify them. To illustrate the proposal, the so-called orthogonality property is investigated. This property is modeled at the UML metamodel level so that its fulfillment on the part of any particular UML Statechart diagram can be mathematically proven or disproven. The formal models obtained are specified in the executable formal language Maude thus providing the additional advantage of using them as functional prototypes. These results lead up to a whole formalization of the UML, which can be used in practice, and lay the foundations for the construction of rigorous UML CASE tools.
Geospatial metadata querying and visualization on the WWW using Java/sup TM/ applets
Authors: N. Alper, C. Stein
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

This paper presents the query and visualization interfaces of the Master Environmental Library (MEL) system. MEL uses the World Wide Web (WWW) to make accessible distributed data whose metadata conform to the Federal Geographic Data Committee's (FGDC) content standards for digital geospatial metadata. The interfaces are implemented as Java/sup TM/ applets and are more intuitive, interactive and possess greater functionality than their Hypertext Markup Language (HTML) counterparts. As well as querying, the interface allows users to visualize and manage the list of query results so that users can more quickly discover the datasets of real interest. Several new tools used to visualize attributes of the metadata are presented.
Application of cover-free codes and combinatorial designs to two-stage testing
Authors: Toby Berger, Vladimir I. Levenshtein
Venue: Discrete Applied Mathematics (2003)

We study combinatorial and probabilistic properties of cover-free codes and block designs which are useful for their efficient application as the first stage of two-stage group testing procedures. Particular attention is paid to these procedures because of their importance in such applications as monoclonal antibody generation and cDNA library screening.
Efficient Hash-Consing of Recursive Types
Authors: Jeffrey Considine
Venue:  (2000)

Abstract Efficient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive types in particular are important to consider, as naive representations of recursive types may be arbitrarily larger than necessary through unfolding. Hash-consing has been used to efficiently store non-recursive types. Deterministic finite automata techniques have been used to efficiently perform various operations on recursive types. We present a new system for storing recursive types combining hash-consing and deterministic finite automata techniques. The space requirements are linear in the number of distinct types. Both update and lookup operations take polynomial time and linear space and type equality can be checked in constant time once both types are in the system.
On Parsing Context Free Languages in Parallel Environments
Authors: Charles N. Fischer
Venue:  (1975)

Non-canonical generalization of several bottom-up parsing methods, including Simple Precedence, LR(k), SLR(k), and LALR(k) are considered. It is seen that these methods can readily be made to generate many concurrent reductions and thus can be used to advantage in parallel environments. it is suggested that such methods could be used to produce practical parsers for such parallel computers as the CDC Star-100. Further, the grammar classes defined by these parallel methods are studied and compared with the grammar classes defined by a number of serial parsing techniques.
Predicting Deviations in Software Quality by Using Relative Critical Value Deviation Metrics
Authors: Norman F. Schneidewind, Allen P. Nikora
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

We develop a new metric, Relative Critical Value Deviation (RCVD), for classifying and predicting software quality. The RCVD is based on the concept that the extent to which a metric's value deviates from its critical value, normalized by the scale of the metric, indicates the degree to which the item being measured does not conform to a specified norm. For example, the deviation in body temperature above 98.6 Fahrenheit degrees is a surrogate for fever. Similarly, the RCVD is a surrogate for the extent to which the quality of software deviates from acceptable norms (e.g., zero discrepancy reports). Early in development, surrogate metrics are needed to make predictions of quality before quality data are available. The RCVD can be computed for a single metric or multiple metrics. Its application is in assessing newly developed modules by their quality in the absence of quality data. The RCVD is a part of the larger framework of our measurement models that include the use of Boolean Discriminant Functions for classifying software quality. We demonstrate our concepts using Space Shuttle flight software data.
Connecting reusable software process elements and components
Authors: M. I. Kellner
Venue: Proceedings of the 10th International Software Process Workshop (1996)

The paper focuses on one particular topic within the realm of software process reuse: namely, the issue of connections among reusable software process elements and components. Such connections can be problematic even in cases where human ingenuity and understanding is counted on entirely to smooth out the connection details while performing the process. However, the difficulties become more severe in cases involving process technology, such as formal representation of processes in a process modeling language, automated analysis and simulation of processes, and automated execution support for processes (aka process-centered environments). The paper addresses the connection issues that arise across all of these cases, particularly including the challenges that process reuse pose to process technology.
Multiple-Valued Data Recovery Techniques for Band-Limited Channels in VLSI
Authors: Yasushi Yuminaka, Tatsuya Morishita, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

Increasing VLSI system performance requires higher busbandwidths while maintaining low cost in area, power and complexity.Bus bandwidth improvement is historically achieved by increased clockfrequency, but is restricted by a signal deterioration due to intersymbol interference (ISI).Although the use of multi-level signal can increase signaling bandwidthwithout increasing clock frequency, ISI becomes severerthan binary signals.This paper investigates multiple-valued data recovery techniques for band-limited channels to achieve high-speed data transmission in VLSI systems.The multi-level signaling employs a simple equalization techniqueto improve a channel bandwidth without using a complex adaptiveequalizer.Also, in order to realize band-efficient data transmission,we present intra-chip multiple-valued code-division multipleaccess (MV-CDMA) techniques.
Manipulating and documenting software structures using SHriMP views
Authors: M.-A. D. Storey, H. A. Muller
Venue: Proceedings of the International Conference on Software Maintenance (1995)

An effective approach to program understanding involves browsing, exploring, and creating views that document software structures at different levels of abstraction. While exploring the myriad of relationships in a multi-million line legacy system, one can easily loose context. One approach to alleviate this problem is to visualize these structures using fisheye techniques. This paper introduces Simple Hierarchical Multi-Perspective views (SHriMPs). The SHriMP visualization technique has been incorporated into the Rigi reverse engineering system. This greatly enhances Rigi's capabilities for documenting design patterns and architectural diagrams that span multiple levels of abstraction. The applicability and usefulness of SHriMPs is illustrated with selected program understanding tasks.
Rank Predicates vs. Progress Measures in Concurrent-Program Verification
Authors: Moshe Y. Vardi
Venue:  (1996)

This note describes a direct relationship between rank predicates and progress measures in concurrent-program verification.
RC Power Bus Maximum Voltage Drop in Digital VLSI Circuits
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents an input-independent method for finding bounds on the voltage drop in RC power bus in combinational macro-blocks circuits. The voltage at power bus nodes is expressed in term of gate currents using sensitivity analysis. Circuit timing information, functionality and logic dependencies are employed to find maximum simultaneous high-to-low and low-to-high switching in a subinterval of a clock cycle. The sensitivity information together with an optimization procedure are applied to find bounds on the voltage drop in targeted bus nodes. The effects of signal statistical variations on the results are automatically included in our method. Comparisons to exhaustive HSPICE simulation of circuits extracted from layout are used to validate our approach.
A Generalized Methodology for Evaluating and Optimizing System Design Factors
Authors: Jaffar Rehman, Evan Lock, Cuong Nguyen
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In complex systems' design, there is a need for an automated generalized methodology to evaluate and optimize a design with respect to a variety of System Design Factors (SDFs). In this paper, we present a methodology which allows the designer to specify their own hierarchical set of SDFs and the preferred models to evaluate those SDFs. This methodology can be used throughout many of the phases of the systems engineering life cycle. The use of the methodology will increase productivity in system design and reduce cost and improve effectiveness of the systems designed.
Teaching image processing using minimal mathematics
Authors: Alasdair McAndrew
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Image processing is often presented as a two dimensional version of signal processing, and as such, assumes for its background several years of undergraduate engineering-style mathematics. But such heavy mathematics does not form the background of many students of computer science. In Australia, some tertiary courses are phasing formal mathematics out of their computer science courses completely. This means that the effective teaching of image processing to students of computer science must use as little mathematics as possible. In this paper we discuss the undergraduate subjects taught at Victoria University of Technology (VUT), and our methods of keeping the mathematics in them to a minimum.
Proceedings of Third DIMACS Workshop on DNA Based Computers
Authors: DIMACS
Venue:  (1997)

Proceedings of Third DIMACS Workshop on DNA Based Computers 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
Parallel Computation of Configuration Space on Reconfigurable Mesh with Faults
Authors: John Jing-Fu Jenq, Dajin Wang
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The reconfigurable mesh (RMESH) can be used to compute robotic paths in presence of obstacles, in which the robot and obstacle images are represented and processed in, mesh processors. For a non-point-like robot, we can compute the so-called configuration space to expand the obstacles, so that the robot can be reduced to a reference point to facilitate the robot's motion planning. In this paper, we present algorithms to compute configuration space in a reconfigurable mesh that contains sparsely distributed faulty processors. The robots of rectangular and circular shapes are treated. It will be seen that in terms of computing configuration space, reconfigurable mesh can tolerate faulty processors without much extra cost - the computation takes the optimal O(1) time in both fault-free and faulty reconfigurable meshes.
The OPTICAL Project: Optics and Topography Involving the Cornea And Lens
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The OPTICAL project is a multidisciplinary effort in the Computer Science, Division and School of Optometry. "OPTICAL" is an acronym for "OPtics and Topography Involving the Cornea And Lens". This project is concerned with the measurement, modeling, reconstruction, and visualization of the shape of the human cornea.The cornea is the clear fibrous tissue forming the front surface of the eye. Its shape is very important in determining visual acuity. The shape is also important for fitting contact lenses and performing cornea1 refractive surgery.To recover the shape of the cornea, clinicians use one of several commercially available cornea1 topography instruments known as videokeratographs. These devices project a pattern onto the cornea and record the reflected image. The image is then analyzed to recover the shape information.We have developed a new analysis algorithm that has several advantages compared to current approaches: it is more accurate, it directly recovers position of the cornea, and it produces a continuous map over the entire surface. To develop this algorithm, we have assimilated ideas from a variety of fields, including ray-tracing (computer graphics and optics), smooth B-spline surfaces (geometric modeling) and simulation.This algorithm for accurately measuring the cornea is an essential first step in the scientific visualization of cornea1 topography. After measuring the shape of the cornea, it is important to be able to display the results in a manner that highlights the important features of the surface and is understandable to viewers with a wide variety of backgrounds. We have developed new scientific visualization approaches which overcome some of the shortcomings of the displays used in current cornea1 topography instruments. 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
On Newton-Like Iteration Functions: General Convergence Theorems and a Specific Algorithm
Authors: Kenneth M. Brown, John E. Dennis,  Jr.
Venue:  (1968)

NO SUPPLIED