ppxscal/embedding_network huggingface dataset:
Recognizing contextual polarity: An exploration of features for phrase-level sentiment analysis
Authors: Theresa Wilson, Janyce Wiebe, Paul Hoffmann
Venue: Computational Linguistics (2009)

Many approaches to automatic sentiment analysis begin with a large lexicon of words marked with their prior polarity (also called semantic orientation). However, the contextual polarity of the phrase in which a particular instance of a word appears may be quite different from the word's prior polarity. Positive words are used in phrases expressing negative sentiments, or vice versa. Also, quite often words that are positive or negative out of context are neutral in context, meaning they are not even being used to express a sentiment. The goal of this work is to automatically distinguish between prior and contextual polarity, with a focus on understanding which features are important for this task. Because an important aspect of the problem is identifying when polar terms are being used in neutral contexts, features for distinguishing between neutral and polar instances are evaluated, as well as features for distinguishing between positive and negative contextual polarity. The evaluation includes assessing the performance of features across multiple machine learning algorithms. For all learning algorithms except one, the combination of all features together gives the best performance. Another facet of the evaluation considers how the presence of neutral instances affects the performance of features for distinguishing between positive and negative polarity. These experiments show that the presence of neutral instances greatly degrades the performance of these features, and that perhaps the best way to improve performance across all polarity classes is to improve the system's ability to identify when an instance is neutral.
Exploiting symmetries in POMDPs for point-based algorithms
Authors: Kee-Eung Kim
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

We extend the model minimization technique for partially observable Markov decision processes (POMDPs) to handle symmetries in the joint space of states, actions, and observations. The POMDP symmetry we define in this paper cannot be handled by the model minimization techniques previously published in the literature. We formulate the problem of finding the symmetries as a graph automorphism (GA) problem, and although not yet known to be tractable, we experimentally show that the sparseness of the graph representing the POMDP allows us to quickly find symmetries. We show how the symmetries in POMDPs can be exploited for speeding up point-based algorithms. We experimentally demonstrate the effectiveness of our approach.
Bridging the Gap: Adaptive Games and Student-Centered VLEs
Authors: Ángel Blanco, Javier Torrente, Pablo Moreno-Ger, Baltasar Fernández-Manjón
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

The widely used e-learning technology is facing new challenges such as how to produce student-centered systems that can be adapted to the needs of each student. Those objectives should be met in a standard compliant way to simplify general adoption. In this context, educational videogames are proposed as an ideal medium to facilitate adaptation and tracking of the students' performance for assessment purposes. However, there are still barriers between the gaming and e-learning worlds preventing their mutual interaction. In this paper we propose a middleware to bridge this gap, integrating adaptive educational videogames in e-learning environments with a special focus on the ongoing standardization efforts.
A Scalable Neighborhood Discovery Protocol for Infrastructure Wireless Mesh Networks
Authors: Glêdson Elias, Mateus Novaes, Gustavo Cavalcanti, Daniel Porto
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

Infrastructure Wireless Mesh Networks (IWMNs) have emerged as a promising technology for dynamic selfconfigurable and self-healing networks that provide large coverage, connectivity and resilience based on routing capabilities supported by their constituting nodes. In order to scale up IWMNs, it is an interesting approach to split routing capabilities into a layered routing architecture, in which the base layer is defined by a neighborhood discovery protocol employed to detect the presence and status of neighbor nodes. In such a context, this paper presents SNDP, a scalable neighborhood discovery protocol that has been specifically designed for IWMNs. SNDP adopts a hybrid, collaborative signaling strategy, in which different types of nodes adopt distinct signaling approaches that work together to manage neighborhood concerns. By reducing signaling load, power consumption and neighborhood discovery time, SNDP has the potential to become a better choice than the current work-in progress proposed by the IETF MANET working group.
Evaluating impact of re-training a lexical disambiguation model on domain adaptation of an HPSG parser
Authors: Tadayoshi Hara, Yusuke Miyao, Jun'ichi Tsujii
Venue: Proceedings of the 10th International Conference on Parsing Technologies (2007)

This paper describes an effective approach to adapting an HPSG parser trained on the Penn Treebank to a biomedical domain. In this approach, we train probabilities of lexical entry assignments to words in a target domain and then incorporate them into the original parser. Experimental results show that this method can obtain higher parsing accuracy than previous work on domain adaptation for parsing the same data. Moreover, the results show that the combination of the proposed method and the existing method achieves parsing accuracy that is as high as that of an HPSG parser retrained from scratch, but with much lower training cost. We also evaluated our method in the Brown corpus to show the portability of our approach in another domain.
Usability Studies on Sensor Smart Clothing
Authors: Haeng Suk Chae, Woon Jung Cho, Soo Hyun Kim, Kwang Hee Han
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper presents approach to usability evaluation on sensor smart clothing that the methodologies can be divided into two categories. 1) usability evaluation that gather data from actual users on sensor smart clothing. 2) investigation weight values which is calculated for evaluation item. The result of usability evaluation shows that SC(sensor controller) influence on overall usability of sensor smart clothing. Effective item and module is social acceptance of SC, wearability of GC(general connector) PA(platform appearance), usefulness of GC PA and maintenance(400) of PA SC. To estimate the sensor smart clothing, task process was applied and the components on the response of user were investigated. This study was performed to determine how effects the properties of sensor smart clothing. Our study suggests that usability evaluation may be important within design process of sensor smart clothing.
Trajectory Errors of the 6-PGK Parallel Robot
Authors: Liviu Moldovan
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

This paper presents a method to determinate a desired trajectory for the manipulated object by the 6-PGK parallel robot [8], with an imposed velocity, when some vibration motions act in the prismatic motor joints. By using the Lagrangian approach the dynamic equations of motion of the parallel robot were deduced [9]. The supplementary generalized forces that must be introduced in system to correct the trajectory errors have been computed from these equations.
Local excitation solutions in one-dimensional neural fields by external input stimuli
Authors: Shigeru Kubota, Kosuke Hamaguchi, Kazuyuki Aihara
Venue: Neural Computing and Applications (2009)

Cortical neurons are massively connected with other cortical and subcortical cells, and they receive synaptic inputs from multiple sources. To explore the basis of how interconnected cortical cells are locally activated by such inputs, we theoretically analyze the local excitation patterns elicited by external input stimuli by using a one-dimensional neural field model. We examine the conditions for the existence and stability of the local excitation solutions under arbitrary time-invariant inputs and establish a graphic analysis method that can detect all steady local excitation solutions and examine their stability. We apply this method to a case where a pair of supra- and subthreshold stimuli are applied to nearby positions in the field. The results demonstrate that there can exist bistable local excitation solutions with different lengths and that the local excitation exhibits hysteretic behavior when the relative distance between the two stimuli is altered.
MoViE: Mobile Video Experience
Authors: Jari Multisilta, Marko Suominen
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

In this article we present the MoViE (Mobile Video Experience) social mobile service that enables users to create video stories using their mobile phones. The MoViE service represents a new type of social media application that is still on development stage. It can be used for example in events as a community video publishing platform or at schools as a platform for reporting field trips using class created video clips which can be edited in the MoViE. In addition, MoViE is designed for mobile devices, and it supports user generated tags, tagspaces, geotags, remixing of clips and moderation.
Novel Routing Algorithms for Hierarchical Architecture in ASON
Authors: Pei Luo, Shanguo Huang, Weihua Lian, Bin Li, Wanyi Gu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

The hierarchical routing infrastructure in Automatic Switched Optical Network (ASON) is researched. Three operational algorithms MLLR (Multi-Layer Least Loaded Routing Algorithm), MLCR (Multi-Layer Least Congestion Routing Algorithm) and MROB (Multi-Layer Routing Algorithm based on backtracking) are proposed. In these algorithms, the resource coordination and balancing of multi-domain and multilayer are considered based on the fixed alternate hierarchical routing. A platform named AHORSP (ASON based hierarchical optimal routing & signaling platform) supporting our routing optimization scheme is proposed and demonstrated. Based on the platform the average block probability can be reduced effectively with acceptable time performance by these algorithms.
Average-Case Analyses of Vickrey Costs
Authors: Prasad Chebolu, Alan Frieze, Páll Melsted, Gregory B. Sorkin
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We explore the average-case "Vickrey" cost of structures in three random settings: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the Vickrey cost of a minimum spanning tree (MST) in a complete graph with random edge weights; and the Vickrey cost of a perfect matching in a complete bipartite graph with random edge weights. In each case, in the large-size limit, the Vickrey cost is precisely 2 times the (non-Vickrey) minimum cost, but this is the result of case-specific calculations, with no general reason found for it to be true.Separately, we consider the problem of sparsifying a complete graph with random edge weights so that all-pairs shortest paths are preserved approximately. The problem of sparsifying a given graph so that for every pair of vertices, the length of the shortest path in the sparsified graph is within some multiplicative factor and/or additive constant of the original distance has received substantial study in theoretical computer science. For the complete digraph ${\vec{K}_n}$ with random edge weights, we show that whp ¿(n ln n) edges are necessary and sufficient for a spanning subgraph to give good all-pairs shortest paths approximations.
Minimizing the Limitations of GL Analyser of Fusion Based Email Classification
Authors: Md. Rafiqul Islam, Wanlei Zhou
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In the last decade, the Internet email has become one of the primary method of communication used by everyone for the exchange of ideas and information. However, in recent years, along with the rapid growth of the Internet and email, there has been a dramatic growth in spam. Classifications algorithms have been successfully used to filter spam, but with a certain amount of false positive trade-offs. This problem is mainly caused by the dynamic nature of spam content, spam delivery strategies, as well as the diversification of the classification algorithms. This paper presents an approach of email classification to overcome the burden of analyzing technique of GL (grey list) analyser as further refinements of our previous multi-classifier based email classification [10]. In this approach, we introduce a "majority voting grey list (MVGL)" analyzing technique with two different variations which will analyze only the product of GL emails. Our empirical evidence proofs the improvements of this approach, in terms of complexity and cost, compared to existing GL analyser. This approach also overcomes the limitation of human interaction of existing analyzing technique.
Design and Realization of Direct PLL FM Transmitter for UAV Data Link
Authors: Sun Wenyou, Hu Yonghong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Based on the UAV requirements of small airborne equipment, the paper discusses the necessity of using PCM-FM modulation method to design small airborne transmitter. It is also introduced the principle to complete transmitter design using direct PLL FM technology, given phase transmission model using of dual voltage-controlled ports of the VCO to achieve direct PLL FM and PLL circuit design. Simulation and experimental data are close to the theoretical analysis, and further flight application shows that airborne transmitter using the direct PLL FM not only small but also is able to meet the high-speed data transmission requirements.
Computing pure Nash equilibria in symmetric action graph games
Authors: Albert Xin Jiang, Kevin Leyton-Brown
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We analyze the problem of computing pure Nash equilibria in action graph games (AGGs), which are a compact game-theoretic representation. While the problem is NP-complete in general, for certain classes of AGGs there exist polynomial time algorithms. We propose a dynamic-programming approach that constructs equilibria of the game from equilibria of restricted games played on subgraphs of the action graph. In particular, if the game is symmetric and the action graph has bounded treewidth, our algorithm determines the existence of pure Nash equilibrium in polynomial time.
Degradation of MIMO UWB-IR Transceiver in Poisson Models
Authors: Xu Huang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Multi-antenna-based multi-input multi-output (MIMO) communications become the next revolution in wireless data communications. MIMO has gone through the adoption curve for commercial wireless systems to the today's situation, all high throughput commercial standards, i.e. WiMax, Wi-Fi, cellular, etc., have adopted MIMO as part of the optional.This paper is to present our investigations of the behaviors of the MIMO Ultra-Wide-Band-Impulse Radio (UWB-IR) systems with statistic models, which will contribute to optimal designs for the low-power high-speed data communication over unlicensed bandwidth spanning several GHz, such as IEEE 802.15 families.We have developed and analyzed three no coherent transceiver models without requiring any channel estimation procedure. The massive simulations are made based on our established models. Our investigations show that the Poisson distribution of the path arriving will affect the signal-noise ratio (SNR) and that for the Nakagami distributed multipath fading channel the "m" factor, together with receiver number, will impact on the SNR of the MIMO UWB-IR systems.
Understanding the Older User of Ambient Technologies
Authors: Andrew Sixsmith
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper reports on the user-driven research and development (R D) approach adopted with the EU-funded SOPRANO project (http://www.soprano-ip.org/) to develop an "ambient assisted living" (AAL) system to enhance the lives of frail and disabled older people. The paper describes the conceptual framework and methods used within SOPRANO and briefly presents some of the results from requirements capture, use case development and initial prototype development. The focus of the research is on understanding the potential user of the SOPRANO AAL system using a holistic ecological model of person and context and using methods that aimed to explore different experiential "realities". The results demonstrate the usefulness of the approach for involving user in all stages of R D and in generating and evaluating ideas for prototype development.
Speaker recognition with mixtures of Gaussians with sparse regression matrices
Authors: Constantinos Boulis
Venue: Proceedings of the Student Research Workshop at HLT-NAACL 2004 on XX (2004)

When estimating a mixture of Gaussians there are usually two choices for the covariance type of each Gaussian component. Either diagonal or full covariance. Imposing a structure though may be restrictive and lead to degraded performance and/or increased computations. In this work, several criteria to estimate the structure of regression matrices of a mixture of Gaussians are introduced and evaluated. Most of the criteria attempt to estimate a discriminative structure, which is suited for classification tasks. Results are reported on the 1996 NIST speaker recognition task and performance is compared with structural EM, a well-known, non-discriminative, structure-finding algorithm.
Path Selection Metrics for Performance-Improved Onion Routing
Authors: Andriy Panchenko, Johannes Renner
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Providing anonymity for users on the Internet is a very challenging and difficult task. Currently there are only a few systems that are of practical relevance for the provision of low-latency anonymity. One of the most important to mention is Tor which is based on onion routing. Practical client usage of Tor often leads to delays that are not tolerated by the average end-user, which, in return, discourages many of them from using the system. In this paper we propose new methods of path selection that allow performance-improved onion routing. These are based on actively measured latencies and estimations of available link-wise capacities using passive observations of throughput. We evaluate the proposed methods in the public Tor network and present a practical approach to empirically analyze the strength of anonymity certain methods of path selection provide in comparison to each other.
Axiom schemata as metalevel axioms: model theory
Authors: Timothy L. Hinrichs, Michael R. Genesereth
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Logicians frequently use axiom schemata to encode (potentially infinite) sets of sentences with particular syntactic form. In this paper we examine a first-order language in which it is possible to write expressions that both describe sentences and assert the truth of the sentences so described. The effect of adding such expressions to a knowledge base is the same as directly including the set of described sentences.
Using Multi-spectral Remote Sensing Data to Extract and Analyze the Vegetation Information in Desert Areas
Authors: Huai-bao Zhao, Tong Liu, Yao-ping Cui, Jia-qiang Lei
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The coverage and spatial distribution of vegetation in desert areas are fundamental indexes to estimate the desertification severity, and acquiring vegetation information is very beneficial to carry out desertification monitoring and evaluation. Based on Landsat TM image of 2007, vegetation information of the western Gurbantunggut Desert was extracted with vegetation indexes and spectral mixture analysis. The results show that: the U-min method (one of the SMA methods) is the best one and this method was used for further analysis. Moreover, a significant linear relationship is found between vegetation coverage and vegetation fraction extracted from SMA, with a correlation coefficient of 0.858. This indicate that vegetation coverage in desert areas can be extracted through remote sensing images indirectly.
An Input Triggered Polymorphic ASIC for H.264 Decoding
Authors: Adarsha Rao, Mythri Alle, Sainath V, Reyaz Shaik, Rajashekhar Chowhan, S. Sankaraiah, Sravanthi Mantha, S. K. Nandy, Ranjani Narayan
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper reports the design of an input--triggered polymorphic ASIC for H.264 baseline decoder.Hardware polymorphism is achieved by selectively reusing hardware resources at system and module level. Complete design is done using ESL design tools following a methodology that maintains consistency in testing and verification throughout the design flow. The proposed design can support frame sizes from QCIF to 1080p.
On-the-fly TCTL model checking for time Petri nets
Authors: Rachid Hadjidj, Hanifa Boucheneb
Venue: Theoretical Computer Science (2009)

In this paper, we show how to efficiently model check a subset of TCTL properties for the Time Petri Net model (TPN model), using the state class method. The verification proceeds by augmenting the TPN model under analysis with a special TPN, called Alarm-clock, to allow the capture of relevant time events. A forward on-the-fly exploration is then applied on the resulting TPN state class space to verify a timed property. A relaxation operation on state classes is also introduced to further improve performances. Alarm-clock is the same for all properties, whereas the exploration technique is not. Three exploration techniques are presented to cover most interesting TCTL properties. We prove the decidability of our verification technique for bounded TPN models and compare it with the reachability algorithm implemented in the tool UPPAAL [G. Behrmann, J. Bengtsson, A. David, K.G. Larsen, P. Pettersson, W. Yi, Uppaal implementation secrets, in: Proc. of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002]. Finally, we give some experimental results to show the efficiency of our verification technique.