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

Author Correction: A concept-based interpretable model for the diagnosis of choroid neoplasias using multimodal data

学校读者我要写书评

暂无评论

Nature communications 2025年第1期16卷 4381页

作者： Yifan Wu Yang Liu Yue Yang Michael S Yao Wenli Yang Xuehui Shi Lihong Yang Dongjun Li Yueming Liu Shiyi Yin Chunyan Lei Meixia Zhang James C Gee Xuan Yang Wenbin Wei Shi Gu University of Pennsylvania Philadelphia PA USA. University of Electronic Science and Technology of China Chengdu China. Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing China. Beijing Key Laboratory of Intraocular Tumor Diagnosis and Treatment Beijing Tongren Hospital Capital Medical University Beijing China. Beijing Ophthalmology and Visual Sciences Key Lab Beijing Tongren Hospital Capital Medical University Beijing China. Department of Ophthalmology and Research Laboratory of Macular Disease West China Hospital Sichuan University Chengdu China. Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing China. yangxuan153@***. Beijing Key Laboratory of Intraocular Tumor Diagnosis and Treatment Beijing Tongren Hospital Capital Medical University Beijing China. yangxuan153@***. Beijing Ophthalmology and Visual Sciences Key Lab Beijing Tongren Hospital Capital Medical University Beijing China. yangxuan153@***. Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing China. weiwenbintr@***. Beijing Key Laboratory of Intraocular Tumor Diagnosis and Treatment Beijing Tongren Hospital Capital Medical University Beijing China. weiwenbintr@***. Beijing Ophthalmology and Visual Sciences Key Lab Beijing Tongren Hospital Capital Medical University Beijing China. weiwenbintr@***. University of Electronic Science and Technology of China Chengdu China. gus@***. College of Computer Science and Technology Zhejiang University Hangzhou China. gus@***. State Key Laboratory of Brain Machine Intelligence Zhejiang University Hangzhou China. gus@***.

Collective link prediction oriented network embedding with hierarchical graph attention

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Jiao, Yizhu Xiong, Yun Zhang, Jiawei Zhu, Yangyong Shanghai Key Laboratory of Data Science Shanghai Institute for Advanced Communication and Data Science School of Computer Science Fudan University Shanghai China IFM Lab Department of Computer Science Florida State University TallahasseeFL United States

To enjoy more social network services, users nowadays are usually involved in multiple online sites at the same time. Aligned social networks provide more information to alleviate the problem of data insufficiency. In this paper, we target on the collective link prediction problem and aim to predict both the intra-network social links as well as the inter-network anchor links across multiple aligned social networks. It is not an easy task, and the major challenges involve the network characteristic difference problem and different directivity properties of the social and anchor links to be predicted. To address the problem, we propose an application oriented network embedding framework, Hierarchical Graph Attention based Network Embedding (HGANE), for collective link prediction over directed aligned networks. Very different from the conventional general network embedding models, HGANE effectively incorporates the collective link prediction task objectives into consideration. It learns the representations of nodes by aggregating information from both the intra-network neighbors (connected by social links) and inter-network partners (connected by anchor links). What’s more, we introduce a hierarchical graph attention mechanism for the intra-network neighbors and inter-network partners respectively, which resolves the network characteristic differences and the link directivity challenges effectively. Extensive experiments have been conducted on real-world aligned networks datasets to demonstrate that our model outperformed the state-of-the-art baseline methods in addressing the collective link prediction problem by a large margin. Copyright © 2019, The Authors. All rights reserved.

关键词： Network embeddings

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.

关键词：

Erratum to "Multi-View Face Synthesis via Progressive Face Flow"

学校读者我要写书评

暂无评论

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2021年 30卷 6700页

作者： Yangyang Xu Xuemiao Xu Jianbo Jiao Keke Li Cheng Xu Shengfeng He School of Computer Science and Engineering South China University of Technology Guangzhou China State Key Laboratory of Subtropical Building Science the Key Laboratory of Big Data and Intelligent Robot Ministry of Education and the Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information South China University of Technology Guangzhou China University of Oxford Oxford U.K.

In the above article [1], unfortunately, Fig. 5 was not displayed correctly with many empty images. The correct version is supplemented here.

关键词： Faces

Sledge: Towards Efficient Live Migration of Docker Containers

学校读者我要写书评

暂无评论

Sledge: Towards Efficient Live Migration of Docker Container...

IEEE International Conference on Cloud Computing, CLOUD

作者： Bo Xu Song Wu Jiang Xiao Hai Jin Yingxi Zhang Guoqiang Shi Tingyu Lin Jia Rao Li Yi Jizhong Jiang 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 Intelligent Manufacturing System Technology Beijing China The University of Texas at Arlington Arlington TX USA Alibaba Cloud Computing Co. Ltd. Hangzhou China

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Modern large-scale cloud platforms require live migration technique on Docker containers with stateful workload to support load balancing, host maintenance, and Quality of Service (QoS) improvement. Efficient and scalable Docker live migration is expected to guarantee the component-integrity (image, runtime, and management context) with negligible downtime. In this paper, we present a highly efficient live migration system called Sledge, which ensures the component-integrity by integrating both images and management context during runtime migration. The key insight is that the layered image can be leveraged to reduce the migration overhead, and appropriately selective migration of management context will effectively improve QoS with negligible downtime. To achieve good scalability, a lightweight container registry mechanism for end-to-end image migration is designed to avoid the redundant layers transmission. In addition, a dynamic context loading scheme is proposed to precisely load the management context into the running daemon, which can significantly reduce downtime. Experiments show that, compared with the state-of-the-art, Sledge reduces 57% of total migration time, 55% of image migration time, and 70% downtime.

关键词： Cloud computing Runtime Scalability Loading Quality of service Containers Maintenance engineering

GAMMA Challenge: Glaucoma grAding from Multi-Modality imAges

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wu, Junde Fang, Huihui Li, Fei Fu, Huazhu Lin, Fengbin Li, Jiongcheng Huang, Yue Yu, Qinji Song, Sifan Xu, Xinxing Xu, Yanyu Wang, Wensai Wang, Lingxiao Lu, Shuai Li, Huiqi Huang, Shihua Lu, Zhichao Ou, Chubin Wei, Xifei Liu, Bingyuan Kobbi, Riadh Tang, Xiaoying Lin, Li Zhou, Qiang Hu, Qiang Bogunović, Hrvoje Orlando, José Ignacio Zhang, Xiulan Xu, Yanwu State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Intelligent Healthcare Unit Baidu Inc. Beijing China Singapore School of Informatics Xiamen University Xiamen China Shanghai Jiao Tong University Shanghai China Xi'an Jiaotong-Liverpool University Suzhou China Institute of High Performance Computing A*STAR Singapore Institute of Biomedical Engineering Chinese Academy of Medical Sciences Peking Union Medical College Tianjin China School of Medical Technology Beijing Institute of Technology Beijing China Department of Computing Hong Kong Polytechnic University Hong Kong Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Weizhi Medical Technology Company Suzhou China École de Technologie Supérieure Montreal Montreal Canada DIAGNOS Inc. Quebec Canada Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Technology Co. Ltd. Shanghai China School of Information and Electronics Beijing Institute of Technology Beijing China Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology Medical University of Vienna Austria Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina

Glaucoma is a chronic neuro-degenerative condition that is one of the world's leading causes of irreversible but preventable blindness. The blindness is generally caused by the lack of timely detection and treatment. Early screening is thus essential for early treatment to preserve vision and maintain life quality. Color fundus photography and Optical Coherence Tomography (OCT) are the two most cost-effective tools for glaucoma screening. Both imaging modalities have prominent biomarkers to indicate glaucoma suspects, such as the vertical cup-to-disc ratio (vCDR) on fundus images and retinal nerve fiber layer (RNFL) thickness on OCT volume. In clinical practice, it is often recommended to take both of the screenings for a more accurate and reliable diagnosis. However, although numerous algorithms are proposed based on fundus images or OCT volumes for the automated glaucoma detection, there are few methods that leverage both of the modalities to achieve the target. To fulfill the research gap, we set up the Glaucoma grAding from Multi-Modality imAges (GAMMA) Challenge to encourage the development of fundus & OCT-based glaucoma grading. The primary task of the challenge is to grade glaucoma from both the 2D fundus images and 3D OCT scanning volumes. As part of GAMMA, we have publicly released a glaucoma annotated dataset with both 2D fundus color photography and 3D OCT volumes, which is the first multi-modality dataset for machine learning based glaucoma grading. In addition, an evaluation framework is also established to evaluate the performance of the submitted methods. During the challenge, 1272 results were submitted, and finally, ten best performing teams were selected for the final stage. We analyze their results and summarize their methods in the paper. Since all the teams submitted their source code in the challenge, we conducted a detailed ablation study to verify the effectiveness of the particular modules proposed. Finally, we identify the proposed techniqu

关键词： Grading

Intelligent reflecting surface aided MISO uplink communication network: Feasibility and power minimization for perfect and imperfect CSI

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Yang Zhao, Jun Li, Ming Wu, Qingqing School of Information and Communication Engineering Dalian University of Technology Dalian China School of Computer Science and Engineering Nanyang Technological University Singapore National Mobile Communications Research Laboratory Southeast University Nanjing210096 China State Key Lab. of Internet of Things for Smart City University of Macau Macau China

In this paper, we consider the weighted sum-power minimization under quality-of-service (QoS) constraints in the multi-user multi-input-single-output (MISO) uplink wireless network assisted by intelligent reflecting surface (IRS). We perform a comprehensive investigation on various aspects of this problem. First, when users have sufficient transmit powers, we present a new sufficient condition guaranteeing arbitrary information rate constraints. This result strengthens the feasibility condition in existing literature. Then, we design novel penalty dual decomposition (PDD) based and nonlinear equality constrained alternative direction method of multipliers (neADMM) based solutions to tackle the IRS-dependent-QoS-constraints, which effectively solve the feasibility check and power minimization problems. Besides, we further extend our proposals to the cases where channel status information (CSI) is imperfect and develop an online stochastic algorithm that satisfy QoS constraints stochastically without requiring prior knowledge of CSI errors. Extensive numerical results are presented to verify the effectiveness of our proposed algorithms. © 2020, CC BY.

关键词： Quality of service

On the hardness of the computational ring-LWR problem and its applications 24th

学校读者我要写书评

暂无评论

On the hardness of the computational ring-LWR problem and it...

24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018

作者： Chen, Long Zhang, Zhenfeng Zhang, Zhenfei TCA Laboratory State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China New Jersey Institute of Technology Newark United States University of Chinese Academy of Sciences Beijing China OnBoard Security Inc. Wilmington United States

ISBN: (纸本)9783030033255

In this paper, we propose a new assumption, the Computational Learning With Rounding over rings, which is inspired by the computational Diffie-Hellman problem. Assuming the hardness of R-LWE, we prove this problem is hard when the secret is small, uniform and invertible. From a theoretical point of view, we give examples of a key exchange scheme and a public key encryption scheme, and prove the worst-case hardness for both schemes with the help of a random oracle. Our result improves both speed, as a result of not requiring Gaussian secret or noise, and size, as a result of rounding. In practice, our result suggests that decisional R-LWR based schemes, such as Saber, Round2 and Lizard, which are among the most efficient solutions to the NIST post-quantum cryptography competition, stem from a provable secure design. There are no hardness results on the decisional R-LWR with polynomial modulus prior to this work, to the best of our knowledge. © 2018, International Association for Cryptologic Research.

关键词： Hardness

Is AI Robust Enough for Scientific Research?

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Jun-Jie Song, Jiahao Wang, Xiu-Cheng Li, Fu-Peng Liu, Zehan Chen, Jian-Nan Dang, Haoning Wang, Shiyao Zhang, Yiyan Xu, Jianhui Shi, Chunxiang Wang, Fei Pang, Long-Gang Cheng, Nan Zhang, Weiwei Zhang, Duo Meng, Deyu Northwest Institute of Nuclear Technology No. 28 Pingyu Road Shaanxi Xi’an710024 China School of Telecommunications Engineering Xidian University No. 2 South Taibai Road Shaanxi Xi’an710071 China State Key Laboratory of ISN No. 2 South Taibai Road Shaanxi Xi’an710071 China Institute of Particle Physics Central China Normal University No. 152 Luoyu Road Hubei Wuhan30079 China School of Computer Science and Technology Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Ministry of Education Key Lab of Intelligent Networks and Network Security Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Guangzhou Institute of Geography Academy of Sciences No. 100 Xianlie Road Guangdong Guangzhou510070 China National Meteorological Information Center Beijing100044 China MDX Research Center for Element Strategy Institute of Integrated Research Institute of Science Tokyo Midori-ku Yokohama226-8503 Japan School of Physics and Information Technology Shaanxi Normal University No. 620 West Chang’an Avenue Shaanxi Xi’an710119 China School of Aeronautics Northwestern Polytechnical University No. 127 West Youyi Road Shaanxi Xi’an710072 China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China School of Mathematics and Statistics Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China

We uncover a phenomenon largely overlooked by the scientific community utilizing AI: neural networks exhibit high susceptibility to minute perturbations, resulting in significant deviations in their outputs. Through an analysis of five diverse application areas—weather forecasting, chemical energy and force calculations, fluid dynamics, quantum chromodynamics, and wireless communication—we demonstrate that this vulnerability is a broad and general characteristic of AI systems. This revelation exposes a hidden risk in relying on neural networks for essential scientific computations, calling further studies on their reliability and security. © 2024, CC0.

关键词： Weather forecasting