ppxscal/embedding_network huggingface dataset:
Exploiting Processor Workload Heterogeneity for Reducing Energy Consumption in Chip Multiprocessors
Authors: I. Kadayif, M. Kandemir, I. Kolcu
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Advances in semiconductor technology are enabling designs with several hundred million transistors. Since building sophisticated single processor based systems is a complex process from design, veri.cation, and software development perspectives, the use of chip multiprocessing is inevitable in future microprocessors. In fact, the abundance of explicit loop-level parallelism in many embedded applications helps us identify chip multiprocessing as one of the most promising directions in designing systems for embedded applications. Another architectural trend that we observe in embedded systems, namely, multi-voltage processors, is driven by the need of reducing energy consumption during program execution. Practical implementations such as Transmeta's Crusoe and Intel's XScale tune processor voltage/frequency depending on current execution load. Considering these two trends, chip multiprocessing and voltage/frequency scaling, this paper presents an optimization strategy for an architecture that makes use of both chip parallelism and voltage scaling. In our proposal, the compiler takes advantage of heterogeneity in parallel execution between the loads of different processors and assigns different voltages/frequencies to different processors if doingso reduces energy consumption without increasing overall execution cycles signi.cantly. Our experiments with a set of applications show that this optimization can bring large energy benefits without much performance loss.
Extracting the lowest-frequency words: pitfalls and possibilities
Authors: Marc Weeber, R. Harald Baayen, Rein Vos
Venue: Computational Linguistics (2000)

In a medical information extraction system, we use common word association techniques to extract side-effect-related terms. Many of these terms have a frequency of less than five. Standard word-association-based applications disregard the lowest-frequency words, and hence disregard useful information. We therefore devised an extraction system for the full word frequency range. This system computes the significance of association by the log-likelihood ratio and Fisher's exact test. The output of the system shows a recurrent, corpus-independent pattern in both recall and the number of significant words. We will explain these patterns by the statistical behavior of the lowest-frequency words. We used Dutch verb-particle combinations as a second and independent collocation extraction application to illustrate the generality of the observed phenomena. We will conclude that a) word-association-based extraction systems can be enhanced by also considering the lowest-frequency words, b) significance levels should not be fixed but adjusted for the optimal window size, c) hapax legomena, words occurring only once, should be disregarded a priori in the statistical analysis, and d) the distribution of the targets to extract should be considered in combination with the extraction method.
Dynamically maintaining frequent items over a data stream
Authors: Cheqing Jin, Weining Qian, Chaofeng Sha, Jeffrey X. Yu, Aoying Zhou
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

It is challenge to maintain frequent items over a data stream, with a small bounded memory, in a dynamic environment where both insertion/deletion of items are allowed. In this paper, we propose a new novel algorithm, called hCount, which can handle both insertion and deletion of items with a much less memory space than the best reported algorithm. Our algorithm is also superior in terms of precision, recall and processing time. In addition, our approach does not request the preknowledge on the size of range for a data stream, and can handle range extension dynamically. Given a little modification, algorithm hCount can be improved to hCount*, which even owns significantly better performance than before.
An Architecture of Wireless Web and Dialogue System Convergence for Multimodal Service Interaction Over Converged Networks
Authors: Feng Liu, J. Jenny Li, Xueshan Shan, Wu Chou
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper presents the software architecture for anew paradigm of wireless web and dialogue systemconvergence and its corresponding approach to delivermultimodal multimedia enterprise communicationservices in the wireless environment. It uses an event-triggeredservice delivery method that separates serviceinteraction and wireless web-based service delivery. Acustomized content presentation approach is adopted totransform the content of the service into a format suitablefor presentation on the target devices. The system alsocontains a service delivery monitoring and backupmechanism, which is capable of sending the servicecontent using other communication channels according tothe user's preference and the channel conditions. Aprototype system was implemented based on the proposedapproach, which demonstrates the performanceadvantage of our method in the enterprise serviceapplication.
An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence
Authors: Keith Gallagher, David Binkley
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

In order to further understand and assess decompositionslicing we characterize and evaluate the size ofreductions obtained by computing equivalent decompositionslices from the perspective of the comprehender,maintainer, tester and researcher.The analysis wasperformed on 68 C language systems of sizes 100 to50,000 lines.All decomposition slices were computedand compared for simple equality.From this data, wewere able to determine with 95% confidence that thetrue mean percentage of equivalent decomposition slicesis between 50.0% and 60.3%, with a p-value
Introducing chat into business organizations: toward an instant messaging maturity model
Authors: Michael J. Muller, Mary Elizabeth Raven, Sandra Kogan, David R. Millen, Kenneth Carey
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

We provide the first study of instant messaging (IM) based on large samples of users' self reports. Previous studies have relied on ethnographic methods or analysis of server logs. Our self-report approach has its own strengths (large-sample; focus on attitudes, beliefs, and value attributions), as well as weaknesses (self-selection by respondents). We describe the introduction of Lotus Sametime™, an IM product, into three business organizations. Across the three organizations, we found substantially similar patterns in savings (reduced use of other communications channels), attitudes, and social networks. In one organization, we made a detailed study of the maturation of IM over a 24-month period, showing early and stable savings accompanied by much more gradual developments in chat behaviors, control of visibility and awareness, social networks, and attitudes. We conclude with a methodological self-critique, and an outline of an Instant Messaging Maturity Model.
Large Deviations in Quantum Information Theory
Authors: R. Ahlswede, V. M. Blinovsky
Venue: Problems of Information Transmission (2003)

We obtain asymptotic estimates for the probabilities of events of special types, which are useful in quantum information theory, especially for identification in noisy channels.
Proof search in Lax Logic
Authors: Jacob M. Howe
Venue: Mathematical Structures in Computer Science (2001)

A Gentzen sequent calculus for Lax Logic is presented, the proofs in which correspond naturally in a 1&ndash;1 way to the normal natural deductions for the logic. The propositional fragment of this calculus is used as the basis for another calculus that uses a history mechanism in order to give a decision procedure for propositional Lax Logic.
An Architecture for the Integration of Physical and Informational Spaces
Authors: Scott M. Thayer, Peter Steenkiste
Venue: Personal and Ubiquitous Computing (2003)

AbstractWhile computer processing power, storage capacity, and bandwidth are continuing to experience exponential growth, individual human processing capabilities are not increasing significantly. Pervasive computing offers an opportunity for applications to interact with the physical environment and to provide a task-centric and mobile infrastructure for the user. However, this rich environment can also be distracting, in part because of a lack of convergence between the physical infrastructure observed by users and the information space seen by applications. In this paper we introduce AIPIS, an architecture that bridges the physical and informational realms of the human and the computer, respectively. The purpose of AIPIS is two-fold: (1) provide users with a hands-free computing environment that automates much of the drudgery associated with the use of computers; and (2) require human attention for only critical aspects of task execution that require their input. We also describe the Aura desktop, a first prototype of the AIPIS architecture.
Kernel VA-files for relevance feedback retrieva
Authors: Douglas R. Heisterkamp, Jing Peng
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

Many data partitioning index methods perform poorly in high dimensional space and do not support relevance feedback retrieval. The vector approximation file (VA-File) approach overcomes some of the difficulties of high dimensional vector spaces, but cannot be applied to relevance feedback retrieval using kernel distances in the data measurement space. This paper introduces a novel KVA-File (kernel VA-File) that extends VA-File to kernel-based retrieval methods. A key observation is that kernel distances may be non-linear in the data measurement space but is still linear in an induced feature space. It is this linear invariance in the induced feature space that enables KVA-File to work with kernel distances. An efficient approach to approximating vectors in an induced feature space is presented with the corresponding upper and lower distance bounds. Thus an effective indexing method is provided for kernel-based relevance feedback image retrieval methods. Experimental results using large image data sets (approximately 100,000 images with 463 dimensions of measurement) validate the efficacy of our method.
Virtual reality performance for virtual geometry
Authors: Robert A. Cross, Andrew J. Hanson
Venue: Proceedings of the conference on Visualization '94 (1994)

We describe the theoretical and practical visualization issues solved in the implementation of an interactive real-time four-dimensional geometry interface for the CAVE, an immersive virtual reality environment. While our specific task is to produce a "virtual geometry" experience by approximating physically correct rendering of manifolds embedded in four dimensions, the general principles exploited by our approach reflect requirements common to many immersive virtual reality applications, especially those involving volume rendering. Among the issues we address are the classification of rendering tasks, the specialized hardware support required to attain interactivity, specific techniques required to render 4D objects, and interactive methods appropriate for our 4D virtual world application.
Accuracy, comprehensibility and completeness evaluation of a fuzzy expert system
Authors: Phayung Meesad, Gary G. Yen
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Using optimization tools such as genetic algorithms to construct a fuzzy expert system (FES) focusing only on its accuracy without considering the comprehensibility may not result in a system that produces understandable expressions. To exploit the transparency characteristics of FES for reasoning in a higher-level knowledge representation, a FES should provide high comprehensibility while preserving its accuracy. The completeness of fuzzy sets and rule structures should also be considered to guarantee that every data point has a response output. This paper proposes some quantitative measures for a FES to determine the degree of the accuracy, the comprehensibility of the fuzzy sets, and the completeness of fuzzy rule structure. These quantitative measures are then used as a fitness function for a genetic algorithm in optimally refining a FES.
Hot-Swapping Communication Models in P2P Networks
Authors: Manuel Oriol, Michel Pawlak
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Nowadays, an increasing number of communication protocols is available for peers to exchange information. As fast evolving environments seem to be the norm with peer-to-peer (P2P) systems, this communication layer needs to evolve dynamically. In this article, we propose a model for integrating and swapping several communication protocols at runtime in a transparent way for user defined code. As a first step, we take a look at how the inter-peer communication layer should be built in P2P platforms, in order to allow the hot-swap of communication protocols. In a second step we report our experiences in building such a communication infrastructure.
A framework for an organization's transition to globalization: investigation of IT issues
Authors: Yi-chen Lan
Venue: Managing globally with information technology (2003)

This chapter explores information technology (IT) issues in regard to an organization's transition towards globalization. The challenges of IT dealing with transforming enterprises to globalized organizations require the identification, consolidation, and resolution of issues to support the organizations towards globalization. The chapter begins with identifying and classifying four major IT transition issues: global IT infrastructure, global business applications, global telecommunication network, and data/information systems improvement. It is then followed by detailed discussion of each issue with regards to its importance and relevance in global transformation. The chapter concludes by indicating a future research direction to incorporate organizational scopes (inter-organizational and intra-organizational) in the global IT transition framework.
Proceedings of the 1st ACM international workshop on Multimedia databases
Venue: ACM International Workshop On Multimedia Databases (2003)

These proceedings contain the papers selected for presentation at The First ACM International Workshop on Multimedia Databases (New Orleans, Louisiana, USA, November 7, 2003). Its aim is to bring together university researchers, scientists, industry professionals, software engineers and graduate students who need to become acquainted with new theories and technologies in multimedia databases, and to all those who wish to gain a detailed technical understanding of what multimedia databases involve.We received thirty-three submissions. Each of them was reviewed by at least three referees. The program committee, which was constituted of researchers and practitioners from the multimedia database research areas, selected twelve papers to be presented at the workshop. The authors were asked to address each and every comment made by the referees to improve the quality of the papers. These papers reflect current trends in the multimedia database research areas with topics such as Video Analysis, Video Retrieval, Video Summarizing, Multimedia Communications, Relevance Feedback, Multimedia Indexing, and Content-Based Image Retrieval for Multimedia Databases.
Design and Implementation of a Parallel Verilog Simulator: PVSim
Authors: Tun Li, Yang Guo, Si-Kun Li
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Parallel HDL simulation is an efficient method toaccelerate the verification process of large complex VLSIsystem design. This paper presents a parallel Verilogsimulator - PVSim, which bases on optimisticasynchronous parallel simulation algorithm and MPIlibrary. A new module-based simulation componentmapping method is proposed. And an efficient module-basedpartition algorithm combined with pre-simulationpartition algorithm is adopted. This paper introduces thearchitecture of PVSim, the Verilog component mappingtechniques, the distributed simulation cycle arrangementand the circuit partition algorithm in detail. Experimentalresults show that PVSim can get promising speedup, aswell as distributed workload and communication costacross processors.
Specifying queries as relational expressions
Authors: R. F. Boyce, D. D. Chamberlin, M. M. Hammer, W. F. King
Venue: ACM SIGIR Forum (1974)

SQUARE (<u>S</u>pecifying <u>Q</u>ueries <u>A</u>s <u>R</u>elational <u>E</u>xpressions) is a set oriented data sublanguage for expressing queries (access, modification, insertion, and deletion) to a data base consisting of a collection of time-varying relations. The language mimics how people use relations or tables to obtain information. It does not require the sophisticated mathematical machinery of the predicate calculus (bound variables, quantifiers, etc.) in order to express simple references to tables. However, the language has been shown to be complete, i.e., any query expressible in the predicate calculus is expressible in SQUARE.
Learning to set up numerical optimizations of engineering designs
Authors: Mark Schwabacher, Thomas Ellman, Haym Hirsh
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the objective function and constraint functions are continuous, smooth, and defined everywhere. Unfortunately, realistic simulators tend to violate these assumptions, making optimization unreliable. Several decisions that need to be made in setting up an optimization, such as the choice of a starting prototype and the choice of a formulation of the search space, can make a difference in the reliability of the optimization. Machine learning can improve gradient-based methods by making these choices based on the results of previous optimizations. This paper demonstrates this idea by using machine learning for four parts of the optimization setup problem: selecting a starting prototype from a database of prototypes, synthesizing a new starting prototype, predicting which design goals are achievable, and selecting a formulation of the search space. We use standard tree-induction algorithms (C4.5 and CART). We present results in two realistic engineering domains: racing yachts and supersonic aircraft. Our experimental results show that using inductive learning to make setup decisions improves both the speed and the reliability of design optimization.
Fast parallel edge colouring of graphs
Authors: G. Sajith, S. Saxena
Venue: Journal of Parallel and Distributed Computing (2003)

The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a (Δ + d)-edge-colouring, 1 ≤ d < Δ, in O((log d + (Δ/d)4)log2 n) time, using n + m processors; 2. an algorithm that finds a Δ1+ε-edge-colouring, 0 < ε < 1, in O(log Δ log* n) time, using nΔ1+ε processors.
Administration of an RBAC System
Authors: Fredj Dridi, Björn Muschall, Günther Pernul
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Recently RBAC (role-based access controls) was found to be among the most attractive solutions for providing acess control in web-based e-commerce and e-government applications. Usually, such systems involve a huge number of heterogeneous users working with the systems under different rights and obligations. In an RBAC authorization and accesscontrol system the users are assigned to roles which are derived from the organizational structure. Because of the huge amount of users and the diversity of their requirments the administration of a RBAC system becomes crucial. Our group is involved in the European funded Webocracy project in which we have designed and implemented an RBAC system based on the Core RBAC model as de.ned in a proposed NIST standard. Based on the functional speci.cation of the proposed NIST standard we speci.ed administration requirements for managing roles, users and permissions we speci.ed. In this paper we will present an administration console, which we designed to implement this requirements.
A Multiresolution Approach for Shape from Shading Coupling Deterministic and Stochastic Optimization
Authors: Alain Crouzil, Xavier Descombes, Jean-Denis Durou
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Shape from shading is an ill-posed inverse problem for which there is no completely satisfactory solution in the existing literature. In this paper, we address shape from shading as an energy minimization problem. We first show that the deterministic approach provides efficient algorithms in terms of CPU time, but reaches its limits since the energy associated with shape from shading can contain multiple deep local minima. We derive an alternative stochastic approach using simulated annealing. The obtained results strongly outperform the results of the deterministic approach. The shortcoming is an extreme slowness of the optimization. Therefore, we propose a hybrid approach which combines the deterministic and stochastic approaches in a multiresolution framework.
Motion Estimation Using Statistical Learning Theory
Authors: Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Cherkassky
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper describes a novel application of Statistical Learning Theory (SLT) to single motion estimation and tracking. The problem of motion estimation can be related to statistical model selection, where the goal is to select one (correct) motion model from several possible motion models, given finite noisy samples. SLT, also known as Vapnik-Chervonenkis (VC), theory provides analytic generalization bounds for model selection, which have been used successfully for practical model selection. This paper describes a successful application of an SLT-based model selection approach to the challenging problem of estimating optimal motion models from small data sets of image measurements (flow). We present results of experiments on both synthetic and real image sequences for motion interpolation and extrapolation; these results demonstrate the feasibility and strength of our approach. Our experimental results show that for motion estimation applications, SLT-based model selection compares favorably against alternative model selection methods, such as the Akaike's fpe, Schwartz' criterion (sc), Generalized Cross-Validation (gcv), and Shibata's Model Selector (sms). The paper also shows how to address the aperture problem using SLT-based model selection for penalized linear (ridge regression) formulation.
A Multigrid Method for Viscoelastic Fluid Flow
Authors: Hyesuk Lee
Venue: SIAM Journal on Numerical Analysis (2004)

We study a multigrid finite element method for a viscoelastic fluid flow obeying an Oldroyd-B--type constitutive law. The multigrid method is a time-saving method in which the full nonlinear system is solved on a coarse grid, and subsequent approximations are generated on a succession of refined grids by solving a linearized problem. We show that the linearized problem has an approximate solution and present an error bound for a two-grid method. We also numerically demonstrate that the multigrid method is significantly more efficient than the standard one-grid finite element method.