ppxscal/embedding_network huggingface dataset:
On the placement of infrastructure overlay nodes
Authors: Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. Charlie Hu, Lili Qiu
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under the constraints of deployment costs in terms of hardware, network connectivity and human effort, it is critical to carefully place infrastructure overlay nodes to balance the tradeoff between performance and resource constraints. In this paper, we investigate approaches to perform intelligent placement of overlay nodes to facilitate (i) resilient routing and (ii) TCP performance improvement. We formulate objective functions to capture application behavior: reliability and TCP performance, and develop several placement algorithms, which offer a wide range of tradeoffs in complexity and required knowledge of the client-server location and traffic load. Using simulations on synthetic and real Internet topologies, and PlanetLab experiments, we demonstrate the effectiveness of the placement algorithms and objective functions developed, respectively. We conclude that a hybrid approach combining greedy and random approaches provides the best tradeoff between computational efficiency and accuracy. We also uncover the fundamental challenge in simultaneously optimizing for reliability and TCP performance, and propose a simple unified algorithm to achieve both.
Syntactic phrase reordering for English-to-Arabic statistical machine translation
Authors: Ibrahim Badr, Rabih Zbib, James Glass
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Syntactic Reordering of the source language to better match the phrase structure of the target language has been shown to improve the performance of phrase-based Statistical Machine Translation. This paper applies syntactic reordering to English-to-Arabic translation. It introduces reordering rules, and motivates them linguistically. It also studies the effect of combining reordering with Arabic morphological segmentation, a preprocessing technique that has been shown to improve Arabic-English and English-Arabic translation. We report on results in the news text domain, the UN text domain and in the spoken travel domain.
Generating a non-English subjectivity lexicon: relations that matter
Authors: Valentin Jijkoun, Katja Hofmann
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We describe a method for creating a non-English subjectivity lexicon based on an English lexicon, an online translation service and a general purpose thesaurus: Wordnet. We use a PageRank-like algorithm to bootstrap from the translation of the English lexicon and rank the words in the thesaurus by polarity using the network of lexical relations in Wordnet. We apply our method to the Dutch language. The best results are achieved when using synonymy and antonymy relations only, and ranking positive and negative words simultaneously. Our method achieves an accuracy of 0.82 at the top 3,000 negative words, and 0.62 at the top 3,000 positive words.
A Logical and Graphical Operation of a Graph-Based Data Model
Authors: Teruhisa Hochin, Hiroki Nomiya
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The contents of multimedia data has complex relationships. A data model incorporating the concepts of directed graphs, recursive graphs, and hypergraphs has been proposed for representing the contents of multimedia data. This data model represents an instance with a directed recursive hypergraph called an instance graph. This paper introduces an operation for manipulating instance graphs easily. The operation is rewrite operation. This is a logic-based, and graphical one. The formal definition of this operation is described. This operation is evaluated by comparing with other ones of graph-based data models.
Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering
Authors: Éric Schost, Arash Hariri
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

Following the previous work by Bajard-Didier-Kornerup, McLaughlin, Mihailescu and Bajard-Imbert-Jullien, we present an algorithm for modular polynomial multiplication that implements the Montgomery algorithm in a residue basis; here, as in Bajard et al.'s work, the moduli are trinomials over ${\mathbb{F}}_2$. Previous work used a second residue basis to perform the final division. In this paper, we show how to keep the same residue basis, inspired by l'Hospital rule. Additionally, applying a divide-and-conquer approach to the Chinese remaindering, we obtain improved estimates on the number of additions for some useful degree ranges.
Selective Replicated Declustering for Arbitrary Queries
Authors: K. Yasin Oktay, Ata Turk, Cevdet Aykanat
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in applications such as geographic information systems that access huge amounts of data. Declustering with replication is an extension of declustering with possible data replicas in the system. Many replicated declustering schemes have been proposed. Most of these schemes generate two or more copies of all data items. However, some applications have very large data sizes and even having two copies of all data items may not be feasible. In such systems selective replication is a necessity. Furthermore, existing replication schemes are not designed to utilize query distribution information if such information is available. In this study we propose a replicated declustering scheme that decides both on the data items to be replicated and the assignment of all data items to disks when there is limited replication capacity. We make use of available query information in order to decide replication and partitioning of the data and try to optimize aggregate parallel response time. We propose and implement a Fiduccia-Mattheyses-like iterative improvement algorithm to obtain a two-way replicated declustering and use this algorithm in a recursive framework to generate a multi-way replicated declustering. Experiments conducted with arbitrary queries on real datasets show that, especially for low replication constraints, the proposed scheme yields better performance results compared to existing replicated declustering schemes.
The Preliminary Research of the Data Center Technology for Urban Communications Network Resources Management
Authors: Luo Jin, Wang Dian-Hong, Zu Xiao-Fang, Wu Xin-Cai
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

In this paper, after fully discussed workflow and components techniques in home and abroad, the author put forward urban communication network resource management data center theory and describe design project in detail, with a new generation of GIS software architecture theory and communication network resource management system experience, this academic research and practical innovation has great significance for communication GIS.
Equivalence Relations on Classes of Computable Structures
Authors: Ekaterina B. Fokina, Sy-David Friedman
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

If $\mathcal{L}$ is a finite relational language then all computable $\mathcal{L}$-structures can be effectively enumerated in a sequence in such a way that for every computable $\mathcal{L}$-structure $\mathcal{B}$ an index n of its isomorphic copy can be found effectively and uniformly. Having such a universal computable numbering, we can identify computable structures with their indices in this numbering. If K is a class of $\mathcal{L}$-structures closed under isomorphism we denote by K c the set of all computable members of K. We measure the complexity of a description of K c or of an equivalence relation on K c via the complexity of the corresponding sets of indices. If the index set of K c is hyperarithmetical then (the index sets of) such natural equivalence relations as the isomorphism or bi-embeddability relation are $\Sigma^1_1$. In the present paper we study the status of these $\Sigma^1_1$ equivalence relations (on classes of computable structures with hyperarithmetical index set) within the class of $\Sigma^1_1$ equivalence relations as a whole, using a natural notion of hyperarithmetic reducibility.
Improved sentence alignment on parallel web pages using a stochastic tree alignment model
Authors: Lei Shi, Ming Zhou
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Parallel web pages are important source of training data for statistical machine translation. In this paper, we present a new approach to sentence alignment on parallel web pages. Parallel web pages tend to have parallel structures, and the structural correspondence can be indicative information for identifying parallel sentences. In our approach, the web page is represented as a tree, and a stochastic tree alignment model is used to exploit the structural correspondence for sentence alignment. Experiments show that this method significantly enhances alignment accuracy and robustness for parallel web pages which are much more diverse and noisy than standard parallel corpora such as "Hansard". With improved sentence alignment performance, web mining systems are able to acquire parallel sentences of higher quality from the web.
Comparison of Mobile Device Navigation Information Display Alternatives from the Cognitive Load Perspective
Authors: Murat Can Cobanoglu, Ahmet Alp Kindiroglu, Selim Balcisoy
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

In-vehicle information systems (IVIS) should minimize the cognitive load on the drivers to reduce any risk of accidents. For that purpose we built an experiment in which two alternatives for information display are compared. One alternative is the traditional information display method of showing a map with the target route highlighted in red. This is compared against a proposed alternative for information display in which prior to a junction a ground-level photo is displayed with a large red arrow pointing at the correct route the driver must take. The photo-enhanced information display method required 39% more time spent while gazing at the screen but provided a 10% reduction in the total number of headturns. Based on the participant comments, 80% of whom opted for the non-photo enhanced method, we concluded that the cognitive load brought on by the photo-enhancement is not worth the return.
From GEMINI to DiaGen: improving development of speech dialogues for embedded systems
Authors: Stefan W. Hamerich
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

In this paper DiaGen is presented, a tool that provides support in generating code for embedded dialogue applications. By aid of it, the dialogue development process is speeded up considerably. At the same time it is guaranteed that only well-formed and well-defined constructs are used. Having had its roots in the EU-funded project GEMINI, fundamental changes were necessary to adopt it to the requirements of the application environment. Additionally within this paper the basics of embedded speech dialogue systems are covered.
Test-Driven Development for Spreadsheet Risk Management
Authors: Kevin McDaid, Alan Rust
Venue: IEEE Software (2009)

Spreadsheet technology is central to the functioning of the financial sector, but professionally created spreadsheets have a high level of error, which highlights the need for innovative supporting processes and tools. The current global financial crisis will likely accelerate this need because anticipated regulation will require novel, innovative risk management methods and technologies that cover development, risk assessment, review, and other spreadsheet activities. These methods will need to be easy to understand and use and will have to serve multiple stakeholders' needs. Test-driven spreadsheet development (TDSD) is one such method. TDSD provides an ideal fit with existing market-leading spreadsheet management processes and can assist managers and auditors in the assessment and control of spreadsheet risk.
Cryptic crossword clues: generating text with a hidden meaning
Authors: David Hardcastle
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

This paper discusses the generation of cryptic crossword clues: a task that involves generating texts that have both a surface reading, based on a natural language interpretation of the words, and a hidden meaning in which the strings that form the text can be interpreted as a puzzle. The process of clue generation realizes a representation of the hidden, puzzle meaning of the clue through the aggregation of chunks of text. As these chunks are combined, syntactic and semantic selectional constraints are explored, and through this language understanding task a meaningful surface reading is recovered. This hybrid language generation/language understanding process transforms a representation of the clue as a word puzzle into a representation of some meaningful assertion in the domain of the real world, mediated through the generated multi-layered text; a text which has two separate readings.
Intelligent Interface for Elderly Games
Authors: Changhoon Park
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

This paper proposes an intelligent interface to improve the game accessibility for the elderly based on the multimodal interface and dynamic load balancing. This approach aims to control the fidelity of feedback and the level of difficulty dynamically when the elderly become bored or frustrated with the game. By applying the proposed intelligent interface, we will present the implementation of a rhythm game for the elderly with a specialized game controller like a drum.
A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
Authors: Ming-Chang Lee
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd's algorithm and analyzes empirical study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cluster), which is not supercomputer. Firstly, we represent standard, strassen and winograd algorithm for matrix-matrix multiplication. Secondly, we develop a parallel implementation with master- slave processor. Thirdly, the efficiency of the proposed implementations is evaluated by using PVM.
ADEB: A Dynamic Alert Degree Evaluation Model for Blogosphere
Authors: Yu Weng, Changjun Hu, Xiaoming Zhang
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

This paper proposes a dynamic alert degree evaluation model (named ADEB) for blogosphere to improve the poor tracking ability of topic spreading in traditional topic detection models. The model comprehensively considers the mutual influence of the alert text and the spreading speed, and dynamically modifies the evaluation results by analyzing the alert topic occurring frequency, reviews, comments and existing time of the blog topic. Through tracking the alert blog topic generation and spreading, ADEB effectively avoids the inaccuracy of the static alert limit threshold, shortens the alert response time and improves the detection ability of the burst alert. To validate the performance of ADEB, the experiments on the data corpus about "Campus Network Culture" demonstrate that ADEB has higher application validity and practicality of alert evaluation for blogosphere.
Tri-Cluster-Tri-Scheme-Training: Exploiting Unlabeled Data for Transmembrane Segments Prediction
Authors: Jieyue He, R. Harrison, Phang C. Tai, Yi Pan
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Recent work using supervised learning for protein structure prediction has achieved state-of-the-art classification performance. However, such methods are based only on labeled data, while in practice the labeled data is so few and expensive to obtain and unlabeled data is far more plentiful. An effective way to enhance the performance of the learned hypothesis by using the labeled and unlabeled data together is known as semi-supervised learning. Although there are lots of semi-supervised learning methods, those approaches could not always achieve the acceptable results for bioinformatics application, especially when there is only very few labeled instances. Therefore, in this paper, we present a novel, more effective method Tri-Cluster-Tri-Scheme-training (TCTS) which firstly uses tri-cluster to label some high confidence unlabeled instances and then refines the classifiers by utilizing both of the label data and unlabeled data in the Tri-Scheme-training by different schemes. The encouraging experimental results indicate that TCTS algorithm opens a new way to solve the complex classification problem when very few labeled datasets are available.
SVD-Based Ghost Circuitry Detection
Authors: Michael Nelson, Ani Nahapetian, Farinaz Koushanfar, Miodrag Potkonjak
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

Ghost circuitry (GC) insertion is the malicious addition of hardware in the specification and/or implementation of an IC by an attacker intending to change circuit functionality. There are numerous GC insertion sources, including untrusted foundries, synthesis tools and libraries, testing and verification tools, and configuration scripts. Moreover, GC attacks can greatly compromise the security and privacy of hardware users, either directly or through interaction with pertinent systems, application software, or with data. GC detection is a particularly difficult task in modern and pending deep submicron technologies due to intrinsic manufacturing variability. Here, we provide algebraic and statistical approaches for the detection of ghost circuitry. A singular value decomposition (SVD)-based technique for gate characteristic recovery is applied to solve a system of equations created using fast and non-destructive measurements of leakage power and/or delay. This is then combined with statistical constraint manipulation techniques to detect embedded ghost circuitry. The effectiveness of the approach is demonstrated on the ISCAS 85 benchmarks.
Demo abstract: Operating a sensor network at 3500 m above sea level
Authors: Jan Beutel, Stephan Gruber, Andreas Hasler, Roman Lim, Andreas Meier, Christian Plessl, Igor Talzi, Lothar Thiele, Christian Tschudin, Matthias Woehrle, Mustafa Yuecel
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Sensor networks deployed in remote locations require easy to use but also extremely expressive tools for reliable operation. The PermaSense project has developed a platform based on a number of proven COTS components and integrated with the GSN based data backend. All tools are accessible from a single location in a web browser. This demo will present the monitoring and control tools in live operation with deployments on real field sites in the Swiss Alps.
Answer set planning under action costs
Authors: Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
Venue: Journal of Artificial Intelligence Research (2003)

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language κc, which extends the declarative planning language κ by action costs. κc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing "shortest" plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language κc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved.
Efficient Quantum Tensor Product Expanders and k-Designs
Authors: Aram W. Harrow, Richard A. Low
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Quantum expanders are a quantum analogue of expanders, and k-tensor product expanders are a generalisation to graphs that randomise k correlated walkers. Here we give an efficient construction of constant-degree, constant-gap quantum k-tensor product expanders. The key ingredients are an efficient classical tensor product expander and the quantum Fourier transform. Our construction works whenever k = O(n/logn), where n is the number of qubits. An immediate corollary of this result is an efficient construction of an approximate unitary k-design, which is a quantum analogue of an approximate k-wise independent function, on n qubits for any k = O(n/logn). Previously, no efficient constructions were known for k > 2, while state designs, of which unitary designs are a generalisation, were constructed efficiently in [1].
Using semantic and syntactic graphs for call classification
Authors: Dilek Hakkani-Tür, Gokhan Tur, Ananlada Chotimongkol
Venue: Proceedings of the ACL Workshop on Feature Engineering for Machine Learning in Natural Language Processing (2005)

In this paper, we introduce a new data representation format for language processing, the syntactic and semantic graphs (SSGs), and show its use for call classification in spoken dialog systems. For each sentence or utterance, these graphs include lexical information (words), syntactic information (such as the part of speech tags of the words and the syntactic parse of the utterance), and semantic information (such as the named entities and semantic role labels). In our experiments, we used written language as the training data while computing SSGs and tested on spoken language. In spite of this mismatch, we have shown that this is a very promising approach for classifying complex examples, and by using SSGs it is possible to reduce the call classification error rate by 4.74% relative.