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

CompSciRN: Algorithms (Topic)最新文献

筛选
英文 中文
Development Methodology of Determinating Residual Carrying Capacity of Reinforced Concrete Beams with Damages Tensile Reinforcement Which Occurred during Loading 加载过程中钢筋受拉损伤的钢筋混凝土梁剩余承载力确定方法的发展
CompSciRN: Algorithms (Topic) Pub Date : 2021-08-30 DOI: 10.15587/1729-4061.2021.237954
P. Vegera, R. Vashkevych, Y. Blikharskyy, R. Khmil
{"title":"Development Methodology of Determinating Residual Carrying Capacity of Reinforced Concrete Beams with Damages Tensile Reinforcement Which Occurred during Loading","authors":"P. Vegera, R. Vashkevych, Y. Blikharskyy, R. Khmil","doi":"10.15587/1729-4061.2021.237954","DOIUrl":"https://doi.org/10.15587/1729-4061.2021.237954","url":null,"abstract":"This paper reports the improved and verified procedure for calculating reinforced concrete beams affected by damage to stretched reinforcement when loaded. The main results from testing the reinforced concrete beams with damage in the stretched zone in the form of one hole in the reinforcement in the middle of the beam are given. The variable parameter of the study was the level of load resulting in the damage. It acquired values of 0, 30 %, 50 %, 70 % of the bearing capacity of control undamaged samples. Overall, the results of testing 12 samples are given. A new procedure has been proposed for taking into consideration changes in the mechanical characteristics of stretched reinforcement arising from its damage. This makes it possible to more accurately establish the bearing capacity of reinforced concrete bended elements affected by damage to their reinforcement during operation. The analysis of the calculation, compared with experimental quantities, led to a conclusion that the strain model could determine when the bearing capacity of reinforced concrete beams without damage and with damage to working reinforcement is exhausted. Based on the improved algorithm, the principle of using a strain model was proposed to establish when the bearing capacity of damaged samples, taking into consideration the effect of the load level, is exhausted. The theoretical estimation, considering when the bearing capacity is exhausted, showed results that are 3...21 % less than the experimental values, which ensures reliability of calculation of such structures. The proposed calculation provides a new approach to determining the bearing capacity of reinforced concrete beams damaged during operation. That, in turn, makes it possible to more accurately determine the residual bearing capacity of structures and increases the safety of their operation.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130965682","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}
引用次数: 4
Comparison Analysis of Facebook's Prophet, Amazon's DeepARr+ and CNN-QR Algorithms for Successful Real-World Sales Forecasting Facebook的Prophet、亚马逊的DeepARr+和CNN-QR算法在现实世界销售预测中的成功对比分析
CompSciRN: Algorithms (Topic) Pub Date : 2021-04-01 DOI: 10.5121/ijcsit.2021.13205
E. Žunić, Kemal Korjenić, Sead Delalic, Zlatko Subara
{"title":"Comparison Analysis of Facebook's Prophet, Amazon's DeepARr+ and CNN-QR Algorithms for Successful Real-World Sales Forecasting","authors":"E. Žunić, Kemal Korjenić, Sead Delalic, Zlatko Subara","doi":"10.5121/ijcsit.2021.13205","DOIUrl":"https://doi.org/10.5121/ijcsit.2021.13205","url":null,"abstract":"By successfully solving the problem of forecasting, the processes in the work of various companies are optimized and savings are achieved. In this process, the analysis of time series data is of particular importance. Since the creation of Facebook’s Prophet, and Amazon’s DeepAR+ and CNN-QR forecasting models, algorithms have attracted a great deal of attention. The paper presents the application and comparison of the above algorithms for sales forecasting in distribution companies. A detailed comparison of the performance of algorithms over real data with different lengths of sales history was made. The results show that Prophet gives better results for items with a longer history and frequent sales, while Amazon’s algorithms show superiority for items without a long history and items that are rarely sold.<br><br>","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131967049","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
A New Heuristic Optimization: Search and Rescue Algorithm and Solving the Function Optimization Problems 一种新的启发式优化:搜索与救援算法及求解函数优化问题
CompSciRN: Algorithms (Topic) Pub Date : 2021-02-28 DOI: 10.2139/ssrn.3902584
M. Ozdemir
{"title":"A New Heuristic Optimization: Search and Rescue Algorithm and Solving the Function Optimization Problems","authors":"M. Ozdemir","doi":"10.2139/ssrn.3902584","DOIUrl":"https://doi.org/10.2139/ssrn.3902584","url":null,"abstract":"Heuristic techniques are optimization methods that inspired by nature. Although there are many heuristics in the literature, a new heuristic technique is presented by researchers every day by observing nature-based or living behaviors in nature. In this study, a new heuristic optimization technique inspired by human behavior is proposed. In order to prove the validity of this method called Search and Rescue Optimization Algorithm (AKOA), the technique applied to find the global minimums of function optimization test problems in the literature. As a result of the experiments performed on 21 minimization problems, it has been observed that AKOA is quite competitive when compared to Dynamic Random Search Technique and Random Selection Walk Technique.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125875697","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 Comparative Study on Facial Recognition Algorithms 人脸识别算法的比较研究
CompSciRN: Algorithms (Topic) Pub Date : 2020-12-21 DOI: 10.2139/ssrn.3753064
Sanmoy Paul, S. Acharya
{"title":"A Comparative Study on Facial Recognition Algorithms","authors":"Sanmoy Paul, S. Acharya","doi":"10.2139/ssrn.3753064","DOIUrl":"https://doi.org/10.2139/ssrn.3753064","url":null,"abstract":"Facial recognition methods were first explored in security systems to identify and compare human faces and is far superior compared to biometric and iris recognition, this technique has been implemented in iris recognition, image detection etc. Recently these methods have been explored in other fields of study and have become a commercial identification and marketing tool. This paper describes the different algorithms of facial recognition and compared their recognition accuracies. The face is detected through Haar Cascades algorithm which is saved into a database, after that, the study intended to compare facial recognition accuracy of the well-known algorithms Eigen faces with PCA, SVM, KNN, and CNN. The results showed out of the three algorithms we used CNN yielded the maximum accuracy.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128459465","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
FairPut: A Light Framework for Machine Learning Fairness with LightGBM FairPut:基于LightGBM的机器学习公平性轻量级框架
CompSciRN: Algorithms (Topic) Pub Date : 2020-06-04 DOI: 10.2139/ssrn.3619715
Derek Snow
{"title":"FairPut: A Light Framework for Machine Learning Fairness with LightGBM","authors":"Derek Snow","doi":"10.2139/ssrn.3619715","DOIUrl":"https://doi.org/10.2139/ssrn.3619715","url":null,"abstract":"This is a holistic framework to approach fair prediction outputs at the individual and group level. This framework includes quantitative monotonic measures, residual explanations, benchmark competition, adversarial attacks, disparate error analysis, model agnostic pre-and post-processing, reasoning codes, counterfactuals, contrastive explanations, and prototypical examples. A number novel techniques are proposed in this framework, each of which could benefit from future examination.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407887","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 High Performance Computing of Internal Rate of Return Using a Centroid Based Newton Raphson Iterative Algorithm 基于质心的Newton Raphson迭代算法的内部收益率的高性能计算
CompSciRN: Algorithms (Topic) Pub Date : 2020-04-01 DOI: 10.30534/ijatcse/2020/150922020
N. Nagares, Ariel M. Sison
{"title":"A High Performance Computing of Internal Rate of Return Using a Centroid Based Newton Raphson Iterative Algorithm","authors":"N. Nagares, Ariel M. Sison","doi":"10.30534/ijatcse/2020/150922020","DOIUrl":"https://doi.org/10.30534/ijatcse/2020/150922020","url":null,"abstract":"A popular financial metric in estimating the profitability of a project or investment is the internal rate of return. However, the IRR variable cannot be easily isolated from the equation. This is effectively solved by using iterative root-finding algorithms, some of the most frequently used of which are secant, bisection, false position, and Newton-Raphson algorithm. Although the Newton-Raphson method is considered to be the fastest to converge and the most popular method, it still requires an initial guess value from the user, which could result in the algorithm to not converge to the root if the user input is far from the actual root. This issue is addressed by a midpoint-based newton-raphson technique, which sets the midpoint of cash flows as the initial guess input. However, the midpoint technique is static as it does not adjust with unequal cash flows. This study presents a centroid-based newton-raphson algorithm in estimating IRR, which dynamically takes into consideration the values of cash flows. The experimental results show that the proposed algorithm ensures convergence by producing an initial IRR with an accuracy of 91.41%. This indicates that it is 26.75% more accurate in approximating the initial IRR than the midpoint-based newton-raphson algorithm. It also reduced the required iterations of convergence by 35.33% over the midpoint-based newton-raphson algorithm. These findings show that the employment of the centroid-based newton-raphson algorithm in approximating IRR provides a significantly better approach in evaluating investments than the current method.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131649293","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 Multi-criteria Based Double Auctioning Mechanism with Undesignated Resources Constraints in Cloud 云环境中基于多准则的非指定资源约束双拍卖机制
CompSciRN: Algorithms (Topic) Pub Date : 2019-10-02 DOI: 10.2139/ssrn.3462940
Noopur Rathore, K. Suthar, Jayesh Mevada
{"title":"A Multi-criteria Based Double Auctioning Mechanism with Undesignated Resources Constraints in Cloud","authors":"Noopur Rathore, K. Suthar, Jayesh Mevada","doi":"10.2139/ssrn.3462940","DOIUrl":"https://doi.org/10.2139/ssrn.3462940","url":null,"abstract":"Now a day’s double auctioning mechanism considered to be effective mechanism which is based on the fundamental of many to many negotiations. In this mechanism the seller and buyer both provides their ask and needs respectively and the Auctioning mechanism are used to match this for effective allotment. If there is no any constraint available with the algorithm than it works fine but when some criteria like budget from seller or buyer, execution time, location, Past history, Feedback Etc. are involved than this allotment become very difficult. Besides this some issue may arise when even the auctioning algorithm failed to allocated all the available resources due to unhandled criteria. This is called undesignated resources constraint issue. So here we not only aim to design a multi-criteria based effective Double auctioning mechanism which efficiently increases the allotment but also consider to handle the issue of unallocated resources.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125438931","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
Genetic Algorithms: A Heuristic Approach to Multi-Dimensional Problems 遗传算法:多维问题的启发式方法
CompSciRN: Algorithms (Topic) Pub Date : 2019-08-30 DOI: 10.2139/ssrn.3451302
Philippe Huber, Tony Guida
{"title":"Genetic Algorithms: A Heuristic Approach to Multi-Dimensional Problems","authors":"Philippe Huber, Tony Guida","doi":"10.2139/ssrn.3451302","DOIUrl":"https://doi.org/10.2139/ssrn.3451302","url":null,"abstract":"Evolutionary algorithms are not new and have been developed, both their concepts and framework, since around the 1950’s based on the idea that the evolutionary process could be used as a general-purpose optimization tool. The goal of this paper is to propose an alternative to classical optimization techniques that can handle systems of a very high dimension. With the rapid rise of computing power, as well as the augmentation of alternative sources of data, quantitative analysts are confronted by numerical challenges that didn’t exist a decade ago. In this paper, we show that a Genetic Algorithm (GAs) is a simple process based on the evolution paradigm that is well adapted to very large portfolios, increasing the execution speed; an optimization of a portfolio of more than 100’000 times series of 5’000 daily returns takes less than 5 minutes. Finally, we illustrate that, although GAs are a random process that generates a different solution every time it is run on the same data, it is remarkably stable.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129767513","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
Random Walk Model From the Point of View of Algorithmic Trading 从算法交易的角度看随机游走模型
CompSciRN: Algorithms (Topic) Pub Date : 2019-08-12 DOI: 10.2139/ssrn.3436367
O. Danyliv, B. Bland, A. Argenson
{"title":"Random Walk Model From the Point of View of Algorithmic Trading","authors":"O. Danyliv, B. Bland, A. Argenson","doi":"10.2139/ssrn.3436367","DOIUrl":"https://doi.org/10.2139/ssrn.3436367","url":null,"abstract":"Despite the fact that an intraday market price distribution is not normal, the random walk model of price behaviour is as important for the understanding of basic principles of the market as the pendulum model is a starting point of many fundamental theories in physics. This model is a good zero order approximation for liquid fast moving markets where the queue position is less important than the price action. In this paper we present an exact solution for the cost of the static passive slice execution. It is shown, that if a price has a random walk behaviour, there is no optimal limit level for an order execution: all levels have the same execution cost as an immediate aggressive execution at the beginning of the slice. Additionally the estimations for the risk of a limit order as well as the probability of a limit order execution as functions of the slice time and standard deviation of the price are derived.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"17 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123733738","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}
引用次数: 5
Stochastic Stackelberg Security Games 随机Stackelberg安全博弈
CompSciRN: Algorithms (Topic) Pub Date : 2019-06-28 DOI: 10.2139/ssrn.3411860
Deepanshu Vasal
{"title":"Stochastic Stackelberg Security Games","authors":"Deepanshu Vasal","doi":"10.2139/ssrn.3411860","DOIUrl":"https://doi.org/10.2139/ssrn.3411860","url":null,"abstract":"In this paper, we consider a discrete time stochastic Stackelberg game where there is a defender (also called leader) who has to defend a target and an attacker (also called follower). The attacker has a private type that evolves as a controlled Markov process. The objective is to compute Stochastic Stackelberg equilibrium of the game where defender commits to a strategy. The attacker's strategy is the best response to defender strategy and defender's strategy is optimum given attacker plays best response. In general computing such equilibrium involves solving a fixed-point equation for the whole game. In this paper, we present an algorithm that computes such strategies by solving smaller fixed-point equations for each time t. This reduces the computational complexity of the problem from double exponential in time to linear in time. Based on this algorithm, we compute Stackelberg equilibrium of a security example.","PeriodicalId":106276,"journal":{"name":"CompSciRN: Algorithms (Topic)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115401725","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
下一页 尾页
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学术官方微信