ppxscal/embedding_network huggingface dataset:
On dynamic range reporting in one dimension
Authors: Christian Worm Mortensen, Rasmus Pagh, Mihai Pǎtraçcu
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We consider the problem of maintaining a dynamic set of integers and answering queries of the form: report a point (equivalently, all points) in a given interval. Range searching is a natural and fundamental variant of integer search, and can be solved using predecessor search. However, for a RAM with w-bit words, we show how to perform updates in O(lg w) time and answer queries in O(lg lg w) time. The update time is identical to the van Emde Boas structure, but the query time is exponentially faster. Existing lower bounds show that achieving our query time for predecessor search requires doubly-exponentially slower updates. We present some arguments supporting the conjecture that our solution is optimal.Our solution is based on a new and interesting recursion idea which is "more extreme" that the van Emde Boas recursion. Whereas van Emde Boas uses a simple recursion (repeated halving) on each path in a trie, we use a nontrivial, van Emde Boas-like recursion on every such path. Despite this, our algorithm is quite clean when seen from the right angle. To achieve linear space for our data structure, we solve a problem which is of independent interest. We develop the first scheme for dynamic perfect hashing requiring sublinear space. This gives a dynamic Bloomier filter (a storage scheme for sparse vectors) which uses low space. We strengthen previous lower bounds to show that these results are optimal.
A comparison of undergraduate student performance in online and traditional courses
Authors: Gary Ury
Venue: Journal of Computing Sciences in Colleges (2004)

As online instruction becomes more prevalent at the college and university level, researchers are attempting to measure the success of these programs using a variety of methodologies, instruments, and sample sizes. There is a need for continued exploration and study to assure quality instruction. The purpose of this study was to compare course performance over time between online and traditional classroom students enrolled in a required management information systems course included in the business school's common professional component. The online delivery method was found to be effective, but performance, as measured by final course grades, showed a significantly lower mean score than students enrolled in traditional sections of the course. Other findings indicated that traditional course designs can be adequately adapted to the online model and that collaborative course development can lead to a level of consistency in student performance within high demand courses.
Evaluation of regular and singular domain integrals with boundary-only discretization: theory and Fortran code
Authors: Xiao-Wei Gao
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, a set of boundary integrals are derived based on a radial integration technique to accurately evaluate two dimensional (2D) and three dimensional (3D), regular and singular domain integrals. A self-contained Fortran code is listed and described for numerical implementation of these boundary integrals. The main feature of the theory is that only the boundary of the integration domain needs to be discretized into elements. This feature can not only save considerable efforts in discretizing the integration domain into internal cells (as in the conventional method), but also make computational results for singular domain integrals more accurate since the integrals have been regularized. Some examples are provided to verify the correctness of the presented formulations and the included code.
Highly arc transitive digraphs: reachability, topological groups
Authors: Aleksander Malnič, Dragan Marušič, Rögnvaldur G. Möller, Norbert Seifter, Vladimir Trofimov, Boris Zgrablič
Venue: European Journal of Combinatorics (2005)

Let D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachability relation is not universal in D provided that the stabilizer of an edge satisfies certain conditions which seem to be typical for highly arc transitive digraphs. As an implication, the reachability relation cannot be universal in highly arc transitive digraphs with prime in- or out-degree.Two different aspects of the connection between highly arc transitive digraphs and the theory of totally disconnected locally compact groups are also considered.
Optimization Design of Cascaded Classifiers
Authors: Huitao Luo
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present two optimization algorithms for the design of a cascade of classifiers, which is becoming a popular choice formany classification problems. Both algorithms represent each node classifier of a cascade using a high-level abstraction model and attempt to jointly optimize the setting of the thresholding parameters of all the node classifiers within the cascade. We applied both algorithms to optimize the famous Viola and Jones face detector and one of them in particular greatly improved the performance. We believe both algorithms can serve as a useful post-processing process for general cascaded classifier design.
MTPSec: Customizable Secure MTP3 Tunnels in the SS7 Network
Authors: Hemant Sengar, Duminda Wijesekera, Sushil Jajodia
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

The signaling system 7 (SS7) is the control network used by public telephones all over the world. Having been designed in an era where few large companies controlled the entire network, SS7 has virtually no security. Due to telecommunication deregulation, liberalization of economies and the convergence of telephone, IP and wireless networks, interfaces to SS7 has increased. We show how these deficiencies can be exploited to isolate or shut down telephone switches. As a solution, we propose MTPSec - a framework that enforces authentication and custom creates secure channels at the message transfer part level 3 (MTP3) layer. We show by simulation that employing MTPSec adds only 360 µ seconds to an average call setup time delays to a domestic telephone call in an average sized country. It is quite tolerable for getting an additional security service given that the current connection delays are between 2.0 to 2.5 seconds.
Method redefinition: ensuring alternative behaviors
Authors: I. Nunes
Venue: Information Processing Letters (2004)

The redefinition of a method in subclasses can completely change the semantics of the superclass method unless there are effective mechanisms that enforce the preservation of behavioral properties. Several approaches to behavioral subtyping-- exact pre-post match, plug-in match, relaxed plug-in match among others--exist that enforce the preservation of behavioral properties.To maintain or weaken pre-conditions and to maintain or enforce post-conditions when redefining methods in extended classes--plug-in match--is the solution that is adopted, by construction, in the Eiffel language, among other assertion languages. This approach forbids the specification of a class of legitimate programs from which we present an example. We claim that relaxed plug-in match should be enforced instead, in order to accommodate these examples. Other approaches exist, as is the case of case analysis in JML and OCL, that allow the specification of those programs, but they do it at the cost of decreasing software extension.We propose a new way of building contracts that identify and express, in a natural and elegant way, the several contributions that method redefinition can bring, and that are expressive enough to specify extensible contracts for the above mentioned class of programs. These contracts ensure, by construction, that redefinition preserves behavioral properties.
Collaborative Exploration for a Group of Self-Interested Robots
Authors: Michael Schukat, Declam O'Beirne
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper presents and new approach to robot exploration and mapping using a team of cooperative robots.This approach aims to exploit the increase in sensor data that multiple robots offer to improve efficiency, accuracy and detail in maps created, and also the lower cost in employing a group of inexpensive robots.The exploration technique involves covering an area as efficiently as possible while cooperating to estimate each other's positions and orientations.The ability to observe objects of interest from a number of viewpoints and combine this data means that cooperative robots can localize objects and estimate their shape in cluttered real world scenes. Robots in the system act as social agents, and are motivated to cooperate by a desire to increase their own utility.Within this society, robots form coalitions to complete tasks that arise which require input from multiple robots.The coalitions involve the adoption of certain roles or behaviors on the part of the different robots to carry out these tasks.
A First Investigation into the Effectiveness of Tactons
Authors: Lorna M. Brown, Stephen A. Brewster, Helen C. Purchase
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper reports two experiments relating to the design of Tactons (or tactile icons). The first experiment investigated perception of vibro-tactile "roughness" (created using amplitude modulated sinusoids), and the results indicated that roughness could be used as a parameter for constructing Tactons. The second experiment is the first full evaluation of Tactons, and uses three values of roughness identified in the first experiment, along with three rhythms to create a set of Tactons. The results of this experiment showed that Tactons could be a successful means of communicating information in user interfaces, with an overall recognition rate of 71%, and recognition rates of 93% for rhythm and 80% for roughness.
Deriving multiplication-type FVQ&#47HMM from a new information-source model and a viewpoint of information theory, and the relation of the model to discrete and continuous HMMs
Authors: Eiichi Tsuboka
Venue: Systems and Computers in Japan (2004)

In this paper the author formulates HMM from the standpoint of information theory. Based on this formulation, a multiplication-type FVQ&sol;HMM previously proposed by the author is derived from the inevitable results. In addition, conventional discrete and continuous HMMs can also be derived from this formulation, and are shown to represent special cases of the multiplication-type FVQ&sol;HMM. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 59&ndash;65, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10233
OURANOS, an AI micromcomputer program with English and German user-defined vocabularies
Authors: Joseph Schreiner
Venue: Issue 84 (April 1983) (1983)

OURANOS is a collection of programs that create userdefined 230-word vocabularies, and allow intelligent user-computer conversations using these vocabularies. Moreover, there are English and German versions of OURANOS, and any situation developed in one language can be translated and further developed in the other. Situations consist of facts, which may be user-entered, or derived from propositions. Individual facts are attributes or relationships describing one to three objects, modified by tense, negation, and probability. 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
Predicting Competitive Response to a Major Policy Change: Combining Game-Theoretic and Empirical Analyses
Authors: Kusum L. Ailawadi, Praveen K. Kopalle, Scott A. Neslin
Venue: Marketing Science (2005)

This research uses Procter & Gamble's value pricing initiative as a context for testing whether actual competitor and retailer response to a major policy change can be predicted using a game-theoretic model. We first estimate demand functions for P&G and competitor brands from the period before value pricing was initiated. We then formulate a dynamic manufacturer-retailer Stackelberg model that includes P&G, a national-brand competitor, and a retailer. The model takes P&G's move as given and prescribes the price and promotion response of the competitors and the retailer. We substitute the estimated demand parameters into the model to obtain prescriptions for each competitor and the retailer, and see whether these prescriptions are related to the actual response. We find that the dynamic game-theoretic model calibrated with empirical estimates of demand parameters has significant predictive power. We also test the predictive power of two benchmark models. The first is based on the reaction function approach of Leeflang and Wittink (Leeflang, Peter S. H., Wittink, Dick R. 1992. Diagnosing competitive reactions using (aggregated) scanner data.Internat. J. Res. Marketing9 39-57.), and the second is a simplification of our dynamic model where the retailer is not strategic. The dynamic game-theoretic model performs better than either benchmark.
An Analog Circuit Fault Characterization Methodology
Authors: Yvan Maidon, Thomas Zimmer, André Ivanov
Venue: Journal of Electronic Testing: Theory and Applications (2005)

A methodology for diagnosing and characterizing multiple faults in analog circuits, and results from applying this methodology to a real circuit is presented. Our method is a novel combination of a Simulation Before Test (SBT) and Interpolation After Test (IAT) methodology. Our method uses the classical SBT concept of a fault dictionary database constructed before test. It also uses a method of IAT that consists in using the measurements to guide an interpolation algorithm to effectively increase the local resolution of the fault dictionary database and thereby yield the most likely test parameter value. Our method's underlying principle is to characterize the fault-free and faulty circuit cases by their impulse responses obtained by simulation and subsequently stored in a fault dictionary database. The method uses the technique of Lagrange interpolation to resolve the faults between the fault dictionary database entries and the actual measurements. Our experimental results reveal that the method is effective for characterizing faults when the simulations match the measurements sufficiently. Consequently, the method's effectiveness depends highly on the quality of the models used to build the dictionary as well as on the accuracy of the measurements.
Performance of Fault-Tolerant Distributed Shared Memory on Broadcast- and Switch-Based Architectures
Authors: Constantine Katsinis
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

This paper presents a set of distributed-shared-memory protocols that provide fault tolerance on broadcast-based and switch-based architectures with no decrease in performance. These augmented DSM protocols combine the data duplication required by fault tolerance with the data duplication that naturally results in distributed-sharedmemory implementations. The recovery memory at each backup node is continuously maintained consistent and is accessible by all processes executing at the backup node. Simulation results show that the additional data duplication necessary to create fault-tolerant DSM causes no reduction in system performance during normal operation and eliminates most of the overhead at checkpoint creation. Data blocks which are duplicated to maintain the recovery memory are also utilized by the DSM protocol, reducing network traffic, and increasing the processor utilization significantly. We use simulation and multiprocessor address trace files to compare the performance of a broadcast architecture called the SOME-Bus to the performance of two representative switch architectures.
A semi-persistent clustering technique for VLSI circuit placement
Authors: Charles Alpert, Andrew Kahng, Gi-Joon Nam, Sherief Reda, Paul Villarrubia
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant portion of the over-all physical synthesis runtime. With complexity and netlist size of today's VLSI design growing rapidly, clustering for placement can provide an attractive solution to manage affordable placement runtime. Such clustering, however, has to be carefully devised to avoid any adverse impact on the final placement solution quality. In this paper we present a new bottom-up clustering technique, called best-choice, targeted for large-scale placement problems. Our best-choice clustering technique operates directly on a circuit hypergraph and repeatedly clusters the globally best pair of objects. Clustering score manipulation using a priority-queue data structure enables us to identify the best pair of objects whenever clustering is performed. To improve the runtime of priority-queue-based best-choice clustering, we propose a lazy-update technique for faster updates of clustering score with almost no loss of solution quality. We also discuss a number of effective methods for clustering score calculation, balancing cluster sizes, and handling of fixed blocks. The effectiveness of our best-choice clustering methodology is demonstrated by extensive comparisons against other standard clustering techniques such as Edge-Coarsening [12] and First-Choice [13]. All clustering methods are implemented within an industrial placer CPLACE [1] and tested on several industrial benchmarks in a semi-persistent clustering context.
A Maintenance-Oriented Fault Model for the DECOS Integrated Diagnostic Architecture
Authors: P. Peti, R. Obermaisser, A. Ademaj, H. Kopetz
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The increasing use of electronics in the automotive and avionic domain has lead to dramatic improvements with respect to functionality, safety, and cost. However, with this growth of electronics the likelihood of failures due to faults originating from electronic equipment also increases. In order to tackle prevalent diagnostic problems such as the reduction of the fault-not-found ratio, a maintenance-oriented fault model is needed that serves as the basis for the classification of experienced failures. In this paper we introduce such a maintenance-oriented fault model that establishes the conceptual foundation of the diagnostic services of the DECOS integrated architecture. The fault model takes the component-based nature of today's distributed embedded systems into account. According to this model each experienced failure is classified according to the field replaceable units of the system.
Blind identification and equalization of two-channel FIR systems in unbalanced noise environments
Authors: Roberto Diversi, Roberto Guidorzi, Umberto Soverini
Venue: Signal Processing (2005)

Blind identification is a very significant problem in many contexts where only the output of transmission channels can be observed. The solutions that can be found in the literature are limited to the case of equal amounts of additive noise on the observations. This paper proposes new identification procedures that can be applied to the case of two FIR channels affected by unknown and unbalanced amounts of additive noise. The identified models are then used for the minimal variance deconvolution of the unknown input signal. Several Monte Carlo simulations also confirm the good performance of these procedures in severe SNR conditions.
On optimal service selection
Authors: P. A. Bonatti, P. Festa
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet been extensively studied. In this paper we formalize three kinds of optimal service selection problems, based on different criteria. Then we study their complexity and implement solutions. We prove that one-time costs make the optimal selection problem computationally hard; in the absence of these costs the problem can be solved in polynomial time. We designed and implemented both exact and heuristic (suboptimal) algorithms for the hard case, and carried out a preliminary experimental evaluation with interesting results.
A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds
Authors: Weng-Long Chang, Chih-Ping Chu, Jia-Hwa Wu
Venue: The Journal of Supercomputing (2005)

Multi-dimensional arrays with linear subscripts occur quite frequently in real programs. For multi-dimensional linear arrays under variable bounds as well as any given direction vectors, the generalized Lambda test is an efficient and precise data dependence method to check whether there exist real-valued solutions. In this paper, we propose a multi-dimensional generalized interval test--a polynomial-time dependence test that can be applied towards testing whether there are integer-valued solutions for multi-dimensional linear arrays under variablelimits and any given direction vectors. Experimental results with benchmark showing the effects of the multi-dimensional generalized interval test over the generalized Lambda test are also presented.
A Discriminative Framework for Modelling Object Classes
Authors: Alex Holub, Pietro Perona
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Here we explore a discriminative learning method on underlying generative models for the purpose of discriminating between object categories. Visual recognition algorithms learn models from a set of training examples. Generative models learn their representations by considering data from a single class. Generative models are popular in computer vision for many reasons, including their ability to elegantly incorporate prior knowledge and to handle correspondences between object parts and detected features. However, generative models are often inferior to discriminative models during classification tasks. We study a discriminative approach to learning object categories which maintains the representational power of generative learning, but trains the generative models in a discriminative manner. The discriminatively trained models perform better during classification tasks as a result of selecting discriminative sets of features. We conclude by proposing a multi-class object recognition system which initially trains object classes in a generative manner, identifies subsets of similar classes with high confusion, and finally trains models for these subsets in a discriminative manner to realize gains in classification performance.