ppxscal/embedding_network huggingface dataset:
Structure adaptation of hierarchical knowledge-based classifiers
Authors: Waratt Rattasiri, Saman K. Halgamuge, Nalin Wickramarachchi
Venue: Neural Computing and Applications (2009)

This paper introduces a new method to identify the qualified rule-relevant nodes to construct hierarchical neuro-fuzzy systems (HNFSs). After learning, the proposed method analyzes the entire history of activities and behaviors of all rule nodes, which reflects their levels of involvement or contribution during the process. The less qualified rule-relevant nodes can then be identified and removed, reducing the size and complexity of the HNFS. Upon the repetitive learning process, the method may be repetitively applied until a satisfactory result is obtained, simultaneously improving the performance and reducing the size and complexity. Incorporated with the method is a new HNFS architecture which addresses both the scalability problem experienced in rule based systems and the restriction of the &#x201c;overcrowded defuzzification&#x201d; problem found in hierarchical designs. In order to verify the performance, the proposed method has been successfully tested against five well-known classification problems whose results are provided and then discussed in the concluding remarks.
A meta-programming technique for debugging answer-set programs
Authors: Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs. In particular, providing tools for debugging answer-set programs has recently been identified as a crucial prerequisite for a wider acceptance of ASP. In this paper, we introduce a meta-programming technique for debugging in ASP. The basic question we address is why interpretations expected to be answer sets are not answer sets of the program to debug. We thus deal with finding semantical errors of programs. The explanations provided by our method are based on an intuitive scheme of errors that relies on a recent characterisation of the answer-set semantics. Furthermore, as we are using a meta-programming technique, debugging queries are expressed in terms of answer-set programs themselves, which has several benefits: For one, we can directly use ASP solvers for processing debugging queries. Indeed, our technique can easily be implemented, and we devised a corresponding prototype debugging system. Also, our approach respects the declarative nature of ASP, and the capabilities of the system can easily be extended to incorporate differing debugging features.
Defeating Cross-Site Request Forgery Attacks with Browser-Enforced Authenticity Protection
Authors: Ziqing Mao, Ninghui Li, Ian Molloy
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

A cross site request forgery (CSRF) attack occurs when a user's web browser is instructed by a malicious webpage to send a request to a vulnerable web site, resulting in the vulnerable web site performing actions not intended by the user. CSRF vulnerabilities are very common, and consequences of such attacks are most serious with financial websites. We recognize that CSRF attacks are an example of the confused deputy problem, in which the browser is viewed by websites as the deputy of the user, but may be tricked into sending requests that violate the user's intention. We propose Browser-Enforced Authenticity Protection (BEAP), a browser-based mechanism to defend against CSRF attacks. BEAP infers whether a request reflects the user's intention and whether an authentication token is sensitive, and strips sensitive authentication tokens from any request that may not reflect the user's intention. The inference is based on the information about the request (e.g., how the request is triggered and crafted) and heuristics derived from analyzing real-world web applications. We have implemented BEAP as a Firefox browser extension, and show that BEAP can effectively defend against the CSRF attacks and does not break the existing web applications.
Word semantics is processed even without attentional effort
Authors: Kristiina Relander, Pia Rämä, Teija Kujala
Venue: Journal of Cognitive Neuroscience (2009)

We examined the attentional modulation of semantic priming and the N400 effect for spoken words. The aim was to find out how the semantics of spoken language is processed when attention is directed to another modality (passive task), to the phonetics of spoken words (phonological task), or to the semantics of spoken words (word task). Equally strong behavioral priming effects were obtained in the phonological and the word tasks. A significant N400 effect was found in all tasks. The effect was stronger in the word and the phonological tasks than in the passive task, but there was no difference in the magnitude of the effect between the phonological and the word tasks. The latency of the N400 effect did not differ between the tasks. Although the N400 effect had a centroparietal maximum in the phonological and the word tasks, it was largest at the parietal recording sites in the passive task. The effect was more pronounced at the left than right recording sites in the phonological task, but there was no laterality effect in the other tasks. The N400 effect in the passive task indicates that semantic priming occurs even when spoken words are not actively attended. However, stronger N400 effect in the phonological and the word tasks than in the passive task suggests that controlled processes modulate the N400 effect. The finding that there were no differences in the N400 effect between the phonological and the word tasks indicates that the semantics of attended spoken words is processed regardless of whether semantic processing is relevant for task performance.
Proceedings of the 15th annual international conference on Mobile computing and networking
Venue: International Conference on Mobile Computing and Networking (2009)

Welcome to Beijing and to ACM MobiCom 2009, the 15th Annual Conference on Mobile Computing and Networking. MobiCom has become the premier venue for top quality research in mobile computing and networking, and the entire organizing committee has attempted to assemble for you a top-notch technical program consisting of papers, posters, demos, keynote lectures and a panel on cutting-edge topics in wireless networking and mobile computing. We hope you have a stimulating, enjoyable, and fruitful experience at the conference! The centerpiece of the conference, the technical program, consists, as in past years, a thought-provoking mixture of systems and theory papers. These span the gamut of topics in wireless networking, touching upon mobile phones, mesh networks, body area networks, infrastructure-based wireless networks, and on-chip wireless communication! The technical program consists of 30 papers, selected from 282 submissions received from 30 countries worldwide, after a thorough two-stage review process in which we received a total of 956 reviews, or about 3.4 reviews on average per paper! At the program committee meeting in Los Angeles, we discussed 65 papers before converging on the final program. There were two features of the review process that deserve mention. First, we selected an associate technical program committee consisting of junior academic researchers, as well as senior researchers from industry and government labs. They brought valuable perspective to the second-stage of the review process. Second, a group of researchers in Asia organized a shadow technical program committee. The shadow PC process was designed to expose junior researchers in Asia to submissions to a top notch conference. Its process was completely decoupled from the main technical program, and did not influence the selection of the papers for the technical program. Paper authors were given the option of choosing to have their papers reviewed by the shadow PC, and about half the submitted papers elected to do so. If the technical program is a success, it will be entirely due to the efforts of a very energetic group of researchers who formed the main technical program committee (TPC)! Each TPC member reviewed nearly 25 papers, participated in constructive electronic discussions before the program committee meeting, and attended or called into the TPC meeting from different parts of the globe. The meeting itself was infused with vigorous debate and thoughtful discussion, and remained lively till the very end, an indication of the TPC's dedication to upholding MobiCom's reputation as the premier mobile computing and networking conference! Coordinating the logistics of a TPC meeting for a top-tier conference is a difficult endeavor, and we could not have done it without the help of Gertrude Lewis and Justin Collins.
Integrating natural language, knowledge representation and reasoning, and analogical processing to learn by reading
Authors: Kenneth D. Forbus, Christopher Riesbeck, Lawrence Birnbaum, Kevin Livingston, Abhishek Sharma, Leo Ureel
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Learning by reading requires integrating several strands of AI research. We describe a prototype system, Learning Reader, which combines natural language processing, a large-scale knowledge base, and analogical processing to learn by reading simplified language texts. We outline the architecture of Learning Reader and some of system-level results, then explain how these results arise from the components. Specifically, we describe the design, implementation, and performance characteristics of a natural language understanding model (DMAP) that is tightly coupled to a knowledge base three orders of magnitude larger than previous attempts. We show that knowing the kinds of questions being asked and what might be learned can help provide more relevant, efficient reasoning. Finally, we show that analogical processing provides a means of generating useful new questions and conjectures when the system ruminates off-line about what it has read.
Geometrical Features Based Approach for the Classification and Recognition of Handwritten Characters
Authors: Saima Farhan, Muhammad Abuzar Fahiem, Huma Tauseef
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

The recognition of handwritten characters is a vital research area in the domain of text segmentation. Various approaches have evolved in the past and intensive research is still being carried out, at present. In this paper, we have presented a geometrical feature based approach to recognize handwritten characters. The strength of our approach is in the comprehensive classification scheme due to which, we have been able to achieve a recognition rate of 95.8%, better than the previous approaches.
Automatic semantic role labeling
Authors: Scott Wen-tau Yih, Kristina Toutanova
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Tutorial Abstracts on XX (2006)

The goal of semantic role labeling is to map sentences to domain-independent semantic representations, which abstract away from syntactic structure and are important for deep NLP tasks such as question answering, textual entailment, and complex information extraction. Semantic role labeling has recently received significant interest in the natural language processing community. In this tutorial, we will first describe the problem and history of semantic role labeling, and introduce existing corpora and other related tasks. Next, we will provide a detailed survey of state-of-the-art machine learning approaches to building a semantic role labeling system. Finally, we will conclude the tutorial by discussing directions for improving semantic role labeling systems and their application to other natural language problems.
Optimization in coreference resolution is not needed: a nearly-optimal algorithm with intensional constraints
Authors: Manfred Klenner, Étienne Ailloud
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classifier (used as reliable clustering seed pairs). In order to find out whether ILP optimization, which is NP-complete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient Zero-One algorithm with the optimal solution. The first consistent solution, which often can be found very fast, is already as good as the optimal solution; optimization is thus not needed.
A Data Acquisition System of Surface Roughness Based on USB
Authors: Han Jinhong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper introduced a data acquisition system of surface roughness, which was based on Linear Variable Differential Transformer(LVDT) and Universal Serial Bus (USB). USB was widely applied to the communication between Personal Computer (PC) and Micro Control Unit (MCU). AT89C52 and the specialized USB interface chip PDIUSBD12 was expatiated in this paper. The design of hardware, driver software and application software were also introduced. In that procedure the USB device was handled as files and the high speed bulk transfer of data could be realized. The method made use of developing USB serial communication, had high communication rate and high reliability, and satisfied the real-time demand of data acquisition system’s very well. 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
Finding ontological correspondences for a domain-independent natural language dialog agent
Authors: Hamid Haidarian Shahri, Donald Perlis
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

Currently, our interactions with devices are constrained, as we need to program/configure devices, primarily through some artificial interface, instead of interacting through a dialog agent. This limitation in human-device interactions is a major obstacle to the integration of devices (e.g. PDA, GPS) in our daily activities. Considering the numerous advantages of using a dialog agent for communicating with devices, we are building a cognitive dialog agent that facilitates this communication. The agent has semantic knowledge about concepts and available commands ofa device, and this knowledge is represented using an ontology. The agent gathers the necessary information, for execution of commands, by engaging users in a meaningful communication. Finally, the commands are sent to the device for execution. Consequently, the agent relieves users from the burden of acquiring the knowledge, which is necessary for operating the device. In order for the agent to process the human utterance, and make sense of the concepts that the human relates to, it requires a mapping between the concepts that the human is using, and the concepts that are understandable for the device. In this paper, we provide a novel algorithm to determine these matching concepts. The algorithm exploits various similarity metrics to disambiguate and match concepts. We formally define these metrics, and analyze the time complexity of computing the metrics, algorithmically. In addition, the effectiveness and scalability of the metrics are evaluated empirically, on real-world ontologies, through different experiments. In essence, the dialog agent interweaves the individual threads of meaning between human and device, using the ontology mapping algorithm, and prevents miscommunication between them.
Look-back and look-ahead in the conversion of Hidden Markov Models into finite state transducers
Authors: André Kempe
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This paper describes the conversion of a Hidden Markov Model into a finite state transducer that closely approximates the behavior of the stochastic model. In some cases the transducer is equivalent to the HMM. This conversion is especially advantageous for part-of-speech tagging because the resulting transducer can be composed with other transducers that encode correction rules for the most frequent tagging errors. The speed of tagging is also improved. The described methods have been implemented and successfully tested.
Study on Efficiency of Risk Management for Information Security Based on Transaction
Authors: Zhigang Lu, Xiaozhen Wang, Baoxu Liu, Rongsheng Xu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

This paper analyzes the situation and likely problems of the current risk management through affirming the current risk, combined with analysis of final financing accounts, and then puts forward a systematic and normative differentiating model for the efficiency of risk management to points out the amount which is the most effective to invest in risk management of information security. Then the paper points out the link between the investment of risk management and the loss of security incidents through further analyzing based on transaction.
Design of an Interactive Table for Mixed-Reality Learning Environments
Authors: Mu-Chun Su, Gwo-Dong Chen, Yi-Shan Tsai, Ren-Hao Yao, Chung-Kuang Chou, Yohannes Budiono Jinawi, De-Yuan Huang, Yi-Zeng Hsieh, Shih-Chieh Lin
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

This paper presents a prototype of a low-cost Mixed Reality Interactive Table (MRIT) which is equipped with a Web camera, a projector, animal-appearance robots, gloves with accelerator sensors, and a computer. The motivation of the development of the MRIT is to provide a low-cost learning environment where students can learn effectively when they play an educational software game on the interactive table via embodied interactions. We hope the MRIT can be a good entry point for studying how educational software games incorporated with an interactive table and embodied interactions are able to promote students' interest and improve students' engagement.
The Gestural Input System for Living Room Digital Devices
Authors: Wen-Shan Chang, Fong-Gong Wu
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The focus of this research is to help users learn gesture symbols through semantic perception. With the semantic perception as the basis, qualitative and quantitative analysis will be conducted to analyze digital homes --- as exemplified by the gesture symbols in the 3D space of the living room in order to deduce the design principles of different perceptive semantics. Samples of the case studies will be constructed in accordance with this design principle. Inspections and assessments will also be conducted to demonstrate the accuracy and feasibility of this principle. The findings in this research shall serve as reference for the design of interfaces and gesture recognition systems in the comprehensive surrounding. It shall also serve as the design standard for relevant future designs that involve semantic perception and design gesture symbols.
Cutting Chatter Monitoring Using Hidden Markov Models
Authors: Zhang Chunliang, Yue Xia, Zhang Xuewen
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Monitoring of cutting chatter in metal cutting process is a very important economical consideration in automated manufacturing. However, the metal cutting process is a complicated process. The cutting chatter is still an unsolved problem in metal cutting process. In this paper, a new method for cutting chatter monitoring is developed. First, it uses fast Fourier transform (FFT) to process the monitoring signals of the cutting process and to extract the feature vectors. Then, it uses the Hidden Markov Model (HMM) as the classifiers to recognize the cutting chatter. The experimental results show that the proposed method is feasible and effective.
Multimodal Image Retrieval Based on Annotation Keywords and Visual Content
Authors: Haiyu Song, Xiongfei Li, Pengjie Wang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Currently, most image retrieval systems use either purely visual features or textual metadata associated with images. They have advantages and disadvantages respectively. To overcome their drawbacks and improve the performance without sacrificing the efficiency, we propose the stepwise refinement multimodal image retrieval scheme based on annotation keywords and visual content, which can benefit from the strength of text- and content-based retrieval. The system starts query triggered by some keywords, and further refines the retrieval result based on blobs and regions information. The first step is to complete semantic filtering with weakening visual content, and the second step mainly considers existence and dependence of blobs, and the last step is to quantify the similarity in distribution and layout of visual content between the query image and candidate images by considering the weights of regions. The experiments show that proposed system outperforms the traditional image retrieval systems.
Performance of Orthogonal Space-Time Block Codes over Correlated Rayleigh Channels
Authors: Jie Zhou, Yun Li, HongTao Chen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In this paper, using the equivalent single-input single-out (SISO) model, we derive the exact symbol error rate (SER) and bit error rate (BER) of orthogonal space-time block codes (OSTBCs) with multiple modulations over flat uncorrelated and correlated Rayleigh fading channels. We provide the impact of antenna correlation on the performance of OSTBCs. The results showed that the symbol error rate decreases while the number of transmit or receiver antennas increases. When the number of receiving antennas is fixed, the performance of OSTBCs is improved with the increasing number of transmitting antennas, but the more the number of transmitting antennas, the less the improvement. With the increase of the correlation coefficient, the performance of coding is decreasing.
Distributed localization, tracking, and automatic personal identification: a solution based on a wireless biometric badge
Authors: Stefano Tennina, Luigi Pomante, Fabio Graziosi, Marco Di Renzo, Roberto Alesii, Fortunato Santucci
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

Moving from the innovative principles of the Platform Based Design (PBD) approach for the design of networked embedded systems, the demonstration proposal focuses on presenting the capabilities of a wireless biometric badge, which integrates a localization and tracking service along with an automatic personal identification mechanism, to control the access to restricted areas with a high level of security. The wireless biometric badge is the result of R&D activities conducted by several professors, researchers, and students in the Center of Excellence in Research DEWS at the University of L'Aquila in Italy, as well as its R&D Spin-Off WEST Aquila S.r.l.