ppxscal/embedding_network huggingface dataset:
Data processing and workflow scheduling in cluster computing systems
Authors: David J. Dewitt
Venue:  (2008)

The data explosion in the scientific and commercial domains has led to a renewed interest in the use of cluster computing for parallel data processing. Broadly, cluster computing systems can be split into three classes batch computing systems, MapReduce and parallel database management systems. All of these systems have their advantages and disadvantages. Condor, a popular batch computing system, can be used in a wide variety of domains due to its ability to execute user-specified workflows. However, it lacks support for distributed data management and the ability to parallelize data-intensive applications. On the other hand, MapReduce and parallel database systems have the ability to automatically parallelize user applications. Both have some support for distributed data management, but are more specialized in the kinds of applications that can be run. In this document, we demonstrate the benefits of distributed data management in Condor and outline a data-aware workflow scheduling mechanism that is suited to data-intensive applications. These features are also implemented in Clustera, a new cluster management system. Central to the architecture of Clustera is a application server backed by a database that stores the operational information that is used and produced in the cluster. Despite their differences, all three classes of cluster computing systems execute workflows consisting of tasks with data dependencies over a cluster of machines. In Clustera, we bridge the gap between these systems by building a logical data layer and abstract workflow layer over the core functionality of distributed data management and workflow execution. Thus, while Clustera is flexible enough to execute workflows from a wide variety of domains, it also possesses the ability to automatically parallelize and execute applications expressed in high-level terms, such as a SQL query over relational tables, or a MapReduce workflow.
First principles planning in BDI systems
Authors: Lavindra de Silva, Sebastian Sardina, Lin Padgham
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning within such systems. However, this has either focussed on producing low-level plan sequences, losing much of the domain knowledge inherent in BDI systems, or has been limited to HTN (Hierarchical Task Network) planning, which cannot find plans other than those specified by the programmer. In this work, we incorporate classical planning into a BDI agent, but in a way that respects and makes use of the procedural domain knowledge available, by producing abstract plans that can be executed using such knowledge. In doing so, we recognize an intrinsic tension between striving for abstract plans and, at the same time, ensuring that unnecessary actions, unrelated to the specific goal to be achieved, are avoided. We explore this tension, by first characterizing the set of "ideal" abstract plans that are non-redundant while maximally abstract, and then developing a more limited but feasible account in which an abstract plan is "specialized" into a new abstract plan that is non-redundant and preserves abstraction as much as possible. We describe an algorithm to compute such a plan specialization, as well as algorithms for the production of a valid high level plan, by deriving abstract planning operators from the BDI program.
Application of the OBD method for optimization of neural state variable estimators of the two-mass drive system
Authors: Teresa Orlowska-Kowalska, Marcin Kaminski
Venue: Neurocomputing (2009)

This paper presents neural estimators of the mechanical state variables of the electrical drive system with elastic joints. The non-measurable state variables, as the torsional torque and the load machine speed are estimated using multilayer feed-forward neural networks. The main stages of the design methodology of these neural estimators are presented. The optimal brain damage method is implemented for the structure optimization of each neural network. Then signals estimated by neural estimators are tested in the electrical drive control structure with additional feedbacks from the estimated shaft torque and the difference between the motor and the load speeds. The simulation results show good accuracy of both presented neural estimators for the wide range of changes of the reference speed and the load torque. The simulation results are then verified by laboratory experiments.
Mining exception-handling rules as sequence association rules
Authors: Suresh Thummalapenta, Tao Xie
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Programming languages such as Java and C++ provide exception-handling constructs to handle exception conditions. Applications are expected to handle these exception conditions and take necessary recovery actions such as releasing opened database connections. However, exception-handling rules that describe these necessary recovery actions are often not available in practice. To address this issue, we develop a novel approach that mines exception-handling rules as sequence association rules of the form “(FC1c1…FCcn) ∧ FCa ⇒ (FCe1…FCem)”. This rule describes that function call FCa should be followed by a sequence of function calls (FCe1…FCem) when FCa is preceded by a sequence of function calls (FCe1…FCcn). Such form of rules is required to characterize common exception-handling rules. We show the usefulness of these mined rules by applying them on five real-world applications (including 285 KLOC) to detect violations in our evaluation. Our empirical results show that our approach mines 294 real exception-handling rules in these five applications and also detects 160 defects, where 87 defects are new defects that are not found by a previous related approach.
A Comparison of Web Service Interface Similarity Measures
Authors: Natallia Kokash
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

Web service technology allows access to advertised services despite of their location and implementation platform. However, considerable differences on structural, semantical and technical levels along with the growing number of available web services makes their discovery a significant challenge. Keyword-based matchmaking methods can help users to locate quickly the set of potentially useful services, but they are insufficient for automatic retrieval. On the other hand, the high cost of formal ontology-based methods alienates service designers from their use in practice. Several information retrieval approaches to assess the similarity of web services have been proposed. In this paper we proceed with such a study. In particular, we examine advantages of using Vector-Space Model, WordNet and semantic similarity metrics for this purpose. A matching algorithm relying on the above techniques is presented and an experimental study to choose the most effective approach is provided.
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
Authors: R. Stranders, A. Farinelli, A. Rogers, N. R. Jennings
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in many real world applications). In particular, we tackle the social welfare maximisation problem, and derive a novel continuous version of the max-sum algorithm. In order to do so, we represent the utility function of the agents by multivariate piecewise linear functions, which in turn are encoded as simplexes. We then derive analytical solutions for the fundamental operations required to implement the max-sum algorithm (specifically, addition and marginal maximisation of general n-ary piecewise linear functions). We empirically evaluate our approach on a simulated network of wireless, energy constrained sensors that must coordinate their sense/sleep cycles in order to maximise the system-wide probability of event detection. We compare the conventional discrete max-sum algorithm with our novel continuous version, and show that the continuous approach obtains more accurate solutions (up to a 10% increase) with a lower communication overhead (up to half of the total message size).
Lane marker parameters correlative to vehicle's steering signal
Authors: Andriejus Demčenko, Minija Tamošiunaite, Aušra Vidugiriene, Leonas Jakevičius
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The work considers road lane parameters that correlate with steering angle of a car. Four different parameters, which can be used in driver's assistance system and are based on position, angles and curvature of the lane marker, are proposed and their correspondence to steering signal is analyzed. Work is performed using signals from real road driving.
Position Estimation from UWB Pseudorange and Angle-of-Arrival: A Comparison of Non-linear Regression and Kalman Filtering
Authors: Kavitha Muthukrishnan, Mike Hazas
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

This paper presents two algorithms, non-linear regression and Kalman filtering, that fuse heterogeneous data (pseudorange and angle-of-arrival) from an ultra-wideband positioning system. The performance of both the algorithms is evaluated using real data from two deployments, for both static and dynamic scenarios. We also consider the effectiveness of the proposed algorithms for systems with reduced infrastructure (lower deployment density), and for lower-complexity sensing platforms which are only capable of providing either pseudorange or angle-of-arrival.
A neural contextual model for detecting perceptually salient contours
Authors: Wentao Huang, Licheng Jiao, Jianhua Jia, Hang Yu
Venue: Pattern Recognition Letters (2009)

A computational model, inspired by visual cortical mechanisms of contextual modulation, is presented in this paper, and is applied to detect perceptually salient contours. The presented model incorporates two mechanisms of contextual modulation, surround suppression and collinear facilitation. An oriented filterbank generated by Gaussian derivatives and their Hilbert transform is proposed for pre-processing. The operators of surround suppression and collinear facilitation are applied to the orientation energy resulting from the outputs of oriented filterbank. To avoid augmenting the noise when the facilitation operator enhances the saliency parts, we employ a contrast enhancement transformation for the facilitation operator. For drawing the binary contours, we present an automatic thresholding approach for post-processing. The performance of our model is tested by artificial images with heavy noise and nature images with texture background. Results show that the model has a good performance on extracting the salient contours from images.
Fast image matching on web pages
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

In this paper, a fast method for image matching on web pages is presented. Such method relies on performing cross correlation in the frequency domain between the web image and the image given in the user query. The cross correlation operation is modified. Instead of performing dot multiplication in the frequency domain, image subtraction is applied in two dimensions. It is proved mathematically that the number of computation steps required for the proposed fast matching method is less than that needed by conventional matching.
Design and simulation of a thermally actuated MEMS switch for microwave circuits
Authors: Shumin Zhang, Wansheng Su, Mona Zaghloul
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

The design, modeling, and optimization of a novel, thermally actuated CMOS-MEMS switch are presented in this article. This series capacitive MEMS switch solves the substrate loss and down-state capacitance degradation problems commonly plaguing MEMS switches. The switch uses finger structure for capacitive coupling. The vertical bending characteristic of bimorph cantilever beams under different temperatures is utilized to turn the switch on and off. A set of electrical, mechanical, and thermal models is established, and cross-domain electro-thermo-mechanical simulations are performed to optimize the design parameters of the switch. The fabrication of the switch is completely CMOS-process compatible. The design is fabricated using the AMI 0.6 &mu;m CMOS process and a maskless reactive-ion etching process. The measured results show the insertion loss and isolation are 1.67 and 33 dB, respectively, at 5.4 GHz, and 0.36 and 23 dB at 10 GHz. The actuation voltage is 25 V and the power consumption is 480 mW. This switch has a vast number of applications in the RF-microwave field, such as configurable voltage control oscillators, filters, and configurable matching networks. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
The simulated car racing competition @ CIG-2008: events reports
Authors: Julian Togelius
Venue: ACM SIGEVOlution (2008)

The IEEE Symposium on Computational Intelligence and Games was held in Perth, Western Australia on December 15--18 2008. Over the past four years, this symposium has become the focal point for a community of researchers interested in applying computational intelligence techniques (especially evolutionary computation and neural networks) to games. "Games" in the conference title refers to traditional mathematical games studied in game theory, board games and last but absolutely not least video games.
Mobile location-based information pushing system
Authors: Zhi-Mei Wang, Fan Yang
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

This paper builds a scalable personalized mobile information pushing platform, which can provide user-friendly and flexible location-based service. We first propose a Location-based Data and Service Middleware based on Service-Oriented Architecture in order to implement Mobile Information Pushing System involved in a variety of formats of data integration and conversion, as well as a combination of a wide range of services. Then, we propose a novel 3-D Tag-Cloud module, so that it can visualize useful retrieval information even in the limited mobile screen. Especially, we design a multi-dimensional collaborative filtering algorithms, in order to achieve dynamic personalized recommendation and mobile information sharing.
Application of Word Alignment for Supporting Translation of Japanese Statutes into English
Authors: Katsuhiko Toyama, Yasuhiro Ogawa, Kazuhiro Imai, Yoshiharu Matsuura
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

Recently, society has expressed increased demands for translation of Japanese statutes into foreign languages. The various motivations behind these demands include social and economic globalization and the need for technical assistance to legal reform. In this paper, we describe the problem of translating Japanese statues and show how to solve it by utilizing technologies developed for natural language processing. In particular, we show how to support both the compilation of a standard bilingual dictionary and the unification of translation equivalents of legal technical terms in compliance with the dictionary by using word alignment.
A Novel Hybrid Evolution Algorithm Based on Agent Behavior and Paradigm Learning
Authors: Yuhui Xu, Weijin Jiang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Distribution system optimal planning has vital significance, but there isn't efficient and practical algorithm at Traditional genetic algorithm has a poor expressive power for complicated problem because of the restriction of its norm mode, which limits the application fields of genetic algorithm. This paper adapts the idea of "Ethogenetics" reference, and presents a new type of genetic algorithm based on Agent behavior and paradigm learning. Unlike the based creating mode of feasible solution in traditional genetic algorithm, a feasible solution is created by ~ series o! ye behaviors of Agent based on knowledge in the new genetic algorithm. To adapt the new creating mode of feasible the traditional mechanism of evolution optimization based on Darwinism is abandoned and the mechanism of learning' is adopted to realize the evolution optimization. At last, an example distribution network is optimized by Ilene tic algorithm and traditional genetic algorithm respectively. The comparative result proves the new genetic I has higher expressive power, computing efficiency, convergent stability and extendable capability.
A spectral erdős–stone–bollobás theorem
Authors: Vladimir Nikiforov
Venue: Combinatorics, Probability and Computing (2009)

Let r ≥ 3 and (c/rr)r log n ≥ 1. If G is a graph of order n and its largest eigenvalue μ(G) satisfies <disp-formula><graphic xlink="S0963548309009687_eqnU1" mime-subtype="gif"><alt-text>$\[ \mu ( G ) geq ( 1-1/ ( r-1 ) +c ) n, \]$</alt-text></graphic></disp-formula> then G contains a complete r-partite subgraph with r − 1 parts of size ⌊(c/rr)r log n⌋ and one part of size greater than n1−cr−1. This result implies the Erdős–Stone–Bollobás theorem, the essential quantitative form of the Erdős–Stone theorem. Another easy consequence is that if F1, F2,. . . are r-chromatic graphs satisfying v(Fn) = o(log n), then <disp-formula><graphic xlink="S0963548309009687_eqnU2" mime-subtype="gif"><alt-text>$\[ \lim_{n\rightarrow\infty}\frac{1}{n}\max\bigl\{ \mu ( G ): v ( G ) =n~~\text{and}~~F_{n}\nsubseteq G\bigr\} =1-\frac{1}{r-1}$</alt-text></graphic></disp-formula>
Structured data and web documents: better together?
Authors: Surajit Chaudhuri
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Keyword search over structured databases is silo-ed from web search in that their results are independent of those from web search. We claim that keyword search can benefit significantly from the knowledge of web documents and results of web search. Conversely, traditional web search only returns documents. We discuss how the search results can be enhanced by additional structured information. Thus, query over structured data and web search can leverage each other.
ModelTalker voice recorder: an interface system for recording a corpus of speech for synthesis
Authors: Debra Yarrington, John Gray, Chris Pennington, H. Timothy Bunnell, Allegra Cornaglia, Jason Lilley, Kyoko Nagao, James Polikoff
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Demo Session (2008)

We will demonstrate the ModelTalker Voice Recorder (MT Voice Recorder) -- an interface system that lets individuals record and bank a speech database for the creation of a synthetic voice. The system guides users through an automatic calibration process that sets pitch, amplitude, and silence. The system then prompts users with both visual (text-based) and auditory prompts. Each recording is screened for pitch, amplitude and pronunciation and users are given immediate feedback on the acceptability of each recording. Users can then rerecord an unacceptable utterance. Recordings are automatically labeled and saved and a speech database is created from these recordings. The system's intention is to make the process of recording a corpus of utterances relatively easy for those inexperienced in linguistic analysis. Ultimately, the recorded corpus and the resulting speech database is used for concatenative synthetic speech, thus allowing individuals at home or in clinics to create a synthetic voice in their own voice. The interface may prove useful for other purposes as well. The system facilitates the recording and labeling of large corpora of speech, making it useful for speech and linguistic research, and it provides immediate feedback on pronunciation, thus making it useful as a clinical learning tool.
Fundamentals of ADO.NET
Authors: Paul D. Sheriff
Venue:  (2007)

This book is designed for anyone that wants to learn how to use ADO.NET to access data in databases. Throughout this book you will be introduced to the concepts of the data handling using the Microsoft .NET Framework. Emphasis will be on good programming standards and practices. In this book you will learn the following: - Using the Connection Class - Using the Command Class - Using DataSets - Using DataTables - Using Parameters - Using Stored Procedures Reading this book will show you how to use ADO.NET to manipulate data in OLE DB and SQL Server databases. After reading this book you will be able to retrieve data, insert, update and delete data from relational databases using ADO.NET. 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
Remote usability testing: a practice
Authors: Sheng-Cheng Huang, Randolph G. Bias, Tanya L. Payne, Jay B. Rogers
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

For increasingly frequent use of library resources by remote users, remote usability testing has become a valuable tool for those who would pursue an empirical, user-centered design of the interfaces to their electronic resources and services. This paper describes our implementation of remote usability tests to evaluate prototypes of a web content management application developed by Vignette Corporation, and reports sample results to illustrate the utility of such an approach that can help designing and improving interfaces of digital library projects and their usability.
Pessimistic Heuristics Beat Optimistic Ones in Real-Time Search
Authors: Aleksander Sadikov, Ivan Bratko
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Admissibility is a desired property of heuristic evaluation functions, because when these heuristics are used with complete search methods, such as A* and RBFS, they guarantee that an optimal solution will be found. Since every optimistic heuristic function is admissible, optimistic functions are widely used. We show, however, that with incomplete, real-time search, optimistic functions lose their appeal, and in fact they may hinder the search under quite reasonable conditions. Under these conditions the exact opposite is to be preferred, i.e. pessimistic heuristic functions that never underestimate the difficulty of the problem. We demonstrate that such heuristics behave better than optimistic ones of equal quality on a standard testbed using RTA* search method.
Discordance Detection in Regional Ordinance: Ontology-based Validation
Authors: Shingo Hagiwara, Satoshi Tojo
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

In this paper, we propose a procedure of discordance detection in an actual legal code, that is the regional ordinance of Toyama Prefecture, Japan. In this study, we expand the notion of inconsistency to the discordance including antonyms based on an ontology, and precluded the conventional negative connective. We have implemented the system that converts XML logical formats to Prolog, and has inspected the whole code.