ppxscal/embedding_network huggingface dataset:
Fuzzy Neural Network Model and Its Application in Water Quality Evaluation
Authors: Changjun Zhu, Zhenchun Hao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In view of the defect of traditional water quality evaluation model, based on fuzzy neural network theory, a new model of fuzzy neural network (FNN) comprehensive evaluation is developed to evaluate surface water quality in Suzhou. Fuzzy neural network is a new type neural network consisting Radical Basis network and compete neural network, which is simple in structure, easy for training and wide used. FNN model is applied to evaluate water quality at representative sections in Suzhou surface area from the year 1999-2002. The results indicate that FNN model is suitable for water quality evaluation. By analysis, it is important to pay attention to bring into effective measures for pollution control.
Model Checking UML Activity Diagrams in FDR
Authors: Dong Xu, Huaikou Miao, Nduwimfura Philbert
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The Unified Modeling Language (UML) is the de-facto industrial standard for modeling object-oriented software systems. UML Activity diagrams (ADs) can be used for software modeling and they have under gone significant changes with UML 2.0 specification, and no longer been a special kind of diagrams of UML state machines. ADs, however, are lack of formal semantics like other diagrams in UML official specifications and therefore they cannot be performed formal system behavior analysis. Verify if a UML model meets the required properties by model checking has become a key issue. Many attempts have been made to provide formalization for UML State Diagrams, but little for ADs. This paper formalize the UML ADs and then employs the Hoare’s Communicating Sequential Processes to specify its operational and behavior semantics. The presented formalization makes it possible to reason about the behavior of a UML AD in CSP. A software tool for supporting to transfer an AD into CSPM specification has been implemented. Hence it provides an approach to model checking UML ADs by model-checker FDR. Finally, the formalisms and model checking are explicitly illustrated through a simple but non-trivial example.
Identifying the components
Authors: Matthijs Leeuwen, Jilles Vreeken, Arno Siebes
Venue: Data Mining and Knowledge Discovery (2009)

Most, if not all, databases are mixtures of samples from different distributions. Transactional data is no exception. For the prototypical example, supermarket basket analysis, one also expects a mixture of different buying patterns. Households of retired people buy different collections of items than households with young children. Models that take such underlying distributions into account are in general superior to those that do not. In this paper we introduce two MDL-based algorithms that follow orthogonal approaches to identify the components in a transaction database. The first follows a model-based approach, while the second is data-driven. Both are parameter-free: the number of components and the components themselves are chosen such that the combined complexity of data and models is minimised. Further, neither prior knowledge on the distributions nor a distance metric on the data is required. Experiments with both methods show that highly characteristic components are identified.
A PIN Entry Scheme Resistant to Recording-Based Shoulder-Surfing
Authors: Peipei Shi, Bo Zhu, Amr Youssef
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Two-factor authentication techniques using combination of magnetic cards and personal identification numbers (PINs) are widely used in many applications including automatic teller machines and point of sales. Similar to other valuable personal possessions, cards can be easily stolen by pickpockets. Furthermore, recent security reports show that magnetic cards can be easily duplicated using fake card readers and PINs can be obtained by shoulder surfing legitimate users' PIN entry processes. With this combination, criminals can easily break into users' accounts which represents a great threat. In this paper, we propose a newPIN entry scheme which is resistant against shoulder-surfing attacks conducted by shoulder-surfers with normal cognitive capabilities. Additionally, this scheme offersa relatively good level of security when the shoulder-surfer can record the entire login procedure for one or two times with a video device. Mathematical analysisof the proposed scheme is also presented.
Purely epistemic markov decision processes
Authors: Régis Sabbadin, Jérôme Lang, Nasolo Ravoanjanahary
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most widely developed model that deals with both sources of uncertainty is that of Partially Observable Markov Decision Processes (POMDPs). Simplifying POMDPs by getting rid of the second source of uncertainty leads to the well-known framework of fully observable MDPs. Getting rid of the first source of uncertainty leads to a less widely studied framework, namely, decision processes where actions cannot change the state of the world and are only intended to bring some information about the (static) state of the world. Such "purely epistemic" processes are very relevant, since many practical problems (such as diagnosis, database querying, or preference elicitation) fall into this class. However, it is not known whether this specific restriction of POMDP is computationally simpler than POMDPs. In this paper we establish several complexity results for purely epistemic MDPs (EMDPs). We first show that short-horizon policy existence in EMDPs is PSPACE-complete. Then we focus on the specific case of EMDPs with reliable observations and show that in this case, policy existence is "only" NP-complete; however, we show that this problem cannot be approximated with a bounded performance ratio by a polynomial-time algorithm.
An Optimum Intelligent Algorithm and its Application in Population Statistic and Forecast
Authors: Yi Wan, Lei Xiao, Chengwen Wu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Population statistic and forecast is important basis that government establishes correlative policy, population's all characteristic has strong non-linear speciality because of all kinds of effects. A cross validation optimized parameter least support vector machine method of population statistic and forecast is presented aiming at bad precision and lack of rationality of all approximate model at present. Complicated and strong nonlinear population characteristic relation is simulated by network design and conformation of the least square support vector machine learning algorithm and selecting the optimized support vector machine parameters by the method of grid searching and cross validation. The model is verified by taking population growth rate for example, cross validation optimized parameter least support vector machine algorithm has strong ability of nonlinear mapping and self-learning, it avoids availably phenomenon of partial minimum and overfitting, the future population problem can be accurately calculated and judged, it gains high precision by comparing numerical value of network output with fitting value and numerical real value. It provides a new artificial intelligent approach for population analysis.
Automated re-typesetting, indexing and contentenhancement for scanned marriage registers
Authors: David F. Brailsford
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

For much of England and Wales marriage registers began to be kept in 1537. The marriage details were recorded locally, and in longhand, until 1st July 1837, when central records began. All registers were kept in the local parish church. In the period from 1896 to 1922 an attempt was made, by the Phillimore company of London, using volunteer help, to transcribe marriage registers for as many English parishes as possible and to have them printed. This paper describes an experiment in the automated re-typesetting of Volume 2 of the 15-volume Phillimore series relating to the county of Derbyshire. The source material was plain text derived from running Optical Character Recognition (OCR) on a set of page scans taken from the original printed volume. The aim of the experiment was to avoid any idea of labour-intensive page-by-page rebuilding with tools such as Acrobat Capture. Instead, it proved possible to capitalise on the regular, tabular, structure of the Register pages as a means of automating the re-typesetting process, using UNIX troff software and its tbl preprocessor. A series of simple software tools helped to bring about the OCR-to-troff transformation. However, the re-typesetting of the text was not just an end in itself but, additionally, a step on the way to content enhancement and content repurposing. This included the indexing of the marriage entries and their potential transformation into XML and GEDCOM notations. The experiment has shown, for highly regular material, that the efforts of one programmer, with suitable low-level tools, can be far more effective than attempting to recreate the printed material using WYSIWYG software.
Grammar engineering for CCG using Ant and XSLT
Authors: Scott Martin, Rajakrishnan Rajkumar, Michael White
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

Corpus conversion and grammar extraction have traditionally been portrayed as tasks that are performed once and never again revisited (Burke et al., 2004). We report the successful implementation of an approach to these tasks that facilitates the improvement of grammar engineering as an evolving process. Taking the standard version of the CCGbank (Hockenmaier and Steedman, 2007) as input, our system then introduces greater depth of linguistic insight by augmenting it with attributes the original corpus lacks: Propbank roles and head lexicalization for case-marking prepositions (Boxwell and White, 2008), derivational re-structuring for punctuation analysis (White and Rajkumar, 2008), named entity annotation and lemmatization. Our implementation applies successive XSLT transforms controlled by Apache Ant (http://ant.apache.org/) to an XML translation of this corpus, finally producing an OpenCCG grammar (http://openccg.sourceforge.net/). This design is beneficial to grammar engineering both because of XSLT's unique suitability to performing arbitrary transformations of XML trees and the fine-grained control that Ant provides. The resulting system enables state-of-the-art BLEU scores for surface realization on section 23 of the CCGbank.
Checking Correctness and Compliance of Integrated Process Models
Authors: Rene Worzberger, Thomas Kurpick, Thomas Heer
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Models of different kinds are used in the area of business process management. Abstract process knowledge as well as executable process definitions can be visualized and edited in a graphical manner. The same holds true for models of process instances in some process-aware information systems (PAIS), which allow for dynamic modifications in a process instance during process runtime. An appropriate modeling tool must not only provide means to graphically edit different kinds of models on different abstraction layers but also detect or prevent violations of certain model constraints. These constraints comprise a model's internal correctness as well as a model's compliance with general process knowledge expressed in another more abstract model. In this paper we contribute an approach that allows for uniformly specifying correctness as well as compliance checks for diverse graphical process models. This is achieved by means of an integrated meta-model for models of different kinds. The integrated meta-model is referenced by a fixed set of Object Constraint Language (OCL) expressions, which specify correctness and compliance checks. We exemplify some OCL expressions and their application within a prototypical modeling tool.
Computational aspects of covering in dominance graphs
Authors: Felix Brandt, Felix Fischer
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Various problems in AI and multi agent systems can be tackled by finding the "most desirable" elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation--a transitive subrelation of the original relation. We consider three different types of covering (upward, downward, and bidirectional) and the corresponding solution concepts known as the uncovered set and the minimal covering set. We present the first polynomial-time algorithm for finding the minimal bidirectional covering set (an acknowledged open problem) and prove that deciding whether an alternative is in a minimal upward or downward covering set is NP-hard. Furthermore, we obtain various set-theoretical inclusions, which reveal a strong connection between von Neumann-Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other hand. In particular, we show that every stable set is also a minimal upward covering set.
Intermediating Effect of Knowledge Sharing between Virtual Community System Design and E-commerce Trust: An Empirical Study from China
Authors: Guilin Zhou
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Computer technology has long been considered an important factor influencing attitude and action of human being. And system design of enterprise’s virtual community is also an important factor influencing consumer’s trust in E-vendors. How system design affect consumer’s attitude is a multi-disciplinary research topic. Some researchers have separately studied the effect of knowledge sharing behavior and social aspect of system design on E-commerce trust. But researchers seldom further investigate the intermediating role of knowledge sharing between system design and E-commerce trust. From a knowledge sharing perspective, a theoretical model for relationship between system design, knowledge sharing and E-commerce trust is proposed. This model is examined through an empirical study involving 203 subjects using structural equation modeling techniques. Research limitations and future directions are discussed based on model fit and hypotheses test.
Image Classification Approach Based on Manifold Learning in Web Image Mining
Authors: Rong Zhu, Min Yao, Yiming Liu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Automatic image classification is a challenging research topic in Web image mining. In this paper, we formulate image classification problem as the calculation of the distance measure between training manifold and test manifold. We propose an improved nonlinear dimensionality reduction algorithm based on neighborhood optimization, not only to decrease feature dimensionality but also to transform the problem from high-dimensional data space into low-dimensional feature space. Considering that the images in most real-world applications have large diversities within category and among categories, we propose a new scheme to construct a set of training manifolds each representing one semantic category and partition each nonlinear manifold into several linear sub-manifolds via region growing. Moreover, to further reduce computational complexity, each sub-manifold is depicted by aggregation center. Experimental results on two Web image sets demonstrate the feasibility and effectiveness of the proposed approach.
Regional Networking for Decreasing Mortality in Acute Coronary Syndromes on a Target Population of 1 Million Inhabitants
Authors: I. A. Sarbu-Pop, Theodora Benedek, Istvan Kovacs, Melinda Struczuy, Szilard Madaras, Monica Chitu, Gabriela Kozma, Claudia Matei, Diana Horga, Imre Benedek
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

Aim: In a period of 4 years we created a Regional registry on Acute Coronary syndromes on a target population of 1 million inhabitants, and we followed the evolution of all patients with Acute Coronary Syndromes (ACS). During this period we oerformed an intense educational activity in order to increase the adherence to european guidelines regarding the treatment of ACS. Material and method: The registry included 10 hospitals in 2004 and 13 hospitals in the following years, serving a population of 1 million inhabitants. Data regarding clinical presentation, risk factors, therapy and evolution were collected, centralized and processed in the Clinic of Cardiology of Târgu Mureş. Results: The registry included a number of 3455 patients with ACS, from which 1457 Acute Myocardial Infarction (AMI) and 1998 Unstable Angina (UA). Mortality rates in AMI in the territorial hospitals was: 19,8% in 2004 which decreased to 11.04% in 2007, in parallel with an increase in the number of cases sent to interventional center (from 20% in 2004 to 28.51% in 2007).Conclusions: After the experience in running a registry on ACS, we conclude that we succeeded to decrease the mortality rates in AMI by increasing the adherence to European guidelines and by increasing the rates of patients sent to interventional center.
A Note on the Upper Bound of Dimension of Bivariate Spline Space over Triangulation
Authors: Lijuan Chen, Aiqing Wang, Mingzhu Li
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

It is known that there is not a natural generalization for the dimension of multivariate spline spaces, since the dimension of multivariate spline spaces depends not only on the topological property of partition but also on the geometric property of partition. The aim of this paper is to improve the upper bound of the dimension of bivariate spline space for degree $k$ and smoothness $\mu$ over arbitrary triangulation by using a new index of vertex coding. A new upper bound of the spline space over triangulation is obtained, which improves the known upper bound of the dimension in ~\cite{LL84} in the paper. The advantages of the improved result can be seen from the consequences and examples in the end of the paper.
Digital Games in eLearning Environments
Authors: Pablo Moreno-Ger, Daniel Burgos, Javier Torrente
Venue: Simulation and Gaming (2009)

The notion of using games in education is as old as games themselves. In addition, the massive market opened by the digital games industry has caused great interest regarding their specific potential in education. However, this interest is sometimes thwarted by the resistance of traditional educational settings toward technology-enhanced learning and digital games. The future, on the contrary, is much more promising within the eLearning field. This field is in a process of evolution and reinvention, seeking new features and ideas to improve the learning experience. We believe that educational games are a perfect medium for these new directions in eLearning. In this article, the synergies between the new eLearning environments and educational games are explored and reviewed.
Integration and Mining of Genomic Annotations: Experiences and Perspectives in GFINDer Data Warehousing
Authors: Marco Masseroli, Stefano Ceri, Alessandro Campi
Venue: Proceedings of the 6th International Workshop on Data Integration in the Life Sciences (2009)

Many tasks in bioinformatics require the comprehensive evaluation of different types of data, generally available in distributed and heterogeneous data sources. Several approaches, including federated databases, multi databases and mediator based systems, have been proposed to integrate data from multiple sources. Yet, data warehousing seams to be the most adequate when numerous data need to be integrated, efficiently processed, and mined comprehensively. To support biological interpretation of high-throughput gene lists, we previously developed GFINDer (Genome Functional INtegrated Discoverer, http://www.bioinformatics.polimi.it/GFINDer/), a web server that statistically analyzes and mines functional and phenotypic gene annotations sparsely available in numerous databanks to highlight annotation categories significantly enriched or depleted in the considered gene lists. GFINDer includes a data warehouse that integrates gene and protein annotations of several organisms expressed through various controlled terminologies and ontologies. Here, we describe GFINDer data warehouse and discuss the lessons learned in its construction and five-year maintenance and development.
On Path Partitions and Colourings in Digraphs
Authors: Irith Ben-Arroyo Hartman
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman's Theorem. This suggests that the Greene-Kleitman Theorem is stronger than Greene's Theorem on posets. We leave it as an open question whether the same holds for all digraphs, that is, does Berge's conjecture concerning path partitions in digraphs imply the extension of Greene's theorem to all digraphs (conjectured by Aharoni, Hartman and Hoffman)?
Adobe InDesign CS4 Styles: How to Create Better, Faster Text and Layouts, 1st edition
Authors: Michael Murphy
Venue:  (2009)

Tap into the far-reaching potential of InDesign stylesfrom simple drop cap formatting to cross-media export to XHTML. Styles have the power to transform how design and production professionals approach and accomplish any project. Adopting a style-centric workflow can reduce tasks that would normally take days to mere hours, and tasks that would take hours to minutes or even seconds. Less time spent on repetitive tasks means more time for creating your best work.This book explores every InDesign style to reveal its full potential. Throughout each chapter, youll pick up many tips and best practices gleaned from real-world experience. Two bonus chapters, Stroke Styles and Project Planning with Styles in Mind are available for download.For figure it out as I go designers, embracing styles still allow you to work intuitively on the page. And this guide helps break preconceptions and bad habits transferred from less powerful page layout applications that keep new InDesign users from working in far more satisfying and productive ways. Where InDesign is concerned, styles truly do equal substance. 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