ppxscal/embedding_network huggingface dataset:
Efficient Multiclass Object Detection by a Hierarchy of Classifiers
Authors: Xiaodong Fan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We consider detecting object instances from multiple classes on grayscale images. Traditional approaches learn a classifier for each class separately and apply each of them in an exhaustive search over positions and scales. We achieve an efficient detection by organizing the search coarse-to-fine based on a hierarchical partitioning of the entire hypothesis space, the set of all possible object instances, so that groups of hypotheses can be pruned simultaneously without evaluating each one individually. In this paper, we develop an algorithm to jointly learn the hierarchy along with a classifier at each node by exploring the commonparts shared among a group of object instances at all levels in the hierarchy. We also show how the confusions of the initial coarse-to-fine search can be resolved by comparing pairs of conflicting detections using cheap binary classifiers. The wholeprocess is illustrated by detecting and recognizing handwritten digits.
Efficiently Processing Query-Intensive Databases over a Non-Dedicated Local Network
Authors: Pedro Furtado
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Commercial database systems must typically rely on fast hardware platforms and interconnects to deal efficiently with data in parallel. However, cheap computing power can be applied for flexibility and scalability in managing large data volumes if the right choices are made concerning data placement and processing. Our work concentrates on the use of cheap computing power in possibly slow, non-dedicated local networks to achieve a computing power over demanding query-intensive databases that would be unachievable without expensive specialized hardware and massively parallel systems. The Node Partitioned Data Management System (NPDM) works on computing nodes on non-dedicated local networks. In this paper we concentrate on query transformations required for efficient processing over a specialized query-intensive schema. The decision support benchmark TPC-H is used as a study case for the transformations and for experimental analysis.
Practical type checking of functions defined on context-free languages
Authors: Hai-Ming Chen, Yun-Mei Dong
Venue: Journal of Computer Science and Technology (2004)

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF languages is not decidable, a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked. Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.
Grid scheduling by on-line rectangle packing
Venue: Networks (2004)

The Grid computing paradigm is originated from a new computing infrastructure for scientific research and cooperation, and is becoming an established technology for large-scale resource sharing and distributed integration. Two main problems arise: how to efficiently allocate resources to tasks and, after this, how to schedule them. In this article we propose to solve the scheduling phase by means of rectangle packing algorithms. In particular, two on-line rectangle packing algorithms are proposed with the objective of maximizing the system efficiency. A wide computational analysis is provided. The performances of the proposed algorithms are first compared with those of known algorithms on benchmark instances for rectangle packing, and then are evaluated on different Grid scheduling scenarios associated with different processing and dataset environments. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol.44&lpar;2&rpar;, 106&ndash;119 2004
A Parametric Optimization Approach to Walking Pattern Synthesis
Authors: G. Bessonnet, P. Seguin, P. Sardain
Venue: International Journal of Robotics Research (2005)

Walking pattern synthesis is carried out using a spline-based parametric optimization technique. Generalized coordinates are approximated by spline functions of class C3fitted at knots uniformly distributed along the motion time. This high-order differentiability eliminates jerky variations of actuating torques. Through connecting conditions, spline polynomial coefficients are determined as a linear function of the joint coordinates at knots. These values are then dealt with as optimization parameters. An optimal control problem is formulated on the basis of a performance criterion to be minimized, representing an integral quadratic amount of driving torques. Using the above spline approximations, this primary problem is recast into a constrained non-linear optimization problem of mathematical programming, which is solved using a computing code implementing an SQP algorithm. As numerical simulations, complete gait cycles are generated for a seven-link planar biped. The only kinematic data to be accounted for are the walking speeds. Optimization of both phases of gait is carried out globally; it includes the optimization of transition configurations of the biped between successive phases of the gait cycle.
Exception handling in the development of dependable component-based systems
Authors: C. M. F. Rubira, R. de Lemos, G. R. M. Ferreira, F. Castor Filho
Venue: Software&mdash;Practice Experience (2005)

Exception handling is a structuring technique that facilitates the design of software systems by encapsulating the process of error recovery. In this paper, we present a systematic approach for incorporating exceptional behaviour in the development of component-based software. The premise of our approach is that components alone do not provide the appropriate means to deal with exceptional behaviour in an effective manner, hence the need to consider the notion of collaborations for capturing the interactive behaviour between components when error recovery involves more than one component. The feasibility of the approach is demonstrated in terms of the mining control system case study. Copyright &copy; 2004 John Wiley & Sons, Ltd.
DiSigncryption: An Integration of Agent-Based Signature Delegation with Distributed Reputation Management Scheme
Authors: O. Bamasak, N. Zhang, D. Edwards
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

This paper presents a Distributed Signcryption with Verifiable Partial Signature (DiSigncryption) protocol that allows a mobile agent owner, participating in ecommerce transaction, to securely delegate and distribute his/her signing capability among a set of trusted third party hosts (TTP-hosts) via a mobile agent. The protocol incorporates three schemes: a novel Distributed Reputation Management scheme, a modified version of the Distributed Signcryption method proposed in [Distributed Signcryption], and the Agent-based Threshold Proxy Signcryption (ATPS) protocol proposed in [A Secure Proxy Signature Protocol for Agent-Based M-Commerce Applications]. The most notable feature of the DiSigncryption protocol is that, in addition to allowing secure distributed proxy signature generation, it enables the agent owner to quantitatively assess the trust and reliability of each of the TTP-hosts that s/he has dealt with. These trust and reliability values are then aggregated into an index to guide the agent owner in making his/her decision as which TTP-hosts should be used in his/her next dealing. The security properties of the proposed protocol are analyzed, and the protocol is compared with the most related work.
Spyware be gone!
Authors: Aaron Weiss
Venue: netWorker (2005)

The times they are a-changing: White is the new black. Thirty is the new 20. And spyware is the new spam---with a dash of virus mixed in for good measure. (Of course, we still have plenty of original-flavor spam and viruses hanging around, too). What the old-school intruders have going for them is that they are relatively straightforward to define. Spyware, in its broadest sense, is harder to pin down. Yet many feel, as the late Supreme Court Justice Potter Stewart once said, "I know it when I see it."
Obstacle Avoidance Control System of Rotary Crane Using Proposed Haptic Joystick
Authors: Atsushi Takemoto, Ken'ichi Yano, Kazuhiko Terashima
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The Purpose of this paper is to explore the development of a semi-automatic man-machine safety control system that combines manual instructionsfrom an operator with the automatic control of a machine. First, in order to obtain operational support, we employed a special joystick system which provided suggestive information to a crane operator via haptic feedback, Second, an integrated system comprised of a restriction system for rotational angle and boom-luffing angle [1], as well as an obstacle avoidance system was built. Finally, the effectiveness of the proposed obstacle avoidance control system using haptic control was validated through experiments.
University of Maryland/ConQuest: description of the ICTOAN system as used for MUC-4
Authors: James Mayfield
Venue: Proceedings of the 4th conference on Message understanding (1992)

The ICTOAN system is a natural language processing system developed jointly by ConQuest, Inc. and the University of Maryland Baltimore County. The system was written from scratch during the first five months of 1992 using an estimated eight person-months of labor. The template generation routines were reused from our MUC-3 system [1], providing leverage of perhaps one person-month. Adaptation of software designed for the ConQuest text retrieval system provided leverage of another six person-months.
A case study on choosing normalization methods and test statistics for two-channel microarray data: Research Articles
Authors: Yang Xie, Kyeong S. Jeong, Wei Pan, Arkady Khodursky, Bradley P. Carlin
Venue: Comparative and Functional Genomics (2004)

DNA microarray analysis is a biological technology which permits the whole genome to be monitored simultaneously on a single slide. Microarray technology not only opens an exciting research area for biologists, but also provides significant new challenges to statisticians. Two very common questions in the analysis of microarray data are, first, should we normalize arrays to remove potential systematic biases, and if so, what normalization method should we use? Second, how should we then implement tests of statistical significance? Straightforward and uniform answers to these questions remain elusive. In this paper, we use a real data example to illustrate a practical approach to addressing these questions. Our data is taken from a DNA&ndash;protein binding microarray experiment aimed at furthering our understanding of transcription regulation mechanisms, one of the most important issues in biology. For the purpose of preprocessing data, we suggest looking at descriptive plots first to decide whether we need preliminary normalization and, if so, how this should be accomplished. For subsequent comparative inference, we recommend use of an empirical Bayes method (the B statistic), since it performs much better than traditional methods, such as the sample mean (M statistic) and Student's t statistic, and it is also relatively easy to compute and explain compared to the others. The false discovery rate (FDR) is used to evaluate the different methods, and our comparative results lend support to our above suggestions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Derandomizing polynomial identity tests means proving circuit lower bounds
Authors: Valentine Kabanets, Russell Impagliazzo
Venue: Computational Complexity (2004)

We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or even nondeterministic subexponential time, infinitely often) whether a given arithmetic circuit over integers computes an identically zero polynomial, then either (i) NEXP ⊄ P/poly or (ii) Permanent is not computable by polynomial-size arithmetic circuits. We also prove a (partial) converse: If Permanent requires superpolynomial-size arithmetic circuits, then one can test in subexponential time whether a given arithmetic circuit of polynomially bounded degree computes an identically zero polynomial.Since Polynomial Identity Testing is a coRP problem, we obtain the following corollary: If RP = P (or even coRP ⊆ ∩ε > 0 NTIME(2nε), infinitely often), then NEXP is not computable by polynomial-size arithmetic circuits. Thus establishing that RP = coRP or BPP = P would require proving superpolynomial lower bounds for Boolean or arithmetic circuits. We also show that any derandomization of RNC would yield new circuit lower bounds for a language in NEXP.We also prove unconditionally that NEXPRP does not have polynomial-size Boolean or arithmetic circuits. Finally, we show that NEXP ⊄ P/poly if both BPP = P and low-degree testing is in P; here low-degree testing is the problem of checking whether a given Boolean circuit computes a function that is close to some low-degree polynomial over a finite field.
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems
Authors: Tallys H. Yunes, Arnaldo V. Moura, Cid C. de Souza
Venue: Transportation Science (2005)

This article considers the overall crew management problem arising from the daily operation of an urban transit bus company that serves the metropolitan area of the city of Belo Horizonte, Brazil. Due to its intrinsic complexity, the problem is divided in two distinct subproblems:crew scheduling andcrew rostering. We have investigated each of these problems using mathematical programming (MP) and constraint logic programming (CLP) approaches. In addition, we developed hybrid column generation algorithms for solving these problems, combining MP and CLP. The hybrid algorithms always performed better, when obtaining optimal solutions, than the two previous isolated approaches. In particular, they proved to be much faster for the scheduling problem. All the proposed algorithms have been implemented and tested over real-world data obtained from the aforementioned company. The coefficient matrix of the linear program associated with some instances of the scheduling problem contains tens of millions of columns; this number is even larger for the rostering problem. The analysis of our experiments indicates that it was possible to find high-quality, and many times optimal, solutions that were suitable for the company's needs. These solutions were obtained within reasonable computational times on a desktop PC.
Effects of tiled high-resolution display on basic visualization and navigation tasks
Authors: Robert Ball, Chris North
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Large high-resolution screens are becoming increasingly available and less expensive. This creates potential advantages for data visualization in that more dense data and fine details are viewable at once. Also, less navigation may be needed to see more data. However, little work has been done to determine the effectiveness of large high-resolution displays, especially for basic low-level data visualization and navigation tasks. This paper describes an exploratory study on the effects of a large tiled display with a resolution of 3840x3072 as compared to two smaller displays (1560x2048 and 1280x1024). We conclude that, with finely detailed data, higher resolution displays that use physical navigation significantly outperform smaller displays that use pan and zoom navigation. Qualitatively, we also conclude that use of the larger display is less stressful and creates a better sense of confidence than the smaller displays.
Web-based 3D visualization in a digital library of mathematical functions
Authors: Qiming Wang, Bonita Saunders
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

The National Institute of Standards and Technology (NIST) is developing a digital library of mathematical functions to replace the widely used National Bureau of Standards Handbook of Mathematical Functions [Abramowitz and Stegun 1964]. The NIST Digital Library of Mathematical Functions (DLMF) will provide a wide range of information about high level functions for scientific, technical and educational users in the mathematical and physical sciences. Clear, concise 3D visualizations that allow users to examine poles, zeros, branch cuts and other key features of complicated functions will be an integral part of the DLMF. Specially designed controls will enable users to move a cutting plane through the function surface, select the surface color mapping, choose the axis style, or transform the surface plot into a density plot. To date, Virtual Reality Modeling Language and Extensible 3D (VRML/X3D) standards have been used to implement these capabilities in more than one hundred 3D visualizations for the DLMF. We discuss the development of these visualizations, focusing on the design and implementation of the VRML code, and show several examples.
Automatic Sign Language Analysis: A Survey and the Future beyond Lexical Meaning
Authors: Sylvie C. W. Ong, Surendra Ranganath
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Research in automatic analysis of sign language has largely focused on recognizing the lexical (or citation) form of sign gestures as they appear in continuous signing, and developing algorithms that scale well to large vocabularies. However, successful recognition of lexical signs is not sufficient for a full understanding of sign language communication. Nonmanual signals and grammatical processes which result in systematic variations in sign appearance are integral aspects of this communication but have received comparatively little attention in the literature. In this survey, we examine data acquisition, feature extraction and classification methods employed for the analysis of sign language gestures. These are discussed with respect to issues such as modeling transitions between signs in continuous signing, modeling inflectional processes, signer independence, and adaptation. We further examine works that attempt to analyze nonmanual signals and discuss issues related to integrating these with (hand) sign gestures. We also discuss the overall progress toward a true test of sign recognition systems¿dealing with natural signing by native signers. We suggest some future directions for this research and also point to contributions it can make to other fields of research. Web-based supplemental materials (appendicies) which contain several illustrative examples and videos of signing can be found at www.computer.org/publications/dlib.
Focused crawling by exploiting anchor text using decision tree
Authors: Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of strategy for prioritizing unvisited URLs is crucial. In this paper, we propose a method using a decision tree on anchor texts of hyperlinks. We conducted experiments on the real data sets of four Japanese universities and verified our approach.
Extending desktop applications to the web
Authors: Arno Puder
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Web applications have become the major means to allow ubiquitous access to backend systems via a web browser. Several technologies such as JSP, ASP.NET, or Java Server Faces exist today that help in developing web applications. These technologies do not support the migration of existing legacy desktop applications written with a GUI class library such as Swing, Qt, or GTK to web applications. The framework presented in this paper allows the programmer to expose arbitrary desktop applications as web applications without requiring any changes in the source code of that application. Dialogs are rendered using HTML and JavaScript and a flexible event model transparently forwards user interaction at a web browser to the application running at the backend. By employing a cross-language compiler it is also possible to transparently execute parts of the application on the client side inside the web browser.
Extending component-based design with hardware components
Authors: Péter Arató, Zoltán Ádám Mann, András Orbán
Venue: Science of Computer Programming (2005)

In order to cope with the increasing complexity of system design, component-based software engineering advocates the reuse and adaptation of existing software components. However, many applications--particularly embedded systems--consist of not only software, but also hardware components. Thus, component-based design should be extended to systems with both hardware and software components.Such an extension is not without challenges though. The extended methodology has to consider hard constraints on performance as well as different cost factors. Also, the dissimilarities between hardware and software (such as level of abstraction, communication primitives, etc.) have to be resolved.In this paper, the authors propose such an extended component-based design methodology to include hardware components as well. This methodology allows the designer to work at a very high level of abstraction, where the focus is on functionality only. Non-functional constraints are specified in a declarative manner, and the mapping of components to hardware or software is determined automatically based on those constraints in the so-called hardware/software partitioning step.Moreover, a tool is presented supporting the new design methodology. Beside automating the partitioning process, this tool also checks the consistency between hardware and software implementations of a component.The author also present a case study to demonstrate the applicability of the outlined concepts.
Adaptive Filters for the Dependable Control of Autonomous Robot Systems
Authors: Karl-Erwin Grosspietsch
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

In this paper, we discuss the use of adaptive filters for the control also of complex autonomous robot systems. A concept is presented to solve the resulting problem complexity by merging rulebased approaches with adaptive control, thus balancing a coarsening of the configuration/decision space by the implicit exploitation of former experience, encoded in a history array. Future work will be focussed on the detail evaluation of the approach and its implementation for a climbing robot application.
UNL/USL: MUC-3 test results and analysis
Authors: Jitender S. Deogun, Vijay V. Raghavan
Venue: Proceedings of the 3rd conference on Message understanding (1991)

This report describes the results from the required run in addition to the five optional runs for the MUC-3 task. One purpose of the optional runs is to investigate the precision-recall tradeoff. Two of the optional runs (options 1 and 4) were also submitted to NOSC, making up a total of three official runs.