ppxscal/embedding_network huggingface dataset:
Challenges and opportunities in collaborative business process management: Overview of recent advances and introduction to the special issue
Authors: Chengfei Liu, Qing Li, Xiaohui Zhao
Venue: Information Systems Frontiers (2009)

Modern business process management expands to cover the partner organisations' business processes across organisational boundaries, and thereby supports organisations to coordinate the flow of information among organisations and link their business processes. With collaborative business processes, organisations can create dynamic and flexible collaborations to synergically adapt to the changing conditions, and stay competitive in the global market. Due to its significant potential and value, collaborative business processes are now turning to be an important issue of contemporary business process management, and attracts lots of attention and efforts from both academic and industry sides. In this paper, we review the development of B2B collaboration and collaborative business processes, provide an overview of related issues in managing collaborative business processes, and discuss some emerging technologies and their relationships to collaborative business processes. Finally, we introduce the papers that are published in this special issue.
Machine translation in foreign language learning: Language learners’ and tutors’ perceptions of its advantages and disadvantages
Authors: Ana Niño
Venue: ReCALL (2009)

This paper presents a snapshot of what has been investigated in terms of the relationship between machine translation (MT) and foreign language (FL) teaching and learning. For this purpose four different roles of MT in the language class have been identified: MT as a bad model, MT as a good model, MT as a vocational training tool (especially in the form of translation memories, pre-editing and post-editing), and MT as a “CALL tool”. Subsequently, some of the implications of the use of MT and of free online MT for FL learning are outlined and discussed along with practical examples for language teaching purposes. Finally, qualitative data, drawn from our empirical investigation are presented as synthesized findings pertaining to the perceptions of language learners and tutors in relation to the use of MT and, in particular, free online MT as a language tool.
Representing Relative Direction as a Binary Relation of Oriented Points
Authors: Reinhard Moratz
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)

A central issue in robotics is the representation of relative orientation. Currently, the standard solution utilizes metrical representations. The main reason for this might be that representing rela-tively fine distinctions is useful in many robotics tasks. If qualitative spatial constraint calculi are to be applied to cognitve robotics, they therefore have to afford relatively fine distinctions. The challenge for us then is to find a calculus which allows these fine distinctions, and yet is still simple enough to provide a provably minimal composition table. In this paper we introduce a new calculus about oriented points which has a scalable granularity. In this calculus, named $\mathcal{OPRA}$, simple rules can generate the minimal composition table. Furthermore, the algebraic closure for a set of $\mathcal{OPRA}$ statements is sufficient to solve knowledge integration tasks in robotics.
Theoretical analysis on the finite-support approximation for the mixing-phase FIR systems
Authors: Shih Yu Chang, Hsiao-Chun Wu
Venue: Signal Processing (2009)

The inverse system approximation using the finite impulse responses (FIR) and the corresponding model-order determination are essential to a broad area of science and technology utilizing signal processing. To the best of our knowledge, there exists no explicit formulation of the exact L"2 approximation error for the truncated inverse filters. The approach to determine the minimum inverse model-order subject to the maximum allowable L"2 approximation error is also in demand. In this paper, we present two L"2 approximation error measures and the two corresponding optimal finite-support approximates. Also, we derive the explicit L"2 approximation error functions with respect to roots, multiplicities and model orders for these two kinds of approximates. Then, we propose a new algorithm to determine the minimum total model order of the appropriate truncated inverse filter to achieve a specified L"2 approximation error. Our newly derived L"2 approximation error evaluation method can be employed for signal processing, telecommunication, control systems involving the inverse filtering in the future. Besides, our novel model-order determination algorithm can be utilized for efficient dynamic memory allocation in a wide variety of applications since such a minimum total model order is proportional to the memory usage for any inverse filter implementation.
Modelling computational requirements of mobile robotic systems using zones and processing windows
Authors: Ala' Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor
Venue: Real-Time Systems (2009)

Mobile robotic systems must sense constraints imposed by a dynamically changing environment and predictably react to those changes in real-time. Complexity arises in mobile robotic systems because the computing platform travels through the environment with which the system is interacting. These systems have spatio-temporal requirements in the sense that correct behavior is defined in terms of both space and time. The focus of this paper is mobile robotic platforms that must sense their environment and avoid obstacles as they navigate from one point to another. We present a design and analysis methodology for these platforms that integrates spatio-temporal attributes with fixed priority real-time scheduling through the use of zone and processing window abstractions.
An Information Theoretic Framework for Biometric Security Systems
Authors: Lifeng Lai, Siu-Wai Ho, H. Vincent Poor
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

An information theoretic framework is established to analyze the performance of biometric security systems. Two performance metrics, namely privacy, measured by the normalized equivocation rate of the biometric measurements, and security, measured by the rate of the key generated from the biometric measurements, are first defined. A fundamental tradeoff between these two metrics is then identified. The scenario in which a potential attacker does not have side information is considered first. The privacy-security region, which characterizes the above-noted tradeoff, is derived for this case. An important role of common information among random variables is revealed in perfect privacy biometric security systems. The scenario in which the attacker has side information is then considered. Inner and outer bounds on the privacy-security tradeoff are derived in this case.
A Formal Ontology for Business Process Model TAP: Tasks-Agents-Products
Authors: Souhei Ito, Shigeki Hagihara, Naoki Yonezaki
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

TAP is a general process modeling framework with which we can describe process specifications in terms of tasks, agents and products that are relevant to the concept of processes. However, its formal semantics and pragmatics have not been rigorously studied, i.e. the usage of vocabulary words provided by TAP framework and the pieces of reality which TAP framework captures has not been formally considered. In this paper, we clarify the pragmatics of TAP and the world structures of TAP process models by formal approach. We present the semantic structure for TAP process models and introduce a logical language to restrict world structures of TAP. A formal ontology for business process model TAP is the characterization described as a set of axioms in our logical language.
E-zyme
Authors: Yoshihiro Yamanishi, Masahiro Hattori, Masaaki Kotera, Susumu Goto, Minoru Kanehisa
Venue: Bioinformatics (2009)

Motivation: The IUBMB's Enzyme Nomenclature system, commonly known as the Enzyme Commission (EC) numbers, plays key roles in classifying enzymatic reactions and in linking the enzyme genes or proteins to reactions in metabolic pathways. There are numerous reactions known to be present in various pathways but without any official EC numbers, most of which have no hope to be given ones because of the lack of the published articles on enzyme assays. Results: In this article we propose a new method to predict the potential EC numbers to given reactant pairs (substrates and products) or uncharacterized reactions, and a web-server named E-zyme as an application. This technology is based on our original biochemical transformation pattern which we call an ‘RDM pattern’, and consists of three steps: (i) graph alignment of a query reactant pair (substrates and products) for computing the query RDM pattern, (ii) multi-layered partial template matching by comparing the query RDM pattern with template patterns related with known EC numbers and (iii) weighted major voting scheme for selecting appropriate EC numbers. As the result, cross-validation experiments show that the proposed method achieves both high coverage and high prediction accuracy at a practical level, and consistently outperforms the previous method. Availability: The E-zyme system is available at http://www.genome.jp/tools/e-zyme/ Contact: kanehisa@kuicr.kyoto-u.ac.jp
Requirements for reflective argument visualization tools: a case for using validity as a normative standard
Authors: Michael H. G. Hoffmann
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to motivate reflection on one's own thinking, and to induce cognitive change. This function of argumentation systems is important for argument-based conflict negotiations, deliberation processes, intercultural communication, text analysis, and learning through argument visualization. In all these situations success is only possible when people are able to change their mind, learn something, or start to reframe well-established ways of perceiving and interpreting things. Based on these requirements, I defend and explain in the second part my decision to use for Logical Argument Mapping---a method specifically designed for supporting reflective argumentation---only argument schemes that are deductively valid.
Bandit-based optimization on graphs with application to library performance tuning
Authors: Frédéric de Mesmay, Arpad Rimmel, Yevgen Voronenko, Markus Püschel
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language generated by a suitably defined grammar. We propose a novel algorithm that solves this problem by reducing it to maximizing an objective function over the sinks of a directed acyclic graph. This algorithm valuates nodes using Monte-Carlo and grows a subgraph in the most promising directions by considering local maximum k-armed bandits. When used inside an adaptive linear transform library, it cuts down the search time by an order of magnitude compared to the existing algorithm. In some cases, the performance of the implementations found is also increased by up to 10% which is of considerable practical importance since it consequently improves the performance of all applications using the library.
Visual 3-D SLAM from UAVs
Authors: Jorge Artieda, José M. Sebastian, Pascual Campoy, Juan F. Correa, Iván F. Mondragón, Carol Martínez, Miguel Olivares
Venue: Journal of Intelligent and Robotic Systems (2009)

The aim of the paper is to present, test and discuss the implementation of Visual SLAM techniques to images taken from Unmanned Aerial Vehicles (UAVs) outdoors, in partially structured environments. Every issue of the whole process is discussed in order to obtain more accurate localization and mapping from UAVs flights. Firstly, the issues related to the visual features of objects in the scene, their distance to the UAV, and the related image acquisition system and their calibration are evaluated for improving the whole process. Other important, considered issues are related to the image processing techniques, such as interest point detection, the matching procedure and the scaling factor. The whole system has been tested using the COLIBRI mini UAV in partially structured environments. The results that have been obtained for localization, tested against the GPS information of the flights, show that Visual SLAM delivers reliable localization and mapping that makes it suitable for some outdoors applications when flying UAVs.
Usage Statistics of E-serials, 1st edition
Authors: David C. Fowler
Venue:  (2007)

As libraries increase their use of electronic resources, the value of quality evaluation of usage statistics has gained greater importance. Usage Statistics of E-Serials tackles this difficult issue by exploring in detail the proper evaluation of the level of usage of electronic resources. Noted experts discuss their own experiences in the field from multiple viewpoints and backgrounds, providing the reader with a well-rounded view of the entire topic. Issues comprehensively examined include the gathering and processing of statistics, costs and benefits of e-journals, evaluation and interpretation of data, and the comparison of different types of data collection methods. 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
Pro Hadoop, 1st edition
Authors: Jason Venner
Venue:  (2009)

Youve heard the hype about Hadoop: it runs petabytescale data mining tasks insanely fast, it runs gigantic tasks on clouds for absurdly cheap, its been heavily committed to by tech giants like IBM, Yahoo!, and the Apache Project, and its completely open source (thus free). But what exactly is it, and more importantly, how do you even get a Hadoop cluster up and running? From Apress, the name youve come to trust for handson technical knowledge, Pro Hadoop brings you up to speed on Hadoop. You learn the ins and outs of MapReduce; how to structure a cluster, design, and implement the Hadoop file system; and how to build your first cloudcomputing tasks using Hadoop. Learn how to let Hadoop take care of distributing and parallelizing your softwareyou just focus on the code, Hadoop takes care of the rest. Best of all, youll learn from a tech professional whos been in the Hadoop scene since day one. Written from the perspective of a principal engineer with downinthetrenches knowledge of what to do wrong with Hadoop, you learn how to avoid the common, expensive first errors that everyone makes with creating their own Hadoop system or inheriting someone elses. Skip the novice stage and the expensive, hardtofix mistakes...go straight to seasoned pro on the hottest cloudcomputing framework with Pro Hadoop. Your productivity will blow your managers away. What youll learn Set up a standalone Hadoop cluster the smart way, laid out simply and step by step so you can get up and running quickly to build your next data center, collaborative, dataintensive Internet services application, Software as a Service (SaaS), and more. Optimize your Hadoop production tasks like an experienced pro. Work with timeproven, bulletproof standard patterns that have been tested and debugged in highvolume production. Understand just enough theoretical knowledge to know why something works in Hadoop, without getting bogged down in abstruse walls of theory. Get detailed explanations of not only how to do something with Hadoop, but also why, from a frontline coder with years in the Hadoop game. Turn someone elses expensive clusterwide wrong into an orderly, productive "right" with professionallevel debugging and testing. Who is this book for? IT professionals interested in investigating Hadoop and implementing it in their organizations, and existing Hadoop users who want to deepen their professional toolkits. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
Dynamic micro-targeting: fitness-based approach to predicting individual preferences
Authors: Tianyi Jiang, Alexander Tuzhilin
Venue: Knowledge and Information Systems (2009)

It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using statistics-based methods that compute a set of statistics from the customer data and group customers into segments by applying clustering algorithms. Recent research proposed a direct grouping-based approach that combines customers into segments by optimally combining transactional data of several customers and building a data mining model of customer behavior for each group. This paper proposes a new micro-targeting method that builds predictive models of customer behavior not on the segments of customers but rather on the customer-product groups. This micro-targeting method is more general than the previously considered direct grouping method. We empirically show that it outperforms the direct grouping and statistics-based segmentation methods across multiple experimental conditions and that it generates predominately small-sized segments, thus providing additional support for the micro-targeting approach to personalization.
Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
Authors: Philip S. Hirschhorn, Jeffrey Hoffstein, Nick Howgrave-Graham, William Whyte
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

We present the new NTRUEncrypt parameter generation algorithm, which is designed to be secure in light of recent attacks that combine lattice reduction and meet-in-the-middle (MITM) techniques. The parameters generated from our algorithm have been submitted to several standard bodies and are presented at the end of the paper.
Systematic Construction of Iris-Based Fuzzy Commitment Schemes
Authors: Christian Rathgeb, Andreas Uhl
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

As a result of the growing interest in biometrics a new field of research has emerged entitled Biometric Cryptosystems. Only a small amount of work, which additionally tends to be custom-built according to the specific application context, has been published in this area. This work provides a systematic treatment of how to construct biometric cryptosystems based on iris biometrics. A cryptographic primitive called Fuzzy Commitment Scheme is adopted to different types of iris recognition algorithms to hide and retrieve a cryptographic key in and out of a biometric template. Experimental results confirm the soundness of the approach.
Enhancing search space diversity in multi-objective evolutionary drug molecule design using niching
Authors: Johannes W. Kruisselbrink, Alexander Aleman, Michael T.M. Emmerich, Ad P. IJzerman, Andreas Bender, Thomas Baeck, Eelke van der Horst
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

There exist several applications of multi-objective evolutionary algorithms for drug design, however, a common drawback in recent approaches is that the diversity of resulting molecule populations is relatively low. This paper seeks to overcome this problem by introducing niching as a technique to enhance search space diversity. A single population approach with dynamic niche identification is studied in the application domain. In order to apply niching in molecular spaces a metric for measuring the dissimilarity of molecules will be introduced. The approach will be validated in case studies and compared with results of an NSGA-II algorithm without niching in the search space.
The Basic AI Drives
Authors: Stephen M. Omohundro
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

One might imagine that AI systems with harmless goals will be harmless. This paper instead shows that intelligent systems will need to be carefully designed to prevent them from behaving in harmful ways. We identify a number of “drives” that will appear in sufficiently advanced AI systems of any design. We call them drives because they are tendencies which will be present unless explicitly counteracted. We start by showing that goal-seeking systems will have drives to model their own operation and to improve themselves. We then show that self-improving systems will be driven to clarify their goals and represent them as economic utility functions. They will also strive for their actions to approximate rational economic behavior. This will lead almost all systems to protect their utility functions from modification and their utility measurement systems from corruption. We also discuss some exceptional systems which will want to modify their utility functions. We next discuss the drive toward self-protection which causes systems try to prevent themselves from being harmed. Finally we examine drives toward the acquisition of resources and toward their efficient utilization. We end with a discussion of how to incorporate these insights in designing intelligent technology which will lead to a positive future for humanity.
Effects of resource and remembering on social networks
Authors: Chung-Yuan Huang, Yu-Shiuan Tsai, Chuen-Tsai Sun
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

To better represent human interactions in social networks, the authors take a network-oriented simulation approach to analyze the evolution of acquaintance networks based on local interaction rules. Our approach takes into consideration shared friendships, resources, remembering, meetings by chance, and arriving and leaving. Our three main findings are: (a) the topological features of acquaintance networks are affected by initial average values for parameters (i.e., resources, remembering, and number of friendships), but not by their statistical distributions; (b) resources, remembering, and initial friendships positively influence increases in average numbers of friends and decreases in degrees of clustering and separation; and (c) widely used fieldwork sampling methods do not capture the actual node degree distributions of social networks. In addition to confirming the successful use of a network-oriented simulation approach to social network research, the findings indicate a strong need for an approach that stresses interactive rules and "what-if" type simulation experiments.