ppxscal/embedding_network huggingface dataset:
A Web-based animator for validating object specifications
Authors: M. Richters, M. Gogolla
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

One of the central tasks in developing information systems is the specification of desired system properties. We use the object specification language TROLL light to formalize the conceptual model of a system. A TROLL light specification describes structural as well as dynamic characteristics of objects representing real world entities. For validating specifications, we have developed an animation tool, allowing us to reflect structural properties and dynamic behaviour. The main concepts of the animator are illustrated by a working example. We present a simple specification of a car rental company and describe some of the steps performed during a typical animation session. The animation allows us to check whether desired properties are fulfilled by the given object descriptions. Finally, some design and implementation issues regarding the utilized persistent programming environment and the Web based user interface are discussed.
An Extensible Object Model for QoS Specification in Adaptive QoS Systems
Authors: Yasunori Matsui, Seiji Kihara, Atsushi Mitsuzawa, Satoshi Moriai, Hideyuki Tokuda
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Adaptive QoS systems are attractive for multimedia services that are accessed via the Internet or mobile computers. An important feature of an adaptive QoS system is that it allows application programs to specify the QoS level desired, and at the system to set the level according to the resources available. With an adaptive QoS system, the user should specify not only the target QoS, but also a QoS range to minimize the quality degradation resulting from resource shortages.This paper introduces QoSPath as an extensible object model for specifying, translating, and arbitrating QoS in adaptive QoS systems. The QoSPath model herein lets users and application programs specify their QoS preference by setting QoSPoints in a QoSPath, each of which specifies an objective QoS level against a subjective utility value.With the QoSPath model, a simple QoS preference can be specified by a few parameters, while more detailed specifications can be given by providing more information, thus the model offers both the simple and descriptive QoS specifications. It is designed to be flexible in that new QoS formats and translation modules can be easily defined with only a minimum knowledge of other parts of a system. It therefore separates the functions of QoS specification, translation/inverse-translation and arbitration.
Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design
Authors: Martin L. Shooman
Venue:  (2002)

:With computers becoming embedded as controllers in everything from network servers to the routing of subway schedules to NASA missions, there is a critical need to ensure that systems continue to function even when a component fails. In this book, bestselling author Martin Shooman draws on his expertise in reliability engineering and software engineering to provide a complete and authoritative look at fault tolerant computing. He clearly explains all fundamentals, including how to use redundant elements in system design to ensure the reliability of computer systems and networks.Market: Systems and Networking Engineers, Computer Programmers, IT Professionals.
Animating with Flash MX: Professional Creative Animation Techniques, 1 edition
Authors: Alex Michael
Venue:  (2002)

:If you are a professional animator and want to learn to use the Flash environment as a vehicle for your creative work then this is the book for you. It gets you up to speed fast with the basics of how to use Flash MX to animate, so you can start concentrating on how best to translate your animation skills to this medium. If you are a professional animator and want to learn to use the Flash environment as a vehicle for your creative work then this is the book for you. It gets you up to speed fast with the basics of how to use Flash MX to animate, so you can start concentrating on how best to translate your animation skills to this medium.The techniques shown throughout the book build up in skill level quickly, showing you clearly and concisely the most effective way to translate your animations into Flash with the focus remaining on the importance of creative animation techniques.Benefit from Sprite Interactive?s wealth of tips and tricks from their wide range of professional Flash animation work and successful training courses. Learn how to apply these techniques to your own work, how to make your characters run in Flash, speed them up and slow them down, make them stumble as they walk, show their anger or fear, make them come to life.Alex Michael, Lead Animator and MD of Sprite Interactive (www.sprite.net), shows you how to achieve all the creative skills of traditional animation using Flash so you can create work for a wide variety of new and innovative platforms, including PocketPCs and interactive TV, as well as video and the web. The free CD includes all the files you need to try everything in the book for yourself, as well as invaluable time and money saving animation processes and tools. Make sure you are at the cutting edge of animation and push your creative skills to the edge, if you want to animate successfully in Flash, buy this book.* Learn how to do professional Flash animation with this comprehensive guide, written for the creative, not the programmer!* Stay ahead from the rest with a professional developer?s coverage of dynamic animation, Interactive TV and the PocketPC environment.* Use the free CD to try out everything covered in the book yourself, the quickest way to learn.
Teach Yourself Excel 2002, 2 edition
Authors: Moira Stephen
Venue:  (2003)

:Excel 2002, the Microsoft Office spreadsheet package, is essential to every business environment. Teach Yourself Excel 2002 has an easy-to-follow approach to the program's practical applications, shows how to design and build efficient worksheets, and includes many timesaving shortcuts. With numerous illustrations showing what to expect on screen, it is the perfect guidebook for new users. 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
Hierarchical Supervisors For Automatic Detection Of Software Failures
Authors: T. Savor, R. E. Seviora
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Software supervision is an approach to the automatic detection of software failures. A supervisor observes the inputs and outputs of a target system. It uses a model of correct behavior, derived from the target system's requirement specification. Discrepancies between specified and observed behaviors are reported as failures. Applications of the supervisor include online failure detection in real time reactive systems, fault localization and automatic collection of failure data. The paper describes a hierarchical approach to supervision. The approach differs from previous approaches in that supervision is split into two sub problems: tracking the behavior of the target system and detailed behavior checking. The architecture of the hierarchical supervisor has two layers: the path detection layer and the base supervisor layer. The hierarchical approach results in a significant reduction in computational cost arising from specification nondeterminism. The approach was evaluated by supervising the call processing software of a small telephone exchange, executed under random telephone traffic at different loads. Several thousand failures were individually seeded into the output generated by the exchange. The supervisor was able to detect the presence of all seeded failures. Reductions in computational cost of several orders of magnitude were measured in comparison with the direct, single layer supervisor.
SBEAT3: a tool for multi-part music composition by simulated breeding
Authors: Tatsuo Unemi
Venue: Proceedings of the eighth international conference on Artificial life (2002)

This paper presents a design of support system for musical composition based on Simulated Breeding. In our system named SBEAT3, each individual in the population is a short musical section of sixteen beats including 23 parts, thirteen solos, two chords and eight percussions. The melody and rhythm are generated by a type of recursive algorithm from genetic information. By selecting favorite piece among scores displayed on the screen, the user listens to the sounds and decides which should be theparents to reproduce the offspring in the next generation. The genetic codes of children are generated through mutation and crossover. Iterating this process, the user obtains better pieces gradually. Embedding some domain specific functions, such as changing tempo and selecting tones, we can build a useful tool to make it easier for a beginner to compose his/her favorite musical pieces.
Bounds for symmetric elliptic integrals
Authors: Edward Neuman
Venue: Journal of Approximation Theory (2003)

Lower and upper bounds for the four standard incomplete symmetric elliptic integrals are obtained. The bounding functions are expressed in terms of the elementary transcendental functions. Sharp bounds for the ratio of the complete elliptic integrals of the second kind and the first kind are also derived. These results can be used to obtain bounds for the product of these integrals. It is shown that an iterative numerical algorithm for computing the ratios and products of complete integrals has the second order of convergence.
A simplified and efficient representation for evaluation and selection of assembly sequences
Authors: Reddy B. Gottipolu, Kalyan Ghosh
Venue: Computers in Industry (2003)

This paper describes a new approach for generation, representation and selection of assembly sequence alternatives. In the presented methodology, geometric and mobility constraints extracted directly from the CAD model of the assembly are translated into two types of uni-directional matrices, which are called the contact and the translational functions. An algorithmic procedure is used to generate all feasible assembly sequences from these two functions. The sequences are then represented as a table of assembly states and assembly tasks in a hierarchical fashion starting from individual components in unassembled state to finished assembly. This assembly sequence table (AST) is also provided with editing features to apply strategic constraints in order to analyze all feasible sequences and determine the final sequence choice. An example has been provided to demonstrate the proposed approach.
Impact of Communciation Networks on Fault-Tolerant Distributed Computing
Authors: Rogerio Drummond
Venue:  (1986)

When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been identified that can simplify the conceptual design of fault-tolerant distributed systems. Properties of a distributed system have profound implications on the solvability and efficiency of implementations of these paradigms. In this thesis we study the effect that different communication models have on the efficiency of fault-tolerant computing. As an instance of a fundamental operation we examine protocols for reliable broadcast in distributed systems. Our main contribution is the characterization of the time complexity of reliable broadcast with respect to communication models. A practical consequence of our results is the development of efficient reliable broadcast protocols with respect to communication models. A variety of common networks are shown to support this style of communication. In fact, by parameterizing the minimum multicast size and diameter of these networks, we are able to characterize all known network architectures. Distributed systems where processors perceive the same approximate time makes programming them much easier. Clock synchronization protocols implement this abstraction given only clocks that have bounded drift rates with respect to real time. We show how a primitive which is normally used only for communication in a distributed system can also be used for synchronizing clocks. If this primitive occurs naturally with a sufficient frequency, clock synchronization can be achieved at no additional message cost. Our results reveal hardware/software tradeoffs between performance, resiliency and network cost. Thus, they offer many new alternatives previously not considered in designing fault-tolerant systems.
Improving Tree-Based Models of Software Quality with Principal Components Analysis
Authors: Taghi M. Khoshgoftaar, Ruqun Shan, Edward B. Allen
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Software-quality classification models can predict which modules will be considered fault-prone, or not, based on software product metrics, process metrics, and execution metrics. Such predictions can be used to target improvement efforts to those modules that need it the most. Classification-tree modeling is a robust technique for building such software quality models. However, model structure maybe unstable and accuracy may suffer when predictors are highly correlated. This paper presents an empirical case study of four releases of a very large telecommunications system, which showed that the tree-based models could be improved by transforming the predictors with principal components analysis, so that transformed predictors are not correlated. The case study used the regression-tree algorithm in the S-Plus package and then applied our general decision rule to classify modules.
Porting a visualization package from IRIX to NT : what will I get and what will I pay ?
Authors: Robert Liere, J. A. Harkes, J. H. Kniesmeijer
Venue:  (1998)

We discuss our experiences in porting a moderately large scientific visualization environment from IRIX to NT~4.0. Two porting strategies have been taken: a port via a POSIX emulation layer and a native NT port. POSIX compliant code can be ported to NT with relatively little effort if the code adheres to general accepted programming principles, such as modularity and encapsulation. The performance of a modern 3D Wintel machine is quite satisfactory for a variety of scientific desktop tasks. We have compared the performance of a 2 CPU Dell OptiPlex with FireGL 4000 graphics option to various SGI desktop workstations.
Finding Optimal Quorum Assigments for Distributed Databases
Authors: Donald B. Johnson, Larry Raab
Venue:  (1990)

Replication has been studied as a method of increasing the availability of a data item in a distributed database subject to component failures and consequent partitioning. The potential for partitioning requires that a protocol be employed which guarantees that any access to a data item is aware of the most recent update to that data item. By minimizing the number of access requests denied due to this constraint, we maximize availability. In the event that all access requests are reads, placing one copy of the data item at each site clearly leads to maximum availability. The other extreme, all access requests are write requests or are treated as such, has been studied extensively in the literature. In this paper we investigate the performance of systems with both read and write requests. We describe a distributed on-line algorithm for determining the optimal parameters, or optimal quorum assignments, for a commonly studied protocol, the quorum consensus protocol[9]. We also show how to incorporate these optimization techniques into a dynamic quorum reassignment protocol. In addition, we demonstrate via simulation both the value of this algorithm and the effect of various read-write rations on availability. This simulation, on 101 sites and up to 5050 links(fully- connected), demonstrates that the techniques described here can greatly increase data availability, and that the best quorum assignments are frequently realized at the extreme values of the quorum parameters.
Smart Sight: A Tourist Assistant System
Authors: Jie Yang, Weiyi Yang, Matthias Denecke, Alex Waibel
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

In this paper, we present our efforts towards developing an intelligent tourist system. The system is equipped with a unique combination of sensors and software. The hardware includes two computers, a GPS receiver, a lapel microphone plus an earphone, a video camera and a head-mounted display. This combination enables a multimodal interface to take advantage of speech and gesture input to provide assistance for a tourist. The software supports natural language processing, speech recognition, machine translation, handwriting recognition and multimodal fusion. A vision module is trained to locate and read written language, is able to adapt to to new environments, and is able to interpret intentions offered by the user, such as a spoken clarification or pointing gesture. We illustrate the applications of the system using two examples.
The Template and Multiple Inheritance Approach into Attribute Grammars
Authors: Marjan Mernik, Mitja Lenic, E. Avdicausevic, Viljem Zumer
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Formal methods for describing programming language semantics, such as attribute grammars, operational semantics and denotational semantics, are not widely used since they are not modular, extensible and reusable. In the paper a new modular, extensible and reusable approach for specifying programming languages with attribute grammars is presented. The concepts from object-oriented programming, i.e. templates and multiple inheritance, have been integrated with attribute grammars. A template in attribute grammar is an abstraction of a semantic rule parameterized with attribute occurrences. On the other hand, the whole attribute grammar is a subject of multiple inheritance and specialization. With the proposed approach a language designer has the chance to design incrementally a language or reuse some fragments from other programming language specifications. Templates and multiple inheritance have been implemented in our compiler generator tool LISA ver. 2.0
Simulations of Human Immunodeficiency Virus Infection
Authors: Toshiaki Takayanagi, Azuma Ohuchi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Human immunodeficiency virus (HIV) infection acquired immunodeficiencysyndrome (AIDS) have been very important problems all over the world. The progression of HIV infection into AIDS is controlled with anti-HIV drugs,But the treatments with the anti-HIV drugs have some problems.Hence,the research and development to understand the dynamics of HIV infection.The model is characterized by the calculations of responses against stimuli;that is, the experimental phenomena (when the values of response are plotted against the logarithm of the values of stimuli, a sigmoid curve is obtained) areincorporated into the model.By the calculations of the model, we obtain thesimulation results which show slow increase of the viral load and slow decrease in non-infected CD4 Tcells after the acute phase.
On resource management and QoS guarantees for long range dependent traffic
Authors: A. Adas, A. Mukherjee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The effect of long-memory processes on queue length statistics of a single queue system is studied through a controlled fractionally differenced ARIMA (1,d,0) input process. This process has two parameters /spl phi//sub 1/ and d representing an auto-regressive component and a long-range dependent component, respectively. Results show that the queue length statistics studied (mean, variance and the 0.999 quantile) are proportional to e(c/sup c/spl phi/1/) e(c/sub 2/d), where (c/sub 1/, c/sub 2/) are positive constants, and c/sub 2/
Partial Functions in Constructive Formal Theories
Authors: Robert L. Constable
Venue:  (1983)

Partial functions abound in modern computing theory, and so any system which purports to naturally formalize it must treat them. Surprisingly, the most common treatments do not work well for constructive formal systems, i.e., for those with computational content. Since constructive formal systems are significant in computer science, it is important to give an account of partial functions in them. This paper does that by construing a partial function $\phi :N \rightarrow N$ as a total function $f:D_{f}\rightarrow N$ for $D_{f}$ an inductively defined set generated simultaneously with $f$. This idea has appeared in other guises, at least in the author''s previous work, but here it is presented in a pure form. It is compared to Scott''s method of using total functions on domains. A formal system of arithmetic is defined to illustrate the ideas. The system is shown consistent relative to constructive type theory; from this result important corollaries are drawn about using the theory as a programming language. KEY WORDS AND PHRASES: automated logic, Heyting arithmetic, constructivity, intuitionistic predicate calculus, partial functions, recursive functions, programming logics, program verification, type theory, type checking.
Intersecting codes and separating codes
Authors: G. Cohnen, S. Encheva, S. Litsyn, H. G. Schaathun
Venue: Discrete Applied Mathematics (2003)

Let Γ be a code of length n. Then x is called a descendant of the coalition of codewords a, b,...,e if xi ∈ {ai, bi,..., ei} for i = 1,..., n. We study codes with the following property: any two non-intersecting coalitions of a limited size have no common descendant.We present constructions based on linear intersecting codes.
An Empirical Study of Training and Testing Error in Boosting
Authors: David D. Latham
Venue:  (2001)

Bounds have been proven for both training and testing error for the boosting algorithm AdaBoost, but in practice neither seem to produce a particularly tight bound. In this paper we share some observations of these bounds from empirical results, and then explore some properties of the algorithm with an eye towards finding an improved bound for the performance of AdaBoost. Based on our empirical evidence, the error of a hypothesis which labels examples probabilistically based upon the confidence of the vote of the weak hypotheses forms a tighter bound for the training error. 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
Error analysis of difficult TREC topics
Authors: Xiao Hu, Sindhura Bandhakavi, Chengxiang Zhai
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Given the experimental nature of information retrieval, progress critically depends on analyzing the errors made by existing retrieval approaches and understanding their limitations. Our research explores various hypothesized reasons for hard topics in TREC-8 ad hoc task, and shows that the bad performance is partially due to the existence of highly distracting sub-collections that can dominate the overall performance.