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

Crank-Nicolson difference scheme for the coupled nonlinear Schrödinger equations with the Riesz space fractional derivative

引用

Journal of Computational Physics 2013年 242卷 670-681页

作者： Wang, Dongling Xiao, Aiguo Yang, Wei Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China

In this paper, the Crank-Nicolson (CN) difference scheme for the coupled nonlinear Schrödinger equations with the Riesz space fractional derivative is studied. The existence of this difference solution is proved by the Brouwer fixed point theorem. The stability and convergence of the CN scheme are discussed in the L2 norm. When the fractional order is two, all those results are in accord with the difference scheme developed for the classical non-fractional coupled nonlinear Schrödinger equations. Some numerical examples are also presented. © 2013 Elsevier Inc.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Numerical methods for fractional variational problems depending on indefinite integrals

引用

Journal of Computational and Nonlinear Dynamics 2013年第2期8卷 021018页

作者： Wang, Dongling Xiao, Aiguo Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China

In this paper, the fractional variational integrators for fractional variational problems depending on indefinite integrals in terms of the Caputo derivative are developed. The corresponding fractional discrete Euler-Lagrange equations are derived. Some fractional variational integrators are presented based on the Grünwald-Letnikov formula. The fractional variational errors are discussed. Some numerical examples are given to illustrate these results. Copyright © 2013 by ASME.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Unmanned aerial vehicle based multi-person detection via deep neural network models

引用

Frontiers in Neurorobotics 2025年 19卷 1582995页

作者： Alshehri, Mohammed Zahoor, Laiba AlQahtani, Yahya Alshahrani, Abdulmonem AlHammadi, Dina Abdulaziz Jalal, Ahmad Liu, Hui Department of Computer Science King Khalid University Abha Saudi Arabia Faculty of Computer Science Air University Islamabad Pakistan Department of Informatics and Computer Systems King Khalid University Abha Saudi Arabia Department of Information Systems College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Riyadh Saudi Arabia Department of Computer Science and Engineering College of Informatics Korea University Seoul Korea Republic of Cognitive Systems Lab University of Bremen Bremen Germany Guodian Nanjing Automation Company Ltd. Nanjing China Jiangsu Key Laboratory of Intelligent Medical Image Computing School of Future Technology Nanjing University of Information Science and Technology Nanjing China

Introduction: Understanding human actions in complex environments is crucial for advancing applications in areas such as surveillance, robotics, and autonomous systems. Identifying actions from UAV-recorded videos becomes more challenging as the task presents unique challenges, including motion blur, dynamic background, lighting variations, and varying viewpoints. The presented work develops a deep learning system that recognizes multi-person behaviors from data gathered by UAVs. The proposed system provides higher recognition accuracy while maintaining robustness along with dynamic environmental adaptability through the integration of different features and neural network models. The study supports the wider development of neural network systems utilized in complicated contexts while creating intelligent UAV applications utilizing neural networks. Method: The proposed study uses deep learning and feature extraction approaches to create a novel method to recognize various actions in UAV-recorded video. The proposed model improves identification capacities and system robustness by addressing motion dynamic problems and intricate environmental constraints, encouraging advancements in UAV-based neural network systems. Results: We proposed a deep learning-based framework with feature extraction approaches that may effectively increase the accuracy and robustness of multi-person action recognition in the challenging scenarios. Compared to the existing approaches, our system achieved 91.50% on MOD20 dataset and 89.71% on Okutama-Action. These results do, in fact, show how useful neural network-based methods are for managing the limitations of UAV-based application. Discussion: Results how that the proposed framework is indeed effective at multi-person action recognition under difficult UAV conditions. Copyright © 2025 Alshehri, Zahoor, AlQahtani, Alshahrani, AlHammadi, Jalal and Liu.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

An adaptive offloading framework for Android applications in mobile edge computing

引用

Science China(information Sciences) 2019年第8期62卷 114-130页

作者： Xing CHEN Shihong CHEN Yun MA Bichun LIU Ying ZHANG Gang HUANG College of Mathematics and Computer Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University School of Software Tsinghua University Key Laboratory of High Confidence Software Technologies Ministry of Education

Mobile edge computing(MEC) provides a fresh opportunity to significantly reduce the latency and battery energy consumption of mobile applications. It does so by enabling the offloading of parts of the applications on mobile edges, which are located in close proximity to the mobile devices. Owing to the geographical distribution of mobile edges and the mobility of mobile devices, the runtime environment of MEC is highly complex and dynamic. As a result, it is challenging for application developers to support computation offloading in MEC compared with the traditional approach in mobile cloud computing, where applications use only the cloud for offloading. On the one hand, developers have to make the offloading adaptive to the changing environment, where the offloading should dynamically occur among available computation *** the other hand, developers have to effectively determine the offloading scheme each time the environment changes. To address these challenges, this paper proposes an adaptive framework that supports mobile applications with offloading capabilities in MEC. First, based on our previous study(DPartner), a new design pattern is proposed to enable an application to be dynamically offloaded among mobile devices, mobile edges,and the cloud. Second, an estimation model is designed to automatically determine the offloading *** this model, different parts of the application may be executed on different computation nodes. Finally, an adaptive offloading framework is implemented to support the design pattern and the estimation model. We evaluate our framework on two real-world applications. The results demonstrate that our approach can aid in reducing the response time by 8%–50% and energy consumption by 9%–51% for computation-intensive applications.

关键词： computation offloading software adaptation mobile edge computing application refactoring Android

来源：评论

学校读者我要写书评

暂无评论

Informative gene selection using the Algebraic Connectivity Strength of Point and Scoring Criteria

引用

Chinese Science Bulletin 2013年第6期58卷 657-661页

作者： WANG Nian SU LiangLiang TANG Jun YE AiXia Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University School of Electronics and Information Engineering Anhui University

This paper presents a novel method that integrates the Algebraic Connectivity Strength of Point(ACSP) and Scoring Criteria to identify genes associated with tumor ***,for each gene,the ACSP is used to identify reliable expression levels of the gene in all the *** informative genes are then selected using Scoring Criteria based on these reliable expression ***,the Support Vector Machine(SVM) classifier is used to classify the two datasets of gene expression *** results show that the informative genes selected by the proposed method have higher credibility than those selected by Scoring Criteria alone.

关键词：基因选择评分标准信息化强度连通代数基因表达谱支持向量机

来源：评论

学校读者我要写书评

暂无评论

Lightweight Vision Model-based Multi-user Semantic Communication Systems

arXiv

引用

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Combined model assisted evolutionary algorithm with complementary fill sampling criterion for expensive multi/many-objective optimization

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Qiuzhen Wang Feng Xie Yuan Liu Juan Zou Jinhua Zheng Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science Xiangtan Hunan Province China Faculty of School of Computer Science Xiangtan University Xiangtan 411105 China

In this paper, we design an algorithm to address the challenges of expensive multi-objective optimization problems by improving the surrogate model and sampling criterion. Firstly, we introduce a combined model which aims to enhance the impact of points that do not play a negative role, thus improving prediction accuracy. Subsequently, we develop two complementary indicators to accommodate various shapes of Pareto frontiers to better balance convergence and diversity in the sampling criterion. Experimental results on several benchmarks show that our proposed method is highly competitive in solving expensive multi-objective optimization problems compared to other state-of-the-art algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of Computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Well limit behaviors of term rewriting systems

引用

中国高等学校学术文摘·计算机科学 2007年第3期1卷 283-296页

作者： MA Shilong SUI Yuefei XU Ke State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100083China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of SciencesBeijing 100080China

The limit behaviors of computations have not been fully *** is necessary to consider such limit behaviors when we consider the properties of infinite objects in computer science,such as infinite logic programs,the symbolic solutions of infinite polynomial ***,we can use finite objects to approximate infinite objects,and we should know what kinds of infinite objects are approximable and how to approximate them effectively.A sequence {Rκ:κω}of term rewriting systems has the well limit behavior if under the condition that the sequence has the Set-theoretic limit or the distance-based limit,the sequence {Th(Rκ):κ∈ω} of corresponding theoretic closures of Rκ has the set-theoretic or distance-based limit,and limκ→∞ Th(Rκ) is equal to the theoretic closure of the limit of {Rκ:κ∈ω).Two kinds of limits of term rewriting systems are considered:one is based on the set-theoretic limit,the other is on the distance-based *** is proved thatgiven a sequence {Rκ:κ∈ω) of term rewriting systems Rκ,if there is a well-founded ordering (-＜) on terms such that every Rκ is (-＜)-well-founded,and the set-theoretic limit of {Rκ:κ∈ω).exists,then {Rκ:κ∈ω).has the well limit behavior;and if (1) there is a well-founded ordering(-＜)on terms such that every Rκ is(-＜-well-founded,(2) there is a distance d on terms which is closed under substitutions and contexts and (3) {Rκ:κ∈ω).is Cauchy under d then {Rκ:κ∈ω).has the well limit *** results are used to approximate the least Herbrand models of infinite Horn logic programs and real Horn logic programs,and the solutions and Cr(o)bner bases of (infinite) sets of real polynomials by sequences of (finite) sets of rational polynomials.

关键词： term rewriting systems limits Gr(o)bner bases well-foundedness

来源：评论

学校读者我要写书评

暂无评论

XGRouter： high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：