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

Non-invasive biopsy diagnosis of diabetic kidney disease via deep learning applied to retinal images: a population-based study

学校读者我要写书评

暂无评论

The Lancet Digital Health 2025年第5期7卷 100868页

作者： Meng, Ziyao Guan, Zhouyu Yu, Shujie Wu, Yilan Zhao, Yaoning Shen, Jie Lim, Cynthia Ciwei Chen, Tingli Yang, Dawei Ran, An Ran He, Feng Hamzah, Haslina Singh, Sarkaaj Abd Raof, Anis Syazwani Lee-Boey, Jian Wen Samuel Lim, Soo-Kun Sun, Xufang Ge, Shuwang Xu, Gang Su, Hua Cheng, Yang Lu, Feng Liao, Xiaofei Jin, Hai Deng, Chenxin Ruan, Lei Zhang, Cuntai Wu, Chan Dai, Rongping Jin, Yixiao Wang, Wenxiao Li, Tingyao Liu, Ruhan Li, Jiajia Shu, Jia Lu, Yuwei Wang, Xiangning Wu, Qiang Qin, Yiming Tang, Jin Sheng, Xiaohua Jiao, Qiong Yang, Xiaokang Guo, Minyi McKay, Gareth J Hogg, Ruth E Liew, Gerald Chee, Evelyn Yi Lyn Hsu, Wynne Lee, Mong Li Szeto, Simon Luk, Andrea O Y Chan, Juliana C N Cheung, Carol Y Tan, Gavin Siew Wei Tham, Yih-Chung Cheng, Ching-Yu Sabanayagam, Charumathi Lim, Lee-Ling Jia, Weiping Li, Huating Sheng, Bin Wong, Tien Yin Shanghai Belt and Road International Joint Laboratory of Intelligent Prevention and Treatment for Metabolic Diseases Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Institute for Proactive Healthcare Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Centre for Diabetes Shanghai Key Laboratory of Diabetes Mellitus Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Beijing Tsinghua Changgung Hospital Eye Center School of Clinical Medicine Tsinghua Medicine Tsinghua University Beijing China Medical Records and Statistics Office Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Renal Medicine Singapore General Hospital SingHealth-Duke Academic Medical Centre Singapore Singapore Department of Ophthalmology Shanghai Health and Medical Center Wuxi China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong Special Administrative Region China Singapore Eye Research Institute Singapore National Eye Centre Singapore Department of Medicine Faculty of Medicine Universiti Malaya Kuala Lumpur Malaysia Department of Ophthalmology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Hubei Wuhan China Department of Nephrology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Nephrology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Ophthalmology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Centre for Big Dat

Background: Improving the accessibility of screening diabetic kidney disease (DKD) and differentiating isolated diabetic nephropathy from non-diabetic kidney disease (NDKD) are two major challenges in the field of diabetes care. We aimed to develop and validate an artificial intelligence (AI) deep learning system to detect DKD and isolated diabetic nephropathy from retinal fundus images. Methods: In this population-based study, we developed a retinal image-based AI-deep learning system, DeepDKD, pretrained using 734 084 retinal fundus images. First, for DKD detection, we used 486 312 retinal images from 121 578 participants in the Shanghai Integrated Diabetes Prevention and Care system for development and internal validation, and ten multi-ethnic datasets from China, Singapore, Malaysia, Australia, and the UK (65 406 participants) for external validation. Second, to differentiate isolated diabetic nephropathy from NDKD, we used 1068 retinal images from 267 participants for development and internal validation, and three multi-ethnic datasets from China, Malaysia, and the UK (244 participants) for external validation. Finally, we conducted two proof-of-concept studies: a prospective real-world study with 3 months' follow-up to evaluate the effectiveness of DeepDKD in screening DKD;and a longitudinal analysis of the effectiveness of DeepDKD in differentiating isolated diabetic nephropathy from NDKD on renal function changes with 4·6 years' follow-up. Findings: For detecting DKD, DeepDKD achieved an area under the receiver operating characteristic curve (AUC) of 0·842 (95% CI 0·838–0·846) on the internal validation dataset and AUCs of 0·791–0·826 across external validation datasets. For differentiating isolated diabetic nephropathy from NDKD, DeepDKD achieved an AUC of 0·906 (0·825–0·966) on the internal validation dataset and AUCs of 0·733–0·844 across external validation datasets. In the prospective study, compared with the metadata model, DeepDKD could detect DKD wit

关键词： Deep learning

Energy Saving Strategy of Power system Cluster Based on Container Virtualization

学校读者我要写书评

暂无评论

Energy Saving Strategy of Power System Cluster Based on Cont...

IEEE Asia Power and Energy engineering Conference (APEEC)

作者： Ran Zheng Hao Wang Hai Jin Dechao Xu Yong Chen Xiaomeng Li Yufei Rao Zhenan Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory of Power Grid Safety and Energy Conservation China Electric Power Research Institute Haidian District Beijing China State Grid Henan Electric Power Company Electric Power Research Institute Zhengzhou China

ISBN: (数字)9781728167824

ISBN: (纸本)9781728167831

With the continuous development of power grids, the scale of supercomputing clusters has also gradually increased to carry a large number of power system simulation calculations, and the problem of high energy consumption has appeared. To solve this problem, we propose a container virtualization-based supercomputing cluster for power system. We analyze the impact of containers on power simulation calculations and compare the energy consumption effects of various container scheduling and migration algorithms on clusters. Experiments show that compared to virtual machines with hypervisor, which consumes massive resources and reduces performances by 28.4%, the performance degradation of container on power simulation calculation is 1.3%, which can be ignored. The energy consumption of load-concentration or resource-and-load-balance container scheduling algorithms is up to 4.0% lower and at least 2.2% lower than other algorithms. In container migration, the method combining autoregressive model with most-correlation and resource-andload-balance algorithms is better than other methods, which not only minimizes energy consumption, but also has lowest number of migrations and SLA violations. Experiments verify the feasibility and advantages of container migration in power system computing clusters.

关键词：

Accumulative time-based ranking method to reputation evaluation in information networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Liu, Qi-Xin Huang, Ze-Cheng Yeung, Chi Ho Zhang, Yi-Cheng National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen518060 China Department of Science and Environmental Studies The Education University of Hong Kong Hong Kong Hong Kong Department of Physics University of Fribourg Fribourg Switzerland

With the rapid development of modern technology, the Web has become an important platform for users to make friends and acquire information. However, since information on the Web is over-abundant, information filtering becomes a key task for online users to obtain relevant suggestions. As most Websites can be ranked according to users’ rating and preferences, relevance to queries, and recency, how to extract the most relevant item from the over-abundant information is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed accumulative time-based ranking (ATR) algorithm, we incorporate two behavioral weighting factors which are updated when users select or rate items, to reflect the evolution of user reputation and item quality over time. We showed that our algorithm outperforms state-of-the-art ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Copyright © 2019, The Authors. All rights reserved.

关键词： Information filtering

Poisoning attack against estimating from pairwise comparisons

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

Foundation models and intelligent decision-making: Progress, challenges, and perspectives

学校读者我要写书评

暂无评论

The Innovation 2025年第6期6卷

作者： Jincai Huang Yongjun Xu Qi Wang Qi (Cheems) Wang Xingxing Liang Fei Wang Zhao Zhang Wei Wei Boxuan Zhang Libo Huang Jingru Chang Liantao Ma Ting Ma Yuxuan Liang Jie Zhang Jian Guo Xuhui Jiang Xinxin Fan Zhulin An Tingting Li Aiguo Fei Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Software Engineering Peking University Beijing 100871 China College of Systems Engineering National University of Defense Technology Changsha 410073 China Department of Oral Implantology Peking University School and Hospital of Stomatology Beijing 100081 China Laboratory for Big Data and Decision National University of Defense Technology Changsha 410073 China School of Automation Beijing Institute of Technology Beijing 100081 China Huazhong University of Science and Technology Wuhan 430074 China University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of AI Safety Beijing 100190 China Department of Automation Tsinghua University Beijing 100084 China School of Information Science and Engineering Dalian Polytechnic University Dalian 116034 China The Hong Kong University of Science and Technology (Guangzhou) Guangzhou 511453 China College of Information and Electrical Engineering China Agricultural University Beijing 100083 China State Key Laboratory of Efficient Utilization of Agricultural Water Resources Beijing 100083 China IDEA Research International Digital Economy Academy Shenzhen 518057 China School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing 100876 China

Intelligent decision-making (IDM) is a cornerstone of artificial intelligence (AI) designed to automate or augment decision processes. Modern IDM paradigms integrate advanced frameworks to enable intelligent agents to make effective and adaptive choices and decompose complex tasks into manageable steps, such as AI agents and high-level reinforcement learning. Recent advances in multimodal foundation-based approaches unify diverse input modalities—such as vision, language, and sensory data—into a cohesive decision-making process. Foundation models (FMs) have become pivotal in science and industry, transforming decision-making and research capabilities. Their large-scale, multimodal data-processing abilities foster adaptability and interdisciplinary breakthroughs across fields such as healthcare, life sciences, and education. This survey examines IDM’s evolution, advanced paradigms with FMs and their transformative impact on decision-making across diverse scientific and industrial domains, highlighting the challenges and opportunities in building efficient, adaptive, and ethical decision systems.

关键词： artificial intelligence intelligent decision-making foundation models agent large language model

Applications of Game Theory in Vehicular Networks: A Survey

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

Enhancing countries' fitness with recommender systems on the international trade network

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Wu, Xing-Tong Vidmer, Alexandre Huang, Xiao-Min Liu, Ming-Kai Zhou, Mingyang Zhang, Yi-Cheng National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Physics University of Fribourg Fribourg1700 Switzerland

Prediction is one of the major challenges in complex systems. The prediction methods have shown to be effective predictors of the evolution of networks. These methods can help policy makers to solve practical problems successfully and make better strategy for the future. In this work, we focus on exporting countries' data of the international trading network. A recommendation system is then used to identify the products corresponding to the production capacity of each individual country, but are somehow overlook by the country. Then, we simulate the evolution of the country's fitness if it would have followed the recommendations. The result of this work is the combination combine these two methods to provide insights to countries on how to enhance the diversification of their exported products in a scientific way and improve national competitiveness significantly, especially for developing countries. Copyright © 2019, The Authors. All rights reserved.

关键词： Recommender systems

Relation-Guided Representation Learning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Kang, Zhao Lu, Xiao Liang, Jian Bai, Kun Xu, Zenglin School of Computer Science and Engineering University of Electronic Science and Technology of China Sichuan China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Cloud and Smart Industries Group Tencent Beijing China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Center for Artificial Intelligence Peng Cheng Lab Shenzhen China

Deep auto-encoders (DAEs) have achieved great success in learning data representations via the powerful representability of neural networks. But most DAEs only focus on the most dominant structures which are able to reconstruct the data from a latent space and neglect rich latent structural information. In this work, we propose a new representation learning method that explicitly models and leverages sample relations, which in turn is used as supervision to guide the representation learning. Different from previous work, our framework well preserves the relations between samples. Since the prediction of pairwise relations themselves is a fundamental problem, our model adaptively learns them from data. This provides much flexibility to encode real data manifold. The important role of relation and representation learning is evaluated on the clustering task. Extensive experiments on benchmark data sets demonstrate the superiority of our approach. By seeking to embed samples into subspace, we further show that our method can address the large-scale and out-of-sample problem. Our source code is publicly available at: https://***/nbShawnLu/RGRL. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

Towards Practical and Robust DNA-Based data Archiving Using ‘Yin-Yang Codec’ system

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Ping, Zhi Chen, Shihong Zhou, Guangyu Huang, Xiaoluo Zhu, Sha Joe Zhang, Haoling Lee, Henry H. Lan, Zhaojun Cui, Jie Chen, Tai Zhang, Wenwei Yang, Huanming Xu, Xun Church, George M. Shen, Yue BGI-Shenzhen Shenzhen518083 China Guangdong Provincial Key Laboratory of Genome Read and Write BGI-Shenzhen Shenzhen518120 China George Church Institute of Regenesis BGI-Shenzhen Shenzhen518120 China China National GeneBank BGI-Shenzhen Shenzhen518120 China Shenzhen Institute of Synthetic Biology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Department of Genetics Harvard Medical School BostonMA United States Department of Molecular and Cellular Biology Harvard University CambridgeMA United States Wyss Institute for Biologically Inspired Engineering Harvard University BostonMA United States Big data Institute University of Oxford Li Ka Shing Centre for Health Information and Discovery Old Road Campus Oxford United Kingdom School of Mathematical Science Capital Normal University Beijing100048 China

DNA is a promising data storage medium due to its remarkable durability and space-efficient storage. Early bit-to-base transcoding schemes have primarily pursued information density, at the expense however of introducing biocompatibility challenges or at the risk of decoding failure. Here, we propose a robust transcoding algorithm named the "Yin-Yang Codec" (YYC), using two rules to encode two binary bits into one nucleotide, to generate DNA sequences highly compatible with synthesis and sequencing technologies. We encoded two representative file formats and stored them in vitro as 200-nt oligo pools and in vivo as an ~54-kb DNA fragment in yeast cells. Sequencing results show that YYC exhibits high robustness and reliability for a wide variety of data types, with. an average recovery rate of 99.94% at 104 molecule copies and an achieved recovery rate of 87.53% at 100 copies. In addition, the in vivo storage demonstration achieved for the first time an experimentally measured physical information density of 198.8 EB per gram of DNA (44% of the theoretical maximum for DNA). © 2021, CC BY.

关键词： DNA