ppxscal/embedding_network huggingface dataset:
Distributed dynamic carrier allocations in mobile cellular networks: search vs. update
Authors: Xuefeng Dong, T. H. Lai
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

There are two approaches to distributed implementation of dynamic carrier allocation (DCA) strategies: the update approach and the search approach. We first investigate the fundamental differences between the two approaches: two simple and representative schemes, namely the basic update scheme and the basic search scheme, are presented and compared. We argue that the update approach is more appropriate than the search approach for mobile cellular networks. Then we propose an advanced update scheme that is more efficient than the basic update scheme in terms of message complexity and carrier acquisition delay. The advanced update scheme can support a group of DCA strategies which require resource planning.
Fireworks MX: The Complete Reference, 1 edition
Authors: Doug Sahlin, David Crowder
Venue:  (2002)

:Create and optimize interactive graphics for Web designs with help from this essential resource. Fireworks MX: The Complete Reference explains how to use the program's professional-quality bitmap- and vector-editing features, take advantage of the automated animation capabilities, and create your own frame-by-frame animation. Find out how to develop complex Web navigation, export images, and integrate Fireworks MX with other applications, including Macromedia Dreamweaver. This is a must-have volume on the latest release of this revolutionary graphics toolset.
Designing reliable systems from reliable components using the context-dependent constraint concept
Authors: P. Molin
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

The problem of composing a system from well-behaving components is discussed. Specifically, necessary conditions for preserving the behaviour in a system context are analysed in this paper. Such conditions are defined as Context-Dependent Constraints (CDC). A non-formal approach is taken based on common system integration errors. It is suggested that the identification and verification of CDCs should be part of any development method based on component verification. The CDCs can also serve as an aid for designing reliable and maintainable systems, where the goal of the design process is to reduce the number of CDCs.
SimLab: Automatically Creating Physical Systems Simulators
Authors: Richard S. Palmer, James F. Cremer
Venue:  (1991)

SimLab, a software environment for creating simulators directly from computer-readable physics models, is based on the following concept: creating physical systems simulators should be as simple as describing the underlying physics to a colleague. Rather than programming in a conventional programming language, a SimLab user expresses physics models (and thus simulators) directly in terms of the concepts, quantities, and equations familiar to a scientist or engineer. The benefits of the SimLab approach include: 1) reducing the time and effort required to create simulators, 2) providing more understandable and reliable simulators, and 3) support for more sophisticated simulators, e.g., for multiple domain problems, which have proved intractible in the past.
Symbolic Model Checking for Real-Time Systems
Authors: Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine
Venue:  (1994)

We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a $\mu$-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzero execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed $\mu$-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of ``implementable'''' real-time programs-those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory.
Classifying and Detecting Plan-Based Misconceptions for Robust Plans
Authors: Randall J. Calistri
Venue:  (1990)

In order to maintain a truly cooperative dialogue, an intelligent natural language interface must be able to recognize misconceptions in the user''s plans. This involves solving two problems: determining what sorts of mistakes people make when they reason about plans, and figuring out how to recognize these mistakes when they occur. There are sixteen distinct ways that a plan can be improperly constructed. Each of these corresponds to one type of plan-based misconceptions. But is not necessary to consider all sixteen classes; the classification can be simplified to ten categories of detectable, distinguishable plan-based misconceptions. This classification can be used to develop a robust plan recognition algorithm that is capable of recognizing both correct plans and plans that contain misconceptions. Probabilistic methods can be used to handle the three main difficulties of robust plan recognition: dealing with the `hard'' classes of misconceptions, controlling the combinatorial explosion that results from the ambiguity inherent in faulty plans, and selecting the most likely plan among multiple competing explanations. The theory that is developed here is implemented in a program called Pathfinder, which is a probability-based plan recognition system based on the {\bf A*} best-first search algorithm that has been extended to recognize novel plan failures in an intelligent interface environment.
Ambiguity and reasoning
Authors: D. J Eijck, Jan O.M. Jaspars
Venue:  (1996)

In this paper, reasoning with ambiguous representations is explored in a formal way, with ambiguities at the level of propositions in propositional logic and predicate logic, and ambiguous representations of scopings in predicate logic as the main examples. First a version of propositional logic with propositional ambiguities is presented and a sequent axiomatization for it is given. This is then extended to predicate logic. Next, predicate logic with scope ambiguities is introduced and discussed, and again a sequent calculus for it is proposed. The conclusion connects the results to natural language semantics, and briefly compares them with existing logics of ambiguity. An appendix gives completeness proofs for our versions of ambiguous propositional and predicate logic.
Developing a bidding agent for multiple heterogeneous auctions
Authors: Patricia Anthony, Nicholas R. Jennings
Venue: ACM Transactions on Internet Technology (TOIT) (2003)

Due to the proliferation of online auctions, there is an increasing need to monitor and bid in multiple auctions in order to procure the best deal for the desired good. To this end, this paper reports on the development of a heuristic decision making framework that an autonomous agent can exploit to tackle the problem of bidding across multiple auctions with varying start and end times and with varying protocols (including English, Dutch and Vickrey). The framework is flexible, configurable, and enables the agent to adopt varying tactics and strategies that attempt to ensure that the desired item is delivered in a manner consistent with the user's preferences. Given this large space of possibilities, we employ a genetic algorithm to search (offline) for effective strategies in common classes of environment. The strategies that emerge from this evolution are then codified into the agent's reasoning behaviour so that it can select the most appropriate strategy to employ in its prevailing circumstances. The proposed framework has been implemented in a simulated marketplace environment and its effectiveness has been empirically demonstrated.
Using Proxy Failure Times With The Jelinski-Moranda Software Reliability Model
Authors: M. A. Quereshi, D. R. Jeske
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

We introduce the concept of proxy failure times for situations where system test data only consists of the fraction of test cases that fail for a set of execution scenarios. We show how proxy failure times can be simulated if external information about the user frequency of the test cases is available. We develop statistical inference procedures for fitting the Jelinski-Moranda model (Z. Jelinski and P. Moranda, 1996). In particular, we present a graphical diagnostic for testing goodness of fit and show how it suggests appropriate transformations of the failure times that would improve the fit. Influential observations are also identified by the diagnostic and moreover, it provides regression estimators of the model parameters as a quick alternative to the maximum likelihood estimators. Formulas for likelihood based confidence intervals for the model parameters are provided. The simulation of proxy failure times and the statistical inference procedures for the Jelinski-Moranda model are illustrated with an example.
Preserving the Value of Software - A CIO Perspective
Authors: Tama H. Olver
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

This paper outlines a management perspective of software quality based on a portfolio management approach. It outlines how an assessment of quality and strategic importance can be used to develop strategy for applications maintenance. 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
Processing Natural Language Software Requirement Specifications
Authors: Miles Osborne, C K. MacNish
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Ambiguity in requirement specifications causes numerous problems; for example in defining customer/supplier contracts, ensuring the integrity of safety-critical systems, and analysing the implications of system change requests. A direct appeal to formal specification has not solved these problems, partly because of the restrictiveness and lack of habitability of formal languages. An alternative approach, described in this paper, is to use natural language processing (NLP) techniques to aid the development of formal descriptions from requirements expressed in controlled natural language. While many problems in NLP remain unsolved, we show that suitable extensions to existing tools provide a useful platform for detecting and resolving ambiguities. Our system is demonstrated through a case-study on a simple requirements specification. Keywords: Natural Language Processing, Tool Support, Ambiguity Detection.
Cocoon 2 Programming: Web Publishing with Xml and Java, 1 edition
Authors: Bill B. Brogden, Mark Gaither, Conrad D'Cruz
Venue:  (2002)

:Thanks to the tireless efforts of open-source developers, Cocoon has quickly gained visibility as the preeminent XML-based Web publishing framework. Unfortunately, its documentation remains a significant shortcoming. If you're new to Cocoon, gaining a sense of exactly what you can do with it can be difficult, and actually getting started can be even harder. Cocoon 2 Programming: Web Publishing with XML and Java clearly explains the value of Cocoon and helps you build on your familiarity with XML and Java Servlets as you design, build, and implement a range of Cocoon applications. You'll begin by learning to control presentation for various platforms, both wired and wireless. Then you'll move on to Cocoon's capabilities for logic control and content management, using both sitemaps and XSP to create a site dynamically generated from a variety of data sources and types. As you'll see, Cocoon also supports powerful organizing techniques known as design patterns, and you'll master their use in both presentation and content generation. These are essential tools for the planning of your site; for after it's implemented, you'll command powerful techniques for site management and optimization. The Web's dependence on XML is growing rapidly-and with it the list of companies that have adopted Cocoon. Is Cocoon for you? Cocoon 2 Programming will guide you through your decision and far beyond, providing all the assistance you need to build a dynamic, XML-based site-and keep moving into the future. About the Authors Bill Brogden has been working with Java and writing books about Java since version 1.0. His most recent book is SOAP Programming with Java, also from Sybex. He lives with his wife and dogs in the woods outside Austin, Texas. Conrad D'Cruz has 14 years of Information Technology experience, including designing applications with Java and XML, and works as a senior applications engineer and web technologies instructor. When not in front of a computer, he is often behind the controls of an airplane, participating in search and rescue exercises with the Civil Air Patrol. Mark Gaither is a ten-year computer industry veteran who has built sophisticated web systems for the Texas Department of Commerce, TManage, Activerse, High End Systems, Instant Sports, and HTMLScript.
Clique-like Dominating Sets
Authors: Stephen Penrice
Venue:  (1995)

Continuing work by B\''{a}cso and Tuza and Cozzens and Kelleher, we investigate dominating sets which induce subgraphs with small clique covering number, or small independence number. We show that if a graph $G$ is connected and contains no induced subgraph isomorphic to $P_6$ or $H_t$ (the graph obtained by subdividing each edge of $K_{1,t}, t \geq 3$), then $G$ has a dominating set which induces a connected graph with clique covering number at most $t-1$. We then show that if $G$ has no isolated vertices and contains no induced subgraph isomorphic to $mK_2$, then $G$ contains a dominating set with independence number at most $2m-2$. For both of these results, the bounds are best possible. Finally, we prove a theorem which implies similar bounds for a variety of classes of graphs, and we show that if $G$ is connected and contains no induced subgraph isomorphic to $P_k$ or $H_t$, then the domination number of $G$ is bounded above by a constant that depends only on $k$, $t$, and the clique number of $G$.
The "Magic number 5": is it enough for web testing?
Authors: Carol M. Barnum
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Common practice holds that 80% of usability findings are discovered after five participants. Findings indicate that much larger numbers are required and that independent testers do not replicate results. This should stimulate interesting debate.
On Overlapping Partitions
Authors: Jérôme Galtier, Stéphane Lanteri
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Parallelization strategies based on domain partitioning techniques have been widely adopted for parallel finite element computations because of their suitability to distributed memory platforms. In most cases, this parallelization is based on non-overlapping partitions especially for Computational Structural Mechanics applications. However, finite volume (or mixed finite element/finite volume) discretization methods, which are frequently implemented in Computational Fluid Dynamics applications, generally require the use of overlapping mesh partitions to keep the parallelization work simple. Unfortunately, many tools on which the partitioning step relies give poor results when asked for overlapping partitions. In this paper, we describe an efficient method to transform a non-overlapping partition of a domain into an overlapping one. We also propose an optimization strategy for overlapping partitions that mainly aims at reducing the computational load unbalance as well as the size of the interfaces. The new algorithms demonstrate significant improvements as they are applied to generate overlapping partitions in the context of a parallel mixed finite element/finite volume three-dimensional flow solver.
Using the Rome Laboratory framework and implementation guidebook as the basis for an international software quality metric standard
Authors: G. E. Murine
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Rome Laboratory has been at the forefront of exploration and development techniques designed to improve software management with tools useful in improving the control and cost of software system development. The paper defines the software quality measurements problem, explores software quality measurement system implementation concerns, summarizes the evolution of software quality measurement as a enhancement to modern software development techniques, reviews current and past Rome Laboratory software quality measurement initiatives, outlines several case studies of Rome Laboratory Software Quality Framework applications during the past fifteen years, and provides a brief overview of the Rome Laboratory Framework implementation guidebook.
Computational Metatheory in Nuprl
Authors: Douglas J. Howe
Venue:  (1988)

This paper describes an implementation within Nuprl of mechanisms that support the use of Nuprl''s type theory as a language for constructing theorem-provind procedures. The main componenet of the implementation is a large library of definitions, theorems and proofs. This library may be regarded as the beginning of a book of formal mathematics; it contains the formal development and explanation of a useful subset of Nuprl''s metatheory, and of a mechanism for translating results established about this embedded metatheory to the object level. Nuprl''s rich type theory, besides permitting the internal development of this partial reflection mechanism, allows us to make abstractions that drastically reduce the burden of establishing the correctness of new theorem-proving procedures. Our library includes a formally verified term-rewriting system.
A Shared View of Sharing: The Treaty of Orlando
Authors: Lynn A Stein
Venue:  (1988)

For the past few years, researchers have been debating the relative merits of object-oriented programming languages (OOPLs) with classes and inheritance as opposed to those with prototypes and delegation. It has become clear that the OOPL design space is not a dichotomy. Instead, we have identified two fundamental mechanisms, templates and empathy, and several different independent degrees of freedom for each. Templates create new objects in their own image, providing guarantees about the similarity of group members. Empathy allows an object to act as if it were some other object, providing sharing of state and behavior. Smalltalk, Actors, Lieberman''s delegation system, Self, and Hybrid each take differing stands on the forms of templates and empathy. Some varieties of template and empathy mechanisms are appropriate for building well-understood programs that must be extremely reliable; others are better suited for rapidly prototyping solutions to difficult problems. The differences between languages designed for each of these application domains can be recast as the differences between support for anticipated vs. unanticipated sharing. One can even ascribe the ascent of object-oriented programming to its strong support for extension instead of modification. However, many kinds of extension still remain difficult. The decomposition of an object-oriented language into template and empathy mechanisms and the degree of support for extension provided by the forms of these mechanisms provide a solid framework for studying language design.
New Notions of Reduction and Non-Semantic Proofs of Beta-Strong Normalization in Typed Lambda-Calculi
Authors: A. J. Kfoury, J. B. Wells
Venue:  (1994)

Abstract Two new notions of reduction for terms of the lambda-calculus are introduced and the question of whether a lambda-term is beta-strongly normalizing is reduced to the question of whether a lambda-term is merely normalizing under one of the new notions of reduction. This leads to a new way to prove beta-strong normalization for typed lambda-calculi. Instead of the usual semantic proof style based on Girard''s ``candidats de r\''eductibilit\''e'''', termination can be proved using a decreasing metric over a well-founded ordering in a style more common in the field of term rewriting. This new proof method is applied to the simply-typed lambda-calculus and the system of intersection types.
The wearable remembrance agent: a system for augmented memory
Authors: Bradley J. Rhodes
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

MIT Media LabThis paper describes the wearable Remembrance Agent, a continuously running proactive memory aid that uses the physical context of a wearable computer to provide notes that might be relevant in that context. A currently running prototype is described, along with future directions for research inspired by using the pro totype.
Macromedia MX eLearning Advanced: Training from the Source
Authors: Jeffrey Bardzell
Venue:  (2002)

:UntitledWith International Data Corp. projecting e-learning to be an $11.5 billion industry by 2003, the demand for interactive multimedia learning applications is on the rise. And Macromedia's design toolsincluding Macromedia Flash MX and Macromedia Dreamweaverprovide the ideal solution. However, figuring out how best to combine these products to create the perfect digital active-learning applications for your purposes can be trickywhich is why you need Macromedia eLearning: Advanced Training from the Source.Using project-based lessons, e-learning specialist and veteran author Jeffrey Bardzell takes you through the paces of these solutions, demonstrating how you can use them to create e-learning applications for both academic and corporate environments. Moving at your own pace, you'll learn by doing through the tutorials and hands-on instructions that have become the hallmark of this popular series. By the time you reach the end of this volume, you will have built four e-learning projects: one in Dreamweaver, three in Flash, and one that combines the two products to create a dynamic, integrated solution. Whether you're a corporate or government trainer or an educator grappling with the challenges of distance learning, you'll find what you need to provide the training your people require in Macromedia eLearning: Advanced Training from the Source.