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

arXiv 2023年

作者： Makarov, Vadim Abrikosov, Alexey Chaiwongkhot, Poompong Fedorov, Aleksey K. Huang, Anqi Kiktenko, Evgeny Petrov, Mikhail Ponosova, Anastasiya Ruzhitskaya, Daria Tayduganov, Andrey Trefilov, Daniil Zaitsev, Konstantin Russian Quantum Center Skolkovo Moscow121205 Russia Vigo Quantum Communication Center University of Vigo VigoE-36310 Spain NTI Center for Quantum Communications National University of Science and Technology MISiS Moscow119049 Russia Department of Physics Faculty of Science Mahidol University Bangkok10400 Thailand Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Bangkok10110 Thailand QRate Skolkovo Moscow143026 Russia Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China Steklov Mathematical Institute Russian Academy of Sciences Moscow119991 Russia atlanTTic Research Center University of Vigo VigoE-36310 Spain School of Telecommunication Engineering Department of Signal Theory and Communications University of Vigo VigoE-36310 Spain National Research University Higher School of Economics Moscow101000 Russia

A commercial quantum key distribution (QKD) system needs to be formally certified to enable its wide deployment. The certification should include the system’s robustness against known implementation loopholes and attacks that exploit them. Here we ready a fiber-optic QKD system for this procedure. The system has a prepare-and-measure scheme with decoy-state BB84 protocol, polarisation encoding, qubit source rate of 312.5 MHz, and is manufactured by QRate. We detail its hardware and post-processing. We analyse the hardware for known implementation loopholes, search for possible new loopholes, and discuss countermeasures. We then amend the system design to address the highest-risk loopholes identified. We also work out technical requirements on the certification lab and outline its possible structure. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Applying hybrid clustering in pulsar candidate sifting with multi-modality for FAST survey

arXiv

引用

arXiv 2023年

作者： You, Zi-Yi Pan, Yun-Rong Ma, Zhi Zhang, Li Xiao, Shuo Zhang, Dan-Dan Dang, Shi-Jun Zhao, Ru-Shuang Wang, Pei Dong, Ai-Jun Jiang, Jia-Tao Leng, Ji-Bing Li, Wei-An Li, Si-Yao School of Physics and Electronic Science Guizhou Normal University Guiyang550025 China College of Big Data and Information Engineering Guizhou University Guiyang550025 China CAS Key Laboratory of FAST National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550025 China School of Big data and Computer Science Guizhou Normal University Guiyang550025 China Guizhou Software Engineering Research Center Guiyang550000 China Key Laboratory of Information and Computing Guizhou Province Guizhou Normal University Guiyang550001 China

Pulsar search is always the basis of pulsar navigation, gravitational wave detection and other research topics. Currently, the volume of pulsar candidates collected by Five-hundred-meter Aperture Spherical radio Telescope (FAST) shows an explosive growth rate that has brought challenges for its pulsar candidate filtering System. Particularly, the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification methods. In this study, a multi-modal and semi-supervised learning based pulsar candidate sifting algorithm is presented, which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for parallelization. Experiments on both HTRU (The high Time Resolution Universe Survey) 2 and FAST actual observation data demonstrate that the proposed algorithm could excellently identify the pulsars: On HTRU2, the precision and recall rates of its parallel mode reach 0.981 and 0.988. On FAST data, those of its parallel mode reach 0.891 and 0.961, meanwhile, the running time also significantly decrease with the increment of parallel nodes within limits. So, we can get the conclusion that our algorithm could be a feasible idea for large scale pulsar candidate sifting of FAST drift scan observation. Copyright © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A Deep Concept-aware Model for predicting and explaining restaurant future status

A Deep Concept-aware Model for predicting and explaining res...

引用

IEEE International Conference on Web Services (ICWS)

作者： Hao Liao Xiaojie Zhang Xin Li Mingyang Zhou Alexandre Vidmer Rui Mao Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen City Key Laboratory of Service Computing and Application Shenzhen China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

Nowadays, with the development of web services, the survival of online service has captured public attention significantly. Future prediction of business is crucial to the shopkeepers. Predicting how the business will develop and explaining what key factors are leading to it are two most important tasks. Existing literatures usually tackle only one of these two tasks, ignoring that they are two closely related tasks and complement each other. In this paper, we propose a review-based neural model, named Deep Concept-aware Model (DCA), to predict restaurants' future status and provide explainable sentences simultaneously in an end2end framework. Specifically, we use co-attention to select concepts and implement prediction and explanation tasks through Factorization Machine and Gated Recurrent Unit, respectively. We conduct extensive experiments on three Chinese cities' datasets. The proposed joint model outperforms the state-of-the-art baseline methods for both prediction (average 40.96% improvement in AUC) and explanation (average 9.72% improvement in BLEU and 86.05% in Precision metric of ROUGE).

关键词： Web services Urban areas Predictive models Prediction algorithms Data models Task analysis Business

来源：评论

学校读者我要写书评

暂无评论

Parallel computing for large-scale author name disambiguation in medline 21

Parallel computing for large-scale author name disambiguatio...

引用

21st IEEE International Conference on high performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data science and Systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

REFUGE2 CHALLENGE: A TREASURE TROVE FOR MULTI-DIMENSION ANALYSIS AND EVALUATION IN GLAUCOMA SCREENING

arXiv

引用

arXiv 2022年

作者： Fang, Huihui Li, Fei Wu, Junde Fu, Huazhu Sun, Xu Son, Jaemin Yu, Shuang Zhang, Menglu Yuan, Chenglang Bian, Cheng Lei, Baiying Zhao, Benjian Xu, Xinxing Li, Shaohua Fumero, Francisco Sigut, José Almubarak, Haidar Bazi, Yakoub Guo, Yuanhao Zhou, Yating Baid, Ujjwal Innani, Shubham Guo, Tianjiao Yang, Jie Orlando, José Ignacio Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu The REFUGE2 Challenge Australia 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 The Institute of High Performance Computing Agency for Science Technology and Research Singapore Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology and Optometry Medical University of Vienna Vienna Austria VUNO Inc Seoul Korea Republic of Tencent HealthCare Tencent Shenzhen China Computer Vision Institute College of Computer Science and Software Engineering of Shenzhen University Shenzhen China School of Biomedical Engineering Health Science Center Shenzhen University China Xiaohe Healthcare ByteDance Guangdong Guangzhou510000 China School of Biomedical Engineering Shenzhen University China College of Computer Science & Software Engineering Shenzhen University China Department of Computer Science and Systems Engineering Universidad de La Laguna Spain Saudi Electronic University Saudi Arabia King Saud University Saudi Arabia Institute of Automation Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China SGGS Institute of Engineering and Technology India Institute of Medical Robotics Shanghai Jiao Tong University China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

With the rapid development of artificial intelligence (AI) in medical image processing, deep learning in color fundus photography (CFP) analysis is also evolving. Although there are some open-source, labeled datasets of CFPs in the ophthalmology community, large-scale datasets for screening only have labels of disease categories, and datasets with annotations of fundus structures are usually small in size. In addition, labeling standards are not uniform across datasets, and there is no clear information on the acquisition device. Here we release a multi-annotation, multi-quality, and multi-device color fundus image dataset for glaucoma analysis on an original challenge-Retinal Fundus Glaucoma Challenge 2nd Edition (REFUGE2). The REFUGE2 dataset contains 2000 color fundus images with annotations of glaucoma classification, optic disc/cup segmentation, as well as fovea localization. Meanwhile, the REFUGE2 challenge sets three sub-tasks of automatic glaucoma diagnosis and fundus structure analysis and provides an online evaluation framework. Based on the characteristics of multi-device and multi-quality data, some methods with strong generalizations are provided in the challenge to make the predictions more robust. This shows that REFUGE2 brings attention to the characteristics of real-world multi-domain data, bridging the gap between scientific research and clinical application. © 2022, CC BY-NC-ND.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

The Power of Bias: Optimizing Client Selection in Federated Learning with Heterogeneous Differential Privacy

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Ma, Jiating Zhou, Yipeng Li, Qi Sheng, Quan Z. Cui, Laizhong Liu, Jiangchuan Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen518060 China Macquarie University School of Computing Faculty of Science and Engineering Macquarie ParkNSW2119 Australia Tsinghua University Institute for Network Sciences and Cyberspace Beijing100190 China Beijing National Research Center for Information Science and Technology Beijing100190 China Simon Fraser University School of Computing Science BurnabyBCV5A 1S6 Canada

To preserve the data privacy, the federated learning (FL) paradigm emerges in which clients only expose model gradients rather than original data for conducting model training. To enhance the protection of model gradients in FL, differentially private federated learning (DPFL) is proposed which incorporates differentially private (DP) noises to obfuscate gradients before they are exposed. Yet, an essential but largely overlooked problem in DPFL is the heterogeneity of clients' privacy requirement, which can vary significantly between clients and extremely complicates the client selection problem in DPFL. In other words, both the data quality and the influence of DP noises should be taken into account when selecting clients. To address this problem, we conduct convergence analysis of DPFL under heterogeneous privacy, a generic client selection strategy, popular DP mechanisms and convex loss. Based on convergence analysis, we formulate the client selection problem to minimize the value of loss function in DPFL with heterogeneous privacy, which is a convex optimization problem and can be solved efficiently. Accordingly, we propose the DPFL-BCS (biased client selection) algorithm. The extensive experiment results with real datasets under both convex and non-convex loss functions indicate that DPFL-BCS can remarkably improve model utility compared with the SOTA baselines. © 2004-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Randomised benchmarking for characterizing and forecasting correlated processes

arXiv

引用

arXiv 2023年

作者： Zhang, Xinfang Wu, Zhihao White, Gregory A.L. Xiang, Zhongcheng Hu, Shun Peng, Zhihui Liu, Yong Zheng, Dongning Fu, Xiang Huang, Anqi Poletti, Dario Modi, Kavan Wu, Junjie Deng, Mingtang Guo, Chu Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Physics and Astronomy Monash University VIC3800 Australia Dahlem Center for Complex Quantum Systems Freie Universität Berlin Berlin14195 Germany Institute of Physics Chinese Academy of Sciences Beijing100190 China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Department of Physics Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha410081 China Science Mathematics and Technology Cluster and Engineering Product Development Pillar Singapore University of Technology and Design 8 Somapah Road 487372 Singapore Centre for Quantum Technologies National University of Singapore 117543 Singapore MajuLab CNRS-UNS-NUS-NTU International Joint Research Unit UMI 3654 Singapore Quantum for NSW Sydney2000 Australia

The development of fault-tolerant quantum processors relies on the ability to control noise. A particularly insidious form of noise is temporally correlated or non-Markovian noise. By combining randomized benchmarking with supervised machine learning algorithms, we develop a method to learn the details of temporally correlated noise. In particular, we can learn the time-independent evolution operator of system plus bath and this leads to (i) the ability to characterize the degree of non-Markovianity of the dynamics and (ii) the ability to predict the dynamics of the system even beyond the times we have used to train our model. We exemplify this by implementing our method on a superconducting quantum processor. Our experimental results show a drastic change between the Markovian and non-Markovian regimes for the learning accuracies. Copyright © 2023, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Secure and Privacy-Preserving Automated Machine Learning Operations into End-to-End Integrated IoT-Edge-Artificial Intelligence-Blockchain Monitoring System for Diabetes Mellitus Prediction

arXiv

引用

arXiv 2022年

作者： Hennebelle, Alain Ismail, Leila Materwala, Huned Kaabi, Juma Al Ranjan, Priya Janardhanan, Rajiv School of Computing and Information Systems The University of Melbourne Australia Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates College of Health Sciences Department of Internal Medicine United Arab Emirates University United Arab Emirates Mediclinic Al Ain Abu Dhabi United Arab Emirates Bhubaneswar Institute of Technology India Faculty of Medical & Health Sciences SRM Institute of Science & Technology India

Diabetes Mellitus, one of the leading causes of death worldwide, has no cure to date and can lead to severe health complications, such as retinopathy, limb amputation, cardiovascular diseases, and neuronal disease, if left untreated. Consequently, it becomes crucial to take precautionary measures to avoid/predict the occurrence of diabetes. Machine learning approaches have been proposed and evaluated in the literature for diabetes prediction. This paper proposes an IoT-edge-Artificial Intelligence (AI)-blockchain system for diabetes prediction based on risk factors. The proposed system is underpinned by the blockchain to obtain a cohesive view of the risk factors data from patients across different hospitals and to ensure security and privacy of the user’s data. Furthermore, we provide a comparative analysis of different medical sensors, devices, and methods to measure and collect the risk factors values in the system. Numerical experiments and comparative analysis were carried out between our proposed system, using the most accurate random forest (RF) model, and the two most used state-of-the-art machine learning approaches, Logistic Regression (LR) and Support Vector Machine (SVM), using three real-life diabetes datasets. The results show that the proposed system using RF predicts diabetes with 4.57% more accuracy on average compared to LR and SVM, with 2.87 times more execution time. Data balancing without feature selection does not show significant improvement. The performance is improved by 1.14% and 0.02% after feature selection for PIMA Indian and Sylhet datasets respectively, while it reduces by 0.89% for MIMIC III. © 2022, CC BY.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

Job Placement Strategy with Opportunistic Resource Sharing for Distributed Deep Learning Clusters

Job Placement Strategy with Opportunistic Resource Sharing f...

引用

IEEE International Conference on high performance computing and Communications (HPCC)

作者： Hongliang Li Ting Sun Xiang Li Haixiao Xu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China High Performance Computing Center of Jilin University Changchun China

ISBN: (纸本)9781728176505

Distributed deep learning frameworks train large deep leaning workload with multiple training jobs on shared distributed GPU servers. There are new challenges when scheduling resources for these systems. Modern deep learning training jobs tend to consume large amount of GPU memory. A training job has an iterative nature that causes the memory usage fluctuate overtime. Jobs sharing a host may suffer from significant performance degradation caused by memory overload in runtime. Moreover, even without memory overloads, deep learning training jobs still experience different levels of performance interference when sharing a GPU device. This paper studies these two issues. We introduced an opportunistic memory sharing model to allocate resources for training jobs with time-varying memory requirements. Based on this model, we introduced an opportunistic Job Placement Problem (OJPP) for shared GPU clusters that seeks job placement configurations using minimum number of GPU devices and guarantees user-defined performance requirements. We proposed a greedy algorithm and a heuristic algorithm with computational complexities of $O(n\log n)$ and $O(n^performance\log n)$, respectively, to solve the problem. Extensive experiments are conducted using a GPU cluster to verify the correctness, effectiveness, and the scalability of our approaches. The proposed approach achieved over 80% percent of the standalone performance, in term of average job completion time, with less than 30% extra resources consumption.

关键词： Training Deep learning performance evaluation Greedy algorithms high performance computing Heuristic algorithms Computational modeling

来源：评论

学校读者我要写书评

暂无评论

performance and energy-aware bi-objective tasks scheduling for cloud data centers

arXiv

引用

arXiv 2021年

作者： Materwala, Huned Ismail, Leila Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi15551 United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates

Cloud computing enables remote execution of users' tasks. The pervasive adoption of cloud computing in smart cities' services and applications requires timely execution of tasks adhering to Quality of Services (QoS). However, the increasing use of computing servers exacerbates the issues of high energy consumption, operating costs, and environmental pollution. Maximizing the performance and minimizing the energy in a cloud data center is challenging. In this paper, we propose a performance and energy optimization bi-objective algorithm to tradeoff the contradicting performance and energy objectives. An evolutionary algorithm-based multi-objective optimization is for the first time proposed using system performance counters. The performance of the proposed model is evaluated using a realistic cloud dataset in a cloud computing environment. Our experimental results achieve higher performance and lower energy consumption compared to a state-of-the-art algorithm. © 2021, CC BY.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：