ppxscal/embedding_network huggingface dataset:
Exposing parameters of a trained dynamic model for interactive music creation
Authors: Dan Morris, Ian Simon, Sumit Basu
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

As machine learning (ML) systems emerge in end-user applications, learning algorithms and classifiers will need to be robust to an increasingly unpredictable operating environment. In many cases, the parameters governing a learning system cannot be optimized for every user scenario, nor can users typically manipulate parameters defined in the space and terminology of ML. Conventional approaches to user-oriented ML systems have typically hidden this complexity from users by automating parameter adjustment. We propose a new paradigm, in which model and algorithm parameters are exposed directly to end-users with intuitive labels, suitable for applications where parameters cannot be automatically optimized or where there is additional motivation - such as creative flexibility - to expose, rather than fix or automatically adapt, learning parameters. In our CHI 2008 paper, we introduced and evaluated MySong, a system that uses a Hidden Markov Model to generate chords to accompany a vocal melody. The present paper formally describes the learning underlying MySong and discusses the mechanisms by which MySong's learning parameters are exposed to users, as a case study in making ML systems user-configurable. We discuss the generalizability of this approach, and propose that intuitively exposing ML parameters is a key challenge for the ML and human-computer-interaction communities.
Privacy concern and online personalization: The moderating effects of information control and compensation
Authors: David G. Taylor, Donna F. Davis, Ravi Jillapalli
Venue: Electronic Commerce Research (2009)

Firms have at their disposal an increasing amount of personal information about consumers gathered through various means. Studies find that personalizing online interactions improves customer relationships and increases desirable behaviors, such as positive word-of-mouth and increased purchase intent. However, other research suggests that the use of personal information stimulates privacy concern, which has a negative effect on behavior. This study examines potential moderators of the negative effects of privacy concern on behavioral intentions in the context of personalized online interactions. Results show that increasing perceived information control reduces the negative effect of privacy concern on intentions to engage in positive behaviors. In contrast, the offer of compensation has no effect on the relationship between privacy concern and these behavioral intentions. However, compensation increases the salience of trust to privacy concern.
Bound propagation
Authors: Martijn Leisink, Bert Kappen
Venue: Journal of Artificial Intelligence Research (2003)

In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The range of allowed probability distributions over the surrounding nodes is restricted using earlier computed bounds. As we will show, this can be considered as a set of constraints in a linear programming problem of which the objective function is the marginal probability of the center nodes. In this way knowledge about the maginals of neighbouring clusters is passed to other clusters thereby tightening the bounds on their marginals. We show that sharp bounds can be obtained for undirected and directed graphs that are used for practical applications, but for which exact computations are infeasible.
Expectation of Strings with Mismatches under Markov Chain Distribution
Authors: Cinzia Pizzi, Mauro Bianco
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

We study a problem related to the extraction of over-represented words from a given source text x, of length n. The words are allowed to occur with k mismatches, and x is produced by a source over an alphabet Σ according to a Markov chain of order p. We propose an online algorithm to compute the expected number of occurrences of a word y of length m in O(mk |Σ| p + 1). We also propose an offline algorithm to compute the probability of any word that occurs in the text in O(k|Σ|2) after O(nk |Σ| p + 1) pre-processing. This algorithm allows us to compute the expectation for all the words in a text of length n in O(kn 2|Σ|2 + nk |Σ| p + 1), rather than in O(n 3 |Σ| p + 1) that can be obtained with other methods. Although this study was motivated by the motif discovery problem in bioinformatics, the results find their applications in any other domain involving combinatorics on words.
The Study on Appraisal of Enterprise Employee Performance
Authors: Cui Huibao, Liu Lei
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The human resource is one of the determining factors which the enterprises realize production operation goal, and the important force which the society realizes the economic development and humanity's progressive. The science reasonable achievements appraisal system is the important basis which the enterprise formulates the human resources strategy and effectively implement human resources management. This article used the questionnaire survey procedure and referred to the related literature to summarize a representative staff achievements evaluating indicator system, has carried on the thorough investigation to 20 enterprises in Jinan, Dezhou and Zibo, utilized the factor analytic method of SPSS to carry on these factors analysis, shorted many factors which affected the staff achievements to several comprehensive ingredients, thus carried on the human resources development and the management for the enterprise provides a simple valuable method.
Web Data Extraction Based on XBRL-GL Taxonomy
Authors: Hanyang Luo, Jinling Gao, Hanyang Luo
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The Web has become one of the most important connections to various information resources. The most interesting challenge is how to extract important data from a large number of web pages and transform them to more structural, standard and semantic information, which can be queried and analyzed by using matured techniques in database, data warehouse and other fields. We design a wrapper generator by combining the data extraction technique with XBRL technology based on XBRL-GL taxonomy. The wrapper can transform HTML documents to XML forms according to the analysis of HTML document structure, and then use XPath to locate the data. In this way, we can extract the data accurately and store them in a standard form.
Russian morphology: resources and Java software applications
Authors: Serge Yablonsky
Venue: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic Languages (2003)

This paper deals with development and application of Russian morphology software and resources. The approach is particularly dependent on advanced morphological analysis. The paper presents the structure, formats and content of Russian dictionaries and corpora. Relevant aspects of the UML data models, XML format and related technologies are surveyed. We introducee the system based on Java and Oracle 9i DBMS.
Real-time Hand Gesture Recognition System Based on Q6455 DSP Board
Authors: Qiong Fei, Xiaoqiong Li, Tao Wang, Xiongkui Zhang, Guoman Liu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

This paper presents detailed description of a real-time hand gesture recognition system using embedded DSP board and image processing approaches. Such a system which can identify hand postures and dynamic gestures has manifold potential applications range from sign languages to human computer interaction. We use Q6455 DSP board based on 4 TI-TMS320C6455 DSPs as the computational unit. This versatile signal processing module has powerful computing and interconnection capability. To recognize hand postures, algorithm based on skin color segmentation and geometric invariant feature has been used. During identify dynamic gestures, optical flow tracking approach and direction encoding are adopted. The implementation of high reliable algorithm on DSP board keeps the system robust and efficient. Experimental results show that the proposed system performs well in recognizing hand postures and dynamic gestures real timely. The accuracy and scalability of this system are also soundly proved.
Automating the Design and Construction of Query Forms
Authors: Magesh Jayapandian, H. V. Jagadish
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

One of the simplest ways to query a database is through a form where a user can fill in relevant information and obtain desired results by submitting the form. Designing good forms is a nontrivial manual task, and the designer needs a sound understanding of both the data organization and the querying needs. Furthermore, form design usually has conflicting goals: each form should be simple and easy to understand, while collectively, the interface must support as many queries as possible. In this paper, we present a framework for generating forms in an automatic and principled way, given a database and a sample query workload. We design a tunable clustering algorithm for establishing form structure based on multiple “similar” queries, which includes a mechanism for extending forms to support future “similar” queries. The algorithm is adaptive and can incrementally adjust forms to reflect the most current querying trends. We have implemented our form generation system on a real database and evaluated it on a comprehensive set of query loads and database schemas. We observe that our system generates a modest number of forms for large and diverse query loads even after placing a strict bound on form complexity.
Degrees of grounding based on evidence of understanding
Authors: Antonio Roque, David Traum
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

We introduce the Degrees of Grounding model, which defines the extent to which material being discussed in a dialogue has been grounded. This model has been developed and evaluated by a corpus analysis, and includes a set of types of evidence of understanding, a set of degrees of groundedness, a set of grounding criteria, and methods for identifying each of these. We describe how this model can be used for dialogue management.
Multiword expression filtering for building knowledge maps
Authors: Shailaja Venkatsubramanyan, Jose Perez-Carballo
Venue: Proceedings of the Workshop on Multiword Expressions: Integrating Processing (2004)

This paper describes an algorithm that can be used to improve the quality of multiword expressions extracted from documents. We measure multiword expression quality by the "usefulness" of a multiword expression in helping ontologists build knowledge maps that allow users to search a large document corpus. Our stopword based algorithm takes n-grams extracted from documents, and cleans them up to make them more suitable for building knowledge maps. Running our algorithm on large corpora of documents has shown that it helps to increase the percentage of useful terms from 40% to 70% --- with an eight-fold improvement observed in some cases.
(C)LP Tracing and Debugging
Authors: Mireille Ducassé
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Since Ehud Shapiro's "Algorithmic debugging", in 1983, there has been a continuous, even if not very abundant, flow of work on tracing and debugging for (constraint) logic programming. The tutorial presents trace production techniques, ranging from compiler instrumentations to dedicated meta-interpreters. It reviews work on trace analysis, in particular algorithmic, declarative and rational debugging. It discusses the issue of trace querying and driving. Last but not least, it describes the latest software engineering research on trace mining.Throughout the presentation, we stress the importance of the nature of the trace data used by the techniques. We show that CLP techniques have inspired a number of work in other communities. We argue that trace mining techniques can easily be applied to CLP.
An exploration of document impact on graph-based multi-document summarization
Authors: Xiaojun Wan
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

The graph-based ranking algorithm has been recently exploited for multi-document summarization by making only use of the sentence-to-sentence relationships in the documents, under the assumption that all the sentences are indistinguishable. However, given a document set to be summarized, different documents are usually not equally important, and moreover, different sentences in a specific document are usually differently important. This paper aims to explore document impact on summarization performance. We propose a document-based graph model to incorporate the document-level information and the sentence-to-document relationship into the graph-based ranking process. Various methods are employed to evaluate the two factors. Experimental results on the DUC2001 and DUC2002 datasets demonstrate that the good effectiveness of the proposed model. Moreover, the results show the robustness of the proposed model.
Enhancing the Creativity Process by Adding Context Awareness in Creativity Support Tools
Authors: George A. Sielis, Aimilia Tzanavari, George A. Papadopoulos
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The existence of creativity support tools establishes creativity as part of the Computer Science research. Therefore, the development of computational methods for the enhancement of creativity is undoubtedly a challenge. In this paper we argue that adding context awareness in creativity support tools will enhance the creativity process. This belief is based on the evaluation of a number of the most popular creativity support tools in relation to the features and characteristics they support. In this review, we examine the characteristics related to the interaction between the user and the creativity support tools in two phases: the `preparation' of creativity process and the `ideation' phase. Through this analysis we observe that the tools in most cases play a passive role. Real time Human-Computer interaction is missing, and therefore the creativity process is not as effective as it could and should be. Finally, we conclude that the addition of context awareness in creativity support tools can enhance the creativity process and innovation.
Ensembles of Abstaining Classifiers Based on Rule Sets
Authors: Jerzy Błaszczyński, Jerzy Stefanowski, Magdalena Zając
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

The role of abstaining from prediction by component classifiers in rule ensembles is discussed. We consider bagging and Ivotes approaches to construct such ensembles. In our proposal, component classifiers are based on unordered sets of rules with a classification strategy that solves ambiguous matching of the object's description to the rules. We propose to induce rule sets by a sequential covering algorithm and to apply classification strategies using either rule support or discrimination measures. We adopt the classification strategies to abstaining by not using partial matching. Another contribution of this paper is an experimental evaluation of the effect of the abstaining on performance of ensembles. Results of comprehensive comparative experiments show that abstaining rule sets classifiers improve the accuracy, however this effect is more visible for bagging than for Ivotes.
Fighting State Space Explosion: Review and Evaluation
Authors: Radek Pelánek
Venue: Formal Methods for Industrial Critical Systems: 13th International Workshop, FMICS 2008, L'Aquila, Italy, September 15-16, 2008, Revised Selected Papers (2009)

In order to apply formal methods in practice, the practitioner has to comprehend a vast amount of research literature and realistically evaluate practical merits of different approaches. In this paper we focus on explicit finite state model checking and study this area from practitioner's point of view. We provide a systematic overview of techniques for fighting state space explosion and we analyse trends in the research. We also report on our own experience with practical performance of techniques. Our main conclusion and recommendation for practitioner is the following: be critical to claims of dramatic improvement brought by a single sophisticated technique, rather use many different simple techniques and combine them.
Research on the Integration Techniques of Task-Oriented Geospatial Information Service for Battlefield
Authors: Zhe Gan, Xiaoan Tang, Yaomin Yang, Haiyan Yang, Maoyin Sun
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In order to make a military system more practicable, dynamic and scalable, task-oriented geospatial information service for battlefield (BGIS)need to be established. Information Integration is important means and essential precondition of BGIS construction, so BGIS was researched on from three aspects: service mode integration, service data integration and service process integration. A muti-mode uniform architecture was proposed, and it can support conventional operational mode and urgent operational mode; through the analysis of task-oriented geospatial data integration features for battlefield, a task-oriented data integration framework of BGIS was set up; the meaning of service composition of BGIS was expounded, then a new meta-model of service composition flow of BGIS was proposed. Finally, a prototype system was realized to validate correctness and feasibility of the theory and method initially.
OMS-J: an opinion mining system for Japanese Weblog reviews using a combination of supervised and unsupervised approaches
Authors: Guangwei Wang, Kenji Araki
Venue: Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations on XX (2007)

We introduce a simple opinion mining system for analyzing Japanese Weblog reviews called OMS-J. OMS-J is designed to provide an intuitive visual GUI of opinion mining graphs for a comparison of different products of the same type to help a user make a quick purchase decision. We first use an opinion mining method using a combination of supervised (a Naive Bayes Classifier) and unsupervised (an improved SO-PMI: Semantic Orientation Using Pointwise Mutual Information) learning.
Lot sizing and sequencing optimisation at an animal-feed plant
Authors: Eli A. V. Toso, Reinaldo Morabito, Alistair R. Clark
Venue: Computers and Industrial Engineering (2009)

This paper studies a challenging case of joint lot sizing and scheduling in a manufacturing plant for animal feed compounds. A key characteristic of this industry is that certain products can perform a production line ''cleaning'' function if a sufficiently large lot is produced between two products that would otherwise require a cleaning setup. Thus the sequence-dependent setup times do not always obey the triangular inequality. A mixed integer programming model is applied and tested on multiple sets of real data from different seasons. The model takes too long to solve exactly and so alternative formulations and methods are developed to solve the model more quickly, based on two variants of the Relax and Fix heuristic. Test results demonstrate that the formulations are computationally effective and able to take economic advantage of the intermediate cleaning products. The model schedule substantially improves on that practiced at the plant and can be useful for similar companies in the animal-feed industry.
Efficiency Enhancement of Protein Folding for Complete Molecular Simulation via Hardware Computing
Authors: Wen-Tsai Sung
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Accelerating a protein folding by implementing it in a reconfigurable field programmable gate array (FPGA) is described. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular biology: the protein folding problem. This paper employed VMD tool and force field simulation theorem based on FPGA for protein folding solution. This technique consists of two components: finished protein folding process and found out active sites for drug docking. The goal of protein folding simulation is to search the global energy minimum location with stability state and the when the protein is finished the folding task, we can find out the active sites for pre-process of ligand protein docking. An efficient hardware-based approach was devised to achieve a significant reduction of the search space of possible foldings. Several simulations were done to evaluate the performance of the system as well as the demand for FPGA’s resources.
Towards deeper understanding and personalisation in CALL
Authors: Galia Angelova, Albena Strupchanska, Ognyan Kalaydjiev, Milena Yankova, Svetla Boytcheva, Irena Vitanova, Preslav Nakov
Venue: Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning (2004)

We consider in depth the semantic analysis in learning systems as well as some information retrieval techniques applied for measuring the document similarity in eLearning. These results are obtained in a CALL project, which ended by extensive user evaluation. After several years spent in the development of CALL modules and prototypes, we think that much closer cooperation with real teaching experts is necessary, to find the proper learning niches and suitable wrappings of the language technologies, which could give birth to useful eLearning solutions.
Autogeneration of Database Applications from XML Metadata for Web-Based Data Entry
Authors: Kexiao Liao, Peter Kisuule, John Ehrlinger, Jie Dai
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In a biomedical research environment, there is frequently a need for dynamically generated web interfaces for patient-related data that can easily accommodate changes in the underlying data model by altering metadata rather than changing the interface code. In this paper, we present AutoGen, a tool developed at the Heart and Vascular Institute(HVI) of Cleveland Clinic for autogenerating the database schema and data-entry-specific web front end from XML metadata. To specify metadata, we established a tested and proven methodology for systematically capturing data and data entry requirements and encapsulating them into standard XML schema. During the development process, we created a successful approach to incorporating Model-View-Controller and Template technologies for implementing and optimizing AutoGen. Additionally, we conducted a cost–benefit analysis of AutoGen during its first 20 months of use within HVI. Results from both the development perspective and practical usage show that AutoGen and its associated metadata specification method provide a unique approach that can efficiently and effectively address the data entry needs of similar biomedical research environments.