ppxscal/embedding_network huggingface dataset:
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
Authors: Håkan Warnquist, Mattias Nyberg, Petter Säby
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and affect the cost of future actions. We present a way to model this by extending the traditional troubleshooting model with an additional state that describes which parts of the system that are decomposed. The proposed troubleshooting algorithm searches an AND/OR graph with the aim of finding the repair plan that minimizes the expected cost of repair. We present the heuristics needed to speed up the search and make it competitive with other troubleshooting algorithms. Finally, the performance of the algorithm is evaluated on a probabilistic model of a fuel injection system of a truck. We show that the expected cost of repair can be reduced when compared with an algorithm from previous literature.
Automatic E-learning contents composition by using gap analysis techniques
Authors: Juan Manuel de Blas, José María Gutiérrez, Luis de Marcos, Roberto Barchino
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

A goal of e-learning is to increase efficiency by precisely identifying the training a student needs, and providing that training in the context of day to day activities of the students [1]. This paper describes how the use of IA algorithms can be utilized to automatically generate customized learning contents on elearning environments. On top of that, we also propose the inclusion in the whole process of digital rights, as in our opinion, it's a way to make up for contents creators and to encourage them to create better, more useful materials.
Technical communique: Improved stability criteria and controller design for linear neutral systems
Authors: Qing-Long Han
Venue: Automatica (Journal of IFAC) (2009)

This paper is concerned with the problems of stability and H"~ control of linear neutral systems. Firstly, some new simple Lyapunov-Krasovskii functionals are constructed by uniformly dividing the discrete delay interval into multiple segments, and choosing proper functionals with different weighted matrices corresponding to different segments in the Lyapunov-Krasovskii functionals. Then using these new simple Lyapunov-Krasovskii functionals, some new delay-dependent stability criteria are derived. These criteria include some existing results as their special cases and are much less conservative than some existing results, which is shown through a numerical example. Secondly, a delay-dependent bounded real lemma (BRL) is established. Employing the obtained BRL, some delay-dependent sufficient conditions for the existence of a delayed state feedback controller, which ensure asymptotic stability and a prescribed H"~ performance level of the corresponding closed-loop system, is formulated in terms of a linear matrix inequality (LMI). A numerical example is also given to illustrate the effectiveness of the design method.
Block Red-Black Ordering Method for Parallel Processing of ICCG Solver
Authors: Takeshi Iwashita, Masaaki Shimasaki
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

The present paper proposes a new parallel ordering, "block red-black ordering," for a parallelized ICCG solver with fewer synchronization points and a high convergence rate. In the new method, nodes in an analyzed grid are divided into several or many blocks, and red-black ordering is applied to the blocks. Several blocks are assigned to each processor and the substitution is carried out in parallel. Only one synchronization point exists in each parallelized substitution. We performed an analytical investigation using the ordering graph theory and computational tests on a scalar parallel computer. These results show that a convergence rate is improved by an increase in the number of nodes of one block and that a high parallel performance is attained by using an appropriate block size.
The Effects of Error-Flagging in a Tutor on Expression Evaluation
Authors: Amruth Kumar, Peter Rutigliano
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

We evaluated the effect of providing error-flagging as support for error detection, but not error correction while the student is solving a problem. We found that providing error-flagging in addition to demand feedback during practice learning was no more effective than providing only demand feedback when the tutor did not explicitly mention that errors were being flagged. On the other hand, explaining and providing error-flagging without demand feedback during pre-and post-tests resulted in significantly better scores on pre-and post-tests even though error-flagging did not provide any error-correction support.
A comprehensive evaluation methodology for noisy historical document recognition techniques
Authors: Nikolaos Stamatopoulos, Georgios Louloudis, Basilis Gatos
Venue: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data (2009)

In this paper, we propose a new comprehensive methodology in order to evaluate the performance of noisy historical document recognition techniques. We aim to evaluate not only the final noisy recognition result but also the main intermediate stages of text line, word and character segmentation. For this purpose, we efficiently create the text line, word and character segmentation ground truth guided by the transcription of the historical documents. The proposed methodology consists of (i) a semiautomatic procedure in order to detect the text line, word and character segmentation ground truth regions making use of the correct document transcription, (ii) calculation of proper evaluation metrics in order to measure the performance of the final OCR result as well as of the intermediate segmentation stages. The semi-automatic procedure for detecting the ground truth regions has been evaluated and proved efficient and time saving. Experimental results prove that using the proposed technique, the percentage of time saved for the text line, word and character segmentation ground truth creation is more than 90%. An analytic experiment using a commercial OCR engine applied to a historical book is also presented.
WebSphere Business Integration Primer: Process Server, BPEL, SCA, and SOA, 1st edition
Authors: Ashok Iyengar, Vinod Jessani, Michele Chilanti
Venue:  (2007)

Introductory Guide to WebSphere Business Integration from IBM Using WebSphere Business Integration (WBI) technology, you can build an enterprise-wide Business Integration (BI) infrastructure that makes it easier to connect any business resources and functions, so you can adapt more quickly to the demands of customers and partners. Now theres an introductory guide to creating standards-based process and data integration solutions with WBI. WebSphere Business Integration Primer thoroughly explains Service Component Architecture (SCA), basic business processes, and complex long-running business flows, and guides you to choose the right process integration architecture for your requirements. Next, it introduces the key components of a WBI solution and shows how to make them work together rapidly and efficiently. This book will help developers, technical professionals, or managers understand todays key BI issues and technologies, and streamline business processes by combining BI with Service Oriented Architecture (SOA). Coverage includes Linking BI, business process management (BPM), and SOA BI scenarios, architecture, patterns, and the IBM Business Object Framework Business orchestration utilizing WS-BPEL and other industry standards BI development with WebSphere Integration Developer (WID) and the SCA programming model WebSphere Process Server (WPS): a runtime for service-oriented applications Defining business maps, rules, business state machines, and human tasks Managing BI services: security, auditing, and more Integrating third-party and legacy systems with WebSphere adapters Utilizing WebSphere Business Modeler and WebSphere Business Monitor Using WebSphere Enterprise Service Bus (WESB) to integrate services
Handling controversial arguments in bipolar argumentation systems
Authors: Claudette Cayrol, Caroline Devred, Marie-Christine Lagasquie-Schiex
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

We consider bipolar argumentation frameworks, which extend Dung's argumentation frameworks by handling two independent kinds of interaction between arguments, attack and support. In this bipolar context, we propose new semantics for coping with the problem of controversial arguments (arguments which indirectly attack and indirectly defend a same argument).
Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Authors: John Wang
Venue:  (2007)

Data Warehousing and Mining: Concepts, Methodologies, Tools and Applications provides the most comprehensive compilation of research available in this emerging and increasingly important field. This six-volume set offers tools, designs, and outcomes of the utilization of data warehousing and mining technologies, such as algorithms, concept lattices, multidimensional data, and online analytical processing. With more than 300 chapters contributed by over 575 experts from around the globe, this authoritative collection will provide libraries with the essential reference on data warehousing and mining. 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
Dialogues that account for different perspectives in collaborative argumentation
Authors: Elizabeth Black, Katie Atkinson
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

It is often the case that agents within a system have distinct types of knowledge. Furthermore, whilst common goals may be agreed upon, the particular representations of the individual agents' views of the world that they operate within may not always match. In this paper we provide a framework to allow different agents with different expertise to make individual contributions to an overall reasoning process, in order to make a decision about how to act to achieve some goal. Our framework is based on a model of argumentation that embeds inquiry dialogues within a process of practical reasoning. We combine two different approaches to argumentative reasoning and show not only how they can function together within a formal framework to provide richer interactions, but also how this facilitates reasoning across distributed agents who may each have different perspectives on the scenarios they operate in.
The profession of ITComputing: the fourth great domain of science
Authors: Peter J. Denning, Paul S. Rosenbloom
Venue: Communications of the ACM (2009)

Computing is as fundamental as the physical, life, and social sciences.
Discovering voter preferences in blogs using mixtures of topic models
Authors: Pradipto Das, Rohini Srihari, Smruthi Mukund
Venue: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data (2009)

In this paper we propose a new approach to capture the inclination towards a certain election candidate from the contents of blogs and to explain why that inclination may be so. The method is based on the availability of "ground truth" speeches from the election candidates that are labeled and also on the collection of noisy blogs which are not labeled in any way. In this unsupervised learning scenario, we used probabilistic topic models to cluster the ground truth documents for each candidate into different underlying latent themes. The same topic models were then applied on the blog collection and the "orientation" of each of the blogs with different themes of the election candidate speeches was performed using KL divergence of the topic distribution over the overlapping vocabularies. We used four models for such theme matching, one with a baseline topic model and the other three by weighting the baseline topic model with the positive, negative and the neutral sentiments of the topics. We then used a collaborative objective function to combine the outcome of candidate preference for the blogs under the four models using an Expectation Maximization algorithm. The novelty of our method is highlighted in its use of unannotated data as well as in the combination of the views of the different "experts" explaining the same phenomenon.
The wireless gigabit Ethernet link development at TMR&D
Authors: Azzemi Ariffin, Young Chul Lee, Mohd. Fadzil Amiruddin, Suhandi Bujang, Salizul Jaafar, Noor Aisyah Mohd. Akib
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

TMR&D is developing a millimeter-wave point-to-point (PTP) Wireless Gigabit Ethernet Communication System. A 60 GHz Low Temperature Co-Fired Ceramics (LTCC) System-On-Package (SoP) Transceiver capable of gigabit data rate has been built and demonstrated with a size of 17.76 × 17.89 mm2. A direct Amplitude-Shift Keying (ASK) modulation and demodulation scheme is adopted for the 60GHz-band transceiver. A BER of 1×10-12 for data rate of 1.25 gigabit-per-second (Gbps) on 2.2 GHz bandwidth at 1.4 km was demonstrated. This paper reports a new PTP link that has been installed at TMR&D site to demonstrate wireless gigabit operation and performance of its key components. The link will operate at the 57.65-63.35 GHz band incorporating TMR&D's designed millimeter-wave LTCC SoP RF Transceiver module. This LTCC SoP RF Transceiver is suitable for short-range wireless networking systems, security camera TV, video conferencing, streaming video like HDTV (high definition television) and wireless downloading systems for small power application.
Statistical Monitoring of Injection Moulds
Authors: Xavier Berjaga, Joaquim Melendez, Alvaro Pallares
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

In this paper a statistical based methodology to work over the principal component space on injection moulds is presented. The Multiway Principal Component Analysis is applied as a dimensionality reduction step, and fault detection assessment. This methodology allowed to analyse the behaviour of injections with the information directly received from sensors, what ended in a better process understanding. Results concluded that with a low number of variables (some principal components and two control statistics) is enough to detect abnormalities (too short injections, injections with low variability, etc.).
On private computation in incomplete networks
Authors: Amos Beimel
Venue: Distributed Computing (2007)

Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious--after the protocol terminates each party tries to learn information from the communication it heard. We say that a function can be computed privately in a network if there is a protocol in which each processor learns only the information implied by its input and the output of the function (in the information theoretic sense). The question we address in this paper is what functions can be privately computed in a given incomplete network. Every function can be privately computed in two-connected networks with at least three parties. Thus, the question is interesting only for non two-connected networks. Generalizing results of (Bläser et al. in J. Cryptol, 19(3):341-357, 2006), we characterize the functions that can be computed privately in simple networks--networks with one separating vertex and no leaves. We then deal with private computations in arbitrary non two-connected networks: we reduce this question to private computations of related functions on trees, and give some sufficient conditions and necessary conditions on the functions that can be privately computed on trees.
Using scalable game design to promote 3D fluency: Assessing the AgentCubes incremental 3D end-user development framework
Authors: Andri Ioannidou, Alexander Repenning, David Webb
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

With the IT crisis reaching alarming levels, it is more important than ever to attract K-12 students to computer science. 3D game development can be an enticing way to achieve that, but building 3D games is far from trivial. Students need to achieve a degree of 3D fluency in modeling, animation and programming to be able to create compelling 3D content. The combination of innovative end-user development tools and standards-based curriculum promoting IT fluency by shifting the pedagogical focus from programming to design, can address motivational aspects without sacrificing principled educational goals. The AgentCubes 3D game-authoring environment raises the ceiling of end-user development without raising the threshold. Our formal user study shows that with Incremental 3D, the gradual approach to transition from 2D to 3D authoring, middle school students can build sophisticated 3D games including 3D models, animations and programming.
On the Red/Blue Spanning Tree Problem
Authors: Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

A geometric spanning tree of a point set S is a tree whose vertex set is S and whose edge set is a set of non-crossing straight line segments with endpoints in S. Given a set of red points and a set of blue points in the plane, the red/blue spanning tree problem is to find a geometric spanning tree for red points and a geometric spanning tree for blue points such that the number of crossing points of the two trees is minimum. If no three points are collinear, we show that the minimum number of crossing points is completely determined by the number of maximal red chains on the convex hull of all red points and blue points. We design an optimal algorithm for constructing a geometric spanning tree of all the red points and a geometric spanning tree of all the blue points with the minimum number of crossing points. If collinear points are allowed, we prove that the problem of deciding whether there exists a geometric spanning path of all the red points and a geometric spanning path of all the blue points without crossing is NP-complete.
Introduction to MATLAB and SIMULINK, A Project Approach, 3rd edition
Authors: Ottmar Beucher, Michael Weeks
Venue: Engineering (2007)

This book provides the optimal introduction to MATLAB and Simulink, the primary tools in engineering, science, and industry for simulating dynamic systems. Using the latest versions of the software, the book also has 20 hands-on projects that provide a practical mastery of the subject areas including the code and executable files. Apart from a basic knowledge of mathematics and physics, no further specialist knowledge is necessary. There are also over 80, in-text, exercises where readers themselves can check their mastery of the material. A CD-ROM with source code accompanies the book.
A Solver for QBFs in Nonprenex Form
Authors: Uwe Egly, Martina Seidl, Stefan Woltran
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)

Various problems in artificial intelligence (AI) can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a black box in a rapid implementation of a more general reasoning system. Most of the current solvers for QBFs require formulas in prenex conjunctive normal form as input, which makes a further translation necessary, since the encodings are usually not in a specific normal form. This additional step increases the number of variables in the formula or disrupts the formula's structure. Moreover, the most important part of this transformation, prenexing, is not deterministic. In this paper, we focus on an alternative way to process QBFs without these drawbacks and describe a solver, qpro, which is able to handle arbitrary formulas. To this end, we extend algorithms for QBFs to the non-normal form case and compare qpro with the leading normal-form provers on problems from the area of AI.
Computations of floer homology and gauge theoretic invariants for montesinos twins
Authors: Ronald Fintushel
Venue:  (2008)

I compute the Lagrangian Floer cohomology groups of certain tori in closed simply connected symplectic 4-manifolds arising from Fintushel - Stern knot/link surgery. These manifolds are usually not symplectically aspherical. As a result of the computation we observe examples where HF(L0) &cong; HF( L1) and L0 and L 1 are smoothly and Lagrangian isotopic but L0 , L1 are not symplectically isotopic. In [Gi182], C. Giller proposed an invariant of ribbon 2-knots in S4 based on a "Conway calculus" of crossing changes in a projection to R 3. In certain cases, this invariant computes the Alexander polynomial. Giller's invariant is, however, a symmetric polynomial - which the Alexander polynomial of a 2-knot need not be. After modifying a 2-knot into a Montesinos twin in a natural way, we show that Giller's invariant is actually the Seiberg-Witten invariant of the exterior of the twin, glued to the complement of a fiber in E(2).
An application of fuzzy hypotheses testing in radar detection
Authors: A. K. Elsherif, F. M. Abbady, G. M. Abdelhamid
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

A method of testing of fuzzy hypotheses for fuzzy data is applied to radar detection process, Imprecise parameters of the distribution under each hypotheses are modeled as a fuzzy number in which we consider that the received signal data is fuzzy instead we consider that the received signal data is crisp, The advantages in sorting fuzziness will be stated.
Exposure to research through replication of research: a case in complex networks
Authors: Ali Erkan, Sam Newmark, Nicolas Ommen
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This paper is primarily about introducing students to research. Specifically, we present a method where students get to redo the simulations behind a few of the most cited research papers in complex networks. We also outline the design of a course that provides the context for this experimentation.
Effects of the 'Blended Learning' in Class Utilizing the WBT Courseware for English Listening
Authors: Noritake Fujishiro, Isao Miyaji
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

One of the main aims of English education at junior high school is to develop students' practical communication skills such as listening and speaking. However, it is difficult for one teacher to instruct each student individually in class. With this consideration in mind, we developed WBT courseware for English listening, incorporating a high quantity of video and sound clips for self-practice. Through utilizing it as a part of 'Blended Learning' with pair or group activities in class, we have studied the effectiveness of the instruction with WBT. The result of the research shows that students' desire for self-expression in English was raised and their listening ability for comprehending the situation was also improved.