ppxscal/embedding_network huggingface dataset:
Design of Interactive Emotional Sound Edutainment System
Authors: Myunjin Park, Kyujung Kim
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

This paper introduces an emotional sound edutainment system for children to learn basic musical composition called as musical education sound interactive game (MESIG) employing a new type of user interface. Developed interactive game interface provides children to enjoy the game, so that they learn how to compose musical notes with touching the tangible objectives instead of using ordinary input devices. This way on experiencing and playing the computer games has been evolved to use the body and hands' movement so as to interact with the game in virtual environment, which brings out interest for the children and their learning capability becomes more effectively improved. This system introduced in this paper requires a single camera and carries out skin color model tracking function to detect hand gesture as input device for playing the game. This computer vision technique based on image processing makes possible to operate an expressive interactive musical education system. To exploit the effectiveness, evaluation and analysis works are accomplished upon the realization of sound edutainment game.
Simplification of Polygonal Models for Distributed Visualization
Authors: Hessah Alsaaran, Muhammad Hussain
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Currently, polygonal models are widely used for the representation and visualization of 3D information. The sheer sizes of polygonal models and the limited internet bandwidth put a threat to their visualization in a distributed environment. Streaming mesh, which consists of a simplified model and refinement patches, is used to overcome this problem. Simplification method and the data structures for refinement patches play crucial role in this approach. By employing distance measure and normal field deviation, we propose a new error measure to faithfully simplify polygonal models, and introduce more efficient data structures for refinement patches. We implement the streaming mesh using Java. Comparison with the state-of-the-art methods reveals that the proposed method results in better quality LODs in some cases, and the new data structures for refinement patches accelerate the refinement process.
The Budgeted Unique Coverage Problem and Color-Coding
Authors: Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

We show, by a non-trivial application of the color-coding method of Alon et al.[2], that Budgeted Unique Coverage (a variant of Set Cover) is fixed-parameter tractable, answering an open problem posed in [13]. We also give improved fixed-parameter tractable algorithms for two special cases of Budgeted Unique Coverage: Unique Coverage (the unweighted version) and Budgeted Max Cut.To derandomize our algorithms we use an interesting variation of k-perfect hash families known as (k,s)-hash families which were studied by Alon et al.[1] in the context of a class of codes called parent identifying codes [3]. In this setting, for every s-element subset S of the universe, and every k-element subset X of S, there exists a function that maps X injectively and maps the remaining elements of S into a different range.We give several bounds on the size of (k,s)-hash families. We believe that our application of color-coding may be used for other problems and that this is the first application of (k,s)-hash families to a problem outside the domain of coding theory.
Topic Discovery in Research Literature Based on Non-negative Matrix Factorization and Testor Theory
Authors: Fang Li, Qunxiong Zhu, Xiaoyong Lin
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The paper proposes a new way of comprising the Non-negative matrix factorization (NMF) and Testor theory to make topic discovery. NMF method is good at dealing with high dimensional documents and clustering, while Testor theory is used to find the topic of each cluster. By an example of ten abstracts of Chinese science literature from magazines relative to environmental science, the whole process is described in detail. In the end, a case study about automatic classification of a conference proceeding (in Chinese) is given. The result shows the effectiveness of the whole method.
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
Authors: Martin Rötteler
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular exponentiation function. In a generalization of this idea, quantum Fourier sampling can be used to discover hidden subgroup structures of some functions much more efficiently than it is possible classically. Another problem for which the Fourier transform has been recruited successfully on a quantum computer is the hidden shift problem. Quantum algorithms for hidden shift problems usually have a slightly different flavor from hidden subgroup algorithms, as they use the Fourier transform to perform a correlation with a given reference function, instead of sampling from the Fourier spectrum directly. In this paper we show that hidden shifts can be extracted efficiently from Boolean functions that are quadratic forms. We also show how to identify an unknown quadratic form on n variables using a linear number of queries, in contrast to the classical case were this takes ¿(n 2) many queries to a black box. What is more, we show that our quantum algorithm is robust in the sense that it can also infer the shift if the function is close to a quadratic, where we consider a Boolean function to be close to a quadratic if it has a large Gowers U 3 norm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
CompTIA Security+ SYO-201 Cert Flash Cards Online, Retail Packaged Version, 1st edition
Authors: Diane Barrett
Venue:  (2009)

CompTIA Security+ Cert Flash Cards Online SYO-201 Diane Barrett The CompTIA Security+ Cert Flash Cards Online provides a concise review of all objectives on the Security+ SYO-201 exam. This online exam preparation tool consists of a custom flash card application loaded with 300 total questions that test your skills and enhance retention of exam topics. Questions are organized by exam objective, allowing you to focus your study on selected topics. You can choose to view cards in order or at random, and you can create custom sets from the entire bank of cards. The engine provides you with the ability to mark each question correct or incorrect and provides a detailed score report by category at the end of the exam. You can even write notes on each question and then get a printable PDF of all your notes aligned to the relevant questions. These robust features make this a truly unique learning tool: . Test your knowledge by entering your own answers . Grade your answers against the correct answer . Create custom question sets . View detailed score reports . Enter and print notes for each question . Use on any device that has a web browser and Internet connection CompTIA Security+ Cert Flash Cards Online is an online, internet-based service, available in both desktop and mobile device formats, allowing you to test yourself at home, at work, or on the go. System Requirements: Web browser and Internet connection www.informit.com certflashcardsonline.com US: $24.99 / CAN: $29.99 The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Design of Multi-threaded Shader Processor with Dual-Phase Pipeline Architecture
Authors: Kwang-Yeob Lee, Tae-Ryoung Park, Jae-Chang Kwak, Yong-Seo Koo
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

In this paper, Dual-Phase pipeline architecture and variable length instructions of a shader processor are proposed. The Dual-Phase pipeline architecture achieves a performance of dual core using a single core, and a parallelism of GP-GPU to accelerate graphic operations. For simplifying hardware, the register optimization is proposed. The variable length instructions are designed for efficient executions with less memory. Various pipeline hazards are resolved by a multi-threaded method. The proposed processor supports OpenGL ES 2.0. It has a size of 0.13Mlogic and shows the performance of 16.6MVertices/s, and 33.3MPixels/s
An OWL-Based Knowledge Model for Combined-Process-and-Location Aware Service
Authors: Gunhee Kim, Manchul Han, Jukyung Park, Hyunchul Park, Sehyung Park, Laehyun Kim, Sungdo Ha
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper presents a knowledge model for spatiotemporal context awareness. The knowledge model is designed to understand user goals and to guide users who perform complicated tasks involving several routes, such as tasks at a hospital. An information system should be able to consider both the location and process context to provide relevant guidance regarding tasks, their location, and their process, as location and process information are collaboratively associated. A service that is both process- and- location-aware is considered, and a knowledge model that represents the semantics of the proposed process- and- location-aware service is given.
Coverability Problems for Jumping Petri Nets
Authors: Cristian Vidrascu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable jumping Petri nets.Also, as future work, we discuss some ideas for parallel implementations of the decision procedures for these problems.
A New Triangulation-Based Method for Disparity Estimation in Image Sequences
Authors: Dimitri Bulatov, Peter Wernerus, Stefan Lang
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

We give a simple and efficient algorithm for approximating computation of disparities in a pair of rectified frames of an image sequence. The algorithm consists of rendering a sparse set of correspondences, which are triangulated, expanded and corrected in the areas of occlusions and homogeneous texture by a color distribution algorithm. The obtained approximations of the disparity maps are refined by a semi-global algorithm. The algorithm was tested for three data sets with rather different data quality. The results of the performance of our method are presented and areas of applications and future research are outlined.
Note: Intensity standardization simplifies brain MR image segmentation
Authors: Ying Zhuge, Jayaram K. Udupa
Venue: Computer Vision and Image Understanding (2009)

Typically, brain MR images present significant intensity variation across patients and scanners. Consequently, training a classifier on a set of images and using it subsequently for brain segmentation may yield poor results. Adaptive iterative methods usually need to be employed to account for the variations of the particular scan. These methods are complicated, difficult to implement and often involve significant computational costs. In this paper, a simple, non-iterative method is proposed for brain MR image segmentation. Two preprocessing techniques, namely intensity-inhomogeneity-correction, and more importantly MR image intensity standardization, used prior to segmentation, play a vital role in making the MR image intensities have a tissue-specific numeric meaning, which leads us to a very simple brain tissue segmentation strategy. Vectorial scale-based fuzzy connectedness and certain morphological operations are utilized first to generate the brain intracranial mask. The fuzzy membership value of each voxel within the intracranial mask for each brain tissue is then estimated. Finally, a maximum likelihood criterion with spatial constraints taken into account is utilized in classifying all voxels in the intracranial mask into different brain tissue groups. A set of inhomogeneity corrected and intensity standardized images is utilized as a training data set. We introduce two methods to estimate fuzzy membership values. In the first method, called SMG (for simple membership based on a gaussian model), the fuzzy membership value is estimated by fitting a multivariate Gaussian model to the intensity distribution of each brain tissue whose mean intensity vector and covariance matrix are estimated and fixed from the training data sets. The second method, called SMH (for simple membership based on a histogram), estimates fuzzy membership value directly via the intensity distribution of each brain tissue obtained from the training data sets. We present several studies to evaluate the performance of these two methods based on 10 clinical MR images of normal subjects and 10 clinical MR images of Multiple Sclerosis (MS) patients. A quantitative comparison indicates that both methods have overall better accuracy than the k-nearest neighbors (kNN) method, and have much better efficiency than the Finite Mixture (FM) model-based Expectation-Maximization (EM) method. Accuracy is similar for our methods and EM method for the normal subject data sets, but much better for our methods for the patient data sets.
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus
Authors: Alberto Carraro, Antonino Salibra
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

A longstanding open problem is whether there exists a model of the untyped lambda calculus in the category CPO of complete partial orderings and Scott continuous functions, whose theory is exactly the least lambda-theory lambda-beta or the least extensional lambda-theory lambda-beta-eta. In this paper we analyze the class of reflexive Scott domains, the models of lambda-calculus living in the category of Scott domains (a full subcategory of CPO). The following are the main results of the paper: (i) Extensional reflexive Scott domains are not complete for the beta-eta-calculus, i.e., there are equations not in lambda-beta-eta which hold in all extensional reflexive Scott domains.(ii) The order theory of an extensional reflexive Scott domain is never recursively enumerable. These results have been obtained by isolating among the reflexive Scott domains a class of webbed models arising from Scott's information systems, called iweb-models. The class of iweb-models includes all extensional reflexive Scott domains, all preordered coherent models and all filter models living in CPO. Based on a fine-grained study of an ``effective'' version of Scott's information systems, we have shown that there are equations not in lambda-beta (resp. lambda-beta-eta) which hold in all (extensional) iweb-models.
Multi-hierarchy Information Visualization Research Based on Three-Dimensional Display of Products System
Authors: Zhou Hui, Hou Wenjun
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Currently, the information on the Web is countless, which is throughout tens of thousands of Web sites all over the world. And the Web site intertwined with each other through hyperlinks between documents. Regardless of such a big scale of the Web information, it will continue expanding. How to access to the information on the Web easily has become a problem needed to be solved urgently. However, the way of accessing to the information is far from satisfactory. Information visualization will play an increasingly important role in helping people understand the structure of the information space, finding information needed quickly and preventing the lost in the information ocean effectively. The paper used the Multi-hierarchy information visualization on a specific e-commerce web site, and established a three-dimensional products display system. According to the analysis of users on business web site, the establishment of a representative user model was established. In accordance with the user model, system function was analyzed and integrated, and task analysis was hierarchical. Based on the user's demand, the paper confirmed the content and the way of the showing. Finally the paper designed the system according to the information structure, interaction and information visualization.
A Method of 3-D object Recognition Based on Digital Holography
Authors: Zhen Huang, Guodong Liu, Zhong Ren, Lvming Zeng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In this paper a method of three-dimensional object recognition based on digital holography is presented. Firstly,the holograms of the target and reference objects are generated with the digital holography technique. Next, the reconstructed images of the holograms are inputted into the joint transform correlator and modified by the subtraction of the zero-order diffraction from the joint power spectrum, and then the 3-D object recognition can be achieved. After applying an improved Mexican-hat wavelet to extract the edge characteristics and enhance the image of the power spectrum, sharper correlation peak can be obtained. The experimental results show that this method can improve the 3-D object recognition ability and reliability effectively.
An Approach to Glove-Based Gesture Recognition
Authors: Farid Parvini, Dennis Mcleod, Cyrus Shahabi, Bahareh Navai, Baharak Zali, Shahram Ghandeharizadeh
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Nowadays, computer interaction is mostly done using dedicated devices. But gestures are an easy mean of expression between humans that could be used to communicate with computers in a more natural manner. Most of the current research on hand gesture recognition for Human-Computer Interaction rely on either the Neural Networks or Hidden Markov Models (HMMs). In this paper, we compare different approaches for gesture recognition and highlight the major advantages of each. We show that gestures recognition based on the Bio-mechanical characteristic of the hand provides an intuitive approach which provides more accuracy and less complexity.
The movement patterns and the experiential components of virtual environments
Authors: Heikki Särkelä, Jari Takatalo, Patrick May, Mikko Laakso, Göte Nyman
Venue: International Journal of Human-Computer Studies (2009)

Human movement in virtual environments (VEs) is a largely unstudied area, and there are no well-established methods of measuring it in VEs. Consequently, it is unclear how movement affects the experiential side of VEs. We introduce a novel method of measuring and modelling human movement. A specific information entropy-based modelling method enabled us to identify different movement patterns and analyse the experiential components related to them. The data was collected by registering the movement patterns of 68 participants who were in a virtual house doing a search task. The experiential side of the VE was measured with the Experimental Virtual Environment Questionnaire (EVEQ). Four movement patterns were identified. In addition, fluent movement in VEs was related to a high sense of presence. Moreover, the participants who moved fluently in the environment assessed their skills high. The results show how movement is related the way in which people experience the VE. The movement analysis method introduced here is applicable to other related research areas as well.
Low Technology Systems for Rural High Turbid and Eutrophic Water Treatment in Shanghai: Constructed Wetlands
Authors: Ji Bing, Chen Jihua
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Low technology systems constructed wetlands are adopted to treat the rural high turbid and eutrophic water in Chongming Island of Shanghai, China. The constructed wetlands are integrated by combined with oxidation pond and constructed wetland. Ecological fibre media reinforced the functions of microorganism to form the mutualism relationship between algae and bacteria in the pond. Ceramic padding particles with specific surface area in constructed wetlands were liable to the microbial biofilm formation and suspended particles absorption. As a result, the removal rate of COD, TN, TP, turbidity and phytoplankton were good. And the average removals were 50.5%，38.3%，51.5%，88.6% and 31.6%, respectively. The removal rate of TDP and NH4+-N were bad. And the average removals were just 15.4% and 16.5%.The treatment efficiency was changed from season to season. And the best time was summer.
A Network Anomaly Detection Method Based on Relative Entropy Theory
Authors: Ya-ling Zhang, Zhao-guo Han, Jiao-xia Ren
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Network anomaly detection technology has been the research hotspot in intrusion detection (ID) field for many years. However, some issues like high false alarm rate, low detection rate and limited types of attacks which can be detected are still in existence so its wide applications in practice has been restricted. A new network anomaly detection method has been proposed in this paper. The main idea of the method is network traffic is analyzed and estimated by using Relative Entropy Theory (RET), and a network anomaly detection model based on RET is designed as well. The numerical value of relative entropy is used to alleviate the inherent contradictions between improving detection rate and reducing false alarm rate, which is more precise and can effectively reduce the error of estimation. On the 1999 DARPA/Lincoln Laboratory IDS evaluation data set, the detection results showed that the method can reach a higher detection rate at the premise of low false alarm rate.
Study on Growth Model of Sabina Vulgaris
Authors: Zhen-jie Jiang, Zhao-feng Geng, Wen-hua Zhou
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Many experiments have verified that Sabina vulgaris shrubs had distinguished advantage in anti- drought, but a lot of past works were primarily focused on its eco-physiological characteristics, with its growth model almost never explored. In this work, the primary model of S. vulgaris shrubs is discussed and improved based on the dual-scale automaton model with the data from experiments. The diversification on its internode lengths, branching angles and curvature of branches in different growth cycles is also discussed. This study introduces a new method from agro-ecological perspective. The dynamic model describes the growth of S. vulgaris more accurately in natural environment, and visualization can be implemented by using C++ and OpenGL. The result provides a feasible study on the dynamics of S. vulgaris growth, architecture and geometry in various drought environments.