ppxscal/embedding_network huggingface dataset:
Extend UDF Technology for Integrated Analytics
Authors: Qiming Chen, Meichun Hsu, Rui Liu
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Running analytics computation inside database engines through the use of UDFs (User Defined Functions) has been extensively investigated, but not yet become a scalable approach due to two major limitations. One limitation lies in that the existent UDFs are not relation-in, relation-out and schema-aware, unable to model complex applications, and cannot be composed with relational operators in a SQL query. Another limitation lies in the difficulty of programming UDFs for efficient interaction with query processing, since that requires hard-to-follow system knowledge beyond the analytics expertise. These limitations actually keep away most users from using UDFs for their analytics applications.To solve these problems, we extend the UDF technology in both semantic and system dimensions. We first expand our investigation on Relation Valued Functions (RVFs) with the goal of having RVF executions tightly integrated with query processing, but allowing RVF developers to be liberated from DBMS internal details. We separate an RVF into two parts: RVF shell that contains the system utilities, and user-function that contains application logic only. We provided focused system support based on the notion of invocation pattern, and developed the mechanism for generating an RVF-shell automatically based on the schemas of its argument and return relations, the well understood invocation pattern, and the common data conversion protocol. A complete RVF is made by plugging the "user function" in the RVF-shell.We have prototyped the proposed approach on the open-sourced database engine Postgres. Our experience reveals its advantages in making UDF tightly integrated with the query executor but relieving analytics users from dealing with system details --- a fundamental data engineering requirement to make UDF technology practically usable for converging data intensive analytics and data management.
Towards a Real-Time Scheduling Framework for Data Transfers in Tree Networks
Authors: Mugurel Ionut Andreica, Eliana-Dina Tirsa
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

As the amount of transferred data increases world-wide, network data transfers may exhibit poor performance due to resource usage conflicts, even when enough resources are available (at a different place or at another time). Thus, efficient resource management and intelligent scheduling of the data transfers are required. These problems are, however, quite difficult to solve, both from a theoretical and a practical perspective. In this paper we propose several novel algorithmic techniques for the real-time scheduling of data transfers when the network has a tree topology. Some of these techniques can be later implemented in a (re)configurable data transfer scheduling framework.
Design and Implementation of XSQS System
Authors: Lukai Hong, Dong Li, Ning Gu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

XML (eXtensible Markup Language) has become the standard of data representation and data exchange in the Internet. A highly efficient management on XML documents has become an urgent problem. In this paper, we introduce the development of a native XML database management system, called ‘XSQS’ (XML storage and query system), which provides the ability of the storage and query for XML documents in a native format. An integrated index structure and a storage management for the XML documents are provided and a loader for XML documents is also presented. Our researches show that the XSQS can efficiently manage the storage and query of XML document.
Implementing a Clinical Decision Support System for Glucose Control for the Intensive Cardiac Care
Authors: Rogier Barendse, Jonathan Lipton, Maarten Ettinger, Stefan Nelwan, Niek Putten
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Adherence to guidelines and protocols in clinical practice can be difficult to achieve. We describe the implementation of a Clinical Decision Support System (CDSS) for glucose control on the Intensive Cardiac Care Unit (ICCU) of the Erasmus MC. An existing paper protocol for glucose control was used for the CDSS rule set. In the first phase we implemented a proof of concept of a CDSS: a web 2.0 AJAX-driven web screen, which resulted in an improved adherence to the glucose guideline. This paper will reflect on the technical implementations and challenges of our experience with this process. The end product will allow: storage of guidelines in a shareable and uniform matter, presentation of guidelines in a more clear way to physicians, a more flexible platform to maintain guidelines, the ability to adjust guidelines to incorporate changes based on collected evidence from the CDSS and/or literature review, and be able to better review the outcome.
An intrinsic reward for affordance exploration
Authors: Stephen Hart
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

In this paper, we present preliminary results demonstrating how a robot can learn environmental affordances in terms of the features that predict successful control and interaction. We extend previous work in which we proposed a learning framework that allows a robot to develop a series of hierarchical, closed-loop manipulation behaviors. Here, we examine a complementary process where the robot builds probabilistic models about the conditions under which these behaviors are likely to succeed. To accomplish this, we present an intrinsic reward function that directs the robot's exploratory behavior towards gaining confidence in these models. We demonstrate how this single intrinsic motivator can lead to artifacts of behavior such as “novelty,” “habituation,” and “surprise.” We present results using the bimanual robot Dexter, and explore these results further in simulation.
Of What Use Is Floating-Point Arithmetic in Computational Geometry?
Authors: Stefan Funke
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

We give a sketchy and informal overview of the use of floating-point arithmetic in the implementation of geometric algorithms. First we point out the pitfalls of a too naive use of floating-point arithmetic and then talk about less naive ways which do not compromise the sensibility of the outcome. Accidentally, Kurt Mehlhorn and his collaborators had a finger in the pie all the time.
Capturing Fair Computations on Concurrent Constraint Language
Authors: Paola Campli, Stefano Bistarelli
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

This paper contains an extension of the Concurrent Constraint language (CC) in order to guarantee a fair criterion of selection among parallel agents and to restrict or remove the possible unwanted behavior of a program.
A model-based coding scheme to analyze students' organization
Authors: Patrice Moguel, Pierre Tchounikine, André Tricot
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

In this article we present how we use Bardram's model of collective work dynamics [1] to elaborate a conceptual tool for coding and analyzing the self-organization of students involved in a mediated (computer-based) pedagogic collective challenge.
The Basic Decision-Making Behaviors Analysis of Adoption Subjects of Financial Innovation
Authors: Lijuan Chen, Shuzhen Zhu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

This paper analyses the micro decision-making behaviors of the adoption subjects of financial innovation activities. It demonstrates that the decision-making behaviors, to a large extent, are the investment problems under conditions of uncertainty, and the subjects has the right to delay investment. The paper adopted a competitive model within the general equilibrium framework to describe the basic decision-making behaviors of innovation individuals when they are facing new innovation opportunities. The authors conclude that within the competitive market structure, compared with the decision-making on the monopoly conditions, innovators hold short-sighted attitude to potential adversaries, and all innovation subjects tend to innovate immediately and participate in the competition for the market share of innovation products.
Poker Player Behavior After Big Wins and Big Losses
Authors: Gary Smith, Michael Levere, Robert Kurtzman
Venue: Management Science (2009)

We find that experienced poker players typically change their style of play after winning or losing a big pot---most notably, playing less cautiously after a big loss, evidently hoping for lucky cards that will erase their loss. This finding is consistent with Kahneman and Tversky's (Kahneman, D., A. Tversky. 1979. Prospect theory: An analysis of decision under risk. Econometrica47(2) 263--292) break-even hypothesis and suggests that when investors incur a large loss, it might be time to take a vacation or be monitored closely.
Benchmarking Performance-Critical Components in a Native XML Database System
Authors: Karsten Schmidt, Sebastian Bächle, Theo Härder
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

The rapidly increasing number of XML-related applications indicates a growing need for efficient, dynamic, and native XML support in database management systems (XDBMS). So far, both industry and academia primarily focus on benchmarking of high-level performance figures for a variety of applications, queries, or documents --- frequently executed in artificial workload scenarios --- and, therefore, may analyze and compare only specific or incidental behavior of the underlying systems. To cover the full XDBMS support, it is mandatory to benchmark performance-critical components bottom-up, thereby removing bottlenecks and optimizing component behavior. In this way, wrong conclusions are avoided when new techniques such as tailored XML operators, index types, or storage mappings with unfamiliar performance characteristics are used. As an experience report, we present what we have learned from benchmarking a native XDBMS and recommend certain setups to do it in a systematic and meaningful way.
Virtual Apple Tree Pruning in Horticultural Education
Authors: Ning Xia, Ai-Shuang Li, Dan-Feng Huang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

A computer model of branching responses of apple trees (Malus domestica) with different levels of pruning schemes is presented. The model simulates the number and distributions of the axillary production along one-year-old parent branches using the Hidden Semi-Markov Chain (HSMC). Results show that (a) simulation system efficiently provides the required information at the desired level of accuracy, and (b) the branch growth model is extremely well calibrated against real apple trees and (c) the system can simulate many interesting growth situations with direct feedback from the different levels of pruning schemes presenting the parent branches' characteristics, such as, location of flower, fruit setting, and so on. The method used in this paper aims at providing a quantitative tool for orchard management in horticultural education, particularly with regard to pruning practices.
The Pure BTS Versus the Combined BTO and BTS in Supply Chain Environment
Authors: Li Yibin, Chen Rongqiu, Li Hainan
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In supply chain environment, the introduction of BTO brings much changes to production system. However, which operation mode is the most appropriate to the supply chain system? There is still not an accepted viewpoint in researchers and practitioners. So it’s necessary to consider the possible and feasible operation mode in supply chain. Through comparing the pure BTS and combined BTS BTO in supply chain, we draw the conclusion, the performance of combined BTS BTO is better than the pure BTS.
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
Authors: Oliver Friedmann
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdzinski. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games on which the algorithm requires exponentially many strategy iterations, answering in the negative the long-standing question whether this algorithm runs in polynomial time. Additionally we note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Schewe as well as the strategy iteration for solving discounted payoff games due to Puri.
Credibilistic Risk Optimization Models and Algorithms
Authors: Dong Wen, Jin Peng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Risk optimization is a very important issue in decision making. In this paper, some credibilistic risk optimization models and algorithms are presented. Firstly, we recall some definitions and results of value-at-risk in credibilistic risk analysis. Secondly, we propose some risk optimization models by means of fuzzy programming, or more precisely, credibilistic programming. Thirdly, hybrid intelligent algorithms are designed to solve the proposed risk optimization models. Finally, some numerical examples are illustrated.
Implementing a sense tagger in a general architecture for text engineering
Authors: Hamish Cunningham, Mark Stevenson, Yorick Wilks
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

We describe two systems: GATE (General Architecture for Text Engineering), an architecture to aid in the production and delivery of language engineering systems which significantly reduces development time and ease of reuse in such systems. We also describe a sense tagger which we implemented within the GATE architecture, and which achieves high accuracy (92% of all words in text to a broad semantic level). We used the implementation of the sense tagger as a real-world task on which to evaluate the usefulness of the GATE architecture and identified strengths and weaknesses in the architecture.
A Formalization of HIPAA for a Medical Messaging System
Authors: Peifung E. Lam, John C. Mitchell, Sharada Sundaram
Venue: Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business (2009)

The complexity of regulations in healthcare, financial services, and other industries makes it difficult for enterprises to design and deploy effective compliance systems. We believe that in some applications, it may be practical to support compliance by using formalized portions of applicable laws to regulate business processes that use information systems. In order to explore this possibility, we use a stratified fragment of Prolog with limited use of negation to formalize a portion of the US Health Insurance Portability and Accountability Act (HIPAA). As part of our study, we also explore the deployment of our formalization in a prototype hospital Web portal messaging system.
Deep-reasoning-centred dialogue
Authors: Debora Field, Allan Ramsay
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

This paper discusses an implemented dialogue system which generates the meanings of utterances by taking into account: the surface mood of the user's last utterance; the meanings of all the user's utterances from the current discourse; the system's expert knowledge; and the system's beliefs about the current situation arising from the discourse (including its beliefs about the user and her beliefs, and its beliefs about what is 'common knowledge'). The system formulates the content of its responses by employing an epistemic theorem prover to do deep reasoning. During the reasoning process, it remembers the proof tree it constructs, and from this derives the meaning of an explanatory response.
Discovering Emerging Graph Patterns from Chemicals
Authors: Guillaume Poezevara, Bertrand Cuissart, Bruno Crémilleux
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Emerging patterns are patterns of a great interest for characterizing classes. This task remains a challenge, especially with graph data. In this paper, we propose a method to mine the whole set of frequent emerging graph patterns, given a frequency threshold and an emergence threshold. Our results are achieved thanks to a change of the description of the initial problem so that we are able to design a process combining efficient algorithmic and data mining methods. Experiments on a real-world database composed of chemicals show the feasibility and the efficiency of our approach.
An Eliminating Causal Ambiguity Approach to Reactive Systems
Authors: Houguang Yue
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In this paper, we develop an eliminating causal ambiguity approach for reactive systems with the notion of causal ambiguity, which often exists and appears in real application areas. The systems are modeled in terms of event structures with causal ambiguity. Under a certain partial order semantics, the behavior of the system can be reasoned out unambiguously. Furthermore, a variant of a linear-time equivalence termed pomset trace equivalence and a variant of a branching-time equivalence termed history preserving bisimulation equivalence based on the partial order semantics are presented. An alternative operational semantics is also discussed.
Workflow Mining Application to Ambient Intelligence Behavior Modeling
Authors: Carlos Fernández, Juan Pablo Lázaro, Jose Miguel Benedí
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

The handmade human behavior modeling requires too many human resources and for too long a time. In addition, the final result does probably not reflect the current status of the person due to the influence of time. The use on Workflow Mining techniques to infer human behavior models from past executions of actions can be a solution to this problem. In this paper, a Human Behavior modeling methodology based on Workflow Mining Techniques is proposed.
A XML Tree Based Leveled Filtering Method and Its Application
Authors: Jiming Chen, Yan Zhuang, Shiguang Ju, Jingui Pan
Venue: Transactions on Edutainment II (2009)

The system's scalability is an important problem in the research of distributed virtual environment. By combining XML technology with active leveled interest management, a new XML tree based leveled filtering method --- LevelFilter is presented in this paper. LevelFilter evaluates the level of interests among objects via the similarity matching of XML trees, and processes leveled packet filtering on active routers. Finally, by applying LevelFilter to the design of motion LOD (Level of Detail) in virtual human simulation system, it can manipulate the content detail of virtual human by the DOCBF (Detail of Content Based Filtering) to reduce traffic load. Therefore, LevelFilter can highly improve the system's scalability.
Connect the Dot: Computing Feed-Links with Minimum Dilation
Authors: Boris Aronov, Kevin Buchin, Maike Buchin, Marc Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

A feed-link is an artificial connection from a given location p to a real-world network. It is most commonly added to an incomplete network to improve the results of network analysis, by making p part of the network. The feed-link has to be "reasonable", hence we use the concept of dilation to determine the quality of a connection.We consider the following abstract problem: Given a simple polygon P with n vertices and a point p inside, determine a point q on P such that adding a feedlink $\overline{pq}$ minimizes the maximum dilation of any point on P. Here the dilation of a point r on P is the ratio of the shortest route from r over P and $\overline{pq}$ to p, to the Euclidean distance from r to p. We solve this problem in O(¿ 7(n)logn) time, where ¿ 7(n) is the slightly superlinear maximum length of a Davenport-Schinzel sequence of order 7. We also show that for convex polygons, two feed-links are always sufficient and sometimes necessary to realize constant dilation, and that k feed-links lead to a dilation of 1 + O(1/k). For (¿,β)-covered polygons, a constant number of feed-links suffices to realize constant dilation.
Visual Navigation Patterns and Cognitive Load
Authors: Laurel A. King
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Eye tracking technology is a prospective tool for augmenting cognition in real-time in response to screen navigation and other eye movements that can be monitored. This paper examines eye movements associated with differences in problem complexity. The experiment utilized constraint satisfaction problems of differing difficulty measured by the number of steps necessary to complete and the relative time required to solve it. Participants were observed and tested through an eye-tracking experiment to see if correlations between visual navigation and problem complexity were present. Eye movement patterns, in particular pupil size, have been used to measure cognitive load in other contexts [6-9]. The results showed overall increases in fixations and pupil size that corresponded to increases in problem complexity.