ppxscal/embedding_network huggingface dataset:
Finding Largest Empty Circles with Location Constraints
Authors: L. P Chew, Robert L. S Drysdale
Venue:  (1986)

Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Empty Circle (LEC) problem is the problem of finding the largest circle centered with CH(S) such that no point of S lies within the circle. Shamos and Hoey (SH75) outlined an algorithm for solving this problem in time O(n log n) by first computing the Voronoi diagram, V(S), in time O(n log n), then using V(S) and CH(S) to compute the largest empty circle in time O(n). In a recent paper [Tou83], Toussaint pointed out some problems with the algorithm as outlined by Shamos and presented an algorithm which, given V(S) and CH(S), solves the LEC problem in time O(n log n). In this note we show that Shamos'' original claim was correct: given V(S) and CH(S), the LEC problem can be solved in time O(n). More generally, given V(S) and a convex k-gon P, the LEC centered within P can be found in time O(k+n). We also improve on an algorithm given by Toussaint for computing the LEC when the center is constrained to lie within an arbitrary simple polygon. Given a set S of n points and an arbitrary simple k-gon P, the largest empty circle centered within P can be found in time O(kn + n log n). This becomes O(kn) if the Voronoi diagram of S is already given.
A Hippocampal Model of Visually Guided Navigation as Implemented by a Mobile Agent
Authors: Jean P. Banquet, Yves Burnod, Philippe Gaussier, Arnaud Revel
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Visually guided landmark navigation is based on space coding by hippocampal place cells (Pc)[2]. A biologically realistic architecture of cooperative-competitive associative networks (implemented as a control system for mobile agents) emulates place cell activity during local navigation (self and goal -localization, and route finding) in exploration and goal-retrieval paradigms. The system builds and stores panoramic views from landmarks and compares these views with current inputs. Mismatch induced low levels of recognition activity during exploration trigger a vigilance burst (by a mechanism inspired from septal modulation) which favors either the recognition of an alternative place category, or the creation of a new category. The sole implementation of visual ¿What¿ and ¿Where¿ information does not restrain the generality of the model since several modalities (proprioceptive and vestibular in particular) could cooperate to give rise to more robust place field spatial categories [5]. Providing the system with real visual inputs automatically extracted from a natural environment demonstrates that interspecies differences [6] in Pc coding (e.g. Pcs in rats vs. view cells in monkeys) result more from characteristics of the visual systems than from differences in Hs processing. Conversely, differences in Pc multiple codes within the same system result according to the model from different levels of processing and/or different degrees of multimodality. Each of these codes could be used within different navigational strategies a control system directly derived from the model allows a mobile agent to learn a few places in an environment, and their associated actions to perform in order to reach a goal. Generalization property of the model provides the capacity to join the goal from any place in the learned environment.
A General Purpose Simulation Environment for HDL Based Verification
Authors: Samir Rajadnya Samir Palnitkar
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

With designs becoming increasingly complex, creating simulation environment has become a very important part of the entire design cycle. The purpose of this paper is to describe a simulation environment which helps in reducing development time and making simulation environment more flexible. We study a novel method for creating simulation environment of a proprietary bus architecture (henceforth called PBA). After analyzing PBA architecture, we decided to have 50,000 transactions in order to cover all the possible test scenarios. Our task was to create 50,000 transactions as a part of PBA verification environment. We decided to create parametrized tests which can be reused. This method has helped us in reducing development time from six man months to approximately two man months. 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
Deformable Shape Detection and Description via Model-Based Region Grouping
Authors: Lifeng Liu, Stan Sclaroff
Venue:  (1998)

Abstract A method for deformable shape detection and recognition is described. Deformable shape templates are used to partition the image into a globally consistent interpretation, determined in part by the minimum description length principle. Statistical shape models enforce the prior probabilities on global, parametric deformations for each object class. Once trained, the system autonomously segments deformed shapes from the background, while not merging them with adjacent objects or shadows. The formulation can be used to group image regions based on any image homogeneity predicate; e.g., texture, color, or motion. The recovered shape models can be used directly in object recognition. Experiments with color imagery are reported. Note: This TR supercedes BUCS-TR-1997-019
Seismic response envelopes of a tank supported at the base
Authors: R. C. Barros
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Seismically excited thin metallic tanks, bottom supported and filled with liquid, are modeled by Sanders shell theory. The complete boundary value problem is solved taking into account fluid-structure interaction. The hydrodynamic pressures along the tank wall are expressed by a truncated series. The tank shell is also discretized in a finite number of ring elements. A software package was developed, that determines the tank responses for each real or synthetic earthquake. It was found out that 10-14 earthquakes are required for convergence of typical seismic responses of tanks, under tight relative error criteria. Pressure envelopes and generalized stresses and displacements envelopes are then determined, with which the strength stiffness and stability of the tank and the required freeboard could be ascertained.
An analysis of packet loss correlation in FEC-enhanced multicast trees
Authors: M. Mosko, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

We study group loss probabilities of forward error correction (FEC) codes in shared loss multicast communication. We present a new analysis model with explicit state equations using recursive formulae. Our method looks at an FEC group as a whole, rather than analyze the number of transmissions of a particular packet. Our work applies to C(n,k) erasure codes, where any k out of n packets may decode the entire group. We find the cumulative distribution function that all leaf nodes in a shared loss tree successfully decode a C(n,k) FEC group, the probability mass function (p.m.f.) for the number of leaf nodes that successfully decode a transmission group, the expected number of packets received on successful decode and the expected number of missing packets on decode failure for a particular leaf node of the multicast tree, the p.m.f. that all leaf nodes hold the same packets in common, and the expected height of packet loss. Most of our findings generalize to arbitrary trees with non-uniform link loss. Our results also apply to non-FEC trees. We illustrate applications of our work with examples.
Contribution to the Theory of Indexing
Authors: Gerard Salton, C. S. Yang, C. T. Yu
Venue:  (1973)

An attempt is made to characterize the usefulness of terms occurring in stored documents and user queries as a function of their frequency characteristics across the documents of a collection. It is found that the best terms are those having medium frequency in the collection and skewed frequency distributions. Correspondingly, terms exhibiting either very high or very low document frequency are not as useful. To improve the indexing vocabulary, it becomes necessary to group low frequency terms into classes, and to break up high frequency terms by forming phrases. An indexing theory is described based on term frequency considerations, and a new phrase generation method is introduced. The resulting improvements in the indexing vocabulary are evaluated.
Intelligent memory: "a parallel processing concept"
Authors: G. E. Quick
Venue: ACM SIGARCH Computer Architecture News (1979)

This paper puts forward a design for a computer system based on an array of "Single chip" microcomputers. The design supports the requirements of Highly Reliable Software for execution of parallel programs.
Mnemosyne: Designing and Implementing Network Short-Term Memory
Authors: Giovanni Vigna, Andrew Mitchell
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Network traffic logs play an important role in incidentanalysis. With the increasing throughput of networklinks, maintaining a complete log of all network activityhas become a task that requires an enormous amountof resources. We propose an approach to network monitoringthat mitigates the resource consumption problemwhile still providing effective support to evidence collectionand incident analysis. The approach relies on a tool,called MNEMOSYNE, that maintains a sliding window containingthe traffic that has been recently seen on a networklink. MNEMOSYNE provides improved logging features,such as multiple streams, support for cross-streamqueries, and dynamic remote reconfiguration. By integratingMNEMOSYNE with real-time intrusion detection capability,it is possible to provide incident analysis functionalityand effective evidence collection, without having tomaintain complete traffic logs. This paper describes theMNEMOSYNE tool, its architecture, and presents the resultsof the quantitative evaluation of its performance.Keywords: Network Security, Intrusion Detection, NetworkForensics, Incident Analysis
What Energy Functions can be Minimized via Graph Cuts?
Authors: Vladimir Kolmogorov, Ramin Zabih
Venue:  (2001)

Many problems in computer vision can be naturally phrased in terms of energy minimization. In the last few years researchers have developed a powerful class of energy minimization methods based on graph cuts. These techniques construct a specialized graph, such that the minimum cut on the graph also minimizes the energy. The minimum cut in turn is efficiently computed by max flow algorithms. Such methods have been successfully applied to a number of important vision problems, including image restoration, motion, stereo, voxel occupancy and medical imaging. However, each graph construction to date has been highly specific for a particular energy function. In this paper we address a much broader problem, by characterizing the class of energy functions that can be minimized by graph cuts, and by giving a general-purpose construction that minimizes any energy function in this class. Our results generalize several previous vision algorithms based on graph cuts, and also show how to minimize an interesting new class of energy functions.
Remembrance of Data Passed: A Study of Disk Sanitization Practices
Authors: Simson L. Garfinkel, Abhi Shelat
Venue: IEEE Security and Privacy (2003)

Many discarded hard drives contain information that is both confidential and recoverable, as the authors' own experiment shows. The availability of this information is little publicized, but awareness of it will surely spread.
Visual Augmented Memory (VAM)
Authors: Jonny Farringdon, Vanessa Oni
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Augmented Memory is widely regarded as a key wearable computing application. Retrieval cues are effective means for improving memory recall. The Visual Augmented Memory (VAM) application is a fully automated wearable implementation for the identification, storage, and subsequent retrieval and presentation of visual memory cues based upon face recognition.
Transformed Component Analysis: Joint Estimation of Spatial Transformations and Image Components
Authors: Brendan J. Frey, Nebojsa Jojic
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A simple, effective way to model images is to represent each input pattern by a linear combination of "component" vectors, where the amplitudes of the vectors are modulated to match the input. This approach includes principal component analysis, independent component analysis and factor analysis. In practice, images are subjected to randomly selected transformations of a known nature, such as translation and rotation. Direct use of the above methods will lead to severely blurred components that tend to ignore the more interesting and useful structure. In previous work, we introduced a clustering algorithm that is invariant to transformations [1].In this paper, we propose a method called transformed component analysis, which incorporates a discrete, hidden variable that accounts for transformations and uses the expectation maximization algorithm to jointly extract components and normalize for transformations. We illustrate the algorithm using a shading problem, facial expression modeling and written digit recognition.
Pump Laser Induced Net Angular Momentum: Orbital Angular Polarisability, Induced Electric Polarization, and the Inverse Faraday Effect
Authors: M. W. Evans
Venue:  (1990)

The conjugate product pi of the oscillating electric field strengths of a pump laser imparts net, time independent, orbital angular momentum (J) to an atom or molecule through a quantity, **s, which is defined as atomic or molecular electronic orbital angular polarisability. This is shown to be responsible for net electric polarisation in chiral ensembles (a new effect) and magnetization in achiral and chiral ensembles (the inverse Faraday effect). Using a Nd:YAG pump laser, with an electric field strength of up to 10**9 volts m**-1; the former is shown to be a strong effect in chiral ensembles, one which can be amplified still further by resonance with a probe laser in the visible/ultra violet. This is discussed in the context of P violation in achiral ensembles.
GEO2DIS evaluation report
Authors: B. Bouvier, R. Havas, P. Hayot, Roberto Della Maggiore, A. Musone, P. Mogorovich, S. Riedhammer, U. Rugani, M. Trevisani
Venue:  (1997)

The geographical data, both raster (satellite images, aerial photographs, scanned maps, ...) and vector (DCW, IGN products like BDTopo and BDCarto, ...) are growing up exponentially in amount, complexity and variety. Need of geographical data are growing in the same way among governmental and local autorithies and commercial and industrial operators for various applications like urban planning, environment monitoring, civil engineering project impact studies and communication networks design . Therefore, potential users have a ever increasing need of services provided by responsive organisations (data distributors) using efficient tools for acquiring geographical data, i.e. identifying, locating, selecting, purchasing and retrieving it. The ESPRIT III project n°8017 GEographical Object Oriented heterogeneous Data Information Server (GEO2DIS) was born out of this need for efficient tools for geographical data acquisition. It was entrusted to a Consortium whose partners are MATRA SYSTEMES & INFORMATION from France. DORNIER from Germany and INTECS from Italy, with associated partners : IGN, O2 Technology, CNUCE-CNR, Region Toscana and the municipality of Pisa. Project goals were the definition of consolidated user requirements at the European level, the definition of a common architecture of the geographical data server and the validation of the concept and of the architecture through three applications. The project has designed, implemented and validated a system based on two types of stations the data distributor station and the data user station, connected through LAN or WAN. The data user station allows users to submit queries to the catalogue and to define and issue a request for data and to receive them using powerful MMI, where the footprint of the data are located on a Reference Background. This MMI is customisable to the user''s needs. The data distributor station answers to the requests of the data user station and offers the services of managing the catalogue and the data. managing the For the description of the heterogeneous geographical data sets a common data model has been defined as an object class. For GDS (and GDS descriptions) request, the Geographical Object Query Language (GeOQL, extension of the OQL (Object Query Language), which is part of the standard ODMG 93. This architecture allows to build the system on various GIS or DBMS, according to the operational requirements of the data distributor. It was actually implemented on the GIS Arc-Info and the OODBMS O2 which has been fitted with a spatial indexing module giving responses times divided by ten compared with previous tools. The system has been validated by three users using it for acquiring data for three very different applications : Assessment of the Visual Impact of a sport and leisure centre in Deulemont (France), monitoring of the land use, suitability analysis for an waste disposal site near Pisa. The innovation and benefits of the system are that, even now, no other
The Adjacency Matrix and Spectrum of a Graph with Negative Third Largest Eigenvalue
Authors: Dreyer Paul A., Yong Xuerong
Venue:  (1999)

Let $G$ be a simple connected graph with $n$ vertices, let $\lambda_i(G)$ be the $i$th largest eigenvalue of $G$. This paper provides the following results: 1. If $\lambda_3(G)>0$, then the adjacency matrix of $G$, $A(G)$ is cogredient to the matrix: where $a_{ij}=1$ iff $i\ne j$ and $a_{ij}=0$ otherwise, and $$l_1+l_2+\ldots+l_k\le l.$$ Furthermore, if there exists an index $i$ such that $l_i < 1$, then $ G $ has the eigenvalue $-1$ with multiplicity at least $n-2r-1$, where $2r$ is the rank of $A(G^c)$. 2. $\lambda_3(G)>0 $ implies that $ \lambda_j(G)\ge -1$, $j=3,4,\ldots,n-r $, where $2r$ is the rank of the adjacency matrix of the complement of $G$, $2r \le n-1$.
Interactive Problem Solving via Algorithm Visualization
Authors: Denis Lalanne, Pearl Pu
Venue: Proceedings of the IEEE Symposium on Information Vizualization 2000 (2000)

COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasible solutions. Two algorithm visualization techniques, Kaleidoscope and Lattice, and one visualization of n-dimensional data, MAP, are used to externalize the machine's problem solving strategies and the tradeoffs as a result of using these strategies. After a short training period, users are able to discover tactics to explore design space effectively, evaluate new design solutions, and learn important relationships among design criteria, search speed, and solution quality. We thus propose that visualization can serve as a tool for interactive intelligence, i.e., human-machine collaboration for solving complex problems.
Power series, Bieberbach conjecture and the de Branges and Weinstein functions
Authors: Wolfram Koepf
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

It is well-known that de Branges' original proof of the Bieberbach and Milin conjectures on the coefficients $a_n$ of univalent functions $f(z)=Σk=1^infty a_nz^n$ of the unit disk as well as Weinstein's later proof deal with the same special function system that de Branges had introduced in his work.These hypergeometric polynomials had been already studied by Askey and Gasper who had realized their positiveness. This fact was the essential tool in de Branges' proof.In this article, we show that many identities, e.g. the representation of their generating function w.r.t. $n$, for these polynomials, which are intimately related to the Koebe function $K(z)=Σk=1^infty αz^n$ and therefore to univalent functions, can be automatically detected from power series computations by a method developed by the author and accessible in several computer algebra systems.In other words, in this paper a new and interesting application of the FPS (Formal Power Series) algorithm is given. As working engine we use a Maple implementation by Dominik Gruntz and the author. In particular, the hypergeometric representation of both the de Branges and the mboxWeinstein functions are determined by successive power series computations from their generating functions.The new idea behind this algorithm is the observation that hypergeometric function coefficients of double series can be automatically detected by an iteration of the FPS procedure.In a final section we show how algebraic computation enables the fast verification of Askey-Gasper's positivity results for specific (not too large) $n$ using Sturm sequences or similar approaches.
Using AVL Trees for Fault Tolerant Group Key Management
Authors: Ohad Rodeh, Kenneth Birman, Danny Dolev
Venue:  (2000)

In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously used for managing keys in large IP-multicast groups. The standard protocol requires a centralized key-server that has knowledge of the full key-graph. Our protocol does not delegate this role to any one process. Rather, members enlist in a collaborative effort to create the group key-graph. The key-graph contains n keys, of which each member learns log_2n. We show how to balance the key-graph, a result that is applicable to the centralized protocol. We also show how to optimize our distributed protocol and provide a performance study of its capabilities.
COPS A Mechanism for Computer Protection
Authors: Gregory R. Andrews
Venue:  (1974)

A computer protection mechanism is a set of tools for controlling the actions of computations and safeguarding stored information. This paper describes a new mechanism, COPS, which is a kernel of data structures, primitive operations, and a monitor and is used to specify and enforce the capabilities of actors (processes and procedures). COPS can be used to implement a variety of security policies and systems and to enhance software reliability. Its tools are sufficient to solve problems in the areas of isolation, controlled sharing, restricted access, mutually suspicious interaction, and confinement. Key Words and phrases: protection, kernel, operating system, security, access control. 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
Application of Genetic Algorithm for Optimization Gasoline Fractions Blending Compounding
Authors: Vladimir I. Litvinenko, J. A. Burgher, Vadim S. Vyshemirskij, Nadeshda A. Sokolova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The paper deals with application of genetic algorithm for solution of the task of gasoline fractions blending compounding keeping given conditions on octane numbers and amount of given types of commodity gasolines. The principle of coding solutions is described. Several results of experiments on determination of genetic algorithm effective configuration are given.
An Informal Description of Russell
Authors: Hans Boehm, Alan J. Demers, James E. Donahue
Venue:  (1980)

NO SUPPLIED