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

arXiv 2023年

作者： Wang, Sihua Chen, Mingzhe Shen, Cong Yin, Changchuan Brinton, Christopher G. The Beijing Laboratory of Advanced Information Network The Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Charles L. Brown Department of Electrical and Computer Engineering University of Virginia CharlottesvilleVA United States The School of Electrical and Computer Engineering Purdue University West LafayetteIN United States

In this paper, the performance optimization of federated learning (FL), when deployed over a realistic wireless multiple-input multiple-output (MIMO) communication system with digital modulation and over-the-air computation (AirComp) is studied. In particular, a MIMO system is considered in which edge devices transmit their local FL models (trained using their locally collected data) to a parameter server (PS) using beamforming to maximize the number of devices scheduled for transmission. The PS, acting as a central controller, generates a global FL model using the received local FL models and broadcasts it back to all devices. Due to the limited bandwidth in a wireless network, AirComp is adopted to enable efficient wireless data aggregation. However, fading of wireless channels can produce aggregate distortions in an AirComp-based FL scheme. To tackle this challenge, we propose a modified federated averaging (FedAvg) algorithm that combines digital modulation with AirComp to mitigate wireless fading while ensuring the communication efficiency. This is achieved by a joint transmit and receive beamforming design, which is formulated as an optimization problem to dynamically adjust the beamforming matrices based on current FL model parameters so as to minimize the transmitting error and ensure the FL performance. To achieve this goal, we first analytically characterize how the beamforming matrices affect the performance of the FedAvg in different iterations. Based on this relationship, an artificial neural network (ANN) is used to estimate the local FL models of all devices and adjust the beamforming matrices at the PS for future model transmission. The algorithmic advantages and improved performance of the proposed methodologies are demonstrated through extensive numerical experiments. Copyright © 2023, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Diagnosis of COVID-19 Pneumonia via a Novel Deep Learning architecture

引用

Journal of computer Science & technology 2022年第2期37卷 330-343页

作者： Xin Zhang Siyuan Lu Shui-Hua Wang Xiang Yu Su-Jing Wang Lun Yao Yi Pan Yu-Dong Zhang Department of Medical Imaging The Fourth People's Hospital of Huai'anHuai'an 223002China School of Informatics University of LeicesterLeicesterLE17RHU.K. School of Architecture Building and Civil Engineering Loughborough UniversityLoughboroughLE113TUU.K. School of Mathematics and Actuarial Science University of LeicesterLeicesterLE17RHU.K. Key Laboratory of Behavior Sciences Institute of PsychologyChinese Academy of SciencesBeijing 100101China Department of Psychology University of the Chinese Academy of SciencesBeijing 100101China Department of Infection Diseases The Fourth People's Hospital of Huai'anHuaian 223002China Department of Computer Science Georgia State UniversityAtlanta 30302-5060U.S.A. Department of Information Systems Faculty of Computing and Information TechnologyKing Abdulaziz University Jeddah 21589Saudi Arabia

COVID-19 is a contagious infection that has severe effects on the global economy and our daily *** diagnosis of COVID-19 is of importance for consultants,patients,and *** this study,we use the deep learning network AlexNet as the backbone,and enhance it with the following two aspects:1)adding batch normalization to help accelerate the training,reducing the internal covariance shift;2)replacing the fully connected layer in AlexNet with three classifiers:SNN,ELM,and ***,we have three novel models from the deep COVID network(DC-Net)framework,which are named DC-Net-S,DC-Net-E,and DC-Net-R,*** comparison,we find the proposed DC-Net-R achieves an average accuracy of 90.91%on a private dataset(available upon email request)comprising of 296 images while the specificity reaches 96.13%,and has the best performance among all three proposed *** addition,we show that our DC-Net-R also performs much better than other existing algorithms in the literature.

关键词： pneumonia COVID-19 convolutional neural network AlexNet deep learning

来源：评论

学校读者我要写书评

暂无评论

Low-Light Enhancement Effect on Classification and Detection: An Empirical Study

arXiv

引用

arXiv 2024年

作者： Wu, Xu Lai, Zhihui Jie, Zhou Gao, Can Hou, Xianxu Zhang, Ya-Nan Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China

Low-light images are commonly encountered in real-world scenarios, and numerous low-light image enhancement (LLIE) methods have been proposed to improve the visibility of these images. The primary goal of LLIE is to generate clearer images that are more visually pleasing to humans. However, the impact of LLIE methods in high-level vision tasks, such as image classification and object detection, which rely on high-quality image datasets, is not well explored. To explore the impact, we comprehensively evaluate LLIE methods on these high-level vision tasks by utilizing an empirical investigation comprising image classification and object detection experiments. The evaluation reveals a dichotomy: While Low-Light Image Enhancement (LLIE) methods enhance human visual interpretation, their effect on computer vision tasks is inconsistent and can sometimes be harmful. Our findings suggest a disconnect between image enhancement for human visual perception and for machine analysis, indicating a need for LLIE methods tailored to support high-level vision tasks effectively. This insight is crucial for the development of LLIE techniques that align with the needs of both human and machine vision. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

Research on rough set theory and applications in China

引用

Lecture Notes in computer Science

作者： Wang, Guoyin Zhang, Qinghua Huang, Houkuan Ye, Dongyi Hu, Qinghua Hu, Xuegang Shi, Zhongzhi Li, Yongli Shang, Lin An, Liping Sai, Ying Chen, Shanben Liang, Jiye Qin, keyun Zeng, Huanglin Xie, Keming Miao, Duoqian Min, Fan Wu, Zhaocong Wu, Weizhi Dai, Jianhua Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China School of Computer and Information Technology Beijing Jiaotong University Beijing 100044 China College of Math. and Computer Fuzhou University Fuzhou 350002 China Harbin Institute of Technology PO Box 458 Harbin 150006 China School of Computer and Information Hefei University of Technology Hefei 230009 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Lanzhou University No.222 Tianshui South Rd. Lanzhou 730000 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Management Science and Engineering Department Business School Nankai University Tianjin 300071 China Shandong University of Finance No.40 Shun-geng Road Jinan 250014 China Welding Engineering Institute Shanghai Jiaotong University Shanghai 200030 China School of Computer and Information Technology Shanxi University Taiyuan 030006 China Intelligent Control Development Center Southwest Jiaotong University Chengdu 610031 China Artificial Intelligence of Key Laboratory Sichuan University of Science and Engineering Zigong 643000 China Department of Automation College of Information Engineering Taiyuan University of Technology Taiyuan 030024 China 4800 CaoAn Highway Shanghai 201804 China School of Computer Science and Technology University of Electronic Science and Technology of China Chengdu 610054 China School of Remote Sensing Information Engineering Wuhan University Wuhan 430079 China Institute for Information and System Sciences Faculty of Science Xi'an Jiaotong University Xi'an 710049 China Information College Zhejiang Ocean University Zhejiang 316004 China Institute of Artificial Intelligence Zhejiang University Hangzhou 310027 China

ISBN: (纸本)3540850635

This article gives a capsule view of research on rough set theory and applications ongoing at universities and laboratories in China. Included in this capsule view of rough set research is a brief description of the following things: Chinese research groups on rough set with their URLs for web pages, names of principal researchers (supervisors), numbers of graduate students, and topics being investigated. Statistical summaries showing the growth in the research on rough set theory and application in China are included. In addition, an introduction summarizing the research interests of Chinese researchers is included in this article. The contribution of this article is a complete overview of the principal research directions in rough set theory and its applications in China. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

k-TEVS: A k-Times E-Voting Scheme on Blockchain with Supervision

引用

IEEE Transactions on Dependable and Secure computing 2024年

作者： Liu, Yang He, Debiao Luo, Min Wang, Lianhai Peng, Cong The School of Cyber Science and Engineering Wuhan University Wuhan430072 China The Institute of Information Technology Shenzhen Institute of Information Technology Shenzhen518172 China The School of Cyber Science and Engineering Wuhan University Wuhan China The Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Jinan250014 China The Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Shanghai200232 China The Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China

The e-vote is regarded as a way to express the opinion that the voters ask for. Actually, the e-vote could be applied wildly like questionnaire, survey and feedback. Moreover, the coexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storage costs for the field consisted of the vote group manager (GM) with its vote assistants (VA). Particularly the k-times anonymous authentication (k-TAA) could also be a practical approach to preserve voters’ privacy and reduce the computation costs during the vote process. However, the e-vote scheme with pure k-TAA strategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k-TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme. © 2004-2012 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Training, testing and benchmarking medical AI models using Clinical AIBench

引用

BenchCouncil Transactions on Benchmarks, Standards and Evaluations 2022年第1期2卷 100037-100037页

作者： Huang, Yunyou Miao, Xiuxia Zhang, Ruchang Ma, Li Liu, Wenjing Zhang, Fan Guan, Xianglong Liang, Xiaoshuang Lu, Xiangjiang Tang, Suqing Zhang, Zhifei Guangxi Key Lab of Multi-Source Information Mining & Security School of Computer Science and Engineering & School of Software Guangxi Normal University Guilin China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Guilin Medical University Guilin China Department of Physiology and Pathophysiology Capital Medical University Beijing China Faculty of Education Guangxi Normal University Guilin China International Open Benchmark Council Beijing China

AI technology has been used in many clinical research fields, but most AI technologies are difficult to land in real-world clinical settings. In most current clinical AI research settings, the diagnosis task is to identify different types of diseases among the given ones. However, the diagnosis in real-world settings needs dynamically developing inspection strategies based on the existing resources of medical institutions and identifying different kinds of diseases out of many possibilities. To promote the development of different clinical AI technologies and the implementation of clinical applications, we propose a benchmark named Clinical AIBench for developing, verifying, and evaluating clinical AI technologies in real-world clinical settings. Specifically, Clinical AIBench can be used for: (1) Model training and testing: Researchers can use the data to train and test their models. (2)Model evaluation: Researchers can use Clinical AIBench to objectively, fairly, and comparably evaluate various models of different researchers. (3) Clinical value evaluation: Researchers can use the clinical indicators provided by Clinical AIBench to evaluate the clinical value of models, which will be applied in real-world clinical settings. For convenience, Clinical AIBench provides three different levels of clinical settings: restricted clinical setting, which is named closed clinical setting, data island clinical setting, and real-world clinical setting, which is called open clinical setting. In addition, Clinical AIBench covers three diseases: Alzheimer's disease, COVID-19, and dental. Clinical AIBench provides python APIs to researchers. The data and source code are publicly available from the project website https://***/clinical_aibench/. © 2022 The Authors

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

International Conference on Advanced Mechatronic systems (ICAMechS)

作者： YuFeng Chen MengChu Zhou XiaoOu Li School of Electro-Mechanical Engineering Xidian University Xi'an China Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA Departamento de Computacion CINVESTAVIPN Mexico Distrito Federal Mexico

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method.

关键词： Law Optimal control Vectors Aerospace electronics Petri nets system recovery

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2019年

作者： Liao, Hao Liu, Ming-Kai Mariani, Manuel Sebastian Zhou, Mingyang Wu, Xingtong 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 Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610051 China URPP Social Networks Universität Zürich CH-8050 Switzerland

When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hidden propagation paths based on the observed diffusion process is a challenging problem which has recently attracted attention from diverse research fields. To address this reconstruction problem, based on static similarity metrics commonly used in the link prediction literature, we introduce new node-node temporal similarity metrics. The new metrics take as input the time-series of multiple independent spreading processes, based on the hypothesis that two nodes are more likely to be connected if they were often infected at similar points in time. This hypothesis is implemented by introducing a time-lag function which penalizes distant infection times. We find that the choice of this time-lag strongly affects the metrics' reconstruction accuracy, depending on the network's clustering coefficient and we provide an extensive comparative analysis of static and temporal similarity metrics for network reconstruction. Our findings shed new light on the notion of similarity between pairs of nodes in complex networks. Copyright © 2019, The Authors. All rights reserved.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Look Inside for More: Internal Spatial Modality Perception for 3D Anomaly Detection

arXiv

引用

arXiv 2024年

作者： Liang, Hanzhe Xie, Guoyang Hou, Chengbin Wang, Bingshu Gao, Can Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Audencia Financial Technology Institute Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Intelligent Manufacturing CATL Ningde China School of Computing and Artificial Intelligence Fuyao University of Science and Technology Fuzhou China School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

3D anomaly detection has recently become a significant focus in computer vision. Several advanced methods have achieved satisfying anomaly detection performance. However, they typically concentrate on the external structure of 3D samples and struggle to leverage the internal information embedded within samples. Inspired by the basic intuition of why not look inside for more, we introduce a straightforward method named Internal Spatial Modality Perception (ISMP) to explore the feature representation from internal views fully. Specifically, our proposed ISMP consists of a critical perception module, Spatial Insight Engine (SIE), which abstracts complex internal information of point clouds into essential global features. Besides, to better align structural information with point data, we propose an enhanced key point feature extraction module for amplifying spatial structure feature representation. Simultaneously, a novel feature filtering module is incorporated to reduce noise and redundant features for further aligning precise spatial structure. Extensive experiments validate the effectiveness of our proposed method, achieving object-level and pixel-level AUROC improvements of 4.2% and 13.1%, respectively, on the Real3D-AD benchmarks. Note that the strong generalization ability of SIE has been theoretically proven and is verified in both classification and segmentation tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Multicast Mm Wave MIMO Networks with Mobile Users

Performance Optimization for Multicast Mm Wave MIMO Networks...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Songling Zhang Mingzhe Chen Wenjing Zhang Zhaohui Yang Danpu Liu Zhilong Zhang Kai-Kit Wong Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Zhejiang Lab Hangzhou China Zhejiang University Hangzhou China Department of Electronic and Electrical Engineering University College London London UK

ISBN: (数字)9798350304053

ISBN: (纸本)9798350304060

In this paper, the problem of maximizing the sum rate of mobile users in a multi-base station (BS) cooperative millimeter-wave (mmWave) multicast communication system is studied. In the considered model, due to the real-time mobility of users, the users being served by a given BS and beamforming of BSs and users are dynamic. Multiple BSs must cooperate to serve dynamic requests of multiple mobile users. This problem is posed as an optimization framework whose goal is to maximize the sum rate of all mobile users by jointly optimizing the number of users served by all BSs and beamforming matrices of both BSs and users. To solve this non-convex optimization problem, we first introduce a value decomposition based reinforcement learning (VD- RL) algorithm to determine the users to be served by each BS. Then, we use the block diagonalization method to obtain the fully digital transmit beamforming matrices of all BSs as well as the receive beamforming matrices of the users. Finally, a fast optimization algorithm is used to optimize the hybrid beamforming matrices of both BSs and users. Simulation results show that, the proposed algorithm can achieve up to 51 % gain in terms of the sum rate of all mobile users compared to baseline multi-agent algorithms.

关键词： Multicast algorithms Array signal processing Heuristic algorithms Simulation Conferences Multicast communication Real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：