ppxscal/embedding_network huggingface dataset:
ZAL: Zero-Maintenance Address Allocation in Mobile Wireless Ad Hoc Networks
Authors: Zhihua Hu, Baochun Li
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The allocation of IP addresses in hybrid wireless networks is one of the most critical issues in all-IP converged wireless networks. The reason is that centralized IP address allocation mechanisms may not be available in networks comprised of heterogeneous mobile wireless devices. In this paper, we propose Zero-Maintenance Address Allocation (ZAL), a fully distributed address allocation algorithm with extremely low communication overhead. ZAL outperforms existing solutions in many important aspects, and eliminates permanent duplication of IP addresses. ZAL is completely free from periodical maintenance messages, timeouts, delays, and modification of existing network protocols. Theoretically, we prove that ZAL suffers negligible probability of temporary address duplication, while minimizing the usage of address space. In our experiments, we can successfully allocate addresses to a network of 480 nodes with no duplication of IP addresses when the size of available address space is 1024 (210) or larger. Even for an available address space of size 512, in average, temporary address duplication can be resolved within 60 seconds after the node joins the network.
SRA: description of the SOLOMON system as used for MUC-4
Authors: Chinatsu Aone, Doug McKee, Sandy Shinn, Hatte Blejer
Venue: Proceedings of the 4th conference on Message understanding (1992)

SRA's knowledge-based natural language processing system SOLOMON has been developed for text understanding since 1986. In addition to being a domain-independent NLP system, starting in the fall of 1990, SOLOMON has been extended as part of the MURASAKI project to become a multi-lingual text understanding system. It currently understands Spanish and Japanese as well as English texts. In order to achieve domain- and language-independence, SOLOMON separates data from processing modules. The processing modules do not assume any domain- or language-dependent facts; rather they are designed so that they work off separate data, i.e. lexicons, grammars, patterns, and knowledge bases, which vary according to the domain or language. To facilitate data acquisition, SRA has developed 2 tools: LEXTool for the development of lexicons and KBTool for the development of knowledge bases.
Protecting cryptographic keys and computations via virtual secure coprocessing
Authors: John P. McGregor, Ruby B. Lee
Venue: ACM SIGARCH Computer Architecture News (2005)

Cryptographic processing is a critical component of secure networked computing systems. The protection offered by cryptographic processing, however, greatly depends on the methods employed to manage, store, and exercise a user's cryptographic keys. In general, software-only key management schemes contain numerous security weaknesses. Thus, many systems protect keys with distributed protocols or supplementary hardware devices, such as smart cards and cryptographic coprocessors. However, these key protection mechanisms suffer from combinations of user inconvenience, inflexibility, performance penalties, and high cost.In this paper, we propose architectural enhancements for general-purpose processors that protect core secrets by facilitating virtual secure coprocessing (VSCoP). We describe modest hardware modifications and a trusted software library that allow common computing devices to perform flexible, high-performance, and protected cryptographic computation. The hardware additions include a small key store in the processor, encryption engines at the cache-memory interface, a few new instructions, and minor hardware platform modifications. With these enhancements, users can store, transport, and employ their secret keys to safely complete cryptographic operations in the presence of insecure software. In addition, we provide a foundation with which users can more securely access their secret keys on any Internet-connected computing device (that supports VSCoP) without requiring auxiliary hardware such as smart cards.
Overview and utilization of the NCI Thesaurus: Conference Papers
Authors: Gilberto Fragoso, Sherri de Coronado, Margaret Haber, Frank Hartel, Larry Wright
Venue: Comparative and Functional Genomics (2004)

The NCI Thesaurus is a reference terminology covering areas of basic and clinical science, built with the goal of facilitating translational research in cancer. It contains nearly 110 000 terms in approximately 36 000 concepts, partitioned in 20 sub-domains, which include diseases, drugs, anatomy, genes, gene products, techniques, and biological processes, among others, all with a cancer-centric focus in content, and originally designed to support coding activities across the National Cancer Institute. Each concept represents a unit of meaning and contains a number of annotations, such as synonyms and preferred name, as well as annotations such as textual definitions and optional references to external authorities. In addition, concepts are modelled with description logic (DL) and defined by their relationships to other concepts; there are currently approximately 90 types of named relations declared in the terminology. The NCI Thesaurus is produced by the Enterprise Vocabulary Services project, a collaborative effort between the NCI Center for Bioinformatics and the NCI Office of Communications, and is part of the caCORE infrastructure stack (). It can be accessed programmatically through the open caBIO API and browsed via the web (). A history of editing changes is also accessible through the API. In addition, the Thesaurus is available for download in various file formats, including OWL, the web ontology language, to facilitate its utilization by others. Published in 2005 by John Wiley & Sons, Ltd.This article is a U.S. Government work and is in the public domain in the U.S.A.
A Route Reconstruction Method Based on Support Group Concept for Mobile Ad Hoc Networks
Authors: Fumiaki Sato, Tadanori Mizuno
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In ad-hoc multicast networks, the maintenance of the delivery tree is important. However, the cost of reconstruction of the delivery tree is very large. In this paper, we propose the method to recover the delivery tree locally and effective retransmission for the packet loss caused by disconnection of the delivery tree. A new node group named the support group is composed in surroundings of the delivery tree for a local recovery. The support group is maintained by recursive constructing in the surroundings though the member of this support group might be included in the delivery tree by a local recovery. From our simulation, the proposed method has better performance than ODMRP.
Sun Certified System Administrator for Solaris 10 Study Guide (Exams CX-310-200 CX-310-202), 1 edition
Authors: Paul Sanghera
Venue:  (2005)

Primarily Written for those who want to earn the Sun Certified System Administrator (SCSA) certification for Solaris 10, this guide presents full coverage of the official objectives for both the required exams: CX-310-200 and CX-310-202. In spite of the laser sharp focus on the exam objectives, this is not a cram style book. Written in a classroom-based teaching style, this book presents material in a sequential fashion: topics and chapters build upon the previously covered topics and chapters. There is no hopping from topic to topic. An introductory chapter for beginners and a cohesive, concise, yet comprehensive presentation of the material makes it a self contained book that requires no prior experience in Solaris or UNIX. Even after passing the exam, you will find yourself coming back to use this book as an on-the-job reference. Full coverage of exam topics includes: Basic and advanced Solaris 10 installation Managing file systems and core dumps Performing user and security administration Managing network printers and system processes Performing system backups and restores and managing storage volumes Managing naming services Managing role based access control and system messaging Understanding fundamentals of TCP/IP networking and managing network services The book features complete details on all exam objectives, 250+ practice questions, step-by-step exercises, on-the-job elements, a two-minute drill at the end of each chapter that reviews the key points in the chapter, and chapter self-tests. The CD contains MasterExam practice exam software with all new questions, a Searchable electronic book, and a second practice exam (with free online registration). Table of contentsPart IChapter 1: IntroductionChapter 2: InstallationChapter 3: Performing Systems Boot ProceduresChapter 4: Performing File System AdministrationChapter 5: Performing Disk ManagementChapter 6: Performing User AdministrationChapter 7: Performing Security AdministrationChapter 8: Managing Network Printers and System ProcessesChapter 9: Performing System Backups and RestoresPart IIChapter 10: Working with the Solaris Network EnvironmentChapter 11: Managing Virtual File Systems and Core DumpsChapter 12: Managing Storage VolumesChapter 13: Managing Access Control and System MessagingChapter 14: Managing Naming ServicesChapter 15: Performing Advanced Installation Procedures
Alignment graph analysis of embedded discrete-time Markov Chains
Authors: Dimitar Radev, Svetla Radeva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

A stochastic method for optimal graph alignment at analysis of embedded discrete-time Markov chain is presented. The method works by generating paths through a graph according to a Markov chain. Each path is assigned a score, and these scores are used to modify the transition probabilities of the Markov chain. This procedure converges to a fixed path through the graph, corresponding to the optimal (or near optimal) sequence alignment. Simulation and numerical results for the entrance probability vectors for tandem queue performance are shown.
How much is a keyword worth?
Authors: Ramesh R. Sarukkai
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

How much is a keyword worth? At the crux of every search is a query that is composed of search keywords. Sponsors bid for placement on such keywords using a variety of factors, the key being the relative demand for the keyword, and its ability to drive customers to their site. In this paper, we explore the notion of "worth of a keyword". We determine the keyword's worth by tying it to the end criteria that needs to be maximized. As an illustrative example, keyword searches that drive e-commerce transactions are modeled and methods for estimating the Return On Investment/value of a keyword from the association data is discussed.
Reconstructing 3D trajectories of independently moving objects using generic constraints
Authors: Kemal Egemen Ozden, Kurt Cornelis, Luc Van Eycken, Luc Van Gool
Venue: Computer Vision and Image Understanding (2004)

The 3D reconstruction of scenes containing independently moving objects from uncalibrated monocular sequences still poses serious challenges. Even if the background and the moving objects are rigid, each reconstruction is only known up to a certain scale, which results in a one-parameter family of possible, relative trajectories per moving object with respect to the background. In order to determine a realistic solution from this family of possible trajectories, this paper proposes to exploit the increased linear coupling between camera and object translations that tends to appear at false scales. An independence criterion is formulated in the sense of true object and camera motions being minimally correlated. The increased coupling at false scales can also lead to the destruction of special properties such as planarity, periodicity, etc. of the true object motion. This provides us with a second, 'non-accidentalness' criterion for the selection of the correct motion among the one-parameter family.
High Level - Application Analysis Techniques & Architectures - To Explore Design possibilities for Reduced Reconfiguration Area Overheads in FPGAs executing Compute Intensive Applications
Authors: Dasu Aravind, Arvind Sudarsanam
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper proposes a novel common subgraph extraction algorithm which aims to minimize the total number of gates (reconfiguration area overhead) involved in implementing compute-intensive scientific and media applications using reconfigurable architectures. Motivation behind the proposed research is illustrated using an example from Biochemical Algorithms Library (BALL). The design of novel context adaptable architectures to implement common subgraphs is also proposed with an example from the video warping functions of the MPEG-4 standard. Three different models of mapping such architectures onto hybrid/pure FPGA systems are proposed. Estimates obtained by applying these techniques and architectures for various media and scientific functions are shown.
In This Issue
Authors: Garrett J. van Ryzin
Venue: Manufacturing Service Operations Management (2005)

A regular feature ofManufacturing & Service Operations Management, "In This Issue" briefly describes each issue's articles and highlights their contributions.
The Integrated Feasibility Experiment (IFE) process
Authors: J. Allen Sears, Stephen E. Cross
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper, we describe a process used for guiding the evaluation and transformation process for language processing research and development. The Integrated Feasibility Experiment process is explained by describing the key six steps, and then providing a specific example to help understand how to implement the steps.
Dirichlet-to-Neumann boundary conditions for multiple scattering problems
Authors: Marcus J. Grote, Christoph Kirsch
Venue: Journal of Computational Physics (2004)

A Dirichlet-to-Neumann (DtN) condition is derived for the numerical solution of time-harmonic multiple scattering problems, where the scatterer consists of several disjoint components. It is obtained by combining contributions from multiple purely outgoing wave fields. The DtN condition yields an exact non-reflecting boundary condition for the situation, where the computational domain and its exterior artificial boundary consist of several disjoint components. Because each sub-scatterer can be enclosed by a separate artificial boundary, the computational effort is greatly reduced and becomes independent of the relative distances between the different sub-domains. The DtN condition naturally fits into a variational formulation of the boundary-value problem for use with the finite element method. Moreover, it immediately yields as a by-product an exact formula for the far-field pattern of the scattered field. Numerical examples show that the DtN condition for multiple scattering is as accurate as the well-known DtN condition for single scattering problems [J. Comput. Phys. 82 (1989) 172; Numerical Methods for Problems in Infinite Domains, Elsevier, Amsterdam, 1992], while being more efficient due to the reduced size of the computational domain.
DA STANDARDS ACTIVITIES
Authors: Patrick M. Hefferan
Venue: ACM SIGDA Newsletter (1988)

Users of electronic design automation (EDA) systems often discover that their different tools don't talk to each other. Each tool has its own way of expressing design data and these ways are often incompatible.
Multichannel publication of interactive media documents in a news environment
Authors: Tom Beckers, Nico Oorts, Filip Hendrickx, Rik Van De Walle
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Multichannel publication of multimedia presentations poses a significant challenge on the generic description of the presentation content and the system necessary to convert these descriptions into final-form presentations. We present a solution based on the XiMPF document model and a component based system architecture.
Identifying and Exploiting Spatial Regularity in Data Memory References
Authors: Tushar Mohan, Bronis R. de Supinski, Sally A. McKee, Frank Mueller, Andy Yoo, Martin Schulz
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses forming streams can be targeted by optimizations such as prefetching, relocation, remapping, and vector loads. Undetected, they can be a significant source of memory stalls in loops. Existing stream-detection mechanisms either require special hardware, which may not gather statistics for subsequent analysis, or are limited to compile-time detection of array accesses in loops. Formally, little treatment has been accorded to the subject; the concept of locality fails to capture the existence of streams in a program's memory accesses. The contributions of this paper are as follows. First, we define spatial regularity as a means to discuss the presence and effects of streams. Second, we develop measures to quantify spatial regularity, and we design and implement an on-line, parallel algorithm to detect streams - and hence regularity - in running applications. Third, we use examples from real codes and common benchmarks to illustrate how derived stream statistics can be used to guide the application of profile-driven optimizations. Overall, we demonstrate the benefits of our novel regularity metric as an instrument to detect potential for code optimizations affecting memory performance.
A General Evaluation Framework for Topical Crawlers
Authors: P. Srinivasan, F. Menczer, G. Pant
Venue: Information Retrieval (2005)

Topical crawlers are becoming important tools to support applications such as specialized Web portals, online searching, and competitive intelligence. As the Web mining field matures, the disparate crawling strategies proposed in the literature will have to be evaluated and compared on common tasks through well-defined performance measures. This paper presents a general framework to evaluate topical crawlers. We identify a class of tasks that model crawling applications of different nature and difficulty. We then introduce a set of performance measures for fair comparative evaluations of crawlers along several dimensions including generalized notions of precision, recall, and efficiency that are appropriate and practical for the Web. The framework relies on independent relevance judgements compiled by human editors and available from public directories. Two sources of evidence are proposed to assess crawled pages, capturing different relevance criteria. Finally we introduce a set of topic characterizations to analyze the variability in crawling effectiveness across topics. The proposed evaluation framework synthesizes a number of methodologies in the topical crawlers literature and many lessons learned from several studies conducted by our group. The general framework is described in detail and then illustrated in practice by a case study that evaluates four public crawling algorithms. We found that the proposed framework is effective at evaluating, comparing, differentiating and interpreting the performance of the four crawlers. For example, we found the IS crawler to be most sensitive to the popularity of topics.
Strong branchwidth and local transversals
Authors: Zsolt Tuza
Venue: Discrete Applied Mathematics (2005)

We consider representations of chordal graphs as edge intersection graphs of subtrees in a tree of maximum vertex degree 3. A new graph invariant related to the concept of branchwidth is introduced, and a structural characterization theorem is given for the existence of representations where each edge is contained in fewer subtrees than the clique number of the graph represented. As a consequence, a sufficient condition is obtained for chordal graphs to have smaller branchwidth than clique number.
SRI International FASTUS system: MUC-4 test results and analysis
Authors: Douglas E. Appelt, John Bear, Jerry R. Hobbs, David Israel, Mabry Tyson
Venue: Proceedings of the 4th conference on Message understanding (1992)

The system that SRI used for the MUC-4 evaluation represents a significant departure from system architectures that have been employed in the past. In MUC-2 and MUC-3, SRI used the TACITUS text processing system [1], which was based on the DIALOGIC parser and grammar, and an abudctive reasoner for horn-clause logic. In MUC-4, SRI designed a new system called FASTUS (a permutation of the initial letters in Finite State Automata-based Text Understanding System) which we feel represents a significant advance in the state of the art of text processing. The system shares certain modules with the earlier TACITUS system, namely modules for text preprocessing and standardization, spelling correction, Hispanic name recognition, and the core lexicon. However, the DIALOGIC system and abductive reasoner, which were the heart and soul of the previous system, were replaced by a system whose architecture is based on cascaded finite-state automata. Using this system we were capable of achieving a significant level of performance on the MUC-4 task with less than one month devoted to domain-specific development. In addition, the system is extremely fast, and is capable of processing texts at the rate of approximately 3,200 words per minute, measured in CPU time on a Sun SPARC-2 processor. (Measured according to elapsed real time, the system about 50% slower, but the observed time depends on the particular hardware configuration involved.)
Optimal strong primes
Authors: R. Durán Díaz, J. Muñoz Masqué
Venue: Information Processing Letters (2005)

We clarify the notion of a strong prime by supplying a precise definition and a characterization for an optimal strong prime. We present a conjecture regarding the distribution and density of optimal strong primes, allowing one to predict in advance the time needed to compute one optimal strong prime of a given bit length. Based on these results, we develop an algorithm to compute optimal strong primes. Some experimental results are also included.
Resource allocation for handoffs in integrated wireless cellular networks
Authors: Wei Li, Hang Chen, Qing-An Zeng, Dharma P. Agrawal
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In this paper, we propose and analyze a handoff scheme with channel borrowing in integrated wireless mobile networks. The channels in each cell are divided into two parts and pre-allocated for real-time and non-real-time services. In order to increase the channel utilization, one type of service is allowed to borrow channels from the other under certain conditions. We take advantage of the delay insensitivity of non-real-time service calls by allowing real-time service calls to preempt non-real-time service calls. The proposed scheme maximizes the resource utilization while keeping certain quality of service (QoS) level for one type of service regardless of the traffic load of the other.