ppxscal/embedding_network huggingface dataset:
Algorithms: Analysis, Design, Implementation
Authors: S. A. M. Rizvi, Pankaj Agarwal
Venue:  (2009)

Analysis and Design of Algorithms (ADA) is one of the core components for the undergraduate and postgraduate professional courses of computer science and applications globally. This book covers all the aspects of ADA in a clear and easily understandable manner. It will be equally important and useful for teachers, researchers, professionals and students to help them establish the state-of-the-art handling of the problem-solving aspects and skills. This book will serve as an extremely important tool for all computer professionals both in academia and industry to help in designing and developing the solution for a given problem in the process of software development. Contents: Design and Analysis of Algorithms: Basic Concepts: Recurrences: Sorting Algorithms: Divide and Conquer Strategy: Hashing Techniques: Binary trees: AVL Trees: Red-Black Trees: Dynamic Programming: Greedy Algorithms: Amortised Analysis: Graph Algorithms: B-Trees: Binomial Heaps: Working Intractable Problems and Approximations: Numerical Algorithms: Union-Find: Dictionaries: Branch-and-Bound: Introduction to Parallel Computing and Basic Algorithms: Appendices: References; Index. Also available:Modern Mathematical Models, Methods And Algorithms for Real World Sytems - ISBN 1904798640 Introduction to Algebraic Geometry And Commutative Algebra - ISBN 1904798632Anshan Publishers is a publisher of fine medical, scientific, and technical books. We find the best titles from our worldwide publishing partners and bring them to the global marketplace. We publish in a wide range of fields, including:- Biological Sciences Biotechnology Chemistry Engineering Material Science Microbiology Pure and Applied Physics Pure and Applied Mathematics Statistics
Software Reliability Assurance Using a Framework in Weapon System Development: A Case Study
Authors: Dalju Lee, Jongmoon Baik, Ju-Hwan Shin
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In embedded systems like weapon systems, the proportion of software has been growing and the quality of software, which provides complicated functionalities of a system and controls hardware, affects the quality of the entire system. Besides, to implement/acquire reliable software, we need the efforts for assuring process quality as well as product quality in the whole software development life cycle. In this paper, we propose a framework to assure software reliability of weapon systems in Korean defense domain. The framework provides a guideline for software reliability evaluation to software organizations and pursues the improvement of software engineering process which supports activities and indicators for quantitative project management in the software development process. We also present the empirical study of the application of the proposed framework and the analysis results on the effectiveness of the proposed framework.
Interpreting Human and Avatar Facial Expressions
Authors: Sylvie Noël, Sarah Dumoulin, Gitte Lindgaard
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

This paper investigates the impact of contradictory emotional content on people's ability to identify the emotion expressed on avatar faces as compared to human faces. Participants saw emotional faces (human or avatar) coupled with emotional texts. The face and text could either display the same or different emotions. Participants were asked to identify the emotion on the face and in the text. While they correctly identified the emotion on human faces more often than on avatar faces, this difference was mostly due to the neutral avatar face. People were no better at identifying a facial expression when emotional information coming from two sources was the same than when it was different, regardless of whether the facial expression was displayed on a human face or on an avatar face. Finally, people were more sensitive to context when trying to identify the emotion in the accompanying text.
Dynamic Sliding Mode Controller Based on Particle Swarm Optimization for Mobile Robot's Path Following
Authors: Xu Yuhua, Zhang Chongwei, Bao Wei, Tong Lin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, a vision-guided mobile robot's path following is studied. A dynamic sliding mode controller (DSMC) is designed based on the nonlinear kinematic model of the robot without linearization of the system and the stability of the controller is proved through Lyapunov function. Particle swarm optimization (PSO) algorithm is utilized to optimize the parameters of the controller. Simulation analysis and experimental results demonstrate that the controller proposed can steer the robot to track the guide line accurately, which also show that the controller eliminates chattering problem effectively since the high-frequency chattering is transferred into the derivative of the control signal. The precision of the system can reach below 2 cm for distance error and 2 degree for orientation error.
Similarity Evaluation of XML Documents Based on Weighted Element Tree Model
Authors: Chenying Wang, Xiaojie Yuan, Hua Ning, Xin Lian
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

The logical presentation model of XML data is the basis of XML data management. After introducing XML tree models and frequent pattern models, in this paper we have proposed a novel Weighted Element Tree Model (WETM) for measuring the structural similarity of XML documents. This model is a concise form of XML tree models, so the efficiency of the operation on this model is higher than XML tree models. And comparing with frequent pattern models, the WETM enhances the expression ability of structural information of sub trees, which can appreciate the accuracy of similarity evaluation. Moreover, in order to compare the performance of the proposed evaluation algorithm, it is applied to XML documents clustering. The experimental results show that our algorithm is superior to the algorithms based on tree models or frequent pattern models.
Vision Autonomous Relative Navigation Algorithm for Distributed Micro/Nano Satellite Earth Observation System Based on Motor Algebra
Authors: Kezhao Li, Qinglin Wang, Qin Zhang, Chaoying Zhao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Along with the development of space science and technology, it is not a heart-stirring thing to launch a satellite successfully any more. But we pay greatly attention to space autonomous rendezvous and docking (AR&D) in space operations, such as maintaining, assembling, attacking etc. And that autonomous relative position and pose is one of key technologies of these space actions. Currently, celestial Navigation System (CNS), Inertial Navigation System (INS), Global Navigation Satellite System (GNSS), such as GPS, GLONASS, GALILEO and Compass etc, and the integrations of them are some methods of autonomous navigation for space. But these methods must be depended on the high speed links of the communications network. Moreover, the precision of CNS is always worse, and can not meet the rigorous requirement of the space activities. INS can not be used for long-term space navigation applications for its errors being accumulated. High accuracy can be met by Carrier Differential Global Positioning System (CDGPS), but it is difficult to calculate the ambiguities of CDGPS. Fortunately, autonomous relative position and pose based on machine vision is a direction all over the world currently, and is very suitable for autonomous spacecraft navigation because it has some advantages, such as low-cost, high precision, autonomous ability, easy practicality etc. However, there are some disadvantages of some relative navigation algorithms based-on machine vision, such as complicated description, huge calculation burden, and lack of real-time ability etc. Whereas, the rigid motion of 3D objects can be represented by motor algebra, and the rotation and translation transformations can be calculated simultaneously. So it is more effective for dealing with relative navigation of distributed micro/nano satellite earth observation system. In this paper, on the basis of the attitude dynamics of spacecrafts and the theory of machine vision, an autonomous relative navigation algorithm for distributed micro/nano satellites based on motor algebra and EKF (Extended Kalman Filtering) is proposed. Firstly, how to represent a line transform unit using motor algebra is introduced. Then, the feature line point of the line transform unit is defined. And then, on the basis of the attitude dynamics of spacecrafts and the theory of EKF, we build the state and observation equations. Finally, the simulations show that this algorithm is an accurate valid method in relative navigation of distributed micro/nano satellite earth observation system.
Designing Sticky Knowledge-Network SNS for Japanese Science Teachers
Authors: Yoshihisa Wada, Masayuki Sakoda, Hiroshi Tsuji, Yuuki Aoki, Kazuhisa Seta
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

To support knowledge sharing among science teachers on ICT (Information and Communication Technology), this paper proposes a knowledgenetwork SNS (Social Networking Service) based on stickiness, which have three factors to drive;(I) Relationship Capital, (II) Reputation and (III) Personalization. Building a prototype SNS based on these factors, this paper defines two kinds of quantification of stickiness which express how system is used and how user continue to use. Compared with the traditional knowledge-repository, the knowledge-network SNS transfers tacit knowledge learned in class from one to others. And more, the quantificated stickiness gives standards to strengthen teachers' knowledge-network; (1) picking up low-stickiness teachers for inviting into the network and (2) estimating stickiness of the system.
Defining Expected Behavior for Usability Testing
Authors: Stefan Propp, Peter Forbrig
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Within HCI task models are widely used for development and evaluation of interactive systems. Current evaluation approaches provide support for capturing performed tasks and for analyzing them in comparison to a usability experts' captured behavior. Analyzing the amount of data works fine for the evaluation of smaller systems, but becomes cumbersome and time-consuming for larger systems. Our developed method aims at making the implicitly existing expectations of a usability expert explicit to pave the way for automatically identifying candidates for usability issues. We have enhanced a CTT-like task modeling notation with a language to express expected behavior of test users. We present tool support to graphically compose expectations and to integrate them into the usability evaluation process.
Video Content Production Support System with Speech-Driven Embodied Entrainment Character by Speech and Hand Motion Inputs
Authors: Michiya Yamamoto, Kouzi Osaki, Tomio Watanabe
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

InterActor is a speech-input-driven CG-embodied interaction character that can generate communicative movements and actions for entrained interaction. InterPuppet, on the other hand, is an embodied interaction character that is driven by both speech input, like the InterActor, and hand motion input, like a puppet. In this study, we apply InterPuppet to video content production and construct a system to evaluate the content production. Self-evaluation of long-term (5-day) video content production demonstrates the effectiveness of the developed system.
Krylov iterative methods and synthetic acceleration for transport in binary statistical media
Authors: Erin D. Fichtl, James S. Warsa, Anil K. Prinja
Venue: Journal of Computational Physics (2009)

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S"2 synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.
The Measurement of Abrasive Wear Based on Computer Vision
Authors: Xiaofeng Zhang, Bin Wan, Jiexian Zeng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

To measure the height and wear of the diamond abrasive, a new technique based on computer vision is presented in this paper. Firstly, the computer vision system is designed. The height evaluation of abrasives and the calibration of the imaging set-up are introduced in detail. Secondly, we adopt the sequential similarity detection algorithm to get corresponding pixels in the left and right image. Finally, the heights and wear of the grain are obtained by calculating their parallax on left and right images. The experiment of standard block shows that the relative error is less than 5%.
Effects of co-player visualization in a location-based chase-and-catch game
Authors: Gunnar Misund, Harald Holone, Håkon Tolsby, Joakim Karlsen, Aleksander Toppe
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In our FoxHunt game, virtual foxes are chased on a playground. Foxes and hunters are rendered on a map displayed on GPS-enabled mobile phones. We collected data from three field tests, totalling 130 participants. Approximately half of the players were provided with positions and scores for the other hunters. In the rest of the games, only the foxes and the players' own avatars were rendered. Providing co-player information did not have a direct impact on gaming scores. However, it increased the reported fun factor.
DiamondTheater: A System for Reproducing Theater and Supporting Creative Activities
Authors: Tatsushi Takeuchi, Koichiro Watanabe, Tomoo Inoue, Ken-Ichi Okada
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

This paper describes a system called DiamondTheater that supports creative activities in theater using a tabletop tangible interface. This system is used to aid in the planning of certain aspects of theater production, such as actor positioning, and sound and lighting cues. Without having some considerable experience in production, it is difficult to create a mental picture of an actual production. Thus, a miniature theatrical stage is reproduced on the tabletop surface to facilitate the user's creation of such a picture and the sharing of ideas. Users collaboratively construct a stage by placing small dolls to represent actors and many kinds of miniature stage sets. In addition, the system allows users to reproduce other aspects of theater production such as sound and lighting. We performed a user study of this system and demonstrated that DiamondTheater appears to effectively assist the user's activity in theater production design.
Frequency Scanning Using Software Defined Radio for Localised Range Estimation
Authors: K. Mohamad Yusof, John Woods, Steve Fitz
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Range estimation for localisation in wireless sensor networks is an ill posed problem due to multipath. The advancements in software defined radio have made possible the novel ranging technique outlined in this paper. By using frequency scanning, node localisation is achieved in wireless sensor networks (WSN). The technique examines the periodicities in the frequency scan and concludes that when a frequency scan is performed, the periodicity of the received signal strength is proportional to the distance. By comparing the periodic value to a linear periodic function, the distance between sensor node and anchor node can be estimated. Simulation results demonstrate the proposed ranging technique is capable of giving accurate localised range estimations.
Privacy Compliance Engineering Process
Authors: Xiaojun Ye, Zhiwu Zhu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

For successful privacy engineering, it is critical to guarantee the alignment and compliance among privacy artifacts produced during privacy-aware software development. In this paper, we propose a privacy compliance engineering flow in which we discuss the involved privacy artifacts and their alignment, refinement, and compliance verification. Within a case study, we identify the privacy artifacts in the refinement flow and analyze their compliance verification.
Cognitive Impairments, HCI and Daily Living
Authors: Simeon Keates, James Kozloski, Philip Varker
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

As computer systems become increasingly more pervasive in everyday life, it is simultaneously becoming ever more important that the concept of universal access is accepted as a design mantra. While many physical impairments and their implications for human-computer interaction are well understood, cognitive impairments have received comparatively little attention. One of the reasons for this is the general lack of sufficiently detailed cognitive models. This paper examines how cognitive impairments can affect human-computer interaction in everyday life and the issues involved in trying to make information technology more accessible to users with cognitive impairments.
Skipping steps in deformable simulation with online model reduction
Authors: Theodore Kim, Doug L. James
Venue: ACM SIGGRAPH Asia 2009 papers (2009)

Finite element simulations of nonlinear deformable models are computationally costly, routinely taking hours or days to compute the motion of detailed meshes. Dimensional model reduction can make simulations orders of magnitude faster, but is unsuitable for general deformable body simulations because it requires expensive precomputations, and it can suppress motion that lies outside the span of a pre-specified low-rank basis. We present an online model reduction method that does not have these limitations. In lieu of precomputation, we analyze the motion of the full model as the simulation progresses, incrementally building a reduced-order nonlinear model, and detecting when our reduced model is capable of performing the next timestep. For these subspace steps, full-model computation is "skipped" and replaced with a very fast (on the order of milliseconds) reduced order step. We present algorithms for both dynamic and quasistatic simulations, and a "throttle" parameter that allows a user to trade off between faster, approximate previews and slower, more conservative results. For detailed meshes undergoing low-rank motion, we have observed speedups of over an order of magnitude with our method.
Differential Cluster Analysis
Authors: Lejla Batina, Benedikt Gierlichs, Kerstin Lemke-Rust
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

We propose a new technique called Differential Cluster Analysis for side-channel key recovery attacks. This technique uses cluster analysis to detect internal collisions and it combines features from previously known collision attacks and Differential Power Analysis. It captures more general leakage features and can be applied to algorithmic collisions as well as implementation specific collisions. In addition, the concept is inherently multivariate. Various applications of the approach are possible: with and without power consumption model and single as well as multi-bit leakage can be exploited. Our findings are confirmed by practical results on two platforms: an AVR microcontroller with implemented DES algorithm and an AES hardware module. To our best knowledge, this is the first work demonstrating the feasibility of internal collision attacks on highly parallel hardware platforms. Furthermore, we present a new attack strategy for the targeted AES hardware module.
Comparisons of 3D Shape Clustering with Different Face Area Definitions
Authors: Jianwei Niu, Zhizhong Li, Song Xu
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

The importance of fit for face-related wearing products has introduced the necessity for better definition of face area. In this paper, three definitions of face area are compared on the context of Three dimensional (3D) face shape similarity based clustering. The first method defines the face area by spanning from the whole head grid surface by the front ¿/2 wedge angle along a line going through the centroid and pointing to the top of the head. The second method defines the face area as the grid surface enclosed by several anthropometric landmark points (sellion, both zygions, and menton) on the facial surface. The zonal surface where the respirator interferes with the wear's face is taken as the third alternative definition for the comparative study. By utilizing the block-distance measure, each face was converted into a compact block-distance vector. Then, k-means clustering was performed on the vectors. 376 3D face data sets were tested in this study. One-way ANOVA on the block distance based vectors was conducted to evaluate the influence on clustering results by utilizing different face area definitions. No difference was found at the significant level of 0.05. However, the cluster membership shows great difference between different definitions. This emphasizes the value of the selection of face area in 3D face shape-similarity-based clustering.
Without Loss of Generality
Authors: John Harrison
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

One sometimes reads in a mathematical proof that a certain assumption can be made `without loss of generality' (WLOG). In other words, it is claimed that considering what first appears only a special case does nevertheless suffice to prove the general result. Typically the intuitive justification for this is that one can exploit symmetry in the problem. We examine how to formalize such `WLOG' arguments in a mechanical theorem prover. Geometric reasoning is particularly rich in examples and we pay special attention to this area.