ppxscal/embedding_network huggingface dataset:
Real situations of wearable computers used for video conferencing - and implications for terminal and network design
Authors: Bj"rn Hestnes, Svein Heiestad, Peter Brooks, Lasse Drageset
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Within five years it will be possible to transmit real-time high quality audio and video from almost anywhere to anywhere. With wireless videoconferencing equipment this information could also be transmitted while the users move. This is the most demanding scenario for network operators. If the network is dimensioned for this, all applications should work. Based on case studies in the offshore oil business and road construction industry, remote inspection situations were studied to answer the question: What are the real situations for such an application and the implications these situations have for the terminal and for the network? It was found that the situations with the highest perceived cost-benefit were 'Decision support', 'Guidance and demonstration' and 'Work planning'. These situations gave requirements for the terminal that has now been built. The terminal should have access to a digital broadband network that is reachable everywhere and that has characteristics that support person-to-person communication in both two party and multiparty configurations.
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
Authors: Anwitaman Datta, Manfred Hauswirth, Karl Aberer
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper studies the problem of updates in decentralisedand self-organising P2P systems in which peershave low online probabilities and only local knowledge.The update strategy we propose for this environment isbased on a hybrid push/pull rumor spreading algorithmand provides a fully decentralised, efficient and robust communicationscheme which offers probabilistic guaranteesrather than ensuring strict consistency. We describe ageneric analytical model to investigate the utility of ourhybrid update propagation scheme from the perspective ofcommunication overhead.
C# Data Security Handbook
Authors: Matthew Macdonald, Erik Johansen
Venue:  (2003)

:This book is aimed at practicing C# developers who are developing distributed applications or who need to store data in a secure manner. We assume that you are already proficient in developing .NET applications but no prior knowledge of cryptography is required.
A Java-Based Visual Mining Infrastructure and Applications
Authors: Ming Hao, Umesh Dayal, Meichun Hsu, Jim Baker, Bob Deletto
Venue: Proceedings of the 1999 IEEE Symposium on Information Visualization (1999)

Many real-world KDD (Knowledge Discovery & Data Mining) applications involve the navigation of large volumes of information on the web, such as, Internet resources, hot topics, and telecom phone switches. Quite often users feel lost, confused, and overwhelmed with displays that contain too much information. This paper discusses a new content-driven visual mining infrastructure called VisMine, that uses several innovative techniques: (1) hidden visual structure and relationships for uncluttering displays; (2) simultaneous visual presentations for high-dimensional knowledge discovery; and (3) a new visual interface to plug in existing graphic toolkits for expanding its use in a wide variety of visual applications. We have applied this infrastructure to three data mining visualization applications - topic hierarchy for document navigation, web-based trouble shooting, and telecom switch mining.
A Model for Evolution and Extinction
Authors: Bruce W. Roberts, M. E. J. Newman
Venue:  (1995)

We present a model for evolution and extinction in large ecosystems. The model incorporates the effects of interactions between species and the influences of abiotic environmental factors. We study the properties of the model by approximate analytic solution and also by numerical simulation, and use it to make predictions about the distribution of extinctions and species lifetimes that we would expect to see in real ecosystems. It should be possible to test these predictions against the fossil record. The model indicates that a possible mechanism for mass extinction is the coincidence of a large coevolutionary avalanche in the ecosystem with a severe environmental disturbance.
A Bandwidth-Sensitive Update Scheduling Method for Internet Push
Authors: Yun-Wu Huang, Philip S. Yu
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

We present the BUS (Bandwidth-sensitive Update Scheduling) method for WWW push proxies that actively sets different update schedules for various WWW push channels. Based on open protocols describing push objects, BUS optimizes the currency of the objects it delivers to the clients under the constraint of the available bandwidth. As a result, push traffic overflow is minimized with adequate gateway bandwidth reserved for critical non-push traffic. The BUS method also provides a mechanism to monitor client interest and conducts a dynamic proxy update for given channels if the client requests for these channels increase suddenly. In contrast to fixed-schedule approaches, this dynamic update mechanism can better capture the dynamic changes (such as the financial activities) that are of interest to many clients.
Parallel Transitive Closure and Point Location in Planar Structures
Authors: Roberto Tamassia, Jeffrey S. Vitter
Venue:  (1989)

We present parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar {\em st}-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal $O( \log n)$ running time using $ n / \log n $ processors in the EREW PRAM model, $n$ being the number of vertices.
Predicting whether or not a nucleic acid sequence is an E. coli promoter region using genetic programming
Authors: S. Handley
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

This paper shows that an evolutionary computation technique, genetic programming, can create programs that classify DNA sequences as E. coli promoter vs. non-E. coli promoter. The performance of the programs created are competitive with previous work.
Design considerations for multiagent systems on very small platforms
Authors: William Wright, Dana Moore
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The large and growing number of PDAs, tablet computers, JavaPhones, and other small footprint devices are a tempting target for deployment of multiagent systems (MAS). In this paper we describe previous and ongoing efforts to develop Cougaar MicroEdition (CougaarME), a scaled down version of the DARPA Cougaar MAS. We describe the challenges of small devices (including hardware choices and constraints) and the challenges of architecting the various elements (communications, service advertisement, policies).
Autonomous Decentralized System with Event Service for Information Services
Authors: Stephen S. Yau, Ning Dong, Fariaz Karim
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Autonomous Decentralized System (ADS) has the properties of online expansion, online maintenance and fault tolerance, which are among the important features for next generation information services. Since information services require transfer of large amounts of data with different levels of Quality of Services (QoS), it is necessary to have an ADS architecture to satisfy these requirements. This approach uses event service as the communication middleware and ATM network to handle large amounts of data and satisfy various QoS requirements.
An Iterative Method with Convergence Rate Chosen a priori
Authors: M. Brezina, C. Heberton, J. Mandel, P. Vanek
Venue:  (1999)

With increasing demand for large-scale three-dimensional simulations, iterative methods emerge as methods of choice. In practical situations, the convergence rate of an iterative method may suffer from practices such as violation of local quasi-uniformity of the mesh, certain implementations of the boundary conditions and of multiple point constraints. These phenomena are typically of local nature, e.g., may occur only along a part the boundary or interface between two parts of the model with different physical interpretation. The algebraic multigrid based on the concept of smoothed aggregation coarse space studied previously has proven to be efficient in solving these problems. However, the effect of the prolongator smoothing is global, and performing more smoothing to deal with a few local difficulties would be unnecessarily expensive. In this paper we recall the framework studied previously and extend it by adaptively enriching the coarse space locally in order to eliminate the influence of the above mentioned convergence impeding phenomena. The resulting two-level method is, in principle, capable of yielding any convergence rate chosen a priori.
Multipole-Based Algorithms for Efficient Calculation of Forces and Potentials in Macroscopic Periodic Assemblies of Particles
Authors: G C Lambert
Venue:  (1994)

A new and efficient algorithm based on multipole techniques is presented which calculates the electrostatic forces and potentials in macroscopic periodic assemblies of particles. The Fast Multipole Algorithm (FMA) can be used to compute forces within the $n$-particle unit cell in $O(n)$ time. For the cubic lattice, forces due to a $3^k x 3^k x 3^k$ lattice of images of the unit cell can be computed in $O(nk^2 + k^3 \log k)$ time to arbitrary precision. For biological systems, $k$ need only be a small constant, giving an algorithm linear in $n$. The algorithm was easily added onto an exisging FMA implementation, and computational results are presented. Accurate electrostatic computations were done on a $3^8 x 3^8 x 3^8$ region of unit cells at only a twofold cost over computing the forces and potentials within the 100000 particle unit cell alone. 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
Recovering Class Diagrams from Data-Intensive Legacy Systems
Authors: Giuseppe Antonio Di Lucca, Anna Rita Fasolino, Ugo de Carlini
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Several reverse engineering methods for recovering objects from legacy systems have been proposed in the literature, but most of them neglect to identify the relationships among the objects, or recover only a part of them. This paper describes a method for recovering an O-O model together with the objects and relationships among them. The proposed approach integrates the results of reverse engineering of both the procedural code and the persistent data stores of the system, and exploits a number of heuristic criteria to obtain a class diagram. A preliminary experiment carried out to validate the method on a COBOL medium-sized system yielded encouraging results.
An Effective Deterministic BIST Scheme for Shifter/Accumulator Pairs in Datapaths
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Effective Built-In Self-Test (BIST) schemes using deterministic sequences generated by small counters have been proposed in the past for the common multiplier/accumulator pair. In this paper we show how near complete testability can be achieved with a regular counter-generated deterministic test set for the shifter-accumulator pair (accumulation performed either by an adder or an ALU) which appears very often in embedded processor or DSP datapaths. The BIST scheme provides near complete coverage with respect to the stuck-at fault model for any datapath width as it is verified by a comprehensive set of experiments. The proposed BIST scheme uses the same Test Pattern Generation (counters) and Output Data Evaluation (accumulators) resources as in our earlier BIST schemes for multiplier/accumulator pairs, thus completing a deterministic counter-based datapath BIST architecture. 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
La assegnazione dei nomi a dominio su Internet (seconda edizione)
Authors: Vittore Casarosa, Antonio Pinizzotto, Rita Rossi, Stefano Trumpy, Daniele Vannozzi
Venue:  (1998)

An outline of the origin of the Domain Name System in Internet is reported. A global overview of present situation follows: ISOC, InterNIC, RIPE and RIPE/NCC, ARIN, APNIC; then the Italian situation: Italian Naming Authority and Registration Authority. Some important issues about the Italian service management are dealt with: conflict between names and registered trademarks, name reservation, name structure for pubblic administrations and similar issues. At the end of the document some issues related to DNS are reported.
Nuclear Electromagnetic Resonance Spectroscopy
Authors: M. W. Evans
Venue:  (1990)

An argument is made for the existence of nuclear electromagnetic resonance (N.E.R.) between the interaction hamiltonian due to the conjugate product pi of the electric fields of a powerful pump laser and a new concept of nuclear spin polarisability, and a resonating electromagnetic probe field in the appropriate frequency range. N.E.R. is mediated theoretically by the interaction of pi with an axial vector quantity identified as nuclear spin polarisability, **s". The latter is defined through off diagonal matrix elements of nuclear transition electric dipole moments, between states of different parity, and the perturbation hamiltonian -pi **s" provides the nucleus with net spin, analogously with the interaction of nuclear spin, I, and external static magnetic flux density B, the basis of N.M.R. spectroscopy. This analogy is based on the identical parity and motion reversal symmetries of pi and B and of I and **s".
The Fundamental Theorem of Arithmetic in PL/CV2
Authors: Robert L. Constable
Venue:  (1980)

This document is a section of formal elementary number theory leading up to a complete proof of the fundamental theorem of arithmetic. On the way to this result a large number of simple facts about integer division, prime numbers, greatest common divisors, and the product function, $\prod_{i=1}^{m}a(i)$, are developed. The entire section is written in the formal logic of PL/CV2, and the proof was checked by the PL/CV2 Proof Checker on an IBM 370/168. Readers familiar with the syntax of a high level programming language, like PL/I, and accustomed to highly symbolic mathematical proofs should be able to read this document as a specimen of extremely formal and rigorous mathematics. The following remarks about PL/CV2 notation will simplify reading. 1. The *PROCESS line indicates the beginning of PL/I executable text, the *THEOREM line indicates the beginning of purely declarative text. 2. All proof text is written between PL/I comment delimiters of the form /*/...*/ or /#...#/ depending on context. 3. For the built-in PL/I functions ABS, MOD, SIGN, MAX, MIN, EXP, DIVISION (/) only the properties of the functions are listed, in Section 0 called BUILT-IN FUNCTIONS. No proofs of these properties are supplied (because the operations are provided by the system). Thus proved propositions appear starting in Section 1 (at line 0036). 4. In the listing the negation sign is written ^, thus B ^= 0 reads "B not equal to zero". The PL/I symbol for "or" is the vertical bar, thus line 0037 TRI : B0 is labeled by TRI (for trichotomy) and means B is less than or equal to 0 or greater than 0. The justification... BY ARITH... indicates that the conclusion follows from simple arithmetic reasoning, provided by the system, from the list of hypotheses. 5. Every PL/CV2 procedure, such as LOG at line 0049, begins with an ASSUME statement, telling what is assumed about the input, and with an ATTAIN statement telling what will be proved about it. Also every procedure is proved to terminate. In the case of recursive procedures, the termination proof begins with the line ARBITRARY WHERE (see line 0053). It is proved that this integer variable decreases on any recursive call.
A brief history of just-in-time
Authors: John Aycock
Venue: ACM Computing Surveys (CSUR) (2003)

Software systems have been using "just-in-time" compilation (JIT) techniques since the 1960s. Broadly, JIT compilation includes any translation performed dynamically, after a program has started execution. We examine the motivation behind JIT compilation and constraints imposed on JIT compilation systems, and present a classification scheme for such systems. This classification emerges as we survey forty years of JIT work, from 1960--2000.
Verification of UML-Based Real-Time System Designs by Means of cTLA
Authors: Guenter Graw, Peter Herrmann, Heiko Krumm
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The Unified Modeling Language UML is well suited for the design of real-time systems. In particular, interaction diagrams and statecharts support the design of dynamic system behaviors. Real-time aspects of behaviors can be described by time constraints. The semantics of the UML, however, is non-formal.In order to enable formal design verification, we therefore propose to complement the UML based design by additional formal models which refine UML diagrams to precise formal models. We apply the formal specification technique cTLA, which is based on L. Lamport's Temporal Logic of Actions TLA. In particular cTLA supports modular definitions of process types and the composition of systems from coupled process instances.Since process composition has superposition character, each process system has all of the relevant properties of its constituting processes. Therefore mostly small subsystems are sufficient for the verification of system properties and it is not necessary to use complete and complex formal system models. We present this approach by means of an example and also exemplify the formal verification of its hard real-time properties.
Learning XML, 2 edition
Authors: Erik T. Ray
Venue:  (2003)

:The arrival of support for XMLthe Extensible Markup Languagein browsers and authoring tools has followed a long period of intense hype. Major databases, authoring tools (including Microsoft's Office 2000), and browsers are committed to XML support. Many content creators and programmers for the Web and other media are left wondering, "What can XML and its associated standards really do for me?" Getting the most from XML requires being able to tag and transform XML documents so they can be processed by web browsers, databases, mobile phones, printers, XML processors, voice response systems, and LDAP directories, just to name a few targets. In Learning XML, the authors explain XML and its capabilities succinctly and professionally, with references to real-life projects and other cogent examples. Learning XML shows the purpose of XML markup itself, the CSS and XSL styling languages, and the XLink and XPointer specifications for creating rich link structures. The basic advantages of XML over HTML are that XML lets a web designer define tags that are meaningful for the particular documents or database output to be used, and that it enforces an unambiguous structure that supports error-checking. XML supports enhanced styling and linking standards (allowing, for instance, simultaneous linking to the same document in multiple languages) and a range of new applications. For writers producing XML documents, this book demystifies files and the process of creating them with the appropriate structure and format. Designers will learn what parts of XML are most helpful to their team and will get started on creating Document Type Descriptions. For programmers, the book makes syntax and structures clear. It also discusses the stylesheets needed for viewing documents in the next generation of browsers, databases, and other devices. About the Authors:Erik Ray is a software wrangler for the computer book publisher O'Reilly and Associates, helping to move production to an XML-based workflow. He lives with his wife Jeannine and 5 birds in Saugus, Massachusetts. When not writing, he can be found practicing kendo, watching Japanese animation, playing go, or stalking antiquarian book fairs to indulge his fetish for 19th-century children's books and machine bolt catalogs. Chris Maden left Brown University in 1994 and stumbled into a career in structured markup via a technical support position at Electronic Book Technologies in Providence, RI, creators of one of the first electronic book browsers, DynaText. There, he got involved in standards work, including participating in the first work on XML. From EBT, he staggered north to the Tools Group at O'Reilly, where he helped develop a new generation of SGML and XML publishing tools, and where he also joined the XSL Working Group at the W3C. In 1999, he left to join Yomu, an e-books startup in San Francisco, where he currently lives with his wife Ellie Fountain Maden.
Online Channel Allocation in FDMA Networks with Reuse Constraints
Authors: Tomas Feder, Sunil M. Shende
Venue:  (1998)

The topology of an FDMA network is modeled by a subdivision of a planar region into hexagonal cells; this defines a graph where every node has at most six neighbors. For channel allocation, every node has a weight that indicates the number of channels that must be assigned to it; the reuse distance defines the minimum distance between nodes that can use the same channel without radio interference. It is known that with reuse distance 2, the number of channels needed and their allocation can be approximated within a factor of $4/3$ both offline and online. We describe an online algorithm for the case of reuse distance 3 that achieves an approximation factor of $7/3$.
Understanding the Interaction between Performance and Power Consumption in Mobile Systems to Accurately Predict Battery Life
Authors: Jolin M. Warren, Daniel P. Siewiorek, Thomas L. Martin
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

When designing and using a wearable system, it is important to find the appropriate trade-off between system performance and battery life. Methods currently used for evaluating battery life over a range of CPU clock frequencies are often inaccurate because they fail to account for the fact that overall system performance usually does not scale proportionally to CPU clock frequency. We present a modified method that works in all cases, and characterize the battery life of the test system over a range of frequencies.
Minimizing the weighted number of tardy jobs on a two-machine flow shop
Authors: R. L. Bulfin, Rym M'Hallah
Venue: Computers and Operations Research (2003)

In this paper, we describe an exact algorithm to solve the weighted number of tardy jobs two-machine flow shop scheduling problem. The algorithm uses branch-and-bound; a surrogate relaxation resulting in a multiple-choice knapsack provides the bounds. Extensive computational experiments indicate problems with 100 jobs can be solved quickly.