ppxscal/embedding_network huggingface dataset:
Natural language database query project: General Motors Research Laboratories
Authors: Carole Hafner
Venue: Issue 79 (January 1982) (1982)

Project Goals: a. Developing small-scale solutions to current problems in NL understanding (e.g., anaphora). b. Incorporating these solutions into a NL database query system. c. Performing "human factors" experiments to evaluate various database interfaces, including NL interfaces. d. Modelling the relationship between database structures and natural language semantics.
Orchestrating supply chain interactions using emerging process description languages and business rules
Authors: Claire Costello, Owen Molloy
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Business processes are significant assets to an organization; they are the fundamental ways in which it achieves its goals. To respond to changes in today's fast moving environment, companies need software that will enable them to restructure their processes to align with business objectives. Business Process Management (BPM) allows companies to manage process lifecycles. To sustain competitive advantage in today's fast moving economy, companies need corporate visibility. With a Business Process Management System (BPMS), key individuals will be able to see into the heart of their company's operations, tweaking processes when necessary. In the context of supply chains, companies can monitor their contributions to a more global process. A BPMS utilizes the technology infrastructures currently available to create and deploy processes throughout the enterprise and leverages data, process, and integration standards to ensure interoperability. Rules and rule engines are becoming increasingly important to BPMS software. The business rule approach decouples business logic encoded as business rules from the applications in an organization. A flexible rule-based system allows companies change rules quickly to keep in tune with changing business policies. XESS is an XML based Expert System Shell that creates and downloads rules to XESS Inference Engines deployed throughout a business scenario. It is a flexible, intelligent middleware built using open standards and Java technologies.
Belief in Information Flow
Authors: Michael R. Clarkson, Andrew C. Myers, Fred B. Schneider
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Information leakage traditionally has been defined to occur when uncertainty about secret data is reduced. This uncertainty-based approach is inadequate for measuring information flow when an attacker is making assumptions about secret inputs and these assumptions might be incorrect; such attacker beliefs are an unavoidable aspect of any satisfactory definition of leakage. To reason about information flow based on beliefs, a model is developed that describes how attacker beliefs change due to the attackerýs observation of the execution of a probabilistic (or deterministic) program. The model leads to a new metric for quantitative information flow that measures accuracy rather than uncertainty of beliefs.
Aspects pattern oriented architecture for distributed adaptive mobile applications
Authors: Dimitar Birov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Adaptive applications behave differently, according to changes on the environment. Aspect oriented programming (AOP) propose approach of implementation of adaptability of a software through special form of concern composition. In this paper we discuss how aspect-oriented approach facilitates the design of distributed adaptive wireless applications and propose integrated software architecture framework based on known (aspect) design patterns architecture building approach, proposed framework allows to achieve appropriate level of middleware transparency, consistency, flexibility, maintainability, and modifiability of application.
Operational specification with joint actions: serializable databases
Authors: Reino Kurki-Suonio
Venue: Distributed Computing (1992)

Joint actions are introduced as a language basis for operational specification of reactive systems. Joint action systems are closed systems with no communication primitives. Their nondeterministic execution model is based on multi-party actions without an explicit control flow, and they are amenable for stepwise derivation by superposition. The approach is demonstrated by deriving a specification for serializable databases in simple derivation steps. Two different implementation strategies are imposed on this as further derivations. One of the strategies is two-phase locking, for which a separate implementation is given and proved correct. The other is multiversion timestamp ordering, for which the derivation itself is an implementation.
A Hybrid Approach for a Constrained Routing Problem
Authors: Jesus Fabian Lopez Perez
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Regarding the solution of combinatorics problems, is important to evaluate the cost and the benefit among obtaining solutions of high quality in detriment of the computational resources required. The problem presented here is about the routing of a vehicle with pickup and delivery of product with time window constraints. This problem requires to be attended with instances of great scale (nodes¿100). We have a large quantity of nodes with restrictions of time windows (¿90 %) and with a large factor of amplitude (¿75%) as well. The problem is NP-hard and for such motive the application of an exact method of solution to resolve it, is limited by the practical time for routing. This paper proposes a specialized genetic algorithm, which offers solutions of good quality in computational times that do useful its application.
ICE: an iterative combinatorial exchange
Authors: David C. Parkes, Ruggiero Cavallo, Nick Elprin, Adam Juda, Sébastien Lahaie, Benjamin Lubin, Loizos Michael, Jeffrey Shneidman, Hassan Sultan
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive for CEs. Bidders specify lower and upper bounds on their value for different trades. These bounds allow price discovery and useful preference elicitation in early rounds, and allow termination with an efficient trade despite partial information on bidder valuations. All computation in the exchange is carefully optimized to exploit the structure of the bid-trees and to avoid enumerating trades. A proxied interpretation of a revealed-preference activity rule ensures progress across rounds. A VCG-based payment scheme that has been shown to mitigate opportunities for bargaining and strategic behavior is used to determine final payments. The exchange is fully implemented and in a validation phase.
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
Authors: Sunil Nakrani, Craig Tovey
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Internet centers host services for e-banks, e-auctions and other clients. Hosting centers then must allocate servers among clients to maximize revenue. The limited number of servers, costs of reallocating servers, and unpredictability of requests make server allocation optimization difficultBased on the many similarities between server and honey bee colony forager allocation, we pro pose a new decentralized honey bee algorithm which dynamically allocates servers to satisfy request loads. We compare it against an omniscient optimality algorithm, a conventional greedy algorithm, and an algorithm that computes omnisciently the optimal static allocation. We evaluate performance on simulated request streams and commercial trace dataOur algorithm performs better than static or greedy for highly variable request loads, but greedy can outperform it under low variability. Honey bee forager allocation, though suboptimal for static food sources, may possess a counterbalancing responsiveness to food source variability.
Simulating particles in Stokes flow
Authors: Thomas Götz
Venue: Journal of Computational and Applied Mathematics (2005)

We consider low-Reynolds number flow past an ensemble of particles. The singularity method is applied to represent the flow field. The strength and positions of the poles of the fundamental solution are obtained by minimizing the L2-error in the boundary conditions. Numerical simulations are carried out for ensembles of spheres immersed in a uniform or shear flow to illustrate the applicability and accuracy of the method.
PIM lite: a multithreaded processor-in-memory prototype
Authors: Shyamkumar Thoziyoor, Jay Brockman, Daniel Rinzler
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

PIM Lite is a processor-in-memory prototype implemented in a 0.18 micron logic process. PIM Lite provides a complete working demonstration of a minimal-state, lightweight multithreaded processor with low-overhead thread swapping. Minimizing processor state by keeping thread state in memory and using a regular, tiled and memory-centric design greatly simplified VLSI development and testing.
Survey of natural language processing
Authors: Graeme Ritchie
Venue: Issue 80 (April 1982) (1982)

The project is an attempt to develop a general linguistic frame-work for writing processing grammars for English (both for parsing and for generating). the techniques used are drawn from both linguistics and AI, but the motivation is largely that of theoretical linguistics - describing how sentence-understanding (and production) works, with the most general, adequate rules possible. The project is a continuation of a line of research which the investigator began some years ago.
eParticipative process learning: process-oriented experience management and conflict solving
Authors: Björn Decker, Jörg Rech, Klaus-Dieter Althoff, Andreas Klotz, Edda Leopold, Angie Voss
Venue: Data Knowledge Engineering (2005)

The indiGo project offers a solution for tackling resistance against and problems while executing process models: eParticipative Process Learning. Via moderated, web-based discussions, consensus about a process is created and process models are reviewed to achieve better understandability or other quality aspects. Furthermore, problems during the execution of a process are solved collaboratively and captured as lessons learned to facilitate upcoming process executions. In this paper, we present the method and technical infrastructure to support eParticipative Process Learning. To show that eParticipative Process Learning leads to improved and accepted process models, three case studies are described.
Timing the Application of Security Patches for Optimal Uptime
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Security vulnerabilities are discovered, become publicly known, get exploited by attackers, and patches come out. When should one apply security patches? Patch too soon, and you may suffer from instability induced by bugs in the patches. Patch too late, and you get hacked by attackers exploiting the vulnerability. We explore the factors affecting when it is best to apply security patches, providing both mathematical models of the factors affecting when to patch, and collecting empirical data to give the model practical value. We conclude with a model that we hope will help provide a formal foundation for when the practitioner should apply security updates.
The behavior of the solutions of periodic linear neutral delay difference equations
Authors: Ch. G. Philos, I. K. Purnaras
Venue: Journal of Computational and Applied Mathematics (2005)

Some new asymptotic, nonoscillation and stability criteria for linear neutral delay difference equations with periodic coefficients and constant delays are given. The results are obtained via a positive root (with suitable properties) of an associated equation which is, in a sense, the corresponding characteristic equation.
MAPIS: A Mobile Amphibian Population Information System
Authors: Lei Zhu, Lei He, Alex Collier
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In recent years, amphibian populations in many parts of the world have experienced an apparent widespread, yet poorly understood decline. One of the obstacles comes from the difficulties in rapidly collecting and analyzing amphibian population data from the field sites. In this paper, we will investigate how to apply wireless network and mobile computing technologies to build a Mobile Amphibian Population Information System (MAPIS). This system will not only enhance communication between field biologists in different locations, but also speed on-site data entry and analysis. Thus, the field biologists can optimize collection efforts and better exploit narrow windows of ecologically relevant population behaviors.
Recursive bisection placement: feng shui 5.0 implementation details
Authors: Ameya R. Agnihotri, Satoshi Ono, Patrick H. Madden
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, we summarize circuit placement techniques and algorithms developed by the BLAC CAD research group; these have been integrated into our recursive bisection based placement tool feng shui. We also briefly describe current research interests.
Mediators over taxonomy-based information sources
Authors: Yannis Tzitzikas, Nicolas Spyratos, Panos Constantopoulos
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

We propose a mediator model for providing integrated and unified access to multiple taxonomy-based sources. Each source comprises a taxonomy and a database that indexes objects under the terms of the taxonomy. A mediator comprises a taxonomy and a set of relations between the mediator&#x2019;s and the sources&#x2019; terms, called articulations. By combining different modes of query evaluation at the sources and the mediator and different types of query translation, a flexible, efficient scheme of mediator operation is obtained that can accommodate various application needs and levels of answer quality. We adopt a simple conceptual modeling approach (taxonomies and intertaxonomy mappings) and we illustrate its advantages in terms of ease of use, uniformity, scalability, and efficiency. These characteristics make this proposal appropriate for a large-scale network of sources and mediators.
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
Authors: Tomasz Jurdzinski, Grzegorz Stachowiak
Venue: Theory of Computing Systems (2005)

We consider the problem of waking up n processors in a completely broadcast system. We analyze this problem in both globally and locally synchronous models, with or without n being known to the processors and with or without labeling of the processors. The main question we answer is: how fast we can wake up all the processors with probability 1 - ¿ in each of these eight models? In [12] a logarithmic waking algorithm for the strongest set of assumptions is described, while for weaker models only linear and quadratic algorithms were obtained. We prove that in the weakest model (local synchronization, no knowledge of n or labeling) the best waking time is O(n/log n). We also show logarithmic or polylogarithmic probabilistic waking algorithms for all stronger models, which in some cases gives an exponential improvement over previous results.
Memory coherence activity prediction in commercial workloads
Authors: Stephen Somogyi, Thomas F. Wenisch, Nikolaos Hardavellas, Jangwoo Kim, Anastassia Ailamaki, Babak Falsafi
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

Recent research indicates that prediction-based coherence optimizations offer substantial performance improvements for scientific applications in distributed shared memory multiprocessors. Important commercial applications also show sensitivity to coherence latency, which will become more acute in the future as technology scales. Therefore it is important to investigate prediction of memory coherence activity in the context of commercial workloads.This paper studies a trace-based Downgrade Predictor (DGP) for predicting last stores to shared cache blocks, and a pattern-based Consumer Set Predictor (CSP) for predicting subsequent readers. We evaluate this class of predictors for the first time on commercial applications and demonstrate that our DGP correctly predicts 47%-76% of last stores. Memory sharing patterns in commercial workloads are inherently non-repetitive; hence CSP cannot attain high coverage. We perform an opportunity study of a DGP enhanced through competitive underlying predictors, and in commercial and scientific applications, demonstrate potential to increase coverage up to 14%.
Characterizing the VCO jitter due to the digital simultaneous switching noise
Authors: Tian Xia, Peilin Song, Hao Zheng
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We study the simultaneous switching noise(SSN) generated by the digital I/O buffers and its impact on VCO. A simple yet accurate model is developed to analyze the ground bounce and power supply fluctuation in each region respectively. Calculation results with the models show good agreements with HSPICE simulation results. Based on the noise model, we investigate the SSN effects on the timing jitter of a current starved VCO. In this study, the RMS jitter and jittery signal spectrum are characterized.
Enhancing the privacy of web-based communication
Authors: Aleksandra Korolova, Ayman Farahat, Philippe Golle
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A profiling adversary is an adversary whose goal is to classify a population of users into categories according to messages they exchange. This adversary models the most common privacy threat against web based communication.We propose a new encryption scheme, called stealth encryption, that protects users from profiling attacks by concealing the semantic content of plaintext while preserving its grammatical structure and other non-semantic linguistic features, such as word frequency distribution. Given English plaintext, stealth encryption produces ciphertext that cannot efficiently be distinguished from normal English text (our techniques apply to other languages as well).
On termination of meta-programs
Authors: Alexander Serebrenik, Danny De Schreye
Venue: Theory and Practice of Logic Programming (2005)

The term meta-programming refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis for a broad class of practical meta-interpreters, including negation and performing different tasks during the execution. It is based on combining the power of general orderings, used in proving termination of term-rewrite systems and programs, and on the well-known acceptability condition, used in proving termination of logic programs. The methodology establishes a relationship between the ordering needed to prove termination of the interpreted program and the ordering needed to prove termination of the meta-interpreter together with this interpreted program. If such a relationship is established, termination of one of those implies termination of the other one, i.e. the meta-interpreter preserves termination. Among the meta-interpreters that are analysed correctly are a proof trees constructing meta-interpreter, different kinds of tracers and reasoners.
Self-Stabilizing Anonymous Leader Election in a Tree
Authors: Zhenyu Xu, Pradip K. Srimani
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n¿) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non leaf node (starting from the same initial state) depending on the behavior of the daemon. The protocol generalizes the result in [A self-stabilizing leader election algorithm for tree graphs] and at the same time is muchsimpler and terminates in polynomial number of moves.
Growing Model Algorithm for Process Identification Based on Neural-Gas Learning and Local Linear Mapping
Authors: Gancho Vachkov
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The paper proposes a special growing type of identification model, based on Local Linear Mapping that gradually improves its accuracy and generalization ability by automatically increasing the size of the model. At each iteration, the feedback information from the approximation error of the current model is utilized in order to make decision for insertion of new local models (units) in the input area with the biggest error. Detailed simulation results and comparisons in the paper have shown that the final produced growing model has a better approximation and generalization ability than some other known learning algorithms. In addition, the proposed procedure automatically defines the optimal size of the model.
An approach based on multilingual thesauri and model combination for bilingual lexicon extraction
Authors: Hervé Déjean, Éric Gaussier, Fatia Sadat
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper focuses on exploiting different models and methods in bilingual lexicon extraction, either from parallel or comparable corpora, in specialized domains. First, a special attention is given to the use of multilingual thesauri, and different search strategies based on such thesauri are investigated. Then, a method to combine the different models for bilingual lexicon extraction is presented. Our results show that the combination of the models significantly improves results, and that the use of the hierarchical information contained in our thesaurus, UMLS/MeSH, is of primary importance. Lastly, methods for bilingual terminology extraction and thesaurus enrichment are discussed.
An improved direct boundary element method for substrate coupling resistance extraction
Authors: Xiren Wang, Wenjian Yu, Zeyi Wang, Xianlong Hong
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

It is important to model the substrate coupling for mixed-signal circuit designs today. This paper presents an improved direct boundary element method (DBEM) for substrate resistance calculation, where only the boundary of substrate volumes is discretized and only the free-space Green function is used. At first, we discard some inessential unknowns to compress the linear system without accuracy loss. Then we make the coefficient matrix sparser. In this way, solving the linear system is greatly accelerated. Experiments on various substrates validate that DBEM is several to tens of times faster than DCT-accelerated Green's function methods and the eigendecomposition method, while preserving high accuracy. Besides, another experiment shows that this method is versatile for irregular substrates.
RANDOM THOUGHTS
Authors: H. K. Hodge
Venue: ACM SIGSMALL/PC Notes (1988)

I saw in the newspaper the other day that Texas expects the demand for systems analysts to grow by 46% in the next few years. That led me to wonder (once again) just what constitutes a systems analyst; or rather, what should a systems analyst be, as opposed to the examples I have met of what they are. 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