ppxscal/embedding_network huggingface dataset:
Network-Adaptive Video Communication Using Packet Path Diversity and Rate-Distortion Optimized Reference Picture Selection
Authors: Yi J. Liang, Eric Setton, Bernd Girod
Venue: Journal of VLSI Signal Processing Systems (2005)

In this paper, we present error-resilient Internet video transmission using path diversity and rate-distortion optimized reference picture selection. Under this scheme, the optimal packet dependency is determined adapting to network characteristics and video content, to achieve a better trade-off between coding efficiency and forming independent streams to increase error-resilience. The optimization is achieved within a rate-distortion framework, so that the expected end-to-end distortion is minimized under the given rate constraint. The expected distortion is calculated based on an accurate binary tree modeling with the effects of channel loss and error concealment taken into account. With the aid of active probing, packets are sent across multiple available paths according to a transmission policy which takes advantage of path diversity and seeks to minimize the loss rate. Experiments demonstrate that the proposed scheme provides significant diversity gain, as well as gains over video redundancy coding and the NACK mode of conventional reference picture selection.
Structured Light Based Depth Edge Detection for Object Shape Recovery
Authors: Cheolhwon Kim, Jiyoung Park, Juneho Yi, Matthew Turk
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This research features a novel approach that efficiently detects depth edges in real world scenes. Depth edges play a very important role in many computer vision problems because they represent object contours. We strategically project structured light and exploit distortion of light pattern in the structured light image along depth discontinuities to reliably detect depth edges. Distortion along depth discontinuities may not occur or be large enough to detect depending on the distance from the camera or projector. For practical application of the proposed approach, we have presented methods that guarantee the occurrence of the distortion along depth discontinuities for a continuous range of object location. Experimental results show that the proposed method accurately detect depth edges of human hand and body shapes as well as general objects.
Email Surveillance Using Non-negative Matrix Factorization
Authors: Michael W. Berry, Murray Browne
Venue: Computational Mathematical Organization Theory (2005)

In this study, we apply a non-negative matrix factorization approach for the extraction and detection of concepts or topics from electronic mail messages. For the publicly released Enron electronic mail collection, we encode sparse term-by-message matrices and use a low rank non-negative matrix factorization algorithm to preserve natural data non-negativity and avoid subtractive basis vector and encoding interactions present in techniques such as principal component analysis. Results in topic detection and message clustering are discussed in the context of published Enron business practices and activities, and benchmarks addressing the computational complexity of our approach are provided. The resulting basis vectors and matrix projections of this approach can be used to identify and monitor underlying semantic features (topics) and message clusters in a general or high-level way without the need to read individual electronic mail messages.
Relationship analysis: improving the systems analysis process
Authors: Michael Bieber
Venue:  (2004)

A significant aspect of systems analysis involves discovering and representing entities and their inter-relationships. Guidelines exist to identify entities but do not provide a rigorous and comprehensive process to explicitly capture the relationship structure of the problem domain. Whereas, other analysis techniques lightly address the relationship discovery process. Relationship Analysis is the only systematic, domain-independent analysis technique focusing exclusively on a domain's relationship structure. The quality of design artifacts, such as class diagrams, and development time necessary to generate these artifacts can be improved by first representing the complete relationship structure of the problem domain. The Relationship Analysis Model is the first theory-based taxonomy to classify relationships. A rigorous evaluation was conducted, including a formal experiment comparing novice and experienced analysts with and without Relationship Analysis. It was shown that the Relationship Analysis Process based on the model does provide a fuller and richer systems analysis, resulting in improved quality of and reduced time in generating class diagrams. It also was shown that Relationship Analysis enables analysts of varying experience levels to achieve a similar level of quality of class diagrams. Relationship Analysis significantly enhances the systems analyst's effectiveness, especially in the area of relationship discovery and documentation resulting in improved analysis and design artifacts.
An Architecture for Flexible Web Service QoS Negotiation
Authors: Marco Comuzzi, Barbara Pernici
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The web service selection phase is usually driven only by functional requirements. Non functional requirements, such as quality of service, should be negotiated by the service consumer and the service provider during service invocation in order to produce a contract to manage service provisioning and to monitor the actual fulffilment of negotiated SLAs. In this paper an automated approach to web service QoS negotiation is proposed; the negotiation is performed by a Negotiation Broker to which both the consumer and the service provider can notify their preferences on QoS attributes and negotiation strategies by specifying the value of a relatively small set of parameters. When consumers are unable to specify such parameters or do not trust the service provisioning platform, negotiation can also be automated only on the provider side, allowing the direct interaction of the service consumer with the broker. An architecture to support the above mentioned functionalities is also described.
Access Control Policy Negotiation for Remote Hot-deployed Grid Services
Authors: Wei Xue, Jinpeng Huai, Yunhao Liu
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Service grid is a widely distributed environment, where service deployers and containers may be located in different autonomous domains. In such cases, different from traditional scenarios such as J2EE applications, the access control policy should not be determined by a deployer or a container only. Existing grid application deployment solutions do not address this unique requirement. In this paper, we propose a general approach, namely CROWN.ST, an access control policy negotiation solution for remote hot-deployment of grid services in CROWN (China R&D Environment Over Wide-area Network). Based on an access control policy language derived from non-recursive stratified Datalog with constraints, we design the negotiation procedure and three types of meta-policies. We implement a CROWN.ST prototype and evaluate our design by comprehensive experiments.
My digital photos: where and when?
Authors: Neil O'Hare, Cathal Gurrin, Hyowon Lee, Noel Murphy, Alan F. Smeaton, Gareth J.F. Jones
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In recent years digital cameras have seen an enormous rise in popularity, leading to a huge increase in the quantity of digital photos being taken. This brings with it the challenge of organising these large collections. We preset work which organises personal digital photo collections based on date/time and GPS location, which we believe will become a key organisational methodology over the next few years as consumer digital cameras evolve to incorporate GPS and as cameras in mobile phones spread further. The accompanying video illustrates the results of our research into digital photo management tools which contains a series of screen and user interactions highlighting how a user utilises the tools we are developing to manage a personal archive of digital photos.
Building a Tool for Battle Planning: Challenges, Tradeoffs, and Experimental Findings
Authors: Alexander Kott, Ray Budd, Larry Ground, Lakshmi Rebbapragada, John Langston
Venue: Applied Intelligence (2005)

Use of knowledge-based decision aids can help alleviate the challenges of planning complex operations. We describe a knowledge-based tool capable of translating a high-level concept for a tactical military operation into a fully detailed, actionable plan, producing automatically (or with human guidance) plans with realistic degree of detail and complexity. Tight interleaving of planning, adversary estimates, scheduling, routing, attrition and consumption processes comprise the computational approach of this tool. Although originally developed for Army large-unit operations, the technology is generic and also applies to a number of other domains, particularly in critical situations requiring detailed planning within a constrained period of time. In this paper, we focus particularly on the engineering tradeoffs in the design of the tool. An experimental comparative evaluation indicated that the tool's performance compared favorably with human planners.
A Methodology for Hw/Sw Specification and Simulation at Multiple Levels of Abstraction
Authors: A. Tsikhanovich, E. M. Aboulhamid, G. Bois
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper we propose a new specification and simulation modeling methodology that supports the application of transactional level modeling in the design cycle of Hardware/Software (Hw/Sw) systems allowing the exploration and validation of design alternatives at high levels of abstraction. The proposed methodology offers a possibility to unify functional and non-functional aspects of the system yielding to a holistic approach in specification modeling and simulation. We provide a general approach in system specification that separates three modeling aspects: a computational model, a language used for the functional specification and simulator semantics and implementation. This enables model reusability, design space exploration and specification relatively independent from Hw/Sw description languages.
Peripheral privacy notifications for wireless networks
Authors: Braden Kowitz, Lorrie Cranor
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

When using wireless networks, some chats, web searches, and other information are broadcast out onto the local network. Other users on the same network may intercept and read this information. Unfortunately, without detailed knowledge of underlying technologies, many users are unable to properly evaluate the risks involved in everyday communication tasks. This study aims to develop techniques for allowing users without technical backgrounds to form more accurate expectations of privacy. We have developed a method for notifying users when their computer leaks such information. A large projected display placed in a common workplace shows excerpts from network traffic. A two-week trial was conducted to measure the effects of the display. Data was collected from network traffic monitoring and two paper surveys, which were conducted before and after the trial.
A proposed curriculum of cryptography courses
Authors: Wasim A. Al-Hamdani, Ivory J. Griskell
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

The Cryptography Course is a major part of Computer security, Information security, Network security and all Information security related courses [12, chapter 1]. This course could be offered to undergraduate level (S level) or graduate level students. This article focuses on the problem:If the Cryptography course is offered as two consecutive courses, there is no problem because there are about 30-32 weeks of instruction for the 3-credit course (about 100 hours). This quantity of time is quite ample to cover the major Cryptography subjects (including mathematics, classical algorithms, Block algorithms, Stream cipher Public Key, Crypto hash functions, Authentication and Identification, Key management protocols, Cryptography application: web security, PKI, Email, internet, and all other Cryptography algorithms). However, the problem arises when there is only one course with 3 credit hours per week equaling 45 hours. The course has to be designed for the students' level of studies.This short paper proposes a Cryptography curriculum designed as one course to suit both the undergraduate and graduate level. The curriculum is detailed and distributed over 15 weeks.
Multiple Job Scheduling in a Connection-Limited Data Parallel System
Authors: Alessandro Amoroso, Keith Marzullo
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

We present a hybrid approach to the scheduling of jobs in a distributed system where the critical response is the bandwidth to access stored data. Our approach supports the master-worker scheme, but could be applied to other cases of parallel computation over stored data. We tested our new approach under various circumstances and measured it performance by means of several metrics. We made comparisons of our approach with respect to other scheduling policies; it performed significantly better than the majority of cases, and in worst cases, it was as good as the best of the others.
Computers and the embodied nature of communication: Merleau-Ponty's new ontology of embodiment
Authors: Arun Kumar Tripathi
Venue: Ubiquity (2005)

The world is... the natural setting of, and field for, all my thoughts and all my explicit perceptions. Truth does not "inhabit" only "the inner man," or more accurately, there is no inner man, man is in the world, and only in the world does he know himself. Maurice Merleau-Ponty: Phenomenology of Perception, Preface (1945)For the modern Man it is not so important to feel the Desire (Lust) or Listlessness (Unlust), but to animate themselves; Für den modernen Menschen ist es nicht mehr wichtig, Lust oder Unlust zu empfinden, sondern angeregt zu werden (Friedrich Nietszche, S. 108, Vom Übermenschen zu überreizten Menschen, "Paul Virilio, Die Eroberung des Körpers, Hanser Verlag, 1994)
Predicting good probabilities with supervised learning
Authors: Alexandru Niculescu-Mizil, Rich Caruana
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted trees and boosted stumps push probability mass away from 0 and 1 yielding a characteristic sigmoid shaped distortion in the predicted probabilities. Models such as Naive Bayes, which make unrealistic independence assumptions, push probabilities toward 0 and 1. Other models such as neural nets and bagged trees do not have these biases and predict well calibrated probabilities. We experiment with two ways of correcting the biased probabilities predicted by some learning methods: Platt Scaling and Isotonic Regression. We qualitatively examine what kinds of distortions these calibration methods are suitable for and quantitatively examine how much data they need to be effective. The empirical results show that after calibration boosted trees, random forests, and SVMs predict the best probabilities.
Automated Checking for Windows Host Vulnerabilities
Authors: Matin Tamizi, Matt Weinstein, Michel Cukier
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Evaluation of computing system security requires knowledge of the vulnerabilities present in the system and of potential attacks against the system. Vulnerabilities can be classified based on their location as application vulnerabilities, network vulnerabilities, or host vulnerabilities. This paper describes Ferret-Windows,a new software tool for checking host vulnerabilities on the Windows platforms. This tool helps system administrators by quickly finding vulnerabilities that are present on a host. It is designed and implemented in a modular way: a plug-in module is used for each vulnerability checked, and each possible output format is specified by a plug-in module. Moreover, several vulnerability fixing plug-in modules exist to help users remove specific vulnerabilities. As a result, Ferret-Windowsis extensible, and can easily be kept up-to-date through the addition of checks for new vulnerabilities as they are identified. Finally, Ferret-Windows is a freely available open-source software.
Refining visualization reference model for context information
Authors: Antti Aaltonen, Juha Lehikoinen
Venue: Personal and Ubiquitous Computing (2005)

Context-awareness can be used to decrease the need for interaction with a mobile device. This is increasingly important since the functionality of mobile devices and personal digital assistants gets more and more complex while the input and output capabilities remain restricted. An important aspect of context-awareness is to present the current context to the user. We propose a model for visualizing contextual information on the mobile terminal screen. The model is a refinement of a well-known visualization reference model; it takes into account the specific characteristics of mobile use and context information. We present the design of the model in detail, and discuss its applicability for a variety of contexts and tasks by providing a full-fledged use case.
Supervised clustering with support vector machines
Authors: Thomas Finley, Thorsten Joachims
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn how to cluster future sets of items. Example applications include noun-phrase coreference clustering, and clustering news articles by whether they refer to the same topic. In this paper we present an SVM algorithm that trains a clustering algorithm by adapting the item-pair similarity measure. The algorithm may optimize a variety of different clustering functions to a variety of clustering performance measures. We empirically evaluate the algorithm for noun-phrase and news article clustering.
Blind source separation of positive and partially correlated data
Authors: Wady Naanaa, Jean-Marc Nuzillard
Venue: Signal Processing (2005)

Blind source separation (BSS) consists of processing a set of observed mixed signals to separate them into a set of unobservable original components. Various approaches have been employed to solve BSS problems using the strong assumption focusing on mutually uncorrelated (or orthogonal) source signals. However, in many real-life problems, signal orthogonality is not guaranteed.This paper introduces a new approach to BSS that can be applied to nonorthogonal signals. The orthogonality requirement is replaced by a partial orthogonality and a nonnegativity constraint which are well-suited for many real-world signals. An algebraic property is then exploited to express BSS problems in terms of constrained optimization. An efficient algorithm implementing the approach is reported and applied to examples from nuclear magnetic resonance spectroscopy.
Image Programming for Scientific Visualization by Cluster Computing
Authors: K. Skala, Z. Sojat
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Advancement of computer usage in scientific work must be based on development of the e-Science technologies. More generally e-Science refers to the development of the next generation infrastructure to support computationally based science. This involves the effective utilization of distributed computing, network storage and scientific visualization resources. An enormous number of image processing software has been written for conventional desktop computers. These implement a wide range of operations, such as convolution, histogram equalization and template matching. Rendering and processing complex scientific visualization on desktop computers could ask for processing days. But the same part of job, or process if it is distributed on several nodes could be done much faster. The graphical applications usually have a tremendous potential for parallelism. In this paper distributed digital image programming visualization presented.
Larynx Virtual Surgery
Authors: Arlindo Neto Montagnoli, Everthon Silva Fonseca
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper presents a novel computational method designed to assist phonologists to anticipate the effects produced in the voice, as a result of physical and mechanical alterations of the larynx model, due to a surgery to correct dysphonia. The technique is based on images obtained from endoscopic exams of the larynx. The main objective of the study was to use the active contours method to develop a larynx model based on vocal fold and glottis movements. Starting with the recorded voice signal of subject, we filter the characteristics of the glottal pulse obtained from the image exam, assuming that the dysphonia is caused by irregularities of the larynx. The modifications made in the glottis model are used to estimate a new glottal filter, which is then added to the filtered signal. Using this method, one can obtain a new voice that maintains the individual's personal characteristics after virtual surgery modifications.
Evaluation of video summarization for a large number of cameras in ubiquitous home
Authors: Gamhewage C. de Silva, Toshihiko Yamasaki, Kiyoharu Aizawa
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

A system for video summarization in a ubiquitous environment is presented. Data from pressure-based floor sensors are clustered to segment footsteps of different persons. Video handover has been implemented to retrieve a continuous video showing a person moving in the environment. Several methods for extracting key frames from the resulting video sequences have been implemented, and evaluated by experiments. It was found that most of the key frames the human subjects desire to see could be retrieved using an adaptive algorithm based on camera changes and the number of footsteps within the view of the same camera. The system consists of a graphical user interface that can be used to retrieve video summaries interactively using simple queries.
Word Separation of Unconstrained Handwritten Text Lines in PCR Forms
Authors: Ifeoma Nwogu, Gyeonghwan Kim
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

An approach for segmenting handwritten text in a Pre-Hospital Care Report (PCR) is presented. Segmentation of lines and words in a PCR is extremely challenging due to the nature of the environment in which the reports are created, giving rise to low quality, poorly written, loosely constrained data. Stroke analyses are performed and image primitives are extracted for word detection. A heuristics-based approach, involving gap spacing, height transitions, and the average stroke width of the writer is used in detecting word boundaries. Carbon copies of live PCRs are used for testing. Experiments show perfect segmentation of 69%, outperforming the more tested and proven algorithms by as much as 15%.