首页 > 最新文献

2022 OITS International Conference on Information Technology (OCIT)最新文献

英文 中文
Power Solutions for Wireless Sensor Network 无线传感器网络电源解决方案
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00079
Purushottam Govind, P. S. Chatterjee
WSN's foundation is power. However, because sensor nodes are small, their batteries are also small and quickly deplete. We provide a unique type of technique to solve this issue and enable our battery to maintain extended discharge durations. For energy storage applications, electrochemical cells should have the capacity to sustain long-term self-charging. We create a battery that can be recharged without the use of outside energy sources. The redox reaction theory underlies how the battery operates. Instead of the usual ingredients, some special materials were used to produce the batteries. Utilizing anticipated data, we conducted the experiment and produced the graph. These batteries were discovered to be more effective than typical ones.
WSN的基础是力量。然而,由于传感器节点很小,它们的电池也很小,很快就会耗尽。我们提供了一种独特的技术来解决这个问题,并使我们的电池保持更长的放电时间。对于能量存储应用,电化学电池应该具有维持长期自充电的能力。我们发明了一种无需外部能源即可充电的电池。氧化还原反应理论是电池工作原理的基础。代替通常的原料,一些特殊的材料被用来生产电池。利用预期的数据,我们进行了实验并制作了图表。人们发现这些电池比普通电池更有效。
{"title":"Power Solutions for Wireless Sensor Network","authors":"Purushottam Govind, P. S. Chatterjee","doi":"10.1109/OCIT56763.2022.00079","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00079","url":null,"abstract":"WSN's foundation is power. However, because sensor nodes are small, their batteries are also small and quickly deplete. We provide a unique type of technique to solve this issue and enable our battery to maintain extended discharge durations. For energy storage applications, electrochemical cells should have the capacity to sustain long-term self-charging. We create a battery that can be recharged without the use of outside energy sources. The redox reaction theory underlies how the battery operates. Instead of the usual ingredients, some special materials were used to produce the batteries. Utilizing anticipated data, we conducted the experiment and produced the graph. These batteries were discovered to be more effective than typical ones.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131316832","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
Coverage of Targets in Mobile Sensor Networks With Limited Mobility 有限移动传感器网络中目标的覆盖
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00089
Saumya Jaipuria, R. Das
In Mobile Sensor Networks (MSN), covering targets with minimum movement is an important issue. We consider two related problems but with a limited mobility model where no sensor can move beyond a certain distance. In the first problem, we minimize the sum of the movements of all sensors. And in the other, we minimize their maximum. We solve the first problem by relaxing the equivalent Integer Linear Program (ILP) where the maximum allowable distance is a parameter. Experimental results show that our algorithm gives the solution very close to the optimal. For the second problem, we apply binary search and repeatedly execute the relaxed LP until we find the smallest value of the maximum distance that gives a feasible solution. We could find movements of sensors that satisfy the above limit in all our experiments with different random placements of sensors and targets.
在移动传感器网络(MSN)中,覆盖最小运动目标是一个重要问题。我们考虑两个相关的问题,但有一个有限的移动模型,没有传感器可以移动超过一定的距离。在第一个问题中,我们最小化所有传感器的运动之和。在另一种情况下,我们最小化它们的最大值。我们通过放宽等效整数线性规划(ILP)来解决第一个问题,其中最大允许距离是一个参数。实验结果表明,该算法得到的解非常接近最优解。对于第二个问题,我们使用二分搜索并重复执行松弛LP,直到找到给出可行解的最大距离的最小值。在我们所有的实验中,我们都可以在不同的传感器和目标的随机位置下找到满足上述限制的传感器运动。
{"title":"Coverage of Targets in Mobile Sensor Networks With Limited Mobility","authors":"Saumya Jaipuria, R. Das","doi":"10.1109/OCIT56763.2022.00089","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00089","url":null,"abstract":"In Mobile Sensor Networks (MSN), covering targets with minimum movement is an important issue. We consider two related problems but with a limited mobility model where no sensor can move beyond a certain distance. In the first problem, we minimize the sum of the movements of all sensors. And in the other, we minimize their maximum. We solve the first problem by relaxing the equivalent Integer Linear Program (ILP) where the maximum allowable distance is a parameter. Experimental results show that our algorithm gives the solution very close to the optimal. For the second problem, we apply binary search and repeatedly execute the relaxed LP until we find the smallest value of the maximum distance that gives a feasible solution. We could find movements of sensors that satisfy the above limit in all our experiments with different random placements of sensors and targets.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131342476","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
Optimization methods for soybean crop disease classification: A comparative study 大豆作物病害分类优化方法的比较研究
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00013
R. Krishna, K. Prema
India's most widely utilized food crop is soybean, and deep learning techniques are frequently used in forecasting and classification tasks. The minute scenario shows that the classification of the soybean crop diseases is a well-used machine learning technique with the help of images. But the proposed work, for the first time, combines soybean physic crop properties, weather properties, and deep learning techniques for classification. As a result, Random Forest and Support Vector Machine classification algorithms are utilized and the accuracy is compared with and without feature selection. Disease classification is compared using deep learning techniques like Recurrent Neural Networks, Convolutional Neural Networks, and Multi-Layer Perceptrons, along with optimization techniques like Adam, RmsProp, and AdaGrad. Results indicate that the farmers can predict soybean crop disease based on weather and the physical crop properties, hence taking preventive action.
印度最广泛使用的粮食作物是大豆,深度学习技术经常用于预测和分类任务。这一分钟的场景表明,在图像的帮助下,大豆作物病害的分类是一种很常用的机器学习技术。但这项工作首次将大豆的物理作物特性、天气特性和深度学习技术结合起来进行分类。利用随机森林和支持向量机两种分类算法,比较了有无特征选择的准确率。使用深度学习技术(如循环神经网络、卷积神经网络和多层感知器)以及优化技术(如Adam、RmsProp和AdaGrad)对疾病分类进行比较。结果表明,农民可以根据天气和作物物理特性预测大豆作物病害,从而采取预防措施。
{"title":"Optimization methods for soybean crop disease classification: A comparative study","authors":"R. Krishna, K. Prema","doi":"10.1109/OCIT56763.2022.00013","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00013","url":null,"abstract":"India's most widely utilized food crop is soybean, and deep learning techniques are frequently used in forecasting and classification tasks. The minute scenario shows that the classification of the soybean crop diseases is a well-used machine learning technique with the help of images. But the proposed work, for the first time, combines soybean physic crop properties, weather properties, and deep learning techniques for classification. As a result, Random Forest and Support Vector Machine classification algorithms are utilized and the accuracy is compared with and without feature selection. Disease classification is compared using deep learning techniques like Recurrent Neural Networks, Convolutional Neural Networks, and Multi-Layer Perceptrons, along with optimization techniques like Adam, RmsProp, and AdaGrad. Results indicate that the farmers can predict soybean crop disease based on weather and the physical crop properties, hence taking preventive action.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122316154","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
Comparative Performance Analysis of Genetic Algorithm and Differential Evolution for Optimization of Missile Gliding Trajectory 遗传算法与差分进化优化导弹滑翔轨迹的性能比较分析
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00043
Shubhashree Sahoo, R. Dalei, S. Rath, U. Sahu
Evolutionary algorithms (EA) are well known algorithms and commonly used for trajectory optimization of missile. The present research work aims at comparative performance analysis of two different EAs such as genetic algorithm (GA) and differential evolution (DE) for optimization of missile gliding trajectory. The range of missile was maximized by optimizing gliding trajectory through descretization of angle of attack (AOA) as control parameter and problem solving. Evaluation of performance characteristics of GA and DE was carried out on the basis of computation time, accuracy of solution and convergence efficiency. Experimental results demonstrate the better performance of DE when compared to GA in terms of computation time, solution accuracy and convergence efficiency.
进化算法是一种常用的导弹弹道优化算法。本研究的目的是比较分析遗传算法和差分进化算法两种不同的导弹滑翔弹道优化算法的性能。以攻角去离散化为控制参数,通过求解问题,优化滑翔弹道,实现导弹射程最大化。从计算时间、解的精度和收敛效率三个方面对遗传算法和遗传算法的性能特征进行了评价。实验结果表明,与遗传算法相比,DE算法在计算时间、求解精度和收敛效率等方面都具有更好的性能。
{"title":"Comparative Performance Analysis of Genetic Algorithm and Differential Evolution for Optimization of Missile Gliding Trajectory","authors":"Shubhashree Sahoo, R. Dalei, S. Rath, U. Sahu","doi":"10.1109/OCIT56763.2022.00043","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00043","url":null,"abstract":"Evolutionary algorithms (EA) are well known algorithms and commonly used for trajectory optimization of missile. The present research work aims at comparative performance analysis of two different EAs such as genetic algorithm (GA) and differential evolution (DE) for optimization of missile gliding trajectory. The range of missile was maximized by optimizing gliding trajectory through descretization of angle of attack (AOA) as control parameter and problem solving. Evaluation of performance characteristics of GA and DE was carried out on the basis of computation time, accuracy of solution and convergence efficiency. Experimental results demonstrate the better performance of DE when compared to GA in terms of computation time, solution accuracy and convergence efficiency.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126929393","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
Compound sentence and pronoun generation in Sanyog: An Iconic Communication System for People with Speech and Motor Impairments 三语复合句和代词的生成:语言和运动障碍人士的标志性交流系统
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00011
P. S. Chatterjee
Serious Speech and Motor Impairment (SSMI) affects a sizeable portion of the Indian population. They are unable to communicate normally because of their physical impairment. For persons who are physically disabled, such as those who have cerebral palsy, speech disorders, or other motor neuron difficulties, the Sanyog is a tool that helps them speak and communicate. The user communicates with icons in this Iconic Communication System (ICS). The collection of chosen icons is transformed into an instantiated representation, which resembles a frame. A natural language simple sentence generator accepts this intermediate representation. The proposed work aim to creates compound sentence from the subject's input in Sanyog in Bengali language. Two simple sentences are aggregated to form compound sentence. After that we applies the rules of pronolninalization to generate pronouns which makes the compound sentence more fluent. In this paper among the different categories of pronouns we have only concentrate on anaphoric pronoun generation. Lastly the correctness of the generated sentences are checked.
严重言语和运动障碍(SSMI)影响了相当一部分印度人口。由于身体上的缺陷,他们无法正常交流。对于患有脑瘫、语言障碍或其他运动神经元障碍等身体残疾的人来说,Sanyog是帮助他们说话和交流的工具。在这个图标通信系统(ICS)中,用户与图标进行通信。所选图标的集合被转换成一个实例化的表示,它类似于一个框架。自然语言简单句生成器接受这种中间表示。本研究的目的是利用主体输入的孟加拉语Sanyog生成复合句。两个简单句组合成并列句。然后运用代词化规则生成代词,使复合句更加流畅。在不同类型的代词中,我们只关注回指代词的生成。最后检查生成的句子的正确性。
{"title":"Compound sentence and pronoun generation in Sanyog: An Iconic Communication System for People with Speech and Motor Impairments","authors":"P. S. Chatterjee","doi":"10.1109/OCIT56763.2022.00011","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00011","url":null,"abstract":"Serious Speech and Motor Impairment (SSMI) affects a sizeable portion of the Indian population. They are unable to communicate normally because of their physical impairment. For persons who are physically disabled, such as those who have cerebral palsy, speech disorders, or other motor neuron difficulties, the Sanyog is a tool that helps them speak and communicate. The user communicates with icons in this Iconic Communication System (ICS). The collection of chosen icons is transformed into an instantiated representation, which resembles a frame. A natural language simple sentence generator accepts this intermediate representation. The proposed work aim to creates compound sentence from the subject's input in Sanyog in Bengali language. Two simple sentences are aggregated to form compound sentence. After that we applies the rules of pronolninalization to generate pronouns which makes the compound sentence more fluent. In this paper among the different categories of pronouns we have only concentrate on anaphoric pronoun generation. Lastly the correctness of the generated sentences are checked.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127803229","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
Message from the General Chairs: OCIT 2022 总主席致辞:OCIT 2022
Pub Date : 2022-12-01 DOI: 10.1109/ocit56763.2022.00005
{"title":"Message from the General Chairs: OCIT 2022","authors":"","doi":"10.1109/ocit56763.2022.00005","DOIUrl":"https://doi.org/10.1109/ocit56763.2022.00005","url":null,"abstract":"","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134012467","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
Semi Supervised Approach for Relation Extraction in Agriculture Documents 农业文献中关系抽取的半监督方法
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00046
V. G, Deepa Gupta, Vani Kanjirangat
In this work, we propose a semi-supervised boot-strapping approach for relation extraction in domain specific texts, specifically focusing on agricultural domain. Our approach utilizes the BERT model with dependency parsing for relation extraction. The proposed model, focuses on identifying five inter subdomain relations viz., Soil_Location, Soil_Crop, Disease_Pathogen, Pathogen_Crop, and Chemical_Crop. We created a corpus of 30,000 sentences extracted from recognised agriculture sites to evaluate the model. The labeled relations were then manually checked to evaluate the prediction accuracy. We used a test corpus with 700 sentences that included 3500 triplets for the evaluation. The proposed approach presents an average macro F -Score of 86.4 %, which is quite promising for semi-supervised domain specific relation extraction systems. Experimental results show the efficacy of the proposed approach in classifying relational phrases in a semi-supervised set-up for the agricultural domain.
在这项工作中,我们提出了一种半监督引导方法,用于特定领域文本的关系提取,特别是针对农业领域。我们的方法利用BERT模型和依赖解析进行关系提取。该模型主要识别5个子域间的关系,即Soil_Location、Soil_Crop、disease -病原菌、Pathogen_Crop和Chemical_Crop。我们创建了一个由30,000个句子组成的语料库,这些句子是从公认的农业站点中提取出来的,以评估该模型。然后手动检查标记的关系以评估预测的准确性。我们使用了一个包含700个句子的测试语料库,其中包含3500个三元组进行评估。该方法的平均宏观F -Score为86.4%,对于半监督领域特定关系提取系统是很有前途的。实验结果表明,该方法在半监督设置的农业领域关系短语分类中是有效的。
{"title":"Semi Supervised Approach for Relation Extraction in Agriculture Documents","authors":"V. G, Deepa Gupta, Vani Kanjirangat","doi":"10.1109/OCIT56763.2022.00046","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00046","url":null,"abstract":"In this work, we propose a semi-supervised boot-strapping approach for relation extraction in domain specific texts, specifically focusing on agricultural domain. Our approach utilizes the BERT model with dependency parsing for relation extraction. The proposed model, focuses on identifying five inter subdomain relations viz., Soil_Location, Soil_Crop, Disease_Pathogen, Pathogen_Crop, and Chemical_Crop. We created a corpus of 30,000 sentences extracted from recognised agriculture sites to evaluate the model. The labeled relations were then manually checked to evaluate the prediction accuracy. We used a test corpus with 700 sentences that included 3500 triplets for the evaluation. The proposed approach presents an average macro F -Score of 86.4 %, which is quite promising for semi-supervised domain specific relation extraction systems. Experimental results show the efficacy of the proposed approach in classifying relational phrases in a semi-supervised set-up for the agricultural domain.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131887959","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
IncentiveChain: Blockchain Crypto-Incentive for Effective Usage of Power and Water in Smart Farming 激励链:区块链加密激励在智能农业中有效使用电力和水
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00119
Sukrutha L. T. Vangipuram, S. Mohanty, E. Kougianos
This paper discusses how agriculture has become one of the prime reasons for the wastage of energy and water during food production. In order to control the use of resources in farming, we introduce a novel concept called IncentiveChain. The application idea is to distribute crypto ether as a reward to the farmers because they play key roles in keeping a check on resource usage and can benefit through these schemes economically. We provide a state-of-the-art architecture and design, which includes participation from national agricultural departments and local regional utility companies to embed various technologies and data together to make the IncentiveChain application practical. We have successfully implemented IncentiveChain to show the transfer of ether from utility company accounts to farmer accounts and the currency being collected by the farmer in a more secure way using the blockchain, removing third-party vulnerabilities.
本文讨论了农业如何成为粮食生产过程中能源和水浪费的主要原因之一。为了控制农业资源的使用,我们引入了一个名为“激励链”的新概念。应用程序的想法是将加密醚作为奖励分发给农民,因为他们在检查资源使用情况方面发挥着关键作用,并且可以通过这些计划在经济上受益。我们提供最先进的架构和设计,其中包括国家农业部门和当地区域公用事业公司的参与,将各种技术和数据集成在一起,使IncentiveChain的应用变得切实可行。我们已经成功实施了IncentiveChain,以显示以太币从公用事业公司账户转移到农民账户,并使用区块链以更安全的方式收集农民的货币,消除了第三方漏洞。
{"title":"IncentiveChain: Blockchain Crypto-Incentive for Effective Usage of Power and Water in Smart Farming","authors":"Sukrutha L. T. Vangipuram, S. Mohanty, E. Kougianos","doi":"10.1109/OCIT56763.2022.00119","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00119","url":null,"abstract":"This paper discusses how agriculture has become one of the prime reasons for the wastage of energy and water during food production. In order to control the use of resources in farming, we introduce a novel concept called IncentiveChain. The application idea is to distribute crypto ether as a reward to the farmers because they play key roles in keeping a check on resource usage and can benefit through these schemes economically. We provide a state-of-the-art architecture and design, which includes participation from national agricultural departments and local regional utility companies to embed various technologies and data together to make the IncentiveChain application practical. We have successfully implemented IncentiveChain to show the transfer of ether from utility company accounts to farmer accounts and the currency being collected by the farmer in a more secure way using the blockchain, removing third-party vulnerabilities.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133324052","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
Comparative Performance Analysis of Particle Swarm Optimization and Artificial Bee Colony Algorithm for Optimization of Missile Gliding Trajectory 粒子群算法与人工蜂群算法在导弹滑翔轨迹优化中的性能对比分析
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00044
Shubhashree Sahoo, R. Dalei, S. Rath, U. Sahu
Swarm intelligence algorithms were widely employed for trajectory optimization problem. The current study presents a comparative performance analysis of two well known swarm intelligence algorithms such as particle swarm optimization (PSO) and artificial bee colony (ABC) algorithm for optimization of missile gliding trajectory. The gliding range was maximized through trajectory optimization of missile by descretizing the angle of attack (AOA) as control parameter and solving control problem. Performance characteristics of PSO and ABC were evaluated based on computational efficiency, accuracy of solution and convergence ability. The obtained results reveal the superior performance of PSO with regard to accuracy of solution, computational efficacy and convergence ability in comparison to ABC.
群智能算法被广泛应用于轨道优化问题。本文对粒子群算法和人工蜂群算法两种常用的导弹滑翔轨迹优化算法进行性能对比分析。以消去迎角为控制参数,求解控制问题,对导弹进行弹道优化,实现滑翔距离最大化。从计算效率、解的精度和收敛能力等方面评价了粒子群算法和ABC算法的性能特点。结果表明,粒子群算法在解的精度、计算效率和收敛能力等方面都优于ABC算法。
{"title":"Comparative Performance Analysis of Particle Swarm Optimization and Artificial Bee Colony Algorithm for Optimization of Missile Gliding Trajectory","authors":"Shubhashree Sahoo, R. Dalei, S. Rath, U. Sahu","doi":"10.1109/OCIT56763.2022.00044","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00044","url":null,"abstract":"Swarm intelligence algorithms were widely employed for trajectory optimization problem. The current study presents a comparative performance analysis of two well known swarm intelligence algorithms such as particle swarm optimization (PSO) and artificial bee colony (ABC) algorithm for optimization of missile gliding trajectory. The gliding range was maximized through trajectory optimization of missile by descretizing the angle of attack (AOA) as control parameter and solving control problem. Performance characteristics of PSO and ABC were evaluated based on computational efficiency, accuracy of solution and convergence ability. The obtained results reveal the superior performance of PSO with regard to accuracy of solution, computational efficacy and convergence ability in comparison to ABC.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850653","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
Malayalam Character Recognition from Palm Leaves Using Deep-Learning 利用深度学习技术从棕榈叶中识别马来拉姆语字符
Pub Date : 2022-12-01 DOI: 10.1109/OCIT56763.2022.00035
Remya Sivan, Tripty Singh, P. Pati
Ancient manuscripts like palm leaves, available in museum libraries, are a rich source of knowledge. Digitization helps store this knowledge protected for the future & enables its global access. Varying writing styles, presence of currently discarded & rare characters, quality of imaging, and palm leaves are some of the challenges to be handled while building an offline handwritten recognition system for these manuscripts. This paper focuses on recognizing Malayalam characters available in palm leaves using deep learning techniques. With the help of the histogram and contour method, lines are segmented from palm leaves first. Subsequently, individual characters are extracted from the lines. A customized Convolution Neural Network (CNN) is employed to recognize these segmented characters. This trained CNN recognizes forty-eight classes of segmented characters with 86% accuracy. Additionally, this paper compares the results with other standard CNN models.
博物馆图书馆里的棕榈叶等古代手稿是丰富的知识来源。数字化有助于存储这些知识,为未来提供保护,并使其能够在全球范围内访问。在为这些手稿建立离线手写识别系统时,不同的书写风格、当前废弃和稀有字符的存在、图像质量和棕榈叶是需要处理的一些挑战。本文的重点是利用深度学习技术识别棕榈叶中可用的马拉雅拉姆语字符。首先利用直方图和轮廓法从棕榈叶中分割出线条。随后,从行中提取单个字符。使用自定义卷积神经网络(CNN)来识别这些分割的字符。经过训练的CNN以86%的准确率识别了48类分割字符。此外,本文还将结果与其他标准CNN模型进行了比较。
{"title":"Malayalam Character Recognition from Palm Leaves Using Deep-Learning","authors":"Remya Sivan, Tripty Singh, P. Pati","doi":"10.1109/OCIT56763.2022.00035","DOIUrl":"https://doi.org/10.1109/OCIT56763.2022.00035","url":null,"abstract":"Ancient manuscripts like palm leaves, available in museum libraries, are a rich source of knowledge. Digitization helps store this knowledge protected for the future & enables its global access. Varying writing styles, presence of currently discarded & rare characters, quality of imaging, and palm leaves are some of the challenges to be handled while building an offline handwritten recognition system for these manuscripts. This paper focuses on recognizing Malayalam characters available in palm leaves using deep learning techniques. With the help of the histogram and contour method, lines are segmented from palm leaves first. Subsequently, individual characters are extracted from the lines. A customized Convolution Neural Network (CNN) is employed to recognize these segmented characters. This trained CNN recognizes forty-eight classes of segmented characters with 86% accuracy. Additionally, this paper compares the results with other standard CNN models.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129038037","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
期刊
2022 OITS International Conference on Information Technology (OCIT)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1