ppxscal/embedding_network huggingface dataset:
A Survey of Silhouette Detection Techniques for Non-Photorealistic Rendering
Authors: Ao-yu Wang, Min Tang, Jin-xiang Dong
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Silhouettes play a critical role in non-photorealistic rendering. The effect of the NPR greatly depends on the silhouette performance. And it is also a key technology for real-time NPR applications. This paper introduces the most popular and latest techniques in silhouette detection. We classify and analyze them, and discuss them with the problem of visibility determination. After analyze the advantage and disadvantage of them, the working context of them is also concluded.
Detection of Circular Oil Tanks Based on the Fusion of SAR and Optical Images
Authors: Yanqing Wang, Ming Tang, Tieniu Tan, Xianqing Tai
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper aims to detect circular oil tanks automatically by using both SAR and optical images. The proposed method consists of two main steps: first, the bright areas are extracted from the SAR image to obtain the candidate regions for oil tanks; Second, shape detection is performed in the optical image on these corresponding candidate areas, before we finally determine whether they are oil tanks or not. Prior knowledge, such as the validate dimensions of oil tanks and the group emerging property, is taken into account in this method. The experimental results demonstrate the effectiveness of the proposed method.
Fusion of Intensity, Texture, and Color in Video Tracking Based on Mutual Information
Authors: Joseph L. Mundy, Chung-Fu Chang
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Next-generation reconnaissance systems (NGRS) will offer dynamic tasking of a menu of sensor modalities such as video, multi/hyper-spectral and polarization data. A key issue is how best to exploit these modes in timecritical scenarios such as target tracking and event detection. It is essential to be able to represent diverse sensor content in a unified measurement space so that the contribution of each modality can be evaluated in terms of its contribution to the exploitation task. In this paper, mutual information is used to represent the content of individual sensor channels. A series of experiments on video tracking have been carried out to demonstrate the effectiveness of mutual information as a fusion framework. These experiments quantify the relative information content of intensity, color, and polarization image channels.
OSCAR Meta-Package System
Authors: John Mugler, Thomas Naughton, Stephen L. Scott
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The deployment and management of software is an ongoing challenge for cluster systems administrators. The Open Source Cluster Application Resources (OSCAR) toolkit is designed to assist both novice and experienced administrators with cluster administration. The toolkit includes a meta-packaging system to help with cluster software distribution and installation. These meta-packages are called OSCAR Packages. An OSCAR Package may include binary software packages (e.g., RPMS) as well as a stock configuration, tests and documentation. This encapsulation enables OSCAR to better manage cluster software and allows users to select which pieces they would like to use. The modularity of the OSCAR Packages has enabled the project to start new "spin off" projects that leverage the base toolkit and extend the functionality by adding new packages. As OSCAR has matured, new Linux distributions and cluster applications have been introduced. The extensibility of OSCAR via this modular meta-packaging system has been a major asset. However, certain limitations do exist. Since, a large part of the projectýs success is dependent upon contributions by others, the quality of this packaging system is of paramount importance to OSCAR. This paper will provide a brief survey of the current v4.0 OSCAR meta-packaging system and then outline some of the proposed enhancements that are currently on the projectýs road-map.
Towards a Systemic Approach to Autonomic Systems Engineering
Authors: David Bustard, Roy Sterritt, A. Taleb-Bendiab, Andrew Laws, Martin Randles, Frank Keenan
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

An autonomic system is structured as a network of autonomic elements that collaborate to achieve the systemýs purpose. This paper examines the potential benefit of using well-established systems concepts and techniques in the development of such systems. In particular, it considers the possible role of Checklandýs Soft Systems Methodology and Beerýs Viable Systems Model in system design. The paper summarizes the relevant aspects of each approach and then assesses both their individual and joint strengths in support of the construction and evaluation of designs. Some practical issues in the use of these approaches are also identified. The discussion is illustrated using aspects of the design of an autonomic operating system.
Cache organizations for clustered microarchitectures
Authors: José González, Fernando Latorre, Antonio González
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization of the data cache is a key factor in these processors due to its effect on cache miss rate and inter-cluster communications. This paper investigates alternative designs of the data cache: centralized, distributed, replicated and physically distributed cache architectures are analyzed. Results show similar average performance but significant performance variations depending on the application features, specially cache miss ratio and communications. In addition, we also propose a novel instruction steering scheme in order to reduce communications. This scheme conditionally stalls the dispatch of instructions depending on the occupancy of the clusters, whenever the current instruction cannot be steered to the cluster holding most of the inputs. This new steering outperforms traditional schemes. Results show, an average speedup of 5% and up to 15% for some applications.
The development of a physiological simulation system for the human circulatory system coupling macro and micro models
Authors: Ken'ichi Asami, Tadashi Kitamura
Venue: Systems and Computers in Japan (2005)

This paper describes the development of a physiological simulation model which couples macro and micro models of the biological circulatory system. The macro model for the circulatory system is composed of modules for physiological functions such as neural activity, hormonal adjustment, and body temperature control, and provides a mathematical representation of comprehensive knowledge of systemic circulation physiology. The micro model of the circulatory system, on the other hand, uses differential equations to describe hemodynamics with the heart as a pump, and calculates the systemic hemodynamics produced by heart pulsations in millisecond time steps. An electrical circuit model is constructed for the systemic and pulmonary circulatory systems, in which the time-varying elasticity of the ventricular muscle corresponds to a variable capacitor. By connecting the macro and micro models through common variables, a simulation which combines macroscopic and microscopic hemodynamics is produced, making it possible to investigate the response of the pulsatile blood flow as various parameter values of the whole circulation system are varied. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 27&ndash;41, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20135
Oblivious routing in directed graphs with random demands
Authors: MohammadTaghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this work has led to many subsequent improvements and applications. More precisely, Räcke showed that there is an oblivious routing algorithm with polylogarithmic competitive ratio (w.r.t. edge congestion) for any undirected graph. Comparatively little positive results are known about oblivious routing in general directed networks. Using a novel approach, we present the first oblivious routing algorithm which is O(log2 n) competitive with high probability in directed graphs given that the demands are chosen randomly from a known demand-distribution. On the other hand, we show that no oblivious routing algorithm can be o(logn/log log n) competitive even with constant probability in general directed graphs.Our routing algorithms are not oblivious in the traditional definition, but we add the concept of demand-dependence, i.e., the path chosen for an s-t pair may depend on the demand between s and t. This concept that still preserves that routing decisions are only based on local information proves very powerful in our randomized demand model.Finally, we show that our approach for designing competitive oblivious routing algorithms is quite general and has applications in other contexts like stochastic scheduling.
A behavioural pseudometric for probabilistic transition systems
Authors: Franck van Breugel, James Worrell
Venue: Theoretical Computer Science (2005)

Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper, we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Borel probability measures on a metric space. States of a probabilistic transition system have distance 0 if and only if they are probabilistic bisimilar. We also characterize our distance function in terms of a real-valued modal logic.
Guest editor's preface to the special section on discovery and interaction of mobile services
Authors: Qusay H. Mahmoud
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2005)

Mobile services are wireless mobile computing applications and services located on remote servers or peer's devices in a mobile ad hoc setting (MANET). In order to use these services, users of handheld wireless devices must be able to locate them first. One of the fundamental challenges in mobile computing is the discovery of relevant services in dynamically changing environments such as MANETs. Many of the available service discovery protocols were designed for infrastructure-based wired networks and therefore are not suitable for MANETs. The few discovery protocols designed for MANETs do not offer location-based and context-aware service selection, and feature minimal interaction methods.
Sliding window filtering: an efficient method for incremental mining on a time-variant database.
Authors: Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
Venue: Information Systems (2005)

Recently, several important database applications have called for the design of efficient techniques for incremental mining of association rules. In response to this need, we explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transaction database into several partitions, algorithm SWF employs a filtering threshold in each partition to deal with the candidate itemset generation. Under SWF, the cumulative information of mining previous partitions is selectively carried over toward the generation of candidate itemsets for the subsequent partitions. Algorithm SWF not only significantly reduces I/O and CPU cost by the concepts of cumulative filtering and scan reduction techniques but also effectively controls memory utilization by the technique of sliding-window partition. More importantly, algorithm SWF is particularly powerful for efficient incremental mining for an ongoing time-variant transaction database. By utilizing proper scan reduction techniques, only one scan of the incremented dataset is needed by algorithm SWF. The I/O cost of SWF is, in orders of magnitude, smaller than those required by prior methods, thus resolving the performance bottleneck. Extensive experimental studies are performed to evaluate performance of algorithm SWF. Sensitivity analysis of various parameters is conducted to provide many insights into algorithm SWF. It is noted that the improvement achieved by algorithm SWF is even more prominent as the incremented portion of the dataset increases and also as the size of the database increases.
An application of pattern recognition on scoring Chinese corporations financial conditions based on backpropagation neural network
Authors: Liang Liang, Desheng Wu
Venue: Computers and Operations Research (2005)

The paper follows three parts on the whole. The first part reviews the literature on financial diagnosis and the appropriate measures to be currently used. Thus the research gaps in the fields are highlighted. Next part details the variables and samples selection, data, analysis and results applying to scoring financial conditions of a Chinese corporation. By using pattern recognition theory, a scoring model is developed to analyze corporate financial conditions by backpropagation neural networks. It has been proved to be better than ordinary BPNN and traditional multivariate discriminant analysis. Finally, conclusions are presented.
On the Impact of IPsec on Interactive Communications
Authors: Jirka Klaue, Andreas Hess
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

Interactive communication services as telephony and video-conferences use the infrastructure of existing LANs and the Internet more and more. The advantages are obvious. For example phone charges could be reduced significantly. But what about security? And if the communications are protected, can the quality of service be maintained? It is widely assumed that IPsec is inappropriate for the protection of real-time multimedia flows due to its not negligible computational and protocolary overhead. To address this issue we measured the performance of voice and video communications in a LAN including a wireless hop. The data transmissions over the wireless hop alternately occurred via IPsec (tunnel mode and encapsulated security payload ESP) or via plain IP. We evaluated the measurements in terms of network parameters like loss, delay, and jitter and with respect to perceived quality. In this paper we show that IPsec can be used to secure multimedia communications over a wireless link without noticeably degrading the perceived quality.
Perceptual Cues for Orientation in a Two Finger Haptic Grasp Task
Authors: S. McKnight, N. Melder, A. L. Barrow, W. S. Harwin, J. P. Wann
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Single-point interaction haptic devices do not provide the natural grasp and manipulations found in the real world, as afforded by multi-fingered haptics. The present study investigates a two-fingered grasp manipulation involving rotation with and without force feedback. There were three visual cue conditions: monocular, binocular and projective lighting. Performance metrics of time and positional accuracy were assessed. The results indicate that adding haptics to an object manipulation task increases the positional accuracy but slightly increases the overall time taken.
Hypergeometric Functions and Parabolic Partial Differential Equations
Authors: Stéphane Malek
Venue: Journal of Dynamical and Control Systems (2005)

We investigate the summability of formal power series solutions of parabolic linear partial differential equations with exponential coefficients.
Removing shadows
Authors: Martin D. Levine, Jisnu Bhattacharyya
Venue: Pattern Recognition Letters (2005)

Shadows often confound algorithms designed to solve computer vision tasks such as image segmentation, object detection and tracking. In this paper, a shadow detection and removal technique is proposed. The method requires no camera calibration or other a priori information regarding the scene. Support vector machines are used to identify shadow boundaries based on their boundary properties. This boundary information is used to identify shadowed regions in the image and then assign them the color of non-shadow neighbors of the same material.
Absolute Beginner's Guide to eBay (3rd Edition) (Absolute Beginner's Guide)
Authors: Michael Miller
Venue:  (2005)

On any given day there are more than 28 million items listed for auction at eBay, the world's largest online trading community. Almost $34 billion worth of merchandise, in more than 1.4 billion individual auctions, was traded over eBay during the year 2004; that's $93 million a day, or more than $1,000 every second. At the end of 2004, eBay had more than 135 million registered users - more than double the number of users just two years previous.The first two editions of this book were best-sellers, so it's only natural we would update this great book to reflect some of eBay's most recent upgrades such as: eBay Stores, Half.com, and Trading Assistants.
Automated support for process-aware definition and execution of measurement plans
Authors: Luigi Lavazza, Giancarlo Barresi
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Some of the problems with process measurement are generally due to the fact that the definition of measurement plans does not rely on a reference model of the development process that can drive and explain the measuring activities. One of the most popular methodologies addressing the definition of process measurement plans is the GQM (Goal/Question/Metrics). This paper discusses how to support the creation of GQM plans by means of an explicit model of the process being measured. Such a model guides the GQM process, and makes it possible to define precisely -if not formally- the metrics involved. A tool supporting the proposed method is also illustrated.
Overview of the third message understanding evaluation and conference
Authors: Beth M. Sundheim
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The Naval Ocean Systems Center (NOSC) has conducted the third in a series of evaluations of English text analysis systems. These evaluations are intended to advance our understanding of the merits of current text analysis techniques, as applied to the performance of a realistic information extraction task. The latest one is also intended to provide insight into information retrieval technology (document retrieval and categorization) used instead of or in concert with language understanding technology. The inputs to the analysis/extraction process consist of naturally-occurring texts that were obtained in the form of electronic messages. The outputs of the process are a set of templates or semantic frames resembling the contents of a partially formatted database.
Analytical Identification of Limb Structures for Translational Parallel Manipulators
Authors: Yuefa Fang, Lung-Wen Tsai
Venue: Journal of Robotic Systems (2004)

A systematic analytical method, based on the theory of screws, is presented for identification of limb structures of general and over-constrained 3-degree-of-freedom (DOF) translational parallel manipulators. Given a system of wrenches of constraint, the corresponding reciprocal basis screws are determined. Then, the joint screws of a limb are obtained by a linear combination of these basis screws. Feasible limbs that can be used for construction of translational platforms are enumerated according to the type of constraint and the number of joints making up the limbs. &copy; 2004 Wiley Periodicals, Inc.
Component based development methods: comparison
Authors: Dan Laurentiu Jisa
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper realizes a comparison among three of the best known component based development methods, emphazing on the earlier phases of the development process (domain modeling, requirements modeling, analysis) and on the modality used to identify business requirements and to encapsulates them in software components. In the first part of the paper it tries to establish comparison criteria, used in the second part in order to compare the methods.
Radmind: The Integration of Filesystem Integrity Checking with Filesystem Management
Authors: Wesley D. Craig, Patrick M. McNeal
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

We review two surveys of large-scale system management, observing common problems across tools and over many years. We also note that filesystem management tools interfere with filesystem integrity checking tools. Radmind, an integrated filesystem management and integrity checking tool, solves many of these problems. Radmind also provides a useful platform upon which to build further large-scale, automatic system management tools.
Optimal Component Composition for Scalable Stream Processing
Authors: Xiaohui Gu, Philip S. Yu, Klara Nahrstedt
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Stream processing has become increasingly important with emergence of stream applications such as audio/video surveillance, stock price tracing, and sensor data analysis. A challenging problem is to provide optimal component composition in a distributed stream processing environment. The goal of optimal component composition is to achieve load balancing subject to multiple function, resource, and quality-of-service (QoS) constraints while composing stream applications. In this paper, we present an adaptive composition probing (ACP) approach to the problem. Different from previous work, ACP provides a new hybrid approach that combines distributed composition probing with coarse-grain global state management. Guided by the coarse-grain global state information, ACP selectively probes a subset of candidate components to discover an approximately optimal component composition. Further, ACP is self-tuning, which can adaptively adjust the number of probes to maintain a specified composition performance target (i.e., composition success rate) in a dynamic stream environment. While the optimal component composition problem is NP-hard, our ACP approach provides an adaptive polynomial approximation solution. We have conducted extensive simulation experiments to show the efficiency, scalability, and adaptability of the ACP approach by comparing with other alternative solutions.
The uniqueness condition for the double pushout transformation of algebras
Authors: M. Llabrés, F. Rosselló
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

The double pushout approach to the algebraic graph transformation of hypergraphs was invented 30 years ago and it has been generalized since then to more general objects, like for instance relational systems or total and partial unary algebras. We have recently introduced the double pushout transformation of partial and partly total algebras over an arbitrary signature. In this paper we study the uniqueness condition for these rewriting formalisms, which turns out to be given by a suitable generalization to partial algebras of the well known congruence extension property for total algebras.