ppxscal/embedding_network huggingface dataset:
Application-Aware Adaptation for Mobile Computing
Authors: Mahadev Satyanarayanan, Brian Noble, Puneet Kumar, Morgan Price
Venue:  (1994)

This paper identifies application-aware adaptation as an essential capability of mobile clients, and provides an overview of Odyssey, an architecture that supports this capability. Functionality that has hitherto been implemented monolithically must now be split between the operating system and individual applications. The role of the operating system is to sense external events, and to monitor and allocate scarce resources. In contrast, the role of individual applications is to adapt to changing conditions by using the information and resources provided by the operating system.
A Stopping Criterion for Classical Iterative Methods in Inexact Affine-Invariant Newton Techniques
Authors: J P Lanzkron
Venue:  (1993)

We present a method for the computation of stopping criterion for linear classical iterations in inexact affine-invariant Newton techniques. We show that the same methodology does not hold for non-classical iterative methods.
A Globally Convergent Method for Nonlinear Programming
Authors: Shih Han
Venue:  (1975)

Recently developd Newton and quasi-Newton methods for nonlinear programming possess only local convergence properties. Adopting the concept of the damped Newton method in unconstrained optimization, we propose a stepsize procedure to maintain monotone decrease of an exact penalty function. In so doing, the convergence of the method is globalized. Keywords: nonlinear programming, global convergence, exact penalty function.
Agent-Oriented Programming of Manufacturing Control Tasks
Authors: Stefan Bussmann
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The success of agent-oriented concepts in various application domains, in particular in manufacturing control, creates the need for an agent-oriented analysis, design, and programming methodology. This paper presents a programming method that covers one step of the necessary methodology. Given a specification of the tasks to be performed, the method allows to program the corresponding agent in three steps: (i) programming of the individual tasks; (ii) synchronization of tasks to avoid concurrency problems; and (iii) specification of script execution on a single processor machine. The programming method was specifically designed for implementing manufacturing control agents and complies with the industrial requirements stated in this paper.
Cone Trees in the UGA Graphics System: Suggestions for a More Robust Visualization Tool
Authors: Oren J. Tversky, Scott S. Snibbe, Robert Zeleznik
Venue:  (1993)

The Xerox PARC cone tree is an efficient, practical tool for visualizing hierarchical information. It makes use of three-dimensional space to display more information than is possible in two dimensions. It employs animation and interactive selection to create a focal point on the structure. Shadows and perspective serve to enhance the effect. In this paper, we describe an implementation of cone trees under the UGA graphics architecture. The implementation is in the FLESH language -- an object-oriented graphics language that is the core of the UGA system. The FLESH language allows for rapid prototyping of three-dimensional widgets such as this. In addition to the rapid implementation, several extensions of the vanilla Xerox trees were implemented. A critique of the cone tree is offered, as well as suggestions for future direction of visualization of hierarchical data sets.
Evaluation of m-Valued Fixed Polarity Generalizations of Reed-Muller Canonical Form
Authors: Elena Dubrova
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper compares the complexity of three different fixed polarity generalizations of Reed-Muller canonical form to multiple-valued logic: the Galois Field-based expansion introduced by Green and Taylor, the Reed-Muller-Fourier form of Stankovic and Moraga, and the expansion over addition modulo m, minimum and the set of all literal operators introduced by the author and Muzio. An algorithm for computing the minimal canonical forms for these generalizations is implemented and applied to a set of encoded 4-valued benchmark functions, 3- and 4-valued adders and multipliers. The experimental results show that, for the benchmark functions, the Reed-Muller-Fourier form and our expansion yield a comparable number of products on average. They have 40% less products on average than the expansion of Green and Taylor. The Reed-Muller-Fourier form gives a compact representation for adders, while our expansion seems to be suitable for multipliers.
Principals in Programming Languages: Technical Results
Authors: Steve Zdancewic, Dan Grossman
Venue:  (1999)

This is the companion technical report for ``Principals in Programming Languages'''' [20]. See that document for a more readable version of these results. In this paper, we describe two variants of the simply typed $\lambda$-calculus extended with a notion of {\em principal}. The results are languages in which intuitive statements like ``the client must call $\mathtt{open}$ to obtain a file handle'''' can be phrased and proven formally. The first language is a two-agent calculus with references and recursive types, while the second language explores the possibility of multiple agents with varying amounts of type information. We use these calculi to give syntactic proofs of some type abstraction results that traditionally require semantic arguments.
Effective ahead pipelining of instruction block address generation
Authors: André Seznec, Antony Fraboulet
Venue: ACM SIGARCH Computer Architecture News (2003)

On a N-way issue superscalar processor, the front end instruction fetch engine must deliver instructions to the execution core at a sustained rate higher than N instructions per cycle. This means that the instruction address generator/predictor (IAG) has to predict the instruction flow at an even higher rate while the prediction accuracy can not be sacrificed.Achieving high accuracy on this prediction becomes more and more critical since the overall pipeline is becoming deeper and deeper with each new generation of processors. Then very complex IAGs featuring different predictors for jumps, returns, conditional and unconditional branches and complex logic are used. Usually, the IAG uses information (branch histories, fetch addresses, . . . ) available at a cycle to predict the next fetch address(es). Unfortunately, a complex IAG cannot deliver a prediction within a short cycle. Therefore, processors rely on a hierarchy of IAGs with increasing accuracies but also increasing latencies: the accurate but slow IAG is used to correct the fast, but less accurate IAG. A significant part of the potential instruction bandwidth is often wasted in pipeline bubbles due to these corrections.As an alternative to the use of a hierarchy of IAGs, it is possible to initiate the instruction address generation several cycles ahead of its use. In this paper, we explore in details such an ahead pipelined IAG. The example illustrated in this paper shows that, even when the instruction address generation is (partially) initiated five cycles ahead of its use, it is possible to reach approximately the same prediction accuracy as the one of a conventional one-block ahead complex IAG. The solution presented in this paper allows to deliver a sustained address generation rate close to one instruction block per cycle with state-of-the art accuracy.
Validating Component Compositions in Software System Generators
Authors: Don Batory, Bart J. Geraci
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Generators synthesize software systems by composing components from reuse libraries. In general, not all syntactically correct compositions are semantically correct. In this paper, we present domain-independent algorithms for the GenVoca model of software generators to validate component compositions. Our work relies on attribute grammars and offers powerful debugging capabilities with explanation-based error reporting. We illustrate our approach by showing how compositions are debugged by a GenVoca generator for container data structures.
A Schema-Based Approach to Teaching Recursive Prolog Programming
Authors: S T Gegg-Harrison
Venue:  (1990)

A schema-based instructional approach is proposed as a method of introducing recursion to novice Prolog programmers. Using a set of basic level Prolog schemata as the basic constructs of a structured Prolog for recursive list processing, {\em schema-based instruction} emphasizes the learning of general programming techniques. This instructional approach also provides an ideal framework for implementing a guided problem solving paradigm in which the tutor offers ``hints'''' which enable the student to solve problems that she would be unable to solve unassisted. In addition to facilitating the introduction of new programming concepts, the implementation of guided problem solving within the schema-based instructional setting enables a tutor to highlight its student''s capabilities allowing it to tailor its instruction to the level of its students. 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
Motivated Action Theory: A Formal Theory of Causal Reasoning
Authors: Lynn A Stein, Leora Morgenstern
Venue:  (1989)

This paper presents a theory of generalized temporal reasoning. We focus on the related problems of: \begin{itemize} \item Temporal projection --- determining all the facts true in a chronicle, given a partial description of that chronicle, and \item Explanation --- figuring out what went wrong if an unexpected outcome occurs. \end{itemize} We present a nonmonotonic temporal logic based on the notion that actions only happen if they are motivated. We demonstrate that this theory handles generalized temporal projection correctly, and in particular, solves the Yale shooting problem and a related class of problems. We then show how our model lends itself to a very natural characterization of the concept of an adequate explanation for an unexpected outcome.
STS: A structural theory of sets
Authors: Alexandru Baltag
Venue:  (1998)

We explore a non-classical, universal set theory, based on a purely ``structural'''' conception of sets. A set is a transfinite process of unfolding of an arbitrary (possibly large) binary structure, with identity of sets given by the observational equivalence between such processes. We formalize these notions using infinitary modal logic, which provides partial descriptions for set structures up to observational equivalence. We describe the comprehension and topological properties of the resulting set-theory, and we use it to give non-classical solutions to classical paradoxes, to prove fixed-point theorems that relate recursion and corecursion, to formalize ``super-large'''', reflexive categories and ``super-large'''' circular models, and to provide ``natural'''' solutions for domain equations. 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
MPEG-4 Facial Animation: The Standard, Implementation and Applications
Authors: Igor S. Pandzic, Robert Forchheimer
Venue:  (2003)

:This book concentrates on the animation of faces. The Editors put the MPEG-4 FA standard against the historical background of research on facial animation and model-based coding, and provide a brief history of the development of the standard itself. In part 2 there is a comprehensive overview of the FA specification with the goal of helping the reader understand how the standard really works. Part 3, forms the bulk of the book and covers the implementations of the standard on both encoding and decoding side. Several face animation techniques for MPEG-4 FA decoders are presented. While the standard itself actually specifies only the decoder, for applications it is interesting to look at the wide range of technologies for producing and encoding the FA contents. These include video analysis, speech analysis and synthesis, as well as keyframe animation. The last part of the book provides several examples of applications using the MPEG-4 FA standard. It will be useful for companies implementing products and services related to the new standard, researchers in several domains related to facial animation, as well as wider technical audience interested in new technologies and applications.· The main people involved in the standardization process are contributors to the book Provides several examples of applications using the MPEG-4 Facial Animation standard, including video and speech analysis This will become THE reference for the MPEG-4 Facial Animation Aids the understanding of the reasoning behind the standard specification, how it works and what the potential applications are Gives an overview of the technologies directly related to the standard and its implementation Essential reading for the Industry and research community especially engineers, researchers and developers.
Beyond Software, Beyond Engineering
Authors: Laszlo A. (Les) Belady
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

The evolution from coding to engineered software is reviewed, The most rapidly growing area today is real-time and embedded applications. Here software is the glue holding the pieces together but the pieces are often electro-mechanical devices. This calls for the tightcooperation of engineers of virtually all disciplines.Large and networked application systems cannot be designed and installed without domain knowledge that is often beyond engineering expertise. And in the case of small companies general business background is needed. Finally, suggestions are presented to align education with the above requirements.
Burst scheduling: architecture and algorithm for switching packet video
Authors: S. S. Lam, G. G. Xie
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The authors observed that variable bit rate (VBR) video, which is a sequence of encoded pictures, has very large rate fluctuations from picture to picture. In designing a new traffic model, the authors retain the basic notion of a flow but allow the flow rate to fluctuate. In particular, they introduce the concept of a burst which, in a video flow, is a sequence of packets that carry the bits of an encoded picture. They present the architecture of a class of packet switching networks, called burst scheduling networks, for carrying video, audio, and data traffic. The class is characterized by (i) use of virtual clock value as priority in scheduling, (ii) end-to-end delay and delay jitter guarantees provided to flows conforming to the new traffic model, and (iii) traffic flows (in particular, video flows) scheduled efficiently in bursts. Some experimental results are presented from a discrete-event simulation in which traces from several MPEG video sequences were used as video sources.
Secret-key certificates (Continued)
Authors: Stefan A. Brands
Venue:  (1995)

A new construction is described for designing secret-key certificate schemes based on signature schemes other than of the Fiat-Shamir type. Also described are practical secret-key certificate issuing protocols that enable the Certification Authority to certify public keys, without being able to compromise the confidentiality of the corresponding secret keys. Furthermore the design of secure showing protocols is discussed, exemplified by secret-key certificate schemes based on Fiat-Shamir type signature schemes.
A neural network to estimate concrete strength based on non-destructive test results
Authors: S. A. Mourad, A. W. Sadek, A. A. El-Fayoumy
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

A neural network model was established to estimate the compressive strength of concrete by using the combination of two of the most widely used Non-Destructive Tests (NDT); rebound number and pulse velocity tests. This technique is utilized in an attempt to increase the reliability of the non-destructive tests in detecting the strength of concrete. The network was trained using a set of readings for pulse velocity, rebound hammer readings and cube strength. The input and output parameters for training were taken from different mixes and at different ages to make sure that the applicability of the chosen neural network is not limited to a specific mix or age of concrete. Different network topologies were tried by changing the number of hidden layers and nodes in each layer in order to select the best network configuration. The most suitable network configuration was judged based on the root mean square error for both training and testing.
Sparse Jacobian Estimation and Factorization on a Multiprocessor
Authors: Paul E. Plassmann
Venue:  (1990)

In this talk, we present algorithms and experimental results for the estimation and QR factorization of large, sparse Jacobians on a message-passing multiprocessor. The gist of this work is the development of paradigms for the efficient solution of the "inner loop" of a nonlinear optimization algorithm: the estimation of the Jacobian, its factorization, and the solution of the resulting trust-region problem. A parallel sparse QR factorization based on the global row reduction algorithm is introduced. We emphasize the commonality between row partitions that allow for the efficient parallel factorization of the Jacobian and its estimation. We also note that the interprocessor communication structure constructed for the QR factorization can also be used to solve an associated trust-region problem. Finally, experimental results obtained on the Intel iPSC/2 are presented.
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Authors: Eamonn Keogh, Shruti Kasetty
Venue: Data Mining and Knowledge Discovery (2003)

In the last decade there has been an explosion of interest in mining time series data. Literally hundreds of papers have introduced new algorithms to index, classify, cluster and segment time series. In this work we make the following claim. Much of this work has very little utility because the contribution made (speed in the case of indexing, accuracy in the case of classification and clustering, model accuracy in the case of segmentation) offer an amount of &ldquo;improvement&rdquo; that would have been completely dwarfed by the variance that would have been observed by testing on many real world datasets, or the variance that would have been observed by changing minor (unstated) implementation details.To illustrate our point, we have undertaken the most exhaustive set of time series experiments ever attempted, re-implementing the contribution of more than two dozen papers, and testing them on 50 real world, highly diverse datasets. Our empirical results strongly support our assertion, and suggest the need for a set of time series benchmarks and more careful empirical evaluation in the data mining community.
Hybrid Analysis of SGSPNs with Time-Dependent Transition Rates
Authors: Peter Buchholz
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

For the class Superposed Generalized Stochastic Petri Nets (SGSPNs) we present a new analysis algorithm which combines the ideas of transient numerical analysis via uniformization and discrete event simulation. Simulation is used to determine the firing times of synchronized transitions describing interactions between the components of a SGSPN. Numerical analysis is used to compute the distribution of states between firing times of synchronized transitions.The approach avoids handling vectors of the size of the state space and can therefore be used for models with a huge state space, which cannot be analyzed with numerical analysis techniques. On the other hand, the approach allows the computation of reliable estimates for results based on small probabilities or rare events, which cannot b e analyzed with simulation. As a byproduct of the handling of synchronized transitions using simulation, it is possible to extend the class of SGSPNs by allowing synchronized transitions with time dependent transition rates.
Extensible High-Performance Support for Persistence
Authors: David E. Langworthy
Venue:  (1993)

In the late ''80s, new applications such as CAD, hypermedia, and programming environments stressed to the limit existing database technology. To meet the demands of these new domains OODBs were developed. There was, and still is a great diversity in their architecture and functionality. Furthermore, this functionality continues to evolve. However, early on one common feature emerged and that is they all used some distinct service that provided stable storage for objects or pages, referred to as object servers and page servers respectively. This paper describes problems facing the continued development of object stores and addresses them in the design of ObServer2. The design takes a new approach to the construction of an object server that allows it to meet changing needs. Also, it presents original contributions in the design of concurrency control and recovery algorithms.
Gardens: High Performance Objects, Tasking and Migration for Cluster Computing
Authors: P. Roe, C. Szyperski
Venue:  (1997)

Gardens is an integrated programming language and system which supports efficient parallel computation across workstation clusters. In particular it addresses the three goals of: high performance, adaptive parallelism and abstraction. High performance is the goal of parallel computing, and abstraction simplifies programming. Adaptive parallelism entails a program adapting during its execution to utilise a changing set of otherwise idle workstations. Tasks are used as units of work, and task migration to realise adaptive parallelism. Tasking is non-preemptive; compared to preemptive tasking this leads to simpler programming and greater efficiency. Global objects are used for inter-task communication. These support abstraction and importantly directly map to active messages: a very efficient messaging system. These features of Gardens are tightly integrated yet orthogonal.
Communication Mechanism of Loose Coupled Agents in FAMES
Authors: Gen Kitagata, Jiro Sekiba, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

The present day asynchronous messaging systems (e-mail systems etc) lack lots of advanced features e.g. intelligence, controllability, scalability etc to accomplish an effective and sophisticated message handling. To supplement these features, we have proposed a Flexible Asynchronous Messaging System (FAMES). In this paper, we focus on the Communication Mechanism of Loose Coupled Agents in FAMES. The mechanism allows the flow control agents to do cooperative work without tight dependency. We show how the loose-coupled flow control agents cooperate via a black board. A prototype of the system is implemented and the proposed functionalities are verified.