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

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

来源：评论

学校读者我要写书评

暂无评论

Study of Star/Galaxy Classification Based on the XGBoost Algorithm

引用

Chinese Astronomy and Astrophysics 2019年第4期43卷 539-548页

作者： Chao, Li Wen-hui, Zhang Ji-ming, Lin College of Information and Communication Engineering Guilin University of Electronic Technology Guilin 541004 Key Laboratory of Cognitive Radio and Information Processing the Ministry of Education Guilin University of Electronic Technology Guilin 541004 Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin 541004 Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin 541004

Machine learning has achieved great success in many areas today. The lifting algorithm has a strong ability to adapt to various scenarios with a high accuracy, and has played a great role in many fields. But in astronomy, the application of lifting algorithms is still rare. In response to the low classification accuracy of the dark star/galaxy source set in the Sloan Digital Sky Survey (SDSS), a new research result of machine learning, eXtreme Gradient Boosting (XGBoost), has been introduced. The complete photometric data set is obtained from the SDSS-DR7, and divided into a bright source set and a dark source set according to the star magnitude. Firstly, the ten-fold cross-validation method is used for the bright source set and the dark source set respectively, and the XGBoost algorithm is used to establish the star/galaxy classification model. Then, the grid search and other methods are used to adjust the XGBoost parameters. Finally, based on the galaxy classification accuracy and other indicators, the classification results are analyzed, by comparing with the models of function tree (FT), Adaptive boosting (Adaboost), Random Forest (RF), Gradient Boosting Decision Tree (GBDT), Stacked Denoising AutoEncoders (SDAE), and Deep Belief Nets (DBN). The experimental results show that, the XGBoost improves the classification accuracy of galaxies in the dark source classification by nearly 10% as compared to the function tree algorithm, and improves the classification accuracy of sources with the darkest magnitudes in the dark source set by nearly 5% as compared to the function tree algorithm. Compared with other traditional machine learning algorithms and deep neural networks, the XGBoost also has different degrees of improvement. © 2019

关键词： Stars: fundamental parameters—galaxies: fundamental parameters—techniques: photometric—methods: data analysis

来源：评论

学校读者我要写书评

暂无评论

The First GECAM Observation Results on Terrestrial Gamma-ray Flashes and Terrestrial Electron Beams

arXiv

引用

arXiv 2023年

作者： Zhao, Y. Liu, J.C. Xiong, S.L. Xue, W.C. Yi, Q.B. Lu, G.P. Xu, W. Lyu, F.C. Sun, J.C. Peng, W.X. Zheng, C. Zhang, Y.Q. Cai, C. Xiao, S. Xie, S.L. Wang, C.W. Tan, W.J. An, Z.H. Chen, G. Du, Y.Q. Huang, Y. Gao, M. Gong, K. Guo, D.Y. He, J.J. Li, B. Li, G. Li, X.Q. Li, X.B. Liao, J.Y. Liang, J. Liang, X.H. Liu, Y.Q. Ma, X. Qiao, R. Song, L.M. Song, X.Y. Sun, X.L. Wang, J. Wang, J.Z. Wang, P. Wen, X.Y. Wu, H. Xu, Y.B. Yang, S. Zhang, B.X. Zhang, D.L. Zhang, F. Zhang, P. Zhang, H.M. Zhang, Z. Zhao, X.Y. Zheng, S.J. Zhang, K.K. Han, X.B. Wu, H.Y. Hu, T. Geng, H. Zhang, H.B. Lu, F.J. Zhang, S.N. Yu, H. Department of Astronomy Beijing Normal University Beijing Beijing100875 China Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences Beijing Beijing100049 China University of Chinese Academy of Sciences Beijing Beijing100049 China School of Physics and Optoelectronics Xiangtan University Hunan Xiangtan411105 China School of Earth and Space Sciences University of Science and Technology of China Anhui Hefei230026 China Electronic Information School Wuhan University Hubei Wuhan430072 China Key Laboratory of Transportation Meteorology of China Meteorological Administration Nanjing Joint Institute for Atmospheric Sciences Jiangsu Nanjing210000 China College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University GuiZhou Guiyang550001 China School of Physics and Electronic Science Guizhou Normal University GuiZhou Guiyang550001 China Institute of Astrophysics Central China Normal University HuBei Wuhan430079 China School of Computing and Artificial Intelligence Southwest Jiaotong University SiChuan Chengdu611756 China College of Electronic and Information Engineering Tongji University Shanghai Shanghai201804 China Innovation Academy for Microsatellites Chinese Academy of Sciences Shanghai Shanghai201304 China National Space Science Center Chinese Academy of Sciences Beijing Beijing100190 China Key Laboratory of Middle Atmosphere and Global Environment Observation Institute of Atmospheric Physics Chinese Academy of Sciences Beijing Beijing100029 China

Gravitational-wave high-energy Electromagnetic Counterpart All-sky Monitor (GECAM) is a space-borne instrument dedicated to monitoring high-energy transients, including Terrestrial Gamma-ray Flashes (TGFs) and Terrestrial Electron Beams (TEBs). We implemented a TGF/TEB search algorithm for GECAM, with which 147 bright TGFs, 2 typical TEBs and 2 special TEB-like events are identified during an effective observation time of ∼9 months. We show that, with gamma-ray and charged particle detectors, GECAM can effectively identify and distinguish TGFs and TEBs, and measure their temporal and spectral properties in detail. A very high TGF-lightning association rate of ∼80% is obtained between GECAM and GLD360 in east Asia region. Copyright © 2023, The Authors. All rights reserved.

关键词： Electron beams

来源：评论

学校读者我要写书评

暂无评论

Matrix Classifier On Dynamic Functional Connectivity For Mci Identification

Matrix Classifier On Dynamic Functional Connectivity For Mci...

引用

IEEE International Conference on Image Processing

作者： Lei Zhou Liang Zhang Xiao Bai Jun Zhou School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing State Key Laboratory of Software Development Environment Beihang University Beijing School of Information and Communication Technology Griffith University Nathan

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163963

One of the most popular method for Alzheimer's disease (AD) diagnosis is exploring the Brain functional connectivity (FC) from resting-state functional magnetic resonance imaging (RS-fMRI). To early prevent AD, it is crucial to distinguish AD and and its preclinical stage, mild cognitive impairment (MCI) and early MCI (eMCI). In many existing works, dynamic functional connectivity (dFC) which contains rich spatiotemporal information has been exploited for the MCI and eMCI identification. However, most of these dFC based methods only consider the correlation between discrete brain status while ignore the valuable spatiotemporal information contained in dFC. To overcome this limitation, we propose a matrix classifier based method on the dFC signal for MCI and eMCI identification. Specifically, we first represent the dFC correlations by matrix features which contain rich spatiotemporal information and then learn the support matrix machines (SMM) to classify AD and its preclinical stage. Experiments on 600 real people data provide by the Alzheimer's Disease Neuroimaging Initiative (ADNI) demonstrate that our proposed matrix classifier based method outperforms other FC and dFC based methods for both normal controls (NC)/MCI identification and NC/eMCI identification.

关键词： Feature extraction Correlation Dementia Microsoft Windows Spatiotemporal phenomena Training

来源：评论

学校读者我要写书评

暂无评论

Seeking Consensus on Subspaces in Federated Principal Component Analysis

arXiv

引用

arXiv 2020年

作者： Wang, Lei Liu, Xin Zhang, Yin State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China School of Data Science The Chinese University of Hong Kong Shenzhen China

In this paper, we develop an algorithm for federated principal component analysis (PCA) with emphases on both communication efficiency and data privacy. Generally speaking, federated PCA algorithms based on direct adaptations of classic iterative methods, such as simultaneous subspace iterations (SSI), are unable to preserve data privacy, while algorithms based on variable-splitting and consensus-seeking, such as alternating direction methods of multipliers (ADMM), lack in communication-efficiency. In this work, we propose a novel consensus-seeking formulation by equalizing subspaces spanned by splitting variables instead of equalizing variables themselves, thus greatly relaxing feasibility restrictions and allowing much faster convergence. Then we develop an ADMM-like algorithm with several special features to make it practically efficient, including a low-rank multiplier formula and techniques for treating subproblems. We establish that the proposed algorithm can better protect data privacy than classic methods adapted to the federated PCA setting. We derive convergence results, including a worst-case complexity estimate, for the proposed ADMM-like algorithm in the presence of the nonlinear equality constraints. Extensive empirical results are presented to show that the new algorithm, while enhancing data privacy, requires far fewer rounds of communication than existing peer algorithms for federated PCA. Copyright © 2020, The Authors. All rights reserved.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

ADAM CHALLENGE: DETECTING AGE-RELATED MACULAR DEGENERATION FROM FUNDUS IMAGES

arXiv

引用

arXiv 2022年

作者： Fang, Huihui Li, Fei Fu, Huazhu Sun, Xu Cao, Xingxing Lin, Fengbin Son, Jaemin Kim, Sunho Quellec, Gwenole Matta, Sarah Shankaranarayana, Sharath M. Chen, Yi-Ting Wang, Chuen-Heng Shah, Nisarg A. Lee, Chia-Yen Hsu, Chih-Chung Xie, Hai Lei, Baiying Baid, Ujjwal Innani, Shubham Dang, Kang Shi, Wenxiu Kamble, Ravi Singhal, Nitin Wang, Ching-Wei Lo, Shih-Chang Orlando, José Ignacio Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu The ADAM Challenge 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 CONICET Yatiris lab of Pladema Institute Tandil Argentina Department of Ophthalmology and Optometry Medical University of Vienna Vienna Austria VUNO Inc Seoul Korea Republic of Inserm UMR 1101 BrestF-29200 France Univ Bretagne Occidentale BrestF-29200 France Zasti India Pvt. Ltd. India Graphen.Inc Muen Biomedical and Optoelectronics Technologies Inc Taiwan Department of Electrical Engineering Indian Institute of Technology Rajasthan Jodhpur India Department of Electrical Engineering National United University Taiwan Institute of Data Science Department of Statistics National Cheng Kung University Taiwan Shenzhen University Shenzhen China SGGS Institute of Engineering and Technology Nanded India Suzhou Tisu Information Technology Co. Ltd China AIRA Matrix Mumbai India Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taiwan

Age-related macular degeneration (AMD) is the leading cause of visual impairment among elderly in the world. Early detection of AMD is of great importance, as the vision loss caused by this disease is irreversible and permanent. Color fundus photography is the most cost-effective imaging modality to screen for retinal disorders. Cutting edge deep learning based algorithms have been recently developed for automatically detecting AMD from fundus images. However, there are still lack of a comprehensive annotated dataset and standard evaluation benchmarks. To deal with this issue, we set up the Automatic Detection challenge on Age-related Macular degeneration (ADAM), which was held as a satellite event of the ISBI 2020 conference. The ADAM challenge consisted of four tasks which cover the main aspects of detecting and characterizing AMD from fundus images, including detection of AMD, detection and segmentation of optic disc, localization of fovea, and detection and segmentation of lesions. As part of the ADAM challenge, we have released a comprehensive dataset of 1200 fundus images with AMD diagnostic labels, pixel-wise segmentation masks for both optic disc and AMD-related lesions (drusen, exudates, hemorrhages and scars, among others), as well as the coordinates corresponding to the location of the macular fovea. A uniform evaluation framework has been built to make a fair comparison of different models using this dataset. During the ADAM challenge, 610 results were submitted for online evaluation, with 11 teams finally participating in the onsite challenge. This paper introduces the challenge, the dataset and the evaluation methods, as well as summarizes the participating methods and analyzes their results for each task. In particular, we observed that the ensembling strategy and the incorporation of clinical domain knowledge were the key to improve the performance of the deep learning models. © 2022, CC BY-NC-ND.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

SG-PBFT: A secure and highly efficient blockchain PBFT Consensus Algorithm for internet of vehicles

arXiv

引用

arXiv 2021年

作者： Xu, Guangquan Liu, Yihua Xing, Jun Luo, Tao Gu, Yonghao Liu, Shaoying Zheng, Xi Vasilakos, Athanasios V. The Big Data School Qingdao Huanghai University Qingdao266427 China College of Intelligence and Computing Tianjin University Tianjin300350 China The International Engineering Institute Tianjin University Tianjin300350 China The College of Intelligence and Computing Tianjin University Tianjin Tianjin300350 China The school of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China The Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Informatics and Data Science Hiroshima University Japan The Department of Computing Macquarie University SydneyNSW2109 Australia The University of Technology Sydney Australia The Fuzhou University Fuzhou China Lulea University of Technology Lulea Sweden

The Internet of Vehicles (IoV) is an application of the Internet of things (IoT). It faces two main security problems: (1) the central server of the IoV may not be powerful enough to support the centralized authentication of the rapidly increasing connected vehicles, (2) the IoV itself may not be robust enough to single-node attacks. To solve these problems, this paper proposes SG-PBFT: a secure and highly efficient PBFT consensus algorithm for Internet of Vehicles, which is based on a distributed blockchain structure. The distributed structure can reduce the pressure on the central server and decrease the risk of single-node attacks. The SG-PBFT consensus algorithm improves the traditional PBFT consensus algorithm by using a score grouping mechanism to achieve a higher consensus efficiency. The experimental result shows that our method can greatly improve the consensus efficiency and prevent single-node attacks. Specifically, when the number of consensus nodes reaches 1000, the consensus time of our algorithm is only about 27% of what is required for the state-of-the-art consensus algorithm (PBFT). Our proposed SG-PBFT is versatile and can be used in other application scenarios which require high consensus efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

NDRIDC: NMF-based deep representation algorithm for incomplete data clustering

引用

Knowledge-Based Systems 2025年 324卷

作者： Dexian Wang Zonglin Li Sha Yang Tianrui Ren Pengfei Zhang Ping Deng Tianrui Li Chengdu University of Traditional Chinese Medicine Chengdu 611137 China Chinese Academy of Medical Sciences & Peking Union Medical College Beijing 100730 China School of Computer and Software Engineering Xihua University Chengdu 610039 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu 611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu 611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu 611756 China

Incomplete data clustering is a hot research topic in the field of data mining. Many methods based on incomplete clustering have two issues: (1) their models do not have non-negative constraints; (2) their model building strategies do not consider combining traditional machine learning and deep learning. To address these issues, we proposed the NMF-based deep representation algorithm for incomplete data clustering (NDRIDC). First, the element-based objective function is constructed based on the known elements in the incomplete data matrix with matrix factorization principle. Then the NDRIDC deep network is constructed based on the element update gradient and nonlinear function with non-negative value domain. The learning of the NDRIDC network enables the optimization of the objective function and the filling of missing values. Further, based on the same learning framework, the NDRIDC network is employed to perform low-dimensional representation of the filled matrix. Finally, extensive experiments on regular and large-scale datasets show that our proposed algorithm has good performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generative Modelling of the Ageing Heart with Cross-Sectional Imaging and Clinical data

arXiv

引用

arXiv 2022年

作者： Qiao, Mengyun Basaran, Berke Doga Qiu, Huaqi Wang, Shuo Guo, Yi Wang, Yuanyuan Matthews, Paul M. Rueckert, Daniel Bai, Wenjia Department of Computing Imperial College London London United Kingdom Data Science Institute Imperial College London London United Kingdom Department of Brain Sciences Imperial College London London United Kingdom Uk Dementia Research Institute Imperial College London London United Kingdom Klinikum Rechts der Isar Technical University of Munich Munich Germany Department of Electronic Engineering Fudan University Shanghai China Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai China Shanghai Key Laboratory of Miccai Shanghai China

Cardiovascular disease, the leading cause of death globally, is an age-related disease. Understanding the morphological and functional changes of the heart during ageing is a key scientific question, the answer to which will help us define important risk factors of cardiovascular disease and monitor disease progression. In this work, we propose a novel conditional generative model to describe the changes of 3D anatomy of the heart during ageing. The proposed model is flexible and allows integration of multiple clinical factors (e.g. age, gender) into the generating process. We train the model on a large-scale cross-sectional dataset of cardiac anatomies and evaluate on both cross-sectional and longitudinal datasets. The model demonstrates excellent performance in predicting the longitudinal evolution of the ageing heart and modelling its data distribution. The codes are available at https://***/MengyunQ/AgeHeart. © 2022, CC BY-NC-ND.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

Crowd Counting for Static Images: A Survey of Methodology

Crowd Counting for Static Images: A Survey of Methodology

引用

第三十九届中国控制会议

作者： Ying Luo Jinhu Lu Baochang Zhang School of Automation Science and Electrical Engineering Beihang University Shenyuan Honors College Beihang University School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environmentand Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang University

Crowd counting for static images is one of the typical application fields of image processing. it is essential to direct crowd analysis for public security purposes under the background of a rapidly growing social environment. Crowd counting for static images involves crucial challenges such as occlusions, scale variations, scene perspective distortions and diverse crowd distributions. It has now become an independent research hotspot. This paper investigates the literature of crowd counting tasks, summarizes the evolution of counting approaches, compares and analyzes traditional methods and current trends of CNN estimation-based counting, and then evaluates common datasets for crowd counting tasks. Conclusions concerning summarizations and prospects are made.

关键词： Crowd counting crowd analysis pattern recognition computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：