ppxscal/embedding_network huggingface dataset:
Multimedia knowledge: discovery, classification, browsing, and retrieval
Authors: Ana Belen Benitez Jimenez
Venue:  (2005)

Humans behave and reason by learning and maintaining dynamic models of the world. In addition, there is evidence from psychology that human models contain textual nodes (semantic; word &ldquo;watermelon&rdquo;) and audio-visual nodes (perceptual; quality of being green). This is why in an attempt to make sense of multimedia as humans do, this thesis focuses on representing and discovering semantic and perceptual knowledge about the world using multimedia and knowledge from external resources such as the electronic dictionary WordNet. This thesis also proposes techniques that use the discovered knowledge to advance multimedia classification, browsing, and retrieval applications. In this thesis, we propose a unified framework, MediaNet, that uses multimedia for representing semantic and perceptual knowledge in the form of concepts networks with media examples, which we call &ldquo;medianets&rdquo;. The MediaNet framework extends semantic knowledge frameworks such as thesaurus and ontologies by including perceptual knowledge, and exemplifying concepts and relationships using multimedia. We use the MPEG-7 standard to represent medianets in an interoperable way. This thesis also proposes new techniques for discovering and summarizing medianets from annotated images. Medianets are constructed by clustering images based on visual and textual features; and disambiguating the senses of words in annotations using WordNet and the image clusters. Visual, statistical, and semantic relationships are then discovered between clusters and senses (i.e., concepts). Finally, medianets can be summarized by merging statistically similar concepts. In contrast to prior work, we integrate the processing of images and annotations to improve the concept discovery In addition, our summarization techniques are general, automatic, and applicable to any domain. Image classifiers can be used to annotate images with semantic labels such as &ldquo;person&rdquo;, &ldquo;mountain&rdquo;, and &ldquo;outdoors&rdquo;. A key problem of current image classification systems is the lack of systematic methods for finding relevant classes and their relations. We propose the use of extracted medianets for automatically discovering salient classes and combining several individual detectors for superior accuracy (up to a 15% gain). We train individual detectors to predict the presence of concepts in images, which are combined statistically using a Bayesian network based on the medianets. Image browsers enable users to gain a quick insight into the content of a collection by supporting several exploration tasks (e.g., locating images). Current approaches organize images on large and complex structures, which result in inefficient navigation. (Abstract shortened by UMI.)
Combining two-dimensional and three-dimensional views for visualization of spatial data
Authors: Melanie Tory
Venue:  (2004)

This research compares two-dimensional (2D), three-dimensional (3D), and 2D/3D combination displays (orientation icon, ExoVis, and in-place) for visualization of 3D spatial data. Both 2D and 3D views can be valuable for different reasons. 3D views can provide an overview of a 3D space, illustrate the 3D shape of objects, and support 3D navigation. 2D views can reduce occlusion of specific parts, show undistorted angles and distances, and enable precise positioning and navigation. Combining 2D and 3D views is valuable when benefits of 2D and 3D are both relevant to the task. First, three 2D/3D combination displays were compared in terms of physical integration of views, occlusion, deformation, flexibility, screen space requirements, and viewing angles. Orientation icons (i.e., 2D and 3D views separated into different windows) offered high flexibility, non-oblique viewing, and low occlusion and deformation, but required substantial screen space and had poor integration of 2D and 3D views. In-place displays (i.e., clip and cutting planes) were the opposite. ExoVis displays (i.e., 2D views surrounding a 3D view in the same scene) had better integration than orientation icons, but greater flexibility and less occlusion and deformation than in-place displays. A theory describing when orientation icon, ExoVis, and in-place displays would be useful was then developed, and experiments that compared 2D displays, 3D displays, and 2D/3D combinations for mental registration, relative positioning, orientation, and volume of interest tasks were performed. In-place supported the easiest mental registration of 2D and 3D views, followed by ExoVis, and lastly orientation icon displays. 3D displays were effective for approximate navigation and positioning when appropriate cues (e.g., shadows) were present, but were not effective for precise navigation and positioning except in specific circumstances (e.g., with good viewing angles). For precise tasks, orientation icon and ExoVis displays were better than 2D or 3D displays alone. These displays had as good or better performance, inspired higher confidence, and allowed natural, integrated navigation. In-place displays were not effective for 3D orientation because they forced users to frequently switch back and forth between dimensions. Major factors contributing to display preference and usability were task characteristics, personal strategy, orientation cues, spatial proximity of views that were used together, occlusion, oblique viewing of 2D views, and methods used to interact with the display. Results of this thesis can be used to guide designers to choose the most appropriate display technique for a given task.
Extracting information from multimedia meeting collections
Authors: Daniel Gatica-Perez, Dong Zhang, Samy Bengio
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Multimedia meeting collections, composed of unedited audio and video streams, handwritten notes, slides, and electronic documents that jointly constitute a raw record of complex human interaction processes in the workplace, have attracted interest due to the increasing feasibility of recording them in large quantities, by the opportunities for information access and retrieval applications derived from the automatic extraction of relevant meeting information, and by the challenges that the extraction of semantic information from real human activities entails. In this paper, we present a succint overview of recent approaches in this field, largely influenced by our own experiences. We first review some of the existing and potential needs for users of multimedia meeting information systems. We then summarize recent work on various research areas addressing some of these requirements. In more detail, we describe our work on automatic analysis of human interaction patterns from audio-visual sensors, discussing open issues in this domain.
Measuring and modelling the performance of a parallel ODMG compliant object database server: Research Articles
Authors: Sandra de F. Mendes Sampaio, Norman W. Paton, Jim Smith, Paul Watson
Venue: Concurrency and Computation: Practice Experience (2006)

Object database management systems (ODBMSs) are now established as the database management technology of choice for a range of challenging data intensive applications. Furthermore, the applications associated with object databases typically have stringent performance requirements, and some are associated with very large data sets. An important feature for the performance of object databases is the speed at which relationships can be explored. In queries, this depends on the effectiveness of different join algorithms into which queries that follow relationships can be compiled. This paper presents a performance evaluation of the Polar parallel object database system, focusing in particular on the performance of parallel join algorithms. Polar is a parallel, shared-nothing implementation of the Object Database Management Group (ODMG) standard for object databases. The paper presents an empirical evaluation of queries expressed in the ODMG Query Language (OQL), as well as a cost model for the parallel algebra that is used to evaluate OQL queries. The cost model is validated against the empirical results for a collection of queries using four different join algorithms, one that is value based and three that are pointer based. Copyright &copy; 2005 John Wiley & Sons, Ltd.
MA2TG: A Functional Test Program Generator for Microprocessor Verification
Authors: Tun Li, Dan Zhu, Yang Guo, GongJie Liu, SiKun Li
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

A novel specification driven and constraints solving based method to automatically generate test programs from simple to complex ones for advanced microprocessors is presented in this paper. Our microprocessor architectural automatic test program generator (MA2TG) can produce not only random test programs but also a sequence of instructions for a specific constraint by specifying a user constraints file. The proposed methodology makes three important contributions. First, it simplifies the microprocessor architecture modeling and eases adoption of architecture modification via architecture description language (ADL) specification. Second, it generates test programs for specific constraints utilizing the power of state-to-art constraints solving techniques. Finally, the number of test program for microprocessor verification and the verification time are dramatically reduced. We applied this method on DLX processor to illustrate the usefulness of our approach.
High Available Mobile Infrastructure Applications
Authors: Mohammad Zib Beiroumi
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

High availability is a key requirement in mobile communication systems, especially, when it is used for mission-critical services such as public safety. A failure in the fixed network infrastructure can affect a large number of its users and risk loss of lives. The software applications that run the infrastructure and provide services to the mobile users according to some defined communication protocols play a key role for system availability. However, the real-time peer-to-peer aspects of these protocols pose a real challenge to the development of a recovery method that can work in such environment. In a previous paper, we introduced a new failure recovery approach based on a behavioral model for communication protocols. We extend our model based recovery method to also include infrastructure applications that provide data delivery with QoS. Our experimental results have shown that the method improves the availability of these applications by enabling them to quickly and successfully recover from failures. Moreover, the failure-free overhead caused by this approach is relatively low, and is experimentally found to be less than 5%.
Hierarchical voting classification scheme for improving visual sign language recognition
Authors: Liang-Guo Zhang, Xilin Chen, Chunli Wang, Wen Gao
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

As one of the important research areas of multimodal interaction, sign language recognition (SLR) has attracted increasing interest. In SLR, especially on medium or large vocabulary, it is usually difficult or impractical to collect enough training data. Thus, how to improve the recognition on the limited training samples is a significant issue. In this paper, a simple but effective hierarchical voting classification (HVC) scheme for improving visual SLR, which makes efficient use of limited training data, is proposed. The key idea of HVC scheme is similar to but not the same as Bagging technique. Firstly, it constructs several training sets from the original training set in a combinatorial fashion to generate the corresponding continuous hidden Markov models (CHMM) ensemble. Then, it determines the ensemble output by appropriate local voting strategy. Finally, it obtains the final recognition result by the global voting. Experimental results show that the HVC scheme outperforms the conventional single CHMM approach in terms of recognition accuracy on the limited training data.
Universal access architecture for digital libraries
Authors: Francisco Alvarez-Cavazos, Roberto Garcia-Sanchez, David Garza-Salazar, Juan C. Lavariega, Lorena G. Gomez, Martha Sordia
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

In this paper we present a universal access architecture for digital libraries. Our architecture supports traditional fixed clients and mobile clients addressing the connection adaptation and limited resources challenges presented by mobile devices. We describe the requirements of universally available personal digital libraries and illustrate their applicability with a user scenario. These requirements are addressed by our universal access architecture, which targets to support multiple device access, including mobile devices. The main components of the architecture are the Client-Side Applications, the Data Server and the Mobile Communication Middleware (MCM). Our work has focused on the mobile connection support provided by the interaction of mobile clients with the MCM, obtaining a constant response rate in spite of variability of network conditions. The architecture of a mobile software client that benefits from these mechanisms is described and supplemented with implementation notes showing how-in spite of the limited computing resources of mobile devices-it can interact with a data server that has not been designed to support client mobility via adaptation techniques implemented in a middleware.
Simple Robotic Routing in Ad Hoc Networks
Authors: Daejoong Kim, Nick Maxemchuk
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles that prevent transmission. Then, the recovery algorithm is used to detour the obstacles. To explore the obstacles and find a path around them, the earlier recovery approaches construct a planar graph to avoid routing loops. Distributed algorithms that find planar graphs require accurate knowledge on the location of nodes. The number of nodes on a recovery path increases as the node density increases. Our novel recovery technique operates on a grid model of a network. Obstacles are approximated by adjacent grid elements. We adopt the righthand rule, which is common in robotics, to follow the perimeter of the discretized obstacle. We do not construct a planar graph. The grid structure reduces the positional accuracy required for nodes, and the recovery path length is independent of the node density.
An apples-to-apples comparison of two database journals
Authors: Philip A. Bernstein, Elisa Bertino, Andreas Heuer, Christian S. Jensen, Holger Meyer, M. Tamer Özsu, Richard T. Snodgrass, Kyu-Young Whang
Venue: ACM SIGMOD Record (2005)

This paper defines a collection of metrics on manuscript reviewing and presents historical data for ACM Transactions on Database Systems and The VLDB Journal.
Rapidly Recovering Ethernet Networks for Delivering Broadband Services on the Train
Authors: Filip De Greve, Frederic Van Quickenborne, Filip De Turck, Ingrid Moerman, Piet Demeester
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

With the currently emerging trials for internet solutions on the train, it is a matter of time before best-effort internet on the train becomes a reality. However, designing the aggregation network which transports data from fast moving users to service providers, requires extended research because an aggregation network responsible for the reliable transport of broadband multimedia traffic has not been studied before. We propose a flexible recovery strategy for Ethernet networks with dynamic VLANs. It is shown that fast recovery can be achieved in aggregation networks if standard Ethernet protocols are adjusted to co-operate with the fast and efficient Link Probemechanism. Additionally a cost-effective design method is presented for networks of realistic size which aims at combining requirements of the commuters (such as end-toend delay variations) with reliability constraints.
Interactive simulation program generation
Authors: N. R. Davies
Venue: ACM SIGSIM Simulation Digest (1977)

For many applications, the viability of simulation techniques has been greatly enhanced by the introduction of interactive simulation program generators. Clementson's CAPS/ECSL (1) is now widely available, and Matthewson's DRAFT now generates simulation programs in SIMON (2), GASP (3) or SIMULA (4).
A citation-based system to assist prize awarding
Authors: Antonis Sidiropoulos, Yannis Manolopoulos
Venue: ACM SIGMOD Record (2005)

Citation analysis is performed to evaluate the impact of scientific collections (journals and conferences), publications and scholar authors. In this paper we investigate alternative methods to provide a generalized approach to rank scientific publications. We use the SCEAS system [12] as a base platform to introduce new methods that can be used for ranking scientific publications. Moreover, we tune our approach along the reasoning of the prizes 'VLDB 10 Year Award' and 'SIGMOD Test of Time Award', which have been awarded in the course of the top two database conferences. Our approach can be used to objectively suggest the publications and the respective authors the are more likely to be awarded in the near future at these conferences.
Using Dynamic Tracing Sampling to Measure Long Running Programs
Authors: Jeffrey Odom, Jeffrey K. Hollingsworth, Luiz DeRose, Kattamuri Ekanadham, Simone Sbaraglia
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Detailed cache simulation can be useful to both system developers and application writers to understand an application's performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application's execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors.
Towards a SemanticWeb for Bioinformatics using Ontology-based Annotation
Authors: Patrick Lambrix
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Nowadays, biologists use biological data sources and tools to find relevant information for their research. However, with the explosion of the amount of online accessible data and tools, finding the relevant sources and retrieving the relevant information is not an easy task. Further, often information from different sources needs to be integrated. The vision of a Semantic Web alleviates these difficulties. The Semantic Web is an extension of the current Web in which information is given a well-defined meaning by annotating Web content with ontology terms. In this paper we discuss the Semantic Web vision and focus on an important technology, ontologies, that is needed to make this vision happen.
Stereo Reconstruction Using an Image Noise Model
Authors: Jiang Liu, Patrice Delmas, Georgy Gimel'farb, John Morris
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Conventional stereo correspondence algorithms which search for a 'best' match are defeated by the many sources of noise possible in a pair of stereo images. We propose a new reconstruction paradigm, Concurrent Stereo Matching (CSM), that starts with a noise model and marks regions which could not be considered matches - given the noise model. The work presented here uses spatially varying noise values obtained empirically from segmented images. These noise levels determine admissable matches and definecandidate surfaces, which are then processed using local constraints only to a final set of reconstructed surfaces. For a complex scene with many small surfaces, CSM ranks highly amongst existing benchmarked algorithms. The current CSM implementation does not handle large sloping surfaces well but work is underway to rectify this.
Leonardo&#x2019;s choice: the ethics of artists working with genetic technologies
Authors: Carol Gigliotti
Venue: AI Society (2005)

Working with current methodologies of art, biology, and genetic technologies, the stated aims of artists working in this area include attempts both to critique the implications and outcomes of genetic technologies and to forge a new art practice involved in creating living beings using those technologies. It is this last ambition, the development of a new art practice involved in creating living beings, that this essay will particularly take to task by questioning the ethics of that goal and the uses of biotechnology in reaching it.
Distributed genetic algorithm for subtraction radiography
Authors: Gabriel Mañana, Fabio González, Eduardo Romero
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Digital subtraction is a promising technique used in radiographic studies of periapical lesions and other dental disorders for which the treatment must be evaluated over time. This paper presents a fast and reliable automated image registration method for subtracting two digitized radiographs where an unpredicted mismatch is present. An optimal affine transformation is found using an adaptive Genetic Algorithm (GA) as the optimization strategy and a correlation ratio as the similarity measure. The parallel GA implemented takes advantage of the CPU idle cycles of a computational grid, resulting in an application with a computational time of less than three minutes when processing pairs of standard intra-oral radiographs.
Simon: modeling and analysis of design space structures
Authors: Yuanfang Cai, Kevin J. Sullivan
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The structure of the coupling relation on design decisions is a key factor influencing the evolvability properties and the economic value of a design. The work of Baldwin and Clark is an important step toward a theory of the relationship between structure and value. A key step to enabling rigorous validation and perhaps the eventual use of their ideas for software engineering is formalization of their model. In this paper, we present a brief overview of such a formal model and a prototype software tool, Simon, implementing it. We present Simon's functions for deriving design structure matrices and computing impacts of changes in design decisions, and we sketch an initial experimental evaluation in the form of a replication study of our earlier analysis of Parnas's 1972 paper on information hiding modularity.
On dynamic feature location
Authors: Rainer Koschke, Jochen Quante
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenance task if the connection between features and code has been lost.We have developed a semi-automatic technique for feature location using a combination of static and dynamic program analysis. Formal concept analysis is used to explore the results of the dynamic analysis.We describe new experiences with our technique. Specifically, we investigate the gain of information and increase of costs when the system under analysis is profiled at basic block level rather than routine level as in our earlier work. Furthermore, we explore the influence of the scenarios used for the dynamic analysis (minimal versus combined scenarios).