ppxscal/embedding_network huggingface dataset:
Research on Enterprises's Management Innovation on Basis of the Informationization
Authors: Mo Qi, Tong Jinping, Liu Jiangang, Yang Chun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

With the development of information technology, already existing management thought, mode and method do not meet the needs of new era. Sothe climax improved of managing has been raised and these changes have certain contacts with informationization. Then we needs to study the information-based impact on management innovation of enterprises and make enterprises informatization play the function of "promotes and improves" in management field. On the basis of explaining the basic conception of enterprise's informationization, management innovation and BPR, This text studied the function mechanism to the management innovation of enterprise's informationization regarding BPR as the breakthrough point, define the relation between the two and put forward the information tactics based on the management innovation.
Detecting Walking Gait Impairment with an Ear-worn Sensor
Authors: Louis Atallah, Omer Aziz, Benny Lo, Guang-Zhong Yang
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This paper investigates an ear worn sensor for the development of a gait analysis framework. Instead of explicitly defining gait features that indicate injury or impairment, an automatic method of feature extraction and selection is proposed. The proposed framework uses multi-resolution wavelet analysis and margin based feature selection. It was validated on three datasets; the first simulating a leg injury, the second simulating abdominal impairment that could result from surgery or injury and the third is a dataset collected from a patient during recovery from leg injury. The method shows a clear distinction of gait between injured and normal walking. It also illustrates the fact that using source separation before pattern classification can significantly improve the proposed gait analysis framework.
Multi-Agents System to Model Cell Signalling by Using Fuzzy Cognitive Maps. Application to Computer Simulation of Multiple Myeloma
Authors: Vincent Rodin, Gabriel Querrec, Pascal Ballet, François-Régis Bataille, Gireg Desmeulles, Jean-François Abgrall, Jacques Tisseau
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

In order to simulate biological processes, we use multi-agents system. However, modelling cell behavior in systems biology is complex and may be based on intracellular biochemical pathway. So, we have developed in this study a Fuzzy Influence Graph to model MAPK pathway. A Fuzzy Influence Graph is also called Fuzzy Cognitive Map.This model can be integrated in agents representing cells. Results indicate that despite individual variations, the average behavior of MAPK pathway in a cells group is close to results obtained by ordinary differential equations. So, we have also modelled multiple myeloma cells signalling by using this approach.
Deriving generalized knowledge from corpora using WordNet abstraction
Authors: Benjamin Van Durme, Phillip Michalak, Lenhart K. Schubert
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Existing work in the extraction of commonsense knowledge from text has been primarily restricted to factoids that serve as statements about what may possibly obtain in the world. We present an approach to deriving stronger, more general claims by abstracting over large sets of factoids. Our goal is to coalesce the observed nominals for a given predicate argument into a few predominant types, obtained as WordNet synsets. The results can be construed as generically quantified sentences restricting the semantic type of an argument position of a predicate.
Collaborative Feature-Combination Recommender Exploiting Explicit and Implicit User Feedback
Authors: Markus Zanker, Markus Jessenitschnig
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Collaborative filtering (CF) is currently the most popular technique used in commercial recommender systems. Algorithms of this type derive personalized product propositions for customers by exploitingstatistics derived from vast amounts of transaction data.Traditionally, basic CF algorithms have exploited a single category of ratings despite the fact that on many platforms a variety of different forms of user feedback are available for personalization and recommendation. In this paper we explore a collaborative feature-combination algorithm that concurrently exploits multiple aspects of the user model like clickstream data, sales transactions and explicit user requirements to overcome some known shortcomingsof CF like the cold-start problem for new users. We validate our contribution by evaluating it against the standard user-to-user CF algorithm using a dataset from a commercial Web shop. Evaluation results indicate considerable improvements in terms of user coverageand accuracy.
FEA on Frictional Contact Problem of Assembly Structure of the Impeller
Authors: Xiaomei You, Bangchun Wen, Lei Meng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Complete contact is often used in assembling wheelhub and shaft which are used in closed impeller assembly ofthe large turbine compressor. The interference is usually fixed.Because the contact area between wheel and axle is too much,bending shaft is occurred sometimes in assembling andcompletion of assembling. In order to research the mechanismof bending shaft, based on the nonlinear contact theory andused FEM, the impeller assembly is studied from the end ofassembling to steady state in the topic, then the size anddistribution of stress of the contact area is gotten. Thenaccording to analytical results, the structural optimization onthe assembly can be done and the incidence of shaft bendingcan be reduced further. The analytical method has a highpractical value and a strong applied promotion, and can laythe foundation for the research of mechanical properties ofother rotor assembly structure.
A Generic Design Flow for Application Specific Processor Customization through Instruction-Set Extensions (ISEs)
Authors: Kingshuk Karuri, Rainer Leupers, Gerd Ascheid, Heinrich Meyr
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Instruction-Set Extensions (ISEs) have gained prominence in the past few years as a useful method for tailoring the ISAs (Instruction-Set Architectures) of ASIPs (Application Specific Instruction-Set Processors) to the computational requirements of various embedded applications. This work presents a generic and easily adaptable flow for application oriented ISE design that supports both of the prevalent ASIP design paradigms - complete ISA design from scratch through an extensive design-space exploration, or limited ISA adaptation for a pre-designed and pre-verified base-processor core. The broad applicability of this design flow is demonstrated using ISA customization case studies for both of these two design philosophies.
Languages Recognized with Unbounded Error by Quantum Finite Automata
Authors: Abuzer Yakaryilmaz, A. C. Say
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even "1.5-way") movement, more languages become recognizable. This leads to the conclusion that quantum Turing machines are more powerful than probabilistic Turing machines when restricted to constant space bounds.
Models and heuristic algorithms for a weighted vertex coloring problem
Authors: Enrico Malaguti, Michele Monaci, Paolo Toth
Venue: Journal of Heuristics (2009)

We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which each vertex i of a graph G has associated a positive weight w i . Like in VCP, one is required to assign a color to each vertex in such a way that colors on adjacent vertices are different, and the objective is to minimize the sum of the costs of the colors used. While in VCP the cost of each color is equal to one, in the Weighted Vertex Coloring Problem (WVCP) the cost of each color depends on the weights of the vertices assigned to that color, and it equals the maximum of these weights. WVCP is known to be NP-hard and arises in practical scheduling applications, where it is also known as Scheduling on a Batch Machine with Job Compatibilities. We propose three alternative Integer Linear Programming (ILP) formulations for WVCP: one is used to derive, dropping integrality requirement for the variables, a tight lower bound on the solution value, while a second one is used to derive a 2-phase heuristic algorithm, also embedding fast refinement procedures aimed at improving the quality of the solutions found. Computational results on a large set of instances from the literature are reported.
The Method of Vehicle Ontology Building Based on Decision Tree
Authors: Bingxian Ma, Aixia Wang, Shouning Qu
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

There are a variety of methods about domain ontology building, one of which is namely skeleton law, it provides a full process of ontology building and methodology frame, it is the most reference in all methods. This paper introduces firstly skeleton law, and then points out its advantages and disadvantages. The purpose of this paper achieves a specific way to build domain ontology. The method in this paper makes use of correlative technology of Data Warehouse and Data Mining, which is mainly technology of Decision Tree. The method which is used to build ontology provides with good virtues as follow: the steps are simple and cleared, it produces a good classification, it can produce a good predictability and make if easy to carry out documentation.
Multi-angle view on preference elicitation for negotiation support systems
Authors: Alina Pommeranz, Joost Broekens, Wietske Visser, Willem-Paul Brinkman, Pascal Wiggers, Catholijn M. Jonker
Venue: Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation (2008)

Motivation -- Elicitation of preferences is crucial in negotiation support. This is a non-trivial task which could be supported by computers. Research approach -- Experiment in which 32 participants have to order holidays using different preference elicitation techniques including a navigational task and affective scoring. The results were used as input for a lexicographic ordering algorithm. Findings/design -- Traditional property rating approach seems most preferred by the participants and resulted in one of the best orderings of the outcomes space to match their preferences, at least when using the lexicographic algorithm. Originality/value -- The elicitation process is approached from an algorithmic perspective as well as from a user-centred perspective for both navigation and affective attitude. Take away message -- A multi-angle approach gives a richer understanding of the process of preference elicitation.
Recording the control flow of parallel applications to determine iterative and phase-based behavior
Authors: Karl Fürlinger, Shirley Moore
Venue: Future Generation Computer Systems (2010)

Many applications exhibit iterative and phase-based behavior. We present an approach to detect and analyze iteration phases in applications by recording the execution control flow graph of the application and analyzing it for loops that represent iterations. Phases are then manually marked and performance profiles are captured in alignment with the iterations. By analyzing how profiles change between capture points the differences in execution behavior between iterations can be highlighted.
The Trust Management Model of Trusted Software
Authors: Wu Jin, Liao Yongjian, Nie Xuyun, Liu Mengjuan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The interconnection of software engineering and security engineering has been bringing research challenges and opportunities to us. We propose a layered framework for the trust management model of trusted software, including three layers: the application behavior layer, the trust check engineer layer, and the trust policy layer. The multi-layer approach attempts to organize a complex security design into simpler layers that can be evaluated against security requirements. Each layer has its own form of state information and thus each may be modeled.
Abstract parsing for two-staged languages with concatenation
Authors: Soonho Kong, Wontae Choi, Kwangkeun Yi
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

This article, based on Doh, Kim, and Schmidt's "abstract parsing" technique, presents an abstract interpretation for statically checking the syntax of generated code in two-staged programs. Abstract parsing is a static analysis technique for checking the syntax of generated strings. We adopt this technique for two-staged programming languages and formulate it in the abstract interpretation framework. We parameterize our analysis with the abstract domain so that one can choose the abstract domain as long as it satisfies the condition we provide. We also present an instance of the abstract domain, namely an abstract parse stack and its widening with k-cutting.
A model of local coherence effects in human sentence processing as consequences of updates from bottom-up prior to posterior beliefs
Authors: Klinton Bicknell, Roger Levy
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Human sentence processing involves integrating probabilistic knowledge from a variety of sources in order to incrementally determine the hierarchical structure for the serial input stream. While a large number of sentence processing effects have been explained in terms of comprehenders' rational use of probabilistic information, effects of local coherences have not. We present here a new model of local coherences, viewing them as resulting from a belief-update process, and show that the relevant probabilities in our model are calculable from a probabilistic Earley parser. Finally, we demonstrate empirically that an implemented version of the model makes the correct predictions for the materials from the original experiment demonstrating local coherence effects.
A comparison of clausal coordinate ellipsis in Estonian and German: remarkably similar elision rules allow a language-independent ellipsis-generation module
Authors: Karin Harbusch, Mare Koit, Haldur Õim
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session (2009)

We compare the phenomena of clausal coordinate ellipsis in Estonian, a Finno-Ugric language, and German, an Indo-European language. The rules underlying these phenomena appear to be remarkably similar. Thus, the software module Elleipo, which was originally developed to generate clausal coordinate ellipsis in German and Dutch, works for Estonian as well. In order to extend Elleipo's coverage to Estonian, we only had to adapt the lexicon and some syntax rules unrelated to coordination. We describe the language-independent rules for coordinate ellipsis that Elleipo applies to non-elliptical syntactic structures in both target languages.
A Privacy-Preserving Platform for User-Centric Quantitative Benchmarking
Authors: Dominik Herrmann, Florian Scheuer, Philipp Feustel, Thomas Nowey, Hannes Federrath
Venue: Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business (2009)

We propose a centralised platform for quantitative benchmarking of key performance indicators (KPI) among mutually distrustful organisations. Our platform offers users the opportunity to request an ad-hoc benchmarking for a specific KPI within a peer group of their choice. Architecture and protocol are designed to provide anonymity to its users and to hide the sensitive KPI values from other clients and the central server. To this end, we integrate user-centric peer group formation, exchangeable secure multi-party computation protocols, short-lived ephemeral key pairs as pseudonyms, and attribute certificates. We show by empirical evaluation of a prototype that the performance is acceptable for reasonably sized peer groups.
Design and Evaluation of a Text-to-Speech System for Azerbaijani Turkish Language and Database Generation
Authors: Mir Saeed Damadi, Bahram Zahir Azami
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

This paper addresses the design of a text-to-speech system for Azerbaijani Turkish language and also explains the database preparation for the system. Various speech synthesis methods are explained and some important linguistic features of Azerbaijani Turkish language are investigated. According to this features among the variety of synthesis methods, corpus based concatenative speech synthesis is selected for this language. A database is generated for the system, subsequent to the selected synthesis method. The basic units of this database are diphones. For synthesized speech generation according to input text, appropriate units are selected from database and concatenated together. As far as we know, the output speech that is produced with this system is the first Azerbaijani Turkish synthetic speech ever created.
Coloured Petri Nets: Modelling and Validation of Concurrent Systems, 1st edition
Authors: Kurt Jensen, Lars M. Kristensen
Venue:  (2009)

Coloured Petri Nets (CPN) is a graphical language for modelling and validating concurrent and distributed systems, and other systems in which concurrency plays a major role. The development of such systems is particularly challenging because of inherent intricacies like possible nondeterminism and the immense number of possible execution sequences. In this textbook Jensen and Kristensen introduce the constructs of the CPN modelling language and present the related analysis methods in detail. They also provide a comprehensive road map for the practical use of CPN by showcasing selected industrial case studies that illustrate the practical use of CPN modelling and validation for design, specification, simulation, verification and implementation in various application domains. Their presentation primarily aims at readers interested in the practical use of CPN. Thus all concepts and constructs are first informally introduced through examples and then followed by formal definitions (which may be skipped). The book is ideally suitable for a one-semester course at an advanced undergraduate or graduate level, and through its strong application examples can also serve for self-study. An accompanying website offers additional material such as slides, exercises and project proposals. Book website:http://www.cs.au.dk/CPnets/cpnbook/
Communicability for Virtual Learning: Evaluation
Authors: Francisco V. Cipolla-Ficarra, Miguel Cipolla-Ficarra, Pablo M. Vera
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

An assessment is made of the work of design from the perspective of communicability and usability in multimedia aimed at E-learning, mainly through the off-line interactive systems (commercials) and on-line (open software). The method used is accompanied by a series of heuristic results along time to stress the validity or not of some of the design components. Besides, a novel strategy of organizing the textual content is presented for teenagers and the young: the truncated inverted pyramid. Finally, those quality attributes are mentioned that are related to the dynamic and static means, at the moment of heuristically assessing the communicability of a hypermedia system which has as its main goal college education.
Example-based metonymy recognition for proper nouns
Authors: Yves Peirsman
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop (2006)

Metonymy recognition is generally approached with complex algorithms that rely heavily on the manual annotation of training and test data. This paper will relieve this complexity in two ways. First, it will show that the results of the current learning algorithms can be replicated by the 'lazy' algorithm of Memory-Based Learning. This approach simply stores all training instances to its memory and classifies a test instance by comparing it to all training examples. Second, this paper will argue that the number of labelled training examples that is currently used in the literature can be reduced drastically. This finding can help relieve the knowledge acquisition bottleneck in metonymy recognition, and allow the algorithms to be applied on a wider scale.
On Fixed Convex Combinations of No-Regret Learners
Authors: Jan-P. Calliess
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

No-regret algorithms for online convex optimization are potent online learning tools and have been demonstrated to be successful in a wide-ranging number of applications. Considering affine and external regret, we investigate what happens when a set of no-regret learners (voters) merge their respective decisions in each learning iteration to a single, common one in form of a convex combination. We show that an agent (or algorithm) that executes this merged decision in each iteration of the online learning process and each time feeds back a copy of its own reward function to the voters, incurs sublinear regret itself. As a by-product, we obtain a simple method that allows us to construct new no-regret algorithms out of known ones.
USP-EACH: improved frequency-based greedy attribute selection
Authors: Diego Jesus de Lucena, Ivandré Paraboni
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

We present a follow-up of our previous frequency-based greedy attribute selection strategy. The current version takes into account also the instructions given to the participants of TUNA trials regarding the use of location information, showing an overall improvement on string-edit distance values driven by the results on the Furniture domain.
Merging of Use Case Models: Semantic Foundations
Authors: Stephen Barrett, Daniel Sinnig, Patrice Chalin, Greg Butler
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Use case models are the artifact of choice for capturing functional requirements. This typically collaborative activity makes merging a necessity. Use cases however, are often neglected when it comes to model merging, since they are commonly treated as text only items. By defining a formal syntax and semantics for use case models, manipulated within a generic metamodel for operation-based merging, we show how use case models can be effectively merged. This formal foundation allows for the modeling of use cases; defining meaningful change operations on them; and for detecting modeling inconsistencies, inconformities, and conflicts. Several practical examples validate the concepts presented: existing and planned tool support is introduced.