{"title":"Solving Redundancy Allocation Problems using Jaya Algorithm","authors":"B. Aswin, Tapan Lokhande, R. Gaonkar","doi":"10.33889/ijmems.2023.8.5.046","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.046","url":null,"abstract":"Reliability-based design is related to the performance analysis of engineering systems. The redundancy allocation problem is one of the most common problems in the reliability-based design approach. The redundancy allocation problem determines the redundancy level of components in a system to maximize system reliability, subject to several constraints. In recent years, obtaining solutions to reliability-related redundancy allocation problems by means of evolving meta-heuristic algorithms has appealed to researchers due to the several drawbacks of classical mathematical methods. Meta-heuristics have shown the potential of obtaining precise solution in optimization problems and many techniques have been applied in the literature for optimal redundancy allocation. In this paper, a recently developed Jaya optimization algorithm is proposed to be applied for redundancy allocation to maximize system reliability. The Jaya algorithm is a simple, population-based intelligent meta-heuristic algorithm consisting of a single phase and an algorithm-specific parameter-less algorithm. This paper aims to present an application of the Jaya algorithm for searching the optimal solution of two redundancy allocation problems from the literature with nonlinear constraints so that system reliability is maximized. The first problem is the over speed protection system for a gas turbine, whose control system is modelled as a four-stage series system. The objective is to determine the optimal level of redundancy of the valves of the protection system under cost and weight constraints. The second one is the redundancy allocation problem of a five-stage series system with volume, weight, and cost constraints. The results are validated by comparing them with two other meta-heuristics.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45968810","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}
{"title":"An Algorithm for Constructing Support of Bent Functions by Extending a Set","authors":"Joseph Nelson, Chungath Srinivasan, K. V. Lakshmy","doi":"10.33889/ijmems.2023.8.5.060","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.060","url":null,"abstract":"Boolean functions form the fundamental components of symmetric cryptographic systems, serving as the building blocks. Modifying bent functions makes it feasible to design Boolean functions with desired properties that exhibit high non-linearity. The current study offers a comprehensive analysis of bent functions through its support, culminating in the introduction of an algorithm for the systematic construction of four variable bent functions. This algorithm enables the complete generation of all 896 four-variable bent functions. Furthermore, we introduce a methodology for constructing n-variable bent functions (where n > 4), leveraging both the algorithm and an established secondary technique for bent function construction. Lastly, we examine the estimation of the count of bent functions by utilising certain properties associated with the support of bent functions.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49283998","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}
Shagun Sharma, Kalpna Guleria, Sushil Kumar, S. Tiwari
{"title":"Deep Learning based Model for Detection of Vitiligo Skin Disease using Pre-trained Inception V3","authors":"Shagun Sharma, Kalpna Guleria, Sushil Kumar, S. Tiwari","doi":"10.33889/ijmems.2023.8.5.059","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.059","url":null,"abstract":"Skin diseases are commonly identified problems all over the world. There are various kinds of skin diseases, such as skin cancer, vulgaris, ichthyosis, and eczema. Vitiligo is one of the skin diseases that can occur in any area of the body, including the inner part of the mouth. This type of skin can have immense negative impacts on the human body, involving memory issues, hypertension, and mental health problems. Conventionally, dermatologists use biopsy, blood tests, and patch testing to identify the presence of skin diseases and provide medications to patients. However, these treatments don't always provide results due to the transformation of a macule into a patch. Various machine learning (ML) and deep learning (DL) models have been developed for the early identification of macules to avoid delays in treatments. This work has implemented a DL-based model for predicting and classifying vitiligo skin disease in healthy skin. The features from the images have been extracted using a pre-trained Inception V3 model and substituted for each classifier, namely, naive Bayes, convolutional neural network (CNN), random forest, and decision tree. The results have been determined as accuracy, recall, precision, area under the curve (AUC), and F1-score for Inception V3 with naive Bayes as 99.5%, 0.995, 0.995, 0.997, and 0.995, respectively. The Inception V3 with CNN has achieved 99.8% accuracy, 0.998 recall, 0.998 precision, 1.00 AUC, and 0.998 F1-score. Further, Inception V3 with random forest shows 99.9% accuracy, 0.999 recall, 0.999 precision, 1.00 AUC, and 0.999 F1-score values whereas, Inception V3 with decision tree classifier shows an accuracy value of 97.8%, 0.978 recall, 0.977 precision, 0.969 AUC, and 0.977 F1-score. Results exhibit that Inception V3 with a random forest classifier outperforms in terms of accuracy, recall, precision, and F1-score, whereas for the AUC metric, Inception V3 with a random forest and Inception V3 with CNN have shown the same outcomes of 1.00.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43065641","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}
Sai Ganga, Z. Uddin, R. Asthana, H. Hassan, Arpit Bhardwaj
{"title":"Modelling of Viscosity and Thermal Conductivity of Water-Based Nanofluids using Machine-Learning Techniques","authors":"Sai Ganga, Z. Uddin, R. Asthana, H. Hassan, Arpit Bhardwaj","doi":"10.33889/ijmems.2023.8.5.047","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.047","url":null,"abstract":"In this study, a variety of machine-learning algorithms are used to predict the viscosity and thermal conductivity of several water-based nanofluids. Machine learning algorithms, namely decision tree, random forest, extra tree, KNN, and polynomial regression, have been used, and their performances have been compared. The input parameters for the prediction of the thermal conductivity of nanofluids include temperature, concentration, and the thermal conductivity of nanoparticles. A three-input and a two-input model were utilized in modelling the viscosity of nanofluid. Both models considered temperature and concentration as input parameters, and additionally, the type of nanoparticle was considered for the three-input model. The order of importance of the most influential parameters in predicting both viscosity and thermal conductivity was studied. A wider range of input parameters have been considered in an open-access database. With the existing experimental data, all of the developed machine learning models exhibit reasonable agreement. Extra trees were found to provide the best results for estimating thermal conductivity, with a value of 0.9403. In predicting viscosity using a three-input model, extra trees were found to provide the best result with a value of 0.9771, and decision trees were found to provide the best results for estimating the viscosity using a two-input model with a value of 0.9678. In order to study heat transport phenomena through mathematical modelling, it is important to have an explicit mathematical expression. Therefore, the formulation of mathematical expressions for predicting viscosity and thermal conductivity has been carried out. Additionally, a comparison with the Xue and Maxwell thermal conductivity models is made to validate the results of this study, and the results are observed to be reliable.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45482496","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}
{"title":"Design and Analysis of Novel Microstrip-Based Dual-Band Compact Terahertz Antenna for Bioinformatics and Healthcare Applications","authors":"Sandeep Kumar, A. Singh, Ashutosh Mishra","doi":"10.33889/ijmems.2023.8.5.049","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.049","url":null,"abstract":"This paper presents a compact microstrip-based dual-band antenna for terahertz (THz) technology, catering to the increasing demand for high-frequency, high-gain, and wideband THz antennas. THz technology has numerous applications, including its demands in bioinformatics and healthcare. To address this need, the proposed antenna operates in two frequency bands: 3.6 THz to 4.3 THz and 5 THz to 5.7 THz, enabling its use in THz band communication. The antenna design features a microstrip patch with two transverse slots and one longitudinal slot as a radiator, fed with a microstrip line. The transverse slots enable dual-band resonance, while the longitudinal slots enhance bandwidth and efficiency. Using a 10µm thick polyamide material with a dielectric constant of 3.55, the antenna achieves a compact size of 40 × 40 µm2, lightweight construction, high radiation efficiency, and a wide impedance bandwidth. Simulation results confirm good impedance matching characteristics, with minimal voltage standing wave ratio and return loss of -10dB or less. The antenna exhibits an impedance bandwidth of -10dB at 700 GHz, a peak radiation efficiency of 85%, a peak gain of 7.86 dB, and an omnidirectional radiation pattern. These favorable attributes position the proposed antenna as an excellent choice for various THz applications, particularly in bioinformatics and healthcare applications.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46740042","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}
Trust Tawanda, E. Munapo, Santosh Kumar, Philimon Nyamugure
{"title":"Extended TANYAKUMU Labelling Method to Compute Shortest Paths in Directed Networks","authors":"Trust Tawanda, E. Munapo, Santosh Kumar, Philimon Nyamugure","doi":"10.33889/ijmems.2023.8.5.057","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.057","url":null,"abstract":"Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related problems. The current paper extends the TANYAKUMU labelling method for solving the Travelling salesman problem (TSP) to solve SPP in directed transportation networks. Numerical illustrations are used to prove the validity of the proposed method. The main contributions of this paper are as follows: (i) modification of TSP algorithm to solve single source SPP, (ii) the developed method numerically evaluated on four increasingly complex problems of sizes 11×11, 21×21, 23×23 and 26×26 and lastly (iii) the solutions obtained from solving these four problems are compared with those obtained by Minimum incoming weight label (MIWL) algorithm. The proposed algorithm computed the same shortest paths as the MIWL algorithm on all four problems.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49639726","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}
{"title":"TOPSIS based Renewable-Energy-Source-Selection using Moderator Intuitionistic Fuzzy Set","authors":"B. Joshi, Navneet Joshi, A. Gegov","doi":"10.33889/ijmems.2023.8.5.056","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.056","url":null,"abstract":"Many criteria must be taken into account while selecting the best renewable energy source (RES), which necessitates a sophisticated multi-criteria decision-making (MCDM) procedure. Conflicting norms, as well as insufficient and inaccurate information, make this endeavour challenging. The theory of moderator intuitionistic fuzzy set (MIFS), a generalization of intuitionistic fuzzy sets (IFSs) has been developed to handle these uncertainties. The MIFS also helps to get a higher degree of precision in the uncertain behaviours due to the moderator parameter. In this paper, first some distance measures are presented for MIFSs, and then, on the basis of the proposed distances, we suggest a TOPSIS technique for choosing the best RES inside MIFS architecture. The efficacy of the proposed MIFS-based TOPSIS technique is put to the test by comparing different wind generating systems in a case study. The findings of the study are then compared in order to demonstrate that the suggested method is superior to the existing ones.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44522962","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}
{"title":"Optimal Pricing and Advertisement Policy for an Advance Order Booking Inventory System with Order Cancellation under Inflationary Condition","authors":"K. K. Aggarwal, Shuja Ahmed, Fehmina Malik","doi":"10.33889/ijmems.2023.8.5.050","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.050","url":null,"abstract":"The e-commerce business has grown significantly over the past few years, mainly due to providing a better customer experience through advance booking and order cancellation options with a full refund. In this paper, the inventory control problem of a firm that offers advance booking for the product and cancellation (with a full refund) before the due delivery date is addressed. A profit maximization model is formulated to find the optimum inventory cycle length, the selling price of the product, and advertisement expenditure. The discounted cash flow approach is used to take into account cash flows at different time points. Advance booking is made at the beginning of the inventory cycle at a discounted price until the time of stock arrival, followed by usual spot sales. The number of order cancellations during the advance booking period is dependent on the waiting time for receiving the order. The impact of revenue collected through advance sales is considered by including interest earned. Product demand is assumed to be the function of advertisement expenditure and the selling price of the product. A solution procedure is suggested, and the model is illustrated through numerical analysis, thereby providing valuable managerial insights based on the results obtained.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44560131","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}
{"title":"Modeling Developable Surfaces using Quintic Bézier and Hermite Curves","authors":"K. .","doi":"10.33889/ijmems.2023.8.5.053","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.053","url":null,"abstract":"The nature of the developable surfaces has similarities to the industrial materials that are not amenable to stretching. Regarding the benefit, the developable surfaces are widely used to model plat-metal-based industry products such as automobiles, ship hulls, and ducts. For this reason, we introduce a new approach for designing developable surfaces limited by two space curves. The method consists of these steps. First, we define a generalized cone and a cylinder surface by posing restrictions: a fixed summit point of the cone has to be outside a plane; a static nonzero constant vector is unparallel to the plane; and two quintic Bézier curves are placed on the different sides of the plane. Second, computing the control points on the plane is determined by the intersection between the control lines of the cone/cylinder surface and the plane. Third, using these obtained control points, we evaluate the required boundary curves profile and the shape of the developable Bézier surfaces, that are limited by these quintic Bézier curves. Finally, we also apply this method to design the developable Hermite surfaces. As a result, this introduced method can provide the equations and procedures for modeling developable surfaces with boundary curves in space. Also, it is useable to design these surfaces in many arches and shapes. Moreover, this method is effective for modifying and adjusting the desired boundary curves profile of the surfaces.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42799039","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}
{"title":"Computational Metrology for Measuring Industrial Component Dimensions","authors":"Lokendra Singh, Arpan Gupta","doi":"10.33889/ijmems.2023.8.5.048","DOIUrl":"https://doi.org/10.33889/ijmems.2023.8.5.048","url":null,"abstract":"To target the problem of dimension measurement of objects in industry, a new computer vision method is proposed based upon Harris-corner detection. The proposed research delivers an alternative to the requirement of various precise measurement devices and skilled labour. In order to measure the various dimensions of an object, the proposed algorithm separates the corner points from the background based on variations in pixel intensity. An algorithm has been proposed to analyze captured object images and perform measurements and inspection processes. The aim of this paper is to utilize computer vision detection algorithms to control the quality of manufactured parts by sorting them on size tolerance. The length of various objects such as screws, bolts, and a rectangular iron piece was determined from the images captured using smartphone camera (Samsung Galaxy F62). The evidence for a total of eight different measurements is presented, and the accuracy of the method is proved up to 99 percent against the dimensions measured using the Vernier calliper.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44918361","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}