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

A Method for Extracting Electronic Medical Record Entities by Fusing Multichannel Self-Attention Mechanism with Location Relationship Features 9th

A Method for Extracting Electronic Medical Record Entities b...

引用

9th International Conference of Pioneering Computer Scientists, Engineers and Educators, ICPCSEE 2023

作者： Xu, Hongyan Wang, Hong Feng, Yong Wang, Rongbing Zhang, Yonggang College of Information Liaoning University Shenyang110036 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9789819959709

With the implementation of the "Internet+" strategy, electronic medical records are generally applied in the medical field. Deep mining of electronic medical record content data is an effective means to obtain medical knowledge and analyse patients’ states, but the existing methods for extracting entities from electronic medical records have problems of redundant information, overlapping entities, and low accuracy rates. Therefore, this paper proposes an entity extraction method for electronic medical records based on the network framework of BERT-BiLSTM, which incorporates a multichannel self-attention mechanism and location relationship features. First, the text input sequence was encoded using the BERT-BiLSTM network framework, and the global semantic information of the sentence was mined more deeply using the multichannel self-attention mechanism. Then, the position relation characteristic was used to extract the local semantic message of the text, and the position relation characteristic of the word and the position embedding matrix of the whole sentence were obtained. Next, the extracted global semantic information was stitched with the positional embedding matrix of the sentence to obtain the current entity classification matrix. Finally, the proposed method was validated on the dataset of Chinese medical text entity relationship extraction and the 2010i2b2/VA relationship corpus, and the experimental results indicate that the proposed method surpasses existing methods in terms of precision, recall, F1 value and training time. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

K-means on commodity GPUs with CUDA

K-means on commodity GPUs with CUDA

引用

2009 WRI World Congress on Computer Science and Information engineering, CSIE 2009

作者： Bai, Hong-Tao He, Li-Li Ouyang, Dan-Tong Li, Zhan-Shan Li, He College of Computer Science and Technology Jilin University 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University 130012 China

ISBN: (纸本)9780769535074

K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, while almost all of them are based on Single Instruction Single Data (SISD) architecture processors (CPUs), which partly ignored the inherent paralleled characteristic of the algorithms. In this paper, a novel Single Instruction Multiple Data (SIMD) architecture processors (GPUs) based k-means algorithm is proposed. In this algorithm, in order to accelerate compute-intensive portions of traditional k-means, both data objects assignment and k centroids recalculation are off-loaded to the GPU in parallel. We have implemented this GPU-based k-means on the newest generation GPU with Compute Unified Device Architecture (CUDA). The numerical experiments demonstrated that the speed of GPU-based k-means could reach as high as 40 times of the CPU-based k-means. © 2008 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A novel approach for modeling Direction Relations between Uncertain Regions

A novel approach for modeling Direction Relations between Un...

引用

2010 International Conference on Machine Vision and Human-Machine Interface, MVHI 2010

作者： Dong, Yiqun Liu, Dayou Wang, Fang Tian, Ye College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9780769540092

Conventional models based on crisp regions can not deal with the Direction Relations between Uncertain Regions (DRUR). Using broad boundary to represent the uncertain boundary, a novel approach is proposed based on model SK for modeling DRUR in this paper. DRUR are described as the combinations of basic cardinal direction relations, then we study the composition of DRUR, and a method is put forward for calculating this composition. © 2010 IEEE.

关键词： Board boundary Composition Direction relations Model SK Uncertain regions Plant uncertain Uncertainty Modeling Boundary

来源：评论

学校读者我要写书评

暂无评论

A new position updating algorithm for moving objects

A new position updating algorithm for moving objects

引用

First International Multi- Symposiums on Computer and computational Sciences, IMSCCS'06

作者： Xinying, Wang Shengsheng, Wang Zhengxuan, Wang Tianyang, Lv Xizhe, Zhang Key Laboratory of Symbolic Computing and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769525814

Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution efficiency, while ignore the fact that the communication cost is also the bottleneck for improving query efficiency. We propose an asynchronous updating algorithm for continuous queries of moving objects. Three types of continuous range queries are discussed in the paper. Theoretical analysis and experiment results show that our algorithm substantially outperforms the traditional synchronous updating algorithms at aspects of monitoring accuracy, communication cost and CPU load balance. © 2006 IEEE.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Mapping integrity constraint ontology to relational databases

引用

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 113-121页

作者： OUYANG Dan-tong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

Integrity constraint is a formula that checks whether all necessary information has been explicitly provided. It can be added into ontology to guarantee the data-centric application. In this paper,a set of constraint axioms called IC-mapping axioms are stated. Based on these axioms,a special ontology with integrity constraint,which is adapted to map ontology knowledge to data in relational databases,is defined. It＇s generated through our checking and modification. Making use of the traditional mapping approaches,it can be mapped to relational databases as a normal ontology. Unlike what in the past,a novel mapping approach named IC-based mapping is proposed in accordance with such special ontology. The detailed algorithm is put forward and compared with other existing approaches used in Semantic Web applications. The result shows that our method is advanced to the traditional approaches.

关键词： Semantic Web integrity constraint ontology relational database

来源：评论

学校读者我要写书评

暂无评论

A study on parallel semantics of constraint logic rograms

A study on parallel semantics of constraint logic rograms

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Sun, Ji.-Gui Zhang, Yong-Gang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China

ISBN: (纸本)078039092X

This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, it adopts the s-semantics approach, whose aim is to find notions of models which really capture the operational semantics. And it defines the program equivalence based on multiset answer constraint. Then it investigates the game semantics and proves that it is consistent with traditional operational semantics. On the basis of these two semantics, programmers can comprehend the programs deeply and develop more sound parallel constraint logic programming systems. Finally, it gives the conclusions and future work. © 2005 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Morphology Focused Cell Detection Model for Histopathology Images

A Morphology Focused Cell Detection Model for Histopathology...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Wang, Zhe Wei, Fangyue Guo, Shuyu Che, Xiaoting Bai, Tian Jilin University College of Computer Science and Technology Changchun China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9798350337488

The accurate automatic recognition of cell locations is of great significance for downstream tasks in pathology. Due to the various size and distribution of different cell types, previous cell detection methods applied fixed circles as labels to localize cell position by default, which makes less precise and more difficult to adapt various cell morphology. In this paper, we integrate adaptive areas of interests based on morphology to address the limitation in detecting cells with irregular shapes in pathological images. Moreover, a EGSI module is proposed to extract global distribution of cells in slices, which enables model to acquire more rich semantic information. We exhibit favorable F1 score of our method on four public datasets. Experimental results demonstrate that the proposed method could detect cells more accurately in those images with different cell morphologies and dense cell distribution. © 2023 IEEE.

关键词： cell detection cellular morphology digital pathology medical image analysis

来源：评论

学校读者我要写书评

暂无评论

Singleton arc consistency based on failure-first principle

Singleton arc consistency based on failure-first principle

引用

International Conference on Machine Learning and Cybernetics

作者： Li, Zhan-Shan Xing, Shi-Mei Yang, Feng-Jie Du, Hui-Ying Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China College of Computer Science and Technology Changchun 130012 China

ISBN: (纸本)9781424465262

Constraint satisfaction problems play a significant role in the field of Artificial Intelligence. Reducing the search space can improve the efficiency of solving the problems before the search of solutions. Applying in preprocessing step, arc consistency technique can remove some values which are arc inconsistent, so that it can reduce the search space. Using heuristic strategies can improve the efficiency of the algorithms. In this paper we propose a new singleton arc consistency algorithm based on failure-first principle, which improves the practical time efficiency through the earlier detection of variables which contain null values and removal of the values which are arc inconsistency during the preprocessing step. © 2010 IEEE.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Solving SAT problem with a revised hitting set algorithm

Solving SAT problem with a revised hitting set algorithm

引用

2010 2nd International Conference on Future Computer and Communication, ICFCC 2010

作者： Xu, Youjun Ouyang, Dantong Ye, Yuxin He, Jialiang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781424458226

The satisfiability(SAT) problem is a core problem of artificial intelligence. Research findings in SAT are widely used in many areas. The main methods solving SAT problem are resolution principle, tableau calculus and extension rule. Besides methods mentioned above, we find that the SAT problem can be solved with hitting set algorithms. If a set of clause is satisfiable, there must be a hitting set of the clause set which containing no complementary pairs of literals. Algorithm NEWHS-tree is an efficient hitting set algorithm proposed by Ouyang. RNHST proposed in this paper is a revised algorithm in respect of NEWHS-tree. It judges the satisfiability of a clause set by confirming the existence of the set's hitting set without complementary pairs of literals. The test result shows that RNHST is an efficient algorithm. ©2010 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Quasi-periodic Solutions of the General Nonlinear Beam Equations

引用

Communications in Mathematical Research 2012年第1期28卷 51-64页

作者： GAO YI-XIAN College of Mathematics and Statistics Northeast Normal University Changchun 130024 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012

In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊]  R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.

关键词： beam equation KAM theorem quasi-periodic solution partial Birkhoffnormal form

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：