检索结果-南通市图书馆

Osteoporotic Vertebral Fracture Classification in X-rays Based on a Multi-modal Semantic Consistency Network

在线全文

学校读者我要写书评

暂无评论

Journal of Bionic engineering 2022年第6期19卷 1816-1829页

作者： Yuzhao Wang Tian Bai Tong Li Lan Huang College of Computer Science and Technology Jilin UniversityChangchun130012China Key laboratory of symbolic computation and knowledge engineering of Ministry of Education Jilin UniversityChangchun130012China Department of Orthopedics The Second Hospital of Jilin UniversityChangchun130012China

Osteoporotic Vertebral Fracture(OVFs)is a common lumbar spine disorder that severely affects the health of *** a clear bone blocks boundary,CT images have gained obvious advantages in OVFs *** with CT images,X-rays are faster and more inexpensive but often leads to misdiagnosis and miss-diagnosis because of the overlapping *** how to transfer CT imaging advantages to achieve OVFs classification in X-rays is *** this purpose,we propose a multi-modal semantic consistency network which could do well X-ray OVFs classification by transferring CT semantic consistency *** from existing methods,we introduce a feature-level mix-up module to get the domain soft labels which helps the network reduce the domain offsets between CT and *** the meanwhile,the network uses a self-rotation pretext task on both CT and X-ray domains to enhance learning the high-level semantic invariant *** employ five evaluation metrics to compare the proposed method with the state-of-the-art *** final results show that our method improves the best value of AUC from 86.32 to 92.16%.The results indicate that multi-modal semantic consistency method could use CT imaging features to improve osteoporotic vertebral fracture classification in X-rays effectively.

关键词： Osteoporotic vertebral fracture classification Cross-modality Unsupervised domain adaptation Transfer learning Convolutional neural network Computer-aided diagnosis

Massively parallel algorithms for fully dynamic all-pairs shortest paths

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

Strengthened Initialization of Adaptive Cross-Generation Differential Evolution

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in engineering & Sciences 2022年第3期130卷 1495-1516页

作者： Wei Wan Gaige Wang Junyu Dong Department of Computer Science of Technology Ocean University of ChinaQingdao266100China Key laboratory of symbolic computation and knowledge engineering of Ministry of Education Jilin UniversityChangchun130012China Guangxi Key laboratory of Hybrid computation and IC Design Analysis Guangxi University for NationalitiesNanning530006China

Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest *** order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant *** this paper,an enhanced version is proposed,namely *** incorporates a strengthened initialization strategy and optimized parameters in contrast to its *** improvements make the direction of crossgeneration mutation more clearly and the ability of searching more *** experiments show that the new algorithm has better diversity and improves convergence to a certain *** the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.

关键词： Differential Evolution(DE) multi-objective optimization(MO) opposition-based learning parameter adaptation

A Two-Dimensional Improvement for Farr-Gao Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2016年第5期29卷 1382-1399页

作者： DONG Tian School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University

Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gr?bner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. This paper presents a two-dimensional improvement for it that employs a preprocessing strategy for computing reduced Gr?bner bases associated with tower subsets of given point sets. Experimental results show that the preprocessed Farr-Gao algorithm is more efficient than the classical one.

关键词： Grobner basis GrSbner escalier Newton interpolation basis tower set vanishing ideal.

The Equivalent Representation of the Breadth-One D-Invariant Polynomial Subspace and Its Discretization

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2016年第5期29卷 1436-1445页

作者： JIANG Xue ZHANG Shugong Institute of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University

This paper demonstrates the equivalence of two classes of D-invariant polynomial subspaces, i.e., these two classes of subspaces are different representations of the breadth-one D-invariant subspace. Moreover, the authors solve the discrete approximation problem in ideal interpolation for the breadth-one D-invariant subspace. Namely, the authors find the points, such that the limiting space of the evaluation functionals at these points is the functional space induced by the given D-invariant subspace, as the evaluation points all coalesce at one point.

关键词：宽度一个 D 不变的多项式 subspace 分离近似问题理想的插值

An embedded vertical‐federated feature selection algorithm based on particle swarm optimisation

在线全文

学校读者我要写书评

暂无评论

CAAI Transactions on Intelligence Technology 2023年第3期8卷 734-754页

作者： Yong Zhang Ying Hu Xiaozhi Gao Dunwei Gong Yinan Guo Kaizhou Gao Wanqiu Zhang School of Information and Control engineering China University of Mining and TechnologyXuzhouChina The Key laboratory of symbolic computation and knowledge engineering of Ministry of Education Jilin UniversityChangchunChina School of Computing University of Eastern FinlandKuopioFinland The Macao Institute of Systems engineering Macao University of Science and TechnologyTaipaChina

In real life,a large amount of data describing the same learning task may be stored in different institutions(called participants),and these data cannot be shared among par-ticipants due to privacy *** case that different attributes/features of the same instance are stored in different institutions is called vertically distributed *** pur-pose of vertical‐federated feature selection(FS)is to reduce the feature dimension of vertical distributed data jointly without sharing local original data so that the feature subset obtained has the same or better performance as the original feature *** solve this problem,in the paper,an embedded vertical‐federated FS algorithm based on particle swarm optimisation(PSO‐EVFFS)is proposed by incorporating evolutionary FS into the SecureBoost framework for the first *** optimising both hyper‐parameters of the XGBoost model and feature subsets,PSO‐EVFFS can obtain a feature subset,which makes the XGBoost model more *** the same time,since different participants only share insensitive parameters such as model loss function,PSO‐EVFFS can effec-tively ensure the privacy of participants'***,an ensemble ranking strategy of feature importance based on the XGBoost tree model is developed to effectively remove irrelevant features on each ***,the proposed algorithm is applied to 10 test datasets and compared with three typical vertical‐federated learning frameworks and two variants of the proposed algorithm with different initialisation ***-mental results show that the proposed algorithm can significantly improve the classifi-cation performance of selected feature subsets while fully protecting the data privacy of all participants.

关键词： Evolutionary optimization feature selection privacy protection vertical‐federated learning

SMRI: A New Method for siRNA Design for COVID-19 Therapy

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第4期37卷 991-1002页

作者：陈梦欣朱晓冬张浩刘震刘元宁 College of Software Jilin UniversityChangchun 130012China Key laboratory of symbolic computation and knowledge engineering of the Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Graduate School of engineering Nagasaki Institute of Applied ScienceNagasaki 851-0193Japan

First discovered in Wuhan, China, SARS-CoV-2 is a highly pathogenic novel coronavirus, which rapidly spreads globally and becomes a pandemic with no vaccine and limited distinctive clinical drugs available till March 13th, 2020. Ribonucleic Acid interference (RNAi) technology, a gene-silencing technology that targets mRNA, can cause damage to RNA viruses effectively. Here, we report a new efficient small interfering RNA (siRNA) design method named Simple Multiple Rules Intelligent Method (SMRI) to propose a new solution of the treatment of COVID-19. To be specific, this study proposes a new model named Base Preference and Thermodynamic Characteristic model (BPTC model) indicating the siRNA silencing efficiency and a new index named siRNA Extended Rules index (SER index) based on the BPTC model to screen high-efficiency siRNAs and filter out the siRNAs that are difficult to take effect or synthesize as a part of the SMRI method, which is more robust and efficient than the traditional statistical indicators under the same circumstances. Besides, to silence the spike protein of SARS-CoV-2 to invade cells, this study further puts forward the SMRI method to search candidate high-efficiency siRNAs on SARS-CoV-2's S gene. This study is one of the early studies applying RNAi therapy to the COVID-19 treatment. According to the analysis, the average value of predicted interference efficiency of the candidate siRNAs designed by the SMRI method is comparable to that of the mainstream siRNA design algorithms. Moreover, the SMRI method ensures that the designed siRNAs have more than three base mismatches with human genes, thus avoiding silencing normal human genes. This is not considered by other mainstream methods, thereby the five candidate high-efficiency siRNAs which are easy to take effect or synthesize and much safer for human body are obtained by our SMRI method, which provide a new safer, small dosage and long efficacy solution for the treatment of COVID-19.

关键词： COVID-19 SARS-CoV-2 RibonucleicAcid interference

FlexPDA:A Flexible Programming Framework for Deep Learning Accelerators

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第5期37卷 1200-1220页

作者：刘磊马秀刘华虓李广力刘雷 College of Computer Science and Technology Jilin UniversityChangchunChina Key laboratory of symbolic computation and knowledge engineering of Ministry of Education Jilin UniversityChangchunChina State Key laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijingChina University of Chinese Academy of Sciences BeijingChina

There are a wide variety of intelligence accelerators with promising performance and energy efficiency,deployed in a broad range of applications such as computer vision and speech ***,programming productivity hinders the deployment of deep learning *** low-level library invoked in the high-level deep learning framework which supports the end-to-end execution with a given model,is designed to reduce the programming burden on the intelligence ***,it is inflexible for developers to build a network model for every deep learning application,which probably brings unnecessary repetitive *** this paper,a flexible and efficient programming framework for deep learning accelerators,FlexPDA,is proposed,which provides more optimization opportunities than the low-level library and realizes quick transplantation of applications to intelligence accelerators for fast *** evaluate FlexPDA by using 10 representative operators selected from deep learning algorithms and an end-to-end *** experimental results validate the effectiveness of FlexPDA,which achieves an end-to-end performance improvement of 1.620x over the low-level library.

关键词： deep learning accelerator programming framework domain-specific language

Supervised topic models with weighted words:multi-label document classification

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic engineering 2018年第4期19卷 513-523页

作者： Yue-peng ZOU Ji-hong OUYANG Xi-ming LI College of Computer Science and Technology Jilin University MOE Key laboratory of symbolic computation and knowledge engineering Jilin University

Supervised topic modeling algorithms have been successfully applied to multi-label document classification *** models include labeled latent Dirichlet allocation(L-LDA)and ***,these models neglect the class frequency information of words(i.e.,the number of classes where a word has occurred in the training data),which is significant for *** address this,we propose a method,namely the class frequency weight(CF-weight),to weight words by considering the class frequency *** CF-weight is based on the intuition that a word with higher(lower)class frequency will be less(more)*** this study,the CF-weight is used to improve L-LDA and dependency-LDA.A number of experiments have been conducted on real-world multi-label *** results demonstrate that CF-weight based algorithms are competitive with the existing supervised topic models.

关键词： Supervised topic model Multi-label classification Class frequency labeled latent Dirichlet allocation (L-LDA) Dependency-LDA