ppxscal/embedding_network huggingface dataset:
Simple activation for distributed objects
Authors: Ann Wollrath, Geoff Wyant, Jim Waldo
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

In order to support long-lived distributed objects, object activation is required. Activation allows an object to alternate between periods of activity, where the object implementation executes in a process; and periods of dormancy, where the object is on disk and utilizes no system resources. We describe an activation protocol for distributed object systems. The protocol features overall simplicity as well as applicability to several different activation models. We use the Modula-3 network object system as a base for our implementation; while we make no changes to the underlying network object subsystem, we suggest a minor modification that could be made to the marshalling of network objects to assist in lazy activation, our preferred activation model.
Towards Sensor Integration into Multimedia Applications
Authors: Christine Louberry, Philippe Roose, Marc Dalmau
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Since few years, several applications are proposed on mobile devices. However, these applications are not aware of their physical environment. The emergence of wireless sensors, able to monitor their close environment, can provide this service to such applications. This implies an exchange of information between sensors and software components, but they do not use the same communication mode (different protocols, different data structures). In this paper, we are interested in the design of multimedia flow in this type of sensors. We propose a unique component model that enables collaboration between different components without knowing if there are hardware or software and we also propose different mechanisms to transform data between such heterogeneous components.
A type system for preventing data races and deadlocks in the java virtual machine language: 1
Authors: Pratibha Permandla, Michael Roberson, Chandrasekhar Boyapati
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

In previous work on SafeJava we presented a type system extension to the Java source language that statically prevents data races and deadlocks in multithreaded programs. SafeJava is expressive enough to support common programming patterns, its type checking is fast and scalable, and it requires little programming overhead. SafeJava thus offers a promising approach for making multithreaded programs more reliable. This paper presents a corresponding type system extension for the Java virtual machine language (JVML). We call the resulting language SafeJVML. Well-typed SafeJVML programs are guaranteed to be free of data races and deadlocks. Designing a corresponding type system for JVML is important because most Java code is shipped in the JVML format. Designing acorresponding type system for JVML is nontrivial because of important differences between Java and JVML. In particular, the absence of block structure in JVML programs and the fact that they do not use named local variables the way Java programs do make the type systems for Java and JVML significantly different. For example, verifying absence of races and deadlocks in JVML programs requires performing an alias analysis, something that was not necessary for verifying absence of races and deadlocks in Java programs. This paper presents static and dynamic semantics for Safe JVML. It also includes a proof that the SafeJVML type system is sound and that it prevents data races and deadlocks. To the best of our knowledge, this is the first type system for JVML that statically ensures absence of synchronization errors.
Performance evaluation of XSync: an efficient synchronizer for mobile XML data
Authors: F. Lam, N. Lam, R. K. Wong
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Many handheld applications maintain data consistency with data sources through synchronization. In certain applications such as sales force automation, it is highly desirable if updates on the data source can be reflected at the handheld applications immediately. This paper proposes an efficient method to synchronize XML data on multiple mobile devices by identifying all the disjoint copies of updated data to avoid unnecessary synchronizations. Each update to the data source will then be checked to identify all handheld applications which are affected by the update. Communication costs can be further reduced by eliminating the forwarding of unnecessary operations to groups of mobile clients. Finally, this paper focuses on the performance aspects of the proposed approach.
Effects of structure and interaction style on distinct search tasks
Authors: Robert Capra, Gary Marchionini, Jung Sun Oh, Fred Stutzman, Yan Zhang
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In this paper we present the results of a study that investigates the relationships between search tasks, information architecture, and interaction style. Three kinds of search tasks (simple lookup, complex lookup and exploratory) were performed using three different user interfaces (standard web site, hierarchical text-based faceted interface, and dynamic query faceted interface) for a large-scale public corpus containing semi-structured statistical data and reports. Twenty-eight people conducted the three kinds of searches in a between-subjects study and twelve others conducted the three kinds of searches on all three systems in a within-subjects study. Quantitative results demonstrate that the alternative general-purpose user interfaces that accept automated structuring of data offer comparable effectiveness, efficiency, and aesthetics to manually constructed architectures. Qualitative results demonstrate the manual architectures are favored.
The Digital Chameleon Principle: Computing Invisibility by Rendering Transparency
Authors: Frank Nielsen
Venue: IEEE Computer Graphics and Applications (2007)

The author discusses the principles of invisibility and stealth and antistealth technologies from a computer graphics viewpoint. He presents the digital chameleon principle that relies on dynamically capturing and reproducing 4D light fields. That is, he proposes implementing optical camouflage by rendering transparency on objects to be concealed.
Time-Sharing Parallel Applications with Performance Isolation and Control
Authors: Bin Lin, Ananth I. Sundararaj, Peter A. Dinda
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applications from each other and optimize their performance. However, this leads to low utilization or potentially long waiting times. We propose a self-adaptive approach to time-sharing such machines that provides isolation and allows the execution rate of an application to be tightly controlled by the administrator. Our approach combines a periodic real-time scheduler on each node with a global feedback-based control system that governs the local schedulers. We have developed an online system that implements our approach. The system takes as input a target execution rate for each application, and automatically and continuously adjusts the applications' realtime schedules to achieve those rates with proportional CPU utilization. Target rates can be dynamically adjusted. Applications are performance-isolated from each other and from other work that is not using our system. We present an extensive evaluation that shows that the system remains stable with low response times, and that our focus on CPU isolation and control does not come at the significant expense of network I/O, disk I/O, or memory isolation.
Stochastic wavelet-based image modeling using factor graphs and its application to denoising
Authors: S. Xiao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this work, we introduce an efficient hidden Markov field model for wavelet image coefficients and apply it to the image denoising problem. Specifically, we propose to model wavelet image coefficients within subbands as Gaussian random variables with parameters determined by underlying hidden Markov-type process. Our model is inspired by the recent estimation-quantization image coder. To reduce the computational complexity we apply the novel factor graph framework to combine two 1-D chain models to approximate a hidden Markov field (HMF) model. We then apply the proposed models for wavelet image coefficients to perform an approximate minimum mean square error (MMSE) estimation procedure to restore an image corrupted by additive white Gaussian noise. Our results are among the state-of-the-art in the field and they indicate the promise of the proposed modeling techniques.
Application of Software Watchdog as a Dependability Software Service for Automotive Safety Relevant Systems
Authors: Xi Chen, Juejing Feng, Martin Hiller, Vera Lauer
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

To face the challenges resulting from the increasing density of application software components and higher dependability requirements of the future safety systems in the automotive electronics, a dependability software service to monitor individual application software components in runtime is required in order to improve the overall system dependability. This paper proposes the application of a Software Watchdog service providing heartbeat monitoring and program flow checking. The Software Watchdog is integrated in a software platform for the automotive safety electronics. A model-based design with Matlab/Simulink and an evaluation of this Software Watchdog service in a hardware-in-the-loop validator are also given.
Tcl/Tk in the development of user-extensible graphical user interfaces
Authors: John M. Skinner, Richard S. LaBarca, Robert M. Sweet
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper describes the use of Tcl/Tk in the development of user-extensible Graphical User Interfaces. We describe a GUI that provides two facilities, employing Tcl/Tk, that allow its users to extend the basic GUI at runtime. The first facility is a built-in mini Tcl/Tk GUI builder that gives users the ability to generate new screens that are automatically incorporated into the existing GUI. This is accomplished at runtime and does not require the user to write any code. A second feature allows for the incorporation, control, and access of data from, pre-existing Tcl/Tk screens without modification to the original source code of those screens. Program extensions accomplished with these facilities are integrated seamlessly into the original program, and are available immediately, as well as in subsequent executions of the program. In addition to the demonstration of a specific application of these methods, we will show that the techniques are transferable to other applications.
A comparison using signal detection theory of the ability of two computational auditory models to predict experimental data
Authors: L. C. Gresham
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In order to develop improved remediation techniques for hearing impairment, auditory researchers must gain a greater understanding of the relation between the psychophysics of hearing and the underlying physiology. One approach to studying the auditory system has been to design computational auditory models that predict neurophysiological data such as neural firing rates. To link these physiologically-based models to psychophysics, theoretical bounds on detection performance have been derived using signal detection theory to analyze the simulated data for various psychophysical tasks. Previous efforts, including our own recent work using the auditory image model, have demonstrated the validity of this type of analysis; however, theoretical predictions often exceed experimentally-measured performance. In this paper, we compare predictions of detection performance across several computational auditory models. We reconcile some of the previously observed discrepancies by incorporating phase uncertainty into the optimal detector.
Query Assurance Verification for Dynamic Outsourced XML Databases
Authors: Viet Hung Nguyen, Tran Khanh Dang, Nguyen Thanh Son, Josef Kung
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

With rapid developments of network technologies, database outsourcing is emerging as an important new trend beside the "application-as-a-service". In this model, data owners ship their data to external service providers. Service providers do data management tasks and offer their clients a mechanism to manipulate outsourced databases. Since a service provider is not always fully trusted, security and privacy of outsourced data are significant issues. These problems are referred to as data confidentiality, user privacy, data privacy and query assurance. Among them, query assurance takes a crucial role to the success of the database outsourcing model. To the best of our knowledge, however, query assurance, especially for outsourced XML databases, has not been concerned reasonably in any previous work. In this paper, we propose a novel index structure, Nested Merkle B+-Tree, combining the advantages of B+-tree and Merkle Hash Tree to completely deal with three issues of query assurance known as correctness, completeness and freshness in dynamic outsourced XML databases. Experimental results with real datasets prove the effeciency of our proposed solution.
JACOB: just a content-based query system for video databases
Authors: M. La Cascia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The increasing development of advanced multimedia applications requires new technologies for organizing and retrieving by content databases of still digital images or digital video sequences. The authors describe JACOB, a prototypal system allowing content-based browsing and querying in video databases. The JACOB system automatically splits a video into a sequence of shots, extracts a few representative frames (said r-frames) from each shot and computes r-frame descriptors based on features like color and texture. No user action is required during the database population step. Queries exploit this image content description and may be direct or by example.
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
Authors: Anna Corazza Giorgio Satta
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In this paper, we consider probabilistic context-free grammars, a class of generative devices that has been successfully exploited in several applications of syntactic pattern matching, especially in statistical natural language parsing. We investigate the problem of training probabilistic context-free grammars on the basis of distributions defined over an infinite set of trees or an infinite set of sentences by minimizing the cross-entropy. This problem has applications in cases of context-free approximation of distributions generated by more expressive statistical models. We show several interesting theoretical properties of probabilistic context-free grammars that are estimated in this way, including the previously unknown equivalence between the grammar cross-entropy with the input distribution and the so-called derivational entropy of the grammar itself. We discuss important consequences of these results involving the standard application of the maximum-likelihood estimator on finite tree and sentence samples, as well as other finite-state models such as Hidden Markov Models and probabilistic finite automata.
Factors affecting duration and effort estimation errors in software development projects
Authors: Ofer Morgenshtern, Tzvi Raz, Dov Dvir
Venue: Information and Software Technology (2007)

The purpose of this research was to fill a gap in the literature pertaining to the influence of project uncertainty and managerial factors on duration and effort estimation errors. Four dimensions were considered: project uncertainty, use of estimation development processes, use of estimation management processes, and the estimator's experience. Correlation analysis and linear regression models were used to test the model and the hypotheses on the relations between the four dimensions and estimation errors, using a sample of 43 internal software development projects executed during the year 2002 in the IT division of a large government organization in Israel. Our findings indicate that, in general, a high level of uncertainty is associated with higher effort estimation errors while increased use of estimation development processes and estimation management processes, as well as greater estimator experience, are correlated with lower duration estimation errors. From a practical perspective, the specific findings of this study can be used as guidelines for better duration and effort estimation. Accounting for project uncertainty while managing expectations regarding estimate accuracy; investing more in detailed planning and selecting estimators based on the number of projects they have managed rather than their cumulative experience in project management, may reduce estimation errors.
Some Criteria of Making Decisions in Pedestrian Evacuation Algorithms
Authors: Bartlomiej Gudowski, Jaroslaw Was
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The main goal of this paper is to introduce a model of intelligent behavior in pedestrian dynamics using cellular automata. Authors take into account classical situation of large room evacuation, where several exits are available. Presented model includes some criteria of making decisions by a particular pedestrian. Proposed criteria are: distance to all exits, density of crowd in each exit neighborhood, throughput of particular exit and following the other persons.
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
Authors: Y. B. Zhao
Venue: Applied Numerical Mathematics (2007)

It is well known that a wide-neighborhood interior-point algorithm for linear programming performs much better in implementation than its small-neighborhood counterparts. In this paper, we provide a unified way to enlarge the neighborhoods of predictor-corrector interior-point algorithms for linear programming. We prove that our methods not only enlarge the neighborhoods but also retain the so-far best known iteration complexity and superlinear (or quadratic) convergence of the original interior-point algorithms. The idea of our methods is to use the global minimizers of proximity measure functions.
Comparing Data-Parallel and Message-Passing Paradigms
Authors: Alexander C. Klaiber, James L. Frankel
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

The data-parallel programming model provides high-level abstraction.
A 6.1 to 13.3-kb/s variable rate CELP codec (VR-CELP) for AMR speech coding
Authors: S. Heinen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We propose a new 6.1 to 13.3-kb/s speech codec called variable rate code-excited linear prediction (VR-CELP) for adaptive multi-rate (AMR) transmission over mobile radio channels such as GSM or UMTS. The AMR concept allows to operate with almost wireline speech quality for poor channel conditions and better quality for good channel conditions. This is achieved by dynamically splitting the gross bit rate of the transmission system between source and channel coding according to the current channel conditions. Thus the source coding scheme must be designed for seamless switching between rates without annoying artifacts. To enhance the transmission quality under very poor channel conditions, a new powerful error concealment strategy based on estimation theory is applied.
Recovering Spheres from 3D Point Data
Authors: Christoph Witzgall, Geraldine S. Cheok, Anthony J. Kearsley
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

The National Institute of Standards and Technology is involved in developing standard protocols for the performance evaluation of 3D imaging systems, which include laser scanners and LADARs (LAser Detection and Ranging). A LADAR is an optical device that typically yields voluminous 3D "point clouds" by scanning scenes. In many applications, a model of an object which is present in the scene has been specified, and the task amounts to recovering this object from scan data. Specifically, the recovery of spheres from point clouds will be addressed, aiming at estimating the location of their centers and, if not known beforehand, their radii. This information can be used, for instance, to "register" LADAR data to a specified coordinate frame. Two experiments recovering spheres based on best-fitting data points are reported. Sphere fitting based on orthogonal least squares is compared to a novel approach, minimizing instead the squares of range errors incurred in the direction of the scan.
Resolving file conflicts in the Ficus file system
Authors: Peter Reiher, John Heidemann, David Ratner, Greg Skinner, Gerald Popek
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

Ficus is a flexible replication facility with optimistic concurrency control designed to span a wide range of scales and network environments. Optimistic concurrency control provides rapid local access and high availability of files for update in the face of disconnection, at the cost of occasional conflicts that are only discovered when the system is reconnected. Ficus reliably detects all possible conflicts. Many conflicts can be automatically resolved by recognizing the file type and understanding the file's semantics. This paper describes experiences with conflicts and automatic conflict resolution in Ficus. It presents data on the frequency and character of conflicts in our environment. This paper also describes how semantically knowledgeable resolvers are designed and implemented, and discusses our experiences with their strengths and limitations. We conclude from our experience that optimistic concurrency works well in at least one realistic environment, conflicts are rare, and a large proportion of those conflicts that do occur can be automatically solved without human intervention.
Patent Mining - Discover y of Business Value from Patent Repositor ies
Authors: Kas Kasravi, Maria Risov
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Thriving organizations are often driven by innovation and thought leadership. A patent is an instrument for recognizing innovation and protecting the interests of innovators. A substantial amount of patent data is freely and publicly available; the compilation of this patent data forms a basis for patent mining. Effective patent mining requires patent valuation metrics, such as inventive value, improvement value, and market value. Patent mining can discover and extract knowledge from patent repositories. The discovered knowledge can provide early indications of new market trends, recognition of top inventors, identification of ideal patent law firms, and more. The knowledge gained from patent mining can be a basis for supporting critical business decisions.