ppxscal/embedding_network huggingface dataset:
Evaluation and context for in-car speech systems for older adults
Authors: Mary Zajicek, Ing-Marie Jonsson
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Listeners to speech based information systems attribute qualities to voices which will make them receptive, or otherwise, to the information. This paper looks at the value of laboratory-based usability testing on voices for an in-car speech messaging system. It compares results concerning the users' perception of voice, in particular source credibility, performed first on voices presented out of context in a laboratory setting and then the same voices embedded in an in-car system in a driving simulator. In the case of older adults the results are significantly different raising issues of context and value in usability testing for this group.
Requiem for large-scale models
Authors: Douglass B. Lee,  Jr.
Venue: ACM SIGSIM Simulation Digest (1975)

The task in this paper is to evaluate, in some detail,, the fundamental flaws in attempts to construct and use large models and to examine the planning context in which the models, like dinosaurs, collapsed rather than evolved. The conclusions can be summarized in three points:1. In general, none of the goals held out for large-scale models have been achieved, and there is little reason to expect anything different in the future. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Evolving Evolution
Authors: Steven P. Reiss
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Software is changing and software evolution is going to change with it. In considering software and the problems of software evolution today we make the tacit assumption that we control the software and hence can control its evolution. Current trends point to a world where we only control a small fraction of our own software and the remainder evolves in unpredictable and uncontrolled ways. Current work in addressing evolution is addressing yesterday's problems. What we need to prepare ourselves for the coming problems are techniques that can cope with uncontrolled evolution. In this position paper we point out several of the problems that need to be addressed and hint at possible techniques for addressing them.
An approach to modeling of silicon oxidation in a wet ultra-diluted ambient
Authors: Alexey Kovalgin, Andre Hof, Jurriaan Schmitz
Venue: Microelectronic Engineering (2005)

In this work, we make steps towards developing a new wet-oxidation model of silicon based on electron-stimulated dissociation of H2O molecules. The need for a new model arises from the fact that existing physical models are inadequate to describe the thin-oxide regime. Two regimes of silicon oxidation are assumed to exist. The first regime responsible for the growth of up to 2-nm thick oxides including native oxides, considers electron tunneling through the growing oxide. The second regime occurs for thicker oxides and involves conventional diffusion of H2O molecules.
A Repository Service for Grid Workflow Components
Authors: Gregor von Laszewski, Deepti Kodeboyina
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

As part of the Java CoG Kit we have defined a sophisticated workflow framework. This workflow framework projects an integrated approach towards executing tasks in Grid and non-Grid environments. One of the services needed is a convenient service to store, retrieve, and modify workflow components defined by the community similar to systems such as the comprehensive perl archive network. The availability of such a service will not only allow the definition of components useful for the greater grid community, but it will also be possible that it can be reused to support dynamically changing workflows managed by collaborative groups. In this paper, we present a simple extensible framework to design, build, and deploy a workflow repository service. This repository is intended to be used in ad-hoc Grids or in community Grids.
When Functions Change Their Names: Automatic Detection of Origin Relationships
Authors: Sunghun Kim, Kai Pan, E. James Whitehead,  Jr.
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

It is a common understanding that identifying the same entity such as module, file, and function between revisions is important for software evolution related analysis. Most software evolution researchers use entity names, such as file names and function names, as entity identifiers based on the assumption that each entity is uniquely identifiable by its name. Unfortunately names change over time. In this paper we propose an automated algorithm that identifies entity mapping at the function level across revisions even when an entity's name changes in the new revision. This algorithm is based on computing function similarities. We introduce eight similarity factors to determine if a function is renamed from a function. To find out which similarity factors are dominant, a significance analysis is performed on each factor. To validate our algorithm and for factor significance analysis, ten human judges manually identified renamed entities across revisions for two open source projects: Subversion and Apache2. Using the manually identified result set we trained weights for each similarity factor and measured the accuracy of our algorithm. We computed the accuracies among human judges. We found our algorithm's accuracy is better than the average accuracy among human judges. We also show that trained weights for similarity factors from one period in one project are reusable for other periods and/or other projects. Finally we combined all possible factor combinations and computed the accuracy of each combination. We found that adding more factors does not necessarily improve the accuracy of origin detection.
Gene Selection via a Spectral Approach
Authors: L. Wolf, A. Shashua, S. Mukherjee
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Array technologies have made it possible to record simultaneously the expression pattern of thousands of genes. A fundamental problem in the analysis of gene expression data is the identification of highly relevant genes that either discriminate between phenotypic labels or are important with respect to the cellular process studied in the experiment. Examples include: cell cycle or heat shock in yeast experiments, chemical or genetic perturbations of mammalian cell lines, and genes involved in class discovery for human tumors. We focus on the task of unsupervised gene selection. Selecting a small subset of genes is particularly challenging as the data sets involved are typically characterized by a small sample size and a very large feature space. We propose a model independent approach which scores candidate gene selections using spectral properties of the candidate af?nity matrix. The algorithm is simple to implement, yet contains a number of remarkable properties which guarantee consistent sparse selections. We applied our algorithm on five different data sets. The first consists of time course data from four well studied Hematopoietic cell lines (HL-60, Jurkat, NB4, and U937). The other four data sets include three well studied treatment outcomes (large cell lymphoma, childhood medulloblastomas, breast tumors) and one unpublished data set (lymph status). We compared our approach both with other unsupervised methods (SOM,PCA,GS) and with supervised methods (SNR,RMB,RFE). The results show that our approach considerably outperforms all the other unsupervised approaches in our study, is competitive with supervised methods and in some cases even outperforms supervised approaches.
Process-aware information systems: bridging people and software through process technology
Authors: Marlon Dumas, Wil M. van der Aalst, Arthur H. ter Hofstede
Venue:  (2005)

In the last 10 years, there has been an explosion in the number of technologies, standards, and tools to provide process support. The book provides a unified and comprehensive overview of the principles, techniques and technologies underlying the emerging discipline of process aware information systems engineering. It brings together contributions from leading experts in this fast-growing field. Each chapter ends with a collection of thought-provoking exercises, which also makes it ideal as a text book. The book closes with a list of resources including suggested readings as well as URLs of relevantstandardization bodies, initiatives, and consortia
Introduction
Authors: Jaime Teevan, William Jones, Benjamin B. Bederson
Venue: Communications of the ACM (2006)

Cheap and fast search and storage technologies help bring order to our messy personal information environments, freeing us to make the most of our information collections.
Enhancing the IEEE 802.11e in QoS Support: Analysis and Mechanisms
Authors: Xiang Chen, Hongqiang Zhai, Yuguang Fang
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Despite its support of prioritized services, the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) cannot guarantee strict QoS required by real-time services such as voice and video without proper network control mechanisms. To overcome this deficiency, we first build an analytical model to derive upper bounds for both delay means and variations for services of different priorities in the non-saturated 802.11e WLAN, showing that the QoS requirements of real-time services can be satisfied if the input traffic is properly regulated. Based on the analysis, we then propose a call admission control scheme and a rate control scheme to ensure that QoS requirements of real-time services are statistically guaranteed and that best effort services can efficiently use the residual bandwidth.
Modeling the Vulnerability Discovery Process
Authors: O. H. Alhazmi, Y. K. Malaiya
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Security vulnerabilities in servers and operating systems are software defects that represent great risks. Both software developers and users are struggling to contain the risk posed by these vulnerabilities. The vulnerabilities are discovered by both developers and external testers throughout the life-span of a software system. A few models for the vulnerability discovery process have just been published recently. Such models will allow effective resource allocation for patch development and are also needed for evaluating the risk of vulnerability exploitation. Here we examine these models for the vulnerability discovery process. The models are examined both analytically and using actual data on vulnerabilities discovered in three widely-used systems. The applicability of the proposed models and significance of the parameters involved are discussed. The limitations of the proposed models are examined and major research challenges are identified.
Efficient Content Locating in Peer-to-Peer Systems
Authors: Haitao Chen, Zunguo Huang, Zhenghu Gong
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

A group-based semantic search method -GBSS is introduced to improve the efficiency and scalability of search in P2P systems. GBSS introduces a hybrid architecture in which the storage and search of raw data is based on DHT network, but the storage and search of meta-data are based on unstructured P2P network. With regard to search algorithm, GBSS introduces a new file grouping method requiring no users' descriptions and constructs friend group relations between nodes based on interest similarity between file groups. The forwarding of users' requests makes use of friend group relations. Simulation tests show that compared with traditional flooding algorithms, GBSS is both efficient and scalable.
Assessing Reactive QoS Strategies for Internet Services
Authors: Adriano Pereira, Leonardo Silva, Wagner Meira Jr., Walter Santos
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

The design of systems with better performance is a real need to fulfill user demands and generate profitable Web applications. Understand user behavior and workload they produce on the server is fundamental to evaluate the performance of systems and their improvements. User reactivity, that is, how the users react to variable server response time, is usually neglected during performance evaluation. This work addresses the use of reactivity to improve QoS of Internet services. We propose and evaluate new admission control policies. We designed and implemented the USAR-QoS simulator that allows the evaluation of the new QoS strategies considering the dynamic interaction between client and server sides in Internet services. The simulation uses a TPC-W-based workload and shows the benefits of the reactive policies, which can result in better QoS. The experiments show the proposed reactive admission control policies lead to better response time rates, with a reduction from 15 to 50%, preserving the user satisfaction metric.
Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids
Authors: Tianchi Ma, Rajkumar Buyya
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Parameter-sweep has been widely adopted in large numbers of scientific applications. Parameter-sweep features need to be incorporated into Grid workflows so as to increase the scale and scope of such applications. New scheduling mechanisms and algorithms are required to provide optimized policy for resource allocation and task arrangement in such a case. This paper addresses scheduling sequential parameter-sweep tasks in a fine-grained manner. The optimization is produced by pipelining the subtasks and dispatching each of them onto well-selected resources. Two types of scheduling algorithms are discussed and customized to adapt the characteristics of parameter-sweep, as well as their effectiveness has been compared under multifarious scenarios.
Pinot: Speculative Multi-threading Processor Architecture Exploiting Parallelism over a Wide Range of Granularities
Authors: Taku Ohsawa, Masamichi Takagi, Shoji Kawahara, Satoshi Matsushita
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

We propose a speculative multi-threading processor architecture called Pinot. Pinot exploits parallelism over a wide range of granularities without modifying program sources. Since exploitation of fine-grain parallelism suffers from limits of parallelism and overhead incurred by parallelization, it is better to extract coarse-grain parallelism. Coarse-grain parallelism is biased in some programs (mainly, numerical ones) and some program portions. Therefore, exploiting both coarse- and fine-grain parallelism is a key to the performance of speculative multithreading. The features of Pinot are as follows: (1) A parallelizing tool extracts parallelism at any level of granularity (e.g. even ten thousand instructions) from any program sub-structures (e.g. loops, calls, or basic blocks). The tool utilizes formulation in which the parallelization process is reduced to a combinatorial optimization problem. (2) A parallel execution model with extension of thread control instructions is designed in order to minimize the increase of the dynamic instruction count. The model employs implicit thread termination and cancellation, as well as register value transfer without synchronization. (3) A versioning cache called Version Resolution Cache (VRC) accomplishes both coarse- and fine-grained speculative multithreading. VRC operates as a large buffer for coarsegrained multi-threading. In addition, it provides low latency inter-thread communication with an update-based protocol for fine-grained multi-threading. We performed cycle-accurate simulations with 38 programs from the SPEC and MiBench benchmarks. The speedup with 4-processor-element- Pinot is up to 3.7 times, and 2.2 times on geometric mean against a conventional processor. The speedup in a program (susan) drops from 3.7 to 1.6 when the speculative buffer size is limited to 256 bytes. It confirms that exploiting coarse-grain parallelism is essential to the improved performance. FPGA implementation shows 32% overhead of area and 12% increase of
An approach to office simulation
Authors: Burt Leavenworth
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

Future Office Systems will incorporate a variety of interactions among people involved in these systems and between people and a variety of machine and computer facilities. We have already seen some reorganization of the traditional office structure based on the word processing/administrative support center concept.
Learning Diagram Parts with Hidden Random Fields
Authors: Martin Szummer
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Many diagrams contain compound objects composed of parts.We propose a recognition framework that learns parts in an unsupervised way, and requires training labels only for compound objects. Thus, human labeling effort is reduced and parts are not predetermined, instead appropriate parts are discovered based on the data. We model contextual relations between parts, such that the label of a part can depend simultaneously on the labels of its neighbors, as well as spatial and temporal information. The model is a Hidden Random Field (HRF), an extension of a Conditional Random Field. We apply it to find parts of boxes, arrows and flowchart shapes in hand-drawn diagrams, and also demonstrate improved recognition accuracy over the conditional random field model without parts.
Dynamic Resizing of Superscalar Datapath Components for Energy Efficiency
Authors: Dmitry Ponomarev, Gurhan Kucuk, Kanad Ghose
Venue: IEEE Transactions on Computers (2006)

The "one-size-fits-all” philosophy used for permanently allocating datapath resources in today's superscalar CPUs to maximize performance across a wide range of applications results in the overcommitment of resources in general. To reduce power dissipation in the datapath, the resource allocations can be dynamically adjusted based on the demands of applications. We propose a mechanism to dynamically, simultaneously, and independently adjust the sizes of the issue queue (IQ), the reorder buffer (ROB), and the load/store queue (LSQ) based on the periodic sampling of their occupancies to achieve significant power savings with minimal impact on performance. Resource upsizing is done more aggressively (compared to downsizing), using the relative rate of blocked dispatches to limit the performance penalty. Our results are validated by the execution of the SPEC 2000 benchmark suite on a substantially modified version of the Simplescalar simulator, where the IQ, the ROB, the LSQ, and the register files are implemented as separate structures, as is the case with most practical implementations. We also use actual VLSI layouts of the datapath components in a 0.18 micron process to accurately measure the energy dissipations for each type of access. For a 4-way superscalar CPU, an average power savings of about 42 percent within the IQ, 74 percent within the ROB (integrating the register file), and 41 percent within the LSQ can be achieved with an average performance penalty of about 5 percent.
Algebraic recognizability of regular tree languages
Authors: Zoltán Ésik, Pascal Weil
Venue: Theoretical Computer Science (2005)

We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Σ-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss important examples of logically defined classes of recognizable tree languages, whose characterization and decidability was established in recent papers (by Benedikt and Ségoufin, and by Bojanczyk and Walukiewicz) and can be naturally formulated in terms of pseudovarieties of preclones. Finally, this paper constitutes the foundation for another paper by the same authors, where first-order definable tree languages receive an algebraic characterization.
Design and Analysis of Self-Repairable MEMS Accelerometer
Authors: Xingguo Xiong, Yu-Liang Wu, Wen-Ben Jone
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this paper, a self-repairable MEMS (SRMEMS) accelerometer design is proposed. The accelerometer consists of (n + m) identical modules: n of them serve as the main device, while the remaining m modules act as the redundancy. If any of the working module in the main device is found faulty, the control circuit will replace it with a good redundant module. In this way, the faulty device can be self-repaired through redundancy. The sensitivity loss due to device modularization can be well compensated by different design alternatives. The yield model for MEMS redundancy repair is developed. The simulation results show that the BISR (built-in self-repair) design leads to effective yield increase compared to non-BISR design, especially for a moderate non-BISR yield. By implementing the fault tolerance feature into MEMS devices, the yield as well as the reliability of a MEMS device implemented in a SoC can be improved.
Quilt Snaps: A Fabric Based Computational Construction Kit
Authors: Leah Buechley, Nwanua Elumeze, Camille Dodson, Michael Eisenberg
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper we present Quilt Snaps, a fabric based construction kit consisting of a set of computationally enhanced quilting pieces. Our discussion focuses on three ways that children can engage with Quilt Snaps. First, Quilt Snaps allows children to act as the engineers, designers, and decorators of their own digital manipulatives. Second, by playing with the manipulatives that they've helped to construct, children can learn about concepts relevant to programming, graph theory, and dynamical systems. Finally, since Quilt Snaps is fabric based, children can use the pieces they construct as personal mobile display media.
Active Hypercontours and Contextual Classification
Authors: Arkadiusz Tomczyk
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

In the paper a concept of active hypercontours as well as a formalized description of contextual classification and relationship between them are presented. The idea of active hypercontours generalizes traditional active contour methods which are extensively developed in image analysis. The proposed concepts can enable an incorporation of techniques specific for traditional contextual and noncontextual classification problems to active contour approach and vice versa.
T-DHT: Topology-based Distributed Hash Tables
Authors: Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

In this paper, we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path.