ppxscal/embedding_network huggingface dataset:
Unexploded ordnance detection using Bayesian physics-based data fusion
Authors: Yan Zhang, Leslie M. Collins, Lawrence Carin
Venue: Integrated Computer-Aided Engineering (2003)

Detection of unexploded ordnance (UXO) represents a major challenge on closed, closing, and transferred military ranges as well as on active installations. On sites contaminated with UXO, extensive surface and sub-surface clutter is also present. Traditional methods used for UXO remediation have severe difficulty distinguishing buried UXO from these anthropic clutter items as well as from naturally occurring magnetic geologic noise, and thus incur prohibitively high false alarm rates. In this paper, sensor fusion techniques are employed using field data from magnetometer and electromagnetic induction (EMI) sensors in order to mitigate false alarms. Rigorous sensor response models are developed based on the sensor physics for both a traditional time-domain EMI sensor and a recently developed wideband frequency-domain sensor. Features of the target signatures are extracted by inverting the measured sensor data associated with an anomaly using the physical model. The statistical uncertainty in the feature space is explicitly treated using a Bayesian processor to discriminate targets from clutter. Discrimination performance on a seeded field trial conducted previously is reviewed. Performance on a recent field trial where data was collected in a more realistic survey mode is then presented, illustrating the robustness of the approach. Substantial reduction of the false alarm rate is achieved.
Flipping with physics: motion editing for acrobatics
Authors: Anna Majkowska, Petros Faloutsos
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Complex acrobatic stunts, such as double or triple flips, can be performed only by highly skilled athletes. On the other hand, simpler tricks, such as single-flip jumps, are relatively easy to master. We present a method for creating complex, multi-flip ballistic motions from simple, single-flip jumps. Our approach also allows an animator to interact with the system by introducing modifications to a ballistic phase of a motion. Our method automatically adjusts motion trajectories, to assure physical validity of the motion after the modifications. The presented technique is efficient and produces physically valid results without resorting to computationally expensive optimization. To validate our approach we present the results of a study of user sensitivity to errors in angular momentum and take-off angle. The study shows that small changes of these parameters introduced by our method are not perceptible to a viewer.
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Venue: Annual ACM Symposium on Theory of Computing (2007)

The papers in this volume were presented at the 39th ACM Symposium on Theory of Computing (STOC), held June 11-13, 2007 in San Diego, California, as part of the Federated Computer Research Conference (FCRC). STOC was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).This volume also contains an abstract for an invited talk delivered by the recipient of the 8th Knuth Prize, Nancy Lynch from MIT. The papers accepted to the conference were selected from a record number of 312 submissions. The program committee conducted initial electronic discussions, and these were followed by a physical meeting in Atlanta, Georgia. One quarter of the submissions were selected for presentation, and following a merge of two papers the final number of accepted papers stands at 77. Though all papers received careful consideration, they were not refereed in a formal sense, and the authors are encouraged to submit full versions of their papers for publication in journals. From the many outstanding candidates, the STOC program committee selected the following two papers as recipients of the Best Paper Award: "Faster Integer Multiplication", by Martin Furer, and "Towards 3-Query Locally Decodable Codes of Subexponential Length" by Sergey Yekhanin. The latter of these two papers is also ther ecipient of the Danny Lewin Best Student Paper Award.
Exploring large virtual environments with an HMD when physical space is limited
Authors: Betsy Williams, Gayathri Narasimham, Bjoern Rump, Timothy P. McNamara, Thomas H. Carr, John Rieser, Bobby Bodenheimer
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Virtual Environments presented through head-mounted displays (HMDs) are often explored on foot. Exploration on foot is useful since the afferent and efferent cues of physical locomotion aid spatial awareness. However, the size of the virtual environment that can be explored on foot is limited to the dimensions of the tracking space of the HMD unless other strategies are used. This paper presents a system for exploring a large virtual environment on foot when the size of the physical surroundings is small by leveraging people's natural ability to spatially update. This paper presents three methods of "resetting" users when they reach the physical limits of the HMD tracking system. Resetting involves manipulating the users' location in physical space to move them out of the path of the physical obstruction while maintaining their spatial awareness of the virtual space.
Exploring social, cultural and pedagogical issuesin AR-gaming through the live lego house
Authors: Cristina Portalés, Carlos D. Perales, Adrian D. Cheok
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Live LEGO House (LLH) is an interactive Augmented Reality (AR) environment to explore coexistence and multicultural factors through gaming. The system consists basically of a physical/real house built with the LEGO blocks, which is enriched with different non-physical/virtual multimedia files (sounds, videos and 3D animations), insisting in social, cultural and pedagogical issues that the AR technology can bring for children. Tactile, visual and auditory stimuli are present at the game.
Service-Oriented Network Description and Discovery for High-Performance
Authors: Qiang Duan
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Grid computing is an emerging computing paradigmthat will have a significant impact on the next generation information infrastructure. Networking systems form the foundation of Grid computing and must be integrated into the Grid. Service-oriented architecture is the basis of Grid computing; therefore service-oriented network description and discovery are the keys to network-Grid integration. High-performance Grid computing must select appropriate network services that meet the Quality of Service (QoS) requirements of various Grid applications. However, current Grid service description and discovery approaches are based on functional criteria instead of performance criteria thus are insufficient to support network service discovery. In this paper, a new description approach is proposed for describing QoS capabilities of network services. Based on this new description approach, a performance-based service discovery technology is developed for selecting network services that meet the QoS requirements of Grid applications. The network service description and discovery technologies developed in this paper are highly flexible and applicable to various networking systems crossing multiple heterogeneous domains. The network service discovery system proposed in this paper is embedded in the serviceoriented Grid architecture and can be implemented within the current Grid service discovery framework.
Temperature and voltage aware timing analysis: application to voltage drops
Authors: B. Lasbouygues, R. Wilson, N. Azemard, P. Maurine
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In the nanometer era, the physical verification of CMOS digital circuit becomes a complex task. Designers must account of new factors that impose a significant change in validation methods. One of these major changes in timing verification to handle process variation lies in the progressive development of statistical static timing engines. However the statistical approach cannot capture accurately the deterministic variations of both the voltage and temperature variations. Therefore, we define a novel method, based on non-linear derating coefficients, to account of these environmental variations. Based on temperature and voltage drop CAD tool reports, this method allows computing the delay of logical paths considering more realistic operating conditions for each cell. Application is given to the analysis of voltage drop effects on timings.
Wheeze detection based on time-frequency analysis of breath sounds
Authors: Styliani A. Taplidou, Leontios J. Hadjileontiadis
Venue: Computers in Biology and Medicine (2007)

Abnormal breath sounds like wheezes are observed in patients with obstructive pulmonary diseases. The aim of this study was to construct an automatic technique for wheeze detection and monitoring using spectral analysis. Wheezes from 13 patients with diagnosed asthma, chronic obstructive pulmonary disease and pneumonia were recorded and a time-frequency wheeze detector (TF-WD) based on TF wheeze characteristics was constructed. The TF-WD was evaluated using 337 wheezes by comparing its findings with those from clinical auscultation performed by two experts. In addition, the TF-WD was tested against artificial noise. The experimental and testing results justified the efficient performance and high noise robustness of the TF-WD.
Computer-animated teaching software for engineering dynamics and mechanical vibration
Authors: P. Ganatos, B. Liaw
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Beginning in the Fall 1994 semester, the Department of Mechanical Engineering at The City College of The City University of New York has introduced the utilization of computer animated modules in its undergraduate dynamics course which are intended to help the students visualize and obtain a better understanding of important concepts covered in the course. The software which these modules are based on is called Working Model and is commercially available from Knowledge Revolution, San Francisco, CA. The software allows the user to create two dimensional mechanical systems on the screen containing devices such as springs, masses, pulleys, dampers, motors and actuators. Various types of forces may be simulated including gravitational, frictional and electrostatic forces. Clicking a RUN button animates the experiment. Controls may be introduced which allow the user to vary physical parameters such as initial position, velocity, and acceleration of objects, magnitude and direction of applied forces and torques, etc. Physical quantities such as velocity, acceleration, linear and angular momentum and kinetic energy may be measured and displayed while an animation is in progress. Several illustrative modules have been developed covering a variety of topics. In addition, as the students became acquainted with the software, they were given specific topics and asked to develop their own modules. The paper describes some of the modules developed and the students' reactions to this learning experience.
Local bandwidth constrained fast inverse motion compensation for DCT-domain video transcoding
Authors: Shizhong Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

DCT-based digital video coding standards such as MPEG and H.26x are becoming more widely adopted for multimedia applications. Since the standards differ in their format and syntax, video transcoding, where a pre-coded video bit-stream is converted from one format to another format, is of interest for purposes such as channel bandwidth adaptation and video composition. DCT-domain video transcoding is generally more efficient than spatial domain transcoding. However, since the data is organized block by block in the DCT-domain, inverse motion compensation becomes the bottleneck for DCT-domain methods. We propose a novel local bandwidth constrained fast inverse motion compensation algorithm operating in the DCT-domain. Relative to Chang's (1995)algorithm, the proposed algorithm achieves computational improvement of 25% to 55% without visual degradation. A by-product of the proposed algorithm is a reduction of blocking artifacts in very low bit-rate compressed video sequences.
Worst-case performance limitation of TCP SACK and a feasible solution
Authors: K. N. Srijith, L. Jacob, A. L. Ananda
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In the present implementation of the transmission control protocol (TCP) selective acknowledgment (SACK), every SACK block needs 8 bytes to carry information about the received packets, back to the sender. Since TCP options field has a fixed length, there is a limit on the number of SACK block that can be carried by the acknowledgment packets. Under some error conditions, this limitation can force the TCP sender to retransmit packets that have already been received successfully by the receiver. This paper puts forward a proposal to modify the present SACK implementation, in order to prevent these unwanted retransmissions. We show that the proposed implementation of SACK mechanism increases the throughput of SACK enabled TCP connections.
Using Shaded Views in 3D Multiview Representation of Monotonous Polyhedron
Authors: W. S. Mokrzycki, A. Salamonczyk
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The article concerns the 3D multiview representation of monotonous polyhedrons generated on the base of their B_rep and including shaded views as a result of concavities occlusions in the views. The algorithm acts according to viewing sphere with perspective projection concept (called K-M view space model). Those models are used for visual identification based on them and a scene depth map. The results of algorithm testing are presented (the resulting views with shaded views) for some solids.
Application Deployment on Catallactic Grid Middleware
Authors: Liviu Joita, Omer F. Rana, Pablo Chacin, Isaac Chao, Felix Freitag, Leandro Navarro, Oscar Ardaiz
Venue: IEEE Distributed Systems Online (2006)

An architecture based on a decentralized market view integrates Grid applications with Catallactic middleware. A prototype application showed the concept's feasibility, as well as the middleware's effectiveness in balancing query-request workload across multiple Grid services.
On subspace based sinusoidal frequency estimation
Authors: M. Kristensson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Subspace based methods for frequency estimation rely on a low-rank system model that is obtained by collecting the observed scalar valued data samples into vectors. Estimators such as MUSIC and ESPRIT have for some time been applied to this vector model. Also, a statistically attractive Markov-like procedure for this class of methods has been proposed in the literature. Herein, the Markov estimator is re-investigated. Several results regarding rank, performance, and structure are given in a compact manner. The results are used to establish the large sample equivalence of the Markov estimator and the approximate maximum likelihood (AML) algorithm proposed by Stoica et al. (see Automatica, vol.30, no.1, p.131-45, 1994).
Extracting content from instructional videos by statistical modelling and classification
Authors: Chekuri Choudary, Tiecheng Liu
Venue: Pattern Analysis Applications (2007)

This paper presents a robust approach to extracting content from instructional videos for handwritten recognition, indexing and retrieval, and other e-learning applications. For the instructional videos of chalkboard presentations, retrieving the handwritten content (e.g., characters, drawings, figures) on boards is the first and prerequisite step towards further exploration of instructional video content. However, content extraction in instructional videos is still challenging due to video noise, non-uniformity of the color in board regions, light condition changes in a video session, camera movements, and unavoidable occlusions by instructors. To solve this problem, we first segment video frames into multiple regions and estimate the parameters of the board regions based on statistical analysis of the pixels in dominant regions. Then we accurately separate the board regions from irrelevant regions using a probabilistic classifier. Finally, we combine top-hat morphological processing with a gradient-based adaptive thresholding technique to retrieve content pixels from the board regions. Evaluation of the content extraction results on four full-length instructional videos shows the high performance of the proposed method. The extraction of content text facilitates the research on full exploitation of instructional videos, such as content enhancement, indexing, and retrieval.
High performance web servers on windows NT design and performance
Authors: James C. Hu, Irfan Pyarali, Douglas C. Schmidt
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

This research provides two contributions to the study of high-performance Web servers. First, it outlines the optimizations necessary to build efficient and scalable Web servers and illustrates how we applied some of these optimizations to create JAWS, a high-performance Web server that is explicitly designed to alleviate overheads incurred by existing Web servers on high-speed networks. Second, this paper describes how we have customized JAWS to leverage advanced features of Windows NT, such as asynchronous mechanisms for connection establishment and data transfer. Our work includes performance results which characterize the effectiveness of these techniques under increasing server load conditions. We conclude that optimal performance requires adaptive server behavior.
Distributed Approach for Implementing Genetic Algorithms
Authors: Alok Srivastava, Anup Kumar, Rakesh M. Pathak
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Genetic Algorithms are search techniques for global optimization in a complex search space. One of the interesting features of a Genetic Algorithm is that they lend themselves very well for parallel and distributed processing. This feature of Genetic Algorithm is useful in improving its computation efficiency for complex optimization problems. In this paper, we have implemented Genetic Algorithm in a distributed environment such that its implementation problem independent. This key attribute of distributed implementation allows it to be used for different types of optimization problems. Fault tolerance and user transparency are two other important features of our distributed Genetic Algorithm implementation. The effectiveness and generality of Genetic Algorithms have been demonstrated by solving two problems of network topology design and file allocation.
Incremental support vector machines and their geometrical analyses
Authors: Kazushi Ikeda, Takemasa Yamasaki
Venue: Neurocomputing (2007)

Support vector machines (SVMs) are known to result in a quadratic programming problem, that requires a large computational complexity. To reduce it, this paper considers, from the geometrical point of view, two incremental or iterative SVMs with homogeneous hyperplanes. One method is shown to produce the same solution as an SVM in batch mode with the linear complexity on average, utilizing the fact that only effective examples are necessary and sufficient for the solution. The other, which stores the set of support vectors instead of effective examples, is quantitatively shown to have a lower performance although implementation is rather easy.
Computing global decompositions of dynamical systems
Authors: William D. Kalies
Venue:  (2006)

In this dissertation we present a computational approach to Conley's Decomposition Theorem, which gives a global decomposition of dynamical systems, and introduce an explicit numerical algorithm with computational complexity bounds for computing global dynamical structures of a continuous map including attractor-repeller pairs and Conley's Lyapunov function. The approach is based on finite spatial discretizations and combinatorial multivalued maps. The method is successful in exhibiting approximations of attractor-repeller pairs, invariant sets, and Conley's Lyapunov function. We used the C++ language to code the algorithm.
STEL: secure TELnet
Authors: David Vincenzetti, Stefano Taino, Fabio Bolognesi
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Eavesdropping is becoming rampant on the Internet. We, as CERT-IT, have recorded a great number of sniffing attacks in the Italian community. In fact, sniffing is the most popular hacker's attack technique all over the Internet. This paper presents a secure telnet implementation which has been designed by the Italian CERT, to make eavesdropping ineffective to remote terminal sessions. It is not to be considered as a definitive solution but rather as a "bandaid" solution, to deal with one of the most serious security threats of the moment.
Progressive texture video coding
Authors: C. Buchner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a novel video coding approach which provides the functionality of fine granular bitstream scalability. The proposed progressive texture video coding (PTVC) scheme consists of two parts: the current ITU-T H.26L test model for coding macroblock mode and motion information only; a new technique for progressively coding all intra and inter texture information thus providing an embedded bitstream. It can still be decoded with moderate quality degradation in case of partial loss of the bitstream. It is therefore well suited for multicast or broadcast scenarios where time varying or different fixed bitrates are provided to the clients, as no transcoding or multiple coding process is required.
State space description of national economies: The V4 countries
Authors: Ivo Petras, Igor Podlubny
Venue: Computational Statistics Data Analysis (2007)

A new approach to the description of national economies is presented. For this the state space viewpoint is used, which is utilized mostly in the theory of dynamical systems and in control theory. Gross domestic product, inflation, and unemployment rates are taken as state variables. It is demonstrated that for the period of time under consideration the phase trajectory of each of the V4 countries (Slovak Republic, Czech Republic, Hungary, and Poland) lies approximately in one plane, so that the economic development of each country can be associated with a corresponding plane in the state space. The suggested approach opens a way to a new set of economic indicators (for example, normal vectors of national economies, various plane slopes, 2D angles between the planes corresponding to different economies, etc.). The tool used for computations is orthogonal regression (alias orthogonal distance regression, alias total least squares method), and general arguments for using orthogonal regression instead of the classical regression based on the least squares method are given. A MATLAB routine for fitting 3D data to lines and planes in 3D is provided.