Int. J. Comput. Sci. Math.最新文献

筛选
英文 中文
Study on the hydrodynamic behaviour of journal bearing with herringbone grooved sleeve considering cavitation 考虑空化的人字槽套筒滑动轴承水动力特性研究
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.10039885
Qiang He, Yu Chen, Kunpeng Wang
{"title":"Study on the hydrodynamic behaviour of journal bearing with herringbone grooved sleeve considering cavitation","authors":"Qiang He, Yu Chen, Kunpeng Wang","doi":"10.1504/ijcsm.2021.10039885","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.10039885","url":null,"abstract":"This work proposes the development of a hydrodynamic model for journal bearing with herringbone grooved sleeve considering cavitation. The equations of motion for this system are obtained by CFD method and the effects related to hydrodynamics, friction and lubrication. The simulation model used in this paper is based on the multiphase flow model, considering the effects of cavitation on the pressure distribution of oil-film. The proposed model is further verified by the results of published experiment data. Further analysis reveals that the eccentricity ratio, rotational speed, groove depth and number of groove have a great influence on the hydrodynamic behaviour of herringbone grooved journal bearing. Therefore, it is necessary to develop a more realistic simulation model of journal bearing with herringbone grooved sleeve that provide a reference for the journal bearing design.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124881922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic multi-swarm pigeon-inspired optimisation 基于多群鸽子的动态优化
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.116762
Yichao Tang, Bo Wei, Yinglong Zhang, Xiong Li, Xuewen Xia, Ling Gui
{"title":"Dynamic multi-swarm pigeon-inspired optimisation","authors":"Yichao Tang, Bo Wei, Yinglong Zhang, Xiong Li, Xuewen Xia, Ling Gui","doi":"10.1504/ijcsm.2021.116762","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.116762","url":null,"abstract":"Pigeon-inspired optimisation (PIO) has shown favourable performance on global optimisation problems. However, it lacks the part of individual experience, which makes it prone to premature convergence when solving multimodal problems. Moreover, the landmark operator model in PIO may cause the population size to decrease too quickly, which is harmful for exploration. To overcome the shortcomings, a dynamic multi-swarm pigeon-inspired optimisation (DMS-PIO) is proposed in this research. In PIO, the entire population is divided into multiple swarms. During the evolutionary process, the size of each swarm can be dynamically adjusted, and the multiple swarms can be randomly regrouped. Relying on the dynamic adjustment of swarms' sized, exploration and exploitation are balanced in the initial evolutionary stage and last stage. Furthermore, the randomly regrouping schedule is used to keep the population diversity. To enhance the comprehensive performance of PIO, the map and compass operator and the landmark operator in it are conducted alternately in each generation. Experimental results between DMS-PIO and other five PIO algorithms demonstrate that our proposed DMS-PIO can avoid the premature convergence problem when solving multimodal problems, and yields more effective performance in complex continuous optimisation problems.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133783062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effects of combination of therapies on chronic hepatitis B virus through resolution of an optimal control problem using comparative of direct method and Pontryagin's maximum principle 通过比较直接法和庞特里亚金极大值原理解决最优控制问题,联合治疗对慢性乙型肝炎病毒的影响
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.116765
J. Ntaganda
{"title":"Effects of combination of therapies on chronic hepatitis B virus through resolution of an optimal control problem using comparative of direct method and Pontryagin's maximum principle","authors":"J. Ntaganda","doi":"10.1504/ijcsm.2021.116765","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.116765","url":null,"abstract":"This paper aims at using direct approach and Pontryagin's maximum principle to solve a hepatitis B virus dynamics optimal control problem. The controls consist of combination therapy of two treatments. The numerical implementation is done using MATLAB packages. Comparative results from these two methods show they are so close in optimal trajectories of determinant variables. Furthermore, both numerical methods are in good agreement with experimental data. In particular, combination of two treatments controls hepatitis B virus to ensure healthy.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximate solution of fractional differential equations using Shannon wavelet operational matrix method 用香农小波变换矩阵法近似求解分数阶微分方程
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.10039882
J. Iqbal, R. Abass, Puneet Kumar
{"title":"Approximate solution of fractional differential equations using Shannon wavelet operational matrix method","authors":"J. Iqbal, R. Abass, Puneet Kumar","doi":"10.1504/ijcsm.2021.10039882","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.10039882","url":null,"abstract":"Many physical problems are frequently governed by fractional differential equations and obtaining the solution of these equations have been the subject of a lot of investigations in recent years. The aim of this paper is to propose a novel and effective method based on Shannon wavelet operational matrices of fractional-order integration. The theory of Shannon wavelets and its properties are first presented. Block Pulse functions and collocation method are employed to derive a general procedure in constructing these operational matrices. The main peculiarity of the proposed technique is that it condenses the given problem into a system of algebraic equations that can be easily solved by MATLAB package. Furthermore, a designed scheme is applied to numerical examples to analyse its applicability, reliability, and effectiveness.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121377122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An improved flower pollination algorithm for solving nonlinear system of equations 一种求解非线性方程组的改进花授粉算法
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.116759
Mohamed Abdel-Basset, Yongquan Zhou, S. Zaki, A. H. Zaied
{"title":"An improved flower pollination algorithm for solving nonlinear system of equations","authors":"Mohamed Abdel-Basset, Yongquan Zhou, S. Zaki, A. H. Zaied","doi":"10.1504/ijcsm.2021.116759","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.116759","url":null,"abstract":"It is difficult to solve a system of nonlinear equations, especially for higher-order nonlinear equations when we do not have an efficient and reliable algorithm, even though much work has been done in this area. Newton's method and its improved form are widely used at present, but their convergence and performance characteristics can be highly sensitive to the initial guess of the solution, and the methods fail if the initial guess of the solution is inopportune. It is difficult to select a good initial guess for most systems of nonlinear equations. For this reason, it is necessary to find an efficient algorithm for systems of nonlinear equations. Metaheuristic optimisation algorithms have been proposed by many researchers to solve systems of nonlinear equations. The flower pollination algorithm (FPA) is a novel metaheuristic optimisation algorithm with quick convergence, but its population diversity and convergence precision can be limited in some applications. To enhance its exploitation and exploration abilities, in this paper, an elite opposition-based flower pollination algorithm (EFPA) has been applied for solving systems of nonlinear equations. The results show that the proposed algorithm is robust, has high convergence rate and precision, and can give satisfactory solutions of nonlinear equations.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133984366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Applications of the dynamic system and differential equations to Taiwan mortality 动态系统与微分方程在台湾死亡率之应用
Int. J. Comput. Sci. Math. Pub Date : 2021-07-25 DOI: 10.1504/ijcsm.2021.10039883
Yong-Shiuan Lee, Meng-Rong Li, Jengnan Tzeng, Tsung-Jui Chiang-Lin
{"title":"Applications of the dynamic system and differential equations to Taiwan mortality","authors":"Yong-Shiuan Lee, Meng-Rong Li, Jengnan Tzeng, Tsung-Jui Chiang-Lin","doi":"10.1504/ijcsm.2021.10039883","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.10039883","url":null,"abstract":"Modelling mortality is an important part of demographic researches. Since most developed countries have experienced rapid declines in mortality rates and population aging lately, it requires a more accurate mortality model to characterise and explain the phenomenon. Rather than stochastic models, the approach of the dynamic system and differential equations which is popular in natural sciences is applied in this study. The proposed model emphasises the mean reversion of the mortality where the mean stands for a hypothetical minimum rate. The model also depicts the speed of the convergence toward the minimum as the logistic curve. The empirical study shows that the model possesses reasonable characterisation and forecasts of Taiwan male and female age-specific mortalities. Subject to the algorithm the errors suggest that the model is comparatively better than Lee-Carter model, the benchmark model, for the ages from 15 to 70. Modelling the coefficients and modifying the algorithm will be the future work to raise the forecasting ability of the model.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on travel network structure based on normalised Laplacian spectrum 基于归一化拉普拉斯谱的出行网络结构研究
Int. J. Comput. Sci. Math. Pub Date : 2020-12-05 DOI: 10.1504/ijcsm.2020.10034031
Yang Sun, Hanhan Deng, Ling Zhao, Sumin Li, Zhenshi Zhang, Ronghua Du, Zhixiang Hou
{"title":"Research on travel network structure based on normalised Laplacian spectrum","authors":"Yang Sun, Hanhan Deng, Ling Zhao, Sumin Li, Zhenshi Zhang, Ronghua Du, Zhixiang Hou","doi":"10.1504/ijcsm.2020.10034031","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10034031","url":null,"abstract":"To study the residents' trip-activity chain and patterns, we start from the residents' trip-activity network. The normalised Laplacian spectrum from the local metric features described the topological structure information of network with the statistical analysis method of complex network. The statistical analysis of complex networks failed to show the global information of the network and described the network structure more completely, intuitively and conveniently. The normalised Laplacian spectrum is used to portray the subway network, the airline network and the macro-laws of the network from residents travel. In this paper, we analysis other networks and classify networks qualitatively. The results proved that the normalised Laplacian spectra are an efficient tool for analysing macro-structural or micro-structural features of geographic networks.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Asymmetric convolution with densely connected networks 具有密集连接网络的非对称卷积
Int. J. Comput. Sci. Math. Pub Date : 2020-12-05 DOI: 10.1504/ijcsm.2020.10034030
Liejun Wang, Huanglu Wen, Jiwei Qin, Shuli Cheng
{"title":"Asymmetric convolution with densely connected networks","authors":"Liejun Wang, Huanglu Wen, Jiwei Qin, Shuli Cheng","doi":"10.1504/ijcsm.2020.10034030","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10034030","url":null,"abstract":"Convolutional neural networks are vital to some computer vision tasks, and the densely connected network is a creative architecture among them. In densely connected network, most convolution layer tends to have a much larger number of input channels than output channels, making itself to a funnel shape. We replace the 3 × 3 convolution in the densely connected network with two continuous asymmetric convolutions to make the DenseNet family more diverse. We also proposed a model in which two continuous asymmetric convolutions each outputs half of the output channels and concatenate them as the final output of these layers. Compared with the original densely connected network, our models achieve similar performance on CIFAR-10/100 dataset with fewer parameters and less computational cost.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Mathematical Model and Optimal Control for Listeriosis Disease from Ready-to-Eat Food Products 即食食品李斯特菌病的数学模型及最优控制
Int. J. Comput. Sci. Math. Pub Date : 2020-10-13 DOI: 10.1101/2020.10.11.20210856
C. W. Chukwu, F. Nyabadza, Joshua Kiddy K. Asamoah
{"title":"A Mathematical Model and Optimal Control for Listeriosis Disease from Ready-to-Eat Food Products","authors":"C. W. Chukwu, F. Nyabadza, Joshua Kiddy K. Asamoah","doi":"10.1101/2020.10.11.20210856","DOIUrl":"https://doi.org/10.1101/2020.10.11.20210856","url":null,"abstract":"Abstract: Ready-to-eat food (RTE) are foods that are intended by the producers for direct human consumption without the need for further preparation. The primary source of human Listeriosis is mainly through ingestion of contaminated RTE food products. Thus, implementing control strategies for Listeriosis infectious disease is vital for its management and eradication. In the present study, a deterministic model of Listeriosis disease transmission dynamics with control measures was analyzed. We assumed that humans are infected with Listeriosis either through ingestion of contaminated food products or directly with Listeria Monocytogenes in their environment. Equilibrium points of the model in the absence of control measures were determined, and their local asymptotic stability established. We formulate an optimal control problem and analytically give sufficient conditions for the optimality and the transversality conditions for the model with controls. Numerical simulations of the optimal control strategies were performed to illustrate the results. The numerical findings suggest that constant implementation of the joint optimal control measures throughout the modelling time will be more efficacious in controlling or reducing the Listeriosis disease. The results of this study can be used as baseline measures in controlling Listeriosis disease from ready-to-eat food products.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Cosine kernel based density peaks clustering algorithm 基于余弦核的密度峰聚类算法
Int. J. Comput. Sci. Math. Pub Date : 2020-07-27 DOI: 10.1504/ijcsm.2020.10030824
Jiayuan Wang, Li Lv, Runxiu Wu, Tanghuai Fan, Ivan Lee
{"title":"Cosine kernel based density peaks clustering algorithm","authors":"Jiayuan Wang, Li Lv, Runxiu Wu, Tanghuai Fan, Ivan Lee","doi":"10.1504/ijcsm.2020.10030824","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10030824","url":null,"abstract":"Density peaks clustering (DPC) determines the density peaks according to density-distance, and local density computation significantly impacts the clustering performance of the DPC algorithm. Following this lead, a revised DPC algorithm based on cosine kernel is proposed and examined in this paper. The cosine kernel function uses local information of datasets to define the local density, which not only finds the position difference of different samples within the cutoff distance, but also balances the influence of centre points and boundary points of clusters on local density of samples. Theoretical analysis and experimental verification are included to demonstrate the proposed algorithm's improvement in clustering performance and computational time over the DPC algorithm.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121232670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信