ppxscal/embedding_network huggingface dataset:
Deduction from conditional knowledge
Authors: D. Bamber, I. R. Goodman, H. T. Nguyen
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

We propose a Bayesian second-order probability approach to the problem of making inferences from conditional probability information. We present examples that, on the surface, appear to indicate a &#x201c;disconnect&#x201d; between logic and probability. These examples seem to indicate that conclusions that can be deduced when premises are completely reliable can no longer be deduced when the reliability of premises (as measured by their probability) is anything less than perfect. To overcome the resulting &#x201c;deductive paralysis&#x201d;, we present probabilistic forms of logic in which the goal is not to reach conclusions that are certain to be true, but rather to reach conclusions that are true &#x201c;nearly always&#x201d; or &#x201c;on average&#x201d;. In so doing, we reveal a hidden smooth connection between logic and probability. The use of fuzzy logic to model linguistic probabilities is also discussed.
Efficient Iterative Time Preconditioners for Harmonic Balance RF Circuit Simulation
Authors: Fabrice Veersé
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Efficient iterative time preconditioners for Krylov-basedharmonic balance circuit simulators are proposed.Some numerical experiments assess theirperformance relative to the well-known block-diagonalfrequency preconditioner and the previouslyproposed time preconditioners.
ELLIPS: providing web-based language learning for Higher Education in the Netherlands
Authors: Alessandra Corda, Sake Jager
Venue: ReCALL (2004)

This paper presents the overall considerations and pedagogical approach which were at the basis of the development of an innovative web-based CALL application, Ellips (Electronic Language Learning Interactive Practising System). It describes the program&rsquo;s most salient features, illustrating in particular the technical challenges involved in the realization of this multilingual, server-hosted, database-supported language-learning application. Ellips, the product of a cooperative project between four Dutch universities, offers effective web-based support for language learning in Higher Education (HE) institutions. Ellips focuses particularly on grammar training, listening and pronunciation skills; although it can be accessed on its own, it has been created with integration with virtual learning environments (VLEs) like Blackboard and WebCT in mind. As a matter of fact, Ellips offers functionality lacking in these systems, which have not been specifically developed for language learning and offer more assessment than practising opportunities. Moreover, in Ellips all learning materials are coded with language-specific metadata (mainly based on descriptors derived from the Common European Framework), so that developers can easily find and reuse materials and so-called &lsquo;semi-adaptivity&rsquo; is allowed (students automatically receive more exercises on the topics which they have not yet mastered). Other important features of Ellips are full Unicode support, extensive feedback (for every item in an exercise and for the whole exercise), a student-tracking system, the use of (streaming) audio and video, and the possibility to record student input and store it in a portfolio.
Fast computation of database operations using graphics processors
Authors: Naga K. Govindaraju, Brandon Lloyd, Wei Wang, Ming Lin, Dinesh Manocha
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We present new algorithms for performing fast computation of several common database operations on commodity graphics processors. Specifically, we consider operations such as conjunctive selections, aggregations, and semi-linear queries, which are essential computational components of typical database, data warehousing, and data mining applications. While graphics processing units (GPUs) have been designed for fast display of geometric primitives, we utilize the inherent pipelining and parallelism, single instruction and multiple data (SIMD) capabilities, and vector processing functionality of GPUs, for evaluating boolean predicate combinations and semi-linear queries on attributes and executing database operations efficiently. Our algorithms take into account some of the limitations of the programming model of current GPUs and perform no data rearrangements. Our algorithms have been implemented on a programmable GPU (e.g. NVIDIA's GeForce FX 5900) and applied to databases consisting of up to a million records. We have compared their performance with an optimized implementation of CPU-based algorithms. Our experiments indicate that the graphics processor available on commodity computer systems is an effective co-processor for performing database operations.
Multiparty Quantum Coin Flipping
Authors: Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Rohrig
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We investigate coin-flipping protocols for multiple partiesin a quantum broadcast setting:We propose and motivate a definition for quantumbroadcast. Our model of quantum broadcast channelis new.We discovered that quantum broadcast is essentiallya combination of pairwise quantum channels and aclassical broadcast channel. This is a somewhat surprisingconclusion, but helps us in both our lower andupper bounds.We provide tight upper and lower bounds on the optimalbias \varepsilon of a coin which can be flipped by k partiesof which exactly g parties are honest: for any1 \le g \le k,\varepsilon= \frac{1}{2} - \Theta (\frac{g}{k}).Thus, as long as a constant fraction of the players are honest,they can prevent the coin from being fixed with at leasta constant probability. This result stands in sharp contrastwith the classical setting, where no non-trivial coin-flippingis possible when g \le \frac{k}{2}.
Verifying a Chinese collection for text categorization
Authors: Yuen-Hsien Tseng
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This article describes the development of a free test collection for Chinese text categorization. A novel retrieval-based approach was developed to detect duplicates and label inconsistency in this corpus and in Reuters-21578 for comparison. The method was able to detect certain types of similar and/or duplicated documents that were overlooked by an alternative repetition-based method [1]. Experiments showed that effectiveness was not affected by the confusing documents.
Automatic Control of Workflow Processes Using ECA Rules
Authors: Joonsoo Bae, Hyerim Bae, Suk-Ho Kang, Yeongho Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Changes in recent business environments have created the necessity for a more efficient and effective business process management. The workflow management system is software that assists in defining business processes as well as automatically controlling the execution of the processes. This paper proposes a new approach to the automatic execution of business processes using Event-Condition-Action (ECA) rules that can be automatically triggered by an active database. First of all, we propose the concept of blocks that can classify process flows into several patterns. A block is a minimal unit that can specify the behaviors represented in a process model. An algorithm is developed to detect blocks from a process definition network and transform it into a hierarchical tree model. The behaviors in each block type are modeled using ACTA formalism. This provides a theoretical basis from which ECA rules are identified. The proposed ECA rule-based approach shows that it is possible to execute the workflow using the active capability of database without users' intervention. The operation of the proposed methods is illustrated through an example process.
Positive Sample Only Learning (PSOL) for Predicting RNA Genes in E. coli
Authors: Richard F. Meraz, Xiaofeng He, Chris H. Q. Ding, Stephen R. Holbrook
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

RNA genes lack most of the signals used for protein gene identification. A major shortcoming of previous discriminative methods to distinguish functional RNA (fRNA) genes from other non-coding genomic sequences is that only positive examples of fRNAs are known; there are no confirmed negatives ¿ only intergenic sequences that may be positive or negative. To address this problem we developed the "Positive Sample Only Learning" (PSOL) method. This method can identify the most likely negative examples from an unlabeled set and is therefore able to distinguish putative functional RNA genes from other non-coding sequence.We compare RNA gene predictions using the PSOL method with previous large-scale analyses of the E. coli K12 genome.
Multi-Scale Reconstruction of Implicit Surfaces with Attributes from Large Unorganized Point Sets
Venue: Proceedings of the Shape Modeling International 2004 (2004)

We present a new method for the multi-scale reconstructionof implicit surfaces with attributes from large unorganizedpoint sets. The implicit surface is reconstructed bysubdividing the global domain into overlapping local subdomainsusing a perfectly balanced binary tree, reconstructingthe surface parts in the local subdomains from non-disjunctsubsets of the points by variational techniques using radialbasis functions, and hierarchically blending togetherthe surface parts of the local subdomains by using a familyof functions called partition of unity. The subsets of thepoints in the inner nodes of the tree for intermediate resolutionsare obtained by thinning algorithms. The reconstructionis particularly robust since the number of data points inthe partition of unity blending zones can be specified explicitly.Furthermore, the new reconstructionmethod is valid fordiscrete datasets in any dimension, so we can use it also toreconstruct continuous functions for the surfaceýs attributes.In a short discussion, we evaluate the advantages and drawbacksof our reconstruction method compared to existing reconstructionmethods for implicit surfaces.
Static analysis of programs as an aid to debugging
Authors: Ron Tischler, Robin Schaufler, Charlotte Payne
Venue: ACM SIGPLAN Notices (1983)

This paper describes how MAP, a tool for understanding software, combines static analysis, some dynamic features, and an interactive presentation to aid programmers in debugging. Static analysis of the sort produced in optimizing compilers could provide programmers with useful information that they cannot get from dynamic debuggers. The challenge for designers of static analysis tools is to present the information in a useful form.
Increasing the Effective Egocentric Field of View with Proprioceptive and Tactile Feedback
Authors: Ungyeon Yang, Gerard Jounghyun Kim
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

Multimodality often exhibits synergistic effects: eachmodality compliments and compensates for othermodalities in transferring coherent, unambiguous, andenriched information for higher interaction efficiency andimproved sense of presence. In this paper, we exploreone such phenomenon: a positive interaction among thegeometric field of view, proprioceptive interaction, andtactile feedback. We hypothesize that, with proprioceptiveinteraction and tactile feedback, the geometric field ofview and thus visibility can be increased such that it islarger than the physical field of view, without causing asignificant distortion in the user's distance perception.This, in turn, would further help operation of the overallmultimodal interaction scheme as the user is more likelyto receive the multimodal feedback simultaneously. Wetested our hypothesis with an experiment to measure theuser's change in distance perception according todifferent values of egocentric geometric field of view andfeedback conditions. Our experimental results haveshown that, when coupled with physical interaction, theGFOV could be increased by up to 170 percent of thephysical field of view without introducing significantdistortion in distance perception. Second, when tactilefeedback was introduced, in addition to visual andproprioceptive cues, the GFOV could be increased by upto 200 percent. The results offer a useful guideline foreffectively utilizing of modality compensation andbuilding multimodal interfaces for close range spatialtasks in virtual environments. In addition, it demonstratesone way to overcome the shortcomings of the narrow(physical) fields of views of most contemporary HMDs.
EEPROM Memory stack with scaled down thickness
Authors: Ruth Shima Edelstein, Chris Cork, Efraim Aloni, Nachi Vofsy, Yakov Roizin
Venue: Microelectronic Engineering (2004)

We studied OAO (oxide-α-Si-oxide) memory stacks of 450-600 Å total thickness that were part of multi-bit EEPROM elements. Information was stored in two isolated Poly/ralpha-Si floating gates located above the channel edges. The floating gate was 250-400 Å LPCVD amorphous Si or Poly, surrounded by 70 Å bottom oxide and 125 Å top oxide. Reliability of the new memory stack was evaluated, and the breakdown voltage (Vbd) and charge (Qbd) of the optimized stack are high enough to use in advanced embedded EEPROM memories, and in particular in memory cells with two isolated poly floating gates.
Perfectly matched layers for radio wave propagation in inhomogeneous magnetized plasmas
Authors: Natalia A. Gondarenko, Parvez N. Guzdar, Sidney L. Ossakow, Paul A. Bernhardt
Venue: Journal of Computational Physics (2004)

We present 1D and 2D numerical models of the propagation of high-frequency (HF) radio waves in inhomogeneous magnetized plasmas. The simulations allow one to describe the process of linear conversion of HF electromagnetic waves into electrostatic waves. The waves, launched from the lower boundary normally or at a specified angle on a layer of a magnetostrictive plasma, can undergo linear conversion of the incident O-mode into a Z-mode at appropriate locations in an inhomogeneous prescribed plasma density. The numerical scheme for solving 2D HF wave propagation equations is described. The model employed the Maxwellian perfectly matched layers (PML) technique for approximating nonreflecting boundary conditions. Our numerical studies demonstrate the effectiveness of the PML technique for transparent boundary conditions for an open-domain problem.
Interviews with Richard Edlund
Authors: Richard Edlund
Venue: Computers in Entertainment (CIE) (2004)

Mr. Richard Edlund won four Academy Awards for Visual Effects in the first three "Star Wars" movies (1977, 1980, 1983) and "Raiders of the Lost Ark" (1981). He was a key member of Industrial Light & Magic (ILM) for George Lucas, a company that has become a Hollywood powerhouse of cutting-edge movie technology. In 1981, Mr. Edlund and ILM won two Scientific and Engineering Awards from the Academy of Motion Picture Arts and Sciences for the development of the Empire motion picture camera system and a beam-splitter optical composite motion picture printer. In 1983, he founded the Boss Film Corp. and went on to work on such major films as Ghost, Ghostbusters, Die Hard, 2010, Poltergeist, and Alien 3. His latest films include "The Stepford Wives" (2004) and "Angels in America" (2003 mini TV series). More information on his work can be found at http://www.imdb.com/name/nm0249430/ 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
New numerical algorithms to optimize cutting operations of a five-axis milling machine
Authors: Sergey A. Ivanenko, Stanislav S. Makhanov, Mud-Armeen Munlin
Venue: Applied Numerical Mathematics (2004)

Optimization of cutting operations is an active area of research in CNC-based manufacturing. The limited capabilities of the CAD/CAM systems require development of a new software and new numerical methods verified by practical machining. We formulate the problem of tool-path optimization in terms of interpolation of the required part surface in the curvilinear coordinate system associated with the cutter location points. Next, we present some introductory examples to demonstrate that the concept of adaptive curvilinear grid contains almost all the basic ingredients of tool-path planning, such as: adaptation to regions of large milling errors, conventional zigzag/spiral patterns and constraints related to the scallop height. Consequently, we propose a new grid based optimization procedure characterized by adaptation to a control function which depends on the rotations required to correctly position the tool. We also consider a particular but important optimization of the rotation angles near the stationary points based on the shortest path scheme. Finally, we present an application of the algorithms to tool-path planning and demonstrate the efficiency of the proposed scheme by methodological examples verified by practical machining.
Necessary and Sufficient Pre-processing in Numerical Range Discretization
Authors: Tapio Elomaa, Juho Rousu
Venue: Knowledge and Information Systems (2003)

The time complexities of class-driven numerical range discretization algorithms depend on the number of cut point candidates. Previous analysis has shown that only a subset of all cut points - the segment borders - have to be taken into account in optimal discretization with respect to many goodness criteria. In this paper we show that inspecting segment borders alone suffices in optimizing any convex evaluation function. For strictly convex evaluation functions inspecting all of them also is necessary, since the placement of neighboring cut points affects the optimality of a segment border. With the training set error function, which is not strictly convex, it suffices to inspect an even smaller set of cut point candidates, called alternations, when striving for optimal partition. On the other hand, we prove that failing to check an alternation may lead to suboptimal discretization. We present a linear-time algorithm for finding all alternation points. The number of alternation points is typically much lower than the total number of cut points. In our experiments running the discretization algorithm over the sequence of alternation points led to a significant speed-up.
Secure, reliable, transacted: innovation in Web Services architecture
Authors: Martin Gudgin
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

This paper discusses the design of Web Services Protocols paying special attention to composition of such protocols. The transaction related protocols are discussed as exemplars.
Power-Optimal Simultaneous Buffer Insertion/Sizing and Wire Sizing
Authors: Ruiming Li, Dian Zhou, Jin Liu, Xuan Zeng
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper studies the problems of minimizing power dissipationof an interconnect wire by simultaneously considering buffer insertion/sizing and wire sizing (BISWS). We consider two cases, namely minimizing power dissipation with optimal delay constraints, and minimizing power dissipation with a given delay penalty.We derive closed form optimal solutions for both cases. Theseclosed form solutions can be used to efficiently estimate the powerdissipation in the early stages of the VLSI designs. We observe thatthe power dissipation can be much different even with the sameoptimal delay.
A Tree-based DHT Approach to Scalable Weakly Consistent Peer-to-Peer Data Management
Authors: Dietrich Fahrenholtz, Volker Turau
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Second generation Peer-to-Peer systems employ a Distributed Hashtable (DHT) to locate data efficiently in their network.But when peers fail, the DHT algorithm needs to route around them, which, in many cases, reduces its efficiency. We propose to separate the data lookup from the data storing concerns.Thus we can guarantee a search cost proportional to the logarithm of the number of peers in the network despite a high change rate, i.e., many peers join or leave the network concurrently.To demonstrate our approach, we use a simple DHT based on a binary tree whose leaves are associated with collections of peers that are responsible for a range of data values associated with search keys.Peers of a group collaborate to form redundant data storage and thus ensure high availability of their data.This means, however, only weak data consistency can be guaranteed when an insertion or update takes place.
Cheap Paxos
Authors: Leslie Lamport, Mike Massa
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Asynchronous algorithms for implementing a fault-tolerantdistributed system, which can make progressdespite the failure of any F processors, require 2F + 1processors. Cheap Paxos, a variant of the Paxos algorithm,guarantees liveness under the additional assumptionthat the set of nonfaulty processors does not"jump around" too fast, but uses only F + 1 main processorsthat actually execute the system and F auxiliaryprocessors that are used only to handle the failure of amain processor. The auxiliary processors take part inreconfiguring the system to remove the failed processor,after which they can remain idle until another mainprocessor fails.
Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast
Authors: Gal Badishi, Idit Keidar, Amir Sasson
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We propose a framework and methodology for quantifyingthe effect of denial of service (DoS) attacks on a distributedsystem. We present a systematic study of the resistanceof gossip-based multicast protocols to DoS attacks.We show that even distributed and randomized gossip-basedprotocols, which eliminate single points of failure, do notnecessarily eliminate vulnerabilities to DoS attacks. Wepropose Drum - a simple gossip-based multicast protocolthat eliminates such vulnerabilities. Drum was implementedin Java and tested on a large cluster. We show,using closed-form mathematical analysis, simulations, andempirical tests, that Drum survives severe DoS attacks.
An Agent-Based Dynamic Information Network for Supply Chain Management
Authors: H. J. Ahn
Venue: BT Technology Journal (2004)

One of the main research issues in supply chain management is to improve the global efficiency of supply chains. However, the improvement efforts often fail because supply chains are complex, are subject to frequent changes, and collaboration and information sharing in the supply chains are often unfeasible. This paper presents a practical collaboration framework for supply chain management wherein multi-agent systems form dynamic information networks and co-ordinate their production and order planning according to synchronised estimation of market demands. In the framework, agents employ an iterative relaxation contract net protocol to find the most desirable suppliers by using data envelopment analysis. Furthermore, the chain of buyers and suppliers, from the end markets to raw material suppliers, form dynamic information networks for synchronised planning. This paper presents an agent-based dynamic information network for supply chain management and discusses the associated pros and cons.