ppxscal/embedding_network huggingface dataset:
Circular Data Matrix Fiducial System and Robust Image Processing for a Wearable Vision-Inertial Self-Tracker
Authors: Leonid Naimark, Eric Foxlin
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

A wearable low-power hybrid vision-inertial tracker has been demonstrated based on a flexible sensor fusion core architecture, which allows easy reconfiguration by plugging-in different kinds of sensors. A particular prototype implementation consists of one inertial measurement unit and one outward-looking wide-angle Smart Camera, with a built-in DSP to run all required image-processing tasks. The Smart Camera operates on newly designed 2-D bar-coded fiducials printed on a standard black-and-white printer. The fiducial design allows having thousands of different codes, thus enabling uninterrupted tracking throughout a large building or even a campus at very reasonable cost. The system operates in various real-world lighting conditions without any user intervention due to homomorphic image processing algorithms for extracting fiducials in the presence of very non-uniform lighting.
Fast simulation of a voice-data multiplexer
Authors: P. Heidelberger, R. Simha
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

This paper considers the problem of estimating, via simulation, extremely low packet loss rates in a voice-data multiplexer. The multiplexer gives priority to voice packets, unless the data queue length exceeds a threshold. To efficiently simulate such low loss rates requires the proper use of importance sampling. In this paper we describe an importance sampling technique that is guaranteed to provide an exponential decrease in variance over standard simulation. This importance sampling technique has two phases, with a different importance sampling strategy in each phase. Experimental results are presented that demonstrate the effectiveness of this approach.
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
Authors: Jinggang Wang, Binoy Ravindran
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we present a MAC-layer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-levelmessages have end-to-end timeliness requirements that are specified usingJensen's benefit functions. The objective of BPA is to maximize the aggregate message-level benefit. The algorithm reasons that this objective can be achieved by maximizing aggregate packet-level benefit, where packets of messages are allowed to inherit benefit functions of their parent messages. BPA thus solves a non-preemptive packet scheduling problem. Since this problem is NP-hard, BPA heuristically computes packet schedules to maximize aggregate benefit, incurring a worst-case computational complexity of O(n 2 ). This is better than the O(n 3 ) complexity of the previously known best algorithm (called CMA) for the same problem. Further, our experimental studies show that BPA performs as good as CMA for a broad set of benefit functions, and significantly outperforms CMA for some benefit functions. Furthermore, we observe that BPA yields lower missed-deadline ratio than CMA when message arrival density increases.
FrameMaker 7: The Complete Reference
Authors: Sarah S. O'Keefe, Sheila A. Loring
Venue:  (2002)

:Covering both FrameMaker and FrameMaker+SGML, this comprehensive resource explains the full range of features and offers little-known tips and tricks for maximizing this powerful desktop publishing application.
Informatica e Slavistica:una nuova applicazione del DBT come strumento di analisi per l''antico slavo
Authors: Monia Camuglia
Venue:  (1995)

This article concerns the procedure used to tailor the DBT, a text analysis program originally created for the processing of texts edited in the Latin alphabet, to the needs of ancien Slavonic. The first part specifies the scope of the work and describes the methodology adopted as well as the strategies used to solve the philological problems of the material analyzed. The second part contains a concrete example of application and use of the program. Finally, the third part sheds light on the prospects of development which this work has opened up for future research. 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
A self organizing social insect model for dynamic frequency allocation in cellular telephone networks
Authors: Michael Lawlor, Tony White
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes a mobile agent solution to the problem of frequency allocation encountered in cellular telephone networks. The mobile agents used follow a social insect behavioral model for division of labor and task allocation similar to that exhibited by swarms of ants, wasps and other social insects. Through this behavioral model, the "swarm" of agents self-organizes and displays an adaptive, swarm level intelligence that is transparent to each individual agent. Putting these agents to work in a simulated cellular telephone network, a simpler, distributed solution to frequency allocation was achieved.
The Economics of the Internet: Utility, Utilization, Pricing, and Quality of Service
Authors: Odlyzko Andrew
Venue:  (1999)

Can high quality be provided economically for all transmissions on the Internet? Current work assumes that it cannot, and concentrates on providing differentiated service levels. However, an examination of patterns of use and economics of data networks suggests that providing enough bandwidth for uniformly high quality transmission may be practical. If this turns out not to be possible, only the simplest schemes that require minimal involvement by end users and network administrators are likely to be accepted. On the other hand, there are substantial inefficiencies in the current data networks, inefficiencies that can be alleviated even without complicated pricing or network engineering systems.
A Framework for Specification-Based Class Testing
Authors: Ling Liu, Huaikou Miao, Xuede Zhan
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Class testing is the base of object-oriented softwaretesting. It involves three aspects -- testing each method,testing the relations among class methods and testinginheriting relation between class and subclass. Ratherthan concerning the whole class testing process, mostspecification-based class testing focuses on the methods ofgenerating test cases from the class specification. As aresult, class testing process and test cases cannot beunified and managed in a consistent and convenient way.This paper introduces a test class framework (TCF) that isused to structure the test cases and test deriving process ofthe class under testing. This framework clearly denotes theprocess of deriving test cases and test suites from a classspecification. It facilitates the construction andmanagement of test cases. Object-Z notation is used toexpress the framework and class specification. Keywords:test class framework, class testing , finite state machine(FSM), state transition tree, Object-Z
Partitioning Using PAQ
Authors: Thomas D. Howell
Venue:  (1975)

The so-called PAQ problem is concerned with the solution of sparse systems of linear equations $Ax=b$ using the transformation $PAQy=Pb, x=Qy$. An algorithm is given for choosing $P$ and $Q$ to partition the matrix $A$ into its irreducible components. A theorem on which this algorithm is based has long been known, yet no simple, easily understood proof appears in the literature. Such a proof is given here. Remarks are made concerning some unsolved problems related to the PAQ problem.
Information Visualization in Locating Obnoxious Facility: Some Examples with Mono and Bicriteria Models
Authors: Carlos Ferreira
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The problem of locating obnoxious facilities has become a major social concern. Operation Research models and methods have been used in this context, however their use can be jeopardized by the huge demanded effort. In consequence, the use of visualization and interaction methods becomes of great importance. This paper addresses specific issues and shows examples of developed solutions for the visualization and interaction problems related to the use of mono and multi-criteria Obnoxious Facility Location in Decision Support scenarios.
Finding out = Achieving Decidability
Authors: Sverker Janson, Manny Rayner
Venue:  (1989)

We present a framework for reasoning about the concepts of "knowing what" and "finding out", in which the key concept is to identify "finding out the answer to question Q" with "achieving a situation in which Q is decidable" . We give examples of how the framework can be used to formulate non-trivial problems involving the construction of plans to acquire and use information, and go on to demonstrate that these problems can often be solved by systematic application of a small set of goal-directed backward-chaining rules. In conclusion, it is suggested that systems of this kind are potentially implementable in l-Prolog, a logic programming language based on higher-order logic.
What do the Software Reliability Growth Model Parameters Represent?
Authors: Yashwant K. Malaiya, Jason Denton
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Here we investigate the underlying basis connecting the software reliability growth models to the software testing and debugging process. This is important for several reasons. First, if the parameters have an interpretation, then they constitute a metric for the software test process and the software under test. Secondly, it may be possible to estimate the parameters even before testing begins. These a priori values can serve as a check for the values computed at the beginning of testing, when the test-data is dominated by short term noise. They can also serve as initial estimates when iterative computations are used.Among the two-parameter models, the exponential model is characterized by its simplicity. Both its parameters have a simple interpretation. However, in some studies it has been found that the logarithmic poisson model has superior predictive capability. Here we present a new interpretation for the logarithmic model parameters. The problem of a priori parameter estimation is considered using actual data available. Use of the results obtained is illustrated using examples. Variability of the parameters with the testing process is examined.
Using Use Cases in Executable Z
Authors: Wolfgang Grieskamp, Markus Lepper
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

Use Cases are a widespread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation, which aims to support, beside others, the specification of early requirements. In this paper, we develop a representation of Use Cases in Z and apply it to several examples. Our focus is on instrumenting the formalization for black-box test evaluation in Executable Z, a computation model and implementation for Z based on concurrent constraint resolution
Multimedia lectures for visually oriented medical disciplines
Authors: Jürgen Albert, Holger Höhn
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Many scientific disciplines with an intrinsically high degree of multimedia content can be found among the life-sciences. Among the various faculties of medicine, especially dermatology is renowned for extensive use of clinical images in lectures and in textbooks. Training the "diagnostic eye" is an important part of the medical education. Furthermore, large collections of images, traditionally organized in numerous cabinets of slides, can be maintained and distributed a lot easier when their digitized counterparts are stored in an image database on some PC in the clinic's network. Thus, ideal conditions should hold for introduction of computer-based multimedia-lectures for dermatology and the distribution of teaching material on CD-ROMs or over the World Wide Web, This paper gives an account of an interdisciplinary multimedia project of three dermatology-departments, an institute for medical psychology and our chair. Since most of the implemented tools have been field-tested in recent semesters, we also can report about usability and acceptance among lecturers and students.
Optimal utterances in dialogue protocols
Authors: Paul E. Dunne, Peter McBurney
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Dialogue protocols have been the subject of considerable attention with respect to their potential applications in multiagent system environments. Formalisations of such protocols define classes of dialogue locutions, concepts of a dialogue state, and rules under which a dialogue proceeds. One important consideration in implementing a protocol concerns the criteria an agent should apply in choosing which utterance will constitute its next contribution to a discussion in progress: ideally, an agent should select a locution that (by some measure) "optimises" the outcome. The precise interpretation of 'optimise' is, however, something that may vary greatly depending on the nature and intent of a dialogue area. If we consider 'persuasion' protocols, where one agent's intention is to convince others of the validity or invalidity of a specific proposition, then optimality might be regarded in the sense of "choice of locution that results in a 'minimal length' debate": thus the agent defending a hypothesis tries to select utterances that will convince other participants of the validity of this hypothesis after 'as few locutions as possible'. We present a formal setting for considering the problem of deciding if a particular utterance in the context of a persuasion dialogue is optimal in this sense. We show that, in general, this decision problem is both NP--hard and CO-NP--hard.
A graphical interface for cooperative access to distributed and heterogeneous database systems
Authors: Xuequn Wu, N. Weissenberg
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

We present the graphical interface of the system VHDBS, which has been jointly developed by an industrial research project at the Technology Center of the German Telekom and at the Fraunhofer ISST. The VHDBS system enables the integration and interoperation of existing distributed and heterogeneous databases, which were developed independently. The graphical interface FGRAPH of VHDBS provides uniform access to distributed and heterogeneous data. The interface is based on a sophisticated design, which enables browsing on both schema and object level, and allows both query and browsing of objects. In particular the user can move back and forth freely between query and browsing activities. Cooperative access to the data in various underlying databases is supported and platform, location and data model transparency is provided to the user.
Constructive Training Methods for Feedforward Neural Networks with Binary Weights
Authors: Eddy Mayoraz, Frederic Aviolat
Venue:  (1995)

Quantization of the parameters of a Perceptron is a central problem in hardware implementation of neural networks using a numerical technology. A neural model with each weight limited to a small integer range will require little surface of silicon. Moreover, according to Ockham''s razor principle, better generalization abilities can be expected from a simpler computational model. The price to pay for these benefits lies in the difficulty to train these kind of networks. This paper proposes essentially two new ideas for constructive training algorithms, and demonstrates their efficiency for the generation of feedforward networks composed of Boolean threshold gates with discrete weights. A proof of the convergence of these algorithms is given. Some numerical experiments have been carried out and the results are presented in terms of the size of the generated networks and of their generalization abilities.
Maya 4.5 Fundamentals
Authors: Lammers, Lee S. Gooding
Venue:  (2003)

:Maya 4.5 Fundamentals takes the user from a review of 3D fundamentals to a working knowledge of creating content in Maya 4.5. Topics covered include the interface and primary tools, modeling with NURBS and polygons, applying materials and textures, lighting, using modifiers and deformers, animating scenes, using cameras, rendering stills and animations, and using particle systems, dynamics, and paint effects. New features in 4.5 are also included in this updated and expanded version. Special appendices cover making the change from 3ds max or LightWave to Maya. Video-captured movies on the accompanying CD supplement the tutorial foundation of the book and will provide a salient selling point. The most exciting thing to be included on the CD is the video-captured tutorial movies created to supplement the tutorials in the book. This feature alone has the equivalent value of several training videos. In addition, the CD will include project files and color screen captures.
Document Object Model, 1 edition
Authors: Joe Marini
Venue:  (2002)

:Here's a practical guide to using the W3C's standardized DOM interfaces to process XML and HTML documents. Learn the concepts, design, theory, and origins of the DOM. Use the DOM to inspect, navigate, and manipulate a document's nodes and content; then learn to build useful applications that can easily be ported to any DOM-compliant implementation without re-coding. Get easy-to-follow advice on using the DOM in real-world scenarios such as manipulating document content, creating user interfaces, and offloading processing to the client side. The Document Object Model: Processing Structured Documents will help you flatten your learning curve, standardize programming, reuse code, and reduce development time.
The Design of Parallel Systems: An Application and Evaluation of Modula
Authors: Gregory R. Andrews
Venue:  (1978)

Modula is a new programming language for implementing dedicated, parallel systems. Following a systematic design technique, this paper illustrates the use of Modula for the design of a message switching communication system. A message switching system poses a number of interesting problems: a high degree of concurrent activity exists, a variety of IO devices need to be controlled, messages can have multiple destinations, and messages can be preempted. The strengths and weaknesses of Modula with respect to these specific problems and its utility as a general purpose language are evaluated. Key Words and Phrases: structured multiprogramming, concurrent systems, Modula, message switching, software design, processes, monitors, modular design. CR Categories: 3.81, 4.2, 4.21, 4.3
Hardware Synchronization of Massively Parallel Processes in Distributed Systems
Authors: Mikhail Makhaniok, Reinhard Manner
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper a new method is proposed to synchronize massively parallel processes in distributed multiprocessor systems. The method is an extension of that used in arbitration systems like Futurebus+. It also uses three global synchronization lines and a distributed synchronizer, and can be applied without changes to the existing hardware. The method allows to carry out two alternative synchronization protocols where the end of the operation is either forced by any processor or identified as a moment when all processors completed their individual parts. Application of this method, e.g., to the arbitration process allows to reduce the arbitration time in average by a factor of 2.
Finding an Approximate-median with High Probability in Constant Parallel Time
Authors: Sandeep Sen
Venue:  (1989)

Given $n$ elements from a totally ordered set we outline a method for choosing an element whose rank is $\gamma n$ for some $0~>~\gamma~0$. 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
A Brief Survey of Convergence Results for Quasi-Newton Methods
Authors: John E. Dennis,  Jr.
Venue:  (1975)

This paper highlights the important theoretical developments in the study of quasi-Newton or update methods and suggests avenues for future research. An attempt is made to present this material in a way reasonably compatible with history but organized for the novice.
Red Hat Linux 8 Unleashed
Authors: Bill Ball, Hoyt Duff
Venue:  (2002)

:Continuing with the tradition of offering the best and most comprehensive coverage of Red Hat Linux on the market, Red Hat Linux 8 Unleashed includes new and additional material based on the latest release of Red Hat Linux.Incorporating a more advanced approach to presenting information about Red Hat Linux, the book aims to provide the best and latest information intermediate to advanced Red Hat users need to know about installation, configuration, system administration, server operations, and security. All chapters concentrate on Red Hat Linux software packages. There is updated topic coverage in areas such as:The architecture of Linux kernel 2.4.18USBKDEGNOME 1.4Broadband access issues, routing, gateways, firewalling (SOHO networking)The new XFree86 4.2 architecture and featuresDisk tuningGCC 2.2Perl 5.6.1Python 2New printing services (CUPS)SecurityAuthor Biography: Bill Ball is an author, technical writer, and magazine journalist, working with Linux since 1986. He has published more than a dozen articles and several successful computer books. Other books published by the author are: Linux Unleashed, Fourth Edition, 0-672-31688-9, Sams Publishing Sams Teach Yourself Linux in 24 Hours, First and Second Editions
Building 3-D Models from Unregistered Range Images
Authors: Kazunori Higuchi, Martial Hebert, Katsushi Ikeuchi
Venue:  (1993)

In this paper, we describe a new approach for building a three-dimensional model from a set of range images. The approach is able to build models of free-form surfaces obtained from arbitrary viewing directions, with no initial estimate of the relative viewing directions. The approach is based on building discrete meshes representing the surfaces observed in each of the range images, to map each of the meshes to a spherical image, and to compute the transformations between the views by matching the spherical images. The meshes are built using an iterative fitting algorithm previously developed; the spherical images are built by mapping the nodes of the surface meshes to the nodes of a reference mesh on the unit sphere and by storing a measure of curvature at every node. We describe the algorithms used for building such models from range images and for matching them. We show results obtained using range images of complex objects.
Quick On-Chip Self- and Mutual-Inductance Screen
Authors: Shen Lin, Norman Chang, Sam Nakagawa
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

In this paper, based on simulations of top-level interconnects and CMOS devices of industrial 0.18 technology, the rules to screen out those inductive interconnects requiring more accurate RLC considerations, and the victim wires potentially having significant inductive noises are developed. The presented criteria constitute a tighter self-inductance screening rule than those found in previously published work. The 2x mutual-inductance screening rule is presented and verified. The differences in on-chip inductance consideration, the significant frequency of a trapezoidal pulse, and the circuit modeling of on-chip inductance are also discussed.