ppxscal/embedding_network huggingface dataset:
Open-domain voice-activated question answering
Authors: Sanda Harabagiu, Dan Moldovan, Joe Picone
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

Voice-Activated Question Answering (VAQA) systems represent the next generation capability for universal access by integrating state-of-the-art in question answering Q&A and automatic speech recognition (ASR) in such a way that the performance of the combined system is better than the individual components. This paper presents an implemented VAQA system and describes the techniques that enable the terative refinement of both Q&A and ASR. The results of our experiments show that spoken questions can be processed with surprising accuracy when using our VAQA implementation.
Unstructured adaptive meshes: bad for your memory?
Authors: Huiyu Feng, Rob Van der Wijngaart, Rupak Biswas
Venue: Applied Numerical Mathematics (2005)

The most important performance bottleneck in modern high-end computers is access to memory. Many forms of hardware and software support for reducing memory latency exist, but certain important applications defy these. Examples of such applications are unstructured adaptive (UA) mesh problems, which feature irregular, dynamically changing memory access. We describe a new benchmark program, called UA, for measuring the performance of computer systems when solving such problems. It complements the existing NAS Parallel Benchmarks suite that deals mainly with static, regular-stride memory references. The UA benchmark involves the solution of a stylized heat transfer problem in a cubic domain, discretized on an adaptively refined, unstructured mesh. We describe the numerical and implementation issues, and also present some interesting performance results.
Universal approximations for TSP, Steiner tree, and set cover
Authors: Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We introduce a notion of universality in the context of optimization problems with partial information. Universality is a framework for dealing with uncertainty by guaranteeing a certain quality of goodness for all possible completions of the partial information set. Universal variants of optimization problems can be defined that are both natural and well-motivated. We consider universal versions of three classical problems: TSP, Steiner Tree and Set Cover.We present a polynomial-time algorithm to find a universal tour on a given metric space over n vertices such that for any subset of the vertices, the sub-tour induced by the subset is within O(log4n/log log n) of an optimal tour for the subset. Similarly, we show that given a metric space over n vertices and a root vertex, we can find a universal spanning tree such that for any subset of vertices containing the root, the sub-tree induced by the subset is within O(log4n/log log n) of an optimal Steiner tree for the subset. Our algorithms rely on a new notion of sparse partitions, that may be of independent interest. For the special case of doubling metrics, which includes both constant-dimensional Euclidean and growth-restricted metrics, our algorithms achieve an O(log n) upper bound. We complement our results for the universal Steiner tree problem with a lower bound of Ω(log n/log log n) that holds even for n vertices on the plane. We also show that a slight generalization of the universal Steiner Tree problem is coNP-hard and present nearly tight upper and lower bounds for a universal version of Set Cover.
Learning to Track: Conceptual Manifold Map for Closed-Form Tracking
Authors: Ahmed Elgammal
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Our objective is to model the visual manifold of object appearance corresponding to geometric transformation. We learn a generative model for object appearance where the appearance of the object at each new frame is a function that maps from a conceptual representation of the geometric transformation space into the visual manifold. By learning such generative model we can infer the geometric transformation (track) directly from the tracked object appearance. As a result tracking can be achieved in a closed form and therefore can be done very efficiently.
Digital Mammogram Segmentation Algorithm Using Pulse Coupled Neural Networks
Authors: Aboul Ella Hassanien, Jafar M. Ali
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents and develops an automated algorithm for segmenting spiculated masses of the mammogram images based on Pulse Coupled Neural Networks (PCNN) in conjunction with fuzzy set theory. Mammogram image segmentation has proven difficult task due to low contrast between normal and malignant glandular tissues and the noise in such images that makes it very difficult to segment them. Therefore, the Fuzzy Histogram Hyperbolization (FHH) algorithm is first used as a filter before segmentation process. Then PCNN is applied to segment the images to arrive at the final result. To test the effectiveness of PCNNs on high quality images, a set of mammogram images was chosen. The experimental results show that the proposed algorithm performs well compared to the fuzzy thresholds and Fuzzy C-Mean results.
Design and Implementation of an Efficient Stack Machine
Authors: Martin Schoeberl
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Although virtually every processor today uses a loadstore register architecture, stack architectures attract attention again due to the success of Java. The intermediate language of Java, the Java bytecodes, is stack based and therefore a hardware realization of the Java Virtual Machine (JVM), a Java processor, is also stack based. In this paper two different architectures, found in Java processors, are presented. Detailed analysis of the JVM access patterns to the stack prove that a simpler and faster solution is possible. The proposed solution is a stack with two levels of on-chip cache.
An efficient channel allocation scheme for cellular network using maximum channel packing: Research Articles
Authors: Gary H. K. Ma, Albert Y. Zomaya
Venue: Wireless Communications Mobile Computing (2004)

This paper introduces a channel assignment scheme called the maximum channel packing (MCPCA) for mobile cellular network. As the title suggests, the scheme reduces future call blocking probability by increasing the frequency of channel reuse (or channel packing). The scheme is simulated along with the simple fixed channel allocation scheme and a variation of the channel borrowing allocation scheme, under different traffic patterns and intensity. The results show that MCPCA scheme performs better than the other schemes under all conditions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The Knower Paradox in the light of provability interpretations of modal logic
Authors: Paul Égré
Venue: Journal of Logic, Language and Information (2004)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368--387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338-- 355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287--304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy.
Parallel Module Network Learning on Distributed Memory Multiprocessors
Authors: Long Liu, Chunrong Lai, Hong-shan Jiang
Venue: Proceedings of the 2005 International Conference on Parallel Processing Workshops (2005)

As an extension of the Bayesian Network, the Module Network is used in situations where there are many variables but only a small set of data available. However, using this network is still time-consuming. In this paper, we propose a parallel implementation of the Module Network, a less time-consuming, learning algorithm based on the message-passing model. In order to solve the load-imbalance problem introduced by either result caching or intrinsic computation, we propose a grouping strategy, which groups computations by modules and then distributes them cyclically. We tested our algorithm on eight 4-way Intel Xeon multiprocessors. Speedups of 29.26 on 32 processors have been observed. The result shows that our algorithm is effective.
A Bayesian network based sequential inference for diagnosis of diseases from retinal images
Authors: Suman K. Mitra, Te-Won Lee, Michael Goldbaum
Venue: Pattern Recognition Letters (2005)

We propose a system that learns from the STARE (STructured Analysis of REtina) database and exploits the experience of ophthalmologists to assist in decision-making regarding the presence or absence of retinal diseases. The developed system automatically detects diseases given a description (a set of manifestations) of a retinal image. The manifestations in the retinal image are usually fed sequentially into the system where the manifestation dependences and order must be learned by the system. We apply naive Bayes classifier which is a simple case of Bayesian network to learn the conditional probabilities and to establish an approximate lookup table for sequential manifestation input. The system interacts with the ophthalmologist in determining the sequence of manifestations for inferring the correct disease. The overall performance of the system is found to be satisfactory and useful by ophthalmologists.
Filter Based Directory Replication and Caching
Authors: Apurva Kumar
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper describes a novel filter based replication model for Lightweight Directory Access Protocol (LDAP) directories. Instead of replicating entire subtrees from the Directory Information Tree (DIT), only entries matching a filter specification are replicated. Advantages of the filter based replication framework over existing subtree based mechanisms have been demonstrated for a real enterprise directory using real workloads.
Secure Configuration of a Field Programmable Gate Array
Authors: Tom Kean
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

Although SRAM programmed FPGA's are generally denser and faster than FPGA's programmed using non-volatile technologies, such as antifuse and Flash EPROM, the need to load on-chip configuration memory on power up makes them vulnerable to piracy and reverse engineering of the user design. This paper discusses an attractive method of addressing this issue.
A scaling theory for fully-depleted, surrounding-gate MOSFET's: including effective conducting path effect
Authors: T. K. Chiang
Venue: Microelectronic Engineering (2005)

A scaling theory for fully-depleted surrounding-gate (SG) MOSFET's is derived, which gives a basic idea how the effective conducting path affects the scaling theory. By investigating the subthreshold conducting phenomenon of SG MOSFET's, the effective conducting path effect (ECPE) is employed to obtain the natural length @l"4 which is relevant to the scaling equation. With various substrate concentrations, the minimum channel potential @F"d"""e"""f"""f""","""m"""i"""n induced by effective conducting path shows the novel scaling factor @a"4. Compared to conventional scaling rule, our model accounts for doping effect and hence provides a unified scaling rule for fully-depleted SG SOI MOSFET's.
Research at MIT: AI Laboratory
Authors: Robert C. Berwick
Venue: Issue 79 (January 1982) (1982)

A simple invertible grammar has been designed that is able to map input story summaries written in a simplified English (e.g., a plot outline of Macbeth, a medical history, or a synopsis of an historical event) into case-frame representations of those summaries. This input representation then serves as the basis for an analogical matching routine that is able to extract out the structural features common to several stories, a procedure that in turn forms the basis for an analogical learning program developed by Winston. The same grammar is then used in reverse by the analogical reasoner to generate natural sounding output. As implemented, the system is flexible and highly domainindependent; it relics on a modified system of order-independent transformations in order to obtain these properties. The generation procedure itself is broken down into three steps. Step I takes a highlevel plan generated by the analogy program and separates the plan into groups, generating a set of kernel sentences for each group. Step 2 takes as input the set of kernel sentences and a collection of syntactic and thematic rules and determines the set of transformations that must be applied upon each set of kernel sentences. Finally, Step 3 executes the transformations, combining the altered kernels of each set into a sentence, performs some clean-up pronominalization, and produces an output English word string. The following is an example of English text actually produced by the program: "At the beginning of the story Lady Macbeth is bothered by the fact that Macbeth is not the king. Macbeth who was a nobleman is persuaded by her to murder the king with a knife because she wants Macbeth to be the king."
A comparative study of SOAP and DCOM
Authors: Alexander Davis, Du Zhang
Venue: Journal of Systems and Software (2005)

Simple Object Access Protocol (SOAP) is a recent technology, which aims at replacing traditional methods of remote communications, such as RPC-based Distributed Component Object Model (DCOM). Being designed with a goal of increasing interoperability among wide range of programs and environment, SOAP allows applications written in different languages and deployed on different platforms to communicate with each other over the network. While SOAP offers obvious benefits in the world of interoperability, it comes at a price of performance degradation and additional development efforts required for implementation of features missing from SOAP, such as security and state management. This paper reports the outcome of a comparative study of SOAP and DCOM in terms of features, development effort, and application performance. The results indicate that SOAP performance on a homogeneous platform is consistently worse than that of DCOM. Depending on the operation and the amount of data transferred, SOAP performance degradation can range from minor (e.g. two or three times slower than DCOM) to major (e.g. twenty or more times slower).
Contextual information management using contract: based workflow
Authors: V. K. Murthy, E. V. Krishnamurthy
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In the Ambient Intelligent Computing Environment (AmI) consisting of peers (clients, servers or agents or other intelligent devices), context-awareness plays an important role to offer intelligent services for various applications, e.g., medical services, robotics, travel planning, security monitoring, and multi-player gaming. Accordingly, context management turns out to be an important issue in manipulating, acquiring information and reacting to the situation. In this paper, we describe a contract-based workflow paradigm to provide transparency and reliability of interactions among the devices and people in the AmI. This paradigm provides for software contract that captures mutual obligations using program constructs such as "require [else]" for precondition and "ensure [then]" for post condition, assertions, invariants needed in the AmI. Such program constructs are essential to deal with the uncertain nature of connectivity of ubiquitous devices and networks, and the trial-error (subjunctive) nature of the processes and the programs used in interactions among devices and people in an unpredictable environment
A covenant with transparency: opening the black box of models
Authors: Kenneth R. Fleischmann, William A. Wallace
Venue: Communications of the ACM (2005)

One important ethical aspect of the use of models for decision making is the relative power of the various actors involved in decision support: the modelers, the clients, the users, and those affected by the model. Each has a different stake in the design of decision support models, and the outcome of modeling depends on both the technical attributes of the model and the relationships among the relevant actors. Increasing the transparency of the model can significantly improve these relationships. Here, we explore the importance of transparency in the design and use of decision support models.
Solving the vehicle routing problem with adaptive memory programming methodology
Authors: C. D. Tarantilis
Venue: Computers and Operations Research (2005)

In this paper we develop an adaptive memory programming method for solving the capacitated vehicle routing problem called Solutions' Elite PArts Search (SEPAS). This iterative method, first generates initial solutions via a systematic diversification technique and stores their routes in an adaptive memory. Subsequently, a constructive heuristic merges route components (called elite parts) from those in the adaptive memory. Finally, a tabu search approach improves the heuristically constructed solution and the adaptive memory is appropriately updated. SEPAS has been tested on two benchmark data sets and provides high quality solutions in short computational times for all problem instances. The method reaches several new best solutions for benchmark instances with a large number of customers.
Cost guaranteed robust sampled-data parallel model design using polynomial approach
Authors: Ruben H. Milocco, Carlos H. Muravchik
Venue: Signal Processing (2005)

The multivariable H2 guaranteed robust minimum variance parallel model design problem subjected to norm bounded uncertainties is studied in this paper for sampled-data systems. It consists of two paths connected in parallel with a common stationary stochastic input. One of them has an unknown system to be designed despite the presence of disturbances, so that the output signal of the two paths is of minimum variance. The systems and noise models are assumed to be represented by polynomial matrices that are not perfectly known except that they belong to a certain set. The sampled-data design is based on a fast sampling and lifting technique resulting on a finite-dimensional filter. An application case of robust parallel model design to the feedforward load-frequency control on hydro-generating units is provided.
Conflict controlled processes with discontinuous trajectories
Authors: A. A. Chikrii, I. I. Matichin, K. A. Chikrii
Venue: Cybernetics and Systems Analysis (2005)

Linear differential games with pulse control of players, which is represented by the Dirac delta-function, are analyzed. For this class of games, the sufficient conditions for the solvability of the approach problem are derived. The problems are analyzed based on the method of resolving functions. The result is exemplified by a pursuit game with a simple motion.
On decentralized incentive compatible mechanisms
Authors: Ahuva Mu'alem
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

Algorithmic Mechanism Design focuses on Dominant Strategy Implementations. The main positive results are the celebrated Vickrey-Clarke-Groves (VCG) mechanisms and computationally efficient mechanisms for severely restricted players ("single-parameter domains"). As it turns out, many natural social goals cannot be implemented using the dominant strategy concept [35, 32, 22, 20]. This suggests that the standard requirements must be relaxed in order to construct general-purpose mechanisms.We observe that in many common distributed environments computational entities can take advantage of the network structure to collect and distribute information. We thus suggest a notion of partially informed environments. Even if the information is recorded with some probability, this enables us to implement a wider range of social goals, using the concept of iterative elimination of weakly dominated strategies. As a result, cooperation is achieved independent of agents' belief. As a case study, we apply our methods to derive Peer-to-Peer network mechanism for file sharing.
Phase Shifter Merging
Authors: Dimitri Kagaris
Venue: Journal of Electronic Testing: Theory and Applications (2005)

Phase shifters are used in conjunction with Linear Feedback Shift Registers and Cellular Automata in order to impose sufficient channel separations on the bit sequences produced by their successive cells. The aim is to reduce structural correlations and/or linear dependencies that are problematic for pseudorandom and pseudoexhaustive built-in test pattern generation (TPG). In this paper we present a synthesis approach that merges the logic of the original TPG mechanism with that of the required phase shifter network and yields a new compact structure that can offer lower area overhead and improved frequency of operation than the existing approach.
On the complexity of deciding typability in the relational algebra
Authors: Stijn Vansummeren
Venue: Acta Informatica (2005)

We investigate the complexity of the typability problem for the relational algebra. This problem consists of deciding, for a given relational algebra expression, whether there exists an assignment of types to variables occurring in the expression such that the expression is well-typed under the assignment. We obtain that the problem is NP-complete in general. In particular, we show that the problem becomes NP-hard due to (1) the cartesian product operator, (2) the selection operator on arbitrary sets of typed predicates, (3) the selection operator on &#x201c;well-behaved&#x201d; sets of typed predicates together with join and projection or renaming. However, the problem is in P when (1) we only allow union, difference, join and selection on &#x201c;well-behaved&#x201d; sets of typed predicates, or (2) we allow all operators except cartesian product, where the set of selection predicates can mention at most one base type. Most of these results follow from a close connection of the typability problem to non-uniform constraint satisfaction.
Recent extensions to the SimpleScalar tool suite
Authors: Doug Burger, Todd M. Austin, Stephen W. Keckler
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Over the past eight years, the SimpleScalar Tool suite has become the most widely used set of simulation tools in the computer architecture research community. The authors have recently completed an NSF-funded project to extend and improve the SimpleScalar tools. In this paper, we describe the extensions and improvements to the tools, which include the capability to simulate more instruction sets, graphical support for performance viewing, and more simulators that model different types of machines, including embedded systems, ISA-specific systems, systems with operating system, and multiprocessing systems.