ppxscal/embedding_network huggingface dataset:
An ontological basis for computer aided innovation
Authors: Cecilia Zanni-Merk, Denis Cavallucci, François Rousselot
Venue: Computers in Industry (2009)

Knowledge acquisition and capitalization to solve problems concerning artefact evolution, still called inventive design, has a certain quantity of specific characteristics. It needs the choice of certain pieces of knowledge that may induce evolutions; it leads to reformulating the initial problem to build an abstract model of the artefact. The theoretical approach we are interested in, called TRIZ (the Russian acronym for Theory for Inventive Problem Solving), when translated into a methodological procedure, has not been fully formalized yet. This article proposes an ontology of the main notions of the concepts associated to knowledge acquisition in this framework. This ontology, beyond the clarification it brings to the involved notions, will be the support of a software architecture for implementing the method for knowledge acquisition and problem formulation.
Novel Smith Predictor and BPNN for Wireless Networked Control Systems
Authors: Feng Du, Wencai Du
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

In order to effectively restrain the impact of network delays which are brought because of bandwidth constraint, path loss, signal attenuation and ambient noise in wireless networked control systems (WNCS), aiming at time-variant network delays and imprecise Smith predictor models, a new approach is proposed that novel Smith dynamic predictor combined with back propagation neural network (BPNN) control. Because new Smith predictor does not include network delay models, therefore network delays do not need to be measured, identified or estimated on-line, it is applicable to some occasions that network delays are random, time-variant or uncertain. Based on IEEE 802.11b/g (WLAN), the results of simulation experiment show validity of the control scheme.
Agent-Base Workflow Management System Architecture --- An Example on Conference Info System
Authors: Feng-Chao Yang
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

This study, taking reference of "Generic Workflow Production Structure, GWPS" proposed by WfMC and combining with design concepts of the Multi-Agent System, sets forth "Agent-Based Workflow Management System Architecture" and implements it onto the JADE (Java Agent DEvelopment Framework) platform. Taking Conference Info System as an example, this study analyzes, designs and implements Agent-Based Conference Info System by the structure set forth in the study.
An Improved Method of Image Denoising Base on Stationary Wavelet
Authors: Liu En-hai, Liu Hong-pu, Zhang Yan, Guo Zhi-tao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

This work describes a computationally more efficient and adaptive threshold estimation method for image denoising in the stationary wavelet domain. In this proposed method, the choice of the threshold estimation is carried out by analyzing the statistical parameters of the wavelet sub band coefficients like standard deviation, arithmetic mean and geometrical mean. Then novel threshold method is used to remove the noisy coefficients, by combing the soft-thresholding and hard-thresholding by the proposed method. Experimental results on several test images by using this method show that this method yields significantly superior image quality and better Peak Signal to Noise Ratio (PSNR).
Generating Pairing-Friendly Curves with the CM Equation of Degree 1
Authors: Hyang-Sook Lee, Cheol-Min Park
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

Refinements of the Brezing-Weng method have provided families of pairing-friendly curves with improved ρ-values by using non-cyclotomic polynomials that define cyclotomic fields. We revisit these methods via a change-of-basis matrix and completely classify a basis for a cyclotomic field to produce a family of pairing-friendly curves with a CM equation of degree 1. Using this classification, we propose a new algorithm to construct Brezing-Weng-like elliptic curves having the CM equation of degree 1, and we present new families of curves with larger discriminants.
Supportive Web Design for Users from Different Culture Origins in E-Commerce
Authors: Kyeong Kang
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

This paper presents an investigation of supportive design features for users from different cultural origins in global e-commerce sites applying the principles of human computer interaction to web interface design. This investigation was necessitated from a need to establish an understanding of the barriers in the implementation of e-business on a global level. The paper begins with an overview of current business-to-user (B2C) e-commerce implementation on the web, and then describes cultural issues in the global e-commerce.
Nonlinear Dimension Reduction and Visualization of Labeled Data
Authors: Kerstin Bunte, Barbara Hammer, Michael Biehl
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

The amount of electronic information as well as the size and dimensionality of data sets have increased tremendously. Consequently, dimension reduction and visualization techniques have become increasingly popular in recent years. Dimension reduction is typically connected with loss of information. In supervised classification problems, class labels can be used to minimize the loss of information concerning the specific task. The aim is to preserve and potentially enhance the discrimination of classes in lower dimensions. Here we propose a prototype-based local relevance learning scheme, that results in an efficient nonlinear discriminative dimension reduction of labeled data sets. The method is introduced and discussed in terms of artificial and real world data sets. 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
An Hamiltonian interface SPH formulation for multi-fluid and free surface flows
Authors: N. Grenier, M. Antuono, A. Colagrossi, D. Le Touzé, B. Alessandrini
Venue: Journal of Computational Physics (2009)

In the present work a new SPH model for simulating interface and free surface flows is presented. This formulation is an extension of the one discussed in Colagrossi and Landrini (2003) and is related to the one proposed by Hu and Adams (2006) to study multi-fluid flows. The new SPH scheme allows an accurate treatment of the discontinuity of quantities at the interface (such as the density), and permits to model flows where both interfaces and a free surface are present. The governing equations are derived following a Lagrangian variational principle leading to an Hamiltonian system of particles. The proposed formulation is validated on test cases for which reference solutions are available in the literature.
It Governance in a Networked World: Multi-Sourcing Strategies and Social Capital for Corporate Computing
Authors: Laurence Lock Lee
Venue:  (2009)

The outsourcing of IT services over the past decade has triggered a need to reassess how IT governance and sourcing should be conducted. IT Governance in a Networked World: Multi-Sourcing Strategies and Social Capital for Corporate Computing provides theories concerning corporate social capital, intellectual capital, and social networks for academicians, practitioners, and field researchers. This book addresses relationship challenges in a world that is becoming increasingly networked, offering useful frameworks and practices for IT governance. 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
Spatial Conversion Analysis of Arable Land in Dongguan City Based on RS and GIS
Authors: Fang Yuan, Lu Yu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Land use change is the most significant aspect in the research field of globe changing. Affected by both of natural and artificial factors, the land use and land resources quality varied continually. Dongguan City where the zone has a typical feature of land use change and significant ecological effects is selected as a case. This paper analyzed the spatial conversion of arable land in Dongguan city based on RS and GIS technology. The results showed that the arable land area reduced rapidly and experienced rapid change under the pressure of urban expansion. It was the main period about the arable land to reduce from 1988 to 1995. More than 70 percent of arable land was converted to construction sites. Other types of lands also were converted to the arable land, which waters and the forest land were the major types.
Workload characterization in a high-energy data grid and impact on resource management
Authors: Adriana Iamnitchi, Shyamala Doraimani, Gabriele Garzoglio
Venue: Cluster Computing (2009)

The analysis of data usage in a large set of real traces from a high-energy physics collaboration revealed the existence of an emergent grouping of files that we coined "filecules". This paper presents the benefits of using this file grouping for prestaging data and compares it with previously proposed file grouping techniques along a range of performance metrics. Our experiments with real workloads demonstrate that filecule grouping is a reliable and useful abstraction for data management in science Grids; that preserving time locality for data prestaging is highly recommended; that job reordering with respect to data availability has significant impact on throughput; and finally, that a relatively short history of traces is a good predictor for filecule grouping. Our experimental results provide lessons for workload modeling and suggest design guidelines for data management in data-intensive resource-sharing environments.
On the Use of Stochastic Petri Nets in the Analysis of Signal Transduction Pathways for Angiogenesis Process
Authors: Lucia Napione, Daniele Manini, Francesca Cordero, András Horváth, Andrea Picco, Massimiliano Pierro, Simona Pavan, Matteo Sereno, Andrea Veglio, Federico Bussolino, Gianfranco Balbo
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

In this paper we consider the modeling of a selected portion of signal transduction events involved in the angiogenesis process. The detailed model of this process contains a large number of parameters and the data available from wet-lab experiments are not sufficient to obtain reliable estimates for all of them. To overcome this problem, we suggest ways to simplify the detailed representation that result in models with a smaller number of parameters still capturing the overall behaviour of the detailed one.Starting from a detailed stochastic Petri net (SPN) model that accounts for all the reactions of the signal transduction cascade, using structural properties combined with the knowledge of the biological phenomena, we propose a set of model reductions.
Grid-Enabling SPMD Applications through Hierarchical Partitioning and a Component-Based Runtime
Authors: Elton Mathias, Vincent Cavé, Stéphane Lanteri, Françoise Baude
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Developing highly communicating scientific applications capable of efficiently use computational grids is not a trivial task. Ideally, these applications should consider grid topology 1) during the mesh partitioning, to balance workload among heterogeneous resources and exploit physical neighborhood, and 2) in communications, to lower the impact of latency and reduced bandwidth. Besides, this should not be a complex matter in end-users applications. These are the central concerns of the DiscoGrid project, which promotes the concept of a hierarchical SPMD programming model, along with a grid-aware multi-level mesh partitioning to enable the treatment of grid issues by the underlying runtime, in a seamless way for programmers. In this paper, we present the DiscoGrid project and the work around the GCM/ProActive-based implementation of the DiscoGrid Runtime. Experiments with a non-trivial computational electromagnetics application show that the component-based approach offers a flexible and efficient support and that the proposed programming model can ease the development of such applications.
A Study on Multivariate Forecast Model of Threshold Gradient Based on Grey System Theory
Authors: Changjun Zhu, Bin Wang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

It is well known that there is threshold pressure gradient in low permeability porous media. The mathematic principle of GM(1,N) for threshold pressure gradient was firstly studied. Then the actual measurement data of threshold pressure gradient during the experiment were collected, and 11 reliable data were gained. By selecting 4 factors including viscosity, permeability, density and porosity as the grey modeling forecast indicators, the multivariable forecast model of GM(1,4) for threshold pressure gradient were respectively constructed. The result calculated by use of the model shows that the precision meets the requirements of engineering and the model can be used for predicting TPG. The application of this approach can supply basic data for the development of low permeability oilfield so as to save cost and labor.
Combination of statistical word alignments based on multiple preprocessing schemes
Authors: Jakob Elming, Nizar Habash
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We present an approach to using multiple preprocessing schemes to improve statistical word alignments. We show a relative reduction of alignment error rate of about 38%.
Intelligent Decision Support System of Ship Unsinkability Design in the First Design Stage
Authors: Hou Yue, Pu Jin-yun, Chen Xiao-hong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

If the ship is damaged, we should try our best to guarantee its unsinkability. Ship unsinkability is one of the most important aspects of ship survivability. The intelligent decision support system of ship unsinkability design in the first design stage is founded in this paper. The intelligent decision support system consists of two main functions. One is manual ship unsinkability design and the other is intelligent ship unsinkability design which is introduced in detail in this paper. The survival probability calculation model, ship unsinkability mathematic optimization model and intelligent optimization arithmetic corresponding to the mathematic optimization model are founded in the intelligent decision support system. The gene arithmetic is improved in the intelligent optimization arithmetic. The gene sequence is defined based on the tradition gene definition. The chromosome defined in this paper can be considered as a special chromosome of which gene sequence is ordered. At last, design cases are given to explicate how the intelligent system helps in ship unsinkability design jobs.
A Virus Evolution Genetic Algorithm for Scheduling Problem with Penalties of Independent Tasks on a Single Machine
Authors: Hu Shicheng, Chu Dianhui, Xu Xiaofei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Scheduling problem with penalties of independent tasks on a single machine is a NP-hard problem. In this paper, a scheduling problem of n tasks which have different ready times and due dates is given. With respect to this problem, a virus evolution genetic algorithm called SMSP-VEGA is developed. SMSP-VEGA is used to obtain the optimal scheduling sequences for the tasks so that the total tardy penalty costs are minimized. Different from GA, SMSP-VEGA has two types of operator: genetic operator and virus_infection operator. As the genetic operators can transfer evolutionary genes from parent to child generation and the virus_infection operators can spread evolutionary genes in the same generation, respectively, It can perform global search and local search in the same time. The schema theory is adopted to analyze the performance of SMSP-VEGA and the experimental results are also given. The theoretical analysis and experimental results show that the SMSP-VEGA outperforms the GA.
An evaluation of authoring interfaces for image-based navigation
Authors: Benjamin Walther-Franks, Dirk Wenig, Rainer Malaka, Barbara Grüter
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

We present the development and evaluation of an authoring system for image-based pedestrian navigation which lets authors take pictures and annotate instructions on the go in three interface variants. Results indicate that a freehand manner of photograph annotation is fastest, while authors strive toward visually pleasing annotation compositions.
The Abstract Streaming Machine: Compile-Time Performance Modelling of Stream Programs on Heterogeneous Multiprocessors
Authors: Paul M. Carpenter, Alex Ramirez, Eduard Ayguade
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Stream programming offers a portable way for regular applications such as digital video, software radio, multimedia and 3D graphics to exploit a multiprocessor machine. The compiler maps a portable stream program onto the target, automatically sizing communications buffers and applying optimizing transformations such as task fission or fusion, unrolling loops and aggregating communication. We present a machine description and performance model for an iterative stream compilation flow, which represents the stream program running on a heterogeneous multiprocessor system with distributed or shared memory. The model is a key component of the ACOTES open-source stream compiler currently under development. Our experiments on the Cell Broadband Engine show that the predicted throughput has a maximum relative error of 15% across our benchmarks.
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Authors: Takao Ito, Kazuo Misue, Jiro Tanaka
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the readability decreases when large-scale graphs are drawn. To maintain the readability in drawing large-scale graphs, we developed "sphere anchored maps," in which nodes in one set are arranged on a sphere. We describe the layout method for sphere anchored maps and the results of our user study. The results of our study revealed that more clusters of free nodes can be found using sphere anchored maps than using circular anchored maps. Thus, our maps have high readability, particularly around anchors.
Constructing Program Invariants via Solving QBF
Authors: Shikun Chen, Zhoujun Li, Mengjun Li
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Constructing program invariants is one of the key problems of program verification. A lot of approaches to invariant generation have been reported, and all of these methods assume that program variables are evaluated over infinite domains such as rational or integer. Actually, during the execution of program, all variables are expressed using bit-vectors with limited width and evaluated over finite domains. Many invariants suit for infinite domains may be invalid in finite domains, and vice versa. This paper proposes an approach to construct invariants for program whose variables are evaluated over finite domains. This method translates a program into constraints that are solved using a QBF (Quantified Boolean Formula) solver to yield desired program invariants. It can be used to discover a rich class of invariants including linear (or polynomial) equality (or inequality) invariants involving operations like addition, multiplication, division, shift, bitwise operation, even quantifiers. And we also show how this technique can be used to prove partial correctness, termination and total correctness.
Factors Affecting Online Game Players' Loyalty
Authors: Fan Zhao, Xiaowen Fang
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

In the past decade, online games have become an important electronic commerce application. A good understanding of customer online game behaviors is critical for both researchers and practitioners, such as game vendors and game developers. Many researchers focus their studies on the consumers' intention to play online games. However, the industry becomes more and more interested in the key factors to retain customers. To tackle the retention problem, this paper proposes a research framework of online game play loyalty. Based on this framework, thirteen hypotheses were developed and tested through a survey in U.S. universities. Overall, the results indicate the following: 1) Online game technology factors, such as the game story, game graphics, game length, game control and online game services, have significant impact on players' game enjoyment; 2) Game enjoyment and social norms have positive effects on intention to play; 3) Social norms, quality of online game community and intention to play are important predictors of online game loyalty.
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus
Authors: Xiaojuan Cai, Yonggen Gu
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In [1] a formulation of anonymity based on metrics of Probabilistic Applied Pi processes was proposed. As an extension to [1], we consider to neglect all the internal interactions in the definition of metric. In other words, the new metric between two processes turns out to be 0 when these two processes are weakly bisimilar (strongly bisimilar in [1]). Upon metric, the degree of probabilistic anonymity is modelled for general anonymous systems where there are no explicit senders or receivers. In addition, we devise an algorithm to calculate the metric between two finite processes. As a running example, we analyze the classical anonymous protocol -- Probabilistic Dining Cryptographer Problem -- to illustrate the effectiveness of our approach.
Intercultural Competence Game That Fosters Metacognitive Agility and Reflection
Authors: Elaine M. Raybourn
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

In this paper we describe the development of a multi-player computer game created to train the intercultural competence and metacognitive agility (self-awareness and self-regulated learning) of United States Army Special Forces team leaders. We describe a unique design that features a novel role for real-time, in-game peer performance assessment and feedback to encourage user reflection and self-explanation. We also discuss how the multiplayer game is successfully used in Special Forces intercultural communication education and offer user feedback results from a study conducted with 51 Special Forces officers.