ppxscal/embedding_network huggingface dataset:
A naive theory of affixation and an algorithm for extraction
Authors: Harald Hammarström
Venue: Proceedings of the Eighth Meeting of the ACL Special Interest Group on Computational Phonology and Morphology (2006)

We present a novel approach to the unsupervised detection of affixes, that is, to extract a set of salient prefixes and suffixes from an unlabeled corpus of a language. The underlying theory makes no assumptions on whether the language uses a lot of morphology or not, whether it is prefixing or suffixing, or whether affixes are long or short. It does however make the assumption that 1. salient affixes have to be frequent, i.e occur much more often that random segments of the same length, and that 2. words essentially are variable length sequences of random characters, e.g a character should not occur in far too many words than random without a reason, such as being part of a very frequent affix. The affix extraction algorithm uses only information from fluctation of frequencies, runs in linear time, and is free from thresholds and untransparent iterations. We demonstrate the usefulness of the approach with example case studies on typologically distant languages.
SemEval-2007 task 14: affective text
Authors: Carlo Strapparava, Rada Mihalcea
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

The "Affective Text" task focuses on the classification of emotions and valence (positive/negative polarity) in news headlines, and is meant as an exploration of the connection between emotions and lexical semantics. In this paper, we describe the data set used in the evaluation and the results obtained by the participating systems.
Online Square Packing
Authors: Sándor P. Fekete, Tom Kamphans, Nils Schweer
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from above, one at a time. The objective is to pack these items as they arrive, minimizing the resulting height. Just like in the classical game of Tetris, each square must be moved along a collision-free path to its final destination. In addition, we account for gravity in both motion and position. We apply a geometric analysis to establish a competitive factor of 3.5 for the bottom-left heuristic and present a $\frac{34}{13} \approx 2.6154$-competitive algorithm.
Towards a Framework for Workflow Composition in Ontology Tailoring in Semantic Grid
Authors: Toshihiro Uchibayashi, Bernady O. Apduhan, Wenny J. Rahayu, David Taniar, Norio Shiratori
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Research and developments in Semantic Grid computing has gained much attention in areas of knowledge discovery, medical sciences, business world, among others. Dealing with large domain ontology in this computing environment and its complexity becomes a daunting task. The idea of ontology tailoring is to cope up and minimize the complexity in dealing with large domain ontology and to provide services for ontology reuse, extension, addition, merging, and replace. In this paper, we tackle the task in developing the models to provide the above-mentioned services and the framework for workflow composition in ontology tailoring using UML-based design. Workflow validations were conducted to verify towards realizing a workable ontology tailoring schemes.
Towards better performance per watt in virtual environments on asymmetric single-ISA multi-core systems
Authors: Viren Kumar, Alexandra Fedorova
Venue: ACM SIGOPS Operating Systems Review (2009)

Single-ISA heterogeneous multicore architectures promise to deliver plenty of cores with varying complexity, speed and performance in the near future. Virtualization enables multiple operating systems to run concurrently as distinct, independent guest domains, thereby reducing core idle time and maximizing throughput. This paper seeks to identify a heuristic that can aid in intelligently scheduling these virtualized workloads to maximize performance while reducing power consumption. We propose that the controlling domain in a Virtual MachineMonitor or hypervisor is relatively insensitive to changes in core frequency, and thus scheduling it on a slower core saves power while only slightly affecting guest domain performance. We test and validate our hypothesis and further propose a metric, the Combined Usage of a domain, to assist in future energy-efficient scheduling. Our preliminary findings show that the Combined Usage metric can be used as a starting point to gauge the sensitivity of a guest domain to variations in the controlling domain's frequency.
Cutting-plane training of structural SVMs
Authors: Thorsten Joachims, Thomas Finley, Chun-Nam John Yu
Venue: Machine Learning (2009)

Discriminative training approaches like structural SVMs have shown much promise for building highly complex and accurate models in areas like natural language processing, protein structure prediction, and information retrieval. However, current training algorithms are computationally expensive or intractable on large datasets. To overcome this bottleneck, this paper explores how cutting-plane methods can provide fast training not only for classification SVMs, but also for structural SVMs. We show that for an equivalent "1-slack" reformulation of the linear SVM training problem, our cutting-plane method has time complexity linear in the number of training examples. In particular, the number of iterations does not depend on the number of training examples, and it is linear in the desired precision and the regularization parameter. Furthermore, we present an extensive empirical evaluation of the method applied to binary classification, multi-class classification, HMM sequence tagging, and CFG parsing. The experiments show that the cutting-plane algorithm is broadly applicable and fast in practice. On large datasets, it is typically several orders of magnitude faster than conventional training methods derived from decomposition methods like SVM-light, or conventional cutting-plane methods. Implementations of our methods are available at www.joachims.org .
Improving grammaticality in statistical sentence generation: introducing a dependency spanning tree algorithm with an argument satisfaction model
Authors: Stephen Wann, Mark Dras, Robert Dale, Cécile Paris
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Abstract-like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level syntactic structure. We couch statistical sentence generation as a spanning tree problem in order to search for the best dependency tree spanning a set of chosen words. We also introduce a new search algorithm for this task that models argument satisfaction to improve the linguistic validity of the generated tree. We treat the allocation of modifiers to heads as a weighted bipartite graph matching (or assignment) problem, a well studied problem in graph theory. Using BLEU to measure performance on a string regeneration task, we found an improvement, illustrating the benefit of the spanning tree approach armed with an argument satisfaction model.
Regional and Urban Traffic State Estimation System
Authors: Mingquan Wang, Dongyuan Yang, Yali Zhao, Ying Hui, Xiaofa Shi
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Based on the development of Chinese Intelligent Integrate Transportation System, the paper show the method to Recognize the Regional and Urban Transportation State, which is the most importatnt problem in Intelligent Integrate Transportation System, besides the problem face the planning and Decision-Making process. Then this paper introduces some good examples to do this work and give a major structure for the application, on the expectation of finding a suitable way to develop our urban transportation process based on ITS situation. Afterwards, to show the way to settle the problem of how to tighten the cooperation of the reform and administration, public and private investment apartments. The major findings and lessons from this application are discussed, together with conclusions and Observations regarding further potentials and refinements.
Distributed View Divergence Control of Data Freshness in Replicated Database Systems
Authors: Takao Yamashita
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

In this paper, we propose a distributed method to control the view divergence of data freshness for clients in replicated database systems whose facilitating or administrative roles are equal. Our method provides data with statistically defined freshness to clients when updates are initially accepted by any of the replicas, and then, asynchronously propagated among the replicas that are connected in a tree structure. To provide data with freshness specified by clients, our method selects multiple replicas using a distributed algorithm so that they statistically receive all updates issued up to a specified time before the present time. We evaluated by simulation the distributed algorithm to select replicas for the view divergence control in terms of controlled data freshness, time, message, and computation complexity. The simulation showed that our method achieves more than 36.9 percent improvement in data freshness compared with epidemic-style update propagation.
An Approximate Top-k Query Algorithm in Distributed Networks
Authors: Wenhua Li, Wenting Yu, Xiao Feng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this paper, we propose a variant algorithm Rough Classification based on the Precutting parameter p (RCP). As the distribution of page requests generally follows a Zipf-like distribution, RCP precuts the object by predicting the derived bounds and so that to drop candidate items. By pretreatment, RCP can reduce bandwidth consumption and the run-time cost with high precision in some cases. Furthermore, by performance evaluations using both theoretical analysis and computer simulations, we show that the proposed algorithm can reduce the bandwidth consumption.
Optimizations and extensions for the horn transaction logic programs
Authors: Paul Fodor
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

My thesis describes optimization techniques and extensions for the Horn Transaction Logic. The Horn Transaction Logic is an extension of the classical logic programming with state updates and it has a SLD-style evaluation algorithm. This SLD-style algorithm enters into infinite loops when computing answers to many recursive programs when they change the underlying state of the knowledge base. We solve this problem by tabling the calls, states and answers in a searchable structure, so that the same call is not re-executed ad infinitum. With these techniques, we can efficiently compute queries to transaction logic programs, and when the underlying programs have the bounded term-depth property, these techniques are guaranteed to terminate. I also present extensions to Transaction Logic, for instance a definite semantics for the existentially quantified values that occur in facts, queries and updates of facts. The applications of these techniques promise great improvements in the uses of transaction logic: state-changing systems, artificial intelligence planning, dynamic constraints on transaction execution, workflow modeling and verification, and systems involving financial transactions.
Security in dynamic web content management systems applications
Authors: Ganesh Vaidyanathan, Steven Mautone
Venue: Communications of the ACM (2009)

Introduction The processes behind corporate efforts to create, manage, publish, and archive Web information has also evolved using Web Content Management Systems (WCMS). WCMS allow teams to maintain Web content in a dynamic fashion through a user friendly interface and a modular application approach. This dynamic "on-the-fly" content creation provides Web site authors several advantages including access to information stored in databases, ability to personalize Web pages according to individual user preferences, and the opportunity to deliver a much more interactive user experience than static Web pages alone.11 However, there are distinct disadvantages as well. Dynamically generating Web content can significantly impact Web server performance, reduce the scalability of the Web site and create security vulnerabilities or denial of service.11 Organizations are adopting information technology without understanding such security concerns.1 Moreover, as Mostefaoui7 points out, even though many attempts have been made to understand the security architecture, a generic security framework is needed. Recent research amplifies the concerns and benefits of security in open source systems.2 However, there is a need for organizations to understand how to evaluate these open source systems and this paper highlights how an evaluation technique in terms of security may be used in an organization to assess a short list of possible WMCS systems. This article focuses on security issues in WCMS and the objective is to understand the security issues as well as to provide a generic security framework. The contributions of this paper are to: 1. Integrate the goals of security with eight dimensions of WCMS, 2. Specify how to secure the eight dimensions of WCMS, 3. Formulate a framework of security using this integrated view of security goals and security dimensions, and 4. Address the security of the Web architecture at WCMS software application level using the framework and evaluate security features in popular WCMS used in the industry.
An Improved Metropolis-Hastings Algorithm Based on Particle Filter
Authors: Yanfang Yang, Yanjie Zhang, Yingjun Zhou, Wenhua Zhang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Particle filter is a kind of Monte Carlo simulation method under the framework of Bayesian theory, and it can deal with state estimation problem of nonlinear models with non-Gaussian noise. But the use of resampling scheme to decreases the degeneracy phenomenon also introduces the sample impoverishment. M-H moves step is presented to increase the diversity of the samples and improve the performance of filtering. Aim at the acceptance ratio in standard M-H algorithm and RWM are too low, this paper proposes an improved M-H based particle filter. By improving the candidate proposal distribution, the algorithm reduces the estimate errors and increases the rate of accepted candidates. The simulation shows that the method achieves better performance of filtering compared to general particle filters and several other M-H based particle filters.
A predictable Java profile: rationale and implementations
Authors: Thomas Bøgholm, René R. Hansen, Anders P. Ravn, Bent Thomsen, Hans Søndergaard
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

A Java profile suitable for development of high integrity embedded systems is presented. It is based on event handlers which are grouped in missions and equipped with respectively private handler memory and shared mission memory. This is a result of our previous work on developing a Java profile, and is directly inspired by interactions with the Open Group on their on-going work on a safety critical Java profile (JSR-302). The main contribution is an arrangement of the class hierarchy such that the proposal is a generalization of Real-Time Specification for Java (RTSJ). A further contribution is to integrate the mission concept as a handler, such that mission memory becomes a handler private memory and such that mission initialization and finalization are scheduled activities. Two implementations are presented: one directly on an open source JVM using Xenomai and another, based on delegation, on an RTSJ platform.
Decision Making Model Supporting Emergency Medical Care
Authors: Shuichi Matsuzaki, Subha Fernando, Ashu Marasinghe
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

Accuracy in a pre-hospital trauma triage plays a critical role in reducing trauma mortality in a way that appropriately chooses a patient with severe injuries. Although various triage criteria have been devised and tested, there is no computer-based system developed that helps ambulance teams can make a decision in an appropriate manner. This research proposes to develop Expert Helper, an Expert System which provides a user-friendly environment for the paramedics to decide whether patient to be posted to Critical Care Medical Centers (CCMC).
New Plain-Exponential Time Classes for Graph Homomorphism
Authors: Magnus Wahlström
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f: V(G) ¿V(H) such that if uv ¿ E(G) then f(u)f(v) ¿ E(H). The problem Hom (G,H) of deciding whether there is a homomorphism is NP-complete, and in fact the fastest known algorithm for the general case has a running time of O*n(H) cn(G), for a constant 0 < c < 1. In this paper, we consider restrictions on the graphs G and H such that the problem can be solved in plain-exponential time, i.e. in time O*c n(G) + n(H) for some constant c. Previous research has identified two such restrictions. If H = K k or contains K k as a core (i.e. a homomorphically equivalent subgraph), then Hom (G,H) is the k-coloring problem, which can be solved in time O*2 n(G) (Björklund, Husfeldt, Koivisto); and if H has treewidth at most k, then Hom (G,H) can be solved in time O*(k + 3) n(G) (Fomin, Heggernes, Kratsch, 2007). We extend these results to cases of bounded cliquewidth: if H has cliquewidth at most k, then we can count the number of homomorphisms from G to H in time O*(2k + 1) max (n(G),n(H)), including the time for finding a k-expression for H. The result extends to deciding HomG,H) when H has a core with a k-expression, in this case with a somewhat worse running time.If G has cliquewidth at most k, then a similar result holds, with a worse dependency on k: We are able to count Hom (G,H) in time roughly O*(2k + 1) n(G) + 22kn(H), and this also extends to when G has a core of cliquewidth at most k with a similar running time.
A New Distributed Intrusion Detection Model Based on Immune Mobile Agent
Authors: Jing Xu, Yongzhong Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The development direction of intrusion detection system is intelligent and distributed in future. However, current distributed intrusion detection system mostly uses distributed component to collect data then sent to processing center. Data is analyzed in the processing center. These models have the following problems: bad real time capability, bottleneck, and single point of failure. In order to overcome these shortcomings of current intrusion detection techniques, a new distributed intrusion detection model based on mobile agent is proposed in this paper. Intelligent and mobile characteristics of the agent are used to make computing move to data. As mobile agent can only improve the structure of system and can not supply fundamental new detecting techniques, improved dynamic clonal selection algorithm and collaborative signal mechanism are adopted for reducing false positive rate and increasing detection rate in this paper. Finally, the proposed model and algorithm were simulated by KDD’99 datasets. Comparing with winning entry of KDD’99 classifier learning contest, the proposed model has low false positive rate and higher detection rate in both Dos and Probing attacks, and greatly higher detection rate in U2R attack. Robustness and dynamic adaptability of the system are validated.
Parametric identification of linear systems using Laplace transform
Authors: B. O. Kachanov
Venue: Automation and Remote Control (2009)

Proposed was a method for identification of the transfer function coefficients of the stationary one-input one-output linear system using the Laplace images of the input and output measurements. The measurement processes are considered over the given set of values of the transformation parameter. The a posteriori density of distribution of the vector of identified parameters was determined with regard for the autocovariance functions of the measurement errors. A generalization to the multiple-input multiple-output linear system with perturbations and measurements of the state coordinates was described.
Implementing a Highly Parameterized Digital PIV System on Reconfigurable Hardware
Authors: Abderrahmane Bennis, Miriam Leeser, Gilead Tadmor
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper presents PARPIV the design and prototyping of a highly parameterized digital Particle Image Velocimetry (PIV) system implemented on reconfigurable hardware. Despite many improvements to PIV methods over the last twenty years, PIV post-processing remains a computationally intensive task. It becomes a serious bottleneck as camera acquisition rates reach 1000 frames per second. In this research, we aim to substantially speed up PIV processing by implementing it in reconfigurable hardware. Furthermore, this implementation is highly parameterized, supporting adaptation to a variety of setups and application domains.The circuit is parameterized by the dimensions of the captured images as well as the dimensions of the interrogation windows and sub-areas, pixel representation, board memory width, displacement and overlap. Through this work a parameterized library of different VHDL components was built. To the best of the authors’ knowledge, this is the first highly parameterized PIV system implemented on reconfigurable hardware reported in the literature. For a typical PIV configuration with images of 512×512 pixels, 40×40 pixel interrogation windows and 32×32 pixel sub-areas, we achieved about 65\ times speedup in hardware over a standard software implementation.
An empirical study on class-based word sense disambiguation
Authors: Rubén Izquierdo, Armando Suárez, German Rigau
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

As empirically demonstrated by the last SensEval exercises, assigning the appropriate meaning to words in context has resisted all attempts to be successfully addressed. One possible reason could be the use of inappropriate set of meanings. In fact, WordNet has been used as a de-facto standard repository of meanings. However, to our knowledge, the meanings represented by WordNet have been only used for WSD at a very fine-grained sense level or at a very coarse-grained class level. We suspect that selecting the appropriate level of abstraction could be on between both levels. We use a very simple method for deriving a small set of appropriate meanings using basic structural properties of WordNet. We also empirically demonstrate that this automatically derived set of meanings groups senses into an adequate level of abstraction in order to perform class-based Word Sense Disambiguation, allowing accuracy figures over 80%.