ppxscal/embedding_network huggingface dataset:
Network quality of service for multimedia presentation generation systems
Authors: F. J. Cornelissen
Venue:  (2001)

Quality of Service (QoS) protocols and architectures play an important role in distributed multimedia systems since multimedia presentations need to be played for the user without stalls, necessitating guaranteed response times. However in the Internet no other QoS than best--effort is given. This report investigates some QoS architectures and protocols designed to overcome these limitations and looks at the applications of these protocols for multimedia systems. Given the recent research on (semi--)automatically generated multimedia presentations, this report investigates the opportunities to gear the generated multimedia presentations toward the specific network conditions of the client requesting a document, and dynamically adapting the presentation as network conditions change.
Markov chain conditions for admissibility in estimation problems with quadratic loss
Authors: Morris L. Eaton
Venue:  (1999)

Consider the problem of estimating a parametric function when the loss is quadratic. Given an improper prior distribution, there is a formal Bayes estimator for the parametric function. Associated with the estimation problem and the improper prior is a symmetric Markov chain. It is shown that if the Markov chain is recurrent, then the formal Bayes estimator is admissible. This result is used to provide a new proof of the admissibility of Pitman''s estimator of a location parameter in one and two dimensions.
Duration Properties over Real Time System Designs
Authors: Victor Braberman, Fabio Pieniazek
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

Constraints on the accumulated sojourn time at particular system states are among the possible requirements for a real-time system. These requirements are called duration properties. The need to predict temporal behavior of critical real-time systems has encouraged the development of a useful collection of results for run-time scheduling as well as an interesting set of formal automatic techniques based on model-checking. However, no automatic technique directly supports the verification of duration requirements over physical designs of real-time software. In [6] it is presented an approach that applies known scheduling theory to automatically derive simple and compositional formal models based on timed automata [1]. In this article, we combine that modeling method with a conservative algorithm that extends [5] to check duration properties over the resulting timed automata.
Comparing On-Line Recognition of Japanese and Western Script in Preparation for Recognizing Multi-Language Documents
Authors: S. Jaeger, M. Nakagawa, C.-L. Liu
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Recognizers supporting multiple languages and writing systems are becoming increasingly important due to the international success of pen-based systems. The main intention of this paper is to improve our understanding of the differences and similarities between Japanese and western handwriting recognition. Knowing the common techniques is important for developing compact and powerful multi-language recognizers with integrated modules for both writing systems. In particular, the simultaneous recognition of western and Japanese handwriting in multi-language documents requires methods suitable for both writing systems.Though the Japanese and western writing systems are completely different, we present many similar recognition techniques facilitating an integration of processing steps.
Experience with a Reverse Engineering Architecture Approach to Increase Understanding
Authors: A. von Mayrhauser, J. Wang, Q. Li
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Reverse architecting code has been advocated to identify the current software architecture of existing software, to assess its quality, and to determine areas of improvement. At its most basic level, reverse architecting provides a way to determine what the current architecture is. We were interested in identifying the current architecture of an existing system , because it might aid in comprehension, particularly when existing architectural descriptions are outdated. To this end, we applied a known technique to a midsize system, and evaluated the practicality of the technique.
A Minimal GB Parser
Authors: Marwan Shaban
Venue:  (1993)

Abstract We describe a GB parser implemented along the lines of those written by Fong [Fong91] and Dorr [Dorr87]. The phrase structure recovery component is an implementation of Tomita''s generalized LR parsing algorithm (described in [Tomi86]), with recursive control flow (similar to Fong''s implementation). The major principles implemented are government, binding, bounding, trace theory, case theory, theta-theory, and barriers. The particular version of GB theory we use is that described by Haegeman [Haeg91]. The parser is minimal in the sense that it implements the major principles needed in a GB parser, and has fairly good coverage of linguistically interesting portions of the English language. 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
Assessing the Benefits of Incorporating Function Clone Detection in a Development Process
Authors: Bruno Lague, Daniel Proulx, Jean Mayrand, Ettore M. Merlo, John Hudepohl
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The objective of the experiment presented in this paper is to bring insights in the evaluation of the potential benefits of introducing a function clone detection technology in an industrial software development process. To take advantage of function clone detection, two modifications to the software development process are presented. Our experiment consists in evaluating the impact that these proposed changes would have had on a specific software system if they had been applied over a 3 year period (involving 10 000 person-months), where 6 subsequent versions of the software under study were released. The system under study is a large telecommunication software. In total, 89 millions lines of code have been analyzed. A first result showed that, against our expectations, a significant number of clones is being removed from the system over time. However, this effort is insufficient to prevent the growth of the overall number of clones in the system. In this context the first process change would have add value. We have also found that the second process change would have provided programmers with a significant number of opportunities for correcting problems before customers experienced them. This result shows a potential for improving the software system quality and customer satisfaction.
Integrated Natural Language Generation Systems
Authors: Mark Kantrowitz, Joseph Bates
Venue:  (1992)

Many existing natural language generation systems can be characterized according to their modularization as either pipelined or interleaved. In these separated systems, the generator is divided into several modules (e.g., planning and realization), with control and information passing between the modules during the generation process. This paper proposes a third type of generator, which we call integrated, that unifies the modules into a single mechanism. The mechanism uses a small set of orthogonal basic operations to produce planned and grammatical language output. Integrated systems are conceptually attractive and may support generation of pragmatic effects more effectively than other systems. After discussing the advantages of the integrated approach, we summarize GLINDA, an integrated generator currently under development at Carnegie Mellon. GLINDA is the generator used for narration and intercharacter communication in the Oz Interactive Fiction and Virtual Reality Project.
Representations of Logic Functions Using QRMDDs
Authors: Shinobu Nagayama, Tsutomu Sasao, Yukihiro Iguchi, Munehiro Matsuura
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

This paper considers quasi-reduced multi-valued decisiondiagrams with k bits (QRMDD(k)s) to represent two-valuedlogic functions. It shows relations between the numbersof nodes in QRMDD(k)s and values of k for benchmarkfunctions; an upper bound on the number of nodes in theQRMDD(k); difference between the upper bound and thenumber of nodes in the QRMDD(k)s for random functions;and the amount of total memory, evaluation time, and area-timecomplexity for QRMDD(k)s. Experimental results usingstandard benchmark functions show that the area-timecomplexity takes its minimum when k is between 3 and 6.
Managing interaction between users and agents in a multi-agent storytelling environment
Authors: Mark Riedl, C. J. Saretto, R. Michael Young
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes an approach for managing the interaction of human users with computer-controlled agents in an interactive narrative-oriented virtual environment. In these kinds of systems, the freedom of the user to perform whatever action she desires must be balanced with the preservation of the storyline used to control the system's characters. We describe a technique, narrative mediation, that exploits a plan-based model of narrative structure to manage and respond to users' actions inside a virtual world. We define two general classes of response to situations where users execute actions that interfere with story structure: accommodation and intervention. Finally, we specify an architecture that uses these definitions to monitor and automatically characterize user actions, and to compute and implement responses to unanticipated activity. The approach effectively integrates user action and system response into the unfolding narrative, providing for the balance between a user's sense of control within the story world and the user's sense of coherence of the overall narrative.
Bigelow's PC Hardware Desk Reference, 2 edition
Authors: Stephen Bigelow
Venue:  (2002)

:Get the answers you need from the source himself! Experienced electronics engineer and PC guru Stephen Bigelow has written a comprehensive guide that gets to the nitty-gritty of inside-the-box technician's issues. So, get briefed and get to work!
Index Structures of User Profiles for Efficient Web Page Filtering Services
Authors: Yi-Hung Wu, Arbee L. P. Chen
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Searching information from the WWW efficiently and effectively has become a very important issue. In this paper, we apply the information-filtering concept to finding good matches of web pages for what the users need. Furthermore, we propose four new methods for indexing the users' information needs and show their efficiency in comparison with two well-known approaches.
Towards Programming by Examples and Properties
Authors: Pierre Flenner
Venue:  (1991)

\indent We define a new approach to automatic programming, and express it in the terminology of a non-traditional viewpoint on automatic programming, namely as the ``programming by examples and properties'''' paradigm. The main result of this report is the design of a compiler mechanism synthesizing logic programs from examples and properties, and the statement of soundness results around this mechanism. 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
Everquest Adventures Online
Authors: Prima Games, David Cassady, Scruffy Productions
Venue:  (2003)

:Return to a Time in Norrath's Past ·Critical stats for all 10 races and all 13 classes ·Crucial strategies for all beginning quests on a class-by-class basis—from Barbarian to Troll ·Detailed lists of all abilities up to level 20 ·Essential maps of every beginning area ·Exhaustive tactics for creating a winning characterAuthor Biography:
Separable Asymptotic Cost of Evaluating Elementary Functions
Authors: Paola Favati, G. Lotti, Ornella Menchi, Francesco Romani
Venue:  (1996)

The asymptotic computational cost of evaluating a real function $f(x)$ in a point $x$, in the bit model of computation, is analyzed, with $x$ varying in an interval containing also critical points for the function $f$. We find an upper bound to the cost as a function of two variables: the number $d$ of correct digits in the result and the point $x$. More precisely we study a class of algorithms for which it is possible to give upper bounds on the cost as functions of ''separated variables'' $d$ and $x$, that is as products of two functions, each of one variable. We find conditions under which elementary functions can be computed through algorithms belonging to this class. TEL:: 050593448 EMAIL:: favati@imc.pi.cnr.it
Adobe Illustrator 10 Virtual Classroom
Authors: David Karlins
Venue:  (2002)

:Experience the ultimate in multimedia learning with this interactive resource. Text and an engaging video tutorial combine to create a unique and fun environment that teaches you how to use this remarkable Web and graphics program.
An information-theoretic measure for document similarity
Authors: Javed A. Aslam, Meredith Frost
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Recent work has demonstrated that the assessment of pairwise object similarity can be approached in an axiomatic manner using information theory. We extend this concept specifically to document similarity and test the effectiveness of an information-theoretic measure for pairwise document similarity. We adapt query retrieval to rate the quality of document similarity measures and demonstrate that our proposed information-theoretic measure for document similarity yields statistically significant improvements over other popular measures of similarity.
LBF: A Performance Metric for Program Reorganization
Authors: Hyeonsang Eom, Jeffrey K. Hollingsworth
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs.
On the Structures of Weak Interlaced Bilattice
Authors: Michiro Kondo
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

We study fundamental properties of weak interlacedbilattices and show that for any weak interlaced bilatticeW there exists a lattice L such that W can be embeddedinto a typical weak interlaced bilattice K (L ).
Multiple-Valued Minimization to Optimize PLAs with Output EXOR Gates
Authors: Debatosh Debnath, Tsutomu Sasao
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper considers an optimization method of programmable logic arrays (PLAs), which have two-input EXOR gate at the outputs. The PLA realizes an EXOR of two sum-of-products expressions (EX-SOP) for multiple-valued input two-valued output functions. We present techniques to minimize EX-SOPs, which is an extension of Dubrova-Miller-Muzio's AOXMIN algorithm. We conjecture that, when n is sufficiently large, an EX-SOP for n-bit adder requires at most 2**n products while an ordinary sum-of-products expression (SOP) requires 6(2**n)-4n-5 products. Experimental results for two- and four-valued benchmark functions show that the proposed method produces better EX-SOPs than existing methods.
On the Matrix Polynomial, Lamda-Matrix and Block Eigenvalue Problems
Authors: John E. Dennis,  Jr., J. F. Traub, R. P. Weber
Venue:  (1971)

A matrix $S$ is a solvent of the matrix polynomial $M(X) \equiv X^{m} + A_{1}X^{m-1} + \cdots + A_{m}$, if $M(S) = \stackrel{0}{=}$, where $A_{1}, X$ and $S$ are square matrices. We present some new mathematical results for matrix polynomials, as well as a globally convergent algorithm for calculating such solvents. In the theoretical part of this paper, existence theorems for solvents, a generalized division, interpolation, a block Vandermonde, and a generalized Lagrangian basis are studied. Algorithms are presented which generalize Traub''s scalar polynomial methods, Bernoulli''s method, and eigenvector powering. The related lambda-matrix problem, that of finding a scalar $\lambda$ such that $I \lambda^{m} + A_{1} \lambda^{m-1} + \cdots + A_{m}$ is singular, is examined along with the matrix polynomial problem. The matrix polynomial problem can be cast into a block eigenvalue formulation as follows. Given a matrix $A$ of order mn, find a matrix $X$ of order n, such that $AV=VX$, where $V$ is a matrix of full rank. Some of the implications of this new block eigenvalue formulation are considered.
Elimination Ordering Characterizations of Digraphs with Interval and Chordal Competition Graphs
Authors: J. R Lundgren, Sarah K. Merz
Venue:  (1995)

Competition graphs have appeared in a variety of applications from food webs to communication networks to energy models. The competition graph, C(D), of a digraph D has the same vertex set as D and (x,y) is an edge in C(D) if and only if there is a vertex z such that (x,y) and (y,z) are arcs in D. It has been observed that most actual food webs have interval competition graphs. Subsequent research investigation this phenomenon led to the problem of characterizing acyclic digraphs which have interval competition graphs since food web models are generally acyclic. This evolved into the problem of characterizing digraphs with interval or chordal competition graphs. The problem is difficult because forbidden subgraph characterizations generally don''t work. Here we use an elimination ordering approach which leads to useful characterizations which can be generalized to determine which graphs have interval or chordal squares or two-step graphs.
A Logic Programming Approach to Manipulating Formulas and Programs
Authors: Dale Miller, Gopalan Nadathur
Venue:  (1987)

By permitting function and predicate symbols to be variables and by replacing first-order terms by simply typed $lambda$-terms, a higher-order extension to first-order Horn clauses can be described. To be complete in principle, a logic programming language based on this extension must incorporate higher-order unification. Although this is a more complex operation than first-order unification, its availability as a primitive makes certain kinds of programming tasks easier. We illustrate this aspect in the paper by presenting some programs in a higher-order version of Prolog called $\lambda$Prolog that manipulate objects, such as formulas and programs, whose representation requires structures containing abstractions or bound variables. Specifically, we show (a) how a simple natural deduction theorem prover may be implemented in $\lambda$Prolog, and (b) how some simple program transformers for a functional programming language may be written in this language. These programs exploit the availability of $\lambda$-conversion and higher-order unification in $\lambda$Prolog to provide elegant solutions to several awkward problems inherent in these tasks. We contend that programs which perform similar tasks but which are written in languages without these features would, at least, be much less perspicuous.
Designing Social Cognition Models for Multi-Agent Systems through Simulating Primate Societies
Authors: Sebastien Picault, Anne Collinot
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

In this paper, we discuss the advantages of investigating primate societies to build Multi-Agent Systems, and we present our preliminary results in this context. We first give an overview of primates' social competences, then we draw a parallel between the main problems found in the study of primate societies (regarding their social organization) and some of the most commonly encountered issues when designing Multi-Agent Systems. We describe a model of social cognition and perception that we have experimented. Its results show that some social concepts can be implemented by attaching importance to the interactions between the agents, instead of using a complicated individual-based model. Finally, we discuss the main extensions we are working on and propose applications to Multi-Agent technology.
Modelling the Runtime of Scientific Programs on Parallel Computers
Authors: Thomas Rauber, Gudula Rünger
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Message-passing programs for parallel machines with a distributed address space using communication operations of portable communication libraries such as PVM and MPI guarantee portability for most of the parallel machines available. However, due to specific implementations of the run-time libraries on each specific platforms, the same program may have different runtimes on different machines, i.e., the efficiency is often not portable. Quantitative results about the runtimes of collective communication operations on specific parallel machines can therefore be helpful. We show that the execution time of collective communication operations can be modelled by runtime functions in closed form. As example, we consider the Cray T3D and T3E machines. We demonstrate that the runtime functions can be used to model the computation and communication behavior of complete programs by investigating the parallel implementation of a solution method for ordinary differential equations. As application, we consider the use of this method for solving a time-dependent reaction-diffusion equation.