ppxscal/embedding_network huggingface dataset:
Operating system profiling via latency analysis
Authors: Nikolai Joukov, Avishay Traeger, Rakesh Iyer, Charles P. Wright, Erez Zadok
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavior depends on actual workloads and external inputs. Runtime profiling is a key technique to prove new concepts, debug problems, and optimize performance. Unfortunately, existing profiling methods are lacking in important areas-they do not provide enough information about the OS's behavior, they require OS modification and therefore are not portable, or they incur high overheads thus perturbing the profiled OS. We developed OSprof: a versatile, portable, and efficient OS profiling method based on latency distributions analysis. OSprof automatically selects important profiles for subsequent visual analysis. We have demonstrated that a suitable workload can be used to profile virtually any OS component. OSprof is portable because it can intercept operations and measure OS behavior from user-level or from inside the kernel without requiring source code. OSprof has typical CPU time overheads below 4%. In this paper we describe our techniques and demonstrate their usefulness through a series of profiles conducted on Linux, FreeBSD, and Windows, including client/server scenarios. We discovered and investigated a number of interesting interactions, including scheduler behavior, multi-modal I/O distributions, and a previously unknown lock contention, which we fixed.
Some considerations of cognitive modeling for collective decision support
Authors: Gilles Coppin, Frederic Cadier, Philippe Lenca
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper, we present some considerations about the cognitive modeling of expert decision behaviors and his/her strategies that can be used to design a decision support system at individual but also at collective level. We present especially the psychological references that underly our own modeling of an individual decision maker, and propose a way to use these references in analysing decisional interaction amongst a group and thus to deal with collective decision making amongst a team.
Interactive music composition with the CFE framework
Authors: Ying-ping Chen
Venue: ACM SIGEVOlution (2007)

This article presents an interactive music composition system which utilizes the black-box optimization model of evolutionary computation. The core CFE framework---Composition, Feedback, and Evolution---is presented and described. The music composition system produces short, manageable pieces of music by interacting with users. The essential features of the system include the capability of creating customized pieces of music based on the user preference and the facilities specifically designed for generating a large amount of music. Finally, several pieces of music composed by the described system are demonstrated as showcases. This work shows that it is feasible and promising for computers to automatically compose customized or personalized music.
Non-cumulative character scoring in a forward search for online handwriting recognition
Authors: G. Seni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In this paper, we describe a novel and efficient search strategy as it is applied to on-line handwriting recognition. The recognition system, which is based on Viterbi decoding, computes posterior probabilities of characters based on sequences of observations, referred to as segments. Posterior distributions of segments are appealing because they allow correlation modeling of the entire segment. In addition, they provide a reliable confidence-rejection mechanism due to their discriminative nature. These posterior scores, which we term non-cumulative, cannot be used for hypothesis pruning as it is done in a standard time synchronous beam search. We propose an organization of the search algorithm that addresses the difficulties posed by the use of non-cumulative character scoring in an efficient way. We report on a writer-independent recognition system that achieves a tenfold reduction in the required number of theories while maintaining the same level of accuracy. Finally, we provide a comparison between the segmental posterior probabilities and the frame-based, class-conditional distributions of the traditional HMM approach that highlights the differences in the search methodology.
On the Selection of Error Model(s) for OS Robustness Evaluation
Authors: Andreas Johansson, Neeraj Suri, Brendan Murphy
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

The choice of error model used for robustness evaluation of Operating Systems (OSs) influences the evaluation run time, implementation complexity, as well as the evaluation precision. In order to find an "effective" error model for OS evaluation, this paper systematically compares the relative effectiveness of three prominent error models, namely bit-flips, data type errors and fuzzing errors using fault injection at the interface between device drivers OS. Bit-flips come with higher costs (time) than the other models, but allow for more detailed results. Fuzzing is cheaper to implement but is found to be less precise. A composite error model is presented where the low cost of fuzzing is combined with the higher level of details of bit-flips, resulting in high precision with moderate setup and execution costs.
Energy-efficient Hardware Accelerators for the SA-DCT and Its Inverse
Authors: Andrew Kinane, Noel O'Connor
Venue: Journal of VLSI Signal Processing Systems (2007)

The explosive growth of the mobile multimedia industry has accentuated the need for efficient VLSI implementations of the associated computationally demanding signal processing algorithms. In particular, the short battery life caused by excessive power consumption of mobile devices has become the biggest obstacle facing truly mobile multimedia. We propose novel hardware accelerator architectures for two of the most computationally demanding algorithms of the MPEG-4 video compression standard------the forward and inverse shape adaptive discrete cosine transforms (SA-DCT/IDCT). These accelerators have been designed using general low-energy design philosophies at the algorithmic/architectural abstraction levels. The themes of these philosophies are avoiding waste and trading area/performance for power and energy gains. Each core has been synthesised targeting TSMC 0.09 μm TCBN90LP technology, and the experimental results presented in this paper show that the proposed cores improve upon the prior art.
TROBIC: two-row buffer image compression
Authors: V. Ratnakar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We describe a color image compression and decompression scheme suitable for high resolution printers. The proposed scheme requires only two image rows in memory at any time, and hence is suitable for low-cost, high-resolution printing systems. The compression ratio can be specified and is achieved exactly. Compound document images consisting of continuous-tone, natural regions mixed with synthetic graphics or text are handled with uniformly high quality. While the target compression ratios are moderate, the quality requirements are extremely high: the compressed and decompressed printed image needs to be virtually indistinguishable from the original printed image. The scheme combines a lossless block coding technique with a wavelet block codec. The wavelet block codec uses a new and simple entropy coding technique that is more suitable for the specific block-structure, compression target, and discrete wavelet transform used. 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
The CLEF 2005 Automatic Medical Image Annotation Task
Authors: Thomas Deselaers, Henning Müller, Paul Clough, Hermann Ney, Thomas M. Lehmann
Venue: International Journal of Computer Vision (2007)

In this paper, the automatic annotation task of the 2005 CLEF cross-language image retrieval campaign (ImageCLEF) is described. This paper focuses on the database used, the task setup, and the plans for further medical image annotation tasks in the context of ImageCLEF. Furthermore, a short summary of the results of 2005 is given. The automatic annotation task was added to ImageCLEF in 2005 and provides the first international evaluation of state-of-the-art methods for completely automatic annotation of medical images based on visual properties.The aim of this task is to explore and promote the use of automatic annotation techniques to allow for extracting semantic information from little-annotated medical images. A database of 10.000 images was established and annotated by experienced physicians resulting in 57 classes, each with at least 10 images. Detailed analysis is done regarding the (i) image representation, (ii) classification method, and (iii) learning method. Based on the strong participation of the 2005 campain, future benchmarks are planned.
A universal access smart-card-based secure file system
Authors: Matthew O'Keefe
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The Secure File System is a joint project between the University of Minnesota and StorageTek which aims to provide an easy-to-use cryptographic file system. It allows you to store your files securely on remote sites using normal networking protocols worry of unauthorized access. SFS does this through the use of a group server which is responsible for all file access controls and smartcards (through MUSCLE software), for verification purposes.
The Imminent Complexity Quagmire in Pervasive Computing--Autonomic Agents a Solution?
Authors: Roy Sterritt, Sarah Eowyn, Patricia O'Hagan, Edward Hanna
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

This paper highlights the need for intrinsic self-management for next generation computing to combat the inherent complexity involved in the sheer scale of pervasive devices and connectivity. Through emerging lessons from a deployed Biometric Identification and Tracking System the recommendation from current available technologies is to utilize autonomic agents to provide the future requirements for self-management.
Building a Research-Practice Partnership: Lessons from a Government IT Workforce Study
Authors: Sharon S. Dawes, Natalie Helbig
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

For decades researchers have sought ways to make their work have more impact on the world and practitioners have wished for research that actually helps them solve pressing problems. This is particularly true for digital government research which emphasizes positive change. Differences in professional culture and lack of mutual understanding about the nature and uses of research lead to this gap. A few studies have outlined ways to bring research and practice closer together in mutually useful ways. This paper describes the development and operation of a research-practice partnership focused on a skills assessment of a government IT workforce. It illustrates how these two communities can collaborate to conduct rigorous research that is also readily usable. The advantages are considerable for both rigor and relevance, but there are also significant costs associated with working in this way.
A Hardware-Based Software Protection Systems--Analysis of Security Dongles with Memory
Authors: I. J. Jozwiak, A. Liber, K. Marczak
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

Software piracy is the illegal reproduction and distribution of software applications, whether for business or personal use. Globally, businesses and consumers will spend $300 billion on PC software over the next four years, according to International Data Corporation (IDC) estimates. Given the current market growth by country and current country-level piracy rates, during the same four-year period, we can expect almost $200 billion worth of PC software to be pirated [1]. Protecting application against not authorized copying using program solutions is impossible. If there is a possibility to start program, there is also a possibility to crack it. Cracking means that application can be used without being registered or to the application there is a mechanism added which enables to obviate implemented there protections (for example: generator of serials codes). The device protection of software (dongles) has existed on the market for many years and it has functioned as devices protecting the software against not authorized copying and usage. For the application to work without device's key, the intruder has to modify it or emulate the presence of device's key. The dissertation presents tools and techniques used to break devices' protection of software with memory. The issue of software protection against not authorized copying, using devices' solutions is not a popular subject of scientific publications. The dissertations provides information about the applied methods and techniques of breaking the hypothetical construction of device's protection used the constructed electronic devices. The research is the introduction to designing the hardware protection of programmes resistant to well-known methods of breaking through safety of electronic devices' keys.
LiveOps: systems management as a service
Authors: Chad Verbowski, Juhan Lee, Xiaogang Liu, Roussi Roussev, Yi-Min Wang
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Existing Management Systems do not detect the most time-consuming and technically difficult anomalies administrators encounter. Oppenheimer found that 33% of outages were caused by human error and that 76% of the time taken to resolve an outage was taken by humans determining what change was needed. Defining anomaly detection rules is challenging and often cannot be shared across organizations. It requires a deep combined knowledge of the software, workload, system configuration, and tuning parameters specific to the workload and overall distributed application topology. We present LiveOps, a scalable systems and security management service based on auditing the interactions between applications and the persistent state they use. This approach simplifies identifying security vulnerabilities, performs compliance auditing, enables forensic investigations, detects patching problems, optimizes troubleshooting, and detects malware/ intrusions. The service enables knowledge sharing across organizations and administrative boundaries and allows for seamless integration between analysis results from disparate management products that build on it. Our configuration-free agent collects all read and write access to registry entries, files, binaries, and process creation. The agents streaming lossless compression creates log files of only 20 MB per day containing an average of 45 million events. The scalable LiveOps back-end service can analyze 1000 machine days of logs in 30 minutes. LiveOps agents have been deployed on 1149 machines from home systems to corporate desktops, including 381 production MSN servers across 11 sites.
Stub-code performance is becoming important
Authors: Andreas Haeberlen, Jochen Liedtke, Yoonho Park, Lars Reuther, Volkmar Uhlig
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary complex marshalling code can almost double communication costs. We have developed an experimental new IDL compiler that produces near-optimal stub code for gcc and the L4 microkernel. The current experimental IDL4 compiler cooperates with the gcc compiler and its x86 code generator. Other compilers or target machines would require different optimizations. In most cases, the generated stub code is approximately 3 times faster (and shorter) than the code generated by a commonly used portable IDL compiler. Benchmarks have shown that efficient stubs can increase application performance by more than 10 percent. The results are applied within IBM's SawMill project that aims at technology for constructing multi-server operating systems.
Emerging Technologies for Next-Generation GRID
Authors: Angelo Corsaro, Antonella Di Stefano, Giuseppe Pappalardo, Corrado Santoro, Emiliano Tramontana
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

The international workshop on Emerging Technologies for Next-generation GRID (ETNGRID) is at its third edition. The number of submitted papers, as well as the topics tackled, clearly show the attention the research community has towards Grid computing, an interest which is continuously growing. We provide here a brief overview of the papers that have been presented at the workshop, summarizing the contribution provided and the advances introduced in the field of Grid computing.
Area Optimizations for Dual-Rail Circuits Using Relative-Timing Analysis
Authors: Tiberiu Chelcea, Girish Venkataramani, Seth C. Goldstein
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

Future deep sub-micron technologies will be characterized by large parametric variations, which could make asynchronous design an attractive solution for use on large scale. However, the investment in asynchronous CAD tools does not approach that in synchronous ones. Even when asynchronous tools leverage existing synchronous toolflows, they introduce large area and speed overheads. This paper proposes several heuristic and optimal algorithms, based on timing interval analysis, for improving existing asynchronous CAD solutions by optimizing area. The optimized circuits are 2.4 times smaller for an optimal algorithm and 1.8 times smaller for a heuristic one than the existing solutions. The optimized circuits are also shown to be resilient to large parametric variations, yielding better average-case latencies than their synchronous counterparts.
A foundation for kilorobotic exploration
Authors: S. P. N. Singh, S. M. Thayer, W. P. Thayer
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A new concept for coordinating large-scale autonomous robot exploration teams having populations in the thousands is introduced along with several illustrative scenarios. Inspired by constructs found within the human immune system, the Immunology-derived Distributed Autonomous Robotics Architecture (IDARA) was developed so that exploratory actions are refined and followed by specific and mediated responses. The foundations of the IDARA model are derived from the immune network model; in particular, interactions derived from the innate immune system are integrated to yield a stronger first-order, all-purpose search strategy. Using this architecture as a foundation, the work develops methods for kilorobotic exploration in dynamic environments. As characterized via computer simulations with robot populations of up to 1,500 robots, IDARA-based exploration proved to be a robust and compact method for largescale multirobot coordination that combines reflexive and deliberative control methods in an opportunistic fashion, mimicking the human immune system.
UIMA GRID: Distributed Large-scale Text Analysis
Authors: Michael Thomas Egner, Markus Lorch, Edd Biddle
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

This paper shows how loosely coupled compute resources, managed by Condor, can be leveraged together with IBM OmniFind to implement a scalable environment for text analysis based on the Unstructured Information Management Architecture (UIMA). Text analysis can be used to extract valuable knowledge from unstructured text data such as entities and their relationships. When applied to large amounts of data e.g., in the magnitude of several million documents, the process can be too time consuming to react to business needs. This becomes a particular problem when the rule sets, dictionaries, or taxonomies used by the text analysis components are changed to extract new information for a particular business purpose. Such changes may require that the entire set of documents must be reanalyzed. In the scenario motivating this work a constantly growing set of currently 10 million documents needs to frequently be re-processed to accommodate such changes. The text analysis algorithms deployed are very complex and compute intensive, requiring currently about 20 CPU-years for a full re-analysis. Through the distributed architecture discussed in this paper the re-analysis can be performed in one calendar month by opportunistically leveraging compute nodes from a heterogeneous Condor pool.
Low rank estimation of higher order statistics
Authors: T. F. Andre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Low rank estimators for higher order statistics are considered. Rank reduction methods offer a general principle for trading estimator bias for reduced estimator variance. The bias-variance tradeoff is analyzed for low rank estimators of higher order statistics using a tensor product formulation for the moments and cumulants. In general the low rank estimators have a larger bias and smaller variance than the corresponding full rank estimator. Often a tremendous reduction in variance is obtained in exchange for a slight increase in bias. This makes the low rank estimators extremely useful for signal processing algorithms based on sample estimates of the higher order statistics. The low rank estimators also offer considerable reductions in the computational complexity of such algorithms.
Course-based assessment: engaging faculty in reflective practice
Authors: J. E. Sims-Knight
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The College of Engineering (COE) at the University of Massachusetts Dartmouth has begun to implement course based assessment as part of their curricular continuous improvement program. The targeted faculty are those who are developing innovative courses supported by the Foundation Coalition (FC), a collaborative project funded by National Science Foundation. We began in Spring 1999, and have since tried five different strategies: taking faculty to a two-day assessment workshop, a general lecture on embedding an assessment based continuous improvement loop into courses, a written set of guidelines, individual meetings with faculty, and an interactive half-day workshop. We discovered that faculty accept and implement assessment based continuous improvement in their classes once they understand that: (a) it is in their control, (b) it can be done in ways that are cost-effective in terms of time, and (c) that it can reduce frustration in teaching because it makes visible aspects of courses that can be improved.
SSEA: A System for Studying the Effectiveness of Animations
Authors: Eileen T. Kraemer, Bina Reed, Philippa Rhodes, Ashley Hamilton-Taylor
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper describes SSEA (System for Studying the Effectiveness of Animations), an environment designed to support the empirical study of program visualizations.