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

arXiv 2020年

作者： Wang, Weisen Li, Xirong Xu, Zhiyan Yu, Weihong Zhao, Jianchun Ding, Dayong Chen, Youxin The MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China Aimc Lab School of Information Renmin University of China Beijing100872 China Vistel Ai Lab Visionary Intelligence Ltd. Beijing100872 China The Key Lab of Ocular Fundus Disease Chinese Academy of Medical Sciences Dept. of Ophthalmology Peking Union Medical College Hospital Beijing100730 China

This paper tackles automated categorization of Agerelated Macular Degeneration (AMD), a common macular disease among people over 50. Previous research efforts mainly focus on AMD categorization with a single-modal input, let it be a color fundus photograph (CFP) or an OCT B-scan image. By contrast, we consider AMD categorization given a multi-modal input, a direction that is clinically meaningful yet mostly unexplored. Contrary to the prior art that takes a traditional approach of feature extraction plus classifier training that cannot be jointly optimized, we opt for end-to-end multi-modal Convolutional Neural Networks (MM-CNN). Our MM-CNN is instantiated by a two-stream CNN, with spatially-invariant fusion to combine information from the CFP and OCT streams. In order to visually interpret the contribution of the individual modalities to the final prediction, we extend the class activation mapping (CAM) technique to the multi-modal scenario. For effective training of MM-CNN, we develop two data augmentation methods. One is GAN-based CFP/OCT image synthesis, with our novel use of CAMs as conditional input of a high-resolution image-to-image translation GAN. The other method is Loose Pairing, which pairs a CFP image and an OCT image on the basis of their classes instead of eye identities. Experiments on a clinical dataset consisting of 1,094 CFP images and 1,289 OCT images acquired from 1,093 distinct eyes show that the proposed solution obtains better F1 and Accuracy than multiple baselines for multimodal AMD categorization. Code and data are available at https://***/li-xirong/mmc-amd. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Measurement of Br(n,γ)cross sections up to stellar s-process temperatures at the CSNS Back‑n

引用

Nuclear Science and Techniques 2023年第11期34卷 226-241页

作者： Gao‑Le Yang Zhen‑Dong An Wei Jiang Xian‑Kai Li Wei‑Wei Qiu Zheng‑Fa Liao Zi‑Yue Zhuang Xiao‑Ping Zhang Sheng‑Li Chen Chen‑Chen Guo Er‑Xi Xiao Xiao Fang Xin‑Xiang Li Xin‑Rong Hu Bing Jiang Jin‑Cheng Wang Jie Ren Wen Luo Zhi‑Chao Zhu Hao‑Yang Lan Zong‑Wei Cao Xu Ma Ying‑Du Liu Pu‑Sen Wang Yi Yang Ping Su Xian‑Gai Deng Wan‑Bing He Chun‑Wang Ma Yu‑Ting Wang Zhi‑Tao Dai Peng‑Qin He Ren‑Guang Tang Tao Zhou Jing Wang Han Yi Yue Zhang Yong‑Hao Chen Rui‑Rui Fan Ke‑Qing Gao Qiang Li Kang Sun Zhi‑Xin Tan Min‑Hao Gu Han‑Tao Jing Jing‑Yu Tang School of Physics and Astronomy Sun Yat-sen UniversityZhuhai 519082China Shanghai Institute of Applied Physics Chinese Academy of SciencesShanghai 201800China State Key Laboratory of Lunar and Planetary Sciences Macao University of Science and TechnologyMacao 999078China CNSA Macao Center for Space Exploration and Science Macao 999078China Institute of High Energy Physics Chinese Academy of SciencesBeijing 100049China Spallation Neutron Source Science Center Dongguan 523803China School of Nuclear Science and Technology University of South ChinaHengyang 421001China Sino‑French Institute of Nuclear Engineering and Technology Sun Yat-sen UniversityZhuhai 519082China University of Chinese Academy of Sciences Beijing 100049China Key Laboratory of Nuclear Data China Institute of Atomic EnergyBeijing 102413China School of Materials Science and Engineering Xiangtan UniversityXiangtan 411100China Key Laboratory of Nuclear Physics and Ion‑beam Application(MOE) Institute of Modern PhysicsDepartment of Nuclear Science and TechnologyFudan UniversityShanghai 200433China Institute of Particle and Nuclear Physics Henan Normal UniversityXinxiang 453007China School of Physics Henan Normal UniversityXinxiang 453007China Shenzhen Center Cancer hospitalChinese Academy of Medical SciencesShenzhen 518100China School of Nuclear Science and Technology University of Science and Technology of ChinaHefei 230027China

The neutron capture cross sections(n,γ)of bromine were obtained using the time-of-flight technique at the Back-n facility of the China Spallation Neutron ***γ-rays originating from neutron-induced capture events were detected using four C_(6)D_(6) *** pulse-height weighting technique and double-bunch unfolding method based on Bayesian theory were used in the data *** deductions,normalization,and corrections were carefully considered to obtain reliable measurement *** multilevel R-matrix Bayesian code SAMMY was used to extract the resonance parameters in the resolved resonance region(RRR).The average cross sections in the unresolved resonance region(URR)were obtained from 10 to 400 *** experimental results were compared with data from several evaluated libraries and previous experi-ments in the RRR and *** TALYS code was used to describe the average cross sections in the *** astrophysical Maxwell average cross sections(MACSs)of ^(79,81)Br from kT=5 to 100 keV were calculated over a sufficiently wide range of neutron *** a thermal energy of kT=30 keV,the MACS value for ^(79)Br 682±68 mb was in good agreement with the KADoNiS v1.0 recommended *** contrast,the value of 293±29 mb for ^(81)Br was substantially higher than that of the evaluated database and the KADoNiS v1.0 recommended value.

关键词： Time-of-flight technique Neutron capture cross sections Maxwell average cross sections

来源：评论

学校读者我要写书评

暂无评论

Detection of ChatGPT Fake Science with the xFakeSci Learning Algorithm

arXiv

引用

arXiv 2023年

作者： Hamed, Ahmed Abdeen Wu, Xindong Complex Adaptive Systems and Computational Intelligence Laboratory State University of New York at Binghamton BinghamtonNY13902 United States Sano Centre for Computational Medicine Clinical Data Science Cracow30-072 Poland Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei230009 China China Electronics Data Industry Group Shenzhen518057 China

Generative AI tools exemplified by ChatGPT are becoming a new reality. This study is motivated by the premise that "AI generated content may exhibit a distinctive behavior that can be separated from scientific articles". In this study, we show how articles can be generated using means of prompt engineering for various diseases and conditions. We then show how we tested this premise in two phases and prove its validity. Subsequently, we introduce xFakeSci, a novel learning algorithm, that is capable of distinguishing ChatGPT-generated articles from publications produced by scientists. The algorithm is trained using network models driven from both sources. To mitigate overfitting issues, we incorporated a calibration step that is built upon data-driven heuristics, including proximity and ratios. Specifically, from a total of a 3952 fake articles for three different medical conditions, the algorithm was trained using only 100 articles, but calibrated using folds of 100 articles. As for the classification step, it was performed using 300 articles per condition. The actual label steps took place against an equal mix of 50 generated articles and 50 authentic PubMed abstracts. The testing also spanned publication periods from 2010 to 2024 and encompassed research on three distinct diseases: cancer, depression, and Alzheimer’s. Further, we evaluated the accuracy of the xFakeSci algorithm against some of the classical data mining algorithms (e.g., Support Vector Machines, Regression, and Naive Bayes). The xFakeSci algorithm achieved F1 scores ranging from 80% to 94%, outperforming common data mining algorithms, which scored F1 values between 38% and 52%. We attribute the noticeable difference to the introduction of calibration and a proximity distance heuristic, which underscores this promising performance. Indeed, the prediction of fake science generated by ChatGPT presents a considerable challenge. Nonetheless, the introduction of the xFakeSci algorithm is a significant st

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

arXiv

引用

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Overview of Speaker Modeling and Its Applications: From the Lens of Deep Speaker Representation Learning

arXiv

引用

arXiv 2024年

作者： Wang, Shuai Chen, Zhengyang Lee, Kong Aik Qian, Yanmin Li, Haizhou Shenzhen Research Institute of Big Data School of Data Science The Chinese University of Hong Kong Guangdong Shenzhen518172 China Auditory Cognition and Computational Acoustics Lab The Department of Computer Science and Engineering The MoE Key Laboratory of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai200240 China Department of Electrical and Electronic Engineering The Hong Kong Polytechnic University Hong Kong

Speaker individuality information is among the most critical elements within speech signals. By thoroughly and accurately modeling this information, it can be utilized in various intelligent speech applications, such as speaker recognition, speaker diarization, speech synthesis, and target speaker extraction. In this overview, we present a comprehensive review of neural approaches to speaker representation learning from both theoretical and practical perspectives. Theoretically, we discuss speaker encoders ranging from supervised to self-supervised learning algorithms, standalone models to large pretrained models, pure speaker embedding learning to joint optimization with downstream tasks, and efforts toward interpretability. Practically, we systematically examine approaches for robustness and effectiveness, introduce and compare various open-source toolkits in the field. Through the systematic and comprehensive review of the relevant literature, research activities, and resources, we provide a clear reference for researchers in the speaker characterization and modeling field, as well as for those who wish to apply speaker modeling techniques to specific downstream tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Videos

arXiv

引用

arXiv 2024年

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A*STAR Singapore Georgia Institute of Technology Atlanta United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a byproduct of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatiotemporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Towards Feature Distribution Alignment and Diversity Enhancement for data-Free Quantization

Towards Feature Distribution Alignment and Diversity Enhance...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Richang Hong Haijun Zhang Jicong Fan Shuicheng Yan School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Department of Computer Science Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China National University of Singapore Singapore

To obtain lower inference latency and less memory footprint of deep neural networks, model quantization has been widely employed in deep model deployment, by converting the floating points to low-precision integers. However, previous methods (such as quantization aware training and post training quantization) require original data for the fine-tuning or calibration of quantized model, which makes them inapplicable to the cases that original data are not accessed due to privacy or security. This gives birth to the data-free quantization method with synthetic data generation. While current data-free quantization methods still suffer from severe performance degradation when quantizing a model into lower bit, caused by the low inter-class separability of semantic features. To this end, we propose a new and effective data-free quantization method termed ClusterQ, which utilizes the feature distribution alignment for synthetic data generation. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics to imitate the distribution of real data, so that the performance degradation is alleviated. Moreover, we incorporate the diversity enhancement to solve class-wise mode collapse. We also employ the exponential moving average to update the centroid of each cluster for further feature distribution improvement. Extensive experiments based on different deep models (e.g., ResNet-18 and MobileNet-V2) over the ImageNet dataset demonstrate that our proposed ClusterQ model obtains state-of-the-art performance.

关键词： Degradation Training Quantization (signal) Semantics Neural networks Memory management data models

来源：评论

学校读者我要写书评

暂无评论

Towards certifying ∞ robustness using neural networks with ∞-dist neurons

arXiv

引用

arXiv 2021年

作者： Zhang, Bohang Cai, Tianle Lu, Zhou He, Di Wang, Liwei Key Laboratory of Machine Perception MOE School of EECS Peking University Department of Electrical and Computer Engineering Princeton University Zhongguancun Haihua Institute for Frontier Information Technology Department of Computer Science Princeton University Microsoft Research Center for Data Science Peking University

It is well-known that standard neural networks, even with a high classification accuracy, are vulnerable to small ∞-norm bounded adversarial perturbations. Although many attempts have been made, most previous works either can only provide empirical verification of the defense to a particular attack method, or can only develop a certified guarantee of the model robustness in limited scenarios. In this paper, we seek for a new approach to develop a theoretically principled neural network that inherently resists ∞ perturbations. In particular, we design a novel neuron that uses ∞-distance as its basic operation (which we call ∞-dist neuron), and show that any neural network constructed with ∞-dist neurons (called ∞-dist net) is naturally a 1-Lipschitz function with respect to ∞-norm. This directly provides a rigorous guarantee of the certified robustness based on the margin of prediction outputs. We then prove that such networks have enough expressive power to approximate any 1-Lipschitz function with robust generalization guarantee. We further provide a holistic training strategy that can greatly alleviate optimization difficulties. Experimental results show that using ∞-dist nets as basic building blocks, we consistently achieve state-of-the-art performance on commonly used datasets: 93.09% certified accuracy on MNIST (∊ = 0.3), 35.42% on CIFAR-10 (∊ = 8/255) and 16.31% on TinyImageNet (∊ = 1/255). Copyright © 2021, The Authors. All rights reserved.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Finding the proper node ranking method for complex networks

arXiv

引用

arXiv 2018年

作者： Yu, Senbin Gao, Liang Wang, Yi-Fan Institute of Transportation Systems Science and Engineering MOE Key Laboratory of Urban Transportation System Theory and Technology State Key Laboratory of Rail Traffic Control and Safety Center of Cooperative Innovation for Beijing Metropolitan Transportation Beijing Jiaotong University Beijing100044 China Yinchuan Municipal Bureau of Big Data Management and Service Yinchuan750011 China

Ranking node importance is crucial in understanding network structure and function on complex networks. Degree, h-index and coreness are widely used, but which one is more proper to a network associated with a dynamical process, e.g. SIR spreading process, is still unclear. To fill this gap, a, which is extracted from the fitting 1 function (f(x) = 1 − e2a(x−b)+1) of the average number of nodes in each radius of the neighborhood of a node, is proposed. Experiment results which are carried out on twenty real-world networks show that a can classify which of the three measures (degree, h-index and coreness) is more proper to a network in ranking node importance. We also find that [b/3] is a good indicator for forecasting the optimal radius of the neighborhood of a node in ranking node importance for a given network. To the best of our knowledge, it is the first solution of this interesting and open issue. Furthermore, by extending the range of neighborhood where we construct an operator ℋ on of a node, we propose a new method to quantify the importance of a node. The ranking accuracies of most networks can be improved when the radius is increased from 0 to its forecasting optimal radius and the improvement, for the best case, reaches up to 111%. The performances will reduce on half of the networks studied in this paper if we roughly extend the radius of the neighborhood. Our work deepens the understanding of how to find out the proper node ranking method for complex networks. The proposed methods bridge the gaps among network structure and node importance, and may have potential applications in controlling the outbreak of disease, designing of optimal information spreading *** Codes Game theory, economics, social and behavioral sciences Copyright © 2018, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Local articulation points in complex networks

arXiv

引用

arXiv 2018年

作者： Yu, Senbin Gao, Liang Song, Rongqiu Institute of Transportation Systems Science and Engineering MOE Key Laboratory of Urban Transportation System Theory and Technology State Key Laboratory of Rail Traffic Control and Safety Center of Cooperative Innovation for Beijing Metropolitan Transportation Beijing Jiaotong University Beijing100044 China Yinchuan Municipal Bureau of Big Data Management and Service Yinchuan750011 China

An articulation point (AP) is any node whose removal increases the number of connected components of a graph. There is no doubt that this kind of node which occupies a non-ignorable fraction of real-world networks plays a key role in ensuring the connectivity. However, we should not thus neglect the impacts of non-APs nodes. In this paper, we define a local AP (LAP) whose removal will increase the number of connected components within its r-step neighborhood. Through investigating the fraction of LAPs in forty-five real networks, we find a critical proportion Scr, which is equal to 0.5 (S = r/D, D is the diameter of a network), and this result can also be turned out in ER networks. In addition, we present a unique advantage of LAPs in dismantling networks under the process of targeted attack, compared with APs, which provide another way of thinking to improve the calculation efficiency of APs and design better targeted attack strategy of network *** Codes Game theory, economics, social and behavioral sciences Copyright © 2018, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：