ppxscal/embedding_network huggingface dataset:
Towards maintaining consistency of spatial databases
Authors: Alia I. Abdelmoty, Chris B. Jones
Venue: Proceedings of the sixth international conference on Information and knowledge management (1997)

This paper focuses on the consistency issues related to integrating multiple sets of spatial data in spatial information systems such as Geographic Information Systems (GISs). Data sets to be integrated are assumed to hold information about the same geographic features which can be drawn from different sources at different times, which may vary in reliability and accuracy, and which may vary in the scale of presentation resulting in possible multiple spatial representations for these features. A systematic approach is proposed which relies first on breaking down the consistency issue by identifying a range of consistency classes which can be checked in isolation. These classes are a representative set of properties and relationships which can completely identify the geographic objects in the data sets. Different levels of consistency are then proposed, namely, total, partial and conditional, which can be checked for every consistency class. This provides the flexibility for two data sets to be integrated without necessarily being totally consistent in every aspect. The second step of the proposed approach is to explicitly represent the different classes and levels of consistency in the system. As an example, a simple structure which stores adjacency relationships is given which can be used for the explicit representation of topological consistency. The paper also proposes that the set of consistent knowledge in the data sets (which is mostly qualitative) be explicitly represented in the database and that uncertainty or ambiguity inherent in the knowledge be represented as well.
Learning and Revising User Profiles: The Identification ofInteresting Web Sites
Authors: Michael Pazzani, Daniel Billsus
Venue: Machine Learning (1997)

We discuss algorithms for learning and revising user profiles that can determine which World Wide Web sites on a given topic would be interesting to a user. We describe the use of a naive Bayesian classifier for this task, and demonstrate that it can incrementally learn profiles from user feedback on the interestingness of Web sites. Furthermore, the Bayesian classifier may easily be extended to revise user provided profiles. In an experimental evaluation we compare the Bayesian classifier to computationally more intensive alternatives, and show that it performs at least as well as these approaches throughout a range of different domains. In addition, we empirically analyze the effects of providing the classifier with background knowledge in form of user defined profiles and examine the use of lexical knowledge for feature selection. We find that both approaches can substantially increase the prediction accuracy.
All-to-All Broadcasting in Faulty Hypercubes
Authors: Seungjin Park, Bella Bose
Venue: IEEE Transactions on Computers (1997)

A new fault-tolerant all-to-all broadcasting algorithm in an n-dimensional hypercube with up to $\left\lfloor {{\textstyle{n \over 2}}} \right\rfloor$ faulty links is given. An extension of this algorithm that can tolerate up to $\left\lfloor {{\textstyle{n \over 2}}} \right\rfloor$ faulty nodes is also described. These algorithms assume a multiport I/O model, meaning each node can send and receive messages from all its adjacent nodes simultaneously. The total time steps taken by the proposed algorithms are near optimal, and they produce a factor of n less traffic than previously known algorithms.
A hybrid simulation-queueing module for modeling UNIX I/O in performance analysis
Authors: Barry L. Nelson, William S. Keezer, Thomas F. Schuppe
Venue: Proceedings of the 28th conference on Winter simulation (1996)

LEXIS-NEXIS frequently develops simulation models to estimate the computer system capacity required to deliver on-line information services. The load imposed by Unix Input/Output (I/O) processes is a key factor in many of these models. However, the I/O processes themselves are seldom of interest, and explicitly modeling them results in simulations executing much slower than real time. This paper presents a hybrid simulation-queueing module that can be inserted into any simulation to accurately model I/O resource consumption and queueing delays without explicitly modeling each individual I/O process. This module is in use at LEXIS-NEXIS to day (LEXIS and NEXIS are registered trademarks of Reed-Elsevier Properties, Inc., and are used under license).
A systematic approach to factory layout and design with FactoryPLAN, FactoryOPT, and FactoryFLOW
Authors: David P. Sly
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Since the finished quality of every layout project depends on a successful combination of products, processes and tools, it is essential to select each of these carefully. A good project will always begin with an analysis of the production volumes of the products with common process sequences and tool requirements in order to create manufacturing families. For each of these families you can select the "best manufacturing practices" that need to be used and re-engineer the processes and tooling to fit the desired throughput and inventory requirements. Only after you know the desired manufacturing practices to be used for each product family is it appropriate to begin developing layouts around a systematic flow and non-flow evaluation process. This systematic approach to layout design combines with Factory PLAN/OPT and FLOW software tools working in AutoCAD to create the most efficient factory designs in record time.
A Cyclic Reduction Approach to the Numerical Solution of Boundary Value ODEs
Authors: Pierluigi Amodio, Marcin Paprzycki
Venue: SIAM Journal on Scientific Computing (1997)

A parallel algorithm for solving linear systems that arise from the discretization of boundary value ODEs is described. It is a modification of a cyclic reduction algorithm that takes advantage of the almost block diagonal structure of the linear system. A stable modification of the original algorithm is also proposed. Numerical results on a distributed memory parallel computer with 32 processors are presented and discussed.
Versions and change notification in an object-oriented database system
Authors: Hong-Tai Chou, Won Kim
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

At MCC we have built a prototype object-oriented database system, called ORION to support applications from the CAD/CAM, AI, and OIS domains. Advanced functions supported in ORION include versions, change notification, composite objects, dynamic schema evolution, and multimedia data. The versions and change notification features were based on the model we developed earlier in [CHOU86]. In this paper, we show how we have integrated our model of versions and change notification into the ORION object-oriented data model, and also provide an insight into system overhead that versions and change notification incur.
Automatic assignment of soft Boolean operators
Authors: Gerard Salton, Ellen Voorhees
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

The conventional bibliographic retrieval systems are based on Boolean query formulations and inverted file implementations. Such systems provide rapid responses in answer to search queries but they are not easy to use by uninitiated patrons. An extended Boolean retrieval strategy has been devised in which the Boolean operators are treated more or less strictly, depending on the setting of a special parameter, known as the p-value. The extended system is much more forgiving than the conventional system, and provides better retrieval effectiveness. In this study various problems associated with the determination of appropriate p-values are discussed, and suggestions are made for an automatic assignment of p-values. Evaluation output is included to illustrate the operations of the suggested procedures.
The Continuous Interpolating Self-organizing Map
Authors: J. Göppert, W. Rosentiel
Venue: Neural Processing Letters (1997)

The self-organizing map (SOM) [5] provides a general data approximation method which is suitable for several application domains. The topology preservation is an important feature in data-analysis and may also be advantageous for the evaluation of the data in a function approximation or regression task. For this reason the interpolated self-organizing map (I-SOM) adds an output layer to the SOM architecture which computes a real valued output vector. This paper presents an extension of I-SOM towards a continuous interpolation. It is compared to RBF and to the parametrized self-organizing map.
Multiscale Algorithm for Atmospheric Data Assimilation
Authors: Achi Brandt, Leonid Yu. Zaslavsky
Venue: SIAM Journal on Scientific Computing (1997)

We propose a novel multiscale algorithm for the problem of model assimilation of data. The algorithm allows one to efficiently perform optimal statistical interpolation of observed data from a given forecast wf and vector of observations wo. The core of the new approach is a combination of two multiscale tools: a multiresolution iterative process and a multigrid fast-summation technique. Our approach allows efficient computations related to global filtering and interpolation of the observations, particularly between data-rich and data-sparse areas. In this paper, we describe an iterative process based on a multiresolution simultaneous displacement technique and a localized variational calculation of iteration parameters. We explain how this process can be efficiently combined with the multigrid fast-summation procedure.
A cluster-based approach for routing in dynamic networks
Authors: P. Krishna, N. H. Vaidya, M. Chatterjee, D. K. Pradhan
Venue: ACM SIGCOMM Computer Communication Review (1997)

The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks. Most conventional protocols exhibit their least desirable behavior for highly dynamic interconnection topologies. We propose a new methodology for routing and topology information maintenance in dynamic networks. The basic idea behind the protocol is to divide the graph into a number of overlapping clusters. A change in the network topology corresponds to a change in cluster membership. We present algorithms for creation of clusters, as well as algorithms to maintain them in the presence of various network events. Compared to existing and conventional routing protocols, the proposed cluster-based approach incurs lower overhead during topology updates and also has quicker reconvergence. The effectiveness of this approach also lies in the fact that existing routing protocols can be directly applied to the network --- replacing the nodes by clusters.
Some Inequalities for Norms of Commutators
Authors: Rajendra Bhatia, Fuad Kittaneh
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

Let $A, B$ be positive operators and let $f$ be any operator monotone function. We obtain inequalities for $|||f(A)X - Xf(B)|||$ in terms of $|||f\left(|AX - XB| \right) |||$ for every unitarily invariant norm. The case $X = I$ was considered by T. Ando [Math. Z., 197 (1988), pp. 403--409], and some of our results reduce to his results in this special case. Some related inequalities are obtained.
Ensemble polling strategies for increased paging capacity in mobile communication networks
Authors: Christopher Rose, Roy Yates
Venue: Wireless Networks (1997)

The process of finding a unit in a mobile communications system is called paging and requires the use of limited network resources. Although it is understood how to minimize the use of network resources and satisfy delay constraints when paging a single unit, optimal policies for paging multiple units are difficult to derive. Here we adapt single unit polling methods to obtain simple ensemble polling schemes for use with multiple units which can greatly increase the rate at which page requests can be processed while maintaining acceptable average delay.
A Collaborative Schema Integration System
Authors: P. Beynon-Davies, L. Bonde, D. McPhee, C. B. Jones
Venue: Computer Supported Cooperative Work (1997)

Conceptual modelling as applied to database development can be described as a two stage process: schema modelling followed by schema integration. Schema modelling is the process of transforming individual user requirements into a conceptual schema: an implementation-independent map of data requirements. Schema integration is the process of combining individual conceptual schemas into a single, unified schema. Single-user tools for schema modelling have enjoyed much success partly because the process of schema modelling has become relatively well formalised. Although a number of formal approaches to conducting schema integration have been proposed, it appears that schema integration tools have not enjoyed the same level of success. This we attribute not so much to the problem of formalisation but to the inherent collaborative nature of schema integration work. This paper first discusses the importance of collaboration to schema integration work. It then describes SISIBIS, a demonstrator system employing the IBIS (Issue Based Information System) scheme to support collaborative database design.
A Layer-by-Layer Least Squares based Recurrent Networks Training Algorithm: Stalling and Escape
Authors: Siu-Yeung Cho, Tommy W. S. Chow
Venue: Neural Processing Letters (1998)

The limitations of the least squares based training algorithm is dominated by stalling problem and evaluation error by transformation matrix to obtain an unacceptable solution. This paper presents a new approach for the recurrent networks training algorithm based upon the Layer-by-Layer Least Squares based algorithm to overcome the aforementioned problems. In accordance with our proposed algorithm, all the weights are evaluated by the least squares method without the evaluation of transformation matrix to speed up the rate of convergence. A probabilistic mechanism, based upon the modified weights updated equations, is introduced to eliminate the stalling problem experienced by the pure least squares type computation. As a result, the merits of the proposed algorithm are capable of providing an ability of escaping from local minima to obtain a good optimal solution and still maintaining the characteristic of fast convergence.
On the Puiseux Series Expansion of the Limit Discount Equation of Stochastic Games
Authors: W. W. Szczechla, S. A. Connell, J. A. Filar, O. J. Vrieze
Venue: SIAM Journal on Control and Optimization (1997)

In this paper we give a new proof of the existence of Puiseux series expansion of the limit discount equation of finite state stochastic games. Unlike the original proof, due to Bewley and Kohlberg [ Math. Oper. Res., 3 (1976), pp. 197--208], our proof is not algebraic and does not invoke Tarski's principle. Instead we use only the theory of functions of complex variables and complex analytic varieties.
Business process modeling with SIMPROCESS
Authors: Maya Binun
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper gives an overview of business process modeling with SIMPROCESS, its applications, unique features, basic and advanced modeling constructs, and benefits. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Hierarchical partitioning for field-programmable systems
Authors: Vi Chi Chan, David Lewis
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents a new recursive bipartitioning algorithm for a hierarchical field-programmable system. It draws new insights into relating the quality of the bipartitioning algorithm to circuit structures by the use of the partitioning tree (Hagen et al., 1994). The final algorithm proposed not only forms the basis for the partitioning solution of a 1-million gate field programmable system (Lewis et al., 1997) but can also be applied to general VLSI or multiple-FPGA partitioning problems.
A Computer Vision Method for DeterminingLength of Cheese Shreds
Authors: H. Ni, S. Gunasekaran
Venue: Artificial Intelligence Review (1998)

A computer-vision based system was used to obtain images of shredded cheese. The images were processed by morphological transformation algorithms such as dilation and erosion to smooth the image edge contours. The smoothed image was skeletonized. Cheese shred lengths were determined from skeletonized images using syntactic methods. This method was successful in recognizing individual shreds even when shreds were touching or overlapping. Shred lengths calculated from the processed images compared very well with those measured manually.
Performance Modeling of System Architectures
Authors: Fred Rose, John Shackleton, Carl Hein
Venue: Journal of VLSI Signal Processing Systems (1997)

Performance modeling of network architectures has been an integral part of network systems design for decades. As signal processing system architectures become more and more complex, models of computational performance are becoming an important part of the architectural design process. This paper will describe performance modeling, both in general, and within the context of the RASSP system design process.
Compiling standard ML to Java bytecodes
Authors: Nick Benton, Andrew Kennedy, George Russell
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

MLJ compiles SML'97 into verifier-compliant Java byte-codes. Its features include type-checked interlanguage working extensions which allow ML and Java code to call each other, automatic recompilation management, compact compiled code and runtime performance which, using a 'just in time' compiling Java virtual machine, usually exceeds that of existing specialised bytecode interpreters for ML. Notable features of the compiler itself include whole-program optimisation based on rewriting, compilation of polymorphism by specialisation, a novel monadic intermediate language which expresses effect information in the type system and some interesting data representation choices.
The power and performance of Proof Animation
Authors: James O. Henriksen
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The Proof Animation/supTM/ 3.x product family provides tools for animating a vast array of applications. There are versions of Proof Animation to meet any need, from small and mid-sized projects to large scale applications. The Proof product family runs on readily available, inexpensive PC hardware. Proof is ASCII-file-driven and features a general-purpose design. Its vector-based geometry provides a large animation canvas with the ability to zoom in or out while maintaining crisp, clear images. Proof's features include post-processing for maximum performance, built-in drawing tools and CAD import/export for ease of creating animation layouts, dynamic bar graphs and plots for displaying statistics, multiple-window display, and a unique presentation making capability. Proof's open architecture makes it ideally suited for serving as an animation engine for models written in a wide variety of simulation and programming languages. Proof s superior power and performance assures smooth, realistic motion for animations regardless of their size, complexity, or application.
Encoding types in ML-like languages
Authors: Zhe Yang
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

A Hindley-Milner type system such as ML's seems to prohibit type-indexed values, i.e., functions that map a family of types to a family of values. Such functions generally perform case analysis on the input types and return values of possibly different types. The goal of our work is to demonstrate how to program with type-indexed values within a Hindley-Milner type system.Our first approach is to interpret an input type as its corresponding value, recursively. This solution is type-safe, in the sense that the ML type system statically prevents any mismatch between the input type and function arguments that depend on this type.Such specific type interpretations, however, prevent us from combining different type-indexed values that share the same type. To meet this objection, we focus on finding a value-independent type encoding that can be shared by different functions. We propose and compare two solutions. One requires first-class and higher-order polymorphism, and, thus, is not implementable in the core language of ML, but it can be programmed using higher-order functors in Standard ML of New Jersey. Its usage, however, is clumsy. The other approach uses embedding/projection functions. It appears to be more practical.We demonstrate the usefulness of type-indexed values through examples including type-directed partial evaluation, C printf-like formatting, and subtype coercions. Finally, we discuss the tradeoffs between our approach and some other solutions based on more expressive typing disciplines.
Theoretical measure in P/Q document spaces
Authors: Robert R. Korfhage
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

Early work on the application of user interest profiles to aid in the interpretation of queries in an information retrieval system developed the concepts of retrieval subspaces that are either ellipsoids or Cassini ovals. This report extends the theoretical basis of these models, exploring other models and the effect of different metrics on the conceptual retrieval subspace.
Timing of Multi-Gigahertz Rapid Single Flux Quantum Digital Circuits
Authors: Kris Gaj, Eby G. Friedman, Marc J. Feldman
Venue: Journal of VLSI Signal Processing Systems (1997)

Rapid Single Flux Quantum (RSFQ) logic is a digital circuit technology based on superconductors that has emerged as a possible alternative to advanced semiconductor technologies for large scale ultra-high speed, very low power digital applications. Timing of RSFQ circuits at frequencies of tens to hundreds of gigahertz is a challenging and still unresolved problem. Despite the many fundamental differences between RSFQ and semi- conductor logic at the device and at the circuit level, timing of large scale digital circuits in both technologies is principally governed by the same rules and constraints. Therefore, RSFQ offers a new perspective on the timing of ultra-high speed digital circuits.This paper is intended as a comprehensive review of RSFQ timing, from the viewpoint of the principles, concepts, and language developed for semiconductor VLSI. It includes RSFQ clocking schemes, both synchronous and asynchronous, which have been adapted from semiconductor design methodologies as well as those developed specifically for RSFQ logic. The primary features of these synchronization schemes, including timing equations, are presented and compared.In many circuit topologies of current medium to large scale RSFQ circuits, single-phase synchronous clocking outperforms asynchronous schemes in speed, device/area overhead, and simplicity of the design procedure. Synchronous clocking of RSFQ circuits at multigigahertz frequencies requires the application of non-standard design techniques such as pipelined clocking and intentional non-zero clock skew. Even with these techniques, there exist difficulties which arise from the deleterious effects of process variations on circuit yield and performance. As a result, alternative synchronization techniques, including but not limited to asynchronous timing, should be considered for certain circuit topologies. A synchronous two-phase clocking scheme for RSFQ circuits of arbitrary complexity is introduced, which for critical circuit topologies offers advantages over previous synchronous and asynchronous schemes.