ppxscal/embedding_network huggingface dataset:
Exception Handling in an Event-Driven System
Authors: Jan Ploski, Wilhelm Hasselbring
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Exception handling mechanisms were invented in 1970s to support structured programming methods for hierarchically organised software systems. The need to increase reusability and flexibility led to the development of new programming paradigms that do not emphasise hierarchical design. Event-driven systems in which objects communicate using notifications about changed states are a prime example. Unfortunately, this style of communication makes exception handling more difficult than in hierarchical systems. We contribute an analysis of the factors which influence exception handling in event-driven systems. The main focus of our discussion lies on the challenge of appropriate exception propagation. We provide results from an empirical case study performed on the source code of the Eclipse IDE that support our analysis.
Best basis segmentation of ECG signals using novel optimality criteria
Authors: D. H. Brooks
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Automatic segmentation of the electrocardiogram (ECG) is important in both clinical and research settings. Past algorithms have relied on incorporation of detailed heuristics. We avoid heuristics by employing a best-basis algorithm. As large variability of the local SNR causes the standard entropy criterion to produce an overly-fine segmentation, we introduce a novel optimality criterion which is based on a linear combination of the entropy measure and a function of a smoothness measure, and is quite general in form. We tested the algorithm on the MIT-BIH arrythmia database and body surface potential maps.
A Built-In Self-Repair Scheme for Multiport RAMs
Authors: Tsu-Wei Tseng, Chun-Hsien Wu, Yu-Jen Huang, Jin-Fu Li, Alex Pao, Kevin Chiu, Eliot Chen
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Built-in self-repair (BISR) techniques have been widely used for enhancing the yield of embedded memories. This paper presents an efficient BISR scheme for multiport RAMs (MPRAMs). The BISR scheme has a defect-location module (DLM) executing a defect-location algorithm to locate inter-port defects. This enhances the fault-location capability of the applied test algorithm with only a few amount of cost of testing time. A built-in redundancy analyzer (BIRA) executing a proposed redundancy analysis algorithm is also proposed to allocate two-dimension redundancy of MPRAMs. Experimental results show that if a faulty MPRAM has 20% inter-port faults, the DLM can boost the increment of repair rate from 8.4% to 14.4% for different redundancy configurations. The area cost of the BIRA and DLM is small, it is only about 1% for a 4096×128-bit MPRAM with 1 spare row and 1 spare IO.
A Graph-Theoretic Method for Mining Functional Modules in Large Sparse Protein Interaction Networks
Authors: Shihua Zhang, Hong-Wei Liu, Xue-Mei Ning, Xiang-Sun Zhang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

With ever increasing amount of available data on protein-protein interaction (PPI) networks, understanding the topology of the networks and then biochemical processes in cells has become a key problem. Modular architecture which encompasses groups of genes/proteins involved in elementary biological functional units is a basic form of the organization of interacting proteins. Here we propose a method that combines the line graph transformation and clique percolation clustering algorithm to detect network modules which may overlap each other in large sparse protein-protein interaction (PPI) networks. The resulting modules by the present method show a high coverage among yeast, fly, and worm PPI networks respectively. Our analysis of the yeast PPI network suggests that most of these modules have well biological significance in context of protein localization, function annotation, and protein complexes.
High performance VMM-bypass I/O in virtual machines
Authors: Jiuxing Liu, Wei Huang, Bulent Abali, Dhabaleswar K. Panda
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Currently, I/O device virtualization models in virtual machine (VM) environments require involvement of a virtual machine monitor (VMM) and/or a privileged VM for each I/O operation, which may turn out to be a performance bottleneck for systems with high I/O demands, especially those equipped with modern high speed interconnects such as InfiniBand. In this paper, we propose a new device virtualization model called VMM-bypass I/O, which extends the idea of OS-bypass originated from user-level communication. Essentially, VMM-bypass allows time-critical I/O operations to be carried out directly in guest VMs without involvement of the VMM and/or a privileged VM. By exploiting the intelligence found in modern high speed network interfaces, VMM-bypass can significantly improve I/O and communication performance for VMs without sacrificing safety or isolation. To demonstrate the idea of VMM-bypass, we have developed a prototype called Xen-IB, which offers InfiniBand virtualization support in the Xen 3.0 VM environment. Xen-IB runs with current InfiniBand hardware and does not require modifications to existing user-level applications or kernel-level drivers that use InfiniBand. Our performance measurements show that Xen-IB is able to achieve nearly the same raw performance as the original InfiniBand driver running in a non-virtualized environment.
Mean shift-based clustering
Authors: Kuo-Lung Wu, Miin-Shen Yang
Venue: Pattern Recognition (2007)

In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, Cauchy and generalized Epanechnikov kernels with their shadows. The robust properties of the mean shift based on these three kernels are then investigated. According to the mountain function concepts, we propose a graphical method of correlation comparisons as an estimation of defined stabilization parameters. The proposed method can solve these bandwidth selection problems from a different point of view. Some numerical examples and comparisons demonstrate the superiority of the proposed method including those of computational complexity, cluster validity and improvements of mean shift in large continuous, discrete data sets. We finally apply the mean shift-based clustering algorithm to image segmentation.
Efficient distributed subtyping tests
Authors: Sébastien Baehni, João Barreto, Patrick Eugster, Rachid Guerraoui
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Subtyping tests are essential in typed publish/subscribe infrastructures, especially when the underlying programming language supports subtype conformance, as in Java or C#. These tests are particularly challenging when the publish/-subscribe infrastructure is distributed, because processes have diverging views and new types may be added in a decentralized manner. Maybe surprisingly, subtyping tests for such distributed systems have been devoted only little attention so far; they are usually strongly intertwined with serialization and code transfer mechanisms. This paper presents an efficient subtype testing method for event objects received through the wire, requiring neither the download of a full description of the types or classes of these objects nor their deserialization. We use a slicing technique that encodes a multiple subtyping hierarchy with as little memory as the best known centralized type encoding, but allows for the dynamic addition of event types without re-computing the encoding. We convey the practicality of our approach through performance measures obtained with standard Java libraries in a publish/subscribe system. Our approach performs between 3 and 12 times faster than a code transfer approach without adding overhead to object deserialization, and requires the same testing time as a straightforward string-based type encoding while reducing the encoding length by a factor of 50.
Evaluating Resource Discovery Protocols for Hierarchical and Super-Peer Grid Information Systems
Authors: Carlo Mastroianni, Domenico Talia, Oreste Verta
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Most currently deployed Grids adopt a hierarchical model for their information system. However, nowadays the research and development community is heading towards the use of scalable models of information services based on decentralized approaches such as the peer-to-peer paradigm. This is mainly due to the poor scalability, resiliency and loadbalancing features of the hierarchical model. This paper evaluates a resource discovery protocol exploitable in a hierarchical Grid and compares it with a super-peer based model which has recently been introduced. Performance analysis, carried out through simulation, shows that the hierarchical model is valuable for small and medium sized Grids, while the super-peer model is better suited for very large Grids.
Explaining Dynamic Cache Partitioning Speed Ups
Authors: Miquel Moreto Planas, Francisco Cazorla, Alex Ramirez, Mateo Valero
Venue: IEEE Computer Architecture Letters (2007)

Cache Partitioning has been proposed as an interesting alternative to traditional eviction policies of shared cache levels in modern CMP architectures: throughput is improved at the expense of a reasonable cost. However, these new policies present different behaviors depending on the applications that are running in the architecture. In this paper, we introduce some metrics that characterize applications and allow us to give a clear and simple model to explain final throughput speed ups.
Shape and appearance information integration in medical image analysis and computer vision
Authors: Dimitris N. Metaxas
Venue:  (2006)

In many fundamental problems in medical image analysis and computer vision, object shape and appearance are two important sources of information that when integrated, provide more reliable image interpretation. In this thesis, I propose a new perspective on how to represent the shape, appearance, and deformations of an object of interest in images. Under this new perspective, I develop novel and efficient algorithms that coherently integrate shape and appearance information to augment traditional shape-only deformable models for robust segmentation, to better perform shape alignment and registration in arbitrary dimension, to register images of single or multiple modalities in a joint shape and appearance feature space, and to build a new framework for learning statistical shape and appearance models that requires significantly less human effort than the well-known Active Shape and Appearance Models. I also present several applications of this research on topics including heart wall motion analysis in tagged MRI images, and tracking/learning/transfer of 3-D facial expressions.
A new kalman-filter based framework for fast and accurate visual tracking of rigid objects
Authors: Avinash C. Kak
Venue:  (2006)

The best of Kalman-filter based frameworks reported in the literature for rigid object tracking work well only if the object motions are smooth (which allows for tight uncertainty bounds to be used for where to look for the object features to be tracked). In this thesis, we present a new Kalman-filter based framework that carries out fast and accurate rigid object tracking even when the object motions are large and jerky. The new framework has several novel features, the most significant of which is as follows: The traditional backtracking consists of undoing one-at-a-time the model-to-scene matchings as the pose-acceptance criterion is violated. In our new framework, once a violation of the pose-acceptance criterion is detected, we seek the best largest subset of the candidate scene features that fulfill the criterion, and then continue the search until all the model features have been paired up with their scene correspondents (while, of course, allowing for nil-mapping for some of the model features). With the new backtracking framework, our Kalman filter is able to update on a real-time basis the pose of a typical industrial 3D object moving at the rate of approximately 5 cms per second (typical for automobile assembly lines) using an off-the-shelf PC hardware. Pose updating occurs at the rate of 7 frames per second and is immune to large jerks introduced manually as the object is in motion. The objects are tracked with an average translational accuracy of 4.8 mm and the average rotational accuracy of 0.27&deg;.
A High-Performance Event Service for HPC Applications
Authors: Ian Gorton, Daniel Chavarria-Miranda, Manojkumar Krishnan, Jarek Nieplocha
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Event services based on publish-subscribe architectures are well established components of distributed computing applications. Recently, an event service has been proposed as part of the Common Component Architecture (CCA) for high-performance computing applications. In this paper we describe our experiences investigating implementation options for the CCA event service that exploit interprocess communications mechanisms commonly used on HPC platforms. The aim of our work is to create an event service that supports the well-known software engineering advantages of publish-subscribe architectures, and provides performance levels approaching those achievable using more primitive message-passing mechanisms such as MPI.
Efficient Hidden Semi-Markov Model Inference for Structured Video Sequences
Authors: D. Tweed, R. Fisher, J. Bins, T. List
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

The semantic interpretation of video sequences by computer is often formulated as probabilistically relating lower-level features to higher-level states, constrained by a transition graph. Using Hidden Markov Models inference is efficient but time-in-state data cannot be included, whereas using Hidden Semi-Markov Models we can model duration but have inefficient inference. We present a new efficient 0(T) algorithm for inference in certain HSMMs and show experimental results on video sequence interpretation in television footage to demonstrate that explicitly modelling time-in-state improves interpretation performance.
A Behavioral Adaptation Approach to Identifying Visual Dependence of Haptic Perception
Authors: James Sulzer, Arsalan Salamat, Vikram Chib, J. Edward Colgate
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Both haptic and visual senses play a role in how we explore our environment. Previous studies have shown that vision plays a very strong role in perception of object stiffness, yet quantification of the contributions of both haptic and visual feedback remains elusive. This study uses a behavioral adaptation approach in order to better understand how humans perceive stiffness. Namely, subjects make targeted reaches across a virtual surface of varying stiffness, adapting to the new environment. The hand's cursor position is visually distorted to seem more stiff for one group, less stiff for another, and no distortion for the control group. Area Reaching Deviation (ARD) and post-adaptation interface forces, used in previous studies, were the two outcome measures used to determine differences between groups. We compare the slopes of the postadaptation force-stiffness relations to quantify the effect of visual distortion. Our results indicate that making a stiff surface look more compliant has a greater effect on humans than making a compliant surface look more stiff.
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
Authors: V. Jeyakumar, A. M. Rubinov, Z. Y. Wu
Venue: Mathematical Programming: Series A and B (2007)

In this paper, we first examine how global optimality of non-convex constrained optimization problems is related to Lagrange multiplier conditions. We then establish Lagrange multiplier conditions for global optimality of general quadratic minimization problems with quadratic constraints. We also obtain necessary global optimality conditions, which are different from the Lagrange multiplier conditions for special classes of quadratic optimization problems. These classes include weighted least squares with ellipsoidal constraints, and quadratic minimization with binary constraints. We discuss examples which demonstrate that our optimality conditions can effectively be used for identifying global minimizers of certain multi-extremal non-convex quadratic optimization problems.
Requirements Validation: Execution of UML Models with CPN Tools
Authors: Ricardo J. Machado, Kristian Bisgaard Lassen, S&#x00e9;rgio Oliveira, Marco Couto, Patr&#x00ed;cia Pinto
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2007)

Requirements validation is a critical task in any engineering project. The confrontation of stakeholders with static requirements models is not enough, since stakeholders with non-computer science education are not able to discover all the inter-dependencies between the elicited requirements. Even with simple unified modelling language (UML) requirements models, it is not easy for the development team to get confidence on the stakeholders&#x2019; requirements validation. This paper describes an approach, based on the construction of executable interactive prototypes, to support the validation of workflow requirements, where the system to be built must explicitly support the interaction between people within a pervasive cooperative workflow execution. A case study from a real project is used to illustrate the proposed approach.
Real-time Interactive Visualization of Information Hierarchies
Authors: Adrian Rusu, Confesor Santiago, Radu Jianu
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

An information hierarchy is a collection of relational information that is arranged in a ranking organization where each entity is subject to a single other entity, except for the top (root) element. The usefulness of a visualization of an information hierarchy depends on its capability of conveying the information quickly and clearly. The interaction with the information hierarchy allows a user to further analyze its underlying structures and relationships, which is essential for the effectiveness of the visualization. In this paper we present a novel method to interactively visualize information hierarchies in real-time. We use theWorldWide Web as an application example of our techniques. The result is a novel Web browsing and visualization method with an innovative combination of features: (i) Web data is retrieved and displayed in real-time (i.e. Web data is not prerecorded), (ii) browsing and visualization are synchronized together in the same interface, (iii) tree-based visualization engine, and (iv) space-efficient display of visualization. Our study shows that users are able to orient themselves better in cyberspace and locate Web pages of interest faster.
Approaches for semantic interoperability between domain ontologies
Authors: B. Orgun, M. Dras, A. Nayak, G. James
Venue: Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72 (2006)

Domain ontologies and knowledge-based systems have become very important in the agent and semantic web communities. As their use has increased, providing means of resolving semantic differences has also become very important. In this paper we survey the approaches that have been proposed for providing interoperability among domain ontologies. We also discuss some key issues that still need to be addressed if we were to move from semi to fully automated approaches to provide consensus among heterogeneous ontologies.
Retrieval in text collections with historic spelling using linguistic and spelling variants
Authors: Andrea Ernst-Gerlach, Norbert Fuhr
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We present a new approach for the retrieval of texts with non-standard spelling, which is important for historic texts e.g. in English or German. In this paper, we describe the overall architecture of our system, followed by its evaluation. Given a search term as lemma, we use a dictionary of contemporary German for finding all inflected and derived forms of the lemma. Then we apply transformation rules (derived from training data) for generating historic spelling variants. For the evaluation, we regard the resulting retrieval quality. The experimental results show that we can improve the retrieval quality for historic collections substantially.
DUKE--Distributed Usage Control Enforcement
Authors: Manuel Hilty, Alexander Pretschner, Christian Schaefer, Thomas Walter
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Usage control is concerned with what happens to data once the data have been released to a data consumer who is, in principle, able to use the data in any imaginable way. Considerations relating to privacy, intellectual property, and public security, however, suggest that data providers are often interested in imposing a certain amount of control on the data that they release. In the DUKE project, we address the problem how the usage of data can be controlled once the data have been given away.
Comparison of TCM and BICM in wireless LAN system over indoor wireless channel
Authors: Yuan Li, Sumei Sun
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The performance of trellis coded modulation (TCM) and bit-interleaved coded modulation (BICM) is compared in wireless LAN systems applying the orthogonal frequency division multiplexing (OFDM). The indoor wireless channel environment is considered, where the channel fades vary very slowly and they are still highly correlated even if the interleavers are applied. The TCM design rules for the additive white Gaussian noise channel (AWGN) and the Rayleigh fading channel are studied, and they are compared with two BICM schemes with the same bandwidth efficiency. It is found that over the very slow flat fading channels, TCM designed for the AWGN channel outperforms TCM designed for the fading channel, and both outperform BICM. Over the very slow multipath fading channels, TCM for the fading channel outperforms TCM for the AWGN channel, and both outperform BICM with the same code rate and signal set. However, BICM with expanded signal set and low-rate code performs better than both TCM schemes.