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

PROM: A persistent routing optimization method based on supervised learning

Journal of Network and Computer Applications 2025年

作者： Yingya Guo Zebo Huang Mingjie Ding Bin Lin Huan Luo College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China

Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Speaker Extraction with Co-Speech Gestures Cue

arXiv

引用

arXiv 2022年

作者： Pan, Zexu Qian, Xinyuan Li, Haizhou The Integrative Sciences and Engineering Programme The Institute of Data Science National University of Singapore 119077 Singapore The Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore The Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China The School of Data Science The Chinese University of Hong Kong Shenzhen518172 China The University of Bremen 28359 Germany

Speaker extraction seeks to extract the clean speech of a target speaker from a multi-talker mixture speech. There have been studies to use a pre-recorded speech sample or face image of the target speaker as the speaker cue. In human communication, co-speech gestures that are naturally timed with speech also contribute to speech perception. In this work, we explore the use of co-speech gestures sequence, e.g. hand and body movements, as the speaker cue for speaker extraction, which could be easily obtained from low-resolution video recordings, thus more available than face recordings. We propose two networks using the co-speech gestures cue to perform attentive listening on the target speaker, one that implicitly fuses the co-speech gestures cue in the speaker extraction process, the other performs speech separation first, followed by explicitly using the co-speech gestures cue to associate a separated speech to the target speaker. The experimental results show that the co-speech gestures cue is informative in associating with the target speaker. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A residual attention-based privacy-preserving biometrics model of transcriptome prediction from genome

A residual attention-based privacy-preserving biometrics mod...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Cheng Tian Song Liu Jinbao Li Guangchen Wang Luyue Kong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Department of Medicine Shandong Medical College Jinan China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Transcriptome prediction from genetic variation data is an important task in the privacy-preserving and biometrics field, which can better protect genomic data and achieve biometric recognition through transcriptome. Many transcriptome prediction methods have achieved good accuracy from genetic variation data. However, these traditional transcriptome prediction methods have the problems of linear assumption, overfitting, expose personal privacy, and extensive manual optimization. To solve these shortcomings, we propose an attention-based transcriptome prediction model from genetic variation named RATPM that improves the accuracy of transcriptome prediction and protects participant genomic data. In RATPM, we introduce and improve the deep learning model with multi-head self-attention into the transcriptome prediction stage of Predixcan, which uncovers the non-linear relationship between genetic variation and transcriptome. Moreover, we introduce a residual attention module to generate attention-aware features and extract more accurate features at different levels from genetic variation. Furthermore, we introduce the BERT pre-training module to encode genetic variation fully utilizing their contextual information. Our research enables scientific institutions to publish only predicted transcriptomic data for biometric purposes, thus protecting the genomic information of the subjects. Finally, we evaluated our model on the 1000 Genomes and Geuvadis projects datasets to compare with other baseline models.

关键词： Privacy Biometrics (access control) Biological system modeling Genomics Predictive models Feature extraction Gene expression

来源：评论

学校读者我要写书评

暂无评论

A Drug Box Recognition System Based on Deep Learning and Cloud-Edge Collaboration for Pharmacy Automation

A Drug Box Recognition System Based on Deep Learning and Clo...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Honglei Zhu Anming Dong Jiguo Yu Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Key Laboratory of Computing Power Network and Information Security Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Drug box recognition is an integral part of the pharmacy automation system (PAS), which checks for discrepancies between the drugs provided by the system and the doctor’s prescription with the help of modern image recognition techniques. Although deep learning has facilitated the development of pharmacy automation systems, practical applications still face challenges. First, pharmacies update drugs frequently, and many pharmacies across the country are trained independently, which requires consuming massive computational resources. Secondly, the equipment performance of pharmacies is poor, and it’s hard to guarantee the real-time and accuracy of recognition. Therefore, we propose a cloud-side collaborative drug box recognition system. When new drugs are added, the new model is trained in the cloud and uniformly distributed to each edge through this architecture. In terms of real-time recognition, an improved lightweight YOLOv5 model is added to the edge part, and a text recognition module is deployed in the cloud to validate the recognition results at the edge. This cloud-edge collaboration architecture not only ensures the accuracy of recognition, but also reduces the burden on the compute edge, ensures the real-time *** results show that the proposed cloud-edge architecture reduces the recognition latency by 37.18% and achieves a precision of 97.47%. The improved YOLOv5 model reduces GFLOPs by 45% while achieving a 1.6% precision improvement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Trajectory Tracking System for Zebrafish Based on Embedded Edge Artificial Intelligence

A Trajectory Tracking System for Zebrafish Based on Embedded...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Chuanhao Zang Anming Dong Jiguo Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Trajectory tracking of zebrafish is an important requirement in studying neurological disorders and developing new psychoactive drug. However, many challenges emerge for stable tracking, since zebrafish are similar in appearance, occlusion, agile, non-linear in moving and easy to swarm, all of which will lead to mistrack for multiple fish. And there is no precedent for tracking zebrafish through embedded edge artificial intelligence device. To overcome these difficulties, we present a tracking system for zebrafish based on RK3588-S. First, We construct an embedded edge AI hardware system consisting of two cameras driven by the RK3588-S, one for the front view and the other for top view of the fish. Then, we develop a 2D tracking algorithm based on YOLOv5 and the Observation-Centric Simple online and real-time tracking (OC-SORT) algorithm, which are transplanted to the RK3588-S for tracking the top and front views of the fish at the edge device. Compared with the previous methods, our method has fewer ID exchanges and highly real-time. Moreover, we apply the MQTT mechanism to establish communication links between the edge and the cloud to reliably transmit data to the cloud. The correspondence between cloud server and embedded AI is 1: N. Finally, we design a multi-view data fusion association algorithm to fuse the data of the two views in the cloud, which are further utilized to build the 3D tracklets of the zebrafish.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

UJN-Land: A Large-Scale High-Resolution Parcel of Land of Multi-temporal dataset with CNN Based Semantic Segmentation Analysis 7th

UJN-Land: A Large-Scale High-Resolution Parcel of Land of Mu...

引用

7th International Conference on Life System Modeling and Simulation, LSMS 2021, and the 7th International Conference on Intelligent computing for Sustainable Energy and Environment, ICSEE 2021

作者： Shen, Yuan Wang, Yulin Yang, Shiyong Li, Yan Han, Shiyuan Liu, Zhen Xu, Tao School of Information Science and Engineering University of Jinan Jinan250022 China Highresolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China Shandong Institutes of Industrial Technonlogy Jinan250102 China Land Spatial Data and Remote Sensing Technology Institute of Shandong Province Jinan250002 China

ISBN: (纸本)9789811672125

Semantic segmentation of land in remote sensing images plays an important role in urban management and rural planning, and can provide intelligent analysis for urban development. Convolutional neural network (CNN) based methods have achieved good performance in object detection in computer vision, which benefits from the popularity of large-scale datasets. However, most of segmentation of land dataset were constructed based on various satellite images and samples that lack the number and diversity of existing datasets. These problems have brought challenges to the improvement and application of CNN based land parcel segmentation methods. This paper presented a large-scale high-resolution land dataset based on CNN analysis. More than 200,000 images of 256*256 pixels were obtained from Gaofen satellite images with a spatial resolution of 0.8 m, in which four category samples were manually annotated. In the experiment, three CNN based semantic segmentation methods were used as experimental baseline methods. The experimental results showed that the availability of the UJN-Land dataset is beneficial to the planning and management of cultivated land. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Learning for IRS-Assisted MEC Systems with Rate-Splitting Multiple Access

arXiv

引用

arXiv 2024年

作者： Wu, Yinyu Zhang, Xuhui Ren, Jinke Shen, Yanyan Yang, Bo Wang, Shuqiang Guan, Xinping Niyato, Dusit The Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong518055 China The University of Chinese Academy of Sciences Beijing100049 China The Shenzhen Future Network of Intelligence Institute The School of Science and Engineering The Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong Guangdong Shenzhen518172 China Shenzhen University of Advanced Technology Guangdong518055 China The Department of Automation The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University Shanghai200240 China The College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

Intelligent reflecting surface (IRS)-assisted mobile edge computing (MEC) systems have shown notable improvements in efficiency, such as reduced latency, higher data rates, and better energy efficiency. However, the resource competition among users will lead to uneven allocation, increased latency, and lower throughput. Fortunately, the rate-splitting multiple access (RSMA) technique has emerged as a promising solution for managing interference and optimizing resource allocation in MEC systems. This paper studies an IRS-assisted MEC system with RSMA, aiming to jointly optimize the passive beamforming of the IRS, the active beamforming of the base station, the task offloading allocation, the transmit power of users, the ratios of public and private information allocation, and the decoding order of the RSMA to minimize the average delay from a novel uplink transmission perspective. Since the formulated problem is non-convex and the optimization variables are highly coupled, we propose a hierarchical deep reinforcement learning-based algorithm to optimize both continuous and discrete variables of the problem. Additionally, to better extract channel features, we design a novel network architecture within the policy and evaluation networks of the proposed algorithm, combining convolutional neural networks and densely connected convolutional network for feature extraction. Simulation results indicate that the proposed algorithm not only exhibits excellent convergence performance but also outperforms various benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Prediction of Estimated Time of Arrival for Multi-Airport Systems Via "Bubble" Mechanism

SSRN

引用

SSRN 2022年

作者： Wang, Lechen Mao, Jianfeng Li, Lishuai Li, Xuechun Tu, Yilei School of Data Science The Chinese University of Hong Kong Shenzhen China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Guangdong China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Faculty of Aerospace Engineering Delft University of Technology Delft2600 AA Netherlands School of Data Science City University of Hong Kong Hong Kong

Predicting Estimated Time of Arrival (ETA) for a Multi-Airport System (MAS) is much more challenging than for a single airport system because of complex air route structure, dense air traffic volume and vagaries of traffic conditions in an MAS. In this work, we propose a novel Bubble mechanism to accurately and e ciently predict medium-term ETA for a Multi-Airport System (MAS), in which the prediction of travel time of an origin-destination (OD) pair is decomposed into two stages, termed as out-MAS and in-MAS stages. For the out-MAS stage, Auto-Regressive Integrated Moving Average (ARIMA) is used to predict the travel time of a ight to reach the MAS boundary. For the in-MAS stage, we construct new spatio-temporal features based on clustering analysis of trajectory patterns facilitated by a novel data-driven hybrid polar sampling method. A sequence-to-sequence prediction model, Multi-variate Stacked Fully connected Bidirectional Long-Short Term Memory, is further developed to achieve multi-step-ahead predictions of in-MAS travel time for each trajectory pattern using the spatio-temporal features as input. Finally, the medium-term ETA prediction for an MAS is achieved by integrating the out-MAS and in-MAS prediction with the help of trajectory pattern prediction via random forest. A case study of predicting medium-term ETA for a typical MAS in China, Guangdong-Hong Kong-Macao Greater Bay Area, is conducted to demonstrate the usage and promising performance of the proposed method in comparison to several commonly used end-to-end learning methods. © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：