检索结果-内蒙古大学图书馆

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Qiu, Yanlong Wang, Siqi Yang, Xi Qiu, Xinyuan Wu, Chengkun Cui, Yingbo Yang, Canqun National University of Defense Technology Institute for Quantum Information State Key Laboratory of High-Performance Computing College of Computer Science Hunan Changsha410073 China National Supercomputer Center in Tianjin Tianjin300457 China National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Hunan Changsha410073 China National University of Defense Technology Department of Biology and Chemistry College of Science Hunan Changsha410073 China

ISBN: (纸本)9798350337488

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词： Drug-Protein Interaction Knowledge Graph Embedding Triple Embedding Weakly Supervised Learning

来源：评论

学校读者我要写书评

暂无评论

Quasi-newton waveform iteration for partitioned fluid-structure interaction

arXiv

引用

arXiv 2020年

作者： Ruth, Benjamin Uekermann, Benjamin Mehl, Miriam Birken, Philipp Monge, Azahar Bungartz, Hans-Joachim Department of Informatics Technical University of Munich Germany Germany Department of Mechanical Engineering Einhoven University of Technology Netherlands Institute for Parallel and Distributed Systems University of Stuttgart Germany Centre for the Mathematical Sciences Lund University Sweden

We present novel coupling schemes for partitioned multi-physics simulation that combine four important aspects for strongly coupled problems: Implicit coupling per time step, fast and robust acceleration of the corresponding iterative coupling, support for multi-rate time stepping, and higherorder convergence in time. To achieve this, we combine waveform relaxation - a known method to achieve higher order in applications with split time stepping based on continuous representations of coupling variables in time - with interface quasi-Newton coupling, which has been developed throughout the last decade and is generally accepted as a very robust iterative coupling method even for gluing together black-box simulation codes. We show convergence results (in terms of convergence of the iterative solver and in terms of approximation order in time) for two academic test cases - a heat transfer scenario and a fluid-structure interaction simulation. We show that we achieve the expected approximation order and that our iterative method is competitive in terms of iteration counts with those designed for simpler first-order-in-time coupling. Copyright © 2020, The Authors. All rights reserved.

关键词： Fluid structure interaction

来源：评论

学校读者我要写书评

暂无评论

Unsupervised extraction of false friends from parallel bi-texts using the Web as a corpus

Unsupervised extraction of false friends from parallel bi-te...

引用

International Conference on Recent Advances in Natural Language Processing, RANLP-2009

作者： Nakov, Svetlin Nakov, Preslav Paskaleva, Elena Department of Mathematics and Informatics Sofia University St Kliment Ohridski 5 James Bourchier Blvd. 1164 Sofia Bulgaria Linguistic Modeling Department Institute for Parallel Processing Bulgarian Academy of Sciences 25A Acad. G. Bonchev St. 1113 Sofia Bulgaria Department of Computer Science National University of Singapore 13 Computing Drive Singapore 117417 Singapore

False friends are pairs of words in two languages that are perceived as similar, but have different meanings, e.g., Gift in German means poison in English. In this paper, we present several unsupervised algorithms for acquiring such pairs from a sentence-aligned bi-text. First, we try different ways of exploiting simple statistics about monolingual word occurrences and cross-lingual word co-occurrences in the bi-text. Second, using methods from statistical machine translation, we induce word alignments in an unsupervised way, from which we estimate lexical translation probabilities, which we use to measure cross-lingual semantic similarity. Third, we experiment with a semantic similarity measure that uses the Web as a corpus to extract local contexts from text snippets returned by a search engine, and a bilingual glossary of known word translation pairs, used as "bridges". Finally, all measures are combined and applied to the task of identifying likely false friends. The evaluation for Russian and Bulgarian shows a significant improvement over previously-proposed algorithms.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Improvements towards formalizing UML state diagrams in CSP

Improvements towards formalizing UML state diagrams in CSP

引用

Asia-Pacific Conference on Software Engineering

作者： W.L. Yeung K.R.P.H. Leung Ji Wang Wei Dong Department of Computing and Decision Sciences Lingnan University Hong Kong China Department of Information & Hong Kong Institute of Vocational Education Hong Kong Institute of Vocational Education Hong Kong China National Laboratory for Parallel and Distributed Processing PDL Hunan China

The Unified Modelling Language (UML) includes a variant of state charts, called state diagrams (SD), for modelling systems with complex interactive behaviour. The official definition of UML specifies the abstract syntax of state diagrams without any formal semantics and hence is unable to perform formal system behaviour analysis. Various attempts have been made to provide such a formal basis for UML state diagrams. Among different attempts, the work reported in [Muan Yong Ng et al. (2003)] is formalizing SD in terms of communicating sequential processes (CSP). In this paper, we present some improvements upon the formalization. The improvements help clarify the semantics of UML SD and make the formalization more complete. Furthermore, we illustrate the use of CSP in reasoning about the equivalence of state diagrams and discuss the benefits of the formalization.

关键词： Unified modeling language Encapsulation Communications technology Laboratories distributed processing Performance analysis Equations Formal languages Application software Software engineering

来源：评论

学校读者我要写书评

暂无评论

On the parallels between Paxos and Raft, and how to port optimizations (Extended Version)

arXiv

引用

arXiv 2019年

作者： Wang, Zhaoguo Zhao, Changgeng Mu, Shuai Chen, Haibo Li, Jinyang Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Department of Computer Science New York University Department of Computer Science Stony Brook University

In recent years, Raft has overtaken Paxos as the consensus algorithm of choice. [53] While many have pointed out similarities between the two protocols, no one has formally mapped out their relationships. In this paper, we show how Raft and Paxos are formally related despite their surface differences. Based on the formal mapping between the two protocols, we show how to automatically port a certain class of optimizations from Paxos to Raft with guaranteed correctness. As case studies, we port and evaluate two optimizations, Mencius and Paxos Quorum Lease to Raft. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A science gateway getting ready for serving the international molecular simulation community 2

A science gateway getting ready for serving the internationa...

引用

2012 EGI Community Forum / EMI 2nd Technical Conference, EGICF-EMITC 2012

作者： Gesing, Sandra Herres-Pawlis, Sonja Birkenheuer, Georg Brinkmann, André Grunzke, Richard Kacsuk, Peter Kohlbacher, Oliver Kozlovszky, Miklos Krüger, Jens Müller-Pfefferkorn, Ralph Schäfer, Patrick Steinke, Thomas Center for Bioinformatics Department of Computer Science University of Tübingen Sand 14 Tübingen72076 Germany Department of Chemistry Ludwig-Maximilians-University Munich Butenandtstr. 5-13 München81377 Germany Paderborn Center for Parallel Computing University of Paderborn Warburger Str. 100 Paderborn33089 Germany Johannes Gutenberg-University Mainz Mainz55099 Germany Center for Information Services and High Performance Computing Technische Universität Dresden Zellescher Weg 12-14 Germany Laboratory of Parallel and Distributed Systems MTA SZTAKI Kende Street 13-17 Budapest1111 Hungary Zuse Institute Berlin Takustraße 7 Berlin14195 Germany

The project MoSGrid (Molecular Simulation Grid) has been developing a web-based science gateway supporting the community with various services for quantum chemistry, molecular modeling, and docking. Users gain access to distributed computing infrastructures (DCIs) via intuitive user interfaces for sophisticated tools, specialized workflows, and distributed repositories. Currently, the MoSGrid community consists of about 120 users from a number of fields related to chemistry and bioinformatics located in Germany. However, the underlying security infrastructure is generally applicable and can be deployed in arbitrary projects. MoSGrid intends to address the international community by participating in the EU-projects SCI-BUS (Scientific gateway Based User Support) and ER-flow (Building an European Research Community through Interoperable Workflows and Data), and collaborating with the EU-project EDGI (European Desktop Grid Initiative). © Copyright owned by the author(s) under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike Licence.

关键词： Quantum chemistry

来源：评论

学校读者我要写书评

暂无评论

Generalized matrix multiplication and its object oriented model

引用

Scalable computing 2014年第2期15卷 187-200页

作者： Ganzha, Maria Paprzycki, Marcin Sedukhin, Stanislav G. Systems Research Institute Polish Academy of Sciences Warsaw and Institute of Informatics University of Gdańsk Gdańsk Poland Systems Research Institute Polish Academy of Sciences Warsaw and Department of Management and Technical Sciences Warsaw Management Academy Warsaw Poland Distributed Parallel Processing Laboratory The University of Aizu Aizuwakamatsu City Fukushima 965-8580 Japan

Since the beginning of the 21st century, we observe rapid changes in the area of, broadly understood, computational sciences. One of interesting effects of these changes is the need for reevaluation of the role of dense matrix multiplication. The aim of this paper is two-fold. First, to summarize developments that point toward a need for reconsidering usefulness of matrix multiplication generalized on the basis of the theory of algebraic semirings. Second, to propose generalized matrix-matrix multiply-and-update (MMU) operation and its object oriented model. © 2014 SCPE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Semantic integration for model-based life science applications

Semantic integration for model-based life science applicatio...

引用

3rd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2013

作者： Gubala, Tomasz Prymula, Katarzyna Nowakowski, Piotr Bubak, Marian Distributed Computing Environments Team Academic Computer Centre Cyfronet AGH Nawojki 11 30-950 Krakow Poland AGH University of Science and Technology Department of Computer Science Mickiewicza 30 30-059 Krakow Poland Department of Bioinformatics and Telemedicine Medical College Jagiellonian University Sw. lazarza 16 31-530 Krakow Poland Informatics Institute University of Amsterdam Science Park 904 1098 XH Amsterdam Netherlands

ISBN: (纸本)9789898565693

When delivering tools and solutions for modern e-Science applications, the proper transfer of domain knowledge into information models is a crucial design step. In this work we describe the Semantic Integration approach to modeling and transcribing complex science domain knowledge into well-structured information models based on semantics. Apart from a conceptual study and presentation of related work, we also describe how we applied the methodology to deliver a real-life solution for simulation of locations of active binding sites in proteins - an important problem in bioinformatics. Our goal is to show how the Semantic Integration technology can help deliver ready-to-use solutions for scientists.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

Improving unsupervised domain adaptation by reducing bi-level feature redundancy

arXiv

引用

arXiv 2020年

作者： Wang, Mengzhu Zhang, Xiang Lan, Long Wang, Wei Tan, Huibin Luo, Zhigang Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China Institute for Quantum State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China DUT-RU International School of Information Science & Engineering Dalian University of Technology DalianLiaoning116000 China Department of Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignore this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific features with a transferable decorrelated normalization module, which preserves specific domain information whilst easing the side effect of feature redundancy on the sequel domain-invariance. In the second level, domain-invariant feature redundancy caused by domain-shared representation is further mitigated via an alternative brand orthogonality for better generalization. These two novel aspects can be easily plugged into any BN-based backbone neural networks. Specifically, simply applying them to ResNet50 has achieved competitive performance to the state-of-the-arts on five popular benchmarks. Our code will be available at https://***/dreamkily/gUDA. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Auction-Based Job Scheduling for Smart Manufacturing

Auction-Based Job Scheduling for Smart Manufacturing

引用

International Symposium on Applied Computational Intelligence and informatics ( SACI)

作者： Emil Gatial Zoltán Balogh Sepideh Hassankhani Dolatabadi Hatem Ghorbel Stefano Carrino Jonathan Dreyer Vicente Rodríguez Montequín Adrian Gligor Laszlo Barna Iantovics Parallel and distributed computing Institute of Informatics SAV Bratislava Slovakia Modelling and Control of Discrete Processes Institute of Informatics SAV Bratislava Slovakia Haute École Arc Ingénierie HES-SO St-Imier Switzerland Project Engineering Area University of Oviedo Oviedo Spain Electrical Engineering and Information Technology “George Emil Palade” University of Medicine Pharmacy Science and Technology of Targu Mures Targu Mures Romania

The paper describes a real-time job scheduling method designed for production of goods with different characteristics on machines with different processing parameters. The objective is to maximize the global reward of the factory as a sum of the rewards for each machine job. Traditionally, the task assignment problems deal with the assignment of m-tasks to n-agents and are calculated by analytical methods or heuristics. The proposed method is based on online auctions that distributes the tasks to the machines using the software agents. The method is implemented using the ERTS (Erlang Real-Time System) that allows adopting the features of fault-tolerance and real-time processing. The paper starts with introduction and review of related state-of-the-art. The following chapter briefly describes the problem and the specific requirements. The following chapter describes the software architecture of the online auction system, the use-case and the motivation for developing this method. The proposed method auction-based task assignment and its implementation are described in the next chapters. At the end of the work, the results of the method are presented in comparison with the optimal solution and the performance characteristics are also described. In the conclusion, possible advances and future work are proposed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：