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

arXiv 2020年

作者： He, Kelei Lian, Chunfeng Adeli, Ehsan Huo, Jing Shi, Yinghuan Gao, Yang Zhang, Bing Zhang, Junfeng Shen, Dinggang Medical School of Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Institute of Healthcare Data Science Nanjing University Nanjing China Department of Radiology Nanjing Drum Tower Hospital Nanjing University Medical School China Department of Radiology BRIC University of North Carolina Chapel HillNC United States Department of Brain and Cognitive Engineering Korea University Seoul Korea Republic of Department of Psychiatry and Behavioral Sciences Department of Computer Science Stanford University CA United States

Fully convolutional networks (FCN), including U-Net and V-Net, are widely-used network architecture for semantic segmentation in recent studies. However, conventional FCNs are typically trained by the cross-entropy or dice loss, in which the relationships among voxels are neglected. This often results in non-smooth neighborhoods in the output segmentation map. This problem becomes more serious in CT prostate segmentation as CT images are usually of low tissue contrast. To address this problem, we propose a two-stage framework. The first stage quickly localizes the prostate region. Then, the second stage precisely segments the prostate by a multi-task FCN-based on the U-Net architecture. We introduce a novel online voxel-triplet learning module through metric learning and voxel feature embeddings in the multi-task network. The proposed network has two branches guided by two tasks: 1) a segmentation sub-network aiming to generate prostate segmentations, and 2) a triplet learning sub-network aiming to improve the quality of the learned feature space supervised by a mixed of triplet and pair-wise loss function. The triplet learning sub-network samples triplets from the inter-mediate heatmap. Unlike conventional deep triplet learning methods that generate triplets before the training phase, our proposed voxel-triplets are sampled in an online manner and operates in an end-to-end fashion via multi-task learning. To evaluate the proposed method, we implement comprehensive experiments on a CT image dataset consisting of 339 patients. The ablation studies show that our method can effectively learn more representative voxel-level features compared with the conventional FCN network. And the comparisons show that the proposed method outperforms the state-of-the-art methods by a large margin. Copyright © 2020, The Authors. All rights reserved.

关键词： Urology

来源：评论

学校读者我要写书评

暂无评论

Enhancing Differential Evolution with Commensal Learning and Uniform Local Search

引用

Chinese Journal of Electronics 2017年第4期26卷 725-733页

作者： PENG Hu WU Zhijian DENG Changshou State Key Laboratory of Software Engineering School of Computer Wuhan University School of Information Science and Technology Jiujiang University

Differential evolution(DE) is a popular and powerful evolutionary algorithm for global optimization problems. However, the combination of mutation strategies and parameter settings of DE is problem dependent and choosing the suitable one is a challenge work and timeconsuming. In addition, the deficiency in local exploitation also has a significant influence on the performance of *** order to solve these problems, a DE variant with Commensal learning and uniform local search(CUDE) has been proposed in this paper. In CUDE, commensal learning is proposed to adaptively select optimal mutation strategy and parameter setting simultaneously under the same criteria. Moreover, uniform local search enhances exploitation ability. Comprehensive experiment results on all the CEC2013 test suite and comparison with the state-of-the-art DE variants indicate that the CUDE is very competitive.

关键词： Differential evolution Commensal learn ing Uniform local search Global optimization

来源：评论

学校读者我要写书评

暂无评论

AD-Link: An Adaptive Approach for User Identity Linkage

AD-Link: An Adaptive Approach for User Identity Linkage

引用

IEEE International Conference on Big Knowledge (ICBK)

作者： Xin Mu Wei Xie Roy Ka-Wei Lee Feida Zhu Ee-Peng Lim National Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Information Systems Singapore Management University Singapore Department of Computer Science University of Saskatchewan Saskatchewan Canada

User identity linkage (UIL) refers to linking accounts of the same user across different online social platforms. The state-of-the-art UIL methods usually perform account matching using user account's features derived from the profile attributes, content and relationships. They are however static and do not adapt well to fast-changing online social data due to: (a) new content and activities generated by users; as well as (b) new platform functions introduced to users. In particular, the importance of features used in UIL methods may change over time and new important user features may be introduced. In this paper, we proposed AD-Link, a new UIL method which (i) learns and assigns weights to the user features used for user identity linkage and (ii) handles new user features introduced by new user-generated data. We evaluated AD-Link on real-world datasets from three popular online social platforms, namely, Twitter, Facebook and Foursquare. The results show that AD-Link outperforms the state-of-the-art UIL methods.

关键词： Couplings Data models Social networking (online) Optimization Adaptation models Business Meteorology

来源：评论

学校读者我要写书评

暂无评论

Learning-based computer-aided prescription model for Parkinson’s disease: A data-driven perspective

arXiv

引用

arXiv 2020年

作者： Shi, Yinghuan Yang, Wanqi Thung, Kim-Han Wang, Hao Gao, Yang Pan, Yang Zhang, Li Shen, Dinggang State Key Laboratory for Novel Software Technology Nanjing University China National Institute of Healthcare Data Science Nanjing University China School of Computer Science Nanjing Normal University China Department of Radiology BRIC UNC Chapel Hill United States Inception Institute of Artificial Intelligence Korea Republic of Nanjing Medical University Nanjing Brain Hospital China Department of Research and Development Shanghai United Imaging Intelligence Co. Ltd. Shanghai China Department of Brain and Cognitive Engineering Korea University United Arab Emirates

In this paper, we study a novel problem: "automatic prescription recommendation for PD patients." To realize this goal, we first build a dataset by collecting 1) symptoms of PD patients, and 2) their prescription drug provided by neurologists. Then, we build a novel computer-aided prescription model by learning the relation between observed symptoms and prescription drug. Finally, for the new coming patients, we could recommend (predict) suitable prescription drug on their observed symptoms by our prescription model. From the methodology part, our proposed model, namely Prescription viA Learning lAtent Symptoms (PALAS), could recommend prescription using the multi-modality representation of the data. In PALAS, a latent symptom space is learned to better model the relationship between symptoms and prescription drug, as there is a large semantic gap between them. Moreover, we present an efficient alternating optimization method for PALAS. We evaluated our method using the data collected from 136 PD patients at Nanjing Brain Hospital, which can be regarded as a large dataset in PD research community. The experimental results demonstrate the effectiveness and clinical potential of our method in this recommendation task, if compared with other competing methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

AtlFast3: The Next Generation of Fast Simulation in ATLAS

引用

Computing and software for Big science 2022年第1期6卷 1-54页

作者： Aad, G. Abbott, B. Abbott, D.C. Abud, A. Abed Abeling, K. Abhayasinghe, D.K. Abidi, S.H. Aboulhorma, A. Abramowicz, H. Abreu, H. Abulaiti, Y. Hoffman, A. C. Abusleme Acharya, B.S. Achkar, B. Adam, L. Bourdarios, C. Adam Adamczyk, L. Adamek, L. Addepalli, S.V. Adelman, J. Adiguzel, A. Adorni, S. Adye, T. Affolder, A.A. Afik, Y. Agapopoulou, C. Agaras, M.N. Agarwala, J. Aggarwal, A. Agheorghiesei, C. Aguilar-Saavedra, J.A. Ahmad, A. Ahmadov, F. Ahmed, W.S. Ai, X. Aielli, G. Aizenberg, I. Akatsuka, S. Akbiyik, M. Åkesson, T.P.A. Akimov, A.V. Khoury, K. Al Alberghi, G.L. Albert, J. Albicocco, P. Verzini, M. J. Alconada Alderweireldt, S. Aleksa, M. Aleksandrov, I.N. Alexa, C. Alexopoulos, T. Alfonsi, A. Alfonsi, F. Alhroob, M. Ali, B. Ali, S. Aliev, M. Alimonti, G. Allaire, C. Allbrooke, B.M.M. Allport, P.P. Aloisio, A. Alonso, F. Alpigiani, C. Camelia, E. Alunno Estevez, M. Alvarez Alviggi, M.G. Coutinho, Y. Amaral Ambler, A. Ambroz, L. Amelung, C. Amidei, D. Santos, S. P. Amor Dos Amoroso, S. Amos, K.R. Amrouche, C.S. Ananiev, V. Anastopoulos, C. Andari, N. Andeen, T. Anders, J.K. Andrean, S.Y. Andreazza, A. Angelidakis, S. Angerami, A. Anisenkov, A.V. Annovi, A. Antel, C. Anthony, M.T. Antipov, E. Antonelli, M. Antrim, D.J.A. Anulli, F. Aoki, M. Pozo, J. A. Aparisi Aparo, M.A. Bella, L. Aperio Aranzabal, N. Ferraz, V. Araujo Arcangeletti, C. Arce, A.T.H. Arena, E. Arguin, J.-F. Argyropoulos, S. Arling, J.-H. Armbruster, A.J. Armstrong, A. Arnaez, O. Arnold, H. Tame, Z. P. Arrubarrena Artoni, G. Asada, H. Asai, K. Asai, S. Asbah, N.A. Asimakopoulou, E.M. Asquith, L. Assahsah, J. Assamagan, K. Astalos, R. Atkin, R.J. Atkinson, M. Atlay, N.B. Atmani, H. Atmasiddha, P.A. Augsten, K. Auricchio, S. Austrup, V.A. Avner, G. Avolio, G. Ayoub, M.K. Azuelos, G. Babal, D. Bachacou, H. Bachas, K. Bachiu, A. Backman, F. Badea, A. Bagnaia, P. Bahrasemani, H. Bailey, A.J. Bailey, V.R. Baines, J.T. Bakalis, C. Baker, O.K. Bakker, P.J. Bakos, E. Gupta, D. Bakshi Balaji, S. Balasubramanian, R. Baldin, E.M. Balek, P. Ballabene, E. Bal Department of Physics University of Adelaide Adelaide Australia Department of Physics University of Alberta Edmonton AB Canada Department of Physics Ankara University Ankara Turkey Division of Physics TOBB University of Economics and Technology Ankara Turkey LAPP Univ. Savoie Mont Blanc CNRS/IN2P3 Annecy France High Energy Physics Division Argonne National Laboratory Argonne IL United States Department of Physics University of Arizona Tucson AZ United States Department of Physics University of Texas at Arlington Arlington TX United States Physics Department National and Kapodistrian University of Athens Athens Greece Physics Department National Technical University of Athens Zografou Greece Department of Physics University of Texas at Austin Austin TX United States Bahcesehir University Faculty of Engineering and Natural Sciences Istanbul Turkey Istanbul Bilgi University Faculty of Engineering and Natural Sciences Istanbul Turkey Department of Physics Bogazici University Istanbul Turkey Department of Physics Engineering Gaziantep University Gaziantep Turkey Institut de Física d’Altes Energies (IFAE) Barcelona Institute of Science and Technology Barcelona Spain Institute of High Energy Physics Chinese Academy of Sciences Beijing China Physics Department Tsinghua University Beijing China Department of Physics Nanjing University Nanjing China University of Chinese Academy of Science (UCAS) Beijing China Institute of Physics University of Belgrade Belgrade Serbia Department for Physics and Technology University of Bergen Bergen Norway Physics Division Lawrence Berkeley National Laboratory and University of California Berkeley CA United States Institut für Physik Humboldt Universität zu Berlin Berlin Germany Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland School of Physics and Astronomy University of Birmingham Birmingham United Kingdom Facultad de Ciencias y Cen

The ATLAS experiment at the Large Hadron Collider has a broad physics programme ranging from precision measurements to direct searches for new particles and new interactions, requiring ever larger and ever more accurate datasets of simulated Monte Carlo events. Detector simulation with Geant4 is accurate but requires significant CPU resources. Over the past decade, ATLAS has developed and utilized tools that replace the most CPU-intensive component of the simulation—the calorimeter shower simulation—with faster simulation methods. Here, AtlFast3, the next generation of high-accuracy fast simulation in ATLAS, is introduced. AtlFast3 combines parameterized approaches with machine-learning techniques and is deployed to meet current and future computing challenges, and simulation needs of the ATLAS experiment. With highly accurate performance and significantly improved modelling of substructure within jets, AtlFast3 can simulate large numbers of events for a wide range of physics processes. © 2022, Springer Nature Switzerland AG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Attention Network Learning for Semantic Source Code Retrieval

Multi-modal Attention Network Learning for Semantic Source C...

引用

IEEE International Conference on Automated software Engineering (ASE)

作者： Yao Wan Jingdong Shu Yulei Sui Guandong Xu Zhou Zhao Jian Wu Philip Yu College of Computer Science and Technology Zhejiang University Hangzhou China Department of Computer Science University of Illinois at Chicago Illinois USA State Key Laboratory of Cognitive Intelligence iFLYTEK Hefei China School of Computer Science University of Technology Sydney Australia University of Illinois at Chicago Chicago IL USA

The following topics are dealt with: program testing; program diagnostics; learning (artificial intelligence); program debugging; software maintenance; software quality; public domain software; program verification; s... 详细信息

关键词： Semantics Natural languages Deep learning Task analysis Neural networks Feature extraction Visualization

来源：评论

学校读者我要写书评

暂无评论

Quantifying the impact of scholarly papers based on higher-order weighted citations

arXiv

引用

arXiv 2020年

作者： Bai, Xiaomei Zhang, Fuli Hou, Jie Lee, Ivan Kong, Xiangjie Tolba, Amr Xia, Feng Computing Center Anshan Normal University Anshan114007 China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Library Anshan Normal University Anshan114007 China School of ITMS University of South Australia Mawson LakesSA5095 Australia Computer Science Department Community College King Saud University Riyadh11437 Saudi Arabia Mathematics Department Faculty of Science Menoufia University Shebin-El-Kom32511 Egypt

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FASS: A fairness-aware approach for concurrent service selection with constraints

arXiv

引用

arXiv 2019年

作者： Li, Songyuan Huang, Jiwei Cheng, Bo Cui, Lizhen Shi, Yuliang State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China Department of Computer Science and Technology China University of Petroleum-Beijing Beijing102249 China School of Software Shandong University Jinan250101 China Dareway Software Co. Ltd. Jinan250101 China

The increasing momentum of service-oriented architecture has led to the emergence of divergent delivered services, where service selection is meritedly required to obtain the target service fulfilling the requirements from both users and service providers. Despite many existing works have extensively handled the issue of service selection, it remains an open question in the case where requests from multiple users are performed simultaneously by a certain set of shared candidate services. Meanwhile, there exist some constraints enforced on the context of service selection, e.g. service placement location and contracts between users and service providers. In this paper, we focus on the QoS-aware service selection with constraints from a fairness aspect, with the objective of achieving max-min fairness across multiple service requests sharing candidate service sets. To be more specific, we study the problem of fairly selecting services from shared candidate sets while service providers are self-motivated to offer better services with higher QoS values. We formulate this problem as a lexicographical maximization problem, which is far from trivial to deal with practically due to its inherently multiobjective and discrete nature. A fairness-aware algorithm for concurrent service selection (FASS) is proposed, whose basic idea is to iteratively solve the single-objective subproblems by transforming them into linear programming problems. Experimental results based on real-world datasets also validate the effectiveness and practicality of our proposed approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

AGE Challenge: Angle Closure Glaucoma Evaluation in Anterior Segment Optical Coherence Tomography

arXiv

引用

arXiv 2020年

作者： Fu, Huazhu Li, Fei Sun, Xu Cao, Xingxing Liao, Jingan Orlando, José Ignacio Tao, Xing Li, Yuexiang Zhang, Shihao Tan, Mingkui Yuan, Chenglang Bian, Cheng Xie, Ruitao Li, Jiongcheng Li, Xiaomeng Wang, Jing Geng, Le Li, Panming Hao, Huaying Liu, Jiang Kong, Yan Ren, Yongyong Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu State Key Laboratory Zhongshan Ophthalmic Center Sun Yat-sen University Guangzhou510060 China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates Intelligent Healthcare Unit Baidu Beijing China School of Computer Science and Engineering South China University of Technology GuangzhouGuangdong China National Scientific and Technical Research Council CONICET Argentina Tandil Argentina School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Tencent Jarvis Lab Shenzhen China School of Software Engineering South China University of Technology Guangzhou China School of Biomedical Engineering Health Science Center Shenzhen University Shenzhen China School of Electronic and Information Engineering Shenzhen University Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong School of Electronic and Information Engineering Soochow University Suzhou China Ningbo University Zhejiang China Ningbo Institute of Industrial Technology Chinese Academy of Sciences Zhejiang China Southern University of Science and Technology Shenzhen China Shanghai Jiaotong University Shanghai China Laboratory for Ophthalmic Image Analysis Department of Ophthalmology Medical University of Vienna Vienna Austria

Angle closure glaucoma (ACG) is a more aggressive disease than open-angle glaucoma, where the abnormal anatomical structures of the anterior chamber angle (ACA) may cause an elevated intraocular pressure and gradually leads to glaucomatous optic neuropathy and eventually to visual impairment and blindness. Anterior Segment Optical Coherence Tomography (AS-OCT) imaging provides a fast and contactless way to discriminate angle closure from open angle. Although many medical image analysis algorithms have been developed for glaucoma diagnosis, only a few studies have focused on AS-OCT imaging. In particular, there is no public AS-OCT dataset available for evaluating the existing methods in a uniform way, which limits the progress in the development of automated techniques for angle closure detection and assessment. To address this, we organized the Angle closure Glaucoma Evaluation challenge (AGE), held in conjunction with MICCAI 2019. The AGE challenge consisted of two tasks: scleral spur localization and angle closure classification. For this challenge, we released a large data of 4800 annotated AS-OCT images from 199 patients, and also proposed an evaluation framework to benchmark and compare different models. During the AGE challenge, over 200 teams registered online, and more than 1100 results were submitted for online evaluation. Finally, eight teams participated in the onsite challenge. In this paper, we summarize these eight onsite challenge methods and analyze their corresponding results in the two tasks. We further discuss limitations and future directions. In the AGE challenge, the top-performing approach had an average Euclidean Distance of 10 pixel (10µm) in scleral spur localization, while in the task of angle closure classification, all the algorithms achieved the satisfactory performances, especially, 100% accuracy rate for top-two performances. These artificial intelligence techniques were shown to have the potential to enable new developments in AS-OCT

关键词： Ophthalmology

来源：评论

学校读者我要写书评

暂无评论

Multi-modal attention network learning for semantic source code retrieval

arXiv

引用

arXiv 2019年

作者： Wan, Yao Shu, Jingdong Sui, Yulei Xu, Guandong Zhao, Zhou Wu, Jian Yu, Philip S. College of Computer Science and Technology Zhejiang University Hangzhou China School of Computer Science University of Technology Sydney Australia Department of Computer Science University of Illinois at Chicago IL United States Institute for Data Science Tsinghua University Beijing China State Key Laboratory of Cognitive Intelligence iFLYTEK Hefei China

Code retrieval techniques and tools have been playing a key role in facilitating software developers to retrieve existing code fragments from available open-source repositories given a user query (e.g., a short natural language text describing the functionality for retrieving a particular code snippet). Despite the existing efforts in improving the effectiveness of code retrieval, there are still two main issues hindering them from being used to accurately retrieve satisfiable code fragments from large-scale repositories when answering complicated queries. First, the existing approaches only consider shallow features of source code such as method names and code tokens, but ignoring structured features such as abstract syntax trees (ASTs) and control-flow graphs (CFGs) of source code, which contains rich and well-defined semantics of source code. Second, although the deep learning-based approach performs well on the representation of source code, it lacks the explainability, making it hard to interpret the retrieval results and almost impossible to understand which features of source code contribute more to the final results. To tackle the two aforementioned issues, this paper proposes MMAN, a novel Multi-Modal Attention Network for semantic source code retrieval. A comprehensive multi-modal representation is developed for representing unstructured and structured features of source code, with one LSTM for the sequential tokens of code, a Tree-LSTM for the AST of code and a GGNN (Gated Graph Neural Network) for the CFG of code. Furthermore, a multi-modal attention fusion layer is applied to assign weights to different parts of each modality of source code and then integrate them into a single hybrid representation. Comprehensive experiments and analysis on a large-scale real-world dataset show that our proposed model can accurately retrieve code snippets and outperforms the state-of-the-art methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Flow graphs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：