发布求助
文献互助 智能选刊 最新文献

Statistics, optimization & information computing最新文献

筛选
英文 中文
Modelling of Liquid Flow control system Using Optimized Genetic Algorithm 基于优化遗传算法的液体流量控制系统建模
Statistics, optimization & information computing Pub Date : 2020-02-20 DOI: 10.19139/soic-2310-5070-618
P. Dutta, Asok Kumar
{"title":"Modelling of Liquid Flow control system Using Optimized Genetic Algorithm","authors":"P. Dutta, Asok Kumar","doi":"10.19139/soic-2310-5070-618","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-618","url":null,"abstract":"Estimation of a highly accurate model for liquid flow process industry and control of the liquid flow rate from experimental data is an important task for engineers due to its non linear characteristics. Efficient optimization techniques are essential to accomplish this task.In most of the process control industry flow rate depends upon a multiple number of parameters like sensor output,pipe diameter, liquid conductivity ,liquid viscosity ,liquid density etc. In traditional optimization technique its very time consuming for manually control the parameters to obtain the optimal flow rate from the process. Hence the alternative approach , computational optimization process is utilized by using the different computational intelligence technique.In this paper three different selection of Genetic Algorithm is proposed to taste against the present liquid flow process. The proposed algorithm is developed based on the mimic genetic evolution of species that allow the consecutive generations in population to adopt their environment. Equations for Response Surface Methodology (RSM) and Analysis of Variance (ANOVA) are being used as non-linear models and these models are optimized using the proposed different selection of Genetic optimization techniques. It can be observed that the among these three different selection of Genetic Algorithm ,Rank selected GA is better than the other two selection (Tournament ,Roulette wheel) in terms of the accuracy of final solutions, success rate, convergence speed, and stability.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"565-582"},"PeriodicalIF":0.0,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47377815","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}
引用次数: 11
The Location Parameter Estimation of Spherically Distributions with Known Covariance Matrices 具有已知协方差矩阵的球面分布的位置参数估计
Statistics, optimization & information computing Pub Date : 2020-02-20 DOI: 10.19139/soic-2310-5070-710
M. Afshari, H. Karamikabir
{"title":"The Location Parameter Estimation of Spherically Distributions with Known Covariance Matrices","authors":"M. Afshari, H. Karamikabir","doi":"10.19139/soic-2310-5070-710","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-710","url":null,"abstract":"This paper presents shrinkage estimators of the location parameter vector for spherically symmetric distributions. We suppose that the mean vector is non-negative constraint and the components of diagonal covariance matrix is known. We compared the present estimator with natural estimator by using risk function. We show that when the covariance matrices are known, under the balance error loss function, shrinkage estimator has the smaller risk than the natural estimator. Simulation results are provided to examine the shrinkage estimators.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"499-506"},"PeriodicalIF":0.0,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49330290","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 itertive algorithm with error terms for solving a system of implicit n-variational inclusions 求解隐n变分包含系统的带误差项迭代算法
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-705
Z. Khan, S. S. Irfan, M. F. Khan, P. Shukla
{"title":"An itertive algorithm with error terms for solving a system of implicit n-variational inclusions","authors":"Z. Khan, S. S. Irfan, M. F. Khan, P. Shukla","doi":"10.19139/soic-2310-5070-705","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-705","url":null,"abstract":"A new system of implicit n-variational inclusions is considered. We propose a new algorithm with error terms for computing the approximate solutions of our system. The convergence of the iterative sequences generated by the iterative algorithm is also discussed. Some special cases are also discussed.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"242-253"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48882193","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
Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints 锥约束上不可微多目标分式规划问题的高阶对称对偶
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-601
R. Dubey, Deepmala, V. Mishra
{"title":"Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints","authors":"R. Dubey, Deepmala, V. Mishra","doi":"10.19139/soic-2310-5070-601","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-601","url":null,"abstract":"In this paper, we introduce the definition of higher-order K-(C,α, ρ, d)-convexity/pseudoconvexity over cone and discuss a nontrivial numerical examples for existing such type of functions. The purpose of the paper is to study higher order fractional symmetric duality over arbitrary cones for nondifferentiable Mond-Weir type programs under higherorder K -(C,α, ρ, d)-convexity/pseudoconvexity assumptions. Next, we prove appropriate duality relations under aforesaid assumptions.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"187-205"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43759425","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}
引用次数: 22
Improving firefly-based multi-objective optimization based on attraction law and crowding distance 改进基于吸引规律和拥挤距离的萤火虫多目标优化算法
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-382
Farid shayesteh, R. Moghaddam
{"title":"Improving firefly-based multi-objective optimization based on attraction law and crowding distance","authors":"Farid shayesteh, R. Moghaddam","doi":"10.19139/soic-2310-5070-382","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-382","url":null,"abstract":"Multi-objective optimization problems are so designed that they simultaneously minimize several objectives functions (which are sometimes contradictory). In most cases, the objectives are in conflict with each other such that optimization of one objective does not lead to the optimization of another ones. Therefore, we should achieve a certain balance of goals to solve these problems, which usually requires the application of an intelligent method. In this regard, use of meta-heuristic algorithms will be associated with resolved problems. In this paper, we propose a new multi-objective firefly optimization method which is designed based on the law of attraction and crowding distance. The proposed methods efficiency has been evaluated by three valid test functions containing convex, nonconvex and multi discontinuous convex Pareto fronts. Simulation results confirm the significant accuracy of proposed method in defining the Pareto front for all three test functions. In addition, the simulation results indicates that proposed algorithm has higher accuracy and greater convergence speed, compared to other well known multi-objective algorithms such as non-dominated sorting genetic algorithm, Bees algorithm, Differential Evolution algorithm and Strong Pareto Evolutionary Algorithm.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"229-241"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67752424","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
Vector-valued nonuniform multiresolution analysis related to Walsh function 与Walsh函数相关的向量值非均匀多分辨率分析
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-681
Abdullah
{"title":"Vector-valued nonuniform multiresolution analysis related to Walsh function","authors":"Abdullah","doi":"10.19139/soic-2310-5070-681","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-681","url":null,"abstract":"In this paper, we introduce vector-valued nonuniform multiresolution analysis on positive half-line related to Walsh functions. We obtain the necessary and sufficient condition for the existence of associated wavelets.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"206-219"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46470150","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
Probability Model Based on Cluster Analysis to Classify Sequences of Observations for Small Training Sets 基于聚类分析的概率模型对小训练集观测序列进行分类
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-690
Sergey S. Yulin, I. Palamar
{"title":"Probability Model Based on Cluster Analysis to Classify Sequences of Observations for Small Training Sets","authors":"Sergey S. Yulin, I. Palamar","doi":"10.19139/soic-2310-5070-690","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-690","url":null,"abstract":"The problem of recognizing patterns, when there are few training data available, is particularly relevant and arises in cases when collection of training data is expensive or essentially impossible. The work proposes a new probability model MC&CL (Markov Chain and Clusters) based on a combination of markov chain and algorithm of clustering (self-organizing map of Kohonen, k-means method), to solve a problem of classifying sequences of observations, when the amount of training dataset is low. An original experimental comparison is made between the developed model (MC&CL) and a number of the other popular models to classify sequences: HMM (Hidden Markov Model), HCRF (Hidden Conditional Random Fields),LSTM (Long Short-Term Memory), kNN+DTW (k-Nearest Neighbors algorithm + Dynamic Time Warping algorithm). A comparison is made using synthetic random sequences, generated from the hidden markov model, with noise added to training specimens. The best accuracy of classifying the suggested model is shown, as compared to those under review, when the amount of training data is low.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"296-303"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46832869","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}
引用次数: 2
Business Analytics using Dynamic Pricing based on Customer Entry-Exit Rates Tradeoff 基于客户进出口价格权衡的动态定价业务分析
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-551
H. Fazlollahtabar, M. Ashoori
{"title":"Business Analytics using Dynamic Pricing based on Customer Entry-Exit Rates Tradeoff","authors":"H. Fazlollahtabar, M. Ashoori","doi":"10.19139/soic-2310-5070-551","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-551","url":null,"abstract":"This paper concerns with an integrated business process to be applied as a decision support for market analysis and decision making. The proposed business intelligence and analytics system makes use of an extract, transform and load mechanism for data collection and purification. As a mathematical decision optimization, dynamic pricing is formulated based on customer entry-exit rates in a history-based pricing model. The optimal prices for products are obtained so that aggregated profit is maximized. A case study is reported to show the effectiveness of the approach. Also, analytical investigations on the impacts of the sensitive parameters of the pricing model are given.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"272-280"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45136062","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
Inexact Double Step Length Method For Solving Systems Of Nonlinear Equations 求解非线性方程组的不精确双步长方法
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-532
A. Halilu, M. Waziri, Y. B. Musa
{"title":"Inexact Double Step Length Method For Solving Systems Of Nonlinear Equations","authors":"A. Halilu, M. Waziri, Y. B. Musa","doi":"10.19139/soic-2310-5070-532","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-532","url":null,"abstract":"In this paper, a single direction with double step length method for solving systems of nonlinear equations is presented. Main idea used in the algorithm is to approximate the Jacobian via acceleration parameter. Furthermore, the two step lengths are calculated using inexact line search procedure. This method is matrix-free, and so is advantageous when solving large-scale problems. The proposed method is proven to be globally convergent under appropriate conditions. The preliminary numerical results reported in this paper using a large-scale benchmark test problems show that the proposed method is practically quite effective.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"165-174"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48659149","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}
引用次数: 12
Optimal control of a rectilinear motion of a rocket 火箭直线运动的最佳控制
Statistics, optimization & information computing Pub Date : 2020-02-18 DOI: 10.19139/soic-2310-5070-741
M. Aliane, N. Moussouni, Mohand Bentobache
{"title":"Optimal control of a rectilinear motion of a rocket","authors":"M. Aliane, N. Moussouni, Mohand Bentobache","doi":"10.19139/soic-2310-5070-741","DOIUrl":"https://doi.org/10.19139/soic-2310-5070-741","url":null,"abstract":"In this work, we have modelled the problem of maximizing the velocity of a rocket moving with a rectilinear motion by a linear optimal control problem, where the control represents the action of the pilot on the rocket. In order to solve the obtained model, we applied both analytical and numerical methods. The analytical solution is calculated using the Pontryagin maximum principle while the approximate solution of the problem is found using the shooting method as well as two techniques of discretization: the technique using the Cauchy formula and the one using the Euler formula. In order to compare the different methods, we developed an implementation with MATLAB and presented some simulation results.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"281-295"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45425686","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信