ppxscal/embedding_network huggingface dataset:
Cheap Joint Probabilistic Data Association filters in an Interacting Multiple Model design
Authors: Christian Hoffmann, Thao Dang
Venue: Robotics and Autonomous Systems (2009)

This paper presents an approach to fuse multiple sensors in an Interacting Multiple Model design. Visual features like shadow and symmetry, treated as independent stand-alone virtual sensors, are employed for detection and tracking of vehicles for driver assistance tasks. Cheap Joint Probabilistic Data Association is utilised to account for the large amount of clutter in the measurements provided by these sensors. Special attention is devoted to the different noise characteristics of the measurements. The individual sensors are considered in a sequential manner, leading to a versatile fusion architecture that allows easy integration of further sensor modules.
Real binoculars with virtual functions for mixed environments
Authors: Andrei Sherstyuk, Kin Lik Wang, Anton Treskunov, Jarrell Pair
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Though often desirable, the integration of real and virtual elements in mixed reality environments can be difficult. We propose a number of techniques to facilitate scene exploration and object selection by giving users real instruments as props while implementing their functionality in a virtual part of the environment. Specifically, we present a family of tools built upon the idea of using real binoculars for viewing virtual content. This approach matches user expectations with the tool's capabilities enhancing the sense of presence and increasing the depth of interaction between the real and virtual components of the scene. We also discuss possible applications of these tools and the results of our user study. This paper is an extended version of earlier work presented at the 4th International Workshop on the Tangible Space Initiative[5].
Evaluation of mobile services for the future of 3G operators
Authors: Wen-Hsien Tsai, Hsueh-Wei Lo, Wen-Chin Chou
Venue: International Journal of Mobile Communications (2009)

Internet and mobile telephone services are both important for intercommunication among people. In addition, wireless technologies are popular and emerging technologies for the telecommunications industry. A case study of a mobile operator with Third Generation (3G) services is discussed in this paper. Because of its decreasing voice service revenue, this mobile operator is in straitened circumstances and it tends to focus on feasible mobility services. In this study, we applied the Analytic Network Process (ANP) method to the network structures for making complex decisions. This method helps the decision-makers determine which of three alternatives would best meet the company's needs.
Bit Error Performance of STBC MB-OFDM UWB
Authors: Qinghai Yang, Kyung Sup Kwak
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Bit error performance is investigated in this letter for orthogonal space-time block coded (STBC) multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) systems. As the channel model considers the log-normal fading, the resultant signal to noise ratio (SNR) follows a chi-squared log-normal distribution. Based on this, the bit error probability is derived. Furthermore, simulation verifies this theoretical result.
Leaky Coplanar Waveguide Antenna with Tunable Beamwidth and Radiation Angle Using Composite Right/Left-Handed Materials
Authors: Abdelaziz Hamdi, Ammar B. Kouki, Abdelaziz Samet
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

A new field of physics has appeared with the emergence of materials known as "Left handed materials" (LHM) or "metamaterials". These materials show very particular characteristics. Their index of refraction has a negative value, which results in the reversal of Snell’s law. Whereas, in traditional material the Poynting vector S always forms a right-handed triplet with E and H (S = E ∧ H). In the left handed media, the Poynting vector S and the wave vector K are in opposite directions. Thus, the wave moves in the direction opposite to the direction of the energy flow: phase speed and group speed are anti-parallel. Therefore, a left-handed media is artificial and does not exist in nature. Indeed, when these materials are inserted into a guided wave device, one obtains the backward-wave effect. The goal of this work is to study more in details this physical phenomenon. To undertake this study, this paper presents also the design of a 10 GHz beam-scanning CPW-Antenna fabricated on metamaterial support.
Performance Evaluation for Remote Access VPNs on Windows Server 2003
Authors: Ahmed A. Jaha, Fathi Ben Shatwan, Majdi Ashibani
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

A Virtual Private Network (VPN) can be defined as a way to provide secure communication between members of a group through use of the public telecommunication infrastructure, maintaining privacy through the use of a tunneling protocol and security procedures. This work examines and empirically evaluates the remote access VPNs, namely Point to Point Tunneling Protocol (PPTP), Layer 2 Tunneling Protocol over Internet Protocol Security (L2TP/IPSec), and Secure Socket Layer (SSL). We explore the impact of these VPNs on end-to-end user application performance using metrics such as throughput, RTT, jitter, and packet loss. All experiments were conducted using wired and wireless windows XP SP/2 host (VPN Client) connected to a windows server 2003 host (VPN Server).
An Image Inpainting Algorithm Based on Local Geometric Similarity
Authors: Pan Qi, Xiaonan Luo, Jiwu Zhu
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

This paper proposes a novel noniterative orientation adaptive image inpainting algorithm. Assuming the image can be locally modeled, the filling process is formulated as a linear optimization problem, which the optimal coefficients can be adapted to match an arbitrary-oriented edge based on local geometric similarity. We provided A Weighted Least Square (WLS) method is provided to offer a convenient way of finding the optimal solution, which the weight function is selected based on the non local means. We also present Group Marching method (GMM) as the propagation scheme such that sharp edges are well propagated into the missing region layer by layer while maintaining the local geometric similarity. A number of examples on real and synthetic images demonstrate the effectiveness of our algorithm.
P2P Service Performance Analysis of Unstructured P2P Network
Authors: JunPeng Mao, YanLi Cui, JianHua Huang, JianBiao Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Convenient, efficient and anonymous characteristic enables P2P network to own enormous users very quickly. However, how much service performance of searching and transmitting is provided by P2P network for a concrete resource? How much is the success ratio and recall ratio of resource's searching of existing P2P network? Rare research is deepened about those questions. This paper, for unstructured P2P network, provides calculating method of service performance of concrete resource; analyzes success ratio and recall ratio of resource's searching, and by experiment simulation, discusses the influence of resource's popularity, Peer's quantity, initial number of objected resource, Peer's average degree and TTL value to success ratio and recall ratio of resource's searching. We conclude that recall ratio is only related with topology character of P2P network itself but not related with resource's quantity. Otherwise, when, mostly searching process can reach higher success ratio and recall ratio.
On Minimal Triangulations of Products of Convex Polygons
Authors: Michelle Bucher-Karlsson
Venue: Discrete Computational Geometry (2009)

We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in Bowen et al. (Topology 44:321&#x2013;339, 2005).
A Step-by-Step Guide to Usability Testing, 0 edition
Authors: Peter P Mitchell
Venue:  (2007)

Every day we are bombarded with new technology products that are confusing and difficult to use. For example, the new touch-screen voting machines in Florida are so difficult to use that some elections have been nullified due to all of the errors voters made while using the machines. There has to be a way to make things easy-to-use. There isand it is found inside the covers of this book.
Responsiveness to robots: effects of ingroup orientation & communication style on hri in china
Authors: Lin Wang, Pei-Luen Patrick Rau, Vanessa Evers, Benjamin Robinson, Pamela Hinds
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This study investigates the effects of group orientation and communication style on Chinese subjects' responsiveness to robots. A 2x2 experiment was conducted with group orientation (ingroup vs. outgroup) and communication style (implicit vs. explicit) as dimensions. The results confirm expectations that subjects with a Chinese cultural background are more responsive to robots that use implicit communication styles. We also found some evidence that subjects were more responsive when they thought of the robot as an ingroup member. These findings inform the design of robots for use in China and countries with similar cultural values and reinforce the importance of culturally sensitive design in HRI.
A Self-adaptive Evolutionary Programming Based on Optimum Search Direction
Authors: Guangming Lin, Xin Lu, Yongsheng Liang, Lishan Kang, Xin Yao
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The Classical Evolutionary Programming (CEP) relies on Gaussian mutation, whereas Fast Evolutionary Programming (FEP) selects Cauchy distribution as the primary mutation operator, Improved Fast Evolutionary (IFEP) selects the better Gaussian and Cauchy distribution as the primary mutation operator. In this paper, we propose a self-adaptive Evolutionary Programming based on Optimum Search Direction (OSDEP) in which we introduce the current best global individual into mutation to guide individuals to converge according to the global search direction. Extensive empirical studies have been carried out to evaluate the performance of OSDEP, IFEP, FEP and CEP. From the experimental results on seven widely used test functions, we can show that OSDEP outperforms all of IFEP, FEP and CEP for all the test functions.
A new algorithm with segment protection and load balancing for single-link failure in multicasting survivable networks
Authors: Xingwei Wang, Lei Guo, Xuetao Wei, Lan Pang, Tengfei Wu, Juan Du, Xuekui Wang
Venue: Journal of Systems and Software (2009)

In this paper, we investigate the problem of failure tolerated multicast requests in survivable networks and propose a new heuristic algorithm called segment protection with load balancing (SPLB) to address the single-link failure. In order to obtain better performances, in SPLB first we consider the techniques of cross-sharing and self-sharing to improve the resource utilization ratio, second we propose a segment protection routing algorithm to overcome the trap problem, and third we design a load balancing method to reduce the blocking probability. Compared with conventional algorithm, SPLB performs better performances. Simulation results meet our expectation.
Fast gaze typing with an adjustable dwell time
Authors: Päivi Majaranta, Ulla-Kaija Ahola, Oleg Špakov
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Previous research shows that text entry by gaze using dwell time is slow, about 5-10 words per minute (wpm). These results are based on experiments with novices using a constant dwell time, typically between 450 and 1000 ms. We conducted a longitudinal study to find out how fast novices learn to type by gaze using an adjustable dwell time. Our results show that the text entry rate increased from 6.9 wpm in the first session to 19.9 wpm in the tenth session. Correspondingly, the dwell time decreased from an average of 876 ms to 282 ms, and the error rates decreased from 1.28% to .36%. The achieved typing speed of nearly 20 wpm is comparable with the result of 17.3 wpm achieved in an earlier, similar study with Dasher.
Numerical Simulation of a New Self-adapted Deflection Tomography
Authors: Yizhong Song, Zhimin Zhao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A new deflection tomography algorithm was suggested and verified with a simulated flow field. The programs calculating deflection projection and inverse projection were worked out based on optical refraction principle and mathematical, physical significance of tomography. With our home-made Simple Self-correlative Algebraic Reconstruction Technique (SSART), a new deflection tomography algorithm was programmed and named self-adapted deflection tomography. To test its performance, A section of a complex flow field was simulated. The deflection projections were figured out according to the tomography algorithm. The section was reconstructed with the projections by SSART. The reconstructed result was compared with the model in order to test the performace of the system. The reconstructive effect was scaled with Mean-square error (MSE) and Peak error (PE). As the result, the system could reconstruct the simulated field accurately. MSE of reconstruction was about from 0.00009 to 0.001 at the end of 300 cycle iterations, and PE was about from 0.001 to 0.02. So, the self-adapted deflection tomography system can accurately reconstruct complex flow fields.
A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems
Authors: Wei-Chang Yeh
Venue: Expert Systems with Applications: An International Journal (2009)

Nowadays, the redundancy allocation problem (RAP) is increasingly becoming an important tool in the initial stages of or prior to planning, designing, and control of systems. The multiple multi-level redundancy allocation problem (MMRAP) is an extension of the traditional RAP such that all available items for redundancy (system, module and component) can be simultaneously chosen. In this paper, a novel particle swarm optimization algorithm (PSO) called the two-stage discrete PSO (2DPSO) is presented to solve MMRAP in series systems such that some subsystems or modules consist of different components in series. To the best of our knowledge, this is the first attempt to use a PSO to MMRAP. The proposed PSO used a totally new, very simple, effective and efficient mechanism to move to the next position without velocity. The result obtained by 2DPSO has been compared with those obtained by genetic algorithm (GA) and binary PSO (BPSO). Computational results show that the proposed 2DPSO is very competitive and performs well in the number of times it finds the best solutions, the average numbers of the earliest finding of the best solutions, and computation times.
Hands-On Microsoft Windows Server 2008 Administration, 1st edition
Authors: Michael Palmer
Venue:  (2008)

Hands-On Microsoft Windows Server 2008 is the perfect resource for learning Windows Server 2008 from the ground-up! Designed to build a foundation in basic server administration, the book requires no previous server experience. It covers all of the critical Windows Server 2008 features, including the features unique to this new server operating system, from Windows Server 2008 features and versions to installing, configuring, and using Hyper-V virtual server capabilities. Like other books in the widely successful Hands-On series, a variety of hands-on projects are located throughout each chapter, which can be completed in server console, remote connection, Internet, and virtual server environments.
Comparison of different spatial grids for numerical schemes of geophysical fluid dynamics
Authors: Ludmila Bourchtein, Andrei Bourchtein
Venue: Journal of Computational and Applied Mathematics (2009)

The generation of computational grids is an important component contributing to the efficiency of numerical schemes of atmosphere/ocean dynamics. In this study the problem of construction of the most uniform grids based on conformal mappings of spherical domains is considered. Stereographic, cylindrical and conic grids for computational rectangles are developed and their uniformity is compared. Numerical experiments with two schemes approximating shallow water equations are performed in order to assess the practical efficiency of the constructed grids and to compare the numerical results with analytical evaluations.
Computing the latitudes of sunspot trajectories and speed of sunspots with intelligent methods
Authors: Mostafa Bakhtiary, Ahmad Hamedi Yekta, Arash Attarzadeh
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Solar sunspot rotation, latitudinal bands are studied based on intelligent computation methods. The benefices of image fusion and powerful tree decomposition are used in this study in order to achieve quantitative values about the latitudes of trajectories that sunspots rotate on them Daily solar images taken with SOHO satellite are fused for each month and the result of fused image is decomposed with Quad Tree decomposition method in order to achieve the precise information about latitudes of sunspot trajectories. Such analysis is useful for gathering information about the regions on sun surface and coordinates in space that is more expose to solar geomagnetic storms, tremendous flares and hot plasma gases permeate interplanetary space and help human to serve their technical systems. Here sunspot images in September, November and October in 2001 are used for studying the magnetic behavior of sun.
Hamiltonian Alternating Paths on Bicolored Double-Chains
Authors: Josef Cibulka, Jan Kynčl, Viola Mészáros, Rudolf Stolař, Pavel Valtr
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We find arbitrarily large finite sets S of points in general position in the plane with the following property. If the points of S are equitably 2-colored (i.e., the sizes of the two color classes differ by at most one), then there is a polygonal line consisting of straight-line segments with endpoints in S, which is Hamiltonian, non-crossing, and alternating (i.e., each point of S is visited exactly once, every two non-consecutive segments are disjoint, and every segment connects points of different colors).We show that the above property holds for so-called double-chains with each of the two chains containing at least one fifth of all the points. Our proof is constructive and can be turned into a linear-time algorithm. On the other hand, we show that the above property does not hold for double-chains in which one of the chains contains at most ≈ 1/29 of all the points.
Video Avatar: Embedded Video for Collaborative Virtual Environment
Authors: Shunsuke Yura, Tomonori Usaka, Ken Sakamura
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper proposes the video avatar, the avatar with the embedded video of the human body in the collaborative virtual environment. The video avatar enables the visual communication between the avatars. The video avatar has three features for enhancing the visual communication. The target object function and the comment function enhance the gesture of the avatar. These functions integrate the embedded video and the virtual objects in the virtual space. The multiple video mechanism enhances the identification of the avatar. This mechanism displays the embedded video with a three-dimensional figure. This paper also describes the prototype systems of the video avatar and our experience in the exhibition. Our experience shows that the visual communication provided by the video avatar is effective for guiding the user in the large-scaled virtual space.
Scientific workflow scheduling in computational grids Planning, reservation, and data/network-awareness
Authors: Yonghong Yan, Barbara Chapman
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

A very important issue in executing a scientific workflow in computational grids is how to map and schedule workflow tasks onto multiple distributed resources and handle task dependencies in a timely manner to deliver users’ expected performance. In this paper, we present our work to develop and evaluate an advanced workflow scheduler in computational grid environments, the GRACCE scheduler. The GRACCE scheduler applies advanced scheduling techniques, such as resource negotiation and reservation, data/network-aware scheduling and performance prediction in the resource allocation and execution planning process. To evaluate the scheduler, we have set up an experimental environment that models a computational grid in those aspects relevant to workflow scheduling. Our results show the average performance improvement, using the GRACCE scheduler, is about 20% under high resource loads.
DBFarm: a scalable cluster for multiple databases
Authors: Christian Plattner, Gustavo Alonso, M. Tamer Özsu
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

In many enterprise application integration scenarios, middleware has been instrumental in taking advantage of the flexibility and cost efficiency of clusters of computers. Web servers, application servers, platforms such as CORBA, J2EE or .NET, message brokers, and TP-Monitors, just to mention a few examples, are all forms of middleware that exploit and are built for distributed deployment. The one piece in the puzzle that largely remains a centralized solution is the database. There is, of course, much work done on scaling and parallelizing databases. In fact, several products support deployment on clusters. Clustered databases, however, place the emphasis on single applications and target very large databases. By contrast, the middleware platforms just mentioned use clustered deployment not only for scalability but also for efficiently supporting multiple concurrent applications. In this paper we tackle the problem of clustered deployment of a database engine for supporting multiple applications. In the database case, multiple applications imply multiple and different database instances being used concurrently. In the paper we show how to build such a system and demonstrate its ability to support up to 300 different databases without loss of performance.
F-score with Pareto Front Analysis for Multiclass Gene Selection
Authors: Piyushkumar A. Mundra, Jagath C. Rajapakse
Venue: Proceedings of the 7th European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics (2009)

F-score is a widely used filter criteria for gene selection in multiclass cancer classification. This ranking criterion may become biased towards classes that have surplus of between-class sum of squares, resulting in inferior classification performance. To alleviate this problem, we propose to compute individual class wise between-class sum of squares with Pareto frontal analysis to rank genes. We tested our approach on four multiclass cancer gene expression datasets and the results show improvement in classification performance.