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

arXiv 2021年

作者： Cheng, Kaijen You, Hongming Yang, Ting-Hui School of Mathematics and Statistics Zhaoqing University Guangdong Zhaoqing526061 China College of Mathematics and Computer Science Quanzhou Normal University Quanzhou362000 China Department of Mathematics Tamkang University No. 151 Yingzhuan Road Tamsui Dist. New Taipei City25137 Taiwan Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing School of Mathematics and Computer Science Quanzhou Normal University Quanzhou China

In this work, we revisit the classical Holling type II three species food chain model from a different viewpoint. Two critical parameters λ1 and λ2 dependent on all parameters are defined. The existence and local stabilities of all equilibria can be reformulated by λ1 and λ2, and the complete classifications of parameters and its corresponding dynamics are given. Moreover, with the extinction of top-predator, there is an invariant two dimensional subsystem containing the prey and the intermediate predator. We prove the global stability of the boundary equilibrium in 3+ by differential inequality as well as Butler-McGehee lemma if it is stable. Alternatively, there is a unique limit cycle when the boundary equilibrium lost its stability, and we also show the global stability of the limit cycle in 3+ by differential inequality and computing the Floquet Multipliers. Finally, some interesting numerical simulations, the chaotic and the bi-stability phenomena, are presented numerically. A brief discussion and biological implications are also *** Codes 92D25 Copyright © 2021, The Authors. All rights reserved.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Deep learning radiomics model related with genomics phenotypes for pathological complete response prediction in locally advanced rectal cancer under neoadjuvant chemoradiotherapy

Deep learning radiomics model related with genomics phenotyp...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Ye Wang Zhen Pan Lanyan Lin Huajun Cai Feng Ding Chaojun Tan Dingyuan Zheng Yajun Xie Guoxian Guan Department of Colorectal Surgery The First Affiliated Hospital of Fujian Medical University Fuzhou China Department of Geriatric Medicine Fujian Key Laboratory of Geriatrics Diseases Fujian Provincial Center for Geriatrics Fuzhou University Affiliated Provincial Hospital Shengli Clinical Medical College of Fujian Medical University Fuzhou China Fujian Huaye Information Technology Co. Ltd China School of Big Data \& Key Laboratory of Data Science and Intelligent Computing Fuzhou University of International Studies and Trade Fuzhou China Department of Colorectal Surgery The First Affiliated Hospital of Fujian Medical University National Regional Medical Center Binhai Campus of the First Affiliated Hospital Fuzhou China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

Background: Developing a treatment strategy after neoadjuvant chemoradiotherapy (nCRT) based on accurate pathological complete response (pCR) predictions is crucial for locally advanced rectal cancer (LARC).Objective: To determine the effectiveness of a radiomics model using diffusion-weighted imaging (DWI) and T2-weighted in predicting post-nCRT pCR efficacy after ***: This study enrolled 237 LARC patients who had radical surgery under nCRT between February 2020 and August 2023. Tumor tissues from 54 patients were RNA sequenced. Radiomics features from preoperative MRI data were used to develop a model for deep learning via the LASSO algorithm. ROC curves were used to assess the model performance. Following Spearman's correlation, analyses of transcriptomic data were conducted to identify the genes correlated with the DPL ***: The DPL model, incorporating 7 features and 5 machine-learning algorithms, was used to create risk assessment models. The RF model excelled in predicting pCR, achieving an AUC of 0.91, accuracy of 0.88, and F1 score of 0.89. Furthermore, catabolic processes and pathways related to immunity were associated with selected DPL ***: The modified MRI-based radiomics model shows good predictive efficacy in predicting pCR after nCRT in LARC patients. Additionally, we investigated the genomic phenotypes associated with DPL.

关键词： Deep learning Support vector machines Pathology Analytical models Transcriptomics Predictive models data models Random forests Radiomics Cancer

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Structure-Guided Graph Generation for Multi-View Semi-Supervised Classification

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Chen, Zhaoliang Zou, Ying Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Department of Computer Science Hong Kong Baptist University Hong Kong

Graph convolutional network has emerged as a focal point in machine learning because of its robust graph processing capability. Most existing graph convolutional network-based approaches are designed for single-view data, yet in many practical scenarios, data is represented through multiple views. Although the ability of graph convolutional network is undeniable, the quality of graph directly affects its performance. Moreover, the process of graph generation with traditional nearest neighbor in traditional multi-view learning actually amplifies the influence of different information on performance across these views. To tackle the aforementioned challenges, this paper proposes a multi-scale graph generation deep learning framework, called multi-scale semi-supervised graph generation based multi-view classification, consisting of two modules: edge sampling and path sampling. The former aims to generate an adjacency graph by selecting edges based on the maximum likelihood among graphs from different views. Meanwhile, the latter seeks to construct adjacency graphs according to the characteristics of paths within the graphs. Extensive experimental results robustly demonstrate the superior performance of our proposed framework, compared to other state-of-the-art multi-view semi-supervised approaches. © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing

arXiv

引用

arXiv 2023年

作者： Chen, Zhaoliang Wu, Zhihao Lin, Zhenghong Wang, Shiping Plant, Claudia Guo, Wenzhong The College of Computer and Data Science Fuzhou University Fuzhou350116 China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China The Faculty of Computer Science Austria The research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Graph Convolutional Network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue, owing to which shallow networks are extensively adopted. This may be problematic for complex graph datasets because a deeper GCN should be beneficial to propagating information across remote neighbors. Recent works have devoted effort to addressing over-smoothing problems, including establishing residual connection structure or fusing predictions from multi-layer models. Because of the indistinguishable embeddings from deep layers, it is reasonable to generate more reliable predictions before conducting the combination of outputs from various layers. In light of this, we propose an Alternating Graph-regularized Neural Network (AGNN) composed of Graph Convolutional Layer (GCL) and Graph Embedding Layer (GEL). GEL is derived from the graph-regularized optimization containing Laplacian embedding term, which can alleviate the over-smoothing problem by periodic projection from the low-order feature space onto the high-order space. With more distinguishable features of distinct layers, an improved Adaboost strategy is utilized to aggregate outputs from each layer, which explores integrated embeddings of multi-hop neighbors. The proposed model is evaluated via a large number of experiments including performance comparison with some multi-layer or multi-order graph neural networks, which reveals the superior performance improvement of AGNN compared with state-of-the-art models. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A TSP-over-LEACH Protocol for Energy-Efficient Wireless Sensor Networks

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第4期6卷 835-846页

作者： Hsieh, Chaur-Heh Lin, Jianping Yu, Chih-Min Hung, Mao-Hsiung Huang, Fenghua Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.33 Xuefunan Road University Town Minhou Fuzhou350118 China College of Artificial Intelligence Yango University Fuzhou350015 China School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China College of Computing and Informatics University of North Carolina at Charlotte CharlotteNC28223 United States

Wireless sensor networks (WSNs) play as a way that associates the cy-bernetic digital world to the actual world. The clustering concept in WSNs can effectively prevent the unnecessary energy consumption in delivering packets to the sink by dividing the network into several groups or clusters. In LEACH protocol, cluster heads (CHs) among different clusters can aggregate sensed data and directly dispatch packets via single-hop transmission to the data sink. Hence, a new challenging issue is generated to reduce the energy consumption for all CHs transmissions since the multi-hop transmission among CHs can effectively reduce the total transmission distance than the direct transmission of CHs in the conventional LEACH. In this paper, a travelling sales-man protocol (TSP) over LEACH (TSP-over-LEACH) is proposed based on the existing LEACH to minimize the total transmission distance among CHs and reduces the total power consumption of all CHs. The operation of TSP-over LEACH is divided into two stages. In the first stage, several CHs are determined randomly as the LEACH proto-col. In the second stage, a shortest routing path is established for packet transmission along all CHs and the data sink to reduce the total transmission distance. As a result, the TSP-over-LEACH can calculate the minimum hop and distance to achieve the minimiza-tion of total energy consumption of all CHs. Simulation results show that the proposed TSP-over-LEACH can effectively reduce total energy consumption as the number of CHs increases especially when the sink node is far away and outside the operation area. keywords:. © 2021, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

An efficient aggregate signature scheme for healthcare wireless sensor networks

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第1期6卷 1-15页

作者： Chen, Jian-Neng Zhou, Yu-Ping Huang, Zhen-Jie Wu, Tsu-Yang Zou, Fu-Min Tso, Raylin Minnan Normal University Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Zhangzhou363000 China Lab of Granular Computing Zhangzhou363000 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Key Laboratory of Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology National Demonstration Center for Experimental Electronic Information and Electrical Technology Education Fujian University of Technology Fuzhou350008 China Department of Computer Science National Chengchi University Taipei Taiwan

In healthcare wireless sensor networks, there are a large number of sensors, which need to transmit a lot of information in real time. The aggregate signature scheme combines a great deal of signatures signed by different signers on different messages into one short signature, which greatly improves the efficiency of data transmission. In this paper, we present a scheme of certificate based aggregate signature, and prove its security in the random oracle model. The performance analysis shows that the scheme is efficient in sign and verify phase, and suitable for healthcare wireless sensor networks. © 2021, Taiwan Ubiquitous Information. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Channel Contrastive Graph Convolutional Network with Graph and Feature Fusion

SSRN

引用

SSRN 2023年

作者： Zhong, Luying Lu, Jielong Chen, Zhaoliang Song, Na Wang, Shiping College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Mechanical Electrical and Information Engineering Putian University Putian351100 China

Multi-view semi-supervised classification is an attractive topic in real-world applications. Due to the powerful capability of gathering information from neighbors, Graph Convolutional Network (GCN) has become a hotspot in the classification task. However, most multi-view classification works based on GCN only assign weights for feature fusion, and directly consider the weighted sum of the adjacency matrices, ignoring the interaction and correlation among features. These may be problematic because aggregating the matrices from less relevant views may destroy the original topology space, leading to undesired performance. To address these issues, this paper proposes an Adaptive Multi-Channel Graph Convolutional Network (AMC-GCN). To extract the interactive information, AMC-GCN designs a deep interactive feature integration network to incorporate consensus and complementary information. To fuse the graph structures, AMC-GCN exploits the relevance between views and imposes an adjacency matrix fusion network to construct multiple GCN channels, thereby delivering valuable information from relevant graphs. To enhance the homogeneity of the framework, AMC-GCN applies a contrastive loss to joint learning during the optimization for classification. With these techniques, AMC-GCN exploits relevant and interactive information between views to promote graph and feature fusion. Extensive experimental results on real-world datasets demonstrate the superiority of the proposed algorithm. © 2023, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

DQPS: An Intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge computing Networks

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal State update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

arXiv

引用

arXiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, Xing Min, Geyong 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 School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

NON-SPLITTING EULERIAN-LAGRANGIAN WENO SCHEMES FOR TWO-DIMENSIONAL NONLINEAR CONVECTION-DIFFUSION EQUATIONS

arXiv

引用

arXiv 2024年

作者： Zheng, Nanyi Cai, Xiaofeng Qiu, Jing-Mei Qiu, Jianxian Department of Mathematical Sciences University of Delaware NewarkDE19716 United States Research Center for Mathematics Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNU-HKBU United International College Zhuhai519087 China School of Mathematical Sciences Fujian Provincial Key Laboratory of Mathematical Modeling and High-Performance Scientific Computing Xiamen University Fujian Xiamen361005 China

In this paper, we develop high-order, conservative, non-splitting Eulerian-Lagrangian (EL) Runge-Kutta (RK) finite volume (FV) weighted essentially non-oscillatory (WENO) schemes for convection-diffusion equations. The proposed EL-RK-FV-WENO scheme defines modified characteristic lines and evolves the solution along them, significantly relaxing the time-step constraint for the convection term. The main algorithm design challenge arises from the complexity of constructing accurate and robust reconstructions on dynamically varying Lagrangian meshes. This reconstruction process is needed for flux evaluations on time-dependent upstream quadrilaterals and time integrations along moving characteristics. To address this, we propose a strategy that utilizes a WENO reconstruction on a fixed Eulerian mesh for spatial reconstruction, and updates intermediate solutions on the Eulerian background mesh for implicit-explicit RK temporal integration. This strategy leverages efficient reconstruction and remapping algorithms to manage the complexities of polynomial reconstructions on time-dependent quadrilaterals, while ensuring local mass conservation. The proposed scheme ensures mass conservation due to the flux-form semi-discretization and the mass-conservative reconstruction on both background and upstream cells. Extensive numerical tests have been performed to verify the effectiveness of the proposed scheme. © 2024, CC BY.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：