检索结果-南通市图书馆

Asymptotic behavior of an SIQR epidemic model driven by Lévy jumps on scale-free networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

International Journal of Biomathematics 2024年第2期17卷 51-86页

作者： Yuncheng Xu sanyang liu Xiaojun Sun Hua Hu Yu Wang School of Mathematics and Statistics Xidian University Xi'an 710071P.R.China School of Mathematics and Statistics Ning Xia University Ningria 750021P.R.China School of Mathematics and Information Science Bao Ji University of Arts and Sciences Baoji 721013 P.R.China College of Mathematics Science and Center for Applied Mathematical Science Inner Mongolia Normal University Hohhot 010022 P.R.China

To investigate the effect of information transmission,Levy jumps and contact heterogeneity of individuals on the asymptotic behavior of epidemic,a stochastic SIQR epidemic model with non-monotone incidence rate and Levy jumps on scale-free networks is *** first,the global dynamics of the deterministic model is studied by constructing appropriate Lyapunov *** the stochastic model is made in accordance with the ecological significance,the existence and uniqueness of the global positive solution of the stochastic SIQR model is ***,by constructing suitable stochastic Lyapunov functions and applying Ito formula with jump,the asymptotic behavior of solutions of stochastic model around equilibrium of the corresponding deterministic model is *** last,the correctness of the analytical results is verified by numerical simulations.

关键词： Lévy jumps asymptotic behavior non-monotone incidence rate scale-free networks SIQR.

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

融合模式搜索的蝗虫优化算法及其应用

西安电子科技大学学报 2024年第2期51卷 137-156页

作者：肖怡心刘三阳西安电子科技大学数学与统计学院陕西西安710126

在智能优化算法应用于复杂优化问题的求解过程中,平衡开发和探索以获得最优解具有重要意义。因此针对传统蝗虫优化算法在处理一些较为复杂的优化问题时出现的收敛精度低、搜索能力弱且容易陷入局部最优等缺陷,提出一种融合模式搜索的蝗... 详细信息

在智能优化算法应用于复杂优化问题的求解过程中,平衡开发和探索以获得最优解具有重要意义。因此针对传统蝗虫优化算法在处理一些较为复杂的优化问题时出现的收敛精度低、搜索能力弱且容易陷入局部最优等缺陷,提出一种融合模式搜索的蝗虫优化算法。首先引入Sine混沌映射初始化蝗虫个体种群位置,减少个体重叠概率以增强种群迭代初期的多样性;其次利用模式搜索法,对种群目前找到的最优目标展开局部搜索,提高算法的收敛速度与寻优精度;同时为了避免算法后期陷入局部最优,引入了基于凸透镜成像的反向学习策略。实验部分通过对改进的蝗虫算法进行消融实验,验证了Sine混沌映射、模式搜索、反向学习每个策略的独立有效性。并用两组测试函数进行仿真实验,采用Wilcoxon秩和检验、Friedman检验的方法进行结果分析。实验结果均表明了融合模式搜索法改进的蝗虫算法在收敛速度与寻优精度上得到明显提高。最后,将其应用于移动机器人路径规划,测试结果进一步验证了改进算法的有效性。

关键词：蝗虫优化算法粒子群优化算法模式搜索时间复杂度统计检验路径规划

维普期刊数据库博看期刊

风景名胜资源的刑法保护路径:一个三阶的分析框架

在线全文

学校读者我要写书评

暂无评论

中国人口·资源与环境 2024年第1期34卷 212-220页

作者：商玉玺刘三洋山东师范大学法学院山东济南250358 江苏师范大学法学院江苏徐州221018 上海交通大学凯原法学院上海200030

最高人民法院第147号指导性案例开辟了以《刑法》第324条第2款故意损毁名胜古迹罪保护风景名胜资源的先河,其意义不仅在于裁判思路上的创新,更在于对风景名胜资源刑法保护的再次确认。为了进一步厘定第147号指导性案例审判思维,化解故... 详细信息

最高人民法院第147号指导性案例开辟了以《刑法》第324条第2款故意损毁名胜古迹罪保护风景名胜资源的先河,其意义不仅在于裁判思路上的创新,更在于对风景名胜资源刑法保护的再次确认。为了进一步厘定第147号指导性案例审判思维,化解故意损毁名胜古迹罪在司法认定中的难题,明晰生态环境领域权力和权利、行政违法与刑事犯罪的边界,采取“对象—行为—法益”的三阶分析框架,构建风景名胜资源的刑法保护路径。在指涉对象的界定层面,故意损毁名胜古迹罪中“风景名胜”资源指涉的是生态景观而非生态景区,以维护自然保护区、国家公园与风景名胜区之间刑法保护的协调性。在“损毁”行为的认定层面,采取“嵌套规制论”的适用理念,以风景名胜资源的“毁坏”为主要标准,以“价值减损”为补充,明确违法行为与犯罪行为的边界,避免刑事认定的过分严厉。在法益价值重述层面,采取“1+X”模式归纳风景名胜资源的法益价值特征:其中“1”指代风景名胜资源的基础的、原始的生态法益特征,“X”指代风景名胜资源作为自然、人文遗产所蕴含的文物法益属性,其下又分为生物法益价值、启智法益价值、审美法益价值与经济法益价值。不同的法益价值类型对“严重损毁”的刑事认定有不同意义。具体而言,风景名胜资源的生态法益、生物法益、启智法益(科学研究价值)遭受“毁灭”,启智法益(科普价值)、审美法益受到“价值减损”,是刑法启动保护风景名胜资源的条件;风景名胜资源的经济法益不影响刑事违法性判断。

关键词：风景名胜资源刑事保护生态景观说文物法益生态法益

维普期刊数据库博看期刊

Fuzzy smooth support vector machine with different smooth functions

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2012年第3期23卷 460-466页

作者： Chuandong Qin sanyang liu School of Computer Science and Technology Xidian UniversityXi’an 710071P.R.China Department of Mathematics Xidian UniversityXi’an 710071P.R.China Research Institute of Information and System Computation Science North National UniversityYinchuan 750021P.R.China

Smooth support vector machine （SSVM） changs the normal support vector machine （SVM） into the unconstrained op- timization by using the smooth sigmoid function. The method can be solved under the Broyden-Fletcher-Goldfarb-Shanno （BFGS） algorithm and the Newdon-Armijio （NA） algorithm easily, however the accuracy of sigmoid function is not as good as that of polyno- mial smooth function. Furthermore, the method cannot reduce the influence of outliers or noise in dataset. A fuzzy smooth support vector machine （FSSVM） with fuzzy membership and polynomial smooth functions is introduced into the SVM. The fuzzy member- ship considers the contribution rate of each sample to the optimal separating hyperplane and makes the optimization problem more accurate at the inflection point. Those changes play a positive role on trials. The results of the experiments show that those FSSVMs can obtain a better accuracy and consume the shorter time than SSVM and lagrange support vector machine （LSVM）.

关键词： smooth support vector machine (SSVM) fuzzy sig- moid function polynomial smooth function fuzzy membership Broyden-Fletcher-Gddfarb-Shanno (BFGS).

Cartesian product over interval valued intuitionistic fuzzy sets

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2017年第6期28卷 1152-1161页

作者： Jianming Xie sanyang liu School of Mathematics and Statistics Xidian University Xi’an 710071 China

The intuitionistic fuzzy set(IFS) based on fuzzy theory,which is of high efficiency to solve the fuzzy problem, has been introduced by Atanassov. Subsequently, he pushed the research one step further from the IFS to the interval valued intuitionistic fuzzy set(IVIFS). On the basis of fuzzy set(FS), the IFS is a generalization concept. And the IFS is generalized to the *** this paper, the definition of the sixth Cartesian product over IVIFSs is first introduced and its some properties are *** prove some equalities based on the operation and the relation over IVIFSs. Finally, we present one geometric interpretation and a numerical example of the sixth Cartesian product over IVIFSs.

关键词： intuitionistic fuzzy sets(IFS) Cartesian product ope ration geometric interpretation interval valued intuitionistic fuzzy set(IVIFS)

Progressive transductive learning pattern classification via single sphere

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2009年第3期20卷 643-650页

作者： Xue Zhenxia liu sanyang liu Wanli Dept. of Applied Mathematics Xidian Univ. Xi'an 710071 P. R. China Dept. of Mathematics Henan Univ. of Science and Technology Luoyang 471003 P. R. China Dept. of Mathematics Luoyang Normal Coll. Luoyang 471022 P. R. China

In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the labels of unlabeled ones, that is, to develop transductive learning. In this article, based on Pattern classification via single sphere （SSPC）, which seeks a hypersphere to separate data with the maximum separation ratio, a progressive transductive pattern classification method via single sphere （PTSSPC） is proposed to construct the classifier using both the labeled and unlabeled data. PTSSPC utilize the additional information of the unlabeled samples and obtain better classification performance than SSPC when insufficient labeled data information is available. Experiment results show the algorithm can yields better performance.

关键词： pattern recognition semi-supervised learning transductive learning classification support vector machine support vector domain description.

Hooke and Jeeves algorithm for linear support vector machine

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2010年第1期21卷 138-141页

作者： Yeqing liu sanyang liu Mingtao Gu Department of Mathematical Sciences Xidian University Xi'an 710071 R R. China School of Science Henan University of Science & Technology Luoyang 471003 P. R. China PLA Unit 96251 Luoyang 471003 E R. China

Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.

关键词： support vector machine classification pattern search,Hooke and Jeeves coordinate descent global Newton algorithm.

Clustering routing algorithm of wireless sensor networks based on Bayesian game

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2012年第1期23卷 154-159页

作者： Gengzhong Zheng sanyang liu Xiaogang Qi School of Computer Science and Technology Xidian University Xi＇an 710071 R R. China Department of Mathematics and Information Technology Hanshan Normal University Chaozhou 521041 R R. China School of Science Xidian University Xi＇an 710071 R R. China

To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.

关键词： wireless sensor networks (WSNs) clustering routing Bayesian game energy efficiency.

Successive quadratic programming multiuser detector

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2007年第1期18卷 8-13页

作者： Mu Xuewen Zhang Yaling liu sanyang Dept. of Applied Mathematics Xidian Univ. Xi'an 710071 E R. China Dept. of Computer Science and Technology Xi'an Univ. of Science and Technology Xi'an 710054 P. R. China

Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.

关键词： Code division multiple access Multiuser detection Semidefinite programming Successive quadratic programming.