ppxscal/embedding_network huggingface dataset:
Branch replication scheme: A new model for data replication in large scale data grids
Authors: José M. Pérez, Félix García-Carballeira, Jesús Carretero, Alejandro Calderón, Javier Fernández
Venue: Future Generation Computer Systems (2010)

Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. These solutions require huge storage resources to store the whole set of replicas and do not allow efficient data modification to avoid the consistency problem. In this paper we propose a new replication method, called the Branch Replication Scheme (BRS), that provides three main advantages over traditional approaches: optimizing storage usage, by creating subreplicas; increasing data access performance, by applying parallel I/O techniques; and providing the possibility to modify the replicas, by maintaining consistency among updates in an efficient way. An analytical model of the replication scheme, naming system, and replica updating scheme are formally described in the paper. Using this model, operations such as reading, writing, or updating a replica are analyzed. Simulation results demonstrate the feasibility of BRS, as they show that the new replication algorithm increases data access performance, compared with popular replication schemes such as hierarchical and server-directed replication, which are commonly used in current data grids.
Capacity of large-scale CSMA wireless networks
Authors: Chi-Kin Chau, Minghua Chen, Soung Chang Liew
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on CSMA (carrier-sensing multi-access), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is that whether CSMA networks can be as scalable as TDMA networks. To answer this question and explore the capacity of CSMA networks, we first formulate the models of CSMA protocols to take into account the unique CSMA characteristics, not captured by existing interference models in the literature. These CSMA models determine the feasible states, and consequently the capacity of CSMA networks. %and are functions of various CSMA parameters. We then study the throughput efficiency of CSMA scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to maximize the throughput to the optimal order. As a result, we show that CSMA can achieve throughput as Ω(1/√n), the same order as optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use of an efficient backbone-peripheral routing scheme and a careful design of dual carrier-sensing and dual channel scheme. We also address practical implementation issues of our capacity-optimal CSMA scheme.
Measuring the Subjective User eXperience
Authors: Maurits Kaptein
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Measuring the subjective user experience is a challenging task. In this tutorial we will demonstrate how psychological constructs can be divided in separate variables, each measured by its individual questionnaire items. The tutorial will address the analysis of the questionnaire data to estimate its validity and reliability. Analysis will be demonstrated using SPSS.Duration: 3 hours total.
A Cognitive-Interactive Approach to Chinese Characters Learning: System Design and Development
Authors: Yu-Ju Lan, Yao-Ting Sung, Chia-Yu Wu, Rui-Lin Wang, Kuo-En Chang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

A solid knowledge of Chinese characters plays an important role in Chinese reading. Essentially, Chinese characters, a graphic- based orthographic rule, are much different from the words of an alphabetic language, such as English, French, etc. The uniqueness of Chinese characters make it is extremely difficult for most of the CFL/CSL learners no matter what their nationalities are. In this paper we developed a Chinese character learning system based on a cognitive-interactive perspective to help CFL/CSL learners learn Chinese characters. The results of a preliminary survey show that most of the surveyed CSL learners approved the learning system's design rationale as well as made positive comments on the system learning effect upon their Chinese character knowledge construction.
Methods and tricks used in an attempt to pass the Turing test
Authors: V. Bastin, D. Cordier
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This paper describes differents methods and tricks in connection with our program which has been entered in the Loebner Prize competition that will happen on Sunday 11 January 1998, at the PowerHouse Museum in Sydney. Of course, this isn't exhaustive, there are other possible techniques but we aim to give the main ideas. We'll speak about the main modules of our program: Spelling correction, Different uses of WordNet, and Generation of comments. Our module used for spelling correction was developed on the basis of works by Brill [1], Brill and Marcus [2], Golding [3], Golding and Schabes [4], and Powers [5].
XJava: Exploiting Parallelism with Object-Oriented Stream Programming
Authors: Frank Otto, Victor Pankratius, Walter F. Tichy
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

This paper presents the XJava compiler for parallel programs. It exploits parallelism based on an object-oriented stream programming paradigm. XJava extends Java with new parallel constructs that do not expose programmers to low-level details of parallel programming on shared memory machines. Tasks define composable parallel activities, and new operators allow an easier expression of parallel patterns, such as pipelines, divide and conquer, or master/worker. We also present an automatic run-time mechanism that extends our previous work to automatically map tasks and parallel statements to threads.We conducted several case studies with an open source desktop search application and a suite of benchmark programs. The results show that XJava reduces the opportunities to introduce synchronization errors. Compared to threaded Java, the amount of code could be reduced by up to 39%. The run-time mechanism helped reduce effort for performance tuning and achieved speedups up to 31.5 on an eight core machine.
An Improved Differential Evolution Alogorithm for Optimization
Authors: Jin Huibin, Liu Mingguang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Differential Evolution (DE) is an efficient approach capable of handling non-differentiable, non-linear and multi-model objective functions. However, in convergence speed and global optimization, there is still much room for DE to be improved. In this paper, double best mutation operation and chaos Differential Evolution are proposed to improve DE algorithm’s optimized performance. The simulated cases show modified differential evolution algorithm has rapid convergence speed and strong steadiness.
Wired/Wirless Heterogeneous Network Performance Comprehensive Evaluation
Authors: Xin Li, Chan Zhou, Min-Rui Fei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

According to the performance requirements on wired/wireless heterogeneous network at industrial field, a network performance comprehensive evaluation approach based on fuzzy analytic hierarchy process (FAHP) is presented. With different effects on the performance of different traffic requirements and parameters, we quantitative the network comprehensive performance, which could be a reference for network building or modification by users. The acquisition of network comprehensive performance index parameters is analyzed and the network performance comprehensive evaluation values under different circumstances are compared by using a wired/wireless heterogeneous network simulation model. The experimental results show that proposed approach based on FAHP is accurate and effective for the performance evaluation on industrial heterogeneous network.
Designing a Peer Reviewing Tool on Lecture Video with Handwritten Annotation
Authors: Hironori Egi, Shotaro Houri, Yukari Kato, Tatsuya Terada, Wataru Tsukahara, Masaki Nakagawa
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)

To improve lessons in accordance with students' comprehension levels, evaluation of teaching performance has been carried out by questionnaire and lesson study. However, lesson study in the context of faculty development is difficult for participants to spend long time for classroom observation and reflective discussion. Even if they have time for discussion, unfocused discussion often causes less fruitful and mutual understanding. We are developing an annotation tool not only to solve the above-mentioned time and space constraint but provide benefits owing to archiving lessons and their reviews. We design a pen-based annotation tool by which reviewers can write comments and draw marks onto on-line and off-line movie of class observation. The details of the annotation tool and user feedback from preliminary experiment in actual classrooms are described in this paper.
Research on Improving Performance of Semantic Search in UDDI
Authors: Jingyu Zhang, Xueli Yu, Peng Liu, Zhen Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The proliferation of Web services demands for a discovery mechanism to find advertisements that satisfy the requests more accurately. OWL-S provides a capability-based description and logic inference mechanism for semantically matching. UDDI provides a registry of businesses and Web services, but its keyword search mechanism produces lack of semantics and coarse results. Research on OWL-S/UDDI matchmaker to combine the two technologies is on the way. We propose a matching algorithm with additional clustering to improve the performance of semantic match based on OWL-S and to make the request semantically match against the advertisements more accurately available. The experiment results show the improvement in the performance of the service discovery.
Clustering with local and global regularization
Authors: Fei Wang, Changshui Zhang, Tao Li
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Clustering is an old research topic in data mining and machine learning communities. Most of the traditional clustering methods can be categorized local or global ones. In this paper, a novel clustering method that can explore both the local and global information in the dataset is proposed. The method, Clustering with Local and Global Consistency (CLGR), aims to minimize a cost function that properly trades off the local and global costs. We will show that such an optimization problem can be solved by the eigenvalue decomposition of a sparse symmetric matrix, which can be done efficiently by some iterative methods. Finally the experimental results on several datasets are presented to show the effectiveness of our method.
Inducing compact but accurate tree-substitution grammars
Authors: Trevor Cohn, Sharon Goldwater, Phil Blunsom
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Tree substitution grammars (TSGs) are a compelling alternative to context-free grammars for modelling syntax. However, many popular techniques for estimating weighted TSGs (under the moniker of Data Oriented Parsing) suffer from the problems of inconsistency and over-fitting. We present a theoretically principled model which solves these problems using a Bayesian non-parametric formulation. Our model learns compact and simple grammars, uncovering latent linguistic structures (e.g., verb subcategorisation), and in doing so far out-performs a standard PCFG.
Hapax Legomena: Their Contribution in Number and Efficiency to Word Alignment
Authors: Adrien Lardilleux, Yves Lepage
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

Current techniques in word alignment disregard words with a low frequency because they would not be useful. Against this belief, this paper shows that, in particular, the notion of hapax legomena may contribute to word alignment to a large extent. In an experiment, we show that pairs of corpus hapaxes contribute to the majority of the best word alignments. In addition, we show that the notion of sentence hapax justifies a practical and common simplification of standard alignment methods.
Evaluating the syntactic transformations in gold standard corpora for statistical sentence compression
Authors: Naman K. Gupta, Sourish Chaudhuri, Carolyn P. Rosé
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

We present a policy-based error analysis approach that demonstrates a limitation to the current commonly adopted paradigm for sentence compression. We demonstrate that these limitations arise from the strong assumption of locality of the decision making process in the search for an acceptable derivation in this paradigm.
Exploring design space for an integrated intelligent system
Authors: Nick Hawes, Jeremy Wyatt, Aaron Sloman
Venue: Knowledge-Based Systems (2009)

Understanding the trade-offs available in the design space of intelligent systems is a major unaddressed element in the study of Artificial Intelligence. In this paper, we approach this problem in two ways. First, we discuss the development of our integrated robotic system in terms of its trajectory through design space. Second, we demonstrate the practical implications of architectural design decisions by using this system as an experimental platform for comparing behaviourally similar yet architecturally different systems. The results of this show that our system occupies a ''sweet spot'' in design space in terms of the cost of moving information between processing components.
Floating-point to Fixed-point Transformation Using Extreme Value Theory
Authors: Linsheng Zhang, Yan Zhang, Wenbiao Zhou
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Efficient hardware implementation of digital signal processing and communication algorithms requires using fixed-point arithmetic. However, most of these algorithms are developed in floating-point arithmetic. The automation of floating-point to fixed-point transformation is a key step for high-level synthesis. Based on Extreme Value Theory, this paper presents a novel approach to find both the optimal integer and fractional bit-widths for signals. Compared to traditional full simulation-based methods, this approach uses lightweight simulations to study the characteristics of extreme conditions. With theoretical probabilities to prevent overflows and meet the output error constraint, the proposed approach provides more practical solutions than those by analytical methods. Case studies and experimental results demonstrate its efficiency.
Revisiting optimal decoding for machine translation IBM model 4
Authors: Sebastian Riedel, James Clarke
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

This paper revisits optimal decoding for statistical machine translation using IBM Model 4. We show that exact/optimal inference using Integer Linear Programming is more practical than previously suggested when used in conjunction with the Cutting-Plane Algorithm. In our experiments we see that exact inference can provide a gain of up to one BLEU point for sentences of length up to 30 tokens.
Learning equilibrium in resource selection games
Authors: Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible costs, and that the cost functions are positive and nondecreasing. The game is played repeatedly and after every stage each player observes her cost, and the actions of all players. For every Ε > 0 we prove the existence of a learning Ε-equilibrium, which is a profile of algorithms, one for each player such that a unilateral deviation of a player is, up to ε not beneficial for her regardless of the actual cost functions. Furthermore, the learning eqUilibrium yields an optimal social cost.
Supporting Q&A in a Web-Based Japanese Language Learning Environment
Authors: Yuqin Liu, Chengjiu Yin, Hiroaki Ogata
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

This paper proposes a question and answer e-Learning system for Japanese language learning.Utilizing the system, learners ask the questions and teachers answer the question. This is an a synchronousand synchronous teaching-learning environment. To alleviate the burden of teachers, the system checks whether there is a same Q&A in FAQ or not, if the same Q&Aexists, then the system answers the question automatically. We also found that the learning effects are related to the times for taking part in the discussions. In this paper, we describe the design, implementation and evaluation of the system.
Brief paper: Region-based shape control for a swarm of robots
Authors: Chien Chern Cheah, Saing Paul Hou, Jean Jacques E. Slotine
Venue: Automatica (Journal of IFAC) (2009)

This paper presents a region-based shape controller for a swarm of robots. In this control method, the robots move as a group inside a desired region while maintaining a minimum distance among themselves. Various shapes of the desired region can be formed by choosing the appropriate objective functions. The robots in the group only need to communicate with their neighbors and not the entire community. The robots do not have specific identities or roles within the group. Therefore, the proposed method does not require specific orders or positions of the robots inside the region and yet different formations can be formed for a swarm of robots. A Lyapunov-like function is presented for convergence analysis of the multi-robot systems. Simulation results illustrate the performance of the proposed controller.
Exploiting discourse structure for spoken dialogue performance analysis
Authors: Mihai Rotaru, Diane J. Litman
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

In this paper we study the utility of discourse structure for spoken dialogue performance modeling. We experiment with various ways of exploiting the discourse structure: in isolation, as context information for other factors (correctness and certainty) and through trajectories in the discourse structure hierarchy. Our correlation and PARADISE results show that, while the discourse structure is not useful in isolation, using the discourse structure as context information for other factors or via trajectories produces highly predictive parameters for performance analysis.
Sensor-Less Jam Fault Detection of Electro-hydraulic Executive Device under Interval-Valued Intuitionistic Fuzzy Circumstance
Authors: Weibo Lee, HongWei Shen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

This paper presents a novel jam fault diagnosis method for electro-hydraulic executive device of steam turbine based on electro-reflection and interval-valued intuitionistic fussy sets (IVIFSs) theory. Theoretical analysis and modeling research are conducted to reveal the relationship between jam fault and the peak-to-peak value of the oscillation current (PVOC). Then we constructed a proportional valve load simulation device to carry out experimental and model based research. The results show that the variation of PVOC changes non-monotonically when jam fault occurs and thus has a characteristic of uncertain and interval-valued. To overcome the problem, the concept of IVIFS is introduced, and the distance between two IVIFSs is defined. Then, the similarity degree between the detected variation of PVOC and the knowledge of jam fault is evaluated. The level of jam fault is determined according to the similarity degree.
Spectra of Algebraic Fields and Subfields
Authors: Andrey Frolov, Iskander Kalimullin, Russell Miller
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

An algebraic field extension of ¿ or ¿/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure $\overline{F}$ (either $\overline{\mathbb{Q}}$ or $\overline{{\mathbb{Z}}/(p)}$). We consider the Turing degree spectrum of F in both cases, as a structure and as a relation on $\overline{F}$, and characterize the sets of Turing degrees that are realized as such spectra. The results show a connection between enumerability in the structure F and computability when F is seen as a subfield of $\overline{F}$.
Refinement Approach for Adaptation Based on Combination of MAP and fMLLR
Authors: Zbyněk Zajíc, Lukáš Machlica, Luděk Müller
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

This paper deals with a combination of basic adaptation techniques of Hidden Markov Model used in the speech recognition. The adaptation methods approach the data only through their statistics, which have to be accumulated before the adaptation process. When performing two adaptations subsequently, the data statistics have to be accumulated twice in each of the adaptation passes. However, when the adaptation methods are chosen with care, the data statistics may be accumulated only once, as proposed in this paper. This significantly reduces the time consumption and avoids the need to store all the adaptation data. Combination of Maximum A-Posteriori Probability and feature Maximum Likelihood Linear Regression adaptation is considered. Motivation for such an approach could be the on-line adaptation, where the time consumption is of big importance.