ppxscal/embedding_network huggingface dataset:
Classification Framework for Fair Content Tracing Protocols
Authors: Geong Sen Poh, Keith M. Martin
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

Fair content tracing (FaCT) protocols have been proposed by many authors to allow content tracing based on digital watermarking to be performed in a manner that does not discriminate either the client who downloads content or the distributor who provides content. We propose a general design framework for fair content tracing (FaCT) protocols. This framework provides a means to address the ad hoc design issues arising for many existing protocols, several of which have been broken through poor design. We then classify existing FaCT protocols based on this framework, which allows for a more systematic approach to FaCT protocol analysis. We further provide general comparisons and evaluation criteria for FaCT protocols.
Action Rules and the GUHA Method: Preliminary Considerations and Results
Authors: Jan Rauch, Milan Šimůnek
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

The paper presents an alternative approach to action rules. The presented approach is based on experience with the GUHA method and the LISp-Miner system. G-action rules are introduced. First experience with new GUHA procedure Ac4ft-Miner that mines for G-action rules is described.
Using 3D Touch Interaction for a Multimodal Zoomable User Interface
Authors: Florian Laquai, Markus Ablassmeier, Tony Poitschke, Gerhard Rigoll
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Touchscreens are becoming the preferred input device in a growing number of applications. They are interesting devices which are more and more introduced into the automotive domain. Current implementations impose problems like precise pointing or high visual attention and therefore the capabilities of projected capacitive touchscreens are investigated. Unlike traditional sensing techniques like resistive or optical measurements, projected capacitive sensors register the presence of a hand or finger even before the actual touch. This enables such devices to be used not only for 2D input but for interaction using the position and distance of the users finger relatively to the screen. The additional distance information is then applied to control a Zoomable User Interface. In this study touch and speech interaction is being applied to allow fuzzy input and lower visual attention demand than conventional Touchscreens. A demonstrator was developed using the mentioned input strategies for the automotive domain and finally evaluated in a user study.
Analyzing animated representations of complex causal semantics
Authors: Nivedita R. Kadaba, Pourang P. Irani, Jason Leboe
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

Causal relationships are inherent in the world around us and are intrinsic to our decision making process. Michotte's Theory of Ampliation suggests that the perception of causality can be enhanced under appropriate spatiotemporal conditions. We extended this theory and proposed that simple static and animated designs, based on structural and temporal rules, enable the perception of complex causal semantics, such as additive, mediated, and bidirectional causalities. Results of our experiment showed that participants were ~5% more accurate and ~8% faster with the animations, than with the static representations. Overall our results show that animations that are designed based on perceptual rules assist the comprehension of complex causal relations.
Approximating Some Network Design Problems with Node Costs
Authors: Guy Kortsarz, Zeev Nutov
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We study several multi-criteria undirected network design problems with node costs and lengths with all problems related to the node costs Multicommodity Buy at Bulk (mbb) problem in which we are given a graph G = (V,E), demands {d st : s,t ¿ V}, and a family {c v : v ¿ V} of subadditive cost functions. For every s,t ¿ V we seek to send d st flow units from s to t on a single path, so that ¿ v c v (f v ) is minimized, where f v the total amount of flow through v. In the Multicommodity Cost-Distance (mcd) problem we are also given lengths {¿(v):v ¿ V}, and seek a subgraph H of G that minimizes c(H) + ¿ s,t ¿ V d st ·¿ H (s,t), where ¿ H (s,t) is the minimum ¿-length of an st-path in H. The approximation for these two problems is equivalent up to a factor arbitrarily close to 2. We give an O(log3 n)-approximation algorithm for both problems for the case of demands polynomial in n. The previously best known approximation ratio for these problems was O(log4 n) [Chekuri et al., FOCS 2006] and [Chekuri et al., SODA 2007]. This technique seems quite robust and was already used in order to improve the ratio of Buy-at-bulk with protection (Antonakopoulos et al FOCS 2007) from log3 h to log2 h. See ?.We also consider the Maximum Covering Tree (maxct) problem which is closely related to mbb: given a graph G = (V,E), costs {c(v):v ¿ V}, profits {p(v):v ¿ V}, and a bound C, find a subtree T of G with c(T) ≤ C and p(T) maximum. The best known approximation algorithm for maxct [Moss and Rabani, STOC 2001] computes a tree T with c(T) ≤ 2C and . We provide the first nontrivial lower bound and in fact provide a bicriteria lower bound on approximating this problem (which is stronger than the usual lower bound) by showing that the problem admits no better than ¿(1/(loglogn)) approximation assuming $\mbox{NP}\not\subseteq \mbox{Quasi(P)}$ even if the algorithm is allowed to violate the budget by any universal constant ρ. This disproves a conjecture of [Moss and Rabani, STOC 2001].Another related to mbb problem is the Shallow Light Steiner Tree (slst) problem, in which we are given a graph G = (V,E), costs {c(v):v ¿ V}, lengths {¿(v):v ¿ V}, a set U ¿ V of terminals, and a bound L. The goal is to find a subtree T of G containing U with and c(T) minimum. We give an algorithm that computes a tree T with and . Previously, a polylogarithmic bicriteria approximation was known only for the case of edge costs and edge lengths.
Dynamically Configurable Membership Support for Dependable Applications in Mobile Ad Hoc Networks
Authors: Juan Carlos García Ortiz, Stefan Beyer, Pablo Galdamez
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Mobile Ad hoc networks (MANETs) are characterised by the absence of a centralised infrastructure and are formed by heterogeneus mobile nodes. Power consumption and bandwidth are basic limitations for these systems. Dependability solutions and their underlying services, such as group membership can have a very large impact on both performance and power consumption in such an environment.Nevertheless, services can behave very differently in different mobility, system size and signal strength scenarios, and can be ﬁne tuned considerably. Static conﬁguration may not be sufﬁcient in environments as dynamic as MANETs, as the characteristics of the deployment scenario might vary during run time.In this paper we present a membership estimation service that is capable to react to network changes and conditions and adapt its parameters to obtain better performance, both in terms of power consumption and in terms of quality of information. Furthermore, we provide the result of performance experiments comparing a previous static approach with the improved dynamic system.
An algorithm for open text semantic parsing
Authors: Lei Shi, Rada Mihalcea
Venue: Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data (2004)

This paper describes an algorithm for open text shallow semantic parsing. The algorithm relies on a frame dataset (FrameNet) and a semantic network (WordNet), to identify semantic relations between words in open text, as well as shallow semantic features associated with concepts in the text. Parsing semantic structures allows semantic units and constituents to be accessed and processed in a more meaningful way than syntactic parsing, moving the automation of understanding natural language text to a higher level.
Analysis of Heating Furnace Temperature Control System Based on Expert Fuzzy Control
Authors: Zenghuan Liu, Likong Li, Lu Wen, Guangxiang He
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The temperature control problem has become animportant concern in heating furnace production. In thispaper, an expert fuzzy control strategy is put forward in orderto realize the optimum of the temperature in the billet heatingfurnace, which imports the expert system to the fuzzy control.At the same time, the structure of the expert system and fuzzycontroller are introduced. The production rule is adopted byusing if-then to express knowledge and a forward reasoningmethod is used to control rules from forward to backward.The objective is to provide computer-based support forindustries specialists or workers. When actual furnacetemperature deviates at a certain range by using fuzzy control,while a big deviation uses expert control. It is indicated that thestatic error is small and the control precision is high. Theapplication results show that the control scheme is feasible and effective.
The Improvement and Study of Detection Performance on PDT
Authors: Zhiyong Lei, Hanshan Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Photoelectric Detection Target (PDT) is applied in the outside to detect the projectile information when the flying projectile passing through. Its performance is affected by many factors, for example, the intensity of nature light, the field of detecting view, and the sensitivity of the sensor. Two novel methods are presented in this paper. The performance of the long rectangular photo detector with high response and low noise is analyzed and it be used to expand the field of detecting view. The controllable rectangle slit is designed and its width is controlled by programming. This measure can change the incident light energy and make the output voltage of the PDT keep in 1.2v-1.6v in most case. While the incident light energy is very low, the width of the slit is adjusted to the biggest. The experiment results in shooting range prove that the improved measures in the PDT are accurate and it can work more 500Lx stably.
Unsupervised concept discovery in Hebrew using simple unsupervised word prefix segmentation for Hebrew and Arabic
Authors: Elad Dinur, Dmitry Davidov, Ari Rappoport
Venue: Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages (2009)

Fully unsupervised pattern-based methods for discovery of word categories have been proven to be useful in several languages. The majority of these methods rely on the existence of function words as separate text units. However, in morphology-rich languages, in particular Semitic languages such as Hebrew and Arabic, the equivalents of such function words are usually written as morphemes attached as prefixes to other words. As a result, they are missed by word-based pattern discovery methods, causing many useful patterns to be undetected and a drastic deterioration in performance. To enable high quality lexical category acquisition, we propose a simple unsupervised word segmentation algorithm that separates these morphemes. We study the performance of the algorithm for Hebrew and Arabic, and show that it indeed improves a state-of-art unsupervised concept acquisition algorithm in Hebrew.
UP13: knowledge-poor methods (sometimes) perform poorly
Authors: Thierry Poibeau
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This short paper presents a system developed at the Universit&eacute; Paris 13 for the Semeval 2007 Metonymy Resolution Task (task #08, location name track; see Markert and Nissim, 2007). The system makes use of plain word forms only. In this paper, we evaluate the accuracy of this minimalist approach, compare it to a more complex one which uses both syntactic and semantic features, and discuss its usefulness for metonymy resolution in general.
Extending Test-Driven Development for Robust Web Services
Authors: Nuno Laranjeiro, Marco Vieira
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Research and practice show that a large number of web services are deployed with robustness problems (i.e., presenting unexpected behaviors in the presence of invalid inputs). Test-driven development, particularly suitable for web service environments, is a software development technique based on predefined test cases that are used during development to validate the desired software improvements or new functionalities. However, building representative test cases is quite difficult and developers often miss the test cases for robustness validation. This paper demonstrates how robustness testing can be integrated in the test driven development process to improve web services robustness. To demonstrate the proposed approach we have invited experienced developers to implement three different versions of the web services specified by the standard TPC-App performance benchmark, two following the standard test-driven development process and the other using the approach proposed in this paper. Results suggest that test-driven development coupled with robustness testing is a practical way to prevent the deployment of services with robustness problems.
WiMAX Research and Implementation
Authors: Zhou Yi, Zheng Xuefeng, Jia Jia
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Based on the analysis of key WiMAX technology, we aggregated the key advantages of WiMAX technology development, and given the WiMAX network implementation plan.
Inferring Dataflow Properties of User Defined Table Processors
Authors: Songtao Xia, Manuel Fähndrich, Francesco Logozzo
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

In SCOPE, a SQL style cloud-level data-mining scripting language, table processing capabilities are often provided by user defined .NET methods. The SCOPE compiler can optimize a query plan if it knows certain dataflow relations between the input and output tables, such as column independence, column equality, or that a column's values are non-null. This paper presents an automated analysis for inferring such relations from implementations of SCOPE table processing methods. Since most table processing methods are written as .NET iterators, our analysis must accurately deal with the resulting state-machine implementing such iterators. Other complications addressed are naming and estimating column numbers, aliasing and escaping, and the inference of universally quantified loop invariants.We prototyped the analysis as Scooby, a static analyzer for .NET iterators. Scooby is able to discover useful properties for typical SCOPE programs automatically and efficiently.
Mixed-Effects Modeling of Optimisation Algorithm Performance
Authors: Matteo Gagliolo, Catherine Legrand, Mauro Birattari
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

The learning curves of optimisation algorithms, plotting the evolution of the objective vs. runtime spent. can be viewed as a sample of longitudinal data. In this paper we describe mixed-effects modeling, a standard technique in longitudinal data analysis, and give an example of its application to algorithm performance modeling.
The Green Degree Assessment of the Automobile Reverse Logistics System
Authors: Meng Xiangru, Song Wei
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

With the development of production and the social progress, reverse logistics problem becomes more important; In China, along with strengthen of people environmental protection consciousness and can keep on development strategic of thorough public, the recovery of old product also be subjected to extensive concern. On the one hand, society appeals to the appropriate treatment of used product, on the other hand, companies also start pay attention to how to make better use of resources. That's all the problem of recovery logistics. This paper use the fuzzy comprehensive analysis method to judge the green degree of the automobile of reverse logistics, and to builds up a green degree factor sets, adopt the power value factor judgment method to made sure weighting of the assessment index sign, build up comment sets, construct and a adjudicated matrix in an experts investigating method, then get fuzzy result of the green degree of reverse logistics by calculating.
Bacterial Colony Chemotaxis Algorithm for Guillotine Rectangle Cutting Problem
Authors: Peng Wen, Liu Wen-xia
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Bacterial Colony Chemotaxis (BCC), which has good performance of global convergence and better convergence speed, is one of the new heuristic algorithms based on colony intelligence. In this paper, it is applied to the problem of guillotine rectangle cutting. The proposed algorithm not only automatically finds the best sequence of the rectangle pieces by BCC algorithm but also implements the exact constrained pattern. Experimental results show the effectiveness of our algorithm comparing with the other methods.
WordNet::SenseRelate::AllWords: a broad coverage word sense tagger that maximizes semantic relatedness
Authors: Ted Pedersen, Varada Kolhatkar
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Demonstration Session (2009)

WordNet::SenseRelate::AllWords is a freely available open source Perl package that assigns a sense to every content word (known to WordNet) in a text. It finds the sense of each word that is most related to the senses of surrounding words, based on measures found in WordNet::Similarity. This method is shown to be competitive with results from recent evaluations including Senseval-2 and Senseval-3.
Osa-express Implementation Guide
Venue:  (2009)

This IBM Redbooks publication will help you to install, tailor, and configure the Open Systems Adapter (OSA) features that are available on IBM System z10TM and IBM System z9 servers. It focuses on the hardware installation and the software definitions that are needed to provide connectivity to LAN environments. WhitepaperRedpaper WhitepaperRedpaper WhitepaperRedpaper WhitepaperRedpaper It provides information to help you with planning and system setup. It also includes helpful utilities and commands for monitoring and managing the OSA features. The target audience for this document is system engineers, network administrators, and system programmers who will plan for and install OSA features. The reader is expected to have a good understanding of System z hardware, HCD or IOCP, OSA/SF, SNA/APPN, and TCP/IP. 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
Point to Point Registration Based on MRI sequences
Authors: Quan Jin, Yuanzhi Cheng, Changyong Guo, Guixian Li, Yoshinobu Sato
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The purpose of this study is to develop a new method for the registration of 3D cartilage plates in the MR data set. This technique traces local cartilage thickness changes over time. In a first rough registration step, the principal axes transformation (PAX) and landmark methods are used. In the second step, an improved iterative closest point (ICP) method is used. The point sets from segmentation of MRI sequences are registratered in these processes. The experimental results demonstrate the effectiveness of this method for the registration of the MRI of knee cartilage over time based on the cartilage and bone interfaces.
Design and implementation of a lexicon of Dutch multiword expressions
Authors: Nicole Grégoire
Venue: Proceedings of the Workshop on a Broader Perspective on Multiword Expressions (2007)

This paper describes the design and implementation of a lexicon of Dutch multiword expressions (MWEs). No exhaustive research on a standard lexical representation of MWEs has been done for Dutch before. The approach taken is innovative, since it is based on the Equivalence Class Method. Furthermore, the selection of the lexical entries and their properties is corpus-based. The design of the lexicon and the standard representation will be tested in Dutch NLP systems. The purpose of the current paper is to give an overview of the decisions made in order to come to a standard lexical representation and to discuss the description fields this representation comprises.
An Integrated System for Payment Management in Construction
Authors: Zhou Ying, Ding Lie-yun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Payment management in construction is an important aspect of project management, as it involves the direct benefits of both owners and contractors. However, it always has a complicated process, a long work cycle and low efficiency in construction. The development of payment management systems can provide a fair platform to the owners and contractors so that it can solve the problems in payment working process. In this article, the systematic professional process of payment and system structure were designed. Based on this, network and database are built and the implementation of the payment management system is introduced that it has been applied in wuhan railway construction. Also, the evaluation of the system is given at the end of the paper.
Approximability Distance in the Space of H-Colourability Problems
Authors: Tommy Färnqvist, Peter Jonsson, Johan Thapper
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted Maximum H -Colourable Subgraph problem (Max H -Col). The instances of this problem are edge-weighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under the condition that the subgraph has a homomorphism to H; note that for H = K k this problem is equivalent to Max k -cut. To this end, we introduce a metric structure on the space of graphs which allows us to extend previously known approximability results to larger classes of graphs. Specifically, the approximation algorithms for Max cut by Goemans and Williamson and Max k -cut by Frieze and Jerrum can be used to yield non-trivial approximation results for Max H -Col. For a variety of graphs, we show near-optimality results under the Unique Games Conjecture. We also use our method for comparing the performance of Frieze Jerrum's algorithm with Håstad's approximation algorithm for general Max 2-Csp. This comparison is, in most cases, favourable to Frieze Jerrum.