ppxscal/embedding_network huggingface dataset:
A New Decision Tree Algorithm Based on Rough Set Theory
Authors: Baoshi Ding, Yongqing Zheng, Shaoyu Zang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Decision tree algorithm has been widely used to classify numeric and categorical attributes. Lots of approaches were suggested in order to induce decision trees. ID3 (Quinlan, 1986), as a heuristic algorithm, is very classic and popular in the induction of decision trees. The key of ID3 is to choose information gain as the standard for testing attributes. In this paper, we propose a novel measure based on rough set theory to select attributes that will best split current samples into individual classes. In the view of rough set theory, we analyze the shortcomings of ID3 algorithm and rationality of the new approach, and then propose a fixed algorithm based on original idea. The results of example and experiments show that our approach is better in selecting nodes for inducing decision trees than ID3.
Information Modelling and Simulation in Large Interdependent Critical Infrastructures in IRRIIS
Authors: Rüdiger Klein, Erich Rome, Césaire Beyel, Ralf Linnemann, Wolf Reinhardt, Andrij Usov
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

Critical Infrastructures (CIs) and their protection play a very important role in modern societies. Today's CIs are managed by sophisticated information systems. These information systems have special views on their respective CIs --- but can frequently not manage dependencies with other systems adequately. For dependency analysis and management we need information taking the dependency aspects explicitly into account --- in well defined relations to all other relevant kinds of information. This is the aim of the IRRIIS Information Model. It is a semantic model or ontology of CI dependencies.This Information Model allows us to integrate information from different CIs --- from real ones as in SCADA systems, or from simulations --- in order to manage their interdependencies.This paper gives an overview of the IRRIIS Information Model and the way it is used in the IRRIIS simulator SimCIP for the analysis of interdependent infrastructures. An example will be given to illustrate our approach.
Empirical Study on Electric Power Customer Satisfaction Based on Kano Model
Authors: Shuai Lin, Dongxiao Niu
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Kano customer satisfaction model is used to positively explore the customer satisfaction system of service. In this essay,Kano model is applied to a Tonghua (Jilin, China) electric power company. According to Kano model, the quality characteristics of electric power customer service are classified as 20 items. On the basis of investigative results, it is reported that the improvement countermeasure of electric power service, the direction of the customer satisfaction management of enterprise implementation and the improvement of service quality are put forward, and that more customer satisfaction is gained for the electric power company.
Network Analysis for Core Herbal Combination Knowledge Discovery from Clinical Chinese Medical Formulae
Authors: Xuezhong Zhou, Runsun Zhang, Yinghui Wang, Ping Li, Baoyan Liu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Chinese medical formula (CMF) is the main therapies in traditional Chinese medicine (TCM) clinical practices. Discovery of the CMF empirical knowledge of the famous TCM physicians in clincal data is significant. This paper proposes an effective data mining approach to analyze and uncover the clinical CMF empirical knowledge of famous TCM physicians. Complex network is a current hot research topic in complex systems field. We construct the combination network of CMFs by graph method and have a statistical analysis of the network based on large-size CMF data set. As we known, CMF has a number of constituent herbs, which are prescribed by TCM physicians. We consider any CMF with same element herb has correlation to each other. That is, we construct a connected sub-graph with the CMF as node and the edge weight is computed by an appropriate similarity method. With CMF dataset, we can build CMF network with dense connected edges. We implement an algorithm based on the 'hub' node features of the CMF relation network to extract the core CMFs in a large size CMFs. Thereafter, the maximum frequent itemset algorithm is applied to discover the core herbal combinations from the core CMFs. We have utilized the network-based method to discover several core CMFs from the outpatient data of the famous TCM physicians. The clinical CMFs for disharmony between the liver and spleen syndrome are analyzed. The preliminary results show that we propose an effective approach for core herbal combination knowledge discovery in large size CMF data sets.
An Improved Entropy-Based Ant Clustering Algorithm
Authors: Zhao Weili
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Sorting and clustering methods inspired by the behavior of real ants are among the earliest methods in ant-based meta-heuristics. We revisit these methods in the context of a concrete application and introduce some modifications that yield significant improvements in terms of both quality and efficiency. In this paper, we propose an Improved Entropy-based Ant Clustering (IEAC) algorithm. Firstly, we apply information entropy to model behaviors of agents, such as picking up and dropping objects. The entropy function led to better quality clusters than non-entropy functions. Secondly, we introduce a number of modifications that improve the quality of the clustering solutions generated by the algorithm. We have made some experiments on real data sets and synthetic data sets. The results demonstrate that our algorithm has superiority in misclassification error rate and runtime over the classical algorithm.
House of Worship Sound Reinforcement, 1st edition
Authors: Jamie Rio, Chris Buono
Venue:  (2009)

House of Worship Sound Reinforcement provides everything you need to know to become a sound technician in a house of worship and beyond. Starting with the basic foundations of sound, youll progress into learning how the sound in your house of worship is captured with microphones and transduced into electricity. From there, you will explore the wonders of the mixing console, where all the audio youre capturing is sent, processed, and mixed together. Next up will be a thorough examination of how sound is projected not only to the congregation but also back at the worship team through the speaker system. After delving into the world of digital processors, you will learn how to create an optimal environment for projecting sound in your worship space, which includes properly setting up your system. Finally, you will discover what it takes to maintain your system as well as how to readjust and/or create a new system for outreach events. Although the concepts in this book are complex, they are conveyed in non-technical language, so even if you have no experience with sound reinforcement, the books contents are easy to follow and put into practice. The authors focus on real-world situations and setups and avoid discussions of physics and math, which can be confusing and intimidating. Whether you are just beginning your journey into live sound, youve been mixing at your own house of worship for a period of time, or you have years of experience already logged in, you will surely find useful information, tricks of the trade, and sound advice in this book that will serve you for years to come.
What are meeting summaries?: an analysis of human extractive summaries in meeting corpus
Authors: Fei Liu, Yang Liu
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

Significant research efforts have been devoted to speech summarization, including automatic approaches and evaluation metrics. However, a fundamental problem about what summaries are for the speech data and whether humans agree with each other remains unclear. This paper performs an analysis of human annotated extractive summaries using the ICSI meeting corpus with an aim to examine their consistency and the factors impacting human agreement. In addition to using Kappa statistics and ROUGE scores, we also proposed a sentence distance score and divergence distance as a quantitative measure. This study is expected to help better define the speech summarization problem.
Disambiguation of Fingerprint Ridge Flow Direction--Two Approaches
Authors: Robert O. Hastings
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

One of the challenges to be overcome in automated fingerprint matching is the construction of a ridge pattern representation that encodes all the relevant information while discarding unwanted detail. Research published recently has shown how this might be achieved by representing the ridges and valleys as a periodic wave. However, deriving such a representation requires assigning a consistent unambiguous direction field to the ridge flow, a task complicated by the presence of singular points in the flow pattern. This disambiguation problem appears to have received very little attention.We discuss two approaches to this problem -- one involving construction of branch cuts, the other using a divide-and-conquer approach, and show how either of these techniques can be used to obtain a consistent flow direction map, which then enables the construction of a phase based representation of the ridge pattern. 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
Secure peer-to-peer 3D streaming
Authors: Mo-Che Chan, Shun-Yun Hu, Jehn-Ruey Jiang
Venue: Multimedia Tools and Applications (2009)

In recent years, interactive virtual environments such as Second Life, and virtual globe applications such as Google Earth, have become very popular. However, delivering massive amounts of interactive content to millions of potential users brings enormous challenges to content providers. Distributed peer-to-peer (P2P) approaches have thus been proposed to increase the system scalability in affordable ways. Building content delivery systems based on P2P approaches nevertheless creates security concerns for commercial vendors. This paper presents a generic system model for subscription-based service providers to adopt P2P-based, non-linear streaming for interactive content. We also propose solutions to the issue of content authentication, such that paying customers can be sure of the authenticity of the content retrieved from other users. Other practical security issues in an extended system model are also identified to allow further investigations in this problem space.
Defining syntax-directed translations by tree bimorphisms
Authors: Magnus Steinby, Ctlin Ionu Tîrnuc
Venue: Theoretical Computer Science (2009)

We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these ''quasi-alphabetic'' tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.
Mining Lung Shape from X-Ray Images
Authors: Vassili Kovalev, Aliaksandr Prus, Pavel Vankevich
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

This paper presents an approach for mining 2D shape of human lungs from large x-ray image archives of a national level. Images were accumulated in framework of a compulsory computerized country-wide screening programme launched few years ago which is being under development. Three study groups of images containing about 21, 18 and 39 thousand of subjects were created by sub-sampling from a test database resulted from pulmonary x-ray examinations of a total of 188 thousands people. These groups have been well balanced by age and gender according to the existing biomedical standards and subsequently used as input data for searching different kinds of regularities in 2D projective lung shape and size. The approach followed in the paper combines different methods including procrustes shape analysis, Bookstein's baseline shape registration, multi-dimensional scaling, regression models with broken-line relationships as well as various conventional statistical procedures. As a result, interesting gender- and age-related regularities in lung shape were discovered and documented in the paper.
Self-healing and Resilient Critical Infrastructures
Authors: Rune Gustavsson, Björn Ståhl
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

The paper describes methods and tools addressing self-healing and resilience of critical infrastructures, specifically power and information networks. Our case study is based on challenges addressed in the ongoing EU project INTEGRAL aiming at integrating DES/RES in cell-based virtual utilities. We propose two experimental environments, EXP II and INSPECT to support a structured approach in identifying, implementing and monitoring suitable self-healing mechanisms entailing an increasing system resilience in our systems. Our approach is based on own results from earlier EU projects and selected approaches from other international projects such as NSF GENI in the US and EU efforts such as SmartGrids and ARECI.
Optimal reduction of rule length in linear context-free rewriting systems
Authors: Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David Weir
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Linear Context-free Rewriting Systems (LCFRS) is an expressive grammar formalism with applications in syntax-based machine translation. The parsing complexity of an LCFRS is exponential in both the rank of a production, defined as the number of nonterminals on its right-hand side, and a measure for the discontinuity of a phrase, called fan-out. In this paper, we present an algorithm that transforms an LCFRS into a strongly equivalent form in which all productions have rank at most 2, and has minimal fan-out. Our results generalize previous work on Synchronous Context-Free Grammar, and are particularly relevant for machine translation from or to languages that require syntactic analyses with discontinuous constituents.
Minimizing the spread of contamination by blocking links in a network
Authors: Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dual problem to the influence maximization problem of finding the most influential nodes in a social network for information diffusion. This minimization problem is another approach to the problem of preventing the spread of contamination by removing nodes in a network. We propose a method for efficiently finding a good approximate solution to this problem based on a naturally greedy strategy. Using large real networks, we demonstrate experimentally that the proposed method significantly outperforms conventional link-removal methods. We also show that unlike the strategy of removing nodes, blocking links between nodes with high out-degrees is not necessarily effective.
NIT: A New Internet Topology Generator
Authors: Joylan Nunes Maciel, Cristina Duarte Murta
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

Internet topology generators play an essential role in computer network research. This paper presents a new Internet autonomous system level topology generator. Synthetic topologies generated by the proposed generator are compared to real Internet topologies and to synthetic topologies generated by a well-known topology generator. The results show that, for all the considered metrics, the proposed generator is able to produce more realistic topologies. This work aims to contribute to the generation of more realistic synthetic topologies.
Rainbow faces in edge-colored plane graphs
Authors: Stanislav Jendrol', Jozef Miškuf, Roman Soták, Erika Škrabul'áková
Venue: Journal of Graph Theory (2009)

A face of an edge-colored plane graph is called rainbow if the number of colors used on its edges is equal to its size. The maximum number of colors used in an edge coloring of a connected plane graph Gwith no rainbow face is called the edge-rainbowness of G. In this paper we prove that the edge-rainbowness of Gequals the maximum number of edges of a connected bridge face factor H of G, where a bridge face factor H of a plane graph Gis a spanning subgraph H of Gin which every face is incident with a bridge and the interior of any one face f&isin;F(G) is a subset of the interior of some face f&prime;&isin;F(H). We also show upper and lower bounds on the edge-rainbowness of graphs based on edge connectivity, girth of the dual graphs, and other basic graph invariants. Moreover, we present infinite classes of graphs where these equalities are attained. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 62: 84&ndash;99, 2009
Proceedings of the 11th international conference on Ubiquitous computing
Venue: ACM International Conference Proceeding Series (2009)

It is my great pleasure to welcome you to the 11th International Conference on Ubiquitous Computing. We come together this year in Orlando, Florida to continue the tradition of being the premier forum for multi-disciplinary research in Ubiquitous Computing and its applications. In Disney World, Ubicomp2009 celebrates 11 years of novel research findings and an impressive audience base carefully cross-pollinated from several key communities. This includes Human Computer Interaction, Pervasive Computing, Mobile Computing, Real World Modeling, Sensors and Devices, Middleware and Systems Research, Programming Models and Tools, Human Centric Validation and Experience Characterization. Like every year, we have a strong program full of novel ideas and impressive applications. The main event is a single-track technical program offering a variety of sessions covering topics such as activity recognition, behavior monitoring and alteration, context awareness, security and access, and much more. A compelling program of Videos/Demos/Posters is also included in the first day of the conference. A Doctoral Colloquium and 6 Workshops on emerging areas of research make up UbiComp's two-days pre-conference program. Additionally, Henry Tirri (Nokia) will give the opening keynote titled ï¾Poor Man's Ubicompï¾, and Alex Pentland (MIT) will give the closing keynote titled ï¾Honest Signals from Reality Mining.ï¾ Finally, two panels are planned. One will attempt to tell the future, discuss major achievements to date and predict the future landscape of UbiComp research. The other will attempt to summarize accomplishments of UbiComp 2009. I hope you find this year's program interesting, useful and enjoyable. To assist you in managing your networking interest and interactions prior to, during and after the conference, UbiComp 2009 is providing each registrant with the pathable service. It is an on-line community and a social network to help UbiComp 2009 attendees meet and communicate with each other. The service will continue to exist for one full year and until UbiComp 2010 begins. We hope that you can make full use of this tool.
Flexible answer typing with discriminative preference ranking
Authors: Christopher Pinchak, Dekang Lin, Davood Rafiei
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

An important part of question answering is ensuring a candidate answer is plausible as a response. We present a flexible approach based on discriminative preference ranking to determine which of a set of candidate answers are appropriate. Discriminative methods provide superior performance while at the same time allow the flexibility of adding new and diverse features. Experimental results on a set of focused What ...? and Which ...? questions show that our learned preference ranking methods perform better than alternative solutions to the task of answer typing. A gain of almost 0.2 in MRR for both the first appropriate and first correct answers is observed along with an increase in precision over the entire range of recall.
Application of Grey Model in Forecasting the Port of Qinhuangdao's Throughput
Authors: Lili, Zhao Qiuhong
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The port plays an irreplaceable role both in the development of national economy and regional economy at present. Port throughput is an important basis for the construction of port. Grey forecast theory could reveal features of the development and changes in the throughput of the port. So it is an effective tool in research the port throughput .This article conducts the research to the throughput of Qinhuangdao port and the result of the research indicates that the short-term-forecast basing on grey theory has higher value in practice.
Study on Cultivation Modes of Compound Application Talents in Science and Engineering Universities
Authors: Yanming Qi, Kunpeng Zhang, Changlong Wang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

The soul and premise of cultivation modes of compound application talents are correct attitudes of education and engineering. This paper assumes that science and engineering universities should adapt to the needs of time and substitute “the attitudes of engineering education” for traditional “attitude of technology education”. The aim is to cultivate compound application talents with solid scientific theory and technology, management skills, spirits of humanity. By discussing curriculum system reform, strengthening practice, emphasizing the guidance to major-oriented educations and innovation, this paper tends to provide an applicable systematic talents-cultivating mode for ordinary colleges of science and engineering.
Segmentation of Text and Non-text in On-Line Handwritten Patient Record Based on Spatio-Temporal Analysis
Authors: Rattapoom Waranusast, Peter Haddawy, Matthew Dailey
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Note taking is a common way for physicians to collect information from their patients in medical inquiries and diagnoses. Many times, when describing the pathology in medical records, a physician also draws diagrams and/or anatomical sketches along with the free-text narratives. The ability to understand unstructured handwritten texts and drawings in patient record could lead to implementation of automated patient record systems with more natural interfaces than current highly structured systems. The first and crucial step in automated processing of free-hand medical records is to segment the record into handwritten text and drawings, so that appropriate recognizers can be applied to different regions. This paper presents novel algorithms that separate text from non-text strokes in an on-line handwritten patient record. The algorithm is based on analyses of spatio-temporal graphs extracted from an on-line patient record and support vector machine (SVM) classification. Experiments demonstrate that the proposed approach is effective and robust.