ppxscal/embedding_network huggingface dataset:
A Decomposition Approach with Invariant Analysis for Workflow Coordination
Authors: Jidong Ge, Haiyang Hu
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

In order to coordinate different workflows from different organizations, this paper applies a model called Interaction-Oriented Petri Nets (IOPN). This model adopts the process interaction between transitions (workflow actions) from different workflows, to coordinate different workflow processes. To assure workflow process and workflow coordination can be executed correctly and completely, soundness and relaxed soundness are important properties to be considered. When the IOPN system becomes larger and larger, the state space of the coordination system becomes too large to analyze. To avoid the state space explosion problem, decomposition approach based on invariant analysis can be a complement analysis technique. IOPN model can be decomposed into a set of sequence diagrams when it is relaxed sound.
A Retrospective and Prospective View of Information Technology Professionals' Use of Tools: Maturing the User Experience
Authors: Candace Soderston
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

The Information Technology (IT) professional's user experience has evolved both in terms of software tool attributes and the process workflow within which the IT tasks exist. Based on user research with IT professionals over the past two decades, including ethnographic observational field studies, focus group discussions, and hands-on user tests with analyses of errors and perceived complexities, this paper presents a set of hypotheses about user interface design aspects that across the industry most impede the workflow of typical IT professionals. It discusses how this relates to typical information workers' behavior, as well as what steps we as tools and systems designers can take to better support the IT professionals' user interface needs.
What Is in a Namespace?
Authors: Antony Rowstron
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Building large-scale distributed systems that are decentralized is challenging. Distributed Hash Tables, or structured overlays, attempted to make the process of building these distributed systems easier, by abstracting away many of the complexities of the physical topology, and provide a virtual namespace. The virtual namespace can then be exploited, for example to build or maintain other data structures like a tree to support application-level multicast or group communication. Because the namespace is independent of the underlying physical topology, it can be used to help mitigate the impact of network topology change, for example through churn. A challenge is to understand how to exploit the difference between a physical topology and a virtual topology (or namespace). In the first half of the talk, using examples from a number of systems I have worked on over the years, I will highlight how a namespace can be used and the differences between algorithms designed to work in virtual versus physical topologies.In the second half of the talk I will then outline how recently we have begun more deeply exploring the relationship between physical and virtual topologies. The first is exploiting a virtual topology to enable disruption-tolerant routing protocols that can work on networks that are frequently and dynamically partitioning. The second is examining how we can build physical topologies that are more aligned to a virtual topology, and how this makes building servers that run in Internet-scale Data Centres easier to implement.
PhotoSlap: a multi-player online game for semantic annotation
Authors: Chien-Ju Ho, Tsung-Hsiang Chang, Jane Yung-Jen Hsu
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Multimedia content presents special challenges for the search engines, and could benefit from semantic annotation of images. Unfortunately, manual labeling is too tedious and time-consuming for humans, whereas automatic image annotation is too difficult for the computers. In this paper, we explore the power of human computation by designing a multi-player online game, PhotoSlap, to achieve the task of annotating metadata for a collection of digital photos. PhotoSlap engages users in an interactive game that capitalizes on human ability in deciphering quickly whether the same person shows up in two consecutive images presented by the computer. The game mechanism supports the objection and trap actions to encourage truthful input from the players. This research extends human computation research in two aspects: game-theoretic design principles and quantitative evaluation metrics. In particular, PhotoSlap can be shown to reach subgame perfect equilibrium with the target strategy when players are rational and without collusion. Experiments involving four focus groups have been conducted, and the preliminary results demonstrated the game to be fun and effective in annotating people metadata for photo collections.
Llull and copeland voting broadly resist bribery and control
Authors: Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Control of elections refers to attempts by an agent to, via such actions as addition/deletion/partition of candidates or voters, ensure that a given candidate wins (Bartholdi, Tovey, & Trick 1992). An election system in which such an agent's computational task is NP-hard is said to be resistant to the given type of control. Aside from election systems with an NP-hard winner problem, the only systems known to be resistant to all the standard control types are highly artificial election systems created by hybridization (Hemaspaandra, Hemaspaandra, & Rothe 2007b). In this paper, we prove that an election system developed by the 13th century mystic Ramon Llull and the well-studied Copeland election system are both resistant to all the standard types of (constructive) electoral control other than one variant of addition of candidates. This is the most comprehensive resistance to control yet achieved by any natural election system whose winner problem is in P. In addition, we show that Llull and Copeland voting are very broadly resistant to bribery attacks, and we integrate the potential irrationality of voter preferences into many of our results.
Pore sealing of mesoporous silica low-k dielectrics by oxygen and argon plasma treatments
Authors: Chih-Chieh Chang, Fu-Ming Pan, Ching-Wen Chen
Venue: Microelectronic Engineering (2009)

In this study, we have prepared surfactant templated mesoporous silica thin films as the ultralow-k dielectrics and a TaN"X thin film deposited by plasma enhanced atomic layer chemical vapor deposition (PE-ALCVD) using TaCl"5 as the gas precursor was used as the diffusion barrier. Without any surface modification for the dielectric layer, Ta atoms could easily diffuse into the mesoporous layer seriously degrading dielectric properties. O"2 and Ar plasmas have been used to modify the surface of the mesoporous dielectric in a high density plasma chemical vapor deposition (HDP-CVD) system, and both of the treatments produced a densified oxide layer a few nanometer thick. According to transmission electron microscopy and Auger electron spectroscopy, the pore sealing treatment could effectively prevent Ta atoms from diffusing into the mesoporous dielectric during the PE-ALCVD process.
Learning and use of sensorimotor schemata maps
Authors: Claudius Glaser, Frank Joublin, Christian Goerick
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

In this paper we present a framework for the learning and use of sensorimotor schemata. Therefore, we introduce the concept of a schema as a compact representation of an attractor dynamic and discuss how schemata, if embedded into the proposed architecture, can be used to produce, simulate, or recognize goal-directed behaviors. We further present a first implementation of the framework which incorporates well-founded biological principles. Firstly, we apply population coding for the representation of schemata in a neural map and, secondly, we use basis functions as flexible intermediate representations for sensorimotor transformations. Simulation results show that during an initial motor babbling phase the system is able to autonomously develop schemata which correspond to generic behaviors. Moreover, the learned sensorimotor schemata map is topologically ordered insofar as neighboring schemata represent similar behaviors. In accordance with biological findings on the motor system of vertebrates the schemata form a set of behavior primitives which can be flexibly combined to yield more complex behaviors.
Introduction
Authors: Felix Wolf, Andy D. Pimentel, Luiz Derose, Soonhoi Ha, Thilo Kielmann, Anna Morajko
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The spread of systems that provide parallelism either "in-the-large" (grid infrastructures, clusters) or "in-the-small" (multi-core chips) creates new opportunities for exploiting parallelism in a wider spectrum of application domains. However, the increasing complexity of parallel and distributed platforms renders the programming, the use, and the management of these systems a costly endeavor that requires advanced expertise and skills. There is therefore an increasing need for powerful support tools and environments that will help end users, application programmers, software engineers and system administrators to manage the increasing complexity of parallel and distributed platforms. This topic aims at bringing together tool designers, developers, and users in order to share novel ideas, concepts, and products covering a wide range of platforms, including homogeneous and heterogeneous multicore architectures. The Program Committee sought high-quality contributions with solid foundations and experimental validations on real systems, and encouraged the submission of new ideas on intelligent monitoring and diagnosis tools and environments which can exploit behavior knowledge to detect programming bugs or performance bottlenecks and help ensure correct and efficient parallel program execution.
Policy Compliance in Collaborative Systems
Authors: Max Kanovich, Paul Rowe, Andre Scedrov
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

When collaborating agents share sensitive information to achieve a common goal it would be helpful to them to decide whether doing so will lead to an unwanted release of confidential data. These decisions are based on which other agents are involved, what those agents can do in the given context, and the individual confidentiality preferences of each agent. In this paper we consider a model of collaboration in which each agent has an explicit confidentiality policy. We offer three ways to interpret policy compliance (system compliance, plan compliance and weak plan compliance) corresponding to different levels of trust among the agents. We show it is EXPSPACE-complete to determine whether a given system is compliant and whether the agents can collaboratively reach a given common goal. On the other hand, we show it is undecidable to determine whether a given system has either a compliant plan or a weakly compliant plan leading to a common goal. The undecidability results are, in part, a consequence of the flexibility of the model, which allows interpretations of policy compliance that depend on current configurations.
Why be a Wikipedian
Authors: Hoda Baytiyeh, Jay Pfaffman
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Wikipedia is a user-edited encyclopedia. Unpaid users contribute articles, edit them, and have heated debates about what information should be included or excluded. This study is designed to learn more about why people are willing to do this work without any fiscal compensation. Wikipedia administrators (n=115) completed an online survey with Likert-scaled items of potential types of satisfaction derived from participation as well as comments that were used to check the validity of the Likert-scaled items and allow participants to say in their own words why they were Wikipedian. Results showed that contributors in Wikipedia are driven largely by motivations to learn and create.
Automatic Classification of Enzyme Family in Protein Annotation
Authors: Cássia T. Santos, Ana L. Bazzan, Ney Lemke
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

Most of the tasks in genome annotation can be at least partially automated. Since this annotation is time-consuming, facilitating some parts of the process --- thus freeing the specialist to carry out more valuable tasks --- has been the motivation of many tools and annotation environments. In particular, annotation of protein function can benefit from knowledge about enzymatic processes. The use of sequence homology alone is not a good approach to derive this knowledge when there are only a few homologues of the sequence to be annotated. The alternative is to use motifs. This paper uses a symbolic machine learning approach to derive rules for the classification of enzymes according to the Enzyme Commission (EC). Our results show that, for the top class, the average global classification error is 3.13%. Our technique also produces a set of rules relating structural to functional information, which is important to understand the protein tridimensional structure and determine its biological function.
L2E estimation of mixture complexity for count data
Authors: T. Umashanger, T. N. Sriram
Venue: Computational Statistics Data Analysis (2009)

For count data, robust estimation of the number of mixture components in finite mixtures is revisited using L"2 distance. An information criterion based on L"2 distance is shown to yield an estimator, which is also shown to be strongly consistent. Monte Carlo simulations show that our estimator is competitive with other procedures in correctly determining the number of components when the data comes from Poisson mixtures. When the data comes from a negative binomial mixture but the postulated model is a Poisson mixture, simulations show that our estimator is highly competitive with the minimum Hellinger distance (MHD) estimator in terms of robustness against model misspecification. Furthermore, we illustrate the performance of our estimator for a real dataset with overdispersion and zero-inflation. Computational simplicity combined with robustness property makes the L"2E approach an attractive alternative to other procedures in the literature.
A New ART-LMS Neural Network for the Image Restoration
Authors: Tzu-Chao Lin, Mu-Kun Liu, Chien-Ting Yeh
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

A novel neural network design---the adaptive resonance theory least mean square (ART-LMS) neural network---is proposed for the restoration of images corrupted by impulse noise. The network design is based on the concept of counterpropagation network (CPN). There is a vigilance parameter the ART network uses to automatically generate the cluster layer node for the Kohonen learning algorithm in CPN. In addition, the LMS learning algorithm is used to adjust the weight vectors between the cluster layer and the output layer for the Grossberg learning algorithm in CPN. The advantages of the ART-LMS network include an effective solution to the initial weight problem and a good ability to handle the cluster layer nodes for the CPN learning process. Experimental results have demonstrated that the proposed filter based on ART-LMS outperforms many well-accepted conventional as well as new filters in terms of noise suppression and detail preservation.
A Unified Iterative Scheme for Solving Fully Fuzzy Linear System
Authors: Jing Gao, Qiang Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

In this paper, a unified iterative scheme to solve general fully fuzzy linear system (FFLS) in which all parameters are LR fuzzy numbers is discussed. By this iterative scheme, we present Gradient iterative algorithm and Least-squares iterative algorithm for solving non-square FFLS. Also, we test the iterative algorithm and show its effectiveness using a numerical example.
A Design Method for Next Generation User Interfaces Inspired by the Mixed Reality Continuum
Authors: Jörg Stöcklein, Christian Geiger, Volker Paelke, Patrick Pogscheba
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In this paper we present a new approach to the systematic user centric development of next generation user interfaces (NGUI). Central elements of the approach are a conceptual model that extends the well established model view controller paradigm with an environment component, an iterative development methodology that guides development along the mixed reality continuum and tools to support the implementation. The approach is demonstrate with a concrete example of NGUI development.
Research on Equipment Support Mobile Learning System
Authors: Dai Dongsheng, Ji Yalin, Li Zhengzheng, Li Huijie
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Mobile learning is a new learning mode and it can the necessary supply of education. This paper introduces the conception and character of mobile learning. It discusses the essentiality of mobile learning in equipment support. With the character of the army equipment maintenance unit and the technicians' learning requirement, it constructs the equipment support mobile learning system architecture based on data resource tier, business logic tier, network tier and expression tier and describes the components and functions of every tier. It discusses two ways of mobile learning: PDA and portable PC. At last, it explains how to deploy the equipment support mobile learning system in the camp area or under field operations.
Measuring frame relatedness
Authors: Marco Pennacchiotti, Michael Wirth
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

In this paper we introduce the notion of "frame relatedness", i.e. relatedness among prototypical situations as represented in the FrameNet database. We first demonstrate the cognitive plausibility of that notion through an annotation experiment, and then propose different types of computational measures to automatically assess relatedness. Results show that our measures provide good performance on the task of ranking pairs of frames.
A Multilevel Parallelization Framework for High-Order Stencil Computations
Authors: Hikmet Dursun, Ken-Ichi Nomura, Liu Peng, Richard Seymour, Weiqiang Wang, Rajiv K. Kalia, Aiichiro Nakano, Priya Vashishta
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Stencil based computation on structured grids is a common kernel to broad scientific applications. The order of stencils increases with the required precision, and it is a challenge to optimize such high-order stencils on multicore architectures. Here, we propose a multilevel parallelization framework that combines: (1) inter-node parallelism by spatial decomposition; (2) intra-chip parallelism through multithreading; and (3) data-level parallelism via single-instruction multiple-data (SIMD) techniques. The framework is applied to a 6 th order stencil based seismic wave propagation code on a suite of multicore architectures. Strong-scaling scalability tests exhibit superlinear speedup due to increasing cache capacity on Intel Harpertown and AMD Barcelona based clusters, whereas weak-scaling parallel efficiency is 0.92 on 65,536 BlueGene/P processors. Multithreading+SIMD optimizations achieve 7.85-fold speedup on a dual quad-core Intel Clovertown, and the data-level parallel efficiency is found to depend on the stencil order.
A computational morphology system for Arabic
Authors: Riyad Al-Shalabi, Martha Evens
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

This paper describes a new algorithm for morphological analysis of Arabic words, which has been tested on a corpus of 242 abstracts from the <u>Saudi Arabian National Computer Conference</u>. It runs an order of magnitude faster than other algorithms in the literature.
The MPI 2.2 Standard and the Emerging MPI 3 Standard
Authors: Richard L. Graham
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

The Message Passing Interface (MPI) 2.1 standard (http://www.mpi-forum.org) has served the parallel technical and scientific applications community well over the last decade, and has become the ubiquitous communications application programming interface for this community. However, this extensive use has also exposed areas where this standard can be strengthened to meet the challenges of emerging ultra-scale computing. This talk will describe the changes introduced to the standard in latest version of the MPI standard, 2.2, and current work targeting version 3 of this standard.
Segmentation of Wood Fibres in 3D CT Images Using Graph Cuts
Authors: Erik L. Wernersson, Anders Brun, Cris L. Luengo Hendriks
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

To completely segment all individual wood fibres in volume images of fibrous materials presents a challenging problem but is important in understanding the micro mechanical properties of composite materials. This paper presents a filter that identifies and closes pores in wood fibre walls, simplifying the shape of the fibres. After this filter, a novel segmentation method based on graph cuts identifies individual fibres. The methods are validated on a realistic synthetic fibre data set and then applied on μCT images of wood fibre composites.
Sustainable script and scaffold development for collaboration on varying web content: the S-COL technological approach
Authors: Christof Wecker, Karsten Stegmann, Florian Bernstein, Michael J. Huber, Georg Kalus, Sabine Rathmayer, Ingo Kollar, Frank Fischer
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

We present a single solution for the following two problems: (1) to provide just-in-time support for collaborative learning tasks on top of arbitrary web pages (e. g. in order to foster online search competence) and (2) to transfer collaboration scripts implemented on a particular platform to other platforms. S-COL solves both by using fixed browser-side scripts and scaffolds and triggering them by recognizing types of functionally equivalent web pages, and combines this with collaborative web-browsing.