ppxscal/embedding_network huggingface dataset:
Purpose-Based Benchmarks
Authors: J. Gustafson
Venue: International Journal of High Performance Computing Applications (2004)

We define an approach to benchmarking, "purpose-based benchmarks", which explicitly and comprehensively measures the ability of a computing system to reach a goal of human interest. This contrasts with the traditional approach of defining a benchmark as a task to be timed, or as the rate at which some activity is performed. Purpose-based benchmarks are more difficult to create than traditional benchmarks, but have a profound advantage that makes them well worth the trouble: they provide a well-defined quantitative measure of the productivity of a computer system.
Inducing multilingual text analysis tools via robust projection across aligned corpora
Authors: David Yarowsky, Grace Ngai, Richard Wicentowski
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes a system and set of algorithms for automatically inducing stand-alone monolingual part-of-speech taggers, base noun-phrase bracketers, named-entity taggers and morphological analyzers for an arbitrary foreign language. Case studies include French, Chinese, Czech and Spanish.Existing text analysis tools for English are applied to bilingual text corpora and their output projected onto the second language via statistically derived word alignments. Simple direct annotation projection is quite noisy, however, even with optimal alignments. Thus this paper presents noise-robust tagger, bracketer and lemmatizer training procedures capable of accurate system bootstrapping from noisy and incomplete initial projections.Performance of the induced stand-alone part-of-speech tagger applied to French achieves 96% core part-of-speech (POS) tag accuracy, and the corresponding induced noun-phrase bracketer exceeds 91% F-measure. The induced morphological analyzer achieves over 99% lemmatization accuracy on the complete French verbal system.This achievement is particularly noteworthy in that it required absolutely no hand-annotated training data in the given language, and virtually no language-specific knowledge or resources beyond raw text. Performance also significantly exceeds that obtained by direct annotation projection.
USABILITY PROBLEMS OF RESIDENTIAL MULTIFUNCTION TERMINALS
Authors: Michel Nael
Venue: ACM SIGCHI Bulletin (1991)

New electronic products touch many aspects of everyday life. With new features, new usability problems also come along. This can be observed in many cases and particularly so in recent equipments in the audiovisual and telecommunication fields. Two examples of this have been analysed through several sets of studies.
ASIC-Hardware-Focused Comparison for Hash Functions MD5, RIPEMD-160, and SHS
Authors: Akashi Satoh, Tadanobu Inoue
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The hash functions MD5, RIPEMD-160, and SHA-1/224/256/384/512 were implemented by using a 0.13-µm CMOS standard cell library with two synthesis options, area and speed optimizations, and their performances were evaluated. The smallest circuit of 8.0 Kgates with a throughput of 929 Mbps, and the highest throughput of 2.9 Gbps with 27.3 Kgates were obtained for SHA-1 and SHA-384/512 respectively. In terms of overall performance with consideration of the security levels, we conclude that SHA-256 is the best algorithm, with compact circuits of 11.5~15.3 Kgates and high throughputs of 1.1 ~ 2.4 Gbps. Our implementations also showed the highest throughputs for all of the hash functions in comparison with the state of the art.
Intelligent Agent to Support Design in Supply Chain Based on Semantic Web Services
Authors: Incheon Paik, Shinjiro Takami, Yuu Watanabe
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In manufacture industry, better supply chain management (SCM) not only improves efficiency of business processes, but play important roles in a series of cost reductions. In a product manufacture, the initial design is more important from viewpoint of the cost reduction in the whole cycle. It becomes important how a designer collects the information on necessary parts for product design, and the system to search information efficiently at design stage is required. Information infrastructure to support design in SCM was developed on a semantic Web service environment that can provide interoperable service interfaces for integrated design attributes to agents and users. Design Support Agent (DSAgent), as a client for information infrastructure, helps the designer to find the desired product information. But this search process requires autonomy that lacks in DSAgent. As designers must change input values repeatedly to complete finding the desired product information, we suggest an autonomous DSAgent (ADSAgent) in this paper. To add autonomy, we used situation calculus, which is the schema for representing the dynamic changing world. The model to define the world was written in ConGolog statements, which is a logic programming language based on situation calculus. This will facilitate user to find the desired product information and reduce user operations.
Volumetric video compression for interactive playback
Authors: Bong-Soo Sohn, Chandrajit Bajaj, Vinay Siddavanahalli
Venue: Computer Vision and Image Understanding (2004)

We develop a volumetric video system which supports interactive browsing of compressed time-varying volumetric features (significant isosurfaces and interval volumes). Since the size of even one volumetric frame in a time-varying 3D data set is very large, transmission and on-line reconstruction are the main bottlenecks for interactive remote visualization of time-varying volume and surface data. We describe a compression scheme for encoding time-varying volumetric features in a unified way, which allows for on-line reconstruction and rendering. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and encode only the significant blocks that contribute to the isosurfaces and interval volumes. The results show that our compression scheme achieves high compression ratio with fast reconstruction, which is effective for interactive client-side rendering of time-varying volumetric features.
International Perspectives: IFIP'S TECHNICAL COMMITTEE ON INFORMATION SYSTEMS
Authors: John Karat
Venue: ACM SIGCHI Bulletin (1993)

I have received a number of requests for more information about IFIP activities that might be related to the interests of the HCI community. To help present a picture of some of what is going on within IFIP, I asked Gordon Davis from the University of Minnesota to provide me with a brief description of the activities of the Technical committee that he chairs. I think that his picture of the activities and history of TC8 will be of interest to many in the SIGCHI community. I want to thank Gordon and Jack Rosenfeld (Editor of the IFIP Newsletter) for providing me with this information.
High Throughput Web Services for Life Sciences
Authors: M. Altunay, D. Colonnese, C. Warade
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper describes a collaborative project between IBM and the North Carolina BioGrid: building, deploying, and using high-throughput Web services for bioinformatics applications. Bioinformatics applications can highly benefit from grid computing power, but the challenges of exposing these applications to the grid often cause reluctance. Typical bioinformatics applications are "quick-and-dirty" Perl scripts, which usually run at small homegrown laboratory clusters. Our work intends to fill the gap between grid power and the bioinformatics world by utilizing Web services and by extending the Open-Bioinformatics Foundationýs software package BioPerl. Our extensions to BioPerl libraries allow bioinformatics applications to be exposed to Web services seamlessly. Our development tool WSDL2Perl integrates these applications with the vast computational power of the NC BioGrid. We present a case study in building Web services for bioinformatics applications, namely BLAST (a well-known standard homology search application), and a process for deploying grid-enabled Web services to the NC BioGrid.
Runtime Empirical Selection of Loop Schedulers on Hyperthreaded SMPs
Authors: Yun Zhang, Michael Voss
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Hyperthreaded (HT) and simultaneous multithreaded (SMT) processors are now available in commodity workstations and servers. This technology is designed to increase throughput by executing multiple concurrent threads on a single physical processor. These multiple threads share the processor's functional units and on-chip memory hierarchy in an attempt to make better use of idle resources. Most OpenMP applications have been written assuming an Symmetric Multiprocessor (SMP), not an SMT, model. Threads executing on the same physical processor have interactions on data locality and resource sharing that do not occur on traditional SMPs. This work focuses on tuning the behavior of OpenMP applications executing on SMPs with SMT processors. We propose two adaptive loop schedulers that determine effective hierarchical schedulers for individual parallel loops. We compare the performance of our two proposed schedulers against several standard schedulers and the per-region adaptive scheduler proposed by Zhang et al. using the SPEC and NAS OpenMP benchmark suites. We show that both of our proposed schedulers outperform all other schedulers on average, and increase speedup on average by over 25% when all thread contexts are used.
Linguatronic product-level speech system for Mercedes-Benz cars
Authors: Paul Heisterkamp
Venue: Proceedings of the first international conference on Human language technology research (2001)

A recent press release (Murray 2000) indicates that many car manufacturers have announced speech recognition and voice-operated Command&Control systems for their cars, but so far have not introduced any. They are still struggling with technology, both in reliability and pricing. The article finishes by a quote from an industry person saying:"The reality is that today's systems are still failing in a lot of different modes. [...] But the technology will get better before it reaches the market. Right now, we just don't know when that will be."
Recurrence relations for the even and odd characteristic polynomials of a symmetric Toeplitz matrix
Authors: Aleksandra Kostić, Heinrich Voss
Venue: Journal of Computational and Applied Mathematics (2005)

In a recent paper (Computation of the smallest even and odd eigenvalues of a symmetric positive-definite Toeplitz matrix, SIAM J. Matrix Anal. Appl. 25 (2004) 949-963) Melman proved a recurrence relation of the even and odd characteristic polynomials of a real symmetric Toeplitz matrix T on which a symmetry exploiting method for computing the smallest eigenvalue of T can be based. In this note, we present a proof of the recurrence relation which is less technical and more transparent.
CAM-Based Huffman Decoding Made Power Efficient
Authors: Pi-Chung Wang, Chun-Liang Lee, Yuan-Rung Yang, Hung-Yi Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Ternary content addressable memory (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM is limited because of its high cost and power consumption. This paper introduces a TCAM-based Huffman decoding algorithm for single-side growing Huffman tree (SGH-tree), which has been proposed to reduce the sparsity of traditional Huffman tree. Our scheme is based on the property, which leaves in the SGH-tree are highly concentrated. By extracting and searching the common prefixes of the codewords, the power consumption and the required storage of TCAM can be significantly reduced as well as its cost. In our experiments based on twelve real images. the power consumption is reduced to twentieth as compared to the original implementation.
Identity Management, Access Specs are Rolling Along
Authors: Greg Goth
Venue: IEEE Internet Computing (2005)

The concept of streamlined single-sign-on network identity and access management has moved forward recently, but a certain amount of long-term uncertainty remains about which identity-management technology will fit into a given architecture as the applications underlying interorganizational communications depend less on Web browsers and become more capable of stand alone interchange. However, the widespread adoption of federated identity--in which users receive trusted access to more than their home network's resources without having to sign on to each new site separately · is reaching critical mass.
Fuzzy multi-attribute selection among transportation companies using axiomatic design and analytic hierarchy process
Authors: Osman Kulak, Cengiz Kahraman
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

The basic concept in axiomatic design (AD) is the existence of design axioms. First of these axioms is the independence axiom and the second one is the information axiom. Information axiom proposes the selection of the best alternative that has minimum information. Analytic hierarchy process (AHP) is another multi-attribute method which is a decision-making method for selecting the best among a set of alternatives, given some criteria. The method has been extensively applied, especially in large-scale problems where many criteria must be considered and where the evaluation of alternatives is mostly subjective. Multi-attribute transportation company selection is a very important activity for effective supply chain. Selection of the best company under determined criteria (such as cost, time, damage/loss, flexibility and documentation ability) using both multi-attribute AD and AHP will be realized in this study. The fuzzy multiattribute AD approach is also developed and it is compared by one of fuzzy AHP methods in the literature. The selection process has been accomplished by aiding a software that includes crisp AD and fuzzy AD.
Weighted primary trait analysis for computer program evaluation
Authors: Lon Smith, Jose Cordova
Venue: Journal of Computing Sciences in Colleges (2005)

In this paper, we describe the rationale for and development of a weighted primary trait analysis tool for the evaluation of student programming assignments. Primary trait analysis, an effective evaluation tool used extensively in the liberal arts community, defines a number of specific criteria or traits to be evaluated along with specific measures of performance for each trait. Our work combines this approach with a weighting system that assigns relative weights to the various criteria. The model has been implemented in a spreadsheet and has been used successfully in grading programming assignments at various levels in our curriculum.
Granule-oriented programming
Authors: Yinliang Zhao
Venue: ACM SIGPLAN Notices (2004)

A program will become obsolete or less effective in solving domain problems due to many reasons. One of the main reasons can be the fact that the program does not fit its context. The context of a program is defined as a collection of functionalities that support the program to solve domain problems, e.g., runtime environmental supports, meta-strategies, architectural supports, etc. Unfitness phenomena exist in many software systems, which lead the systems prematurely end their life cycles, or decrease their performance and accuracy in solving problems. In existing programming systems, from the perspective of language expressivity, little attention has been paid to this unfitness problem. Granule-oriented programming is an evolutionary metaphor in which programs are ground into code granules in order to localize their unfitness parts as explicitly as possible and then the code granules are compounded into the target program, in which a code granulation space, ont to express program in a well-formed and multi-layered framework, is formed. In this paper, we propose and briefly describe the notion of granule-oriented programming.
Eye-gaze estimation by using features irrespective of face direction
Authors: Tetsuo Miyake, Seiji Haruta, Satoshi Horihata
Venue: Systems and Computers in Japan (2005)

Most of the previous methods for constructing a human machine interface that uses a line of sight are divided into two groups according to the method of line detection. One uses a special light source or a hardware device, and the other uses software for image processing. Our proposed method, which is of the latter type, determines whether a person gazes at a camera lens or not by using only a single facial image captured by a video camera. In previous methods of this kind, it is common understanding that the directional angle of a head with respect to the world coordinate system and that of the eye in relation to the head are estimated independently, and the direction of the line is determined by adding one to the other. A feature of the proposed method is that eye-gaze estimation is conducted by using a pair of marks that are attached at a special position on a facial surface, without considering the head direction in space. Our proposed method can be realized easily, and can estimate the eye-gaze in a short time. Experimental results show the effectiveness of the proposed method. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 18&ndash;26, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20143
Beyond user experimentation: notational-based systematic evaluation of interaction techniques in virtual reality environments
Authors: Emmanuel Dubois, P. Nedel, Sasso Freitas, Liliane Jacon
Venue: Virtual Reality (2004)

Despite the increasing number of interaction devices for virtual reality (VR) applications (e.g. data-gloves, space balls, data-suits and so on), surprisingly very little attention has been given to the evaluation of VR interaction techniques or more generally to the usability of virtual reality environments (VRE). The main reasons for these limited efforts are probably that empirical user testing with VREs is difficult and time-consuming and ergonomic rules or criteria and traditional HCI tools and methods are not well suited for VRE. Alternatively, the specification of interaction based on a formal method or notation provides a precise and unambiguous description that can be used to reason the user&#x2019;s actions while interacting with a VRE. In this paper, we propose a new approach to design interaction techniques in VRE, based on the use of a formal specification language: the ASUR notation. In the early stages of system design, time and effort are reduced by assisting the designers in considering alternative solutions and anticipating usability issues. To better explain the proposed methodology, we report an evaluation of selection and manipulation techniques in a virtual environment based on a chess game. The evaluation has been carried out in two ways: predictively, with the help of the ASUR notation, and empirically via user experiments. We present the outcomes of the empirical studies and demonstrate that the reasoning with the ASUR notation leads to similar but also results complementary to those obtained with the experiments.
Kinematic modeling of mobile robots by transfer method of augmented generalized coordinates
Authors: Wheekuk Kim, Byung-Ju Yi, Dong Jin Lim
Venue: Journal of Robotic Systems (2004)

A kinematic modeling method, which is directly applicable to any type of planar mobile robots, is proposed in this work. Since holonomic constraints have the same differential form as nonholonomic constraints, the instantaneous motion of the mobile robot at current configuration can be modeled as that of a parallel manipulator. A pseudo joint model denoting the interface between the wheel and the ground (i.e., the position of base of the mobile robot) enables the derivation of this equivalent kinematic model. The instantaneous kinematic structures of four different wheels are modeled as multiple pseudo joints. Then, the transfer method of augmented generalized coordinates, which has been popularly employed in modeling of parallel manipulators, is applied to obtain the instantaneous kinematic models of mobile robots. The kinematic models of six different types of planar mobile robots are derived to show the effectiveness of the proposed modeling method. Lastly, for the mobile robot equipped with four conventional wheels, an algorithm estimating a sensed forward solution for the given information of the rotational velocities of the four wheels is discussed. &copy; 2004 Wiley Periodicals, Inc.
Constrained TST MUSIC for joint spatio-temporal channel parameter estimation in DS&#x002F;CDMA systems: Research Articles
Authors: Jen-Der Lin, Wen-Hsien Fang, Jiunn-Tsair Chen
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we present a blind and robust algorithm to jointly estimate the directions of arrival (DOAs) and propagation delays in DS&#x002F;CDMA systems. The rationale of the proposed approach is a hybrid of one-dimensional (1-D) multiple signal classification (MUSIC) algorithms and constrained spatial&#x002F;temporal filtering processes. As previously addressed TST MUSIC, two temporal (T)-MUSIC and one spatial (S)-MUSIC are employed alternatively in the proposed algorithm to estimate the group delays and the DOAs respectively. However, by utilizing the structure of the data model, no training sequences are required. Furthermore, a constrained temporal filtering process and a constrained spatial beamforming process, which minimize the filtered noise power under a set of judiciously chosen linear constraints, are now employed after the T-MUSIC and S-MUSIC respectively. These filtering processes aim to effectively partition the incoming rays and to be robust against the propagation errors in the tree-structured estimation scheme so that the overall performance can be enhanced. Also, the incoming rays are grouped, isolated and estimated, and the pairing of the estimated delays and DOAs is automatically achieved without extra computational overhead. Furnished simulations show that the new approach can exhibit satisfactory performance with low complexity compared with previous works. Copyright &copy; 2005 John Wiley & Sons, Ltd.
On interpolation of function spaces by methods defined by means of polygons
Authors: Fernado Cobos, Joaquim Martín
Venue: Journal of Approximation Theory (2005)

We describe the spaces obtained by applying the interpolation methods associated to polygons to N-tuples of weighted Lp-spaces, N-tuples of classical Lorentz spaces and some other N-tuples of function spaces.
Is mutation an appropriate tool for testing experiments?
Authors: J. H. Andrews, L. C. Briand, Y. Labiche
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The empirical assessment of test techniques plays an important role in software testing research. One common practice is to instrument faults, either manually or by using mutation operators. The latter allows the systematic, repeatable seeding of large numbers of faults; however, we do not know whether empirical results obtained this way lead to valid, representative conclusions. This paper investigates this important question based on a number of programs with comprehensive pools of test cases and known faults. It is concluded that, based on the data available thus far, the use of mutation operators is yielding trustworthy results (generated mutants are similar to real faults). Mutants appear however to be different from hand-seeded faults that seem to be harder to detect than real faults.