66 research outputs found
Application of extended numerical approximation of fractional order derivatives in adaptive control
In a novel branch of soft computing developed in the past few years the desired and the expected response of the system is mapped to each other. In the case of mechanical systems the compared values are the second time-derivatives of the joint coordinates for the estimation of which certain finite element approximations are used in a digital control. This may result in a kind of noise and estimation sensivity. In the present paper these integer order derivatives are replaced by discrete numerical estimations of fractional order derivatives near the order of two to make the control more stable and accurate. For this purpose Caputo's form is considered the numerical approximation of which can be extended over the limits of the original definition. In this view differentiation seems to be an operation with some time-invariant Green function. Simulation results obtaind for the adaptive control of an inaccurately modeled electromechanical system containing an unmodeled and undriven internal degree of freedom illustrate that the quality of the control can be improved if the order of derivation in the signals used for comparison are increased form 2 to 2.25.info:eu-repo/semantics/publishedVersio
A Comprehensive Benchmark of Kernel Methods to Extract Protein–Protein Interactions from Literature
The most important way of conveying new findings in biomedical research is scientific publication. Extraction of protein–protein interactions (PPIs) reported in scientific publications is one of the core topics of text mining in the life sciences. Recently, a new class of such methods has been proposed - convolution kernels that identify PPIs using deep parses of sentences. However, comparing published results of different PPI extraction methods is impossible due to the use of different evaluation corpora, different evaluation metrics, different tuning procedures, etc. In this paper, we study whether the reported performance metrics are robust across different corpora and learning settings and whether the use of deep parsing actually leads to an increase in extraction quality. Our ultimate goal is to identify the one method that performs best in real-life scenarios, where information extraction is performed on unseen text and not on specifically prepared evaluation data. We performed a comprehensive benchmarking of nine different methods for PPI extraction that use convolution kernels on rich linguistic information. Methods were evaluated on five different public corpora using cross-validation, cross-learning, and cross-corpus evaluation. Our study confirms that kernels using dependency trees generally outperform kernels based on syntax trees. However, our study also shows that only the best kernel methods can compete with a simple rule-based approach when the evaluation prevents information leakage between training and test corpora. Our results further reveal that the F-score of many approaches drops significantly if no corpus-specific parameter optimization is applied and that methods reaching a good AUC score often perform much worse in terms of F-score. We conclude that for most kernels no sensible estimation of PPI extraction performance on new text is possible, given the current heterogeneity in evaluation data. Nevertheless, our study shows that three kernels are clearly superior to the other methods
Integrated Bio-Entity Network: A System for Biological Knowledge Discovery
A significant part of our biological knowledge is centered on relationships between biological entities (bio-entities) such as proteins, genes, small molecules, pathways, gene ontology (GO) terms and diseases. Accumulated at an increasing speed, the information on bio-entity relationships is archived in different forms at scattered places. Most of such information is buried in scientific literature as unstructured text. Organizing heterogeneous information in a structured form not only facilitates study of biological systems using integrative approaches, but also allows discovery of new knowledge in an automatic and systematic way. In this study, we performed a large scale integration of bio-entity relationship information from both databases containing manually annotated, structured information and automatic information extraction of unstructured text in scientific literature. The relationship information we integrated in this study includes protein–protein interactions, protein/gene regulations, protein–small molecule interactions, protein–GO relationships, protein–pathway relationships, and pathway–disease relationships. The relationship information is organized in a graph data structure, named integrated bio-entity network (IBN), where the vertices are the bio-entities and edges represent their relationships. Under this framework, graph theoretic algorithms can be designed to perform various knowledge discovery tasks. We designed breadth-first search with pruning (BFSP) and most probable path (MPP) algorithms to automatically generate hypotheses—the indirect relationships with high probabilities in the network. We show that IBN can be used to generate plausible hypotheses, which not only help to better understand the complex interactions in biological systems, but also provide guidance for experimental designs
Overview of the ID, EPI and REL tasks of BioNLP Shared Task 2011
We present the preparation, resources, results and analysis of three tasks of the BioNLP Shared Task 2011: the main tasks on Infectious Diseases (ID) and Epigenetics and Post-translational Modifications (EPI), and the supporting task on Entity Relations (REL). The two main tasks represent extensions of the event extraction model introduced in the BioNLP Shared Task 2009 (ST'09) to two new areas of biomedical scientific literature, each motivated by the needs of specific biocuration tasks. The ID task concerns the molecular mechanisms of infection, virulence and resistance, focusing in particular on the functions of a class of signaling systems that are ubiquitous in bacteria. The EPI task is dedicated to the extraction of statements regarding chemical modifications of DNA and proteins, with particular emphasis on changes relating to the epigenetic control of gene expression. By contrast to these two application-oriented main tasks, the REL task seeks to support extraction in general by separating challenges relating to part-of relations into a subproblem that can be addressed by independent systems. Seven groups participated in each of the two main tasks and four groups in the supporting task. The participating systems indicated advances in the capability of event extraction methods and demonstrated generalization in many aspects: from abstracts to full texts, from previously considered subdomains to new ones, and from the ST'09 extraction targets to other entities and events. The highest performance achieved in the supporting task REL, 58% F-score, is broadly comparable with levels reported for other relation extraction tasks. For the ID task, the highest-performing system achieved 56% F-score, comparable to the state-of-the-art performance at the established ST'09 task. In the EPI task, the best result was 53% F-score for the full set of extraction targets and 69% F-score for a reduced set of core extraction targets, approaching a level of performance sufficient for user-facing applications. In this study, we extend on previously reported results and perform further analyses of the outputs of the participating systems. We place specific emphasis on aspects of system performance relating to real-world applicability, considering alternate evaluation metrics and performing additional manual analysis of system outputs. We further demonstrate that the strengths of extraction systems can be combined to improve on the performance achieved by any system in isolation. The manually annotated corpora, supporting resources, and evaluation tools for all tasks are available from http://www.bionlp-st.org and the tasks continue as open challenges for all interested parties
Who cares? Practical ethics and the problem of underage users on social networking sites
The Interaction Network Ontology-supported modeling and mining of complex interactions represented with multiple keywords in biomedical literature
Approximation Capability of TP model forms
The tensor product (TP) based models have been applied widely in approximation theory, and approximation techniques. Recently, a controller design framework working on dynamic systems has also been established based on TP model transformation combined with Linear Matrix Inequalities (LMI) within Parallel Distributed Compensation (PDC) framework. The effectiveness of the control design framework strongly depends on the approximation property of the TP model used. Therefore, the primary aim of this paper is to investigate the approximation capabilities of dynamic TP model. It is shown that the set of functions that can be approximated arbitrarily well by TP forms with bounded number of components lies no-where dense, i.e. "almost discretely" in the set of continuous functions. Consequently, this paper points out that in a class of control problems this drawback necessitates the application of trade-off techniques between accuracy and complexity of TP form. Such requirements are very difficult to consider in the analytical framework, but TP model transformation offers an easy way to deal with them
- …