ppxscal/embedding_network huggingface dataset:
A comparison of rankings produced by summarization evaluation measures
Authors: Robert L. Donaway, Kevin W. Drummey, Laura A. Mather
Venue: NAACL-ANLP 2000 Workshop on Automatic Summarization (2000)

Summary evaluation measures produce a ranking of all possible extract summaries of a document. Recall-based evaluation measures, which depend on costly human-generated ground truth summaries, produce uncorrelated rankings when ground truth is varied. This paper proposes using sentence-rank-based and content-based measures for evaluating extract summaries, and compares these with recall-based evaluation measures. Content-based measures increase the correlation of rankings induced by synonymous ground truths, and exhibit other desirable properties.
Predictive representations for policy gradient in POMDPs
Authors: Abdeslam Boularias, Brahim Chaib-draa
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive State Representations (PSRs). We compare PSR policies to Finite-State Controllers (FSCs), which are considered as a standard model for policy gradient methods in POMDPs. We present a general Actor-Critic algorithm for learning both FSCs and PSR policies. The critic part computes a value function that has as variables the parameters of the policy. These latter parameters are gradually updated to maximize the value function. We show that the value function is polynomial for both FSCs and PSR policies, with a potentially smaller degree in the case of PSR policies. Therefore, the value function of a PSR policy can have less local optima than the equivalent FSC, and consequently, the gradient algorithm is more likely to converge to a global optimal solution.
Web Text Categorization for Enterprise Decision Support Based on SVMs --- An Application of GBODSS
Authors: Zhijuan Jia, Mingsheng Hu, Haigang Song, Liu Hong
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

With increasing amounts of data being generated by businesses and researchers there is a need for fast, accurate and robust approach for enterprise decision. Because the final goal of text categorization is to support decision, the web text categorization must adapt the dynamic change over the time as the web text documents increase rapidly. With the advent of grid technologies, the idea of Grid-based Open DSS (GBODSS) is becoming a reality. In this study, an approach of web text categorization based on Support Vector Machines (SVMs) in GBODSS framework is developed to support enterprise decision making. The experiments were conducted on different configurations of grid network and computation time was recorded for each operation. We analyzed our result with various grid configurations and it shows speed up of computation time is almost super linear. The experiment results reported here clearly show the potential of GBODSS while highlighting the need for further research into the decision support system.
Who Wrote The Blonde Countess? A Stylometric Analysis of Herbert O. Yardley's Fiction
Authors: John F. Dooley, Yvonne I. Ramirez
Venue: Cryptologia (2009)

One of Herbert O. Yardley's many careers was as a writer of short stories and novels of international intrigue. It is widely accepted [12] that Yardley wrote at least some of his fiction in collaboration with Carl H. Grabo, a professor of English at the University of Chicago. What is not completely known is which of Yardley's novels are predominantly Grabo, and which might be predominantly Yardley. This article presents a stylometric analysis of Yardley's novels and gives evidence on the identity of the author(s) of each.
The Learning Grid and E-Assessment using Latent Semantic Analysis
Authors: Debra Trusso Haley, Pete Thomas, Bashar Nuseibeh, Josie Taylor, Paul Lefrere
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

E-assessment is an important component of e-learning and e-qualification. Formative and summative assessment serves different purposes and both types of evaluation are critical to the pedagogical process. While students are studying, practicing, working, or revising, formative assessment provides direction, focus, and guidance. Summative assessment provides the means to evaluate a learner's achievement and communicate that achievement to interested parties. Latent Semantic Analysis (LSA) is a statistical method for inferring meaning from a text. Applications based on LSA exist that provide both summative and formative assessment of a learner's work. However, the huge computational needs are a major problem with this promising technique. This paper explains how LSA works, describes the breadth of existing applications using LSA, explains how LSA is particularly suited to e-assessment, and proposes research to exploit the potential computational power of the Grid to overcome one of LSA's drawbacks.
Optimal Scheduling and Incentive Compatible Pricing for a Service System with Quality of Service Guarantees
Authors: Vernon N. Hsu, Susan H. Xu, Boris Jukic
Venue: Manufacturing Service Operations Management (2009)

This paper proposes a resource allocation and pricing mechanism for a service system that serves multiple classes of jobs within an organization. Each class of service request is subject to a class-dependent quality of service (QoS) guarantee on the expected delay bound, which may be imposed by business rules in an organization or other application-specific technical constraints. We develop an extension of a resource allocation and pricing mechanism for an M/M/1 system. In contrast to the system without the QoS guarantee, where a fixed priority scheduling policy---known as the cμ rule---is optimal, we show that the system may need to adopt a more general randomized priority scheduling policy to maximize the overall system profit. We also develop a transfer pricing scheme that is both optimal and incentive compatible, allowing users to act in their self-interests while collectively achieving the system optimum. We show that the pricing scheme with the QoS guarantee depends on the scheduling policy implemented and has different characteristics from that without the QoS guarantee.
Efficient object exploration and object presentation in TeleTA, Teleoperation system with Tactile feedback
Authors: Dzmitry Tsetserukou, Susumu Tachi
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In order to achieve awareness of collision during teleoperation and to support operator with valuable information (object stiffness and shape), we elaborated approaches to object parameter identification and delivering this information to the operator's skin through tactile display. The tactile sensory ability of the remote manipulator allows collision detection and exploration of contacting object. A new type of tactile display that accounts for effectiveness of the information presentation, power consumption, ergonomics, and usability for particular teleoperation task was developed. The experimental results of object shape and stiffness presentation to the human's forearm revealed the most efficient vibration patterns.
A bootstrap goodness of fit test for the generalized Pareto distribution
Authors: José A. Villaseñor-Alva, Elizabeth González-Estrada
Venue: Computational Statistics Data Analysis (2009)

This paper proposes a bootstrap goodness of fit test for the Generalized Pareto distribution (GPd) with shape parameter @c. The proposed test is an intersection-union test which tests separately the cases of @c>=0 and @c
Remote Sensing Imagery for Soil Characterization: a Wavelet Neural Data Fusion Approach
Authors: Matteo Cacciola, Francesco Carlo Morabito, Vincenzo Barrile
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

Technological advances in remote sensing imagery allows to obtain high resolution images, helpful in soil characterizing, monitoring and predicting natural hazards. On the other hand, the different kind of in-service sensors allows inferences on a large frequency band. In spite of this, due to the increasing requirements of industrial and civil entities, the academic research is actually involved in improving the quality of imageries. The aim is to implement automatic tools able to work in real-time applications, above all in order to solve pattern identification problem in remote sensing. Within this framework, our work proposes a data fusion methodology, based on the Multiscale Kalman Filter, in order to improve soil characterization in Ikonos surveys.
Building Web Applications with Microsoft Office SharePoint Designer 2007 Step by Step
Authors: John Jansen
Venue:  (2009)

You don t need to be a professional solution developer to build sophisticated, collaborative SharePoint applications. Experience learning made easy and quickly learn how to build no-code Web applications with SharePoint Designer 2007. With STEP BY STEP, you set the pace building and practicing the skills you need, just when you need them. Topics include: Get Started with SharePoint Designer Customizing the SharePoint Master Page Using ASP.NET controls with SharePoint Controls Creating Workflows Data Sources with ASP.NET and SharePoint Integrating SharePoint Applications with Access Creating Data Views in SharePoint Designer
Supporting Program Comprehension for Refactoring Operations with Annotations
Authors: Klaus Meffert, Ilka Philippow
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

Restructuring a program is a concept that aims at increasing the maintainability of a piece of code by changing its structure. The term refactoring is often used synonymously, especially when the observable behavior of a program should not change when transforming the structure of the software to a more sophisticated level, e.g. by using design patterns. Behaviour-conserving program transformations are difficult as the understanding of both the code to transform as well as the transformation is prerequisite for conserving the conduct of a transformed program. In addition, a transformation should only be executed if certain preconditions apply. To capture the semantic and syntactic details about a specific code fragment, it is proposed documenting them by adding machine-processable and at the same time human-readable annotations. These annotations contain explicit information and could be added to source code by tools evaluating the code, as well as by practitioners. With annotations, it may be possible checking preconditions for program transformations to execute, and gain information necessary for these transformations.
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
Authors: Yuvraj Gajpal, Prakash Abad
Venue: Computers and Operations Research (2009)

In this paper we use an ant colony system (ACS) algorithm to solve the vehicle routing problem with simultaneous delivery and pickup (VRPSDP) which is a combinatorial optimization problem. ACS is an algorithmic approach inspired by the foraging behavior of real ants. Artificial ants are used to construct a solution for the problem by using the pheromone information from previously generated solutions. The proposed ACS algorithm uses a construction rule as well as two multi-route local search schemes. The algorithm can also solve the vehicle routing problem with backhaul and mixed load (VRPBM). An extensive numerical experiment is performed on benchmark problem instances available in literature. It is found that ACS gives good results compared to the existing algorithms.
Synchronous Multiparty Session Types
Authors: Andi Bejleri, Nobuko Yoshida
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Synchronous communication is useful to model multiparty sessions where control for timing events and strong sequentially order of messages are essential to the problem specification. This paper continues the work on multiparty session types initiated by Honda et al. [Honda, K., N. Yoshida and M. Carbone, Multiparty asynchronous session types, in: G. C. Necula and P. Wadler, editors, POPL (2008), pp. 273-284] for synchronous communications. It provides a more relaxed syntax of the calculus, multicasting, higher-order communication via multipolarity labels and a clear definition of delegation in global types. The linearity property defines when a channel can be used in two different communications without creating a race condition and the type system checks if all the processes of a session implement the communication behavior specified in the global type. The type system of the calculus is proved to be sound with respect to the operational semantics and coherent with respect to the global types.
A variational approach for viewpoint-based visibility maximization
Authors: Anthony J. Yezzi
Venue:  (2008)

We present a variational method for unfolding of the cortex based on a user-chosen point of view as an alternative to more traditional global flattening methods, which incur more distortion around the region of interest. Our approach involves three novel contributions. The first is an energy function and its corresponding gradient flow to measure the average visibility of a region of interest of a surface from a given viewpoint. The second is an additional energy function and flow designed to preserve the 3D topology of the evolving surface. This latter contribution receives significant focus in this thesis as it is crucial to obtain the desired unfolding effect derived from the first energy functional and flow. Without it, the resulting topology changes render the unconstrained evolution uninteresting for the purpose of cortical visualization, exploration, and inspection. The third is a method that dramatically improves the computational speed of the 3D topology-preservation approach by creating a tree structure of the triangulated surface and using a recursion technique.
Exploiting functional relationships in musical composition
Authors: Amy K. Hoover, Kenneth O. Stanley
Venue: Connection Science (2009)

The ability of gifted composers like Mozart to create complex multipart musical compositions with relative ease suggests a highly efficient mechanism for generating multiple parts simultaneously. Computational models of human music composition can potentially shed light on how such rapid creativity is possible. This article proposes such a model based on the idea that the multiple threads of a song are temporal patterns that are functionally related, which means that one instrument's sequence is a function of another's. This idea is implemented in a program called NEAT Drummer that interactively evolves a type of artificial neural network called a compositional pattern-producing network, which represents the functional relationship between the instruments and drums. The main result is that richly textured drum tracks that tightly follow the structure of the original song are easily generated because of their functional relationship to it.
Simulated Artificial Human Vision: The Effects of Spatial Resolution and Frame Rate on Mobility
Authors: Jason Dowling, Wageeh Boles, Anthony Maeder
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Electrical stimulation of the human visual system can result in the perception of blobs of light, known as phosphenes. Artificial Human Vision (AHV or visual prosthesis) systems use this method to provide a visual substitute for the blind. This paper reports on our experiments involving normally sighted participants using a portable AHV simulation. A Virtual Reality Head Mounted Display is used to display the phosphene simulation. Custom software converts captured images from a head mounted USB camera to a DirectX based phosphene simulation. The effects of frame rate (1, 2 and 4 FPS) and phosphene spatial resolution (16x12 and 32x24) on participant Percentage of Preferred Walking Speed (PPWS) and mobility errors were assessed during repeated trials on an artificial indoor mobility course. Results indicate that spatial resolution is a significant factor in reducing contact with obstacles and following a path without veering, however the phosphene display frame rate is a better predictor of a person's preferred walking speed. These findings support the development of an adaptive display which could provide a faster display with reduced spatial resolution when a person is walking comfortably and a slower display with higher resolution when a person has stopped moving.
Dna computing with cutting, pasting, filtering and washing
Authors: Dennis Pixton
Venue:  (2008)

We study finite multi-test-tube DNA computing using cutting, pasting, washing and filtering. First, we reformulate the ideas of Csuhaj-Varj&uacute;, Kari, Pa&caron;un, Freund, Priese, Rogojine and Margenstern about multi-test-tube splicing DNA computing in terms of cutting and pasting as in Pixton's work. As Pixton shows, with just finite cutting and pasting only regular sets can be obtained from a finite set of initial molecules. The others cited above show that if filtering is allowed between a finite number of test-tubes in which finite splicing occurs then any recursively enumerable set can be obtained using finite sets of initial test-tube contents. We confirm this result for cutting and pasting. Second, we show that when only finite pasting and filtering between tubes with finite initial contents are allowed then the result must be context free and that any context free language can be so obtained. Third, we consider several forms of filtering and several ways of combining filtering with cutting, pasting or splicing and show that all are equivalent. In particular we show that pasting with empty strings does not change the generative capacity of the systems. Fourth, we introduce an additional control mechanism: the washing of tubes between computational steps. We show that the family of languages that can be obtained with finite pasting, washing and filtering in multiple tubes with a finite collection of initial molecules lies properly between the family of context free languages and the family of context sensitive languages. Finally, we investigate the closure properties of the family of languages obtained by finite pasting, washing and filtering with a finite set of initial molecules in a finite number of tubes and determine that it satisfies almost all properties of an AFL, lacking only closure under inverse homomorphism.
Towards autonomous data ferry route design through reinforcement learning
Authors: Daniel Henkel, Timothy X. Brown
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Communication in delay tolerant networks can be facilitated by the use of dedicated mobile “ferries” which physically transport data packets between network nodes. The goal is for the ferry to autonomously find routes which minimize the average packet delay in the network. We prove that paths which visit all nodes in a round-trip fashion, i.e., solutions to the Traveling Salesman Problem, do not yield the lowest average packet delay. We propose two novel ferry path planning algorithms based on stochastic modeling and machine learning. We model the path planning task as a Markov Decision Process with the ferry acting as an independent agent. We apply Reinforcement Learning to enable the ferry to make optimal decisions. Simulation experiments show the resulting routes have lower average packet delay than solutions known to date.
A graph-search framework for geneId ranking
Authors: William W. Cohen
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

One step in the curation process is geneId finding---the task of finding the database identifier of every gene discussed in an article. GeneId-finding was studied experimentally in the BioCreatIvE challenge (Hirschman et al., 2005), which developed testbed problems for each of three model organisms (yeast, mice, and fruitflies). Here we consider geneId ranking, a relaxation of geneId-finding in which the system provides a ranked list of genes that might be discussed by the document. We show how multiple named entity recognition (NER) methods can be combined into a single high-performance geneId-ranking system.
FlatCAD and FlatLang: Kits by code
Authors: Gabe Johnson
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

The FlatCAD system lets you create physical construction kits by coding in the LOGO-like FlatLang language. Designers often use structured CAD tools to specify physical form. Programming offers an alternative and powerful method for designing shapes. This paper describes our experimental domain-specific language used to program and manufacture physical shape in the domain of construction kits.
Diagrams and intuitive formal specifications
Authors: James Burton
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

When diagrams are used to describe formal software specifications, their expressive power has the potential to make certain reasoning tasks easier. Our work aims to embed such diagrammatic specifications directly in the software they describe. We argue that diagrams can help lower the barrier to formal methods, making this activity accessible to greater numbers of programmers. 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
A Description Logic with Concept Instance Ordering and Top-k Restriction
Authors: Veronika Vaneková, Peter Vojtáš
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

In this paper we introduce a new “scoring” description logic s-EL(D) with concept instance ordering and top-k restriction queries. This enables to create ontologies describing user preferences (ordering of concept instances) and to describe concepts consisting of top-k instances according to this ordering. We construct algorithm for instance problem in s-EL(D). The main application is an extension of web modeling languages to model user preferences and top-k in web services and web search.
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Authors: Bin Zhou, Daxin Jiang, Jian Pei, Hang Li
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more data-driven applications are being developed in search engines based on search logs, such as query suggestion, keyword bidding, and dissatisfactory query analysis. In this paper, by observing that many data-driven applications in search engines highly rely on online mining of search logs, we develop an OLAP system on search logs which serves as an infrastructure supporting various data-driven applications. An empirical study using real data of over two billion query sessions demonstrates the usefulness and feasibility of our design.