ppxscal/embedding_network huggingface dataset:
Predicting the Cumulative Effect of Multiple Query Formulations
Authors: Isak Taksa
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Multiple query formulations (MQF) have been extensively explored and when used, provide considerable improvements in quality of information retrieval on the Web. However, the question of how to formulate a variety of distinctive queries and how many queries are needed in each unique case remains essentially unanswered. In this research we present a process for selecting search terms and formulating multiple short queries from the original long query. We introduce a Scaled Cumulative Query Weight (¿) function which is based exclusively on the submitted long query. We demonstrate that this function can serve as a predictive variable for the effectiveness of various multiple query formulation methods and can be used algorithmically to determine the operational parameters for a multiple query formulation process.
The Yearly Review, or How to Evaluate Your Sys Admin
Authors: Carrie Gates, Jason Rouse
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

While some work has discussed hiring system administrators, and other work has focused on the technical and mechanical requirements for terminating a system administrator, there has been very little published regarding how to review or evaluate a system administrator. This paper presents one approach to doing such a review, followed by scenarios that explore the approach. The system developed in this paper has the aim of creating measurable goals that a competent system administrator should be able to achieve. We also discuss when the use of this model is appropriate, its strengths and weaknesses, and the responsibilities placed on management if this model is used.
QoS-aware radio resource management scheme for CDMA cellular networks based on dynamic interference guard margin (IGM)
Authors: Huan Chen, Sunil Kumar, C.-C. Jay Kuo
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

Efficient radio resource management (RRM) for CDMA-based cellular communication systems using the interference guard margin (IGM) scheme is investigated in this work. Two important concepts, i.e., the guard channel (GC) and the load curve (LC), are integrated to derive IGM. The resulting call admission control (CAC) scheme gives preferential treatment to higher priority handoff calls by pre-reserving a certain amount of resource in terms of IGM. A radio resource estimation (RRE) function is implemented in each base station (BS) to assist RRM module to adjust the level of IGM dynamically. RRE in each BS estimates the amount of IGM by considering traffic load in its current cell as well as traffic conditions in neighboring cells. A service model is adopted to support quality of service (QoS) demand of multiple services, which includes mobile terminal's data rate, different levels of priorities, mobility and rate adaptivity characteristics. Simulations are conducted by OPNET to study performance of the proposed IGM scheme in terms of a defined cost function, new call blocking probability, handoff dropping probability and system utilization, under different traffic conditions.
A hardware version of the RSA using the Montgomery's algorithm with systolic arrays
Authors: Ali Ziya Alkar, Remziye Sönmez
Venue: Integration, the VLSI Journal (2004)

Rivest-Shamir-Adleman (RSA) is one of the most widely preferred algorithms used in public-key cryptography systems. RSA has a very slow ciphering rate if used in software. The use of a specific hardware is the only reasonable solution in applications where performance is the key factor. To speed up the modular multiplication and squaring, bit level systolic arrays are used with the Montgomery's modular multiplication algorithm to constitute the core of modular exponentiation operation. The squaring systolic structure is also performed in parallel with the systolic multiplication in the modular exponentiation. The novel idea in this paper is to use the systolic array cells with increased performance of up to 20% and use them in a single row organization. The final RSA design is configurable and can operate both for encryption and decryption. 1024-bit RSA algorithm is designed for the Xilinx Virtex FPGA and 0.7 µ ASIC.
University of Massachusetts: MUC-3 test results and analysis
Authors: Wendy Lehnert, Claire Cardie, David Fisher, Ellen Riloff, Robert Williams
Venue: Proceedings of the 3rd conference on Message understanding (1991)

We believe that the score reports we obtained for TST2 provide an accurate assessment of our system's capabilities insofar as they are consistent with the results of our own internal tests conducted near the end of phase 2.. The required TST2 score reports indicate that our system achieved the highest combined scores for recall (51%) and precision (62%) as well as the highest recall score of all the MUC-3 systems under the official MATCHED/MISSING scoring profile.
A Fast Morphological Algorithm for Color Image Multi-Scale Segmentation Using Vertex-Collapse
Authors: Peng Qimin, Jia Yunde
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper proposes a fast morphological algorithm for color image multi-scale segmentation based on connected sets using vertex-collapse algorithm. Color morphological operators are defined based on a special full order relation of color vectors in HSV model. Morphological opening-closing operators are implemented using vertex-collapse algorithm to form a nonlinear scale space. Both area and color are considered to calculate the similarity between adjacent regions, and entropy criterion is adopted to control the content contained in the finial scale tree. The experimental result shows that the image is segmented efficiently with perfect shape preserving.
When participants do the capturing: the role of media in diary studies
Authors: Scott Carter, Jennifer Mankoff
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper, we investigate how the choice of media for capture and access affects the diary study method. The diary study is a method of understanding participant behavior and intent in situ that minimizes the effects of observers on participants. We first situate diary studies within a framework of field studies and review related literature. We then report on three diary studies we conducted that involve photographs, audio recordings, location information and tangible artifacts. We then analyze our findings, specifically addressing the following questions: How do context information and episodic memory prompts captured by participants vary with media? In what way do different media "jog" memory? How do different media affect the diary study process? These questions are particularly important for diary studies because they can be especially useful as compared to other methods when a participant intends to do an action but does not or when actions are particularly difficult to sense. We also built and tested a tool based on participant and researcher frustrations with the method. Our contribution includes suggested modifications to traditional diary techniques that enable annotation and review of captured media; a new variation on the diary study appropriate for researchers using digital capture media; and a lightweight tool to support it, motivated by past work and findings from our studies.
Learning a Multi-Size Patch-Based Hybrid Kernel Machine Ensemble for Abnormal Region Detection in Colonoscopic Images
Authors: Peng Li, Kap Luk Chan, S. M. Krishnan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

When detecting abnormalities in colonoscopic images, the location, shape and size of the abnormal regions in the image are unknown and vary across images. It is difficult to determine the appropriate patch-size for patch-based approach. So multi-size patches are used simultaneously to represent the image regions and an ensemble is constructed in which each classifier handles one patch size. The combination of classifiers trained using multiple-size patches can recognize abnormal regions more effectively than only using single-size patches. The classification of the image patches can be performed using a discriminative binary Support Vector Machine (SVM) or a recognition-based one-class SVM. Integration of the two types of SVMs is expected to further improve abnormal region detection. Experimental results show the good performance of our proposed ensemble.
ECG baseline wander and powerline interference reduction using nonlinear filter bank
Authors: Jacek M. Łȩski, Norbert Henzel
Venue: Signal Processing (2005)

Methods of noise reduction have decisive influence on performance of all electrocardiographic (ECG) signal processing systems. This work deals with problems of baseline wander and powerline interference reduction. It is impossible to reduce effectively these disturbances without signal distortion using a linear filtering approach. Another disadvantage of the linear filters is their long impulse response. This leads to inadmissibly large delay in ECG signal analysis in monitoring and exercise electrocardiography. This work presents a new class of nonlinear filters without these disadvantages. Additionally, using a bank of these filters, powerline interference reduction is possible. Performance of the new method is experimentally compared with the traditional methods of baseline wander reduction using synthetic as well as the signals from the CTS-ECG database.
Personalized Email Management at Network Edges
Authors: Jayashree Ravi, Weisong Shi, Cheng-Zhong Xu
Venue: IEEE Internet Computing (2005)

A new technique for managing and disseminating Web-based email prefetches messages and generates dynamic pages displaying them at the network edge. Compared to other popular Web-based email servers, the PACE //au: spell out?// prototype shows an improved performance with respect to user-perceived latency up to 93 percent. Additionally, giving PACE a centralized neural-network-based personalized spam filter will filter spam and viruses at the servers origin, thus saving bandwidth.
Object-oriented design patterns for debugging heterogeneous languages and virtual machines
Authors: Dale Parson, David J. Murray, Yu Chen
Venue: Software&mdash;Practice Experience (2005)

Debugging multi-language software systems requires examining and executing these systems at multiple levels of abstraction. Embedded systems, for example, often comprise a mix of assembly language device drivers and C language control code. Embedded systems increasingly utilize Java to support dynamic loading and run-time reconfiguration. The RTEEM &lpar;Research version of the Tcl Environment for Extensible Modeling&rpar; debugger employs three design patterns in solving the problems of multi-language embedded system debugging. The Reflective virtual machine &lpar;VM&rpar; pattern models a language-neutral virtual machine abstraction, with language-specific interfaces extending this abstraction. Reflection allows a debugger to inspect and control a target VM. The Chain of Responsibility is a classic pattern used to arrange language-specific debugger command interpreters in a delegation chain. All interpreters share a single command syntax, but each interpreter adapts commands to its language abstraction by interacting with its language-specific VM view. Composite is another classic pattern, used to combine objects into tree structures. RTEEM employs it to aggregate VM debugger chains into a hierarchy that supports uniform command syntax for debugging threads, processes, multiprocessor systems, and compositions of these entities. This paper illustrates how combining two classic design patterns with the VM abstraction as a pattern results in an architecture that is powerful and flexible in adapting to the debugging needs of heterogeneous, distributed embedded systems. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Adaptive control of heterogeneous ad hoc networks: Research Articles
Authors: S. S. Kulkarni, G. R. Dattatreya, H. Martinez, R. Soto
Venue: Wireless Communications Mobile Computing (2004)

Heterogeneous ad hoc networks are proposed as a solution to the scalability problem in pure ad hoc networks. Some of the links in heterogeneous networks have a much longer wireless transmission range (in one or more of their channels) than the other links. We study simple approaches for adaptive operation and performance optimization of such networks. Our study includes the following: (a) Use of very simple functions of observed performance for adaptive control; (b) Accommodation of an operational constraint imposed by a higher layer in the network. In this case, traffic from a forwarding node to a neighboring node, meant for an eventual destination, can be multiplexed over either long range links or over short range links but not both; (c) Route selection using extremely simple, predetermined criteria; (d) Performance comparison of the above three simplified approaches to the original algorithm of Reference [4]. The original algorithm is computationally more accurate, but handicapped by the absence of long range links.Our approaches are illustrated with simulation experiments on heterogeneous ad hoc networks fielding synthetic self-similar (bursty) traffic. The performance comparisons of the approaches are presented for both fixed as well as dynamic network topologies. They emphasize the advantage of heterogeneous network operation over a pure ad hoc network, all nodes in the latter being functionally identical. Copyright &copy; 2004 John Wiley & Sons, Ltd.
"Beating" Fitts' law: virtual enhancements for pointing facilitation
Authors: Ravin Balakrishnan
Venue: International Journal of Human-Computer Studies (2004)

We survey recent research into new techniques for artificially facilitating pointing at targets in graphical user interfaces. While pointing in the physical world is governed by Fitts' law and constrained by physical laws, pointing in the virtual world does not necessarily have to abide by the same constraints, opening the possibility for "beating" Fitts' law with the aid of the computer by artificially reducing the target distance, increasing the target width, or both. The survey suggests that while the techniques developed to date are promising, particularly when applied to the selection of single isolated targets, many of them do not scale well to the common situation in graphical user interfaces where multiple targets are located in close proximity.
Gait Analysis for Human Identification in Frequency Domain
Authors: Shiqi Yu, Liang Wang, Weiming Hu, Tieniu Tan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, we analyze the spatio-temporal human characteristic of moving silhouettes in frequency domain, and find key Fourier descriptors have better discriminatory capability for recognition than other Fourier descriptors. A large number of experimental results and analysis show that the proposed algorithm based on the key Fourier descriptors can not only reduce the gait data dimensionality greatly, but also lighten the computation cost, with a satisfactory CCR. Besides that, classification performance can be further improved using feature fusion.
Optical implementation of the Kak neural network
Authors: A. Shortt, J. G. Keating, L. Moulinier, C. N. Pannell
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

We show that the Kak neural network is suitable for optical implementation using a bipolar matrix vector multiplier. We demonstrate how the CC4 algorithm, with suitable modifications to the structure and training algorithm, may be used to build an optical neural network implementing N-Parity.
Experimental analysis of mode switching techniques in pen-based user interfaces
Authors: Yang Li, Ken Hinckley, Zhiwei Guan, James A. Landay
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Inking and gesturing are two central tasks in pen-based user interfaces. Switching between modes for entry of uninterpreted ink and entry of gestures is required by many pen-based user interfaces. Without an appropriate mode switching technique, pen-based interactions in such situations may be inefficient and cumbersome. In this paper, we investigate five techniques for switching between ink and gesture modes in pen interfaces, including a pen-pressure based mode switching technique that allows implicit mode transition. A quantitative experimental study was conducted to evaluate the performance of these techniques. The results suggest that pressing a button with the non-preferred hand offers the fastest performance, while the technique of holding the pen still is significantly slower and more prone to error than the other techniques. Pressure, while promising, did not perform as well as the non-preferred hand button with our current implementation.
Portability issues for speech recognition technologies
Authors: Lori Lamel, Fabrice Lefevre, Jean-Luc Gauvain, Gilles Adda
Venue: Proceedings of the first international conference on Human language technology research (2001)

Although there has been regular improvement in speech recognition technology over the past decade, speech recognition is far from being a solved problem. Most recognition systems are tuned to a particular task and porting the system to a new task (or language) still requires substantial investment of time and money, as well as expertise. Todays state-of-the-art systems rely on the availability of large amounts of manually transcribed data for acoustic model training and large normalized text corpora for language model training. Obtaining such data is both time-consuming and expensive, requiring trained human annotators with substantial amounts of supervision.In this paper we address issues in speech recognizer portability and activities aimed at developing generic core speech recognition technology, in order to reduce the manual effort required for system development. Three main axes are pursued: assessing the genericity of wide domain models by evaluating performance under several tasks; investigating techniques for lightly supervised acoustic model training; and exploring transparent methods for adapting generic models to a specific task so as to achieve a higher degree of genericity.
Discontinuous Galerkin Methods Applied to Shock and Blast Problems
Authors: N. Chevaugeon, J. Xin, P. Hu, X. Li, D. Cler, J. E. Flaherty, M. S. Shephard
Venue: Journal of Scientific Computing (2005)

We describe procedures to model transient shock interaction problems using discontinuous Galerkin methods to solve the compressible Euler equations. The problems are motivated by blast flows surrounding cannons with perforated muzzle brakes. The goal is to predict shock strengths and blast over pressure. This application illustrates several computational difficulties. The software must handle complex geometries. The problems feature strong interacting shocks, with pressure ratios on the order of 1000 as well as weaker precursor shocks traveling rearward that also must be accurately captured. These aspects are addressed using anisotropic mesh adaptation. A shock detector is used to control the adaptation and limiting. We also describe procedures to track projectile motion in the flow by a level-set procedure.
SuSE Linux Enterprise Server 9 Administrator's Handbook
Authors: Peter Kuo, Niki Rahimi
Venue:  (2005)

As a system administrator, you are justly concerned about the security of your infrastructure. SUSE Linux Enterprise Server (SLES 9) can lead the way to infrastructure security and SUSE Linux Enterprise Server Administrator's Handbook is the authoritative source for information on this secure server. Step-by-step procedures will walk you through installing and securing a SLES 9 system, and it will focus on the specific security features that make SLES 9 an important platform for all system administrators. Some of what you will cover is: SuSE server installation User access and security Installing and configuring networking services Securing your SuSE serverLeverage Linux and open source with SLES 9 and SUSE Linux Enterprise Server Administrator's Handbook to build a secure computing network for your company.
Special issue on knowledge representation
Authors: Ronald J. Brachman, Brian C. Smith
Venue: Issue 70 (February 1980) (1980)

In the fall of 1978 we decided to produce a special issue of the SIGART Newsletter devoted to a survey of current knowledge representation research. We felt that there were twe useful functions such an issue could serve. First, we hoped to elicit a clear picture of how people working in this subdiscipline understand knowledge representation research, to illuminate the issues on which current research is focused, and to catalogue what approaches and techniques are currently being developed. Second -- and this is why we envisaged the issue as a survey of many different groups and projects -- we wanted to provide a document that would enable the reader to acquire at least an approximate sense of how each of the many different research endesvours around the world fit into the field as a whole.It would of course be impossible to produce a final or definitive document accomplishing these goals: rather, we hoped that this survey could initiate a continuing dialogue on issues in representation, a project for which this newsletter seems the ideal forum. It has been many months since our original decision was made, but we are finally able to present the results of that survey. Perhaps more than anything else, it has emerged as a testament to an astounding range and variety of opinions held by many different people in many different places.The following few pages are intended as an introduction to the survey as a whole, and to this issue of the newsletter. We will briefly summarize the form that the survey took, discuss the strategies we followed in analyzing and tabulating responses, briefly review the overall sense we received from the answers that were submitted, and discuss various criticisms which were submitted along with the responses. The remainder of the volume has been designed to be roughly self-explanatory at each point, so that one may dip into it at different places at will. Certain conventions, however, particularly regarding indexing and tabulating, will also be explained in the remainder of this introduction.As editors, we are enormously grateful to the many people who devoted substantial effort to responding to our survey. It is our hope that the material presented here will be interesting and helpful to our readers, and that fruitful discussion of these and other issues will continue energetically and enthusiastically into the future.
Diagnosing multiple transition faults in the absence of timing information
Authors: Jiang Brandon Liu, Magdy Abadir, Andreas Veneris, Sean Safarpour
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

As timing requirements in today's advanced VLSI designs become more aggressive, the need for automated tools to diagnose timing failures increases. This work presents two such algorithms capable of diagnosing multiple delay faults. One method uses multiple transition fault models and the other reasons with ternary logic values, thus achieving model independent diagnosis. Experiments are conducted on IS-CAS'85 combinational and full-scan version of ISCAS'89 se-quential circuits corrupted with multiple transition faults. The performance of both algorithms are evaluated and compared. The results show good efficiency and diagnostic resolution.