ppxscal/embedding_network huggingface dataset:
Realistic and efficient wrinkle simulation using an anatomy-based face model with adaptive refinement
Authors: Y. Zhang, T. Sim
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents a geometric wrinkle model based on facial muscles for realistically and efficiently simulating wrinkles generated in facial expressions. Our method simulates wrinkles on an anatomy-based face model that mimics the layered structure of skin, muscles, and skull for facial animation. Corresponding to three types of facial muscles, a geometric model is developed to govern how the wrinkle amplitude evolves locally upon skin deformation. By taking into account the properties of real wrinkles, it provides intuitive parameters for easy control over wrinkle characteristics. During facial animation, wrinkles are generated in the local regions influenced by muscle contraction, simulating resistance to compression of tissues. In the simulation, an adaptive refinement automatically adapts the local resolution at which potential inaccuracies arc detected depending on local deformation. Thanks to its geometric nature, our method simulates wrinkles that can be dynamically rendered at interactive rates.
Learning program behavior profiles for intrusion detection
Authors: Anup K. Ghosh, Aaron Schwartzbard, Michael Schatz
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

Profiling the behavior of programs can be a useful reference for detecting potential intrusions against systems. This paper presents three anomaly detection techniques for profiling program behavior that evolve from memorization to generalization. The goal of monitoring program behavior is to be able to detect potential intrusions by noting irregularities in program behavior. The techniques start from a simple equality matching algorithm for determining anomalous behavior, and evolve to a feed-forward backpropagation neural network for learning program behavior, and finally to an Elman network for recognizing recurrent features in program execution traces. In order to detect future attacks against systems, intrusion detection systems must be able to generalize from past observed behavior. The goal of this research is to employ machine learning techniques that can generalize from past observed behavior to the problem of intrusion detection. The performance of these systems is compared by testing them with data provided by the DARPA Intrusion Detection Evaluation program.
Deterministic quadratic semi-blind FIR multichannel estimation algorithms and performance
Authors: E. de Carvalho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The purpose of semi-blind channel identification methods is to exploit the information used by blind methods and the information coming from known symbols. The main focus of this paper is the study of deterministic quadratic semi-blind algorithms which are of particular interest because of their low computational complexity. The associated criteria are formed as a linear combination of a blind and a training sequence based criterion. Through the examples of subchannel response matching and subspace fitting based semi-blind criteria, we study how to construct properly such semi-blind criteria and how to choose the weights of the linear combination. We provide a performance study for these algorithms and give theoretical conditions for the semi-blind performance to be independent of the weights.
Cleaning and Processing RSS Measurements for Location Fingerprinting
Authors: Mikkel Baun Kjaergaard
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Handling variations in sampled Received Signal Strength (RSS) is neassary for achieving robust location fingerprinting (LF). Current research has only proposed limited system-specific models for how to handle the cleaning of RSS variations. However, this paper propose a novel model for both cleaning and processing RSS measurements for LF systems. The proposed model is evaluated with a state-of-the-art LF system. The evaluation results show improved accuracy for the evaluated LF system when used with the proposed model.
Multimode variable bit rate speech coding: an efficient paradigm for high-quality low-rate representation of speech signal
Authors: A. Das
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The speech signal consists of a time-varying ensemble of different types of segments with distinct characteristics, which require different degrees of coding resolution in order to retain an overall high voice quality. A fixed-rate coder can capture such time-varying characteristics only if it operates at a high enough bit rate. At a low bit rate, a fixed-rate coder will not be able to capture all of these various segments well and will fail to render high voice quality. A multimode variable bit rate (VBR) coder uses an arsenal of modes, operating at different bit rates. These modes are designed to represent these different speech segments optimally with the right amount of coding resolution. Thus, a multimode VBR codec adapts the coding mechanism to the input speech and delivers high quality at low (average) rates. This paper presents the essential framework and the unique advantages of a multimode VBR codec and suggests algorithms for the different modes.
Secure WWW transactions using standard HTTP and Java applets
Authors: F. Bergadano, B. Crispo, M. Eccettuato
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

Can users access information on the Web securely with their unchanged, normal broswers, and yet without relying on the cryptographic software contained in those browsers? In this paper we show that this is possible, with a communication architecture based on Java applets. This is important, because cryptographic functions need be separated from both the user interface and the communications routines. It must be possible to acquire the source code for the relevant modules and alternative software vendors must be available, in order to avoid hidden trapdoors and undetected implementation problems. Our approach is alternative to solutions at the protocol level (e.g., SSL), because the unchanged HTTP/TCP/IP stack is maintained. Moreover, it does not require the installation of proxies.
Connected Giving: Ordinary People Coordinating Disaster Relief on the Internet
Authors: Cristen Torrey, Moira Burke, Matthew Lee, Anind Dey, Susan Fussell, Sara Kiesler
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Internet is widely valued for distributing control over information to a lateral network of individuals, but it is not clear how these networks can most effectively organize themselves. This paper describes the distributed networks of volunteers that emerged online following Hurricane Katrina. Online communities responded to the disaster by facilitating the distribution of donated goods from ordinary people directly to hurricane survivors. These "connected giving" groups faced several challenges: establishing authority within the group, providing relevant information, developing trust in one another, and sustaining the group over time. Two forms of computer-mediated connected giving were observed: small blog communities and large forums. Small blog communities used a centralized authority structure that was more immediately successful in managing information and developing trust, but over time, blog communities were difficult to sustain. Larger and more decentralized forums had greater difficulties focusing the community's communication and developing trust but sustained themselves over a long period of time.
On obtaining quadratic and cubic error convergence using weighted Kronecker-sequences
Authors: B. Vandewoestyne, R. Cools, T. Warnock
Venue: Computing (2007)

Kronecker-sequences that use the fractional parts of multiples of irrationals, are well known to be one of the special type of low-discrepancy sequences that can be used for quasi&#x2013;Monte Carlo integration. One simply takes the average of the function values evaluated in the points of the sequence to obtain an estimate for the integral value. In the past, it was shown that applying certain weights to the average of the function values increases the asymptotic error convergence order dramatically for certain classes of functions. In this work, we start from the above theoretical basis and we derive algorithms for obtaining quadratic and cubic error convergence. The algorithms are &#x201c;open&#x201d; in the sense that extra steps in the algorithm can easily be taken in order to improve the result. The amount of work for our algorithms increases linearly with the number of steps.
From Model-Driven Development to Model-Driven Engineering
Authors: Bran Selic
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

The adoption of model-driven methods for software development is rapidly gaining momentum, stimulated greatly by the emergence of new modeling language standards and corresponding tools. The ability of models to highlight the important aspects of a system while abstracting away the irrelevant bits provides a very effective means of coping with the often overwhelming complexity of modern software systems. However, model-driven development (MDD) is still deemed inappropriate for real-time and embedded software by many practitioners even though the complexity of their systems often exceeds that encountered in other domains.
Absolute Transmission Delay Guarantee in Optical Burst-Switched Networks: A Scheme and Performance Evaluation
Authors: Noureddine Boudriga, Amor Lazzez, Mohammad S. Obaidat
Venue: Simulation (2007)

Among the promising solutions for next generation Internet backbone, one can consider optical burst switching (OBS) technology. This technology does not, however, provide suitable quality-of-service (QoS) support. Several schemes have been proposed to provide QoS differentiation in OBS networks. The majority of these schemes are based on a relative QoS model in which the performance of a given traffic class is defined in comparison with other classes. A set of mechanisms have been proposed to provide an absolute traffic loss guarantee, but no mechanism has been proposed to handle absolute transmission delay in OBS networks. The aim of this paper is to propose a solution to provide an absolute transmission delay guarantee over an OBS network and thus support emerging multimedia applications with delay and bandwidth constraints based on a network architecture that is suitable for OBS switching and QoS provisioning. We also develop an analytic model based on a queuing system of the proposed solution. Finally, simulation experiments are conducted to validate the proposed scheme and study its features.
A Generational Algorithm to Multiprocessor Cache Coherence
Authors: Tzi-cker Chiueh
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In view of the growing gap between processor speeds and net work latency, it becomes increasingly expensive to maintain multi-processor cache consistency via run-time inter processor communication. Software-Controlled cache coher ence schemes have the advantage of simplified hardware and the reduction of inter-processor communication traffic. Among previously proposed software-based schemes, those based on the concept of version/timestamp show the most aggressive performance potential. Unfortunately these methods have several implementation and performance prob lems that prevent them from being practical implementation choices. In this paper, we discuss these problems and describe a generational cache coherence algorithm that elim inates all of these problems. Moreover, the new algorithm can exploit inter-level temporal locality of parallel programs with significantly less hardware support.
Asynchronous-transition HMM
Authors: S. Matsuda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We propose a new class of hidden Markov model (HMM) called asynchronous-transition HMM (AT-HMM). Opposed to conventional HMMs where hidden state transition occurs simultaneously to all features, the new class of HMM allows state transitions asynchronized between individual features to better model asynchronous timings of acoustic feature changes. In this paper, we focus on a particular class of AT-HMM with sequential constraints based on a novel concept of "state tying along time". To maximize the advantage of the new model, we also introduce a feature-wise state tying technique. Speaker-dependent speech recognition experiments demonstrated error reduction rates more than 30% and 50% in phoneme and isolated word recognitions, respectively, compared with conventional HMMs.
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Authors: Ron Lavi, Chaitanya Swamy
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

We consider the problem of makespan minimization on m unrelated machines in the context of algorithmic mechanism design, where the machines are the strategic players. This is a multidimensional scheduling domain, and the only known positive results for makespan minimization in such a domain are O(m)-approximation truthful mechanisms [22, 20]. We study a well-motivated special case of this problem, where the processing time of a job on each machine may either be "low" or "high", and the low and high values are public and job-dependent. This preserves the multidimensionality of the domain, and generalizes the restricted-machines (i.e., {pj,∞}) setting in scheduling. We give a general technique to convert any c-approximation algorithm to a 3c-approximation truthful-in-expectation mechanism. This is one of the few known results that shows how to export approximation algorithms for a multidimensional problem into truthful mechanisms in a black-box fashion. When the low and high values are the same for all jobs, we devise a deterministic 2-approximation truthful mechanism. These are the first truthful mechanisms with non-trivial performance guarantees for a multidimensional scheduling domain. Our constructions are novel in two respects. First, we do not utilize or rely on explicit price definitions to prove truthfulness; instead we design algorithms that satisfy cycle monotonicity. Cycle monotonicity [23] is a necessary and sufficient condition for truthfulness, is a generalization of value monotonicity for multidimensional domains. However, whereas value monotonicity has been used extensively and successfully to design truthful mechanisms in single-dimensional domains, ours is the first work that leverages cycle monotonicity in the multidimensional setting. Second, our randomized mechanisms are obtained by first constructing a fractional truthful mechanism for a fractional relaxation of the problem, and then converting it into a truthful-in-expectation mechanism. This builds upon a technique of [16], and shows the usefulness of fractional mechanisms in truthful mechanism design.
Efficient buffer capacity and scheduler setting computation for soft real-time stream processing applications
Authors: Marco Bekooij, Maarten Wiggers, Jef van Meerbergen
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Soft real-time applications that process data streams can often be intuitively described as dataflow process networks. In this paper we present a novel analysis technique to compute conservative estimates of the required buffer capacities in such process networks. With the same analysis technique scheduler settings can be verified. Unlike many other soft real-time analysis techniques, it is guaranteed that the desired throughput is obtained for the input stream that is used to characterize the application. Experiments with artificial test-cases indicate that the computed FIFO capacities become more conservative if the desired throughput gets closer to the maximum throughput. The run-time of our algorithm for an H263 video decoder test-case was 14 seconds.
Strategies and mechanisms for electronic peer review
Authors: E. F. Gehringer
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We have implemented a peer grading system for review of student assignments over the World Wide Web and used it in approximately eight courses in computing and electrical engineering. Students prepare their assignments and submit them to our Peer Grader (PG) system. Other students are then assigned to review and grade the assignments. The system allows authors and reviewers to communicate, with authors being able to update their submissions. Unique features of our approach include the ability to submit arbitrary sets of Web pages for review, and mechanisms for encouraging careful review of submissions. Electronic peer review facilitates collaborative learning in several ways. First, there is the obvious fact that students can learn from their reviewers' comments. Second, students help each other to improve their communication skills. Third, in team projects, peer review allows team members to be assessed by each other. Finally, peer review makes it possible to break up a large project into small chunks. In fact, new releases of PG are being developed in exactly this way.
Dynamic object identification and verification using video
Authors: B. Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We introduce the concepts of dynamic object identification and verification using video. A generalized Hausdorff metric, which is more robust to noise and allows a confidence interpretation, is suggested for the identification and verification problem. Parameters from sensor motion compensation procedure are incorporated into the search step such that the Hausdorff metric based matching can be achieved efficiently under more complex transformation groups. An algorithm is proposed for identification/verification based on edge map matching using the generalized Hausdorff metric. Experiments on infrared video sequences are provided.
SurfIt!: a WWW browser
Authors: Steve Ball
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

World Wide Web (WWW) browsers have, until recently, only offered static features and media types. A new generation of WWW browsers now becoming available are offering technologies to remove these limitations and allow dynamic extensions to the browser application as well as dynamic media types or active message content. SurfIt! is an example of these "next generation" WWW browsers. It offers safe execution of downloaded Tcl/Tk applets to support active message content, as well as hypertools to dynamically extend the browser at run-time. The latest version of SurfIt! is written entirely as Tcl script code, making it highly portable, user-customisable and extensible.
Rapid Development of Enhanced Services Using Application Programming Interfaces
Authors: D. X. Adamopoulos
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In the highly competitive telecommunications environment of today a service provider must continually evolve its network and enable new revenue-generating services faster and more cost effectively than the competition. These services should create value for the end users by satisfying all their functional requirements in an efficient manner, and they should be delivered with simplicity and ease of provisioning. This paper focuses on the transition from a requirements capture and analysis phase to a service analysis phase in the framework of an object-oriented service creation methodology, by considering the internal structure and the functionality of a telematic service. After the examination of the main activities that take place in the service analysis phase and the identification of the main artifacts that are produced during them, the overall service development process is highlighted, and the paper attempts to validate, through several service creation experiments, not only the service analysis phase, but also the overall service creation methodology. Finally, the validation results are discussed and further evaluation actions are briefly outlined.
Reservation-Based Data Flow Scheduling in Distributed Control Applications
Authors: Anca Hangan, Ramona Marfievici, Gheorghe Sebestyen
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Remote process control and supervision applications developed over the Internet require special communication models and techniques, which can guarantee the real-time and safety restrictions inherent to automation systems. This paper presents a communication model based on data flow analysis and bandwidth reservation that offers a good control over the transmission time of critical data. As part of the model, an analytical method is proposed that allows apriory evaluation of the required minimum bandwidth necessary to assure the fulfillment of real-time transmission restrictions. The model is based on the QoS facilities offered by the IPv6 protocol.
Circuits for high-performance low-power vlsi logic
Authors: Krste Asanovic
Venue:  (2006)

The demands of future computing, as well as the challenges of nanometer-era VLSI design, require new digital logic techniques and styles that are simultaneously high performance, energy efficient, and robust to noise and variation. We propose a new family of logic styles called Preset Skewed Static logic (PSSL). PSSL bridges the gap between the two main logic styles, static CMOS logic and domino logic, occupying an intermediate region in the energy-delay-robustness space between the two. PSSL is better than domino in terms of energy and robustness, and is better than static CMOS ill terms of delay. PSSL works by partially overlapping the execution of consecutive iterations through speculative evaluation. This is accomplished by presetting nodes at register boundaries before input arrival. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Experience in Training Software Quality Engineers to Achieve a Professional Certification
Authors: Marcelo Jenkins
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Very little has been published on the subject of software quality certification training programs. This paper describes a case study on training software professionals to become certified software quality engineers (CSQE). We describe the design of the training course and practice exams, how we conducted the coaching of the students, and summarize the results obtained and the lessons learned during the three years we have offered the course. The experiences outlined in this paper might improve the design and implementation of intensive professional training courses intended at certifying software quality professionals
The Bonobo component and document model
Authors: Nat Friedman
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The Bonobo component model provides an infrastructure for building large-scale applications out of self-contained software components. Bonobo handles in-place live document embedding, compound document storage, and supports a powerful idiom for component-based application design. In this session, Nat will give an in-depth presentation of the Bonobo component model, its design and implementation in Gnome, and an introductory tutorial on how to write Bonobo-based applications.