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

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Haijun Zhang Mingbo Zhao Yi Yang Meng Wang 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 Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China City University of Hong Kong Hong Kong SAR Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia

ISBN: (纸本)9781665423991

Deep neural network (DNN) compression can reduce the memory footprint of deep networks effectively, so that the deep model can be deployed on the portable devices. However, most of the existing model compression methods cost lots of time, e.g., vector quantization or pruning, which makes them inept to the real-world applications that need fast online computation. In this paper, we therefore explore how to accelerate the model compression process by reducing the computation cost. Then, we propose a new deep model compression method, termed Dictionary Pair-based data-Free Fast DNN Compression, which aims at reducing the memory consumption of DNNs without extra training and can greatly improve the compression efficiency. Specifically, our proposed method performs tensor decomposition on the DNN model with a fast dictionary pair learning-based reconstruction approach, which can be deployed on different layers (e.g., convolution and fully-connection layers). Given a pre-trained DNN model, we first divide the parameters (i.e., weights) of each layer into a series of partitions for dictionary pair-based fast reconstruction, which can potentially discover more fine-grained information and provide the possibility for parallel model compression. Then, dictionaries of less memory occupation are learned to reconstruct the weights. Extensive experiments on popular DNNs (i.e., VGG-16, ResNet-18 and ResNet-50) showed that our proposed weight compression method can significantly reduce the memory footprint and speed up the compression process, with less performance loss.

关键词： Deep learning Training Performance evaluation Dictionaries Tensors Costs Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Graph convolutional module for temporal action localization in videos

arXiv

引用

arXiv 2021年

作者： Zeng, Runhao Huang, Wenbing Tan, Mingkui Rong, Yu Zhao, Peilin Huang, Junzhou Gan, Chuang The School of Software Engineering South China University of Technology The Pazhou Laboratory Guangzhou China China The School of Software Engineering South China University of Technology The Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China The Tencent AI Laboratory Shenzhen China The MIT-IBM Watson AI Lab CambridgeMA02142 United States

Temporal action localization, which requires a machine to recognize the location as well as the category of action instances in videos, has long been researched in computer vision. The main challenge of temporal action localization lies in that videos are usually long and untrimmed with diverse action contents involved. Existing state-of-the-art action localization methods divide each video into multiple action units (i.e., proposals in two-stage methods and segments in one-stage methods) and then perform action recognition/regression on each of them individually, without explicitly exploiting their relations during learning. In this paper, we claim that the relations between action units play an important role in action localization, and a more powerful action detector should not only capture the local content of each action unit but also allow a wider field of view on the context related to it. To this end, we propose a general graph convolutional module (GCM) that can be easily plugged into existing action localization methods, including two-stage and one-stage paradigms. To be specific, we first construct a graph, where each action unit is represented as a node and their relations between two action units as an edge. Here, we use two types of relations, one for capturing the temporal connections between different action units, and the other one for characterizing their semantic relationship. Particularly for the temporal connections in two-stage methods, we further explore two different kinds of edges, one connecting the overlapping action units and the other one connecting surrounding but disjointed units. Upon the graph we built, we then apply graph convolutional networks (GCNs) to model the relations among different action units, which is able to learn more informative representations to enhance action localization. Experimental results show that our GCM consistently improves the performance of existing action localization methods, including two-stage methods

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A comprehensive exploration of the impact and contribution of polygenic risk score on age at onset of 30 complex diseases

引用

Public Health 2025年 244卷 105754-105754页

作者： Liu, Yuxin Yan, Yu Jiang, Yuchen Wang, Xinyi Lin, Hua Chen, keying Zhang, Shuo Guan, Fengjun Zhang, Pan Wang, Ting Wang, Ke Zheng, Chu Xu, Yue Zeng, Ping Department of Biostatistics School of Public Health Xuzhou Medical University Jiangsu Xuzhou 221004 China Department of Epidemiology and Biostatistics Ministry of Education Key Lab of Environment and Health School of Public Health Tongji Medical College Huazhong University of Science and Technology Hubei Wuhan 430030 China Department of Pediatrics Affiliated Hospital of Xuzhou Medical University Jiangsu Xuzhou 221004 China Department of Control and Prevention of Chronic Non-communicable Diseases Xuzhou Center for Disease Control and Prevention Jiangsu Xuzhou 221000 China Jiangsu Engineering Research Center of Biological Data Mining and Healthcare Transformation Xuzhou Medical University Jiangsu Xuzhou 221004 China

Objectives: Polygenic risk score (PRS) has increasingly shown promise in predicting disease risk;however, studies examining the influence of PRS on age at onset remain limited. This study aimed to systematically assess the impact of PRS on age at onset across multiple diseases. Study design: Prospective cohort study Methods: We calculated PRS with two methods (C+T and PRS-CS) and compared their predictive capability in age at onset of 30 diseases in the UK Biobank. We next evaluated the effect of PRS on age at onset and quantified the influence of PRS on disease risk across early and late onset cases. Results: PRS-CS behaved better in predicting age at onset of most diseases (except for Alzheimer's disease) compared to C+T. Higher PRS was associated with earlier age at onset for 23 diseases, with the average age at onset advanced by 1.94 years. Compared to women, men faced an advanced onset for 5 diseases. Compared to average PRS (20–80 %), individuals in the top 2.5 % of the PRS distribution displayed a significantly earlier age at onset for 19 diseases, ranging from 2.85 (1.68–4.03) years advancement for gout to 13.70 (9.88–17.52) years advancement for Crohn's disease. Compared to the late-onset group, the early-onset group exhibited a greater onset risk in 21 diseases, with the early-onset risk of colon cancer being 2.78-fold higher than the late-onset risk (OR = 11.42 [9.77–12.45] vs. 3.95 [3.85–4.06], P < 0.001). Conclusions: Higher PRS generally leads to earlier age at onset, which supports the potential role of PRS in screening high early-onset risk individuals susceptible to chronic diseases. © 2025 The Royal Society for Public Health

关键词： Age at onset Complex disease Early-onset and late-onset case Polygenic risk score UK Biobank

来源：评论

学校读者我要写书评

暂无评论

Research on the Loading Method of Logistics Vehicle and Cargo Based on IPSO Algorithm

Research on the Loading Method of Logistics Vehicle and Carg...

引用

Chinese Control Conference (CCC)

作者： Zewei Zhao Huqing Wang Zhe Sun Lei Xu Guangfu Gong Xiangpeng Xie Zhixin Sun Post Industry Technology Research and Development Center of the State Posts Bureau (Internet of Things Technology) Nanjing University of Posts and Telecommunications Nanjing P.R. China Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing P. R. China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing P.R. China Anhui Yougu Express Intelligent Technology Co. LTD Nanling Anhui P.R. China

Logistics vehicle and cargo matching problem is a typical combination optimization problem, which has important theoretical and application value in the field of logistics distribution. The proved particle swarm optimization (PSO) algorithm is one of the most extensive optimization methods studied in recent years, with excellent global search ability and convergence speed. Based on the IPSO algorithm, this paper proposes an effective IPSO algorithm model for the matching problem of logistics vehicles and goods, and conducts the corresponding comparative experiment. The final experimental results show that the algorithm has good results in practical application and can provide a feasible optimization method for solving the problem of logistics vehicles and goods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-autoregressive transformer with unified bidirectional decoder for automatic speech recognition

arXiv

引用

arXiv 2021年

作者： Zhang, Chuan-Fei Liu, Yan Zhang, Tian-Hao Chen, Song-Lu Chen, Feng Yin, Xu-Cheng School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education Beijing100083 China USTB-EEasyTech Joint Lab of Artificial Intelligence University of Science and Technology Beijing Beijing100083 China EEasy Technology Company Ltd. Zhuhai519000 China

Non-autoregressive (NAR) transformer models have been studied intensively in automatic speech recognition (ASR), and a substantial part of NAR transformer models is to use the casual mask to limit token dependencies. However, the casual mask is designed for the left-to-right decoding process of the non-parallel autoregressive (AR) transformer, which is inappropriate for the parallel NAR transformer since it ignores the right-to-left contexts. Some models are proposed to utilize right-to-left contexts with an extra decoder, but these methods increase the model complexity. To tackle the above problems, we propose a new non-autoregressive transformer with a unified bidirectional decoder (NAT-UBD), which can simultaneously utilize left-to-right and right-to-left contexts. However, direct use of bidirectional contexts will cause information leakage, which means the decoder output can be affected by the character information from the input of the same position. To avoid information leakage, we propose a novel attention mask and modify vanilla queries, keys, and values matrices for NAT-UBD. Experimental results verify that NAT-UBD can achieve character error rates (CERs) of 5.0%/5.5% on the Aishell1 dev/test sets, outperforming all previous NAR transformer models. Moreover, NAT-UBD can run 49.8× faster than the AR transformer baseline when decoding in a single step. © 2021, CC BY-NC-ND.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Adaptive State Continuity-Based Sparse Inverse Covariance Clustering for Multivariate Time Series

Adaptive State Continuity-Based Sparse Inverse Covariance Cl...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Lei Li Wei Li Jianxing Liao Xuegang Hu Ministry of Education Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei China

ISBN: (数字)9781728159287

ISBN: (纸本)9781728159294

Compared with univariate time series clustering, multivariate time series (MTS) clustering has become a challenging research topic on the data mining of time series. In this paper, a novel model-based approach Adaptive State Continuity-Based Sparse Inverse Covariance Clustering (ASCSICC) is proposed for MTS clustering. Specifically, the state continuity is introduced to make the traditional Gaussian mixture model (GMM) applicable to time series clustering. To prevent overfitting, the alternating direction method of multipliers (ADMM) is applied to optimize the parameter of GMM inverse covariance. In addition, the proposed approach simultaneously segments and clusters the time series. Technically, first, the adaptive state continuity is estimated based on the distance similarity of adjacent time series data. Then, a dynamic programming algorithm of cluster assignment by adaptive state continuity is taken as the E-step, and the ADMM for solving sparse inverse covariance is taken as the M-step. E-step and M-step are combined into an Expectation-Maximization (EM) algorithm to conduct the clustering process. Finally, we show the effectiveness of the proposed approach by comparing the ASC-SICC with several state-of-the-art approaches in experiments on two datasets from real applications.

关键词： Time series analysis Clustering algorithms Covariance matrices Security Pattern analysis Feature extraction Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Discriminative Additive Scale Loss for Deep Imbalanced Classification and Embedding

Discriminative Additive Scale Loss for Deep Imbalanced Class...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Weiming Jiang Yang Wang Qiaolin Ye Mingbo Zhao Mingliang Xu Meng Wang 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 AI team Shanghai Shizhuang Information Technology Co. Ltd Shanghai China College of Information Science and Technology Nanjing Forestry University Nanjing China School of Information Science and Technology Donghua University Shanghai China School of Information Engineering Zhengzhou University Zhengzhou China

ISBN: (纸本)9781665423991

Real-world data in emerging applications may suffer from highly-skewed class imbalanced distribution, however how to deal with this kind of problem appropriately through deep learning needs further investigation. In this paper, we mainly propose a novel cross-entropy based loss function, referred to as Additive Scale Loss (ASL), for deep representation learning and imbalanced classification. To deal with the class imbalanced problem, ASL aims at increasing the loss in case of misclassification, which can avoid the superimposed loss values caused by the large amount of easily classified data in the unbalanced database to dominate the loss value of misclassified data. Moreover, in real-world applications, one data source may be used for multiple scenarios, such as classification and embedding learning, however training two separable models to handle these problems is costly, especially in deep learning area. To tackle this issue, we present and integrate a discriminative inter-class separation term into ASL, and propose a discriminative ASL (D-ASL), which can not only improve the classification performance, but also obtain discriminative representations simultaneously. The discriminative inter-class separation term is general, and can be easily integrated to other loss functions, such as CE and FL, as the byproducts. Finally, a new deep convolutional neural network equipped with D-ASL and a fully-connected (FC) layer is proposed, which can classify the imbalanced image data and obtain the discriminative representations at the same time. Extensive experimental results verified the superior performance of our method.

关键词： Deep learning Training Representation learning Additives databases Soft sensors Conferences

来源：评论

学校读者我要写书评

暂无评论

Blockchain Assisted Federated Learning over Wireless Channels: Dynamic Resource Allocation and Client Scheduling

arXiv

引用

arXiv 2021年

作者： Deng, Xiumei Li, Jun Ma, Chuan Wei, Kang Shi, Long Ding, Ming Chen, Wen Poor, H. Vincent The School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China Zhejiang Lab Hangzhou China Nanjing University of Science and Technology Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China Data61 CSIRO KensingtonWA6152 Australia The Department of Electronics Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Electrical and Computer Engineering Princeton University NJ08544 United States

The blockchain technology has been extensively studied to enable distributed and tamper-proof data processing in federated learning (FL). Most existing blockchain assisted FL (BFL) frameworks have employed a third-party blockchain network to decentralize the model aggregation process. However, decentralized model aggregation is vulnerable to pooling and collusion attacks from the third-party blockchain network. Driven by this issue, we propose a novel BFL framework that features the integration of training and mining at the client side. To optimize the learning performance of FL, we propose to maximize the long-term time average (LTA) training data size under a constraint of LTA energy consumption. To this end, we formulate a joint optimization problem of training client selection and resource allocation (i.e., the transmit power and computation frequency at the client side), and solve the long-term mixed integer non-linear programming based on a Lyapunov technique. In particular, the proposed dynamic resource allocation and client scheduling (DRACS) algorithm can achieve a trade-off of [O(1/V), O(√V)] to balance the maximization of the LTA training data size and the minimization of the LTA energy consumption with a control parameter V. Our experimental results show that the proposed DRACS algorithm achieves better learning accuracy than benchmark client scheduling strategies with limited time or energy consumption. Copyright © 2021, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Records systems and information systems: Connecting in organizations 8th

Records systems and information systems: Connecting in organ...

引用

8th International Joint Conference on knowledge Discovery, knowledge engineering and knowledge Management, IC3K 2016

作者： Xie, Sherry L. Fan, Guanyan Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education of China Beijing100872 China Center for Electronic Records Management Research Beijing100872 China School of Information Resource Management Renmin University of China 59 Zhongguancun Ave Haidian District Beijing100872 China

ISBN: (纸本)9783319997001

The field of Information Systems (ISs) has long been recognized, so has Enterprise Information Systems (EISs), a field close to it. Long existing also in organizations or enterprises is the field of records management, now predominantly digital records management (DRM), which shares the many goals of ISs and EISs in supporting the operation and success of organizations. While the DRM field recognized rather early in its battle to digital records challenges that the need to establish formal collaborations with the ISs and EISs professions, it is still rare to spot today discussions regarding such collaborations in the general information and communication technology (ICT) literature. To help bridge the gap, this chapter introduces to the ISs and EISs professions one of the major developments of the international DRM field, that is, the records systems elaborated by the InterPARES (International Research on Permanent and Authentic Records in Electronic Systems) project, for the purpose of invoking further discussions. © Springer Nature Switzerland AG 2019.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：