ppxscal/embedding_network huggingface dataset:
Techniques for improving efficiency and accuracy of contemporary dynamic branch predictors
Authors: Angkul Kongmunvattana
Venue:  (2005)

Efficient branch predictions can significantly increase processor throughput by allowing an instruction stream to flow continuously without waiting for branch outcomes. Three major paradigms in branch prediction schemes, per-address two-level, global-history, and neural-learning branch predictors, are discussed in this dissertation. I have selected three most efficient branch predictors, one from each paradigm, and proposed robust mechanisms to help mitigate their possible shortcomings. While per-address two-level branch predictors experience low branch interference, their implementation costs are too expensive. I propose a scalable per-address (SPA) predictor that leverages value locality in the history of branch outcomes to reduce the size of pattern history table (PHT) by about 50%, while maintaining high prediction accuracy. Moreover, alternative designs of SPA predictor are proposed to reduce internal conflicts within the PHT and improve its prediction accuracy. Experimental results reveal that a SPA predictor with 4-way set-associative PHT using 7 tag bits yields the highest prediction accuracy. I propose and evaluate two alternate designs of YAGS (Yet Another Global Scheme) predictor, one of the most efficient global-history branch prediction schemes, to improve its prediction accuracy. The first method combines two direction PHTs to increase the overall space utilization. The second uses 3-bit counters in the choice PHT to keep branch biases more stable. Experimental results show that the merging scheme benefits small branch predictors the most, making it suitable for embedded microprocessors. Meanwhile, the 3-bit-counter approach has the most impact on large branch predictors, which makes it suitable for superscalar microprocessors. Finally, I propose to improve prediction accuracy of the O-GEHL (Optimized GEometric History Length) predictor, a neural-learning branch predictor that won in an international branch prediction contest. First method uses an adaptive adjustment of branch history lengths to increase space utilization in the first predictor table, consequently improving prediction accuracy in most cases, particularly in floating-point and integer benchmarks. Moreover, adding an extra predictor table using space saved from the sharing of hysteresis bits increases the accuracy of large branch predictors, implying that the predictor is likely to benefit from an increased number of tables more than an increased number of table entries.
An analysis of a high-performance japanese question answering system
Authors: Hideki Isozaki
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2005)

Twenty-five Japanese Question Answering systems participated in NTCIR QAC2 subtask 1. Of these, our system SAIQA-QAC2 performed the best: MRR &equals; 0.607. SAIQA-QAC2 is an improvement on our previous system SAIQA-Ii that achieved MRR &equals; 0.46 for QAC1. We mainly improved the answer-type determination module and the retrieval module. In general, a fine-grained answer taxonomy improves QA performance but it is difficult to build an accurate answer extraction module for the fine-grained taxonomy because Machine Learning methods require a huge training corpus and hand-crafted rules are hard to maintain. Therefore, we built a fine-grained system by using a coarse-grained named entity recognizer and a Japanese lexicon &ldquo;Nihongo Goi-taikei.&rdquo; Our experiments show that named entity/numerical expression recognition and word sense-based answer extraction mainly contributed to the performance. In addition, we developed a new proximity-based document retrieval module that performs better than BM25. We also compared its performance with MultiText, a conventional proximity-based retrieval method developed for QA.
Computer-assisted planning model for school districts
Authors: Robert A. Nielsen, Vincent R. LoCascio
Venue: ACM SIGSIM Simulation Digest (1972)

As demands for improved public school education intensify and become increasingly uncompromising, educators are striving to learn how to make critical decisions better and more quickly. While they recognize the need for installing sophisticated planning and control systems, they also realize that from a practical standpoint such systems must carry a reasonable price tag, require only a moderate amount of time to implement, and be simple enough for non-technical people to understand and use.
A teaching module to introduce encryption for web users
Authors: Randall C. Reid, Richard G. Platt, June Wei
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

This paper presents the components of a module of approximately two hours duration that is designed to expose students to the basic functioning of a private/public key encryption system and how it is employed in the web environment. The intended audience is students with basic computer literacy skills. The focus of the paper is the uses of encryption without focusing on the underlying mathematics of encryption. Since the Internet is an unsecured and relatively unregulated medium, the user must be able to identify the level of confidentiality, integrity, and accessibility that the different uses of encryption will provide. The module provides an efficient way of presenting the techniques, issues, and nomenclature of current encryption systems to a relatively unsophisticated audience in a limited period of time.
A swarm algorithm for wayfinding in dynamic virtual worlds
Authors: Ji Soo Yoon, Mary Lou Maher
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Wayfinding is a cognitive element of navigation that allows people to plan and form strategies prior to executing them. Wayfinding in large scale virtual environments is a complex task and even more so in dynamic virtual worlds. In these dynamic worlds everything, including the objects, the paths, and the landmarks, may be created, deleted, and moved at will. We propose a wayfinding tool using swarm creatures to aid users in such dynamic environments. The tool produces dynamic trails leading to desired destinations and generates teleport/warp gates. These are created as a consequence of swarm creatures exploring dynamic worlds. In this paper, we describe the swarm algorithms developed to create such a tool to generate wayfinding aids in dynamic virtual worlds.
Data Mining in the Analysis of Internet Performance as Perceived by End-Users
Authors: Leszek Borzemski
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In this paper we propose data mining analysis of Internet performance data. The research is aimed at characterization of Web performance as seen by the end-users. Our strategy involves discovering knowledge that characterizes Web performance perceived by end-users and then making use of this knowledge to guide users in further Internet usage. Our two-phase data mining decision model can predict RTT and throughput behavior when downloading Web objects. The data is collected by the Wing measurement infrastructure. Real measurements data is used in model evaluation. We show that the number of correct classifications is high (76%-93%).
Content-based video indexing for sports applications using integrated multi-modal approach
Authors: Dian Tjondronegoro, Yi-Ping Phoebe Chen, Binh Pham
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

To sustain an ongoing rapid growth of video information, there is an emerging demand for a sophisticated content-based video indexing system. However, current video indexing solutions are still immature and lack of any standard. This doctoral consists of a research work based on an integrated multi-modal approach for sports video indexing and retrieval. By combining specific features extractable from multiple audio-visual modalities, generic structure and specific events can be detected and classified. During browsing and retrieval, users will benefit from the integration of high-level semantic and some descriptive mid-level features such as whistle and close-up view of player(s).
Test Sequence Construction Using Minimum Information on the Tested System
Authors: V. V. Kuliamin
Venue: Programming and Computing Software (2005)

In the paper, approaches to constructing test sequences are considered in the case where only admissible input actions on the system are known, whereas no information about the states of the system or transitions between them in response to these actions is available. Two approaches to constructing test sequences that guarantee the widest variety of situations arising in the course of testing are suggested. The first approach gives rise to the so-called de Bruijn sequences. The second approach yields sequences covering all states or transitions in all finite automata with the number of states not exceeding a given constant. Both kinds of sequences are related to the combinatorial analysis of words in finite alphabets. Some methods for constructing such sequences are also discussed.
Head-and-shoulder-branching in integer programming
Authors: H. Müller-Merbach
Venue: Issue 32 (April 1983) (1983)

A combination of the branching procedures suggested for integer programming by Land and Doig (1960) and Dakin (1965) is presented. It consists of a controlled number of "head branches" setting a variable equal to integers, and two "shoulder branches" which restrict the value of this variable by a lower bound and by an upper bound, respectively. This branching procedure combines the advantages of both parents techniques.
Inverse multi-objective robust evolutionary design optimization in the presence of uncertainty
Authors: Dudy Lim, Yew-Soon Ong, Bu-Sung Lee
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In many real-world design problems, uncertainties are often present and practically impossible to avoid. Many existing works on Evolutionary Algorithm (EA) for handling uncertainty have emphasized on introducing some prior structure of the uncertainty or noise to the variable domain and conducting sensitivity analysis based on the assumed information. In this paper, we present an evolutionary design optimization that handles the presence of uncertainty with respect to the desired robust performance in mind, which we call an inverse robust design. The scheme, unlike others developed to represent uncertainty does not assume any structure of the uncertainty involved; hence it is particularly useful when there is very little information about the uncertainties available. In our formulation, we model the clustering of uncertain events in families of nested sets using a multi-level optimization searches within the multi-objective evolutionary search. Empirical studies were conducted on synthetic functions to demonstrate that our algorithm converges to a set of designs with non-dominated nominal performances and robustness to the presence of uncertainties.
The touchwindow vs. the wobble switch: computer access for students with cerebral palsy
Authors: Linda D. Bressant
Venue:  (2005)

This study examined the performances of five elementary students with cerebral palsy when they were using two separate switch input devices, the TouchWindow and the Wobble Switch. Dependent variables were the number of switch presses, the number of extraneous switch presses, the number of computer prompts, and the amount of time required to complete six computer tasks. The findings indicate that all participants successfully learned to use the TouchWindow and the Wobble Switch to complete simple cause-and-effect computer games. However, one switch was not determined to be more functional than the other.
A Quantum Version of the Désarménien Matrix
Authors: Anna Stokke
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We use elements in the quantum hyperalgebra to define a quantum version of the Désarménien matrix. We prove that our matrix is upper triangular with ones on the diagonal and that, as in the classical case, it gives a quantum straightening algorithm for quantum bideterminants. We use our matrix to give a new proof of the standard basis theorem for the q-Weyl module. As well, we show that the standard basis for the q-Weyl module and the basis dual to the standard basis for the q-Schur module are related by the quantum Désarménien matrix.
Achieving media portability through local content translation and end-to-end rights management
Authors: David W. Kravitz, Thomas S. Messerges
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

The problem addressed in this paper is that of DRM interoperability. The term DRM interoperability, as used here, refers to approaches that provide for the transfer, from one "upstream" DRM system to another "downstream" DRM system, of DRM protected content and an associated license. We introduce the concept of a Rights Issuer Module (RIM) that is functionally situated in the home network between the upstream device (which includes an upstream-DRM agent) and downstream devices (which each include a downstream-DRM agent). The novelty of our approach lies in the way the RIM handles significant aspects of the translation operations, potentially leaving the upstream and downstream DRM agents intact. Security and implementation advantages of the RIM are discussed. The tradeoffs involved with different RIM implementations are examined.
Empirical evaluation of the tarantula automatic fault-localization technique
Authors: James A. Jones, Mary Jean Harrold
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The high cost of locating faults in programs has motivated the development of techniques that assist in fault localization by automating part of the process of searching for faults. Empirical studies that compare these techniques have reported the relative effectiveness of four existing techniques on a set of subjects. These studies compare the rankings that the techniques compute for statements in the subject programs and the effectiveness of these rankings in locating the faults. However, it is unknown how these four techniques compare with Tarantula, another existing fault-localization technique, although this technique also provides a way to rank statements in terms of their suspiciousness. Thus, we performed a study to compare the Tarantula technique with the four techniques previously compared. This paper presents our study---it overviews the Tarantula technique along with the four other techniques studied, describes our experiment, and reports and discusses the results. Our studies show that, on the same set of subjects, the Tarantula technique consistently outperforms the other four techniques in terms of effectiveness in fault localization, and is comparable in efficiency to the least expensive of the other four techniques.
Identity Based Threshold Proxy Signcryption Scheme
Authors: Meng Wang, Zhijing Liu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

An identity based cryptosystem is a novel type of public cryptographic scheme in which the public keys of the users are their identities or strings derived from their identities. In a ( n t, ) proxy signature scheme, the original signer can delegate his/her signing capability to n proxy signers such that any t or more proxy signers can sign messages on behalf of the former, but 1 - t or less of them cannot do the same thing. However, in many situations we want to enjoy confidentiality, authenticity and non-repudiation of message simultaneously. In this paper we propose an identity based threshold proxy signcryption scheme using bilinear pairings. The security of the scheme is also analyzed.
A Low-cost Approach for Effective Shape-based Retrieval and Classification of Medical Images
Authors: Joaquim C. Felipe, Jonatas B. Olioti, Agma J. M. Traina, Marcela X. Ribeiro, Elaine P. M. Sousa, Caetano Jr Traina
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This work aims at developing an efficient support for retrieval and classification of medical images, introducing an approach that comprises techniques of image processing, data mining and fractal theory, leading to an effective and direct way to compare images. A method of feature extraction and comparison is proposed, which uses Zernike moments for invariant pattern recognition as shape features of images' regions of interest. A new algorithm that generates statisticalbased association rules is used to identify representative features that discriminate the disease classes of images. In order to minimize the computational effort, another new algorithm, based on fractal theory, is applied to reduce the dimensionality of the representative feature space. In essence, the proposed method determines the smallest set of relevant features that can properly represent images without loss of precision. In addition, the method discards the need of image segmentation, leading to a simple but effective way to make image retrieval by content. Experiments executing k-nearest neighbor queries on medical images reveal that the process is robust and suitable to perform retrieval combined with classification of this kind of images.
Integration of telematics for efficient management of carrier operations
Authors: Asvin Goel, Volker Gruhn
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The use of telematics promises many potentials for improving the efficiency of carrier operations. Tracking &tracing functionalities, an improved information exchange between dispatchers and drivers, and an improved fleet management are the main fields of application. The information gathered by off-the-shelf fleet telematics systems, however, can often not be sufficiently utilised as the telematics systems cannot be readily integrated into the existing IT infrastructure. Especially small motor carriers cannot afford to replace their IT systems by such systems that already support telematics functionalities. As a result, off-the-shelf telematics systems are often of only limited use. In this paper we present a concept for integration of an off-the-shelf telematics systems into the carrier's IT infrastructure. We show how the information flow, as well as processes can be reorganised to exploit the potentials of the use of telematics.
Web Service Group Testing with Windowing Mechanisms
Authors: Wei-Tek Tsai, Yinong Chen, Xinyu Zhou, Xiaoying Bai
Venue: Proceedings of the IEEE International Workshop (2005)

ASTRAR provides a framework for testing Web Services (WS) using the group testing technique. This paper extends the basic two-phase testing process and introduces the windowing mechanism to further improve testing efficiency. Rather than testing a large number of WS simultaneously, WS are divided into subsets called windows and testing is exercised window by window. Testing results are analyzed for different strategies such as using all of the historical data, using the most recent windows, and using the current window only. Based on the results, test cases are ranked according to their potency to detect faults; and oracles and the confidence level of each oracle are established for individual test cases at run-time. In addition, different strategies are proposed to determine the optimal window size at run-time. By incorporating the windowing mechanism, the two-phase training and volume testing process becomes a continuous learning process and the basic group testing process becomes more adaptive to dynamically changing environment.
Compiler construction: an advanced course
Authors: F. L. Bauer, F. L. De Remer, M. Griffiths, U. Hill, J. J. Horning, C. H. A. Koster, W. M. McKeeman, P. C. Poole, W. M. Waite
Venue: ACM Classic Books Series; Vol. 21 (1974)

The Advanced Course took place from March 4 to 15, 1974 and was organized by the Mathematical Institute of the Technical University of Munich and the Leibniz Computing Center of the Bavarian Academy of Sciences, in co-operation with the European Communities, sponsored by the Ministry for Research and Technology of the Federal Republic of Germany and by the European Research Office, London.
On Procedure Strategy of Constructing SOA's Modeling Language
Authors: Yanbing Jiang, Chunxiao Xing, Wei he, Jijiang Yang
Venue: Proceedings of the IEEE International Workshop (2005)

The modeling technical in SOA needs to refer the architecture of UML/MDA modeling language. Modelers in different fields and levels are expected to have some capability of extending original modeling language. To make up the gap between the theoretical architecture of standard modeling language and the modelers' limited modeling capability, this paper discusses the procedure strategy (including implementing process, method and elicitation) of SOA's modeling language in three phases, such as phase of capturing extension requirement, creating a solution and optimizing the solution. With the help of the procedure strategy, the activities of extending SOA's modeling language have more precise, criterion and process guidance.
Exciting event detection in broadcast soccer video with mid-level description and incremental learning
Authors: Qixiang Ye, Qingming Huang, Wen Gao, Shuqiang Jiang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we propose a method for exciting event detection in broadcast soccer video with mid-level description and SVM-based incremental learning. In the method, video frames are firstly classified and grouped into views in terms of low-level playfield features. Mid-level description including view label, motion descriptor and shot descriptor are then extracted to present the characteristics of a view. By using the fixed temporal structure of views, SVM classification models are constructed to detected exciting events in a soccer match. In the view classification and event detection procedures, SVM-based incremental learning method is explored to improve the extensibility of view classification and event detection. Experiments on real soccer video programs demonstrate encouraging results.
Invariants on Demand
Authors: K. Rustan M. Leino
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

The last decade has displayed a trend for automatic reasoning techniques to operate on demand. Examples of this trend are counterexample-driven predicate refinement, as used in software model checking [7, 1, 8], and lemmas on demand, as used in automatic theorem proving [6, 5, 3, 0, 9]. In line with this trend, I will in this talk show a technique that combines abstract interpretation [4] and theorem proving, inferring program invariants when the theorem prover cannot proceed without them. This is joint work with Francesco Logozzo. To motivate the technique, the talk will also include a demo of the Spec# programming system [2, 10], which makes use of loop-invariant inference, verificationcondition generation, and automatic theorem proving to reason about object-oriented programs.