ppxscal/embedding_network huggingface dataset:
On the Complexity of Shattering Using Arrangements
Authors: Robert Freimer, Joseph S. B. Mitchell, Christine Piatko
Venue:  (1991)

A subdivision $\cal S$ of $\Re^{d}$ is said to shatter a set of objects if each object is contained within the closure of its own cell of $\cal S$. In this paper, we examine the problem of shattering a set of bounded polyhedral objects in $\Re^{d}$ by a subdivision formed by an arrangement of hyperplanes. We show for $\Re^{d}, d \geq$ 2 that finding a minimum-cardinality set of hyperplanes whose arrangement shatters a set of points is NP-Complete. We then give algorithms to find a linear-size set of shattering hyperplanes for a set of $n$ bounded polyhedral objects in $\Re^{d}$, if one exists. For $d=2$, we provide two algorithms with worst-case time complexities $O(E+N$log$N+n^{2}$log$n$) and $O(E+N$log$N+C$log$n+nC^{.695})$, where $E$ is the size of the visibility graph of the objects, $N$ is the total number of vertices, and $C$ is the number of candidate lines considered (at worst min\{$E,n^2$\}). Our final algorithm has worst-case time complexity $O(N^{d+1})$ for $d \geq 3$.
Metronaut: A Wearable Computer with Sensing and Global Communication Capabilities
Authors: Asim Smailagic, Richard Martin
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Metronaut is a novel wearable computer which captures information, senses position, provides wide range communications, consumes less than one watt of power, and weighs less than one pound. Metronaut employs a bar code reader for information input and position location, a two-way pager for communications, and an ARM processor for computation. Metronaut's application is schedule negotiation and guidance instructions for a visitor to the CMU campus. The visitor's position is determined from reading bar codes at information signs around campus. Modifications to the schedule are negotiated using the two-way pager for communications with the campus computing infrastructure. Metronaut is alternatively powered by a mechanical flywheel converting kinetic energy to electrical energy.
Minimax Optimization of Investment Portfolio by Quantile Criterion
Authors: A. R. Pankov, E. N. Platonov, K. V. Semenikhin
Venue: Automation and Remote Control (2003)

Optimization of a single-step investment strategy by a quantile criterion (VaR) is studied. The a priori information on the distribution law for the vector of effective financial instruments is defined by certain constraints on the first- and second-order moments. The concept of a minimax investment strategy is formulated, and the strategy is constructed using the convex programming duality theory. For a set of admissible strategies defined by constraints in the form of linear equalities and inequalities, the minimax strategy is constructed with the help of an analytical dependence on the solution of the dual problem. The existence and uniqueness of the minimax quantile strategy are studied. A computation procedure for solving the dual problem is described. Results of a numerical modeling experiment are given.
A Cell ID Assignment Scheme and Its Applications
Authors: Jingyuan Zhang
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Location management is one of the most important issues in the design of future cellular systems. It consists of two basic operations, location update and paging. The paging operation is dependent on the corresponding location update operation. The time-based, movement-based, and distance-based location update schemes are three of the most popular dynamic location update schemes. It has been shown that the distance-based scheme is more efficient than the movement-based. However, the distance between two cells is difficult to obtain. In this paper, we have proposed a coordinate system, which can be used to systematically assign IDs to the cells in a cellular system. With this cell ID assignment scheme, the distance between any two cells can be computed easily. Based on our distance computation scheme, a speed adaptive location update scheme has been presented. It has been shown that our speed adaptive location update scheme is a generalization of both time-based and distance-based schemes.
GATE: An Environment to SupportResearch and Development in Natural Language Engineering
Authors: Robert Gaizauskas, Hamish Cunningham, Yorick Wilks, Peter Rodgers, Kevin Humphreys
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We describe a software environment to support research and development in natural language (NL) engineering. This environment - GATE (General Architecture for Text Engineering) - aims to advance research in the area of machine processing of natural languages by providing a software infrastructure on top of which heterogeneous NL component modules may be evaluated and refined individually or may be combined into larger application systems. Thus, GATE aims to support both researchers and developers working on component technologies (e.g. parsing, tagging, morphological analysis) and those working on developing end-user applications (e.g. information extraction, text summarization, document generation, machine translation, and second language learning). GATE will promote reuse of component technology, permit specialization and collaboration in large-scale projects, and allow for the comparison and evaluation of alternative technologies. The first release of GATE is now available.
A Trace-Scaling Agent for Parallel Application Tracing
Authors: Felix Freitag, Jordi Caubet, Jesus Labarta
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Tracing and performance analysis tools are an important component in the development of high performance applications. Tracing parallel programs with current tracing tools, however,easily leads to large trace files with hundreds of Megabytes. The storage, visualization, and analysis of such trace files is often difficult.We propose a trace-scaling agent for tracing parallel applications, which learns the application behavior in runtime and achieves a small, easy to handle trade. The agent dynamically identifies the amount of information needed to capture the application behavior. This knowledge acquired at runtime allows recording only the non-iterative trace iriformation, which drastically reduces the size of the trace file.
Embryonics: electronic stem cells
Authors: Lucian Prodan, Gianluca Tempesti, Daniel Mange, André Stauffer
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Embryonics is a long-term research project attempting to draw inspiration from the biological process of ontogeny, to implement novel digital computing machines endowed with better fault-tolerant capabilities. This article discusses the degree of bio-inspiration attained while also attempting to start a similarity debate on various implementation decisions, on why and how nature developed its subtle, intricated means of growing, healing and reproducing.
AMD64 opteron: first look
Authors: Michael Baxter
Venue: Linux Journal (2003)

Discover the new architecture that's backward-compatible with the x86 and has IBM, Cadence and others already offering products.
A Method for Imaging Corrosion Damage in Thin Plates from Electrostatic Data
Authors: Peter G. Kaup, Fadil Santosa, Michael Vogelius
Venue:  (1995)

The problem of quantitative nondestructive evaluation of corrosion in plates is considered. The inpection method uses boundary measurements of currents and voltages to determine the material loss caused by corrosion. The development of the method is based on linearization and the assumption that the plate is thin. The behavior of the method is examined in numerical situations. Keywords: nondestructive evaluation, corrosion monitoring, electrical impedance tomography, numerical reconstruction methods
Higher Order Statistical Learning for Vehicle Detection in Images
Authors: A. N. Rajagopalan, Philippe Burlina, Rama Chellappa
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The paper describes a scheme for detecting vehicles in images. The proposed method approximately models the unknown distribution of the images of vehicles by learning higher order statistics (HOS) information of the `vehicle class' from sample images. Given a test image, statistical information about the background is learnt `on the y'. An HOS-based decision measure then classifies test patterns as vehicles or otherwise.When tested on real images of aerial views of vehicular activity, the method gives good results even on complicated scenes. It does not require any a priori information about the site. However, it is amenable to augmentation with contextual information. The method can serve as an important step towards building an automated roadway monitoring system.
An investigation of application level performance in ATM networks
Authors: I. Cidon, R. Guérin, A. Khamisy
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The goal of the paper is to investigate the relation that exists between the performance guarantees provided by a network, and what users of the network ultimately get. The focus is on the relation that exists between packet losses in a network, and message loses experienced by the application. This investigation is carried out in the context of an ATM network where network packets are of fixed size (cells), and the authors concentrate mostly on the impact of the application peak transmission rate. Varying this parameter for a given source while keeping network cell losses constant can translate into significant variation in the loss probability of application messages. In the paper, the authors develop and solve an analytical model to evaluate this behavior, and a set of guidelines that applications can use to determine which performance guarantees to require from the network to erasure an appropriate level of service.
Accommodating logical logging under fuzzy checkpointing in main memory databases
Authors: Seungkyoon Woo, Myoung Ho Kim, Yoon Joon Lee
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

This paper presents a simple and effective method to reduce the size of log data for recovery in main memory databases. Fuzzy checkpointing is known to be very efficient in main memory databases due to asynchronous backup activities. By this feature, most recovery works in the past have used only physical logging schemes. Since the size of physical log records is quite large, physical logging schemes cause the recovery time to be much longer than that using logical logging schemes. We propose a hybrid logging method that can accommodate logical logging under fuzzy checkpointing. This method significantly decreases the size of log data, and hence speeds up the recovery time. We also propose a reapplying rule in segmented MMDB, which reduces the number of log records for recovery. We evaluate the performance of the proposed methods through analytic analyses. The results show that we can reduce the size of log data to more than half, compared with those that use only physical logging.
On the Decidability of Process Equivalences for the pi-calculus
Authors: Mads Dam
Venue:  (1994)

We present general results for showing process equivalences applied to the finite control fragment of the pi-calculus decidable. Firstly a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these results lead to decidability for a number of pi-calculus equivalences such as strong or weak, late or early bismulation equivalence. Furthermore, for strong late equivalence we show how our techniques can be used to adapt the well-known Paige-Tarjan algorithm. Strikingly this results in a single exponential running time not much worse than the running time for the case of for instance CCS. Our results considerably strengthens previous results on decidable equivalences for parameter-passing process calculi.
Predicting Indexer Performance in a Distributed Digital Library
Authors: Naomi Dushay, James C. French, Carl Lagoze
Venue:  (1999)

Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search engines. This paper focuses on search engine performance as a criterion for search engine selection and defines two measurements of search engine performance: availability will the search engine respond within a time limit and response time how quickly will the search engine respond, given that it responds at all. We predicted both of these performance characteristics with a variety of algorithms, all of which required little computation time and combined past performance data for each search engine into a succinct record. We used operational data from the NCSTRL distributed digital library to make and evaluate predictions, and we found that simple prediction methods performed as well as more complex methods and that prediction accuracy was closely related to data consistency.
Protecting BGP Routes to Top Level DNS Servers
Authors: Lan Wang, Xiaoliang Zhao, Dan Pei, Randy Bush, Daniel Massey, Allison Mankin, S. Felix Wu, Lixia Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The Domain Name System (DNS) is an essential part ofthe Internet infrastructure and provides fundamental services,such as translating host names into IP addresses forInternet communication. The DNS is vulnerable to a numberof potential faults and attacks. In particular, false routingannouncements can deny access to the DNS service orredirect DNS queries to a malicious impostor. Due to thehierarchical DNS design, a single fault or attack againstthe routes to any of the top level DNS servers can disruptInternet services to millions of users. In this paper we proposea path-filtering approach to protect the routes to thecritical top level DNS servers. Our approach exploits thehigh degree of redundancy in top level DNS servers andalso exploits the observation that popular destinations, includingtop level DNS servers, are well connected via stableroutes. Our path-filter restricts the potential top levelDNS server route changes to be within a set of establishedpaths. Heuristics derived from routing operations are usedto adjust the potential routes over time. We tested our path-filteringdesign against BGP routing logs and the resultsshow that the design can effectively ensure correct routes totop level DNS servers without impacting DNS service availability.
Autonomous Data Consistency Technique through Fair Evaluation among Heterogeneous Systems
Authors: Isao Kaji, Shohei Kato, Kinji Mori
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

By integrating heterogeneous systems with different individual requirements, it becomes possible for application systems to use the various data generated in the heterogeneous systems. Integrated systems also make it possible to process the applications from different points of view and to obtain higher assurance levels. The important requirements for the integration of application systems are not to halt the entire systems, not to violate individual system missions and to derive a synergetic effect. The Autonomous Decentralized System (ADS), by its on-line property, enables the integration of systems without stopping any system and without violating any system's mission. To collect consistent data combinations from different systems, each subsystem needs to determine the combination independently and autonomously. This paper proposes a new concept, the data alliance, to determine consistent data combination from heterogeneous systems. In addition, the fairness must be maintained between the subsystems to achieve the consistency to satisfy the nature of the Autonomous Coordinability. This paper defines the fairness among systems in terms of the cost of the data freshness and the alliance waiting time. The data freshness value expresses the degree of how recent the data combination is for the subsystem, and the alliance waiting time expresses how long the subsystem must wait to get agreement among cooperating applications. The last part of the paper shows by simulation that the proposed technique is effective in different system topologies.
The Overlay of Lower Envelopes and its Applications
Authors: K P Agarwal, Otfried Schwarzkopf, Micha Sharir
Venue:  (1994)

Let $F$ and $G$ be two collections of a total of $n$ bivariate algebraic functions of constant maximum degree. The minimization diagrams of $F$, $G$ are the planar maps obtained by the $xy$-projections of the lower envelopes of $F$, $G$, respectively. We show that the combinatorial complexity of the overlay of the minimization diagrams of $F$ and of $G$ is $O(n^{2+\varepsilon})$, for any $\varepsilon<0$. This result has several applications: (i) a near-quadratic upper bound on the complexity of the region in 3-space enclosed between the lower envelope of one such collection of functions and the upper envelope of another collection; (ii) an efficient and simple divide-and-conquer algorithm for constructing lower envelopesein three dimensions; and (iii) a near-quadratic upper bound on the complexity of the space of all plane transversals of a collection of simply-shaped convex sets in three dimensions.
Context Sensing with the Twiddler Keyboard
Authors: Daniel Ashbrook
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Context sensitivity is an important application of wearable computers. This paper describes research on using the Twiddler one-handed keyboard for sensing motion-associated context. Two possible methods for detecting walking are described, and other types of movement context that it might be possible to sense are discussed. Results of early experiments with a preliminary Twiddler driver modification are discussed.
Relaxed mltiplication using the middle product
Authors: Joris van der Hoeven
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. In this paper, we present a new relaxed multiplication algorithm for the resolution of linear equations. The algorithm has the same asymptotic time complexity as our previous algorithms, but we improve the space overhead in the divide and conquer model and the constant factor in the F.F.T. model.
Information retrieval, imaging and probabilistic logic
Authors: Fabrizio Sebastiani
Venue:  (1998)

Imaging is a class of non-Bayesian methods for the revision of probability density functions originally proposed as a semantics for conditional logic. Two of these revision functions, Standard Imaging and General Imaging, have successfully been applied to modelling information retrieval by Crestani and van Rijsbergen. Due to the problematic nature of a ``direct'''' implementation of Imaging revision functions, in this paper we propose their alternative implementation by representing the semantic structure that underlies Imaging-based conditional logics in the language of a probabilistic (Bayesian) logic. Recasting these models of information retrieval in such a general purpose knowledge representation and reasoning tool, besides showing the potential of this ``Bayesian'''' tool for the representation of non-Bayesian revision functions, paves the way to a possible integration of these models with other more KR-oriented models of IR, and to the exploitation of general-purpose domain-knowledge. TEL:: +39.050.593407 EMAIL:: fabrizio@iei.pi.cnr.it
SCNN solver for finite element analysis with neural network elements
Authors: S. Li
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper presents a structure controllable multi-layer forward neural network (SCNN) to solve liner equations and eigenvalues/eigenvectors of matrix in element stiffness simulation (ESS) approach. The stiffness matrix in ESS approach contains elements of neural network, and is usually not positive and symmetry. Therefore the conjunctive gradient method, which we applied before, is not always applicable. By using the SCNN solver, precision of present results increases dramatically comparing to the previous and is almost the same as traditional FEM analysis. Additionally, eigenvalues and eigenvectors of structure can be solved by the SCNN in ESS approach. Efficiency of the SCNN solver is demonstrated in the example. We believe the SCNN is a significant solver for ESS approach.
Solving the SoC Test Scheduling Problem Using Network Flow and Reconfigurable Wrappers
Authors: Sandeep Koranne
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Test scheduling for core-based SoCs is a challengingproblem. Test schedules must be crafted with the objectivesof minimizing testing time and ATE vector memory requirements,to reduce test cost, under the constraints of totalavailable test access mechanism (TAM) width. Prior researchin test scheduling has mainly used search procedureslike ILP and rectangle packing to solve this problem, butthese approaches are inherently computationally expensive.In this paper we describe a novel algorithm to solve the testscheduling problem using a combination of network flowalgorithms, malleable job scheduling and reconfigurablewrapper design. Our approximation algorithm has polynomialtime complexity and produces schedules close to thetheoretical lower bound. Extensive experimental results usingthe new ITC'02 SoC benchmarks validate the quality ofour solutions.
A Practical Protocol for Advantage Distillation and Information Reconciliation
Authors: Shengli Liu, Henk C. A. Van Tilborg, Marten Van Dijk
Venue: Designs, Codes and Cryptography (2003)

Information-theoretic secret key agreement generally consists of three phases, namely, advantage distillation information reconciliation and privacy amplification. Advantage distillation is needed in the case when two legitimate users, Alice and Bob, start in a situation which is inferior to that of the adversary Eve. The aim for them is to gain advantage over Eve in terms of mutual information between each other. Information reconciliation enables Alice and Bob to arrive at a common string by error correction techniques. Finally they distill a highly secret string from the common string in the privacy amplification phase. For the scenario where Alice and Bob as well as Eve have access to the output of a binary symmetric source by means of (three) binary symmetric channels, there are several advantage distillation and information reconciliation protocols proposed. &emsp;In this paper, we present a general protocol to implement both advantage distillation and information reconciliation. Simulation results are compared with known protocols. A connection between our protocol and the known protocols is given.