ppxscal/embedding_network huggingface dataset:
A probabilistic decision-based neural network for locating deformable objects and its applications to surveillance system and video browsing
Authors: Shang-Hung Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Detection of a (deformable) pattern or object is an important machine learning and computer vision problem. The task involves finding specific (but locally deformable) patterns in images, such as human faces and eyes/mouths. There are many important commercial applications. This paper presents a decision-based neural network for finding such patterns with specific applications to detecting human faces and locating eyes in the faces. The system built upon the proposal has been demonstrated to be applicable under reasonable variations of orientation and/or lighting, and with the possibility of eye glasses. This method has been shown to be very robust against a large variation of face features and eye shapes. The algorithm takes only 200 ms on a SUN Sparc20 workstation to find human faces in an image with 320/spl times/240 pixels. For a facial image with 320/spl times/240 pixels, the algorithm takes 500 ms to locate two eyes on a SUN Sparc20 workstation. Furthermore, the algorithm can be easily implemented via specialised hardware for real time performance. We have applied this technique to two applications (surveillance system, video browsing) and this paper provides experimental results. Although we have only shown its successful implementation on face detection and eye localization, the proposed technique is meant for more general applications of detection of any (locally deformable) object.
Online learning of region confidences for object tracking
Authors: Datong Chen, Jie Yang
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This paper presents an online learning method for object tracking. Motivated by the attention shifting among local regions of a human vision system during tracking, we propose to allow different regions of an object to have different confidences. The confidence of each region is learned online to reflect the discriminative power of the region in feature space and the probability of occlusion. The distribution of region confidences is employed to guide a tracking algorithm to find correspondences in adjacent frames of video images. Only high confidence regions are tracked instead of the entire object. We demonstrate feasibility of the proposed method in video surveillance applications. The method can be combined with many other existing tracking systems to enhance robustness of these systems.
Fault-tolerance using shared path protection in wavelength division multiplexing optical transport networks
Authors: Byrav Ramamurthy
Venue:  (2006)

Wavelength division multiplexing (WDM) fiber optical networks in the future are intended to provide bandwidths in the range of 500-2000 Gbps with the number of wavelengths multiplexed onto a single fiber ranging from 100-200. The enormous bandwidth capacity of WDM networks have made fault-tolerance/survivability in these networks extremely important. The goal of fault-tolerant design of a network is to build a network that is resilient to failures such as link, node, fiber conduit, etc., that occur in a network. In this dissertation, we focus on three main issues, survivable virtual topology design, fault-tolerant routing in optical networks and static survivable network design. The objective of the survivable virtual topology design problem is to route a given virtual topology on the physical topology such that when single point failures occur in the physical network, the virtual topology is still connected. We propose a scalable solution to the survivable virtual topology problem. In our experiments we successfully computed survivable routing of 45-edge virtual topologies on physical topologies of sizes up to 24 nodes within 2 min. To provide fault-tolerance to a connection, one needs to compute a link/node diverse path pair between the source and destination nodes of the connection. Such a routing is called fault-tolerant routing. The path used for routing the traffic is called the working path and the other diverse path is called the backup path. To enable resource sharing among the backup paths of multiple fault-tolerant connections, we introduce and formalize the concept of dependent cost structure (DCS) of a backup path on its working path and current network status. We present an iterative heuristic to compute diverse path pairs and our simulations show that our heuristic greatly increases the resource sharing ability of backup paths and thus reduces blocked calls and resource consumption. The goal of the static survivable network design problem is to provision the given set of traffic demands in a network such as an optical WDM network or a high-speed capacitated network. We present approximation algorithms for three versions of survivable network design problems. To the best of our knowledge this is the first work that presents approximation algorithms to survivable network design problems.
Behavior recognition via sparse spatio-temporal features
Authors: P. Dollar, V. Rabaud, G. Cottrell, S. Belongie
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

A common trend in object recognition is to detect and leverage the use of sparse, informative feature points. The use of such features makes the problem more manageable while providing increased robustness to noise and pose variation. In this work we develop an extension of these ideas to the spatio-temporal case. For this purpose, we show that the direct 3D counterparts to commonly used 2D interest point detectors are inadequate, and we propose an alternative. Anchoring off of these interest points, we devise a recognition algorithm based on spatio-temporally windowed data. We present recognition results on a variety of datasets including both human and rodent behavior.
Application of QVT for the Development of Secure Data Warehouses: A case study
Authors: Emilio Soler, Juan Trujillo, Eduardo Fernandez-Medina, Mario Piattini
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Security is a crucial aspect for the development of Data Warehouses (DW) because they contain sensitive information. The application of the Model Driven Architecture (MDA) in the secure modeling of DWs allows obtaining the secure logical scheme from the conceptual model. In this paper, we apply the Query/View/Transformations (QVT) language to the development of a secure DW by means of a case study. First, we introduce the case study related to a typical sanitary system. Afterwards, with the application of a set of QVT relations, we transform all the captured security and audit requirements from the multidimensional conceptual model of the DW, to the logical level, by means of the construction of a snowflake model. From this scheme it turns out easier to obtain code for a specific platform that implements security and audit aspects.
A Classifier to Evaluate Language Specificity of Medical Documents
Authors: Trudi Miller, Gondy Leroy, Samir Chatterjee, Jie Fan, Brian Thoms
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Consumer health information written by health care professionals is often inaccessible to the consumers it is written for. Traditional readability formulas examine syntactic features like sentence length and number of syllables, ignoring the target audience's grasp of the words themselves. The use of specialized vocabulary disrupts the understanding of patients with low reading skills, causing a decrease in comprehension. A naïve Bayes classifier for three levels of increasing medical terminology specificity (consumer/patient, novice health learner, medical professional) was created with a lexicon generated from a representative medical corpus. Ninety-six percent accuracy in classification was attained. The classifier was then applied to existing consumer health web pages. We found that only 4% of pages were classified at a layperson level, regardless of the Flesch reading ease scores, while the remaining pages were at the level of medical professionals. This indicates that consumer health web pages are not using appropriate language for their target audience.
Dagger: a tool to generate program graphs
Authors: Yih-Farn Chen
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

Dagger is a tool that generates program graphs to selectively visualize a software structure. The design of dagger achieves a strong degree of language independence by exploiting the duality between a class of entity-relationship databases and attributed directed graphs. This paper describes the C and C++ versions of dagger, which map a selected subset of relationships stored in a program database to a graph specification, decorate the graph with display attributes, and then pass it to layout tools or interactive graph browsers. Dagger takes output from database queries to generate a large variety of interesting program graphs, including header file hierarchy, module binding, and type inheritance graphs. This paper describes the graph generation process surrounding dagger and a sample of tools involved in the process. In particular, we describe how a closure operator works in tandem with dagger to control graph complexity by generating reachability graphs where sub-structures are selectively ignored or expanded. Our experience in applying dagger to several software projects has demonstrated its capability in abstracting and visualizing complex software structures without much overhead. All program graphs presented in this paper are tagged with timing statistics.
Identification of process/design issues during 0.18 µm technology qualification for space application
Authors: Julie Ferrigno, Philippe Perdu, Kevin Sanchez, Dean Lewis
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Optical techniques (light emission and laser stimulation techniques) are routinely used to evaluate defects on specific component for space applications. Just one anomaly on one component could have catastrophic consequences on satellites. We must analyse any kind of fault of the device whatever the origin of thus fault is. It can be design, design-process, process or end user related... At the early stage of an analysis, choosing the right technique is an increasingly complex task. In some cases, one technique may bring value but not the others. Using a 180nm test structure device, we will present results showing the complementarity of Emission Microscopy (EMMI), Time-Resolved Emission (TRE) and Dynamic Laser Stimulation (DLS) in order to help debug engineers to choose the right approach. This complementarity gives us ability to strengthen hypothesises before any kind of physical analysis.
A Study on Developing CRM Scorecard
Authors: Hyung-Su Kim, Young-Gul Kim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As more firms embrace CRM as a core business strategy, it is getting more important to assess firms' CRM readiness and performance for diagnosing, guiding, managing, and evaluating their current CRM practices. Previous CRM studies have been limited to extracting a few success factors or focus only on specific implementation methodologies without any theoretical underpinning. In this paper, we suggest a performance measurement framework called CRM scorecard as an integrative organizational artifact to diagnose and assess a firm's CRM practice. The CRM scorecard was developed through comprehensive literature review and in-depth interviews with CRM practitioners, with specific objective and subjective instruments added to measure corporate CRM capability and readiness. Additionally, we conducted an Analytic Hierarchy Process (AHP) analysis to prioritize the evaluation factors in the CRM scorecard. To illustrate the applicability of the proposed CRM scorecard, we apply the artifact to a consumer bank, which is well known for an exemplary CRM strategy in Korea.
Redefining and Measuring Virtual Work in Teams: An Application of Social Network Analysis
Authors: Priscilla Arling
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

For several decades organizational researchers have explored the practice of using electronic technology to communicate when team members work physically apart from each other. Yet despite a growing body of research in the areas of telework and virtual teams, findings regarding the antecedents and outcomes of virtual work have often been inconsistent and many questions remain [1, 2]. One possible reason for the equivocality of findings regarding this practice is the lack of a common definition and method of measuring virtual work. The purpose of this paper is to present a definition and measure of virtual work that can capture the practice in a variety of settings. I integrate work from studies on telework and virtual teams to present a new definition of virtual work. I propose using social network analysis as a tool to measure virtual work scope, an individual's level of virtual work practice in teams.
Effects of Longitudinal Skin Stretch on the Perception of Friction
Authors: Nicholas D. Sylvester, William R. Provancher
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This work focuses on the relative importance of skin stretch imposed on the fingerpad on the perception of friction. Perceptual data is presented from two separate tests. The first experiment was designed to determine the perceptual thresholds for friction based on a Karnopp friction model. In this experiment friction was rendered as purely a kinesthetic resistance via a PHANToM force feedback device. The second experiment was designed to evaluate possible changes in perceived friction magnitudes due to imposing small amounts of tangential skin stretch (0.25 - 0.75 mm) to the fingerpad in combination with force feedback (kinesthetic resistance). Results of this experiment show that even these small amounts of skin stretch increase the perceived friction. These results suggest that the addition of a simple shear plate tactile display to current haptic devices could significantly enhance the range of rendered friction since most current haptic force feedback devices have limited force capabilities.
A novel hexagon-based search algorithm for fast block motion estimation
Authors: Ce Zhu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

In block motion estimation, search patterns with different shape or size have a very important impact on search speed and distortion performance. In this paper, we propose a novel algorithm using a hexagon-based search (HEXBS) pattern for fast block motion estimation. The proposed HEXBS algorithm may find any motion vector with fewer search points than the diamond search (DS) algorithm. The speedup gain of the HEXBS method over the DS algorithm is more striking for finding large motion vectors. Experimental results substantially justify the fastest performance of the HEXBS algorithm compared with several other popular fast algorithms.
Completeness of Hutton [0,1]-quasi-uniform spaces
Authors: J. Gutiérrez García, M. A. de Prada Vicente, S. Romaguera
Venue: Fuzzy Sets and Systems (2007)

This paper deals with completeness of Hutton [0,1]-quasi-uniform spaces. Recently, the first two authors, [J. Gutierrez Garcia, M.A. de Prada Vicente, Hutton [0,1]-quasi-uniformities induced by fuzzy (quasi-)metric spaces, Fuzzy Sets and Systems 157 (2006), 755-766], have constructed a Hutton [0,1]-quasi-uniformity induced by a fuzzy metric space (in the sense of George and Veeramani). In this paper, we define completeness of Hutton [0,1]-quasi-uniform spaces as convergence of any stratified tight Cauchy [0,1]-filter. Our main result states the equivalence between completeness of any fuzzy metric space (X,M,*) and completeness of the induced Hutton [0,1]-quasi-uniformity U"M. Also it is proved that the Hutton [0,1]-quasi-uniform space (X,U"M) has, in this context, a kind of completion that is unique up to uniform isomorphism. The obtained results come from an appropriate definition of Cauchy L-filter (where L stands for a complete lattice, with additional properties).
Dynamic Channel Assignment with Flexible Reuse Partitioning in Cellular Systems
Authors: Steven Li Chen, Peter H. Chong, Ming Yang
Venue: Wireless Personal Communications: An International Journal (2007)

In cellular communications, one of the main research issues is how to achieve optimum system capacity with limited frequency spectrum. For many years, researchers have proposed and studied many dynamic channel assignment (DCA) schemes to increase the capacity of cellular systems. Another proposed technique, Reuse Partitioning (RP), is used to achieve higher capacity by reducing the overall reuse distance. In convention, when RP is exploited in network-based DCA, a portion of channels will be assigned permanently to each partitioned region. However, the number of channels assigned to each region may not be~optimum due to factors like the uneven and time-varying traffics. In this paper, a new network-based DCA scheme is proposed with the flexible use of RP technique, named as flexible dynamic reuse partitioning with interference information (FDRP-WI). In this scheme, channels are open to all incoming calls and no channel pre-allocation for each region is required. As long as the channel assignment satisfies the co-channel interference constraints, any user from any region can use any channel. The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce overall reuse distance. Both FDRP-WI with stationary users and mobile users are investigated. Simulation results have confirmed the effectiveness of FDRP-WI scheme. In the case with stationary users, FDRP-WI exhibits outstanding performance in improving the system capacity under both uniform and non-uniform traffic distributions. Under the uniform traffic case, the scheme can provide over 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels at 1% blocking probability. In the case with mobile users, the impact of mobility on the new call probability, P b, and the call dropping probability, P d, is evaluated. The effect on system capacity of reserving some channels for handoff calls is first studied. Then, we propose a new handoff scheme, called "Reverse Overflow" (RO), to improve the utilization of channels with smaller reuse distances under mobile environment. Simulation results show that, with RO handoff, the system capacity of FDRP-WI is effectively improved at the expense of higher handoff rates in the cellular system.
SASS Applied to Automated Langmuir Probe Tuning
Authors: Lars Nolle
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

In this research, Self-Adaptive Stepsize Search (SASS), a novel heuristic optimization algorithm that has only one control parameter, has been applied to a discrete optimization problem, the automated deduction of fourteen Fourier terms in a radio-frequency (RF) waveform to tune a Langmuir probe. Langmuir probes are diagnostic tools used to determine the ion density and the electron energy distribution in plasma processes. RF plasmas are inherently nonlinear, and many harmonics of the driving fundamental can be generated in the plasma. RF components across the ion sheath formed around the probe distort the measurements made. To improve the quality of the measurements, these RF components can be removed by an active-compensation method. In this research, this was achieved by applying an RF signal to the probe tip that matches both the phase and amplitude of the RF signal generated from the plasma. Here, seven harmonics are used to generate the waveform applied to the probe tip. Therefore, fourteen mutually interacting parameters (seven phases and seven amplitudes) had to be tuned on-line. In previous work it was shown that the SOMA algorithm performed best in this application domain and hence the performance of SASS was compared to SOMA. It was demonstrated that SASS outperformed SOMA even without the need of finding a suitable set of control parameters.
An Architecture for Rapidly Reconfigurable MOUT Simulations
Authors: Shang-Ping Ting, Suiping Zhou
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Entertainment technology, such as game engines, can provide low cost operational realism for Military Operations on Urbanized Terrain (MOUT) simulations. However, apart from achieving low cost and high fidelity virtual environments, MOUT simulation systems should also be adaptable with the frequent shifts in operational needs. We found that existing system architectures may not be optimized for reconfiguration with a game engine based approach. To this end, we describe our work on building agile and reconfigurable systems that can construct MOUT virtual environments rapidly with game engines. We propose the Architecture for Rapid Configuration (ARC) to support model interoperability and reusability. Along with ARC, we will explain how two other components, namely Game-based Object Standard Interfaces (GOSI) specifications and the ARC-based Objects Repository (ARCOR), work in tandem with the ARC. In our previous work, we constructed Twilight City, a virtual training environment for MOUT. Our experiences show that the proposed architecture has transformed Twilight City into a rapidly reconfigurable simulation system.
Approximately maximizing efficiency and revenue in polyhedral environments
Authors: Thành Nguyen, Éva Tardos
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

We consider a resource allocation game in polyhedral environments. Polyhedral environments model a wide range of problems, including bandwidth sharing, some models of Adwords auctions and general resource allocation. We extend the fair sharing mechanism for such resource allocation games. We show that our mechanism simultaneously creates approximately efficient allocations andallapproximately maximizes revenue. We also develop a new approach for analyzing games of these types. At the core of this approach is the relation between the condition for Nash equilibriums of the game and the dual of a certain linear program.
Hazard Checking of Timed Asynchronous Circuits Revisited
Authors: Frederic Beal, Tomohiro Yoneda, Chris J. Myers
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion, or efficient algorithms which use a (conservative) approximation to avoid state-space explosion but can result in the rejection of designs which are valid. In particular, [7] presents a timed extention of the work in [1] which is very efficient but is not able to handle circuits with internal loops, which prevents its use in some cases. We propose a new approach to the problem in order to overcome the mentioned limitations, without sacrificing efficiency. To do so, we first introduce a general framework targeted at the conservative checking of safety failures. This framework is not restricted to the checking of timed asynchronous circuits. Secondly, we propose a new (conservative) semantics for timed circuits, in order to use the proposed framework for hazard checking of such circuits. Using this framework with the proposed semantics yields an efficient algorithm that addresses the limitations of the previous approaches.