ppxscal/embedding_network huggingface dataset:
MAPbox: using parameterized behavior classes to confine untrusted applications
Authors: Anurag Acharya, Mandar Raje
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

Designing a suitable confinement mechanism to confine untrusted applications is challenging as such a mechanism needs to satisfy conflicting requirements. The main trade-off is between ease of use and flexibility. In this paper, we present the design, implementation and evaluation of MAPbox, a confinement mechanism that retains the ease of use of application-class-specific sandboxes such as the Java applet sandbox and the Janus document viewer sandbox while providing significantly more flexibility. The key idea is to group application behaviors into classes based on their expected functionality and the resources required to achieve that functionality. Classification of application behavior provides a set of labels (e.g., compiler, reader, netclient) that can be used to concisely communicate the expected functionality of programs between the provider and the users. This is similar to MIME-types which are widely used to concisely describe the expected format of data files. An end-user lists the set of application behaviors she is willing to allow in a file. With each label, she associates a sandbox that limits access to the set of resources needed to achieve the corresponding behavior. When an untrusted application is to be run, this file is consulted. If the label (or the MAP-type) associated with the application is not found in this file, it is not allowed to run. Else, the MAP-type is used to automatically locate and instantiate the appropriate sandbox. We believe that this may be an acceptable level of user interaction since a similar technique (i.e., MIME-types) has been fairly successful for handling documents with different formats. In this paper, we present a set of application behavior classes that we have identified based on a study of a diverse suite of applications that includes CGI scripts, programs downloaded from well-known web repositories and applications from the Solaris 5.6 distribution. We describe the implementation and usage of MAPbox. We evaluate MAPbox from two different perspectives: its effectiveness (how well it is able to confine a suite of untrusted applications) and effciency (what is the overhead introduced). Finally, we describe our experience with MAPbox and discuss potential limitations of this approach.
A Pattern Language for Identity Management
Authors: Nelly Delessy, Eduardo B. Fernandez, Maria M. Larrondo-Petrie
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The development of software has recently changed significantly. With the ubiquity of computing, users may need to access a wider range of applications, which may not know them in advance. Thus there is a need for dynamic trust establishment and identity exchange protocols and whatever security model is used must support these aspects. As a way to make these concepts more precise and concrete, we define architectural patterns for identity management. These patterns can then be used directly in the software development cycle, as proposed by different methodologies. The Identity Provider pattern centralizes the administration of a security domain's subjects. The Circle of Trust pattern represents a federation of service providers that share trust relationships. The Identity Federation pattern allows to federate multiple identities across multiple organizations under a common identity. This pattern relies on the SAML Assertion pattern, which provides a unifying format for communicating identity information between different security domains.
Self-Stabilization as a Foundation for Autonomic Computing
Authors: Olga Brukman, Shlomi Dolev, Yinnon Haviv, Reuven Yagel
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This position paper advocates the use of the well de- fined and provable self-stabilization property of a sys- tem, to achieve the goals of the self-* paradigms and au- tonomic computing. Several recent results starting from hardware concerns, continuing with the operating sys- tem, and ending in the applications, are integrated: the self-stabilizing microprocessor, with the self-stabilizing operating system, the self-stabilization preserving com- piler, and the self-stabilizing autonomic recoverer for applications.
Least squares estimation of polynomial phase signals via stochastic tree-search
Authors: Dawei Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Estimating the parameters for a constant amplitude, polynomial phase signal with additive Gaussian noise is considered. The difficulty in this problem is that there are many unobserved integers when a linear regression model is used for wrapped phases. Analysing the least squares target function based on the regression model, we use the differencing approach to simplify it. Thus a tree-search algorithm can be used to find the solution of the least squares problem. To reduce the computational complexity, statistical inference methods are applied. Then an attractive recursive algorithm is derived. Simulation results show that this algorithm works at a lower SNR than that for existing methods.
Predictive multiple-scale lattice VQ for LSF quantization
Authors: A. Vasilache
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper introduces a new lattice quantization scheme, the multiple-scale lattice vector quantization (MSLVQ), based on the truncation of the D/sub 10//sup +/ lattice. The codebook is composed of several copies of the truncated lattice scaled with different scaling factors. A fast nearest neighbor search is introduced. We compare the performance of predictive MSLVQ for quantization of line spectrum frequency (LSF) coefficients with the quantization technique used in the G.729 codec and show the better performance of our method in terms of spectral distortion. The MSLVQ scheme achieves the transparent quality at 21 bits/frame.
Ontology-based Knowledge in Interactive Maintenance Guide
Authors: Seppo Nyrkko, Lauri Carlson, Matti Keijola, Helena Ahonen-Myka, Jyrki Niemi, Jussi Piitulainen, Sirke Viitanen, Martti Meri, Lauri Seitsonen, Petri Mannonen, Jani Juvonen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes 4M, a language technology research project where a dialogue system is applied on a mobile platform in a maintenance job scenario. The human-machine interface uses speech synthesis and recognition, assisted with a hypertext display. We describe a modular agent architecture, composed of independent program components which are implemented by or communicate using ontology programming techniques. Domain content and lingware are developed and shared using standard web ontology formats and ontology-aware offline tools. A contribution of the project is the attention paid to standardization to help provide the system with new content and to migrate it to new domains, languages and purposes.
Analysis and Cryptanalysis of a Selective Encryption Method for JPEG Images
Authors: W. Puech, J. M. Rodrigues
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper addresses the protection of images. We address the problem of simultaneous selective encryption (SE) and image compression. The SE is done by using the Advanced Encryption Standard (AES) algorithm with the Cipher Feedback (CFB) mode one a part of the Huffman coefficients corresponding to the AC frequencies. For the compression we consider the JPEG algorithm. Our approach is done without affecting the compression rate and by keeping the JPEG bitstream compliance. In the proposed method, the SE is performed in the Huffman coding stage of the JPEG algorithm without affecting the size of the compressed image. We provide an experimental analysis of the proposed method when applied on still images as well as the results when applying SE in JPEG compressed images.
Top-k Monitoring in Wireless Sensor Networks
Authors: Minji Wu, Jianliang Xu, Xueyan Tang, Wang-Chien Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Top-k monitoring is important to many wireless sensor applications. This paper exploits the semantics of top-k query and proposes an energy-efficient monitoring approach called FILA. The basic idea is to install a filter at each sensor node to suppress unnecessary sensor updates. Filter setting and query reevaluation upon updates are two fundamental issues to the correctness and efficiency of the FILA approach. We develop a query reevaluation algorithm that is capable of handling concurrent sensor updates. In particular, we present optimization techniques to reduce the probing cost. We design a skewed filter setting scheme, which aims to balance energy consumption and prolong network lifetime. Moreover, two filter update strategies, namely, eager and lazy, are proposed to favor different application scenarios. We also extend the algorithms to several variants of top-k query, that is, order-insensitive, approximate, and value monitoring. The performance of the proposed FILA approach is extensively evaluated using real data traces. The results show that FILA substantially outperforms the existing TAG-based approach and range caching approach in terms of both network lifetime and energy consumption under various network configurations.
Wreath product cyclic group-based convolution: a new class of noncommutative filters
Authors: G. Mirchandani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The theory of spectral analysis of a particular class of noncommutative groups-wreath products of cyclic groups-has been shown to have a group-based convolution that leads to a new class of noncommutative filters. These filters, with their group and scale-selective properties and their relationship to DFT filter banks, offer some intriguing possibilities in signal processing applications. We give a summary of some of the basic properties of convolution with wreath product cyclic groups and illustrate those properties through an example. Applications to some basic signal processing tasks are proposed.
N-best based supervised and unsupervised adaptation for native and non-native speakers in cars
Authors: P. Nguyen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A new set of techniques exploiting N-best hypotheses in supervised and unsupervised adaptation are presented. These techniques combine statistics extracted from the N-best hypotheses with a weight derived from a likelihood ratio confidence measure. In the case of supervised adaptation the knowledge of the correct string is used to perform N-best based corrective adaptation. Experiments run for continuous letter recognition recorded in a car environment show that weighting N-best sequences by a likelihood ratio confidence measure provides only marginal improvement as compared to 1-best unsupervised adaptation and N-best unsupervised adaptation with equal weighting. However, an N-best based supervised corrective adaptation method weighting correct letters positively and incorrect letters negatively, resulted in a 13% decrease of the error rate as compared with supervised adaptation. The largest improvement was obtained for non-native speakers.
CaMus2: collaborative music performance with mobile camera phones
Authors: Michael Rohs, Georg Essl
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

CaMus2 is a multi-user multi-phone extension of the CaMus system. Mobile camera phones use their cameras to track position, rotation, height, and other parameters over a marker sheet to allow interactive performance of music. Multiple camera phones can use the same or separate marker sheets and send their interaction parameters via Bluetooth to a computer where the sensor information is converted to MIDI format to allow control of a wide range of sound generation and manipulation hardware and software. The semantics of the mapping of MIDI message to performance parameters of the camera interactions are fed back into the visualization on the camera phone.
Failure rates in introductory programming
Authors: Jens Bennedsen, Michael E. Caspersen
Venue: ACM SIGCSE Bulletin (2007)

It is a common conception that CS1 is a very difficult course and that failure rates are high. However, until now there has only been anecdotal evidence for this claim. This article reports on a survey among institutions around the world regarding failure rates in introductory programming courses. The article describes the design of the survey and the results. The number of institutions answering the call for data was unfortunately rather low, so it is difficult to make firm conclusions. It is our hope that this article can be the starting point for a systematic collection of data in order to find solid proof of the actual failure and pass rates of CS1.
Social Behaviours in P2P Systems: An Efficient Algorithm for Resource Organisation
Authors: Vincenza Carchiolo, Michele Malgeri, Giuseppe Mangioni, Vincenzo Nicosia
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

P2P systems are a great solution to the problem of distributing resources. The main issue of P2P networks is that searching and retrieving resources shared by peers is usually expensive and does not take into account similarities among peers. In this paper we present preliminary simulations of PROSA , a novel algorithm for P2P network structuring, inspired by social behaviours. Peers in PROSA self-organise in social groups of similar peers, called "semantic-groups", depending on the resources they are sharing. Such a network smoothly evolves to a small- world graph, where queries for resources are efficiently and effectively routed.
Fusion of Multiple Camera Views for Kernel-Based 3D Tracking
Authors: Ambrish Tyagi, Gerasimos Potamianos, James W. Davis, Stephen M. Chu
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

We present a computer vision system to robustly track an object in 3D by combining evidence from multiple calibrated cameras. Its novelty lies in the proposed unified approach to 3D kernel based tracking, that amounts to fusing the appearance features from all available camera sensors, as opposed to tracking the object appearance in the individual 2D views and fusing the results. The elegance of the method resides in its inherent ability to handle problems encountered by various 2D trackers, including scale selection, occlusion, view-dependence, and correspondence across different views. We apply the method on the CHIL project database for tracking the presenter's head during lectures inside smart rooms equipped with four calibrated cameras. As compared to traditional 2D based mean shift tracking approaches, the proposed algorithm results in 35% relative reduction in overall 3D tracking error and a 70% reduction in the number of tracker re-initializations.
Using emulation to understand and improve wireless networks and applications
Authors: Glenn Judd, Peter Steenkiste
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Researchers have long faced a fundamental tension between the experimental realism of wireless testbeds on one hand, and the control and repeatability of simulation on the other hand. To overcome the stark tradeoff of these traditional alternatives, we are developing a wireless emulator that enables both realistic and repeatable experimentation by leveraging physical layer emulation. We discuss the design and implementation of a prototype wireless emulator, and show how this emulator can be leveraged to provide insight into wireless network and application behaviour. Our experience shows that, compared to simulation, our emulator-based approach provides us with a better understanding of real-world wireless network performance, and enables us to quickly deploy our research into an operational wireless network, while still allowing us to enjoy the benefits of a controlled experimental environment.
Do Mobile Device Applications Affect Learning?
Authors: Doug Vogel, David M. Kennedy, Kevin Kuan, Ron Kwok, Jean Lai
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Mobile devices (e.g., PDAs and smartphones) are increasingly emerging as part of daily life, particularly with university students. The City University of Hong Kong has embarked on a long-term program to develop and integrate mobile learning activities into the context of undergraduate courses. This paper reports on the development, introduction and evaluation of a portfolio of collaborative mobile learning applications. Results support convictions that intrinsic and extrinsic motivation to embrace mobile applications correlates with enhanced performance, albeit with constructive alignment of student learning interests as a moderator.
On C-Degrees, H-Degrees and T-Degrees
Authors: Wolfgang Merkle, Frank Stephan
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

Following a line of research that aims at relating the computation power and the initial segment complexity of a set, the work presented here investigates into the relations between Turing reducibility, defined in terms of computation power, and C-reducibility and H-reducibility, defined in terms of the complexity of initial segments. The global structures of all C-degrees and of all Hdegrees are rich and allows to embed the lattice of the powerset of the natural numbers under inclusion. In particular, there are C-degrees, as well as H-degrees, that are different from the least degree and are the meet of two other degrees, whereas on the other hand there are pairs of sets that have a meet neither in the C-degrees nor in the H-degrees; these results answer questions in a survey by Nies and Miller. There are r.e. sets that form a minimal pair for C-reducibility and \Sigma _2^0sets that form a minimal pair for H-reducibility, which answers questions by Downey and Hirschfeldt. Furthermore, the following facts on the relation between C-degrees, H-degrees and Turing degrees hold. Every Cdegree contains at most one Turing degree and this bound is sharp since there are C-degrees that do contain a Turing degree. For the comprising class of complex sets, neither the C-degree nor the H-degree of such a set can contain a Turing degree, in fact, the Turing degree of any complex set contains infinitely many C-degrees. Similarly the Turing degree of any set that computes the halting problem contains infinitely many H-degrees, while the H-degree of any 2-random set R is never contained in the Turing degree of R. By the latter, H-equivalence of Martin-Lof random sets does not imply their Turing equivalence. The structure of the Cdegrees contained in the Turing degree of a complex sets is rich and allows to embed any countable distributive lattice; a corresponding statement is true for the structure of H-degrees that are contained in the Turing degree of a set that computes the halting problem.
Consistency in quantized matching pursuit
Authors: V. K. Goyal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper explores the effects of coefficient quantization in applying the matching pursuit algorithm to source coding of vectors in R/sup N/. By considering the issue of consistency, we find that even though matching pursuit is designed to produce a linear combination to estimate a given source vector, optimal reconstruction in the presence of coefficient quantization requires a nonlinear algorithm. Such an algorithm was implemented and was experimentally confirmed to have superior reconstruction properties in comparison to the standard linear reconstruction. The improvement depends on the source, dictionary and operating point; in some cases the MSE was lessened by as much as a factor of five.
WWW electronic commerce and java trojan horses
Authors: J. D. Tygar, Alma Whitten
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

World Wide Web electronic commerce applications often require consumers to enter private information (such as credit card numbers) into forms in the browser window. If third parties can insert trojan horse applications onto a consumer's machine, they can monitor keyboard strokes and steal private information. This paper outlines a simple way to accomplish this using Java or similar remote execution facilities. We implemented a simple version of this attack. We give a general method, window personalization, that can thwart or prevent this attack.
Online Analysis and Runtime Steering of Dynamic Workflows in the ASKALON Grid Environment
Authors: Radu
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We present a new distributed performance analysis service of the ASKALON integrated Grid environment for computing runtime overheads of dynamic workflows in realtime based on event correlation techniques. We illustrate a formal method to express precise overhead correlation rules, including several performance contracts as quality of service parameters based on fuzzy logic to be enforced in dynamic environments though rescheduling, various runtime optimisations, and steering techniques. We demonstrate experimental results for two real applications from material chemistry and graphics rendering domains.
Assessing a Multi-Site Development Organization for Architectural Compliance
Authors: Viktor Clerc, Patricia Lago, Hans van Vliet
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Multi-site development organizations require coordination and communication efforts between different sites to ensure successful distributed development. These efforts need to be guided by a set of principles and statements on the software architecture that must be complied with throughout the organization: architectural rules. It is of paramount importance that multi-site development organizations incorporate measures in the architecting process to secure compliance with these rules throughout the organization. We describe a method to assess the degree to which compliance measures are secured in multi-site development organizations. We share our experience in applying this method in a large development organization in the consumer electronics domain.
Multi-level Conceptual Modeling for Biomedical Data and Ontologies Integration
Authors: Ramez Elmasri, Jack Fu, Feng Ji
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In biomedical/biological research fields, some semantic data (experiments, evidence, annotation, etc.) can be classified into different levels (from the DNA/RNA level to higher levels such as cells, tissues, organs, and biological systems) based on different degrees of abstraction. Hence, it is important to represent and integrate them across different levels. The purpose of this paper is to address the characteristics of biological data and develop a multi-level conceptual model. Our approach facilitates more accurate modeling of biomedical ontologies, and a better understanding of the data stored in various biological data sources. Furthermore, we propose intra-level and inter-level relationships and give formal definitions illustrated with examples in order to precisely describe relation/behavior among concepts at multiple levels. Our work can be used as the building block for biomedical data or ontologies integration.