ppxscal/embedding_network huggingface dataset:
EasyTransport: An Effective Navigation and Transportation Guide for Wide Geographic Areas
Authors: Maria Fragouli, Alex Delis
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In this paper, we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective paths. The tool's underlying algorithm is based on theBreadth-First-Search (BFS) algorithm and traces dynamically feasible routes on a terrain. Our rationale is to reduce the number of nodes representing the possible points for a transition and thus the complexity of EasyTransport's operation. Since our algorithm functions with increasingly coarse geographic granularities, it can achieve its successful termination fast. We, furthermore, suggest heuristics that effectively manage the potentially enormous data setsin the geographic areas involved. EasyTransport, is a highly interactive system that allows for easy querying and features flexible adaptation and presentation of the generated answers, ensures short response times, and offers useful getting-around-and-how guidelines.
Dependability Analysis of a Client/Server Software System with Rejuvenation
Authors: Hiroyuki Okamura, Satoshi Miyahara, Tadashi Dohi
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Long running software systems are known to experiencean aging phenomenon called software aging, one in whichthe accumulation of errors during the execution of softwareleads to performance degradation and eventually results infailure. To counteract this phenomenon an active fault managementapproach, called software rejuvenation, is particularlyuseful. It essentially involves gracefully terminatingan application or a system and restarting it in a clean internalstate.In this paper, we deal with dependability analysis ofa client/server software system with rejuvenation. Threedependability measures in the server process, steady-stateavailability, loss probability of requests and mean responsetime on tasks, are derived from the well-known hiddenMarkovian analysis under the time-based software rejuvenationscheme. In numerical examples, we investigate thesensitivity of some model parameters to the dependabilitymeasures.
Linux for Windows Administrators (Mark Minasi Windows Administrator Library Series), 1 edition
Authors: Mark Minasi, Dan York
Venue:  (2002)

:There was a time when people asked, "Windows or Linux?" Now it's a question of how to make the most of both. Linux for Windows Administrators is an essential resource for anyone working in the real world of enterprise computing. Inside, renowned Windows expert Mark Minasi and Linux guru Dan York give you practical, in-depth Linux instruction that dovetails perfectly with what you already know about Windows. It's the best way for you to give your organization the best of both worlds.
Completing the spectrum of r-orthogonal Latin squares
Authors: L. Zhu, Hantao Zhang
Venue: Discrete Mathematics (2003)

Two Latin squares of order n are r-orthogonal if their superposition produces exactly r distinct pairs. It has been proved by Belyavskaya, Colbourn and the present authors that for all n ≥ 7, r-orthogonal Latin squares of order n exist if and only if n ≤ r ≤ n2 and r ∉ {n + 1, n2 -1} with the possible exception of n = 14 and r = n2 - 3. In this paper, we first construct a self-orthogonal Latin square of order 14 which contains certain subarrays. Then we use this square to obtain a pair of (142 - 3)-orthogonal Latin squares of order 14, determining the spectrum completely.
Viewing construction scheduling as a constraint satisfaction problem
Authors: P. Lorterapong, T. Rattanadamrongagsorn
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Construction scheduling ranks among the largest and most complex problems faced by project managers. Generating and maintaining a valid schedule in such an environment requires the full recognition for both, the existence and interactions of project entities such as activities, resources, objectives, and constraints. In real-life projects, the number of these entities are diversified and numerous. This paper addresses the construction scheduling problem from the perspective of artificial intelligence. An AI-based technique called "Constraint Satisfaction Problem (CSP)" is examined for its suitability in this domain. Principles of CSP are first presented. A step-wise procedure for scheduling and resource allocation using CSP is discussed. A numerical example is worked out to demonstrate practicality of CSP.
Eulerian-Lagrangian Localized Adjoint Methods for Convection-Diffusion Equations and Their Convergence Analysis
Authors: Hong Wang, Richard E. Ewing, Thomas F. Russell
Venue:  (1994)

We develop and analyze Eulerian-Lagrangian localized adjoint methods (ELLAM) for convection-diffusion problems. The formulation uses space-time finite elements, with edges oriented along Lagrangian flow paths, in a time-marching scheme, where space-time test functions are chosen to satisfy a local adjoint condition. This allows Eulerian-Lagrangian concepts to be applied in a systematic mass-conservative manner to problems with general boundary conditions. In one space dimension with constant velocity, all combinations of inflow and outflow Dirichlet, Neumann, or flux boundary conditions are carefully considered, compared and discussed based on both analysis and numerical experiments. In some cases, the discrete unknowns include influxes, outfluxes, or resolution of the outflowing solution finer than the time-step size. Optimal-order error estimates in all cases and some superconvergence results are obtained. Numerical results show the strong potential of these methods and verify the theoretical estimates. Implementations for variable-coefficient problems in one and multiple space dimensions, considered in detail elsewhere, are outlined.
Powerful and Feasible Processor Interconnections With an Evaluation of Their Communications Capabilities
Authors: Qian Wang, Sotirios G. Ziavras
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Scalable networks with very good topological properties are often impossible to build because of their prohibitively high wiring complexity. Such a network is the generalized hypercube (GH). It supports full-connectivity of all its nodes in each dimension and is characterized by outstanding topological properties. We propose a new class of scalable interprocessor connections, namely HOWs (Highly-Overlapping Windows), capable of lower complexity than GHs and comparable performance. HOWs are obtained from GHs by removing edges to produce systems of lower wiring complexity. They contain numerous highly-overlapping GHs of smaller size. The classical GH belongs to this new class of interconnections. We demonstrate that 2-D HOWs perform much better than binary hypercubes for important communications patterns.
Modeling of genetic algorithms with a finite population
Authors: Cees H.M. Kemenade
Venue:  (1997)

Cross-competition between non-overlapping building blocks can strongly influence the performance of evolutionary algorithms. The choice of the selection scheme can have a strong influence on the performance of a genetic algorithm. This paper describes a number of different genetic algorithms, all involving elitism. Infinite population models are presented for each of these algorithms. A problem involving cross-competition is introduced and we show how we can make use of equivalence-classes to make an efficient tracing of the transmission-function models possible on this type of problems. By adding a small extension to the models it is possible to predict the qualitative behavior of finite population genetic algorithms on this type of problems also. Using this model the reliability of the different genetic algorithms and the influence of population sizing on the reliability is investigated.
Clipping Distortion and Chromatic Dispersion Limitations for 1550 nm Video Trunking Systems
Authors: A. F. Elrefaie, C. Lin
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The 1550 nm video trunking system limitations due to the combined effects of transmitter clipping distortion, fiber chromatic dispersion and accumulated noise from EDFA cascades have been evaluated using computer simulation techniques. The results suggest that the allowable transmission distance for 50 digital channels (256 QAM or 16 VSB) is only 5km of conventional single-mode fiber for directly modulated 1550 nm systems. The allowable transmission distance for the same number of channels increases to about IOOOkm for 1550 nm externally modulated systems without any dispersion compensation techniques.
Recovery of Software Design, State-Machines, and Specifications from Source Code
Authors: N. Pywes, P. Rehmet
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

While the end objective of the process described in this paper is recovery of software design, state-machines and specifications from source code, these capabilities depend on analysis and documentation of source code which are useful in themselves for software understanding. The paper therefore explains first the software analysis and construction of a software documentation database. It then follows with discussion of recovery of state machines and specifications. The focus in explaining the analysis of source code is in particular on the following. First, the recovery of design becomes significant when applied to large scale software. The source code may be in a large number of files which are analyzed sequentially. A database is constructed, where the code in each file is also used to update previously processed files. Second, the software understanding, as well as the state machines and specifications are based on discovery of a hierarchical software architecture that supports systematic software browsing and generation of state machines and specifications of respective components. The architecture discovery process must be human-guided through input of appropriate parameters that control the selection of software components based on including desired functions, critical operations and sizes. Finally, the state machines or specifications entities tend to be very voluminous. Depending on their intended use, their number can be reduced under user control.
Image classification using hybrid neural networks
Authors: Chih-Fong Tsai, Ken McGarry, John Tait
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Use of semantic content is one of the major issues which needs to be addressed for improving image retrieval effectiveness. We present a new approach to classify images based on the combination of image processing techniques and hybrid neural networks. Multiple keywords are assigned to an image to represent its main contents, i.e. semantic content. Images are divided into a number of regions and colour and texture features are extracted. The first classifier, a self-organising map (SOM) clusters similar images based on the extracted features. Then, regions of the representative images of these clusters were labeled and used to train the second classifier, composed of several support vector machines (SVMs). Initial experiments on the accuracy of keyword assignment for a small vocabulary are reported.
XQuery from the Experts: A Guide to the W3C XML Query Language
Authors: Howard Katz, Don Chamberlin, Michael Kay, Philip Wadler, Denise Draper
Venue:  (2003)

:With the proliferation of XML among corporate IT departments, academic research institutions, and programming operations everywhere, there is a growing need for an XML search and transformation standard with more functionality than Google or XSLT.Enter XQuery. Backed by the full weight of the World Wide Web Consortium (W3C), XQuery is being extremely well received by the IT community worldwide. XQuery, unlike its predecessors, has the versatility to manipulate both XML and non-XML data and provides a valuable connection between the world of XML and relational databases.In XQuery from the Experts, select members of the W3C's XML Query working group come together to discuss every facet of XQuery. From Jonathan Robie's introductory "XQuery: A Guided Tour" to Mary Fernandez's "Discussion of Formal Semantics," XQuery is revealed in a way that both novice programmers and industry experts can appreciate.Edited by long-time XML expert and programmer Howard Katz, coverage ranges from strictly technical chapters to historical essays such as Michael Kay's "XQuery and XSLT," which explores the common ancestry of both languages, and Don Chamberlin's "Influences on the Design of XQuery," which details the process behind XQuery's design. Key coverage includes: Denise Draper on "Mapping Between XML and Relational Data"Michael Rys exploring "Integrating XQuery and Relational Database Systems"Jim Tivy's analysis of "A Native XML DBMS"Phil Wadler, Jerome Simeon, and Mary Fernandez presenting "Static Typing in XQuery"Information presented in both a tutorial and a reference framework for use by XML professionals of anylevelFor IT managers, professionals, programmers, or anyone involved with XML, XQuery from the Experts is an invaluable resource.
Projecting the Performance of Decision Support Workloads on Systems with Smart Storage (SmartSTOR)
Authors: Windsor W. Hsu, Honesty C. Young, Alan Jay Smith
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Recent developments in both hardware and software have made it worthwhile to consider embedding intelligence in storage to handle general purpose processing that can be offloaded from the hosts. In particular, low-cost processing power is now widely available and software can be made robust, secure and mobile. In this paper, we propose a general Smart Storage (SmartSTOR) architecture in which a processing unit that is coupled to one or more disks can be used to perform such offloaded processing. A major part of the paper is devoted to understanding the performance potential of the SmartSTOR architecture for decision support workloads. Our analysis suggests that there is a definite performance advantage in using fewer but more powerful processors, a result that bolsters the case for sharing a powerful processor among multiple disks. As for software architecture, we find that the offloading of database operations that involve only a single relation is not very promising. In order to achieve significant speedup, we have to consider the offloading of multiple-relation operations. In general, if embedding intelligence in storage is an inevitable architectural trend, we have to focus on developing parallel software systems that can effectively take advantage of the large number of processing units that will be in the system.
VSIA Quality Metrics for IP and SoC
Authors: Charlene C. Johnson
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

A Study Group of the Virtual Socket Interface Alliance has produced a comprehensive approach to measuring IP and SoC quality. A highly usable tool, the Quality Evaluation Spreadsheet (QES) was developed with a large set of quality attributes, metrics for each attribute, and a user importance (weight) for each attribute. The metrics are designed for rapid assessment by the IP provider and the IP integrator. The spreadsheet can be extended and tailored for individual company and SoC application. The QES can be used by an IP provider for:A simple checklist of quality factors & metricsIndividual IP quality evaluationAs an input to IP Integrators for evaluation. The QES can be used by the IP Integrator/customer for:evaluation of a single IP orcomparison of IP from several IP providers, orfor a whole SoC.
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation
Authors: Chi-Hsiang Yeh, Behrooz Parhami
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumption is made about the availability of a complete submesh or subtorus. Based on ARTs, a very wide variety of problems, including sorting, FFT, total exchange, permutation, and some matrix operations, can be solved with a slowdown factor of 1 +o(1). The number of faults tolerated by ARTs ranges from o(\min(n^{1-\frac{n}{d},\frac{n}{h})) for n-ary d-cubes with worst-case faults to as large as o(N) for most N-node 2-D meshes or tori with random faults, where h is the number of data otems per processor. The resultant running times are the best results reported thus far for solving many problems on faulty arrays. Based on ARTs and several other components such as robust libraries, the priority emulation discipline, and X1Y1 routing, we introduce the robust adaptation interface layer (RAIL) as a middleware between ordinary algorithms/programs (that are originally developed for fault-free arrays) and the faulty network/hardware. In effect, RAIL provides a virtual fault-free network to higher layers, while ordinary algorithms/programs are transformed through RAIL into corresponding robust algorithms/programs that can run on faulty networks.
Producer-Push - A Protocol Enhancement to Page-Based Software Distributed Shared Memory Systems
Authors: Sven Karlsson, Mats Brorsson
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper describes a technique called producer-push that enhances the performance of a page-based software distributed shared memory system. Shared data, in software DSM systems, must normally be requested from the node that produced the latest value. Producer-push utilizes the execution history to predict this communication so that the data is pushed to the consumer before it is requested. In contrast to previously proposed mechanisms to proactively send data to where it is needed, producer-push uses information about the source code location of communication to more accurately predict the needed communication.Producer-push requires no source code modifications of the application and it effectively reduces the latency of shared memory accesses. This is confirmed by our performance evaluation which shows that the average time to wait for memory updates is reduced by 74%. Producer-push also changes the communication pattern of an application making it more suitable for modern networks. The latter is a result of a 44% reduction of the average number of messages and an enlargement of the average message size by 65%.
On the Number of Small Cuts in a Graph
Authors: Monika R Henzinger, David Williamson
Venue:  (1995)

We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\frac{3}{2}$ the size of the minimum cut.
Dynamic Timing Analysis Considering Power Supply Noise Effects
Authors: Yi-Min Jiang, Angela Krstic, Kwang-Ting (Tim) Cheng
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Power supply noise can significantly impact the performance of deep submicron designs. Existing timing analysis techniques cannot capture the effects of power supply noise on the signal/cell delays. This is because these delay effects are highly input pattern dependent. Therefore, the predicted circuit performance might not reflect the worst-case circuit delay. In this paper, we propose a dynamic timing analysis technique that can take into account the impact of the power supply noise on the signal/cell propagation delays. Our technique is based on considering the input patterns that produce the worst-case power supply noise effects on the propagation delays of the longest true paths in the circuit. Our experimental results show that the circuit delay predicted by our dynamic timing analysis method is significantly longer than the delay predicted using traditional timing analysis tools.
Bit-Width Selection for Data-Path Implementations
Authors: Carlos Carreras, Juan A. López, Octavio Nieto-Taladriz
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine the bit-widths of the resources required for a data-path implementation. In this paper, we present a novel approach based on interval computations that provides, not only guaranteed range estimates that take into account dependencies between variables, but estimates of their probability density functions that can be used when some truncation must be performed due to constraints in the specification. Results show that interval-based estimates are obtained in reasonable times and are more accurate than those provided by independent range computation, thus leading to substantial reductions in area and latency of the corresponding data-path implementation.
A Parallel Randomized Approximation Scheme for Shortest Paths
Authors: Philip N. Klein
Venue:  (1991)

We give a randomized parallel algorithm for approximate shortest-path computation in an undirected weighted graph. The algorithm is based on a technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first search.
Design of a Wearable Tactile Display
Authors: Francine Gemperle, Nathan Ota, Dan Siewiorek
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Tactile displays are a viable way for people to interact with wearable computers. Human tactile perception is robust. A variety of shrinking tactile stimulator (tactor) technologies are available. Tactile displays are uniquely appropriate for wearable applications because of their close proximity to our 20 square feet of touch receptors: our skin. Tactile displays can solve issues of intrusive computers and multiple demands on user visual and audio attention. They are discreet and seamlessly integrate with most human activity. Tactile displays will neither conflict with nor replace audio and visual display but rather support information on these other displays and fill in the gaps where necessary. This paper presents our work in optimizing the design of a tactile display and discusses some of the issues and opportunities surrounding tactile displays for wearable computers. Additionally, we hope to inspire more work in this area.