ppxscal/embedding_network huggingface dataset:
USYD: WSD and lexical substitution using the Web1T corpus
Authors: Tobias Hawker
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper describes the University of Sydney's WSD and Lexical Substitution systems for SemEval-2007. These systems are principally based on evaluating the substitutability of potential synonyms in the context of the target word. Substitutability is measured using Pointwise Mutual Information as obtained from the Web1T corpus. The WSD systems are supervised, while the Lexical Substitution system is unsupervised. The lexical sample sub-task also used syntactic category information given from a CCG-based parse to assist in verb disambiguation, while both WSD tasks also make use of more traditional features. These related systems participated in the Coarse-Grained English All-Words WSD task (task 7), the Lexical Substitution Task (task 10) and the English Lexical Sample WSD sub-task (task 17).
Understanding Online Game Addiction: Connection between Presence and Flow
Authors: Sungbok Park, Ha Sung Hwang
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Addictive behavior in online gaming has been an important research topic since it has been one of the most popular activities in entertaining for younger people in Korea. However, despite the growing popularity of online games, empirical studies about the effects of immersion to the online game behavior are relatively rare. By applying two psychological concepts ---presence and flow-the present study investigates how different types of immersion affect on online game addiction. Results show that both presence and flow play significant roles in online game addiction, however, flow mediates the relationship between presence and online game addiction. Based on these findings, implications and suggestions for future studies are discussed.
A parameterized view on matroid optimization problems
Authors: Dániel Marx
Venue: Theoretical Computer Science (2009)

Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity point of view: instead of the trivial n^O^(^k^) time brute force algorithm for finding a k-element solution, we try to give algorithms with uniformly polynomial (i.e., f(k)@?n^O^(^1^)) running time. The main result is that if the ground set of a represented linear matroid is partitioned into blocks of size @?, then we can determine in randomized time f(k,@?)@?n^O^(^1^) whether there is an independent set that is the union of k blocks. As a consequence, algorithms with similar running time are obtained for other problems such as finding a k-element set in the intersection of @? matroids, or finding k terminals in a network such that each of them can be connected simultaneously to the source by @? disjoint paths.
Filling of very deep, wide trenches by BenzoCycloButene polymer
Authors: Hicham Eldin Mahfoz Kotb, K. Isoird, F. Morancho, L. Th&#x00e9;olier, T. Do Conto
Venue: Microsystem Technologies (2009)

A process for deep trench filling by BenzoCycloButene (BCB) polymer is explored. Deep trenches with 100-&#x03bc;m depth and different aspect ratios from 1.4 to 20 have been successfully filled by BCB. Besides, chemical mechanical polishing (CMP) of BCB is studied with the main goals of smoothing surface topography of substrate after BCB filling and removing excess BCB coating which may be necessary in some applications. Removal rate for BCB, V RR, of about 0.24&#x00a0;&#x03bc;m/min has been achieved for hard cured BCB films using acid slurry. After CMP, the BCB layer showed a roughness of about 1.36&#x00a0;nm (Rq, measured by atomic force microscopy, AFM).
Experimental Study of Acoustic Forward Scattering on a Marine Shelf
Authors: Alexander L. Matveev, Pavel I. Korotin, Victor I. Turchin, Daniel Rouseff, Robert C. Spindel
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

The forward scattering of sound by a moving inhomogeneity can be observed when the inhomogeneity intersects a stationary path between an acoustic source and a receiving array. The scattered field is modeled as a weak perturbation of the direct signal when the inhomogeneity is near the direct path. Often the scattered field is masked by fluctuations in the direct signal. The task of a detection and parameter estimation of a moving inhomogeneity by the processing of acoustic signals as received on linear arrays is considered. After a review of methods, new experimental results are presented. The experiment was performed in the Bierke-Soond Strait of the Baltic in August 2006. The experiment geometry, propagation conditions, and spectra of direct signal fluctuations are discussed. Examples of experimental forward scattering observations obtained via various array-processing techniques are given. Good agreement between parameter estimates and true values is demonstrated for the intersection instant and the inhomgeneity’s velocity, length and cross-sectional area. The minimum size of an inhomogeneity that can be observed is obtained.
Semantic labeling of compound nominalization in Chinese
Authors: Jinglei Zhao, Hui Liu, Ruzhan Lu
Venue: Proceedings of the Workshop on a Broader Perspective on Multiword Expressions (2007)

This paper discusses the semantic interpretation of compound nominalizations in Chinese. We propose four coarse-grained semantic roles of the noun modifier and use a Maximum Entropy Model to label such relations in a compound nominalization. The feature functions used for the model are web-based statistics acquired via role related paraphrase patterns, which are formed by a set of word instances of prepositions, support verbs, feature nouns and aspect markers. By applying a sub-linear transformation and discretization of the raw statistics, a rate of approximately 77% is obtained for classification of the four semantic relations.
The Research about Prediction of Environment Impact of Ethylene Project on Groundwater
Authors: Difan Mao, Junwei Wan, Honglian Shi, Shuzhou Cai, Qian Yu, Xianqing Xu, Ji Shu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

this paper takes Wuhan’s"800ths tons ethylene project" as an example. According to the involved model parameters, which are obtained from the saturated soil column test of one-dimensional infiltration, and the law of the pollutant concentration in soil column from sewerage leaching experiment, the basic equation of contaminant transport in the porous soil was established, and then, we have predicted and evaluated the vertical leakage time of the contaminant from surface to the underlying aquifer. The impact of the project on groundwater environment with HYDRUS1D was predicted, and the ranges were divided by different polluted extent. Finally, we put forward some measurements and tactics, to prevent the pollutants from leaking downward.
Supervised Local Subspace Learning for Region Segmentation and Categorization in High-Resolution Satellite Images
Authors: Yen-Wei Chen, Xian-Hua Han
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

We proposed a new feature extraction method based on supervised locality preserving projections (SLPP) for region segmentation and categorization in high-resolution satellite images. Compared with other subspace methods such as PCA and ICA, SLPP can preserve local geometric structure of data and enhance within-class local information. The generalization of the proposed SLPP based method is discussed in this paper.
A Distributed Stream Query Optimization Framework through Integrated Planning and Deployment
Authors: Sangeetha Seshadri, Vibhore Kumar, Brian Cooper, Ling Liu
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

This paper addresses the problem of optimizing multiple distributed stream queries that are executing simultaneously in distributed data stream systems. We argue that the static query optimization approach of "plan, then deployment” is inadequate for handling distributed queries involving multiple streams and node dynamics faced in distributed data stream systems and applications. Thus, the selection of an optimal execution plan in such dynamic and networked computing systems must consider operator ordering, reuse, network placement, and search space reduction. We propose to use hierarchical network partitions to exploit various opportunities for operator-level reuse while utilizing network characteristics to maintain a manageable search space during query planning and deployment. We develop top-down, bottom-up, and hybrid algorithms for exploiting operator-level reuse through hierarchical network partitions. Formal analysis is presented to establish the bounds on the search space and suboptimality of our algorithms. We have implemented our algorithms in the IFLOW [CHECK END OF SENTENCE] system, an adaptive distributed stream management system. Through simulations and experiments using a prototype deployed on Emulab [CHECK END OF SENTENCE], we demonstrate the effectiveness of our framework and our algorithms.
Languages for Embedded Systems and their Applications: Selected Contributions on Specification, Design, and Verification from FDL'08, 1st edition
Authors: Martin Radetzki
Venue:  (2009)

The objective of Languages for Embedded Systems and their Applications is to provide researchers and designers with an overview of current research trends, results, and application experiences in computer languages for embedded systems. The book builds upon the most relevant contributions to FDL08, the premier international conference specializing in this field. These contributions have been selected based on the results of reviews provided by leading experts from research and industry. In many cases, the authors have improved their original work by adding breadth, depth, or explanation. 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
MINT: a method for effective and scalable mining of named entity transliterations from large comparable corpora
Authors: Raghavendra Udupa, K. Saravanan, A. Kumaran, Jagadeesh Jagarlamudi
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

In this paper, we address the problem of mining transliterations of Named Entities (NEs) from large comparable corpora. We leverage the empirical fact that multilingual news articles with similar news content are rich in Named Entity Transliteration Equivalents (NETEs). Our mining algorithm, MINT, uses a cross-language document similarity model to align multilingual news articles and then mines NETEs from the aligned articles using a transliteration similarity model. We show that our approach is highly effective on 6 different comparable corpora between English and 4 languages from 3 different language families. Furthermore, it performs substantially better than a state-of-the-art competitor.
Dynamical Detecting Technique of Nonfunctional Dependence Program Invariant
Authors: Shukun Liu, Xiaohua Yang, Jifeng Chen, Shan Duan
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In this paper, the notation of program invariant was described, and a theory model of dynamical generating technique of invariants was researched. Then, the technology of dynamical generating technique of invariants of nonfunctional dependence was discussed. A new method of dynamical generating technique of invariants of nonfunctional dependence based on the theory of database was showed. Then, a series of detecting measures of specific nonfunctional dependence invariants were proposed .Many kinds of program invariants can be dynamically discovered by the means.
Games on Higher Order Multi-stack Pushdown Systems
Authors: Anil Seth
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

In this paper we define higher order multi-stack pushdown systems. We show that parity games over bounded phase higher order multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized. 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
Design and Application for Milled Rumble Strips in China
Authors: Zhi Wang, Yu-jia Tian, Dian-liang Xiao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

As there still exists a gap in the design of the rumble strips, the author in this paper takes Tiema heavy-duty lorry as the typical vehicle and uses the simulation model established by ADAMS(Automatic Dynamic Analysis Of Mechanical System)dynamic simulation software to analyze the changing laws in the mean square root of the rumbling acceleration with the three designing factors on the basis of the dependent variables of the milled depth, the clear spacing and length of the rumble strips and the independent variables of the mean square root of acceleration of the rumble strips. According to the simulation results, the author chooses three cases to conduct application and testing and carries grey-related analysis for the field testing values and simulation values. The desired relevant data show that the simulation results with ADAMS are reliable. Finally the paper puts forward some suggested sizes for the design of milled rumble strips in China on the basis of the warning effect and simulation results.
Performance Driven Database Design for Scalable Web Applications
Authors: Jozsef Patvarczki, Murali Mani, Neil Heffernan
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Scaling up web applications requires distribution of load across multiple application servers and across multiple database servers. Distributing load across multiple application servers is fairly straightforward; however distributing load (select and UDI queries) across multiple database servers is more complex because of the synchronization requirements for multiple copies of the data. Different techniques have been investigated for data placement across multiple database servers, such as replication, partitioning and de-normalization. In this paper, we describe our architecture that utilizes these data placement techniques for determining the best possible layout of data. Our solution is general, and other data placement techniques can be integrated within our system. Once the data is laid out on the different database servers, our efficient query router routes the queries to the appropriate database server/(s). Our query router maintains multiple connections for a database server so that many queries are executed simultaneously on a database server, thus increasing the utilization of each database server. Our query router also implements a locking mechanism to ensure that the queries on a database server are executed in order. We have implemented our solutions in our system, that we call SIPD (System for Intelligent Placement of Data). Preliminary experimental results illustrate the significant performance benefits achievable by our system.
Indoor Location System Using ZigBee Technology
Authors: Gomes Goncalo, Sarmento Helena
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper describes a location system for persons and objects in an indoor environment, where wireless nodes can include sensors and provide unique identifiers. The system nodes, using ZigBee technology, can function as RFID tags, having each one a unique EPC identification number. Sensors can be associated with the wireless nodes Zigbee to create applications for home, health and traffic control. Location systems are analysed with emphasis on indoor location systems.The implemented location algorithm includes a propagation model based on the wall attenuation factor propagation model together with triangulation. A variety of tests were carried out in an indoor environment. Results demonstrate that the location system is viable, showing itself to be effective, flexible and easily adaptable to various locations.
Auto-Clustering Using Particle Swarm Optimization and Bacterial Foraging
Authors: Jakob R. Olesen, Jorge Cordero H., Yifeng Zeng
Venue: Agents and Data Mining Interaction: 4th International Workshop, ADMI 2009, Budapest, Hungary, May 10-15,2009, Revised Selected Papers (2009)

This paper presents a hybrid approach for clustering based on particle swarm optimization (PSO) and bacteria foraging algorithms (BFA). The new method AutoCPB (Auto-Clustering based on particle bacterial foraging) makes use of autonomous agents whose primary objective is to cluster chunks of data by using simplistic collaboration. Inspired by the advances in clustering using particle swarm optimization, we suggest further improvements. Moreover, we gathered standard benchmark datasets and compared our new approach against the standard K-means algorithm, obtaining promising results. Our hybrid mechanism outperforms earlier PSO-based approaches by using simplistic communication between agents.
Distinguishing Multiplications from Squaring Operations
Authors: Frederic Amiel, Benoit Feix, Michael Tunstall, Claire Whelan, William P. Marnane
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

In this paper we present a new approach to attacking a modular exponentiation and scalar multiplication based by distinguishing multiplications from squaring operations using the instantaneous power consumption. Previous approaches have been able to distinguish these operations based on information of the specific implementation of the embedded algorithm or the relationship between specific plaintexts. The proposed attack exploits the expected Hamming weight of the result of the computed operations. We extrapolate our observations and assess the consequences for elliptic curve cryptosystems when unified formulæ for point addition are used.
Low-power CMOS transceivers with on-chip antennas for short-range radio-frequency communication
Authors: Calvin Plett, Robson Nunes de Lima
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

The benefit of an on-chip antenna is the possibility for smaller size and fewer external components. If an on-chip antenna is combined with power scavenging circuits to eliminate the external battery, it is possible to achieve true fully integrated transceivers. However, there are many challenges to overcome and compromises to be made. The use of an on-chip antenna will typically result in lower communication range, and the impedance of such antenna may not be as convenient for interfacing. Similarly, the choice of operating frequency involves a tradeoff between antenna efficiency and power consumption in the active circuitry. In order to operate with minimum power to allow for the possibility of using scavenged power, it is possible for circuitry to be shut down when it is inactive; however, this requires more careful consideration of synchronization circuits. These are some of the issues that will be discussed in the context of several examples including an RF transceiver designed for 5.2 GHz operation and intended for short range communication with biomedical sensors.
Model Based Analysis and Test Generation for Flight Software
Authors: Corina S. Pasareanu, Johann Schumann, Peter Mehlitz, Mike Lowry, Gabor Karsai, Harmon Nine, Sandeep Neema
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

We describe a framework for model-based analysis and test case generation in the context of a heterogeneous model-based development paradigm that uses and combines MathWorks and UML 2.0 models and the associated codegeneration tools. This paradigm poses novel challenges to analysis and test case generation that, to the best of our knowledge, have not been addressed before. The framework is based on a common intermediate representation for different modeling formalisms and leverages and extends model checking and symbolic execution tools for model analysis and test case generation, respectively. We discuss the application of our framework to software models for a NASA flight mission.
Bridging the Gap between Abstract Argumentation Systems and Logic
Authors: Leila Amgoud, Philippe Besnard
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

Dung's argumentation system takes as input a set of arguments and a binary relation encoding attacks among these arguments, and returns different extensions of arguments. However, no indication is given on how to instantiate this setting, i.e. how to build arguments from a knowledge base and how to choose an appropriate attack relation. This leads in some cases to undesirable results like inconsistent extensions (i.e. the set of formulas forming an extension is inconsistent). This is due to the gap between the abstract setting and the knowledge base from which it is defined.The purpose of this paper is twofold: First it proposes to fill in this gap by extending Dung's system. The idea is to consider all the ingredients involved in an argumentation problem. We start with an abstract monotonic logic which consists of a set of formulas and a consequence operator. We show how to build arguments from a knowledge base using the consequence operator of the logic. Second, we show that the choice of an attack relation is crucial for ensuring consistent results, and should not be arbitrary. In particular, we argue that an attack relation should be at least grounded on the minimal conflicts contained in the knowledge base. Moreover, due to the binary character of this relation, some attack relations may lead to unintended results. Namely, symmetric relations are not suitable when ternary (or more) minimal conflicts are in the knowledge base. We propose then the characteristics of attack relations that ensure sound results.