ppxscal/embedding_network huggingface dataset:
High Fidelity Inpainting for Critical Applications Using Image Fusion
Authors: Anima Mishra, Bishwajit Sharma, Subrata Rakshit
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We propose a novel image restoration technique based on complementary information present in two or more images. While standalone image inpainting techniques fill the missing information artificially, use of spatiotemporal image sequence is suitable and reliable for critical applications, since it gathers the unavailable information in one image from other images in the sequence. There are two important issues to be dealt with before utilizing such sequences. Firstly, the images should be correctly registered in order to correctly access the undamaged images for inpainting the damaged one. Secondly, the illumination conditions should be taken care of, without which shadowing effects are generated since two images can differ in the illumination conditions, as well as sensor gain settings. In this work, a RANSAC based registration technique is used to perform efficient registration in presence of artefacts. Next, the dynamic range of the images are equalized to achieve illumination coherence. Further, we use fusion methods to incorporate information from all undamaged images into the damaged image. Cosmetic inpainting is used only if no other information is present. This work has uses in annotation removal from military and medical images and video, restoration of damaged video frames, etc. The results con- firm the efficiency of the proposed method.
Performance of near-field localization algorithms based on high-order statistics
Authors: S. Shamsunder
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Fourth-order statistics based methods are proposed for estimating the range and bearing of multiple near-field sources. The performance of the maximum likelihood estimator based on the asymptotic distribution of the sample trispectrum is studied and it is shown that the proposed estimator has lower variance when compared to the Cramer-Rao bound. This suggests that under high SNR, and with nonGaussian signals, the nonlinear HOS based method provides better performance than techniques that employ either correlations or spectra. Simulations are provided to illustrate the theoretical results.
On Burst Loss in Optical Burst Switched Networks with Hot Potato Deflection Routing
Authors: Stein Gjessing
Venue: Proceedings of the First International Conference on the Digital Society (2007)

In this article we investigate the effects of increased Control Packet lead Time (CPT) on the loss probability of bursts in an OBS network with deflection routing. In particular we investigate burst loss caused by bursts overtaking their control packets, and bursts losses caused by blocking. We have made a detailed discrete event simulation model of OBS networks and evaluated the performance of hot potato deflection when bursts are routed connectionless from ingress to egress. To our knowledge such detailed investigations into the effects of increased control packet lead time and causes of burst losses have never been performed before. We conclude that increased control packet lead time gives better performance, in particular for low loads. We also conclude that there might be a point of diminishing return, above which the increase in CPT does not decrease the burst loss enough to justify the larger burst latency.
3-Dimensional Shape Capture Using Intelligent Blocks as Direct Modeling
Authors: Masahiro OHNO, Shigeki DOI
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

A new-type 3-dimensional shape capture is proposed by directly inputting the structure built with intelligent blocks without using any camera or equipment to capture the shape of the object. The intelligent block developed in this study has CPU and several peripheral ports communicating data among blocks simply connecting blocks, and the connected block structures are directly input to the personal computer as a 3-dimensional image. The personal computer displays 3-dimensional image by computer graphics technology.
ICA Based on KPCA and Hybrid Flexible Neural Tree to Face Recognition
Authors: Jin Zhou, Yang Liu, Yuehui Chen
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper, a new approach using Independent Component Analysis (ICA) and hybrid Flexible Neural Tree (FNT) is put forward for face recognition. To improve the quality of the face images, a series of image pre-processing techniques, which include histogram equalization, edge detection and geometrical transformation are used. The ICA based on Kernel Principal Component Analysis (KPCA) and FastICA is employed to extract features, and the Hybrid FNT is used to identify the faces. To accelerate the convergence of the FNT and improve the quality of the solutions, the Extended Compact Genetic Programming (ECGP) and Particle Swarm Optimization (PSO) are applied to optimize the FNT structure and parameters. The experimental results show that the proposed framework is efficient for face recognition.
Interactive presentation: Statistical simulation of high-frequency bipolar circuits
Authors: W. Schneider, M. Schroter, W. Kraus, H. Wittkopf
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper describes a physics-based methodology for computationally efficient statistical modeling of high-frequency bipolar transistors along with its practical implementation into a production process design kit. Applications to statistical modeling, circuit simulation, and yield optimization are demonstrated for an opamp circuit. Experimental results are shown that verify the methodology.
Group behavior from video: a data-driven approach to crowd simulation
Authors: Kang Hoon Lee, Myung Geol Choi, Qyoun Hong, Jehee Lee
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Crowd simulation techniques have frequently been used to animate a large group of virtual humans in computer graphics applications. We present a data-driven method of simulating a crowd of virtual humans that exhibit behaviors imitating real human crowds. To do so, we record the motion of a human crowd from an aerial view using a camcorder, extract the two-dimensional moving trajectories of each individual in the crowd, and then learn an agent model from observed trajectories. The agent model decides each agent's actions based on features of the environment and the motion of nearby agents in the crowd. Once the agent model is learned, we can simulate a virtual crowd that behaves similarly to the real crowd in the video. The versatility and flexibility of our approach is demonstrated through examples in which various characteristics of group behaviors are captured and reproduced in simulated crowds.
More Online Video Rekindles Network Capacity Debate
Authors: Greg Goth
Venue: IEEE Internet Computing (2007)

According to technology analysis firm Deloitte Touche Tohmatsu, video has arrived, and so, perhaps, will a shortage of Internet network capacity.
Compression of Patient Monitoring Video Using Motion Segmentation Technique
Authors: R. Shyamsunder, C. Eswaran, N. Sriraam
Venue: Journal of Medical Systems (2007)

The volume of patient monitoring video acquired in hospitals is very huge and hence there is a need for better compression of the same for effective storage and transmission. This paper presents a new motion segmentation technique, which improves the compression of patient monitoring video. The proposed motion segmentation technique makes use of a binary mask, which is obtained by thresholding the standard deviation values of the pixels along the temporal axis. Two compression methods, which make use of the proposed motion segmentation technique, are presented. The first method uses MPEG-4 coder and 9/7-biorthogonal wavelet for compressing the moving and stationary portions of the video respectively. The second method uses 5/3-biorthogonal wavelet for compressing both the moving and the stationary portions of the video. The performances of these compression algorithms are evaluated in terms of PSNR and bitrate. From the experimental results, it is found that the proposed motion technique improves the performance of the MPEG-4 coder. Among the two compression methods presented, the MPEG-4 based method performs better for bitrates less than 767 Kbps whereas for bitrates above 767 Kbps the performance of the wavelet based method is found superior.
Gigaop DSP on FPGA
Authors: B. L. Hutchings
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

DSP algorithms such as sonar beamforming and automated target recognition, are a good match for FPGA technology due to their regular structure, available parallelism, pipeline-ability, and modest data word sizes. FPGA implementations of these applications outperformed their DSP and microprocessor counterparts by factors ranging from 10X on up with an equivalent sustained computational rate of more than 2 GOps/second per FPGA. This paper first describes each application and derives its computational requirements. The mapping process for each is then described followed by an analysis of the relative contributions to performance from pipelining, data parallelism, and memory usage.
A Novel Class of Symmetric and Nonsymmetric Periodizing Variable Transformations for Numerical Integration
Authors: Avram Sidi
Venue: Journal of Scientific Computing (2007)

Variable transformations for numerical integration have been used for improving the accuracy of the trapezoidal rule. Specifically, one first transforms the integral $${I[f]=\int^1_0f(x) dx}$$ via a variable transformation $${x=\phi(t)}$$ that maps [0,1] to itself, and then approximates the resulting transformed integral $${I[f]= \int^1_0 f\big(\phi(t)\big)\phi'(t) dt}$$ by the trapezoidal rule. In this work, we propose a new class of symmetric and nonsymmetric variable transformations which we denote $${\mathcal{T}_{r,s}}$$ , where r and s are positive scalars assigned by the user. A simple representative of this class is $${\phi(t)=(sin\frac{\pi}{2}t)^r/[(sin\frac{\pi}{2}t)^r+(\cos\frac{\pi}{2}t)^s]}$$ . We show that, in case $${f\in C^\infty[0,1]}$$ , or $${\in C^\infty(0,1)}$$ but has algebraic (endpoint) singularities at x = 0 and/or x = 1, the trapezoidal rule on the transformed integral produces exceptionally high accuracies for special values of r and s. In particular, when $${f\in C^\infty[0,1]}$$ and we employ $${\phi\in{\mathcal T}_{r,r}}$$ , the error in the approximation is (i) O(h r ) for arbitrary r and (ii) O(h 2r ) if r is a positive odd integer at least 3, h being the integration step. We illustrate the use of these transformations and the accompanying theory with numerical examples.
Hybrid independent component analysis and support vector machine learning scheme for face detection
Authors: Yuan Qi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We propose a new hybrid unsupervised/supervised learning scheme that integrates independent component analysis (ICA) with the support vector machine (SVM) approach and apply this new learning scheme to the face detection problem. In low-level feature extraction, ICA produces independent image bases that emphasize edge information in the image data. In high-level classification, SVM classifies the ICA features as a face or non-faces. Our experimental results show that by using ICA features we obtain a larger margin of separation and fewer support vectors than by training SVM directly on the image data. This indicates better generalization performance, which is verified in our experiments.
Evaluating the Combined Effect of Vulnerabilities and Faults on Large Distributed Systems
Authors: M. Cheminod, I. Cibrario Bertolotti, L. Durante, R. Sisto, A. Valenzano
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

On large and complex distributed systems hardware and software faults, as well as vulnerabilities, exhibit significant dependencies and interrelationships. Being able to assess their actual impact on the overall system dependability is especially important. The goal of this paper is to propose a unifying way of describing a complex hardware and software system, in order to assess the impact of both vulnerabilities and faults by means of the same underlying reasoning mechanism, built on a standard Prolog inference engine. Some preliminary experimental results show that a prototype tool based on these techniques is both feasible and able to achieve encouraging performance levels on several synthetic test cases.
Self-Generated-Certificate Public Key Cryptography and certificateless signature/encryption scheme in the standard model: extended abstract
Authors: Joseph K. Liu, Man Ho Au, Willy Susilo
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

Certificateless Public Key Cryptography (CL-PKC) enjoys a number of features of Identity-Based Cryptography (IBC) while without having the problem of key escrow. However, it does suffer from an attack where the adversary, Carol, replaces Alice's public key by someone's public key so that Bob, who wants to send an encrypted message to Alice, uses Alice's identity and other's public key as the inputs to the encryption function. As a result, Alice cannot decrypt the message while Bob is unaware of this. We call it Denial-of-Decryption (DoD) Attack as its nature is similar to the well known Denial-of-Service (DoS) Attack. Based on CL-PKC, we propose a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captures the DoD Attack. We also provide a generic construction of a self-generated-certificate public key encryption scheme in the standard model. Our generic construction uses certificateless signature and certificateless encryption as the building block. In addition, we further propose a certificateless signature and a certificateless encryption scheme with concrete implementation that are all provably secure in the standard model, which are the first in the literature regardless of the generic constructions by Yum and Lee which may contain security weaknesses as pointed out by others. We believe these concrete implementations are of independent interest.
Experiments in Verifying Low Level Concurrent C Code
Authors: Wolfram Schulte
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

The Verified C project adds design by contract programming to C. The program verifier VCC accepts annotated C programs, generates logical verification conditions from them and passes them on to an automatic theorem prover to either prove the correctness of the program or find errors in it. VCC is build to verify the functional correctness of Microsoft's hypervisor code base. The first step in developing VCC so far has been the efficient encoding of a faithful memory model. The next step is the development of a programming methodology which allows for automatic verification of annotated low level concurrent code. In this talk, I will report on the design of VCC, and on first experiments in applying it.
Factors Affecting e-Tailing Website Effectiveness: An Indian Perspective
Authors: Ankit Sharma, Yatendra Kumar Singhal, Dhawal Makhija, Anuj Kumar Goyal, Naman Agarwal, Arti Bakhshi
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

The Indian Retail Market is witnessing a revolution. The growth of internet has enabled the new retail format of the virtual retailer to emerge and forced the existing retailers to consider e-tailing model of retailing as well. A large number of consumers frequently use the Internet for shopping purposes but its' not clear what drives them to shop online. This study captures the important factors affecting the success and effectiveness of e-tailing sites to propose a unifying framework that could eventually guide research in this area and prove beneficial for e-tailers and e-marketers as well.
From motor learning to social learning: a study of development on a humanoid robot
Authors: Brian Scassellati
Venue:  (2006)

In this thesis, we describe how a humanoid robot designed to match the kinematics of a one-year old infant can learn to reach to visual targets, point toward visual targets, and share attention with a human. These three skills span the domains of motor learning and social learning. Instead of developing each of these skills independently, the robot naturally progresses from reaching to pointing and then from pointing to joint attention by taking advantage of social conventions and the assistance of a human.We first present a biologically plausible model for learning to reach to visual targets. This model is then extended to allow the robot to point toward distant objects that are outside of its reach without requiring additional learning. We demonstrate that the development of joint attention can be greatly facilitated by using pointing gestures to actively direct the attention of the robot's caregiver, resulting in learning times that are two orders of magnitude less than comparable published models and eliminating the need for hand-labeling training data. A dedicated system to evaluate this idea is presented and its performance is demonstrated.
Journaling versus soft updates: asynchronous meta-data protection in file systems
Authors: Margo I. Seltzer, Gregory R. Ganger, M. Kirk McKusick, Keith A. Smith, Craig A. N. Soules, Christopher A. Stein
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The UNIX Fast File System (FFS) is probably the most widely-used file system for performance comparisons. However, such comparisons frequently overlook many of the performance enhancements that have been added over the past decade. In this paper, we explore the two most commonly used approaches for improving the performance of meta-data operations and recovery: journaling and Soft Updates. Journaling systems use an auxiliary log to record meta-data operations and Soft Updates uses ordered writes to ensure metadata consistency. The commercial sector has moved en masse to journaling file systems, as evidenced by their presence on nearly every server platform available today: Solaris, AIX, Digital UNIX, HP-UX, Irix, and Windows NT. On all but Solaris, the default file system uses journaling. In the meantime, Soft Updates holds the promise of providing stronger reliability guarantees than journaling, with faster recovery and superior performance in certain boundary cases. In this paper, we explore the benefits of Soft Updates and journaling, comparing their behavior on both microbenchmarks and workload-based macrobenchmarks. We find that journaling alone is not sufficient to "solve" the meta-data update problem. If synchronous semantics are required (i.e., meta-data operations are durable once the system call returns), then the journaling systems cannot realize their full potential. Only when this synchronicity requirement is relaxed can journaling systems approach the performance of systems like Soft Updates (which also relaxes this requirement). Our asynchronous journaling and Soft Updates systems perform comparably in most cases. While Soft Updates excels in some meta-data intensive microbenchmarks, the macrobenchmark results are more ambiguous. In three cases Soft Updates and journaling are comparable. In a file intensive news workload, journaling prevails, and in a small ISP workload, Soft Updates prevails.
Where Are All the Intelligent Agents?
Authors: James Hendler
Venue: IEEE Intelligent Systems (2007)

There has been much research and talk about intelligent agents, but few real-world implementations.
Does Culture Interact with Media Richness? The Effects of Audio vs. Video Conferencing on Chinese and American Dyads
Authors: Leslie D. Setlock, Pablo-Alejandro Quinones, Susan R. Fussell
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Eastern and Western cultures differ along several dimensions affecting computer-supported collaborative work. We consider one such dimension, low context (requiring little situational information) or high context (requiring substantial situational information) communication style. Specifically, we report on a laboratory study comparing communication and performance of low-context American dyads, highcontext Chinese dyads, and mixed American-Chinese dyads on a negotiation task under two possible media conditions: audio conferencing or video conferencing. Although theoretical cultural work and some prior research suggest that high-context Chinese dyads can benefit from the visual cues available in video-enabled systems, we found little support for this hypothesis. There were no effects of culture or medium on conversational efficiency. We did find differences in word usage and quality of interaction between the groups, suggesting potential impact on long term collaborations. We discuss some of the implications of these findings for a theoretical understanding of culture and collaborative work.
New criteria of global exponential stability for a class of generalized neural networks with time-varying delays
Authors: Huaguang Zhang, Gang Wang
Venue: Neurocomputing (2007)

In this paper, we essentially drop the requirement of Lipschitz condition on the activation functions. Only using physical parameters of neural networks, some new criteria concerning global exponential stability for a class of generalized neural networks with time-varying delays are obtained. The neural network model considered includes the delayed Hopfield neural networks, bidirectional associative memory networks, and delayed cellular neural networks as its special cases. Since these new criteria do not require the activation functions to be differentiable, bounded or monotone nondecreasing, the connection weight matrices to be symmetric and the delay function @t"i"j(t) to be differentiable, our results are mild and more general than previously known criteria. Four illustrative examples are given to demonstrate the effectiveness of the obtained results.
Flexible Algorithms: Fragments from a Beginners' Course
Authors: R. B. Yehezkael
Venue: IEEE Distributed Systems Online (2007)

A Jerusalem College of Technology course teaches flexible algorithms to beginning computer science students. In this department, the author describes the notation's main features and presents fragments from the course.
Development of the ATC Simulators
Authors: Shi-feng Mo, Hui Li, Xian-jiang He, Zhi-sheng You
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In the ATC domain, simulated training is an effective approach to cultivate controllers, and ATC simulators providing vivid simulated environment for the trainees are the key devices with high complexity. In this paper, the software product line approach is proposed to build a group of ATC simulators from a common set of core assets. As the core assets shared across our ATC simulators, the high-level procedural model, architecture, real-time network communication component, primitive-based aerostats' operation command mechanism and multi-PC based 3D virtual scene rendering system are analyzed and described in detail, which is helpful to the development of other similar simulation applications. Additionally, the development of a tower simulator is presented as an example with a few screenshots, which shows our solution is effective and helpful to the complex simulation applications family such as ATC simulators.