ppxscal/embedding_network huggingface dataset:
On Game Theoretic Peer Selection for Resilient Peer-to-Peer Media Streaming
Authors: Mark Kai Ho Yeung, Yu-Kwong Kwok
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Peer-to-peer (P2P) media streaming quickly emerges as an important application over the Internet. A plethora of approaches have been suggested and implemented to support P2P media streaming. In our study, we first classified existing approaches and studied their characteristics by looking at three important quantities: number of upstream peers (parents), number of downstream peers (children), and average number of links per peer. In existing approaches, peers are assigned with a fixed number of parents without regard to their contributions, measured by the amount of outgoing bandwidths. Obviously, this is an undesirable arrangement as it leads to highly inefficient use of the P2P links. This observation motivates us to model the peer selection process as a cooperative game among peers. This results in a novel peer selection protocol such that the number of upstream peers of a peer is related to its outgoing bandwidth. Specifically, peers with larger outgoing bandwidth are given more parents, which make them less vulnerable to peer dynamics. Simulation results show that the proposed protocol improves delivery ratio using similar number of links per peer, comparing with existing approaches under a wide range of system parameters.
The Scientific and Technological Innovation and Chinese Textile Industry
Authors: Li Chuang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

With the gradually losing popular support of tariffs and other traditional trade protective measures, more and more export enterprises in China were affected by oversea technical trade measure. For the development trend of the trade rules, in the 10 years of the establishment of WTO, the members' notifications (that is, the new rules which are made out by every members and will influence the international trade) reached 20,387, which involved the technical rules 13,861, accounting for 68% of the total quantity, this also means that more than two thirds notifications were related with technology, and the influence of the technical trade measures taking the technical laws and regulations, the standard, the qualified evaluation procedure as the main manifestation is day by day obvious, therefore, promoting the scientific and technological level of China's textile industry and fundamentally shortening the gap with the international advanced level is not only the need to adapt to the international economic development and international competition situation, but also the intrinsic request of promoting the ability to cross the trade barrier.
Learning Network Services for Professional Development, 1st edition
Authors: Rob Koper
Venue:  (2009)

A "Learning Network" is a community of people who help each other to better understand and handle certain events and concepts in work or life. As a result and sometimes also as an aim participating in learning networks stimulates personal development, a better understanding of concepts and events, career development, and employability. "Learning Network Services" are Web services that are designed to facilitate the creation of distributed Learning Networks and to support the participants with various functions for knowledge exchange, social interaction, assessment and competence development in an effective way. The book presents state-of-the-art insights into the field of Learning Networks and Web-based services which can facilitate all kinds of processes within these networks. The main emphasis of the contributions is to explain what services a Learning Network requires and what the reader should do to design and run Learning Network Services, including guidelines on how to evaluate the effectiveness of these services. This book is a rich source of information for practitioners and professional developers who want to stimulate learning by professionals through web-based social interaction. Managers of educational institutions and training companies will find many ideas about possible services to offer. At the same time, it is an excellent introduction for other researchers in the field, and for students interested in the learning sciences or technology-enhanced learning.
A new strategy-proof greedy-allocation combinatorial auction protocol and its extension to open ascending auction protocol
Authors: Takayuki Ito, Makoto Yokoo, Atsushi Iwasaki, Shigeo Matsubara
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

This paper proposes a new combinatorial auction protocol called Average-Max-Minimal-Bundle (AM-MB) protocol. The characteristics of the AM-MB protocol are as follows: (i) it is strategyproof, i.e., truth-telling is a dominant strategy, (ii) the computational overhead is very low, since it allocates bundles greedily thereby avoiding an explicit combinatorial optimization problem, and (iii) it can obtain higher social surplus and revenue than can the Max-Minimal-Bundle (M-MB) protocol, which also satisfies (i) and (ii). Furthermore, this paper extends the AM-MB protocol to an open ascending-price protocol in which straightforward bidding is an ex-post Nash equilibrium.
Volume and Entropy of Regular Timed Languages: Discretization Approach
Authors: Eugene Asarin, Aldric Degorre
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

For timed languages, we define size measures: volume for languages with words having a fixed finite number of events, and entropy (growth rate) as asymptotic measure for an unbounded number of events. These measures can be used for quantitative comparison of languages, and the entropy can be viewed as the information contents of a timed language. For languages accepted by deterministic timed automata, we give exact formulas for volumes. Next, for a large class of timed languages accepted by non-Zeno timed automata, we devise a method to approximate the volumes and the entropy based on discretization. We give an information-theoretic interpretation of the entropy in terms of Kolmogorov complexity.
Dynamics and synchronization of numerical solutions of the Burgers equation
Authors: Mário Basto, Viriato Semiao, Francisco Calheiros
Venue: Journal of Computational and Applied Mathematics (2009)

For Chebyshev spectral solutions of the forced Burgers equation with low values of the viscosity coefficient, several bifurcations and stable attractors can be observed. Periodic orbits, quasiperiodic and strange ones may arise. Bistability can also be observed. Necessary conditions for these attractors to appear are discussed and justification for the non emerging of bistability for an example of a system symmetry break is presented. As an application for the dynamical behavior of spectral solutions of Burgers equation, the dynamics and synchronization of unidirectionally coupling of Chebyshev spectral solutions of Burgers equations by means of a linear coupling are described and discussed. Also, a nonlinear coupling is proposed and discussed.
Two Step Time Discretization of Willmore Flow
Authors: N. Olischläger, M. Rumpf
Venue: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII (2009)

Based on a natural approach for the time discretization of gradient flows a new time discretization for discrete Willmore flow of polygonal curves and triangulated surfaces is proposed. The approach is variational and takes into account an approximation of the L 2-distance between the surface at the current time step and the unknown surface at the new time step as well as a fully implicity approximation of the Willmore functional at the new time step. To evaluate the Willmore energy on the unknown surface of the next time step, we first ask for the solution of a inner, secondary variational problem describing a time step of mean curvature motion. The time discrete velocity deduced from the solution of the latter problem is regarded as an approximation of the mean curvature vector and enters the approximation of the actual Willmore functional. To solve the resulting nested variational problem in each time step numerically relaxation theory from PDE constraint optimization are taken into account. The approach is applied to polygonal curves and triangular surfaces and is independent of the co-dimension. Various numerical examples underline the stability of the new scheme, which enables time steps of the order of the spatial grid size.
Semantically rich human-aided machine annotation
Authors: Marjorie McShane, Sergei Nirenburg, Stephen Beale, Thomas O'Hara
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

This paper describes a semantically rich, human-aided machine annotation system created within the Ontological Semantics (OntoSem) environment using the DEKADE toolset. In contrast to mainstream annotation efforts, this method of annotation provides more information at a lower cost and, for the most part, shifts the maintenance of consistency to the system itself. In addition, each tagging effort not only produces knowledge resources for that corpus, but also leads to improvements in the knowledge environment that will better support subsequent tagging efforts.
Reconceptualizing and expanding the positive feedback network effects model: A case study
Authors: Scott Gallagher, Joel West
Venue: Journal of Engineering and Technology Management (2009)

During the 1980s, economists developed the concept of positive network effects and switching costs as the key dynamics of de facto standards competition. They concluded that a positive feedback loop usually ''tips'' a market to the standard with the most users and complementary assets. While recent scholars have acknowledged that not all markets tip, and suggested some possible limitations on this phenomena, these limitations have not been integrated systematically into a model for competition in these industries. Using examples drawn from the standards contests of the past 20 years, this case study develops an integrated model for competition in these industries.
Flexible Natural Language Generation in Multiple Contexts
Authors: Caroline Cullen, Ian O'Neill, Philip Hanna
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

We present a practical approach to Natural Language Generation (NLG) for spoken dialogue systems. The approach is based on small template fragments (mini-templates). The system's object architecture facilitates generation of phrases across pre-defined business domains and registers, as well as into different languages. The architecture simplifies NLG in well-understood application contexts, while providing the flexibility for a developer and for the system, to vary linguistic output according to dialogue context, including any intended affective impact. Mini-templates are used with a suite of domain term objects, resulting in an NLG system (MINTGEN --- MINi-Template GENerator) whose extensibility and ease of maintenance is enhanced by the sparsity of information devoted to individual domains. The system also avoids the need for specialist linguistic competence on the part of the system maintainer.
What Next for ASP? (A Not-Entirely-Well-Informed Opinion)
Authors: James Delgrande
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

The inception of Answer Set Programming (ASP) can be marked by the appearance of the stable model semantics [GL88], something over 20 years ago. The roots of ASP in turn can be traced to work in nonmonotonic reasoning, notably Default Logic [Rei80]. With the advent of efficient ASP solvers, as exemplified by smodels [NS97] and dlv [ELM+97], there was a great deal of interest and excitement over the application of ASP (broadly taken) to various problems, along with its use as a modelling tool. Indeed, applications have been proposed in a wide variety of fields, including bioinformatics, configuration, database integration, diagnosis, hardware design, insurance industry applications, model checking, phylogenesis, planning, security protocols, and high-level control of the US space shuttle [Sch08]. In concert with these applications, there has been a widespread flowering of ASP solvers built on various technologies [DVB+09].
A Platform for Identifying MicroRNA Targeting Genes
Authors: Chia-Wei Weng, Chang-Chih Chiang, Chien-Hung Huang, Ka-Lok Ng
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

We investigate the possibility that microRNA could act as an oncogene or tumor suppressor gene. Experimentally verified microRNA targeted genes information are integrated with microRNA and mRNA expression data to study this hypothesis, in which the Pearson correlation coefficient is used to quantify these relations. Cancer related microRNA and genes information are retrieved by literature search. Two microRNA targets prediction tools, miRanda and RNAHybrid, are used to obtained the binding minimum free energy and 3’UTR binding position for the target. A web based interface is set up for data display, which can be accessed at http://ppi.bioinfo.asia.edu.tw/mirna_target.
Modeling sentence processing in ACT-R
Authors: Shravan Vasishth, Richard L. Lewis
Venue: Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (2004)

We present a series of simulations of behavioral data by casting a simple parsing model in the cognitive architecture ACT-R. We show that constraints defined in ACT-R, specifically those relating to activation, can account for a range of facts about human sentence processing. In doing so, we argue that resource limitation in working memory is better defined as an artefact of very general and independently motivated principles of cognitive processing.
ImproV: A System for Improvisational Construction of Video Processing Flow
Authors: Atsutomo Kobayashi, Buntarou Shizuki, Jiro Tanaka
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

ImproV is a video compositing system for live video. It uses a dataflow diagram to represent the video processing flow and allows performers to edit the diagrams even while the video is running. Traditional live video is limited to video editing, but ImproV allows users to construct video processing flows on the fly. We present the design of ImproV and report on some actual live video performances using ImproV as preliminary evaluation in this paper.
An Asynchronous Distributed Component Model and Its Semantics
Authors: Ludovic Henrio, Florian Kammüller, Marcela Rivera
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

This paper is placed in the context of large scale distributed programming, providing a programming model based on asynchronous components. It focuses on the semantics of asynchronous invocations and component synchronisation. Our model is precise enough to enable the specification of a formal semantics. A variant of this model has been implemented, together with tools for managing components.This paper explains why we consider that our component model is efficient and provides a convenient programming model. We show how futures play a major role for such asynchronous components, and provide a reduction semantics for the component model. This reduction semantics has been specified in the Isabelle theorem prover, and will be used to prove properties on the component model and its implementations.
A multimodal semantic location service for intelligent environments: an application for Smart Hospitals
Authors: Antonio Coronato, Massimo Esposito, Giuseppe Pietro
Venue: Personal and Ubiquitous Computing (2009)

This paper presents semantic models, mechanisms and a service to locate mobile entities in Smart and Intelligent Environments. The key feature of the service is the semantic integration of different positioning systems that not only enables the environment to handle transparently such physical positioning systems, but also to reason on location information coming from different systems and to combine it to obtain higher context information. Indeed, the service relies on the use of ontologies and rules to define a uniform, unambiguous and well-defined model for the location information, independently of the particular positioning system. Moreover, the location service performs logic and reasoning mechanisms to provide both physical and semantic locations of mobile objects and to infer the finest granularity in the case when a mobile object is located by more than one positioning system. Finally, we present an application of the proposed approach to the case of a Smart Hospital.
An Implementation Strategy of Global OLTP Based on ODS in Heterogeneous Environment
Authors: Zhang Yue, Liu Jie, Song Bo
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Many years of information progress makes organization or institute has different kinds of OLTP systems which are running under heterogeneous environment. And these OLTP systems accumulate lots of historical data. In order to provide effective global information for decision makers, global OLTP plays a crucial role. But, traditional method demands spending expensive to integrate the data in distributed databases, or making special programs to implement global OLTP. It is complex and reusability lower. So, an implementation strategy of global OLTP based on ODS system in heterogeneous environment is proposed in this paper. The principle of Logging, XML technology and trigger of DBMS are applied in it. And it ensures the consistence of global data effectively. This strategy has been applied in practice and perfect purpose has been obtained.
Automating Gene Expression Annotation for Mouse Embryo
Authors: Liangxiu Han, Jano Hemert, Richard Baldock, Malcolm Atkinson
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

It is of high biomedical interest to identify gene interactions and networks that are associated with developmental and physiological functions in the mouse embryo. There are now large datasets with both spatial and ontological annotation of the spatio-temporal patterns of gene-expression that provide a powerful resource to discover potential mechanisms of embryo organisation. Ontological annotation of gene expression consists of labelling images with terms from the anatomy ontology for mouse development. Current annotation is made manually by domain experts. It is both time consuming and costly. In this paper, we present a new data mining framework to automatically annotate gene expression patterns in images with anatomic terms. This framework integrates the images stored in file systems with ontology terms stored in databases, and combines pattern recognition with image processing techniques to identify the anatomical components that exhibit gene expression patterns in images. The experimental result shows the framework works well.
UJM at INEX 2008 XML Mining Track
Authors: Mathias Géry, Christine Largeron, Christophe Moulin
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

This paper reports our experiments carried out for the INEX XML Mining track, consisting in developing categorization (or classification) and clustering methods for XML documents. We represent XML documents as vectors of indexed terms. For our first participation, the purpose of our experiments is twofold: Firstly, our overall aim is to set up a categorization text only approach that can be used as a baseline for further work which will take into account the structure of the XML documents. Secondly, our goal is to define two criteria (CC and CCE) based on terms distribution for reducing the size of the index. Results of our baseline are good and using our two criteria, we improve these results while we slightly reduce the index term. The results are slightly worse when we sharply reduce the size of the index of terms.
Learning Correspondence View with Support Vector Machine
Authors: Xiangru Li, Xiaoming Li, Huarong Xu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Correspondence view (CV) is recently introduced for rejecting outliers in computer vision. The fundamental idea of CV is that, for given two images of a scene, the corresponding points constitute a manifold in joint-image space , and outliers can be detected by checking whether they are consistent with the upward views of the manifold. This work studies CV learning and outliers rejecting by Support Vector Machine. Experiments on real image pairs demonstrate the excellent performance of our proposed SVM+CV learning method and its superiority over the available robust methods in literature, especially the widely used RANSAC.
Entropy-based Criteria Dealing with the Ties Problem in Gene Selection
Authors: Feng Yang, K. Z. Mao
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Gene selection is one of the major issues in microarray gene expression data analysis. Among existing gene selection techniques, wrapper methods usually produce better selection results than filter methods and embedded methods. The wrapper methods employ a predefined classification algorithm and evaluate the goodness of gene subsets in terms of classification error, which is usually obtained through error counting. Due to the high dimensionality and small sample size of gene expression data, counting-based evaluation criteria could result in severe ties problem which induces selection uncertainty and poor robustness. In this study, we will demonstrate the existence of the ties problem by well designed experiments. In addition, two continuous evaluation criteria based on Renyi’s entropy and support vector machines (SVMs) were proposed. Experiment results show that the proposed SVM-Renyi’s entropy criteria could well overcome the ties problem and provide gene subsets leading to improved classification accuracy
Research on Multi-peak Value AIA and Its Practical Example
Authors: Huang Hu, Zhang Lan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper proposes a modified Multi-peak Value AIA based on nonlinear combination forecasting model. This algorithm has the ability of comprehensive search and the rapid convergence, and with the ability it solves quite well the contradictions between the ultimate convergence and the process dispersivity of the traditional algorithm, making the algorithm can converge on a number of peaks quickly and efficiently. Through comparing this algorithm with other commonly used models in forecasting quantity of construction land demand in Chengdu city, the conclusion can be obtained that the modified Multi-peak value AIA based on combination forecast has a good feasibility and validity.