ppxscal/embedding_network huggingface dataset:
Proceedings of the 9th ACM symposium on Document engineering
Venue: Document Engineering (2009)

It is our great pleasure to welcome you to the Ninth ACM Symposium on Document Engineering -- DocEng 2009, which is being held September 15-18, 2009, in Munich, Germany. This year's symposium continues its tradition of being the premier forum for presentation of research results and experience reports on document engineering. Like previous meetings, DocEng'09 gives researchers and practitioners a unique opportunity to share their work and perspectives with others interested in the various aspects of document formats, modeling, generation, transformation and production. This year's Call for Papers attracted 54 full paper submissions from Asia, Australia, Europe, North and Southern America. The Program Committee accepted 17 papers (31% acceptance rate) that cover a variety of topics, including document standards and models, adaptive documents, authoring tools and systems, XML, workflow and cooperation, document structure and analysis. We also received 65 short paper submissions of which 20 were accepted (31%). This makes the 2009 edition one of the most competitive editions up to date. All of these contributions were thoroughly refereed, with at least three reviews for every submission. Moreover, 6 papers detailing demonstrations have been submitted and reviewed by 3 experts; 3 demonstrations were accepted for including in the program. The symposium includes one poster. The program includes a Working Session on Document Versioning. We would like to thank Ethan Munson for organizing this additional event, which is known for its open and valuable discussions. We are pleased to have attracted two remarkable keynote speakers, Manfred Broy from the Technical University of Munich and Josef Hofer-Alfeis from Amontis Consulting AG. They present their views on different aspects of document engineering from an academic and an industrial point of view.
Differential Deserialization for Optimized SOAP Performance
Authors: Nayef Abu-Ghazaleh
Venue:  (2009)

The SOAP protocol emerged as the standard communication protocol for Grid systems due to its robustness, language and platform independence, and its interoperable and extensible format. SOAP's message format hinders its performance. This book presents differential deserilization (DDS), a receiver-side SOAP performance optimization technique. The book discusses DDS design and implementation in detail and presents a detailed performance study demonstrating the effectiveness of DDS when received SOAP messages exhibit similarity. The book also describes differential serialization (DS), DDS' sender-side counterpart and presents a performance study demonstrating the effectiveness of DS and DDS, when used together, for applications that exchange similar messages.
Turbo similarity searching: Effect of fingerprint and dataset on virtual-screening performance
Authors: Eleanor J. Gardiner, Valerie J. Gillet, Maciej Haranczyk, Jérôme Hert, John D. Holliday, Nurul Malim, Yogendra Patel, Peter Willett
Venue: Statistical Analysis and Data Mining (2009)

Turbo similarity searching uses information about the nearest neighbors in a conventional chemical similarity search to increase the effectiveness of virtual screening with a data fusion approach being used to combine the nearest-neighbor information. A previous paper suggested that the approach was highly effective in operation; this paper further tests the approach using a range of different databases and of structural representations. Searches were carried out on three different databases of chemical structures, using seven different types of fingerprints, as well as molecular holograms, physicochemical properties, topological indices and reduced graphs. The results show that turbo similarity searching can indeed enhance retrieval but that this is normally achieved only if the similarity search that acts as its starting point has already achieved at least some reasonable level of search effectiveness. In other cases, a modified version of TSS that uses the nearest-neighbor information for approximate machine learning can be used effectively. Though useful for qualitative (active-inactive) predictions of biological activity, turbo similarity searching does not appear to exhibit any predictive power when quantitative property data is available. Copyright &copy; 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 103-114, 2009
Design of an image analysis website for phenological and meteorological monitoring
Authors: E. Bradley, D. Roberts, C. Still
Venue: Environmental Modelling Software (2010)

Web camera image databases and web-based services can be valuable components for a variety of modelling applications, but are still areas of relatively new exploration. Investigating design and information flow for an online image archive and analysis site for plant phenology and meteorological research has broader relevance to considerations of interoperability and website features. Currently, numerous online weather cameras provide images, but have no or limited-utility archives and do not support quantitative image analysis. We describe the design and implementation of a website (http://zulu.geog.ucsb.edu/Data/camera.html) that both provides different display options for archived image review, as well as the ability to chart time-series values extracted for user-specified regions of interest. This interface is distinguished by content-enabled charts with the ability to click on data points and directly access the corresponding image for reference purposes. A linked website to the meteorological data from the camera station further extends the potential for exploratory analysis and pedagogical utility. Online quantification of the color change related to plant senescence and insolation impacts due to cloud cover are demonstrated. We conclude that dynamic web pages are a powerful and useful tool for adding educational and scientific value to repeat digital photography systems.
The syntax student's companion: an eLearning tool designed for (computational) linguistics students
Authors: Aurélien Max
Venue: Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning (2004)

This paper advocates the use of free and easily accessible computer programs in teaching. The motivating reasons for a particular program supporting the learning of syntax are given, and a first version of the program is presented and illustrated. Initial evaluation results led to additional specifications and to the development of a new version of the program that is introduced. Finally, several perspectives for such a support tool are drawn.
Numerical Matrix Analysis: Linear Systems and Least Squares
Authors: Ilse C. F. Ipsen
Venue:  (2009)

This self-contained textbook presents matrix analysis in the context of numerical computation with numerical conditioning of problems and numerical stability of algorithms at the forefront. Using a unique combination of numerical insight and mathematical rigor, it advances readers understanding of two phenomena: sensitivity of linear systems and least squares problems, and numerical stability of algorithms. This book differs in several ways from other numerical linear algebra texts. It offers a systematic development of numerical conditioning; a simplified concept of numerical stability in exact arithmetic; simple derivations; a high-level view of algorithms; and results for complex matrices. The material is presented at a basic level, emphasizing ideas and intuition, and each chapter offers simple exercises for use in the classroom and more challenging exercises for student practice. Audience: This book is intended for first-year graduate students in engineering, operations research, computational science, and all areas of mathematics. It also is appropriate for self-study. Contents: Preface; Introduction; Chapter 1: Matrices; Chapter 2: Sensitivity, Errors, and Norms; Chapter 3: Linear Systems; Chapter 4: Singular Value Decomposition; Chapter 5: Least Square Problems; Chapter 6: Subspaces; Index.
What Is Prospective Ergonomics? A Reflection and a Position on the Future of Ergonomics
Authors: Jean-Marc Robert, Eric Brangier
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

This paper presents a reflection on the future of ergonomics and a clear position for the use of prospective in this discipline. We propose to structure ergonomic activities around corrective, preventive (design) and prospective ergonomics, where the latter looks forward in time to defining human needs and activities so as to create human-centered artifacts that are useful and provide a positive user experience. The place of prospective ergonomics is upstream of projects, before a problem or request is raised by a client, and before projects exist. We describe several characteristics of prospective ergonomics and compare them with those of corrective and preventive ergonomics. We show that prospective ergonomics has major impacts on education and practice, since ergonomists should not only be trained as human factor experts but also as strategists to reflect on the future and as project managers. Prospective ergonomics requires the "intelligence analysis" of a lot of data and experts' opinions, as well as perspicacity, intuition, creativity, motivation and initiative. It represents a huge potential for the advancement and evolution of ergonomics and for the achievement of its full maturity.
Exploiting rich syntactic information for relation extraction from biomedical articles
Authors: Yudong Liu, Zhongmin Shi, Anoop Sarkar
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This paper proposes a ternary relation extraction method primarily based on rich syntactic information. We identify PROTEIN-ORGANISM-LOCATION relations in the text of biomedical articles. Different kernel functions are used with an SVM learner to integrate two sources of information from syntactic parse trees: (i) a large number of syntactic features that have been shown useful for Semantic Role Labeling (SRL) and applied here to the relation extraction task, and (ii) features from the entire parse tree using a tree kernel. Our experiments show that the use of rich syntactic features significantly outperforms shallow word-based features. The best accuracy is obtained by combining SRL features with tree kernels.
Optimizing Omega
Authors: S. J. Kane, M. C. Bartholomew-Biggs, M. Cross, M. Dewar
Venue: Journal of Global Optimization (2009)

This paper considers the Omega function, proposed by Cascon, Keating Shadwick as a performance measure for comparing financial assets. We discuss the use of Omega as a basis for portfolio selection. We show that the problem of choosing portfolio weights in order to maximize Omega typically has many local solutions and we describe some preliminary computational experience of finding the global optimum using a NAG library implementation of the Huyer Neumaier MCS method.
Ant Colony Algorithm Approach for Solving Traveling Salesman with Multi-agent
Authors: Shao-Qiang Wang, Zhong-Yu Xu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Traveling Salesman Problem is a very classical optimization problem in the field of operations research, and often-used benchmark for new optimization techniques. This paper will to bring up multi-agent approach for solving the Traveling Salesman Problem based on data mining algorithm, for the extraction of knowledge from a large set of Traveling Salesman Problem. The proposed approach supports the distributed solving to the Traveling Salesman Problem. It divides into three-tier, the first tier is ant colony optimization agent; the second-tier is genetic algorithm agent; and the third tier is fast local searching agent. In using an Ant Colony Algorithm for the Traveling Salesman Problem, An attribute-oriented induction methodology was used to explore the relationship between an operations' sequence and its attributes and a set of rules has been developed. These rules can duplicate the Ant Colony Algorithm performance on identical problems. Ultimately, the experimental results have shown that the proposed hybrid approach has good performance with respect to the quality of solution and the speed of computation.
Engaging and Adaptive: Going beyond Ease of Use
Authors: Kevin Clark
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Making products and services easier to use is a durable goal, yet will likely be insufficient to meet the expectations of a new generation of customers. This paper suggests "ease-of-use" be augmented with the goal of being "engaging and adaptive" for products, services, and the overall experience people have with organizations that provide them. Being intentional and using design thinking can be used to deliver engaging and adaptive experiences to customers around the world. 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
Correcting dependency annotation errors
Authors: Markus Dickinson
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Building on work detecting errors in dependency annotation, we set out to correct local dependency errors. To do this, we outline the properties of annotation errors that make the task challenging and their existence problematic for learning. For the task, we define a feature-based model that explicitly accounts for non-relations between words, and then use ambiguities from one model to constrain a second, more relaxed model. In this way, we are successfully able to correct many errors, in a way which is potentially applicable to dependency parsing more generally.
The New Trend of Financial Process Reengineering: Financial Shared Services
Authors: Ying He, Yuying Cao
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

With the driving of the assets expansion, the fund chain lengthening and the spread extensive in the company, providing financial shared services through financial process reengineering becomes an urgent demand for management. The demand promotes the innovation and development of technology and system naturally. And it makes an important influence on the change of the organization and the promotion of the management level at the same time. Financial process reengineering includes four phases in sequential order which are simplicity, standardization, shared services and outsourcing. This is also the process of achievement improvement for the international company. Financial shared services is a kind of new institutional arrangement for integrating financial operation and reengineering management process which is based on the simplicity and standardization of processes in the company. This paper makes a research on the organization model of financial shared services based on discussing the concept and theory foundation of financial shared services. Finally, it explores significantly the essential factor and the risk control for implementing financial shared services strategy.
Formal Verification of Safety Functions by Reinterpretation of Functional Block Based Specifications
Authors: Erzsébet Németh, Tamás Bartha
Venue: Formal Methods for Industrial Critical Systems: 13th International Workshop, FMICS 2008, L'Aquila, Italy, September 15-16, 2008, Revised Selected Papers (2009)

This paper presents the formal verification of a primary-to-secondary leaking (abbreviated as PRISE) safety procedure in a nuclear power plant (NPP). The software for the PRISE is defined by the Function Block Diagram specification method.Our approach to the formal verification of the PRISE safety procedure is based on the coloured Petri net (CPN) representation. The CPN model of the checked software is derived by reinterpretation from the FBD diagram, using a pre-developed library of CPN subnets. This results in a high-level, hierarchical coloured Petri net, that has an almost identical structure to the FBD specification.The state space of the CPN model was drastically reduced by "folding" equivalent states and trajectories into equivalence classes. Some of the safety properties could be proven based on the SCC (strongly connected components) graph of the reduced state space. Other properties were proven by CTL temporal logic based model checking.
Merging worlds: when virtual meets physical: an experiment with hybrid learning
Authors: Esmail Bonakdarian, Todd Whittaker, Daniel Bell
Venue: Journal of Computing Sciences in Colleges (2009)

Online enrollments continue to grow at many institutions. However there are some legitimate questions that can be raised about the student experience in online only classes. In this paper we describe a "hybrid" approach that tries to combine the better of two worlds, i.e., the better features of the traditional face-to-face classroom instructional format and the "pure" asynchronous online format. Our goal is to offer online students some of the experiences that face-to-face students have in class while also retaining much of the flexibility that comes with an online format. The main benefits as we see them are in increased involvement of the online students with their peers in the physical class and a higher level of engagement that we believe will result in a better student experience and better student outcomes.
Rough Qualitative Spatial Reasoning Based on Rough Topology
Authors: Anahid Bassiri, Mohammad R. Malek, Ali A. Alesheikh
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

In order to derive information based on captured data, some analysis methods are implemented. These methods reduce our need to have all the related data. One of the most important devices to extract information from incomplete data is the reasoning method. Spatial reasoning is one of fields of reasoning whose implementation relies on spatial objects. An ordinary method of qualitative reasoning suffers from not considering fuzziness and vagueness. In order to extract qualitative information from uncertain spatial objects, this paper proposes a new method based on rough set theory. Based on rough topological relationships, reasoning rules were developed. Application of paper is to do with land cover areas as rough objects.
Predictions of typhoon storm surge in Taiwan using artificial neural networks
Authors: Tsung-Lin Lee
Venue: Advances in Engineering Software (2009)

Accurate predictions of storm surge and surge deviation are essential for industrial activities in coastal areas. Usually numerical hydrodynamic models or empirical methods are used to estimate the storm surge. This paper proposes an alternative back-propagation neural network (BPN) approach to forecast the storm surge and surge deviation. The prediction of storm surge from a previous typhoon is used as a training set to form predictions for the next event. Wind velocity, wind direction, atmospheric pressure and astronomical tide were selected as inputs in the neural network. The observations obtained during three typhoons from four stations in Taiwan were used to illustrate performance of the BPN model. Comparisons with numerical methods indicate that the storm surge and surge deviation can be efficiently predicted using BPN.
Heuristic Evaluations of Bioinformatics Tools: A Development Case
Authors: Barbara Mirel, Zach Wright
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Heuristic evaluations are an efficient low cost method for identifying usability problems in a biomedical research tool. Combining the results of these evaluations with findings from user models based on biomedical scientists' research methods guided and prioritized the design and development process of these tools and resulted in improved usability. Incorporating heuristic evaluations and user models into the larger organizational practice led to increased awareness of usability across disciplines.
Probabilistic Weighted Automata
Authors: Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of all runs over w, and the value of a run as the supremum, limsup, liminf, limit average, or discounted sum of the transition weights.We introduce probabilistic weighted automata, in which the transitions are chosen in a randomized (rather than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics), the value of a word w is the largest real v such that the runs over w have value at least v with probability 1 (resp. positive probability).We study the classical questions of automata theory for probabilistic weighted automata: emptiness and universality, expressiveness, and closure under various operations on languages. For quantitative languages, emptiness and universality are defined as whether the value of some (resp. every) word exceeds a given threshold. We prove some of these questions to be decidable, and others undecidable. Regarding expressive power, we show that probabilities allow us to define a wide variety of new classes of quantitative languages, except for discounted-sum automata, where probabilistic choice is no more expressive than nondeterminism. Finally, we give an almost complete picture of the closure of various classes of probabilistic weighted automata for the following pointwise operations on quantitative languages: max, min, sum, and numerical complement.
Speeding up LFG parsing using c-structure pruning
Authors: Aoife Cahill, John T. Maxwell,  III, Paul Meurer, Christian Rohrer, Victoria Rosén
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

In this paper we present a method for greatly reducing parse times in LFG parsing, while at the same time maintaining parse accuracy. We evaluate the methodology on data from English, German and Norwegian and show that the same patterns hold across languages. We achieve a speedup of 67% on the English data and 49% on the German data. On a small amount of data for Norwegian, we achieve a speedup of 40%, although with more training data we expect this figure to increase.
Tor, TorMd: distributional profiles of concepts for unsupervised word sense disambiguation
Authors: Saif Mohammad, Graeme Hirst, Philip Resnik
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

Words in the context of a target word have long been used as features by supervised word-sense classifiers. Mohammad and Hirst (2006a) proposed a way to determine the strength of association between a sense or concept and co-occurring words---the distributional profile of a concept (DPC)---without the use of manually annotated data. We implemented an unsupervised na&iuml;ve Bayes word sense classifier using these DPCs that was best or within one percentage point of the best unsupervised systems in the Multilingual Chinese-English Lexical Sample Task (task #5) and the English Lexical Sample Task (task #17). We also created a simple PMI-based classifier to attempt the English Lexical Substitution Task (task #10); however, its performance was poor.