ppxscal/embedding_network huggingface dataset:
KissKissBan: a competitive human computation game for image annotation
Authors: Chien-Ju Ho, Tao-Hsuan Chang, Jong-Chuan Lee, Jane Yung-jen Hsu, Kuan-Ta Chen
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

In this paper, we propose a competitive human computation game, KissKissBan (KKB), for image annotation. KKB is different from other human computation games since it integrates both collaborative and competitive elements in the game design. In a KKB game, one player, the blocker, competes with the other two collaborative players, the couples; while the couples try to find consensual descriptions about an image, the blocker's mission is to prevent the couples from reaching consensus. Because of its design, KKB possesses two nice properties over the traditional human computation game. First, since the blocker is encouraged to stop the couples from reaching consensual descriptions, he will try to detect and prevent coalition between the couples; therefore, these efforts naturally form a player-level cheating-proof mechanism. Second, to evade the restrictions set by the blocker, the couples would endeavor to bring up a more diverse set of image annotations. Experiments hosted on Amazon Mechanical Turk and a gameplay survey involving 17 participants have shown that KKB is a fun and efficient game for collecting diverse image annotations.
Getting the most out of social annotations for web page classification
Authors: Arkaitz Zubiaga, Raquel Martínez, Víctor Fresno
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

User-generated annotations on social bookmarking sites can provide interesting and promising metadata for web document management tasks like web page classification. These user-generated annotations include diverse types of information, such as tags and comments. Nonetheless, each kind of annotation has a different nature and popularity level. In this work, we analyze and evaluate the usefulness of each of these social annotations to classify web pages over a taxonomy like that proposed by the Open Directory Project. We compare them separately to the content-based classification, and also combine the different types of data to augment performance. Our experiments show encouraging results with the use of social annotations for this purpose, and we found that combining these metadata with web page content improves even more the classifier's performance.
Learning Sparse Representations Using a Parametric Cauchy Density
Authors: Ling-Zhi Liao
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

For extracting sparse structures in images adaptively, the prior probabilities over the coefficients are modeled with a flexible parametric Cauchy density, which can describe a class of super-Gaussian distributions by varying the steepness and the scale parameters in the density function. The derivatives of the sparseness cost function are continuous at each point of its domain, which is convenient for gradient techniques based learning algorithms, and may provide a better approximation of the volume contribution from the prior. The performance of the flexible prior is demonstrated on a set of natural images. 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
The π-index: a new indicator for assessing scientific impact
Authors: Peter Vinkler
Venue: Journal of Information Science (2009)

There are several simple and sophisticated scientometric indicators generally applied in the literature (e.g. total number of publications and citations, citations per journal paper, relative citedness indexes, Hirsch index, etc.), which may characterize the publications of scientists both qualitatively and quantitatively. The calculation methods generally use data referring to the total set of papers studied. Scientific progress, however, may be attributed primarily to information in the highly cited publications. Therefore, a new indicator (&pi;-index) is suggested for comparative assessment of scientists active in similar subject fields. The &pi;-index is equal to one hundredth of the number of citations obtained to the top square root of the total number of journal papers ('elite set of papers') ranked by the decreasing number of citations. The relation of the &pi;-index to other indexes and its dependence on the field is studied, using data of journal papers of 'highly cited researchers'.
An unsupervised approach for product record normalization across different web sites
Authors: Tak-Lam Wong, Tik-Shun Wong, Wai Lam
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

An unsupervised probabilistic learning framework for normalizing product records across different retailer Web sites is presented. Our framework decomposes the problem into two tasks to achieve the goal. The first task aims at extracting attribute values of products from different sites and normalizing them into appropriate reference attributes. This task is challenging because the set of reference attributes is unknown in advance. Besides, the layout formats are different in different Web sites. The second task is to conduct product record normalization aiming at identifying product records referring to the same reference product based on the results of the first task. We develop a graphical model for the generation of text fragments in Web pages to accomplish the two tasks. One characteristic of our model is that the product attributes to be extracted are not required to be specified in advance and an unlimited number of previously unseen product attributes can be handled. We compare our framework with existing methods. Extensive experiments using over 300 Web pages from over 150 real-world Web sites from three different domains have been conducted demonstrating the effectiveness of our framework.
The Development of Control Unit in Automotive Electric Power Steering System
Authors: Zeng Qun, Huang Juhua
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Electric power steering system (EPS) uses an electric motor to provide essential control to the driver. The EPS system uses variable assist, that provides more assistance as the speed of a vehicle decreases, on the contrary, it provides less assistance. This functionality requires a delicate balance of power and control that has only been available in recent years. The EPS system has been used to replace traditional hydraulic power steering system (HPS), EPS systems are used in high-end and low-end vehicles widely, they are destined to become mainstream among automotive manufacturers soon. In this paper, the control unit of the column assist type EPS system with a DC motor is presented. The hardware circuit, coupled with the appropriate software development, can effectively meet the needs of the electric power steering system.
Engineering Equipment Integrated Fault Diagnosis System Based on Component Technology
Authors: Jian Wang, Jie Li, Xiangyang You, Fang Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

It is difficult to develop the corresponding fault diagnosis system and the software reusability is bad because the engineering equipment type are so many and their performance is diverse. This paper discussed the solution to engineering equipment integrated fault diagnosis system based on component technology, put forward the system model and gave the system frame designment process and working principle. The software was designed based on the three-layer hierarchy. It is easy to reuse and maintain, and the operation of the software is simple. A kind of new theory and method to develop the engineering equipment fault diagnosis system for the future was provided.
Development of an engine crankshaft in a framework of computer-aided innovation
Authors: A. Albers, N. Leon-Rovira, H. Aguayo, T. Maier
Venue: Computers in Industry (2009)

This paper describes the conceptual framework of a general strategy for developing an engine crankshaft based on computer-aided innovation, together with an introduction to the methodologies from which our strategy evolves. It begins with a description of two already popular disciplines, which have their roots in computer science and natural evolution: evolutionary design (ED) and genetic algorithms (GAs). A description of some optimization processes in the field of mechanical design is also presented. We explain our approach to multi-objective optimization and show how tools like the Pareto diagram can help in identifying conflicts. The concepts presented here are exemplified through the optimization of a combustion engine crankshaft. The main premise of the paper is the possibility to optimize the imbalance of a crankshaft using tools developed in this methodology. This study brings together techniques that have their origins in the fields of optimization and new tools for innovation. We reflect on how computers can have an active role in the conceptual design process, and explain how TRIZ (Theory of Inventive Problem Solving) can enrich the discipline of ED. The aim of our research is to extend the search for solutions with GAs and present creative, innovative alternatives to the designer. Similarities between GAs and TRIZ regarding ideality and evolution are presented. We also explain how geometric optimization systems (size, shape, topology and topography) offer hints about the next generation of optimization tools. The role of splines in this context is found to be closely integrated with GAs in enabling this development on a computer-aided design and engineering (CAD&CAE) software interface, and in enabling integration with Java programming language for automation of the development.
Integration of Gait and Side Face for Human Recognition in Video
Authors: Qi-Shen Li, Zhi-Tian Lu, Dan-Dan Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Combined with Two-Direction Image Matrix based Principal Component Analysis (2DIMPCA) and Multiple Discriminant Analysis (MDA), a new approach for human recognition is presented based on integrating information from gait and side face at the feature level. Feature exaction and dimension reducing is done to Gait Energy Image (GEI) and Side Face Image (SFI) respectively by 2DIMPCA, and two original feature vectors are obtained correspondingly, which are integrated into synthetic feature vectors. Then MDA is employed on the synthetic feature vectors of gait and side face to obtain fusion features vectors. Finally, the recognition process is implemented on the fusion feature vectors by nearest neighbor (NN) algorithm. The experimental results on Dataset B of CASIA gait databases show that: 1) the recognition rate of the integration of gait and side face is higher than that of the single feature of gait or side face; 2) the recognition rate of the proposed approach is slightly higher and the recognition time (not including the preprocessing time)is much shorter than that of the method.
Freeze TCPv2: An Enhancement of Freeze TCP for Efficient Handoff in Heterogeneous Networks
Authors: Minu Park, Jaehyung Lee, Jahwan Koo, Hyunseung Choo
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)

The advancement of mobile communications for the last few years has accompanied an increasingly extensive and diverse array of environments for TCP applications, which has led to a host of wireless TCP approaches that may provide more stability and ensure higher performance. In a heterogeneous network, as opposed to conventional wireless networks, a mobile node performs a handoff to another network cells with a different bandwidth and latency. Conventional wireless TCP schemes, however, are not capable of properly addressing sudden changes in round trip time (RTT) and packet loss resulting from handoffs within a heterogeneous network and do experience such problems as the waste of available bandwidth and frequent packet loss. As a solution to these problems, this paper proposes Freeze TCP version 2 (v2), an enhancement of Freeze TCP designed to dynamically obtain the available bandwidth in a new network cell. Comprehensive simulation study is conducted by using a network simulator, ns-2, to compare the proposed scheme to a few other schemes, such as Freeze TCP, DEMO-Vegas, and TCP Vegas, in a heterogeneous network environment with vertical handoffs in terms of throughput per speed of the mobile node and per bit error rate of the wireless link.
Tunnel Operator Training with a Conversational Agent-Assistant
Authors: Eric Buiël, Jan Lubbers, Willem Doesburg, Tijmen Muller
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

A tunnel operator monitors and regulates the flow of traffic inside a tunnel. Tunnel operators need to train in a simulator regularly in order to maintain proficiency in handling incident situations. During quiet working hours, the operator has enough time for training. But generally at that time no instructor or colleague operators are present to provide instruction, advises, and feedback. As a solution, we have designed an automated training system. The system employs a conversational agent which supports the operator's situation assessment tasks. The agent exhibits peer behavior which is unobtrusively directed by didactic strategies. In this paper we present the design, development and application of the agent.
Music and Image Applications of Mobile Phone Serious Game
Authors: Chen Xin
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

This paper is to discuss what the features of common music and image formats are and provide suggestions concerned with applying media formats on mobile phone. Then the paper points out how to apply music and image in industrial and what the advantages and disadvantages concerning with music and image application based on mobile phone in serious games are.
Infima of d.r.e. Degrees
Authors: Jiang Liu, Shengling Wang, Guohua Wu
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Lachlan observed that the infimum of two r.e. degrees considered in the r.e. degres coincides with the one considered in the $\Delta_2^0$ degrees. It is not true anymore for the d.r.e. degrees. Kaddah proved in [7] that there are d.r.e. degrees a, b, c and a 3-r.e. degree x such that a is the infimum of b, c in the d.r.e. degrees, but not in the 3-r.e. degrees, as a < x < b, c. In this paper, we extend Kaddah's result by showing that such a infima difference occurs densely in the r.e. degrees.
Towards translingual information access using portable information extraction
Authors: Michael White, Claire Cardie, Chung-hye Han, Nari Kim, Benoit Lavoie, Martha Palmer, Owen Rambow, Juntae Yoon
Venue: ANLP-NAACL 2000 Workshop: Embedded Machine Translation Systems (2000)

We report on a small study undertaken to demonstrate the feasibility of combining portable information extraction with MT in order to support translingual information access. After describing the proposed system's usage scenario and system design, we describe our investigation of transferring information extraction techniques developed for English to Korean. We conclude with a brief discussion of related MT issues we plan to investigate in future work.
Measuring the Survivability of Object-Oriented Software
Authors: Jueliang Hu, Zuohua Ding, Jing Liu, Ling Yin
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

In this paper, We present a method to measure the survivability of an object-oriented software in design phase. Each component is responsible for this measuring and the relations between components are based on the communication type. Each component can be characterized by a composite Petri net which combines the features of Statechart and Object Diagram. A fuzzy number is introduced to this net to represent uncertain elements that might affect the survivability.Survival Possibility Theory has been used to produce survivability measure function for each component. A survivability measure index is defined for the system, and we proved that this index is monotonic.
Brief paper: Multi-frequency disturbance rejection via blending control technique for hard disk drives
Authors: Chunling Du, Lihua Xie, F. L. Lewis, Youyi Wang
Venue: Automatica (Journal of IFAC) (2009)

This paper is concerned with the rejection of multiple narrowband disturbances in hard disk drives (HDDs). Inspired by a control blending idea, the multi-frequency disturbance rejection is formulated as a blending control problem. Each disturbance rejection is accomplished by using the H"2 optimal control method. Based on all H"2 optimal controllers, the blending technique is applied to yield a single controller which is capable of achieving rejection of all disturbances. Rejections of two and three disturbances for a 1.8-inch HDD VCM actuator are taken as application examples in the paper. Simulation and experimental results show that the ultimate controller results in a simultaneous attenuation of disturbances with frequencies higher or lower than the closed-loop system bandwidth. Moreover, the method turns out to be able to lift phase and thus prevent phase margin loss when it is used to deal with disturbances near bandwidth.
Directly Addressable Variable-Length Codes
Authors: Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sampling method. The technique is practical and has many applications to the representation of ordered sets, sparse bitmaps, partial sums, and compressed data structures for suffix trees, arrays, and inverted indexes, to name just a few. We show experimentally that the technique offers a competitive alternative to other data structures that handle this problem.
Cultural Differences in Using Facial Parts as Cues to Recognize Emotions in Avatars
Authors: Tomoko Koda, Zsofia Ruttkay
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Avatars are frequently used in virtual worlds and online games to convey emotions across cultures. However, our previous study suggested there are cultural differences in recognizing avatar's facial expressions [1]. Yuki et al.'s study using emoticons and photorealistic human face images suggests Americans tend to interpret emotions based on the mouth, while Japanese tend to focus on the eyes [2]. Inspired by Yuki's study, this study uses cartoonish avatar faces to find cultural differences in using facial parts as cues to recognize avatar emotions. This paper reports the preliminary result of an experiment conducted between Japanese and European subjects.
Semantic role labeling for coreference resolution
Authors: Simone Paolo Ponzetto, Michael Strube
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

Extending a machine learning based coreference resolution system with a feature capturing automatically generated information about semantic roles improves its performance.
The Onion-Tree: Quick Indexing of Complex Data in the Main Memory
Authors: Caio César Carélo, Ives Renê Pola, Ricardo Rodrigues Ciferri, Agma Juci Traina, Caetano Traina-Jr., Cristina Dutra Aguiar Ciferri
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Searching for elements in a dataset that are similar to a given query element is a core problem in applications that use complex data, and has been carried out aided by a metric access method (MAM). A growing number of these applications require indices that can be built faster and for several times, in addition to providing smaller response times for similarity queries. Besides, the increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper, we propose the Onion-tree, a new and robust dynamic memory-based MAM that performs a hierarchical division of the metric space into disjoint subspaces. The Onion-tree is very compact, requiring a small fraction of the main memory (e.g., at most 4.8%). Comparisons of the Onion-tree, a memory-based version of the Slim-tree, and the memory-based MM-tree showed that the Onion-tree always produced the smallest elapsed time to build the index. Our experiments also showed that the Onion-tree produced the best query performance results, followed by the MM-tree, which in turn outperformed the Slim-tree. With regard to the MM-tree, the Onion-tree provided a reduction in the number of distance calculations that ranged from 1% to 11% in range queries and from 16% up to 64% in k-NN queries. The Onion-tree also significantly improved the required elapsed time, which ranged from 12% to 39% in range query processing and from 40% up to 70% in k-NN query processing, as compared to the MM-tree, its closest competitor. The Onion-tree source code is available at http://gbd.dc.ufscar.br/download/Onion-tree .
Research on Time Reliability of Container Liner Shipping Network
Authors: Peijian Wu, Guishi Deng, Wei Tian
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A calculation model for time reliability of container liner shipping network was made based on existing research on time reliability about other transportation networks and own character of container liner shipping networks. Simulation method was used to improve the efficiency of calculation. And simulation’s validity was optimized through modifying simulation times, so that the error of simulation can be controlled in needful range. Finally, the American lines shipping network of COSCON was taken as an example to illustrate the use of the proposed method. The result demonstrate it practicality and effectiveness.
Irregular Graph Pyramids and Representative Cocycles of Cohomology Generators
Authors: Rocio Gonzalez-Diaz, Adrian Ion, Mabel Iglesias-Ham, Walter G. Kropatsch
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns `quantities' to the chains used in homology to characterize holes of any dimension. Graph pyramids can be used to describe subdivisions of the same object at multiple levels of detail. This paper presents cohomology in the context of structural pattern recognition and introduces an algorithm to efficiently compute representative cocycles (the basic elements of cohomology) in 2D using a graph pyramid. Extension to nD and application in the context of pattern recognition are discussed.