6,158 results
Search Results
2. A review paper of optimal resource allocation algorithm in cloud environment.
- Author
-
Patadiya, Namrata and Bhatt, Nirav
- Subjects
RESOURCE allocation ,LITERATURE reviews ,SERVICE level agreements ,ALGORITHMS ,ELECTRONIC data processing ,CLOUD computing - Abstract
Cloud computing has become a popular approach for processing data and running computationally expensive services on a pay-as-you-go basis. Due to the ever-increasing requirement for cloud-based apps, appropriately allocating resources according to user requests while meeting service-level agreements between customers and service providers has become increasingly complex. An efficient and versatile resource allocation method is required to properly deploy these assets and meet user needs. The technique of distributing resources has become more arduous as user demand has increased. One of the key areas of research experts is how to design optimal solutions for this approach. In this paper, a literature review on proposed dynamic resource allocation approaches is introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. The Economic Optimization of Pulp and Paper Making Processes Using Computational Intelligence.
- Author
-
Pant, Millie, Thangaraj, Radha, and Singh, V. P.
- Subjects
COMPUTATIONAL intelligence ,ALGORITHMS ,INDUSTRIAL efficiency ,PAPER industry ,MANUFACTURING processes - Abstract
In this paper we present an application of two Computational Intelligence Algorithms, namely Particle Swarm Optimization (PSO) Algorithm and Differential Evolution (DE) for finding and optimal solution to two optimization problems that occur in a paper industry. The first problem deals with the economic optimization of a hypothetical but realistic Kraft pulping process and in the second problem we have considered the optimization of Boiler load allocation problem. Both the problems form an integral part of paper making process. The simulation results show the efficiency and time effectiveness of DE and PSO. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
4. Krill herd algorithm (KHA), patter search algorithm (PSA), salp swarm algorithm (SSA) and gradient based algorithm (GBA) - Optimization methods – A critical review.
- Author
-
Nancy, Mubina and Stephen, S. Elizabeth Amudhini
- Subjects
SEARCH algorithms ,ALGORITHMS ,NONLINEAR equations ,PARTICLE swarm optimization - Abstract
This paper discusses on the applications of non-traditional method. There is different non-conventional optimization are reviewed to solve the optimization problems. In this survey, the methods we are going to review are Krill Herd Algorithm (KHA), Pattern Search Algorithm (PSA), Sal Swarm Algorithm (SSA) and Gradient Based Algorithm (GBA). These methods are approach to find the optimization methods can solve the linear and non-linear optimization problems and results the global values. These methods are broadly reviewed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Automated implementation of test scenarios by UML combinational diagrams via uniformed algorithm.
- Author
-
Gupta, Kirti and Goyal, Dr. Parul
- Subjects
UNIFIED modeling language ,COMPUTER software testing ,ALGORITHMS ,COMPUTER software development ,SYSTEMS software ,TEST systems - Abstract
The software testing process is not only important but also a complex stage SDLC (software development life cycle) process. For estimating the activities of the system in the software testing stage testers implement test scenarios as input for the system under test (SUT). For improving the superiority of the system and also finding faults implementing test-cases shows an energetic role. Our research work target towards implementation of test cases automatically by combinational Unified Modeling Language (UML) diagram so that it can display higher effectiveness in starting phase of the system development procedure of model-based testing. This research uses UML diagrams like Use Case Diagram (UCD), Activity Diagram (AD), and a combination of both generates System Testing Graph (STG). The combination of these two diagrams has been proved as the well-suited diagrams to implement test cases from the earlier combination graphs. Our technique suggested in this research paper is Uniformed Graph Traversing (UGT) Algorithm that is combined with Level Order Traversal (LOT) Algorithm to implement predictable test scenarios. In this research paper, we prove that the UGT algorithm is useful to implement test scenarios, and also these test scenarios are providing precise outcomes; each vertex existing in the test scenarios includes some situation. In this proposed approach we also disclose faults for example decision fault, fault of dependency, interaction fault, and loop fault which results in assessment effort reduction. The implemented test scenarios are directed to one requests controlling tool which can be in contradiction of the requests. It also protects time period and work and also, raises the value of implemented test scenarios, thus enhances the complete routine in a testing phase. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. Arithmetic optimizer algorithm: A comprehensive survey of its results, variants, and applications.
- Author
-
Dhawale, Pravin, Kumar, Vikram, and Bath, S. K.
- Subjects
OPTIMIZATION algorithms ,ARITHMETIC ,ENGINEERING design ,ALGORITHMS - Abstract
This paper introduce the comprehensive overview of the Arithmetic Optimizer Algorithm (AOA). Laith Abualigah et.al introduced novel meta-heuristic approached of AOA by arithmetically modelled and executed to implement the optimization developments in an extensive array of spaces. The review included the application and variants of Arithmetic Optimization Algorithm to solve complicated engineering problems. To showcase its applicability the performance of AOA is checked by the Laith Abualigah et.al on 29 benchmark functions and actual world engineering design problems. This review paper also given the idea how AOA has been evaluated by the analysis of enactment, convergence performances and the computational involvedness. This paper also review all the experimental results of AOA which are tested on the different uni-modal and multimodal benchmarks functions and also review the usefulness of AOA for solving the challenging engineering optimization problems compared with others optimization algorithms. This paper also covers all the parameters values that has been used for the comparative algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Effects of Scatter-Correction Pre-processing Methods and Spectral Derivative Algorithms on Forensic Classification of Paper.
- Author
-
Loong-Chuen Lee, Choong-Yeun Liong, Osman, Khairul, and Jemain, Abdul Aziz
- Subjects
INFRARED spectroscopy ,ALGORITHMS ,CLUSTER analysis (Statistics) ,FORENSIC sciences ,PRINCIPAL components analysis - Abstract
Infrared (IR) spectral data are always influenced by undesired random and systematic variations. As such, preprocessing of spectral data is normally required before chemometric modeling. Two most widely used pre-processing techniques, i.e. scatter-correction methods and spectral derivatives, were used to pre-process 150 IR spectral data of paper. The algorithms investigated in this preliminary study are Standard Normal Variate (SNV), Multiplicative Scatter Correction (MSC), Savitzky-Golay (SG) and Gap-Segment (GS). The visual examination of the clustering among three studied varieties of paper, i.e. IK Yellow, One Paper and Save Pack, is accomplished via Principal Component Analysis (PCA). Overall, separation of the three varieties of paper is greatly enhanced after pre-processing. The most significant improvement is obtained with pre-processing via 1st derivative using SG algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
8. Research progress of multi-objective path planning optimization algorithms.
- Author
-
Ding, Ziyan
- Subjects
OPTIMIZATION algorithms ,POTENTIAL field method (Robotics) ,MOBILE robots ,ENVIRONMENTAL mapping ,ARTIFICIAL intelligence ,ALGORITHMS - Abstract
The field of robotics research has been well developed with the combination of computers and machinery. With the advancement of artificial intelligence, mobile robots are also attracting more attention today, and path planning is a crucial foundational technology for mobile robots to complete transportation requirements and reach pertinent target areas. In an efficiency-conscious society, the single-goal planning of transmission is gradually failing to meet the needs of enterprises and factories for efficient operations, path planning that can simultaneously plan the optimal methods and reach many target points is increasingly replacing the conventional single-goal path planning. However, there are more factors to be considered in the real complex environment to face various complex road conditions, and for this reason, various single or hybrid algorithms are being optimized and solved for this kind of problem. This paper summarizes the main methods of path planning to simulate the scale of obstacles and environmental scene maps in various conditions, focusing on several basic algorithms and their hybrid algorithms for solving multi-objective path planning problems in global and local path planning, as well as their improvements and innovations on the basic algorithms. This paper's primary idea is to divide the multi-path planning process into various components and substitute each part into a suitable algorithm and model to solve it separately to accomplish the task of reaching multiple target points efficiently. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. A novel way of using DEAR algorithm for selecting suspension coil spring material.
- Author
-
Khishorre, K. R. Raaj, Samant, Manav R., Krisna, S. Kishore, Sreeharan, B. N., and Sakthivalan, N.
- Subjects
HELICAL springs ,SHOCK absorbers ,MANUFACTURING processes ,MOTOR vehicle springs & suspension ,ALGORITHMS - Abstract
The selection of material for any product plays a critical role in every manufacturing processes. Choosing a suitable material among several alternatives is a challenge. A careful investigation must be conducted into the material selection process, as any failure that occurs in the material will end up in the failure of the entire product. The quality and standard of the product are weighed more than the financial aspect of any component. In this aspect, in this paper, proper material shock absorber coil spring material is chosen using the DEAR Algorithm in a novel way. A shock absorber coil spring is considered as one of the most important components in the suspension system of any vehicle. Suitable material must be selected, otherwise it will lead to the fatigue failure of the vehicle. The best performance from the alternative material is to be found by subjecting the coil spring to fatigue without any considerations over the financial aspect. To avoid any complications, material selection is a complex process, and to that end, a systematic method called the DEAR Algorithm is used in this work. Using this Multi-Objective Optimization (MOO) technique, ASTM grade A228 is picked as the suitable material for the shock absorber coil spring without providing weightage to any specific attribute. The results are justified using reports from analysis along with analytical calculations and confirmed by the average validation method corresponding to the desired characteristics. The DEAR algorithm is applied over the analysis report once again in a novel way. The similarity of all the findings demonstrates the DEAR algorithm's superior efficiency and accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
10. Phase shifting profilometry based on Hilbert transform: An efficient phase unwrapping algorithm.
- Author
-
Meng, Xianglin, Wang, Fei, Liu, Junyan, Chen, Mingjun, and Wang, Yang
- Subjects
HILBERT transform ,SHAPE measurement ,PHASE coding ,ALGORITHMS ,COMPUTATIONAL complexity ,TIME measurements - Abstract
Digital fringe projection profilometry based on phase-shifting technology is a reliable method for complex shape measurement, and the phase is one of the most important factors affecting measurement accuracy. The calculation of the absolute phase depends on the calculation of the wrapped phase and encoding technology. In this paper, a technique of obtaining the absolute phase of multi-frequency heterodyne fringe images using the Hilbert transform is presented. Since the wrapped phase can be calculated from only one fringe image of each frequency, the method does not need phase-shifting. The absolute phase can be obtained from the wrapped phase by applying the heterodyne method. The measurement time and computational complexity are dramatically reduced, the measurement efficiency is greatly improved, and this benefit from the number of images is greatly reduced. The experimental results show that the method presented in this paper performs well in the application, and the accuracy is no different from that of the phase-shifting method while the efficiency is greatly improved. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. Web-based knowledge management system using simple additive weighting algorithm: Case study in Subang.
- Author
-
Rahayu, Slamet, Iqbal, Mohammad, and Efendi, Adhan
- Subjects
KNOWLEDGE management ,INFORMATION sharing ,EMPLOYEE training ,PROGRAMMING languages ,ALGORITHMS - Abstract
Knowledge management system (KMS) is a method that can help companies manage knowledge assets within the company. A KMS in addition to being able to manage knowledge assets is also expected to be safe from unauthorized parties, easily accessible when needed and become a place for sharing knowledge for employees in the company. In its application, the documentation of knowledge which is the result of employee training at PT X still uses paper. So, when the company wants to implement knowledge sharing, it will be hampered because it is difficult to distribute paper documents to all employees. Based on this, the authors designed a website-based KMS. The KMS design in the modeling uses UML and the implementation uses the php and MySQL programming languages with the help of the Laravel framework and the SAW algorithm. This KMS is equipped with features that make it easier for the Company to implement knowledge sharing. The results of this KMS design, produce a system that has been tested using black box testing resulting in a 100% tested success percentage and user acceptance test testing that is tested on four assessment criteria with an average user satisfaction percentage of 82% and includes good criteria. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
12. Bubble image segmentation and dynamic feature extraction in gas–liquid two-phase transient flow.
- Author
-
Jiang, Dan, Zeng, Chen, Chen, Wei, Guo, Qing, and Yan, Xin
- Subjects
TWO-phase flow ,BUBBLE dynamics ,IMAGE segmentation ,FEATURE extraction ,ALGORITHMS ,BUBBLES - Abstract
Understanding the dynamics of bubble growth and collapse during gas–liquid two-phase transient flow is crucial for minimizing pipeline wear and maintaining the normal operation of the pipeline system. This paper focuses on obtaining the bubble trajectory, movement velocity, and volume change of gas bubbles. The bubble images during the transient flow are first denoised and enhanced, then the moving target detection algorithm and watershed segmentation algorithm are used to segment the bubbles, and the contour reconstruction of the bubbles is performed using fitting to extract the relevant parameters. The movement trajectories of the bubbles are then traced by analyzing the trajectories and velocities of growth and collapse of the first bubbles during the transient flow, specifically when the flow rate of the hydraulic pipeline is 0.75 m/s. Finally, the changes in gas content during the transient flow in the pipeline under different initial flow rates are compared between the algorithm proposed here and the simulation results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. Image encryption algorithm based on optical chaos and Rubik's cube matrix conversion.
- Author
-
Zhou, Xuefang, Sun, Le, Zheng, Ning, and Chen, Weihao
- Subjects
COMPUTER security ,OPTICAL devices ,IMAGE encryption ,COMPUTER simulation ,ALGORITHMS ,CUBES - Abstract
Security issues and privacy issues are serious problems facing today's society, especially in image security, where privacy protection plays a pivotal role. To improve the security of images, we propose an image encryption algorithm based on optical chaos and Rubik's cube matrix in this paper. First, optical chaos is generated by constructing an optical device model. Second, in the image encryption algorithm, optical chaos and Rubik's cube matrix are used to encrypt the image at the bit level for the first time, and a "U" type encryption method is designed, and different "U" type encryption schemes are selected to encrypt the image for the second time. Finally, the "four-way diffusion" algorithm is used to diffuse the encrypted image, which further improves the security of the image. The computer simulations and security analysis results both confirm that ciphertext images can resist various common attack means, such as statistical attacks, differential attacks, and brute force attacks. In this paper, the proposed algorithm of decimal conversion, "U" encryption, and "quadrangle diffusion" makes the pixel value and pixel position change greatly, and the ciphertext image loses the original features of the plaintext image, which shows that the algorithm has good security performance and is suitable for image encryptions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. A modified variational approach to noisy cell signaling.
- Author
-
Cai R and Lan Y
- Subjects
- Models, Biological, Stochastic Processes, Signal Transduction, Monte Carlo Method, Algorithms
- Abstract
Signaling in cells is full of noise and, hence, described with stochastic biochemical models. Thus, an efficient computation algorithm for these fluctuating reactions is much needed. Apart from the very popular Monte Carlo simulation, methods based on probability distributions are frequently desired due to their analytical tractability and possible numerical advantages in diverse circumstances, among which the variational approach is the most notable. In this paper, new basis functions are proposed to better depict possibly complex distribution profiles, and an extra regularization scheme is supplied to the variational equation to remove occasional degeneracy-induced singularities during the evolution. The new extension is applied to four typical biochemical reaction models and restores the Gillespie results accurately but with greatly reduced simulation time. This modified variational approach is expected to work in a wide range of cell signaling networks., (© 2024 Author(s). Published under an exclusive license by AIP Publishing.)
- Published
- 2024
- Full Text
- View/download PDF
15. Ambulatory ECG noise reduction algorithm for conditional diffusion model based on multi-kernel convolutional transformer.
- Author
-
Wang H, Zhang J, Dong X, Wang T, Ma X, and Wang J
- Subjects
- Humans, Electrocardiography, Ambulatory instrumentation, Electrocardiography, Ambulatory methods, Signal-To-Noise Ratio, Signal Processing, Computer-Assisted, Algorithms, Artifacts
- Abstract
Ambulatory electrocardiogram (ECG) testing plays a crucial role in the early detection, diagnosis, treatment evaluation, and prevention of cardiovascular diseases. Clear ECG signals are essential for the subsequent analysis of these conditions. However, ECG signals obtained during exercise are susceptible to various noise interferences, including electrode motion artifact, baseline wander, and muscle artifact. These interferences can blur the characteristic ECG waveforms, potentially leading to misjudgment by physicians. To suppress noise in ECG signals more effectively, this paper proposes a novel deep learning-based noise reduction method. This method enhances the diffusion model network by introducing conditional noise, designing a multi-kernel convolutional transformer network structure based on noise prediction, and integrating the diffusion model inverse process to achieve noise reduction. Experiments were conducted on the QT database and MIT-BIH Noise Stress Test Database and compared with the algorithms in other papers to verify the effectiveness of the present method. The results indicate that the proposed method achieves optimal noise reduction performance across both statistical and distance-based evaluation metrics as well as waveform visualization, surpassing eight other state-of-the-art methods. The network proposed in this paper demonstrates stable performance in addressing electrode motion artifact, baseline wander, muscle artifact, and the mixed complex noise of these three types, and it is anticipated to be applied in future noise reduction analysis of clinical dynamic ECG signals., (© 2024 Author(s). Published under an exclusive license by AIP Publishing.)
- Published
- 2024
- Full Text
- View/download PDF
16. Colony algorithm and A* based optimized ball picking robot.
- Author
-
Yang, Taicheng
- Subjects
MOBILE robots ,OPTIMIZATION algorithms ,OBJECT recognition (Computer vision) ,ROBOT motion ,ALGORITHMS ,ROBOTS - Abstract
In order to make the auxiliary training ball picking robot pick up the ball efficiently, the path planning of the ball picking robot is needed. The traditional A-star algorithm can be applied to project the trajectory of the mobile robot under the motion model, but there are problems of general obstacle avoidance and insufficient accuracy of obstacle avoidance, based on the characteristics of iteration of the colony algorithm to improve the accuracy of the algorithm. This paper proposes an approach to make the A* algorithm iterative to improve the ability of the algorithm to perform path planning. Compared with the separate A* and colony algorithms, the algorithm in this paper is more accurate and efficient in handling complex routes. It is also paired with object recognition and grasping functions to achieve the function of identifying basketballs, grasping them and transporting them back to the players for the ball pickup robot. In the final Matlab simulation experiments, the effectiveness of target recognition, object grasping, and optimized path recognition is verified. Among them, the optimization algorithm of A* shortens the length of the path by 28% after 40 iterations. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
17. An improved approaches for novel mining serendipitous drug to generate and validate drug repositioning hypotheses from social media comparing with Adaboost algorithm.
- Author
-
Suhana, Syed Sumaya and Kumar, S. Ashok
- Subjects
DRUG repositioning ,MACHINE learning ,SUPPORT vector machines ,ALGORITHMS ,SOCIAL media - Abstract
The aim of this paper is mining serendipitous drug usage to validate and generate drug repositioning hypotheses from social media. Materials and Methods: Two machine learning algorithms svm with sample size=12 and adaboost algorithm with sample size=12. Results: The support vector machine algorithm has shown more accuracy of (96. 66%) in reducing the false positive rates when compared with Adaboost algorithm accuracy(84.6%). The pre-test was calculated with a g-power value = 80% and threshold 0. 05% confidence interval of 95% mean and standard deviation by using the G-power tool. t is found that the svm algorithm has more accuracy percentage when compared with the Adaboost algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
18. Classification of meal waste from innovative trash data using random forest by comparing support vector machine algorithm for obtaining better accuracy.
- Author
-
Sampath, G. Sai and Saravanan, M. S.
- Subjects
WASTE management ,SUPPORT vector machines ,RANDOM forest algorithms ,MACHINE learning ,IMAGE recognition (Computer vision) ,ALGORITHMS ,MEALS ,CHESTNUT - Abstract
The main objective of this paper is to improve the accuracy for automatic classification of meal waste from innovative trash data with the help of image processing. There are 2572 images for the classification of meal waste were used for this paper. The images are labeled as "Cardboard", "Plastic", "Paper", "Metal", "Glass", "Trash" and there are 20 number of images have been used for RF classifier taken as first set of machine learning algorithm and is compared with SVM algorithm taken as second set of machine learning algorithm With a g-power value of 80%, the revolutionary garbage data images, a threshold of 0.05%, a confidence interval of 95%, and a standard deviation, these photographs were gathered from various web sources. When compared to the SVM method, which had an accuracy of 61.45%, the proposed system's accuracy was enhanced to 84.81%, with a significant value of 0.001 (p 0.05) with a 95% confidence interval. This study found the meal waste from trash using the RF is significantly better than SVM algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
19. A multi-buffer congestion resolution scheme using prioritization and shortest path algorithms.
- Author
-
Abdul Ghani, Yazan, Makki, Qasem, Abdalla, Ayman, and Tamimi, Abdelfatah
- Subjects
ALGORITHMS ,QUALITY of service ,PROBLEM solving ,SIMULATION methods & models - Abstract
With the spread of the Internet and a large number of network users, the problem of congestion on the network has arisen. This paper presents a strategy to reduce network congestion using clustering algorithms, K-means, and shortest path algorithms. The paper aims to solve the problems of congestion control, access to quality of service, reduce time wasted when sending and receiving network users, take advantage of network devices, and provide quality of service without data loss. The results of the proposed system simulation showed its effectiveness and accuracy through the simulation of the system. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
20. Systematic literature review of nature inspired hybrid bat algorithms.
- Author
-
Aggarwal, Shruti
- Subjects
BAT behavior ,BAT conservation ,ALGORITHMS ,BATS ,PROBLEM solving - Abstract
One of the profound things that human being has ventured is to demystify the natural process that is happening in nature. Nature inspires technology to solve real-time problems. There are various nature-inspired techniques based on insects that are used in population-based or ecology-based nature-inspired algorithms. In this paper, the nature-inspired Bat Algorithm, which is based on the echolocation behavior of bats, is discussed in detail. The Bat Algorithm has various hybrids which are used in numerous applications; all these hybrids are reviewed and discussed in this paper. Systematic analysis is conducted using Scopus and WoS databases to analyze the research trend for these hybrid algorithms, study its variants and application domains, and predict the future for these nature-inspired algorithms. Numerous experiments based upon year-wise analysis, correlation of related terms, article growth, etc. are conducted and described in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
21. Analysis on IoT based fault identification in oil pipeline using prognostic algorithm.
- Author
-
Priyanka, E. B., Thangavel, S., Kulandairaj, Martin Sagayam, Wahab, Mohd Helmy Abd, and Fadilah, Suzi Iryanti
- Subjects
PETROLEUM pipelines ,PIPELINE transportation ,INTERNET of things ,WATER power ,HUMAN activity recognition ,ALGORITHMS - Abstract
Abnormality location frameworks conveyed for checking in oil and gas ventures are generally WSN based frameworks or SCADA frameworks which all experience the ill effects of significant impediments. WSN based frameworks are not homogenous or contradictory frameworks. They need facilitated correspondence and straightforwardness among districts and cycles. Then again, SCADA frameworks are costly, unyielding, not versatile, and furnish information with a long postponement. In this paper, a novel IoT based engineering is proposed for Oil and gas businesses to make information assortment from associated objects as straightforward, secure, hearty, solid and speedy. This paper audits and examinations recurrence and outcomes of disappointment rates for inward and outside consumption, human activity and normal powers are dissected and the normal disappointment rate for every disappointment instrument in oil pipeline transport frameworks. Verifiable information on results of the unplanned loss of regulation of inland pipelines are evaluated. To stay away from this event, designs for the most part do pressure transient investigation in the water powered plan period of pipeline network frameworks. Demonstrating and reproduction of homeless people in pipelines is an adequate and savvy technique for evaluating this issue and discovering specialized arrangements. Qualities and restrictions of different discovery and control procedures with some down to earth models are examined. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
22. Dissimilarity-based algorithms for fabric defects detection.
- Author
-
Asatryan, David, Haroutunian, Mariam, Kurkchiyan, Vardan, Melkumyan, Armen, Kupriyanov, Alexander, Paringer, Rustam, and Kirsh, Dmitriy
- Subjects
WEIBULL distribution ,ALGORITHMS ,TEXTILES ,STATISTICAL sampling - Abstract
The paper investigates images of textures with a defect, characterized by a sufficiently prominent structure. A procedure for detecting a defect in a textured image using an intellectual procedure for assessing the similarity of different parts of the tested image scanned with a sliding window is proposed. It is assumed that an area of the image that contains a defect in whole or in part will be the least similar to the other areas considered. To assess the similarity of images in the paper, the previously proposed measures are used, built on the basis of the values of the components and the magnitude of the gradient, considered as a sample from a random variable with the Weibull distribution. The effectiveness of the proposed methods is demonstrated by experimental investigation. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
23. Classification of liver dataset using data mining algorithms.
- Author
-
Mukhyber, Sondos Jameel, Abdulah, Dhahir Abdulhade, and Majeed, Amer D.
- Subjects
DATA mining ,CLASSIFICATION algorithms ,LIVER ,ALGORITHMS ,CLASSIFICATION ,ASPARTATE aminotransferase - Abstract
Data Mining is one of the greatest critical aspects of automatic disease diagnosis and disease prediction. It includes data mining algorithms and techniques to study medicinal data. Recently, liver disorders have frequently increased and liver illnesses have become one of the greatest deadly diseases in different countries. In this paper, we collected 534 instances of Iraqi liver patients from Baqubah Teaching Hospital. This collected dataset includes several elements such as Age, Total Bilirubin, Direct Bilirubin, Gender, Aspartate Aminotransferase, Total Proteins, and Albumin and Globulin ratio. This paper explores the early prediction of liver disease using various data mining algorithms. The main aim of this paper is to compute the performance of many data mining techniques and compare their performance with the performance of The Indian Liver Patient Dataset. We applied three classification algorithms and parameters like accuracy, precision, recall, and f-measure were investigated to evaluate the performance of these classifiers. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
24. Design of adaptive controller for robot arm manipulator based on ANN with optimized PID by PSO algorithm.
- Author
-
Jawad, Ali Talib, Gheni, Hassan Muwafaq, Abed, Nabeel Jabal, Ali, Noor S., and Abdullah, Ali Najim
- Subjects
MANIPULATORS (Machinery) ,PID controllers ,ROBOT motion ,ROBOTS ,DYNAMIC models ,ALGORITHMS - Abstract
In this paper, the proposed system to control the robotic by using an adaptive controller and using the artificial neural network with optimized PID by using the PSO is used to regulate the motion of a robot. The problems of reverse kinematic is solved by using a proposed method which is important to determine the robotic arm joints angle values , when traced in a different path. The D-H approach Devavit – Hartenberg can be used to solve the Forward Kinematics problem. The dynamic model was computedusing the Lagrange model, which is a mathematical model. Computing a dynamic model was a crucial step in designing a robotics control. The proposed adaptive controller, which is based on a PSO-optimized artificial neural network, is utilized to increase system response. In this paper designing a GUI by using MATLAB to compute the inverse and forward kinematics and to compute the trajectory planning. Derived the inverse kinematic and the forward kinematic by traditional methods is complicated, by applying the proposed method is an easier and fast way. The main problem in the dynamic model was the non-linearity, so by using the proposed method, this method will selects optimal parameters of the PID controller that overcome the plant non-linearity. The performance of the system show good response when using the proposed method. Rom the simulation results the overshot approaches to the zero the raising time reduced to 0.11 for the first joint1, the best settling time is 0.24 in the first joint, in joint 3 the delay time was reduced to the 0.1. Based on these findings, the suggested method outperforms other standard methods such as PID controller in terms of system performance. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
25. Semantic Super Networks: a Case Analysis of Wikipedia Papers.
- Author
-
Kostyuchenko, Evgeny, Lebedeva, Taisiya, and Goritov, Alexander
- Subjects
SEMANTIC networks (Information theory) ,ALGORITHMS ,PARSING (Computer grammar) ,GRAPHIC methods - Abstract
An algorithm for constructing super-large semantic networks has been developed in current work. Algorithm was tested using the "Cosmos" category of the Internet encyclopedia "Wikipedia" as an example. During the implementation, a parser for the syntax analysis of Wikipedia pages was developed. A graph based on list of articles and categories was formed. On the basis of the obtained graph analysis, algorithms for finding domains of high connectivity in a graph were proposed and tested. Algorithms for constructing a domain based on the number of links and the number of articles in the current subject area is considered. The shortcomings of these algorithms are shown and explained, an algorithm is developed on their joint use. The possibility of applying a combined algorithm for obtaining the final domain is shown. The problem of instability of the received domain was discovered when starting an algorithm from two neighboring vertices related to the domain. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
26. Designing a novel image encryption scheme based on an improved 2D logistic map.
- Author
-
Liu, Shuang and Ye, Xiaolin
- Subjects
- *
ALGORITHMS , *PERMUTATIONS , *IMAGE encryption , *DNA - Abstract
This paper presents an improved two-dimensional logistic map. Relative to the original logistic map, the improved chaos map has better performance, e.g., larger chaotic range, higher complexity, and boosting sequence. Based on these good performances, a novel encipherment strategy is designed according to the hybrid coding of DNA and S-box algorithm. During the design of the algorithm, the primary operations include chaotic stream generation, permutation, and diffusion. The chaotic streams are constructed from the improved two-dimensional logistic map. The diffusion stage is achieved by the spatiotemporal chaos algorithm. The security test reflects that the design algorithm can effectively defend against external attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Variational algorithm of quantum neural network based on quantum particle swarm.
- Author
-
Dong, Yumin, Xie, Jianshe, Hu, Wanbin, Liu, Cheng, and Luo, Yi
- Subjects
PARTICLE swarm optimization ,ARTIFICIAL neural networks ,QUANTUM superposition ,ALGORITHMS - Abstract
Most models of quantum neural networks are optimized based on gradient descent, and like classical neural networks, gradient descent suffers from the barren plateau phenomenon, which reduces the effectiveness of optimization. Therefore, this paper establishes a new QNN model, the optimization process adopts efficient quantum particle swarm optimization, and tentatively adds a quantum activation circuit to our QNN model. Our model will inherit the superposition property of quantum and the random search property of quantum particle swarm. Simulation experiments on some classification data show that the model proposed in this paper has higher classification performance than the gradient descent-based QNN. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Performance analysis of hardware and software based AES encryption on internet of things SoC.
- Author
-
Çetintav, Işıl and Taşkın, Deniz
- Subjects
INTERNET of things ,SYSTEMS on a chip ,COMPUTER software ,DATA security ,HARDWARE ,ALGORITHMS - Abstract
Internet of things (IoT) has become an easy target. As there are numerous devices, management is hard and security problems arise. There are various encryption algorithms to provide the security of data on an IoT device. One of the encryption algorithms that is used for IoT devices is the AES algorithm. Although the AES algorithm is not a lightweight algorithm, it can effectively be used to protect the data of IoT devices. In this paper, a Bluetooth Low Energy (BLE) module is used as an IoT device. The AES algorithm is used to encrypt the data that is generated on the BLE device. There are two options for encryption: hardware-based encryption and software-based one. The aim of the paper is to show the hardware implementation efficiency of the AES algorithm on an IoT device by comparing it with software implementation. As a result, the hardware implementation of the AES algorithm is efficient when using the proper hardware infrastructure. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
29. Boruta algorithm: An alternative feature selection method in credit scoring model.
- Author
-
Handhika, Tri, Murni, and Fahreza, Rafi Mochamad
- Subjects
MACHINE learning ,FEATURE selection ,SUPERVISED learning ,ALGORITHMS - Abstract
This paper analyzed the feature selection for reducing the number of input variables when developing a predictive model. Boruta Algorithm is using in this paper as a wrapper around a Random Forest classification algorithm. Boruta algorithm is one of the algorithms used to determine the significant variables (feature selection) in a classification model in the machine learning approach, as supervised learning. Our results show that on the German Credit Data from the UCI Machine Learning with 20 variables, feature selection using Boruta Algorithm with Python Programming obtains 4 significant features. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
30. Applying privacy & proof of ownership on software licenses & patents using non-fungible tokens on public blockchains & securing them using hashing algorithms.
- Author
-
Ashok, Prabuddh Kumar and Solanki, Arun
- Subjects
NON-fungible tokens ,PATENT licenses ,BLOCKCHAINS ,ALGORITHMS ,GOVERNMENT ownership ,COMPUTER software - Abstract
This paper presents methods for software licenses & patents issuance & validation using the peer-to-peer block chain technology and leveraging the properties of non-fungible token in order to state proof of ownership of the software licenses and patents. Further, the paper illustrates the implementation of different hashing algorithms to secure the confidential and non-public facing data associated with software licenses and patents and a mechanism to do validation of the ownership and authenticity of software licenses and patents on public block chain. By tokenization of these license and patent documents the intellectual property creators will have the capability to only reveal the data to the owners of their choice or whom they can trust to reveal the original data of these documents and can provide only ownership to the other holders of the non-fungible token. The paper will also illustrate brief comparisons between the gas requirements of different on-chain hashing algorithms and then using them while minting the non-fungible tokens for the licenses and patents. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
31. The Markovian Multiagent Monte-Carlo method as a differential evolution approach to the SCF problem for restricted and unrestricted Hartree–Fock and Kohn-Sham-DFT.
- Author
-
Dittmer, Linus Bjarne and Dreuw, Andreas
- Subjects
ALGORITHMS ,DIFFERENTIAL evolution - Abstract
In this paper we present the Markovian Multiagent Monte-Carlo Second Order Self-Consistent Field Algorithm (M3-SOSCF). This algorithm provides a highly reliable methodology for converging SCF calculations in single-reference methods using a modified differential evolution approach. Additionally, M3 is embarrassingly parallel and modular in regards to Newton–Raphson subroutines. We show that M3 is able to surpass contemporary SOSCFs in reliability, which is illustrated by a benchmark employing poor initial guesses and a second benchmark with SCF calculations which face difficulties using standard SCF algorithms. Furthermore, we analyse inherent properties of M3 and show that in addition to its robustness and efficiency, it is more user-friendly than current SOSCFs. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
32. A novel method for multiple targets localization based on normalized cross-correlation adaptive variable step-size dynamic template matching.
- Author
-
Yang, A. Weiwei, Peng, B. Jinsong, Lu, C. Xiangning, He, D. Zhenzhi, Chen, E. Tianchi, and Sheng, F. Lianchao
- Subjects
NOISE ,ROTATIONAL motion ,ANGLES ,LIGHTING ,ALGORITHMS ,LOCALIZATION (Mathematics) - Abstract
The template matching method has been widely utilized in the defect detection of wafer surfaces. However, the traditional matching approaches are limited by illumination, noise, and deformation, which cannot meet the requirements of accuracy and robustness. In this paper, a novel multiple targets localization method, named Normalized Cross-correlation Adaptive Variable Step-Size Dynamic Template (NCC-AVSSDT) matching, is proposed to improve the accuracy and efficiency of image localization, which combines the advantages of NCC and AVSSDT. The AVSSDT method is utilized to dynamically adjust the scanning step size based on the NCC matching coefficients. This approach optimizes the scanning process, accelerating convergence toward the optimal matching position. Experimental results verify the accuracy and robustness of the proposed method under different conditions, especially when dealing with rotational variations and variations in noise textures. Therefore, NCC-AVSSDT can be used to perform multiple targets localization of chip image in nearly real-time. Three experiment types were used for comprehensive evaluations, including multiple targets, noise, and rotation angles. Experimental results show that NCC-AVSSDT is much better than the sequential similarity detection algorithm and mean absolute deviation methods in terms of multiple targets (0.667 vs 0.811 s, 0.832 s) and success rate (100% vs 35%, 20%). [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Psychoacoustic ranking and selection using modified knockout tournaments.
- Author
-
Meyer-Kahlen N and Hyvärinen P
- Subjects
- Humans, Music, Computer Simulation, Auditory Perception, Acoustics, Loudness Perception, Acoustic Stimulation methods, Psychoacoustics, Algorithms
- Abstract
This paper introduces a ranking and selection approach to psychoacoustic and psychophysical experimentation, with the aim of identifying top-ranking samples in listening experiments with minimal pairwise comparisons. We draw inspiration from sports tournament designs and propose to adopt modified knockout (KO) tournaments. Two variants of modified KO tournaments are described, which adapt the tree selection sorting algorithm and the replacement selection algorithm known from computer science. To validate the proposed method, a listening experiment is conducted, where binaural renderings of seven chamber music halls are compared regarding loudness and reverberance. The rankings obtained by the modified KO tournament method are compared to those obtained from a traditional round-robin (RR) design, where all possible pairs are compared. Moreover, the paper presents simulations to illustrate the method's robustness when choosing different parameters and assuming different underlying data distributions. The study's findings demonstrate that modified KO tournaments are more efficient than full RR designs in terms of the number of comparisons required for identifying the top ranking samples. Thus, they provide a promising alternative for this task. We offer an open-source implementation so that researchers can easily integrate KO designs into their studies., (© 2024 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).)
- Published
- 2024
- Full Text
- View/download PDF
34. Suppression of negative transfer in motor imagery brain-computer interface based on mutual information and Pearson correlation coefficient.
- Author
-
Zhu F, Cai J, Zheng H, Liang Z, and Zhang Y
- Subjects
- Humans, Imagination physiology, Brain-Computer Interfaces, Algorithms
- Abstract
The focus of this paper is on the main challenges in brain-computer interface transfer learning: how to address data characteristic length and the source domain sample selection problems caused by individual differences. To overcome the negative migration that results from feature length, we propose a migration algorithm based on mutual information transfer (MIT), which selects effective features by calculating the entropy value of the probability distribution and conditional distribution, thereby reducing negative migration and improving learning efficiency. Source domain participants who differ too much from the target domain distribution can affect the overall classification performance. On the basis of MIT, we propose the Pearson correlation coefficient source domain automatic selection algorithm (PDAS algorithm). The PDAS algorithm can automatically select the appropriate source domain participants according to the target domain distribution, which reduces the negative migration of participant data among the source domain participants, improves experimental accuracy, and greatly reduces training time. The two proposed algorithms were tested offline and online on two public datasets, and the results were compared with those from existing advanced algorithms. The experimental results showed that the MIT algorithm and the MIT + PDAS algorithm had obvious advantages., (© 2024 Author(s). Published under an exclusive license by AIP Publishing.)
- Published
- 2024
- Full Text
- View/download PDF
35. Material discovery and modeling acceleration via machine learning.
- Author
-
Zuccarini, Carmine, Ramachandran, Karthikeyan, and Jayaseelan, Doni Daniel
- Subjects
MACHINE learning ,REINFORCEMENT learning ,ARTIFICIAL intelligence ,MATERIALS science ,ALGORITHMS ,DEEP learning - Abstract
This paper delves into the transformative role of Machine Learning (ML) and Artificial Intelligence (AI) in materials science, spotlighting their capability to expedite the discovery and development of newer, more efficient, and stronger compounds. It underscores the shift from traditional, resource-intensive approaches toward data-driven methodologies that leverage large datasets to predict properties, identify new materials, and optimize synthesis conditions with a satisfactory level of accuracy. Highlighting various techniques, including supervised, unsupervised, and reinforcement learning, alongside deep learning potential, the chapter presents case studies and applications ranging from predicting stress points in stochastic fields to optimizing thermal protection systems for spacecraft re-entry. It also explores the challenges and future directions, emphasizing the need for integrating experimental validations and developing tailored algorithms to overcome data and computational constraints. The narrative showcases ML and AI's promise in revolutionizing material discovery, paving the way for innovative solutions in science and engineering. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. Research on hybrid segmentation technologies for postprocessing the lung and trachea CT images.
- Author
-
Zhang, Lin and Zhao, Xing
- Subjects
COMPUTED tomography ,TRACHEA ,OPERATING rooms ,TISSUES ,ALGORITHMS ,LUNGS - Abstract
This paper introduces a systematic method for segmenting the main trachea and bronchioles in lung computed tomography scans. It begins with a stack-based three-dimensional region growth algorithm to outline the main trachea, which is then refined using morphological techniques to improve accuracy. The segmentation of bronchioles is achieved through domain labeling, lung tissue segmentation, adaptive binarization, and inner product analysis. The main trachea and bronchioles are integrated using an operating room (OR) operation and a novel splicing algorithm to form a complete tracheal tree. The method's accuracy is validated against manual labeling, showing a Dice coefficient of about 0.99, on average, in lung parenchyma segmentation and a segmentation overlap with expert results ranging from 79.89% to 93.31% in lung trachea tree segmentation. This robust methodology is thoroughly tested and validated. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Active damping for acoustic levitation in air.
- Author
-
Bos, Vincent, Wesselingh, Jasper, Verbiest, Gerard J., and Steeneken, Peter G.
- Subjects
LASER Doppler vibrometer ,SYSTEM identification ,LEVITATION ,VELOCITY ,ALGORITHMS - Abstract
Acoustic levitation is an attractive and versatile technique that offers several advantages in terms of particle size, range, reconfigurability, and ease of use with respect to alternative levitating techniques. In this paper, we study the use of active damping to improve the response time and positioning precision of an acoustic levitator operating in air. We use a laser Doppler vibrometer to measure the velocity of a levitated particle. Using this information, a control algorithm is designed and implemented to provide active damping. By system identification and modeling, we demonstrate that the active damper mechanism is well-predictable by models and can be electronically reconfigured and controlled. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Algorithm for finding the norm of the error functional of Hermite-type interpolation formulas in the Sobolev space of periodic functions.
- Author
-
Khayatov, Khurshidjon
- Subjects
SOBOLEV spaces ,FUNCTION spaces ,INTERPOLATION ,ALGORITHMS - Abstract
S.L. Sobolev [1] firstly posed the problem of finding an extremal function for an interpolation formula and calculating the norm of the error functional in the space W 2 m . In this paper, an extremal function of the interpolation formula was found in explicit form in the Sobolev space W 2 m , functions for which the generalized derivatives of order m are square integrable. In the present paper, we consider the problem of finding the norm of the error functional for interposional formulas of Hermite type in the space of S.L. Sobolev W ˜ 2 (m) (T
1 ). [ABSTRACT FROM AUTHOR]- Published
- 2023
- Full Text
- View/download PDF
39. A survey of cryptographic algorithms with deep learning.
- Author
-
Al-Zamily, Jawad Yousef Ibrahim, Ariffin, Syaiba Balqish, and Abu Naser, Samy Saleem Mahmoud
- Subjects
MACHINE learning ,DEEP learning ,UNITS of time ,ALGORITHMS - Abstract
In multimedia content, text play major role for transmission and it is crucial to protect text data while transmitting over network. This can be achieved by text encryption algorithm. However, the method relies on many resources that increase the processing unit time, memory, and battery power. There are so many different techniques should be used to protect confidential text from unauthorized access. This paper summarizes on the existing works which used different techniques for text encryption by using deep learning algorithms. Combination of these approaches helps to analyze different algorithms for different text, accelerates the processing time while maintaining accurate preservation and retrieval. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
40. Artificial intelligence based algorithm to support disable person.
- Author
-
Vijayakumar, P., Yuvaraj, T., Moorthy, C. A. Sathiya, Upadhyaya, Makarand, Dadheech, Pankaj, and Kshirsagar, Pravin R.
- Subjects
ARTIFICIAL intelligence ,ARTIFICIAL vision ,ALGORITHMS - Abstract
The paper explores how the daily lives of people with vision impairments are changed by artificial intelligence. They suffer a great deal in circumstances they are not aware of. When they go alone in town, people are worried about their safety. The overall aim of the system is to provide low-cost navigation assistance to blind people that give a sense of artificial vision by informing people of the artificial intelligence environment of objects. An ultrasound sensor is used to detect the distance between objects to the blind person to guide voice and vibration, which can be heard and felt by the blind person. The software can help identify objects in the world by using the voice command, conduct text analysis and recognize the document's text on paper. It can be an important way for blind people to communicate and encourage blind people to live independently. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. Enhancing lossless compression algorithms using combining LZW and arithmetic coding.
- Author
-
Kadhim, Doaa J., Mosleh, Mahmood F., and Abed, Faeza A.
- Subjects
- *
DATA compression , *TEXT files , *ARITHMETIC , *PROBLEM solving , *ALGORITHMS - Abstract
One ongoing issue with text data files is the cost of data transmission across networks. The problem is related to the high cost of sending data at high rates. To solve this problem, data compression must be used to reduce the size of transmitted data. The idea is to utilize smaller compressed files; it turns out that utilizing smaller compressed files is more cost-effective and quicker than using larger uncompressed files. In general, compression lowers file sizes, increasing the efficiency of storage and permitting faster internet transfers. In this paper, four text files, each varying in size (5, 25, 50, and 100 kB), are employed in this paper. Two compression algorithms are used namely Lempel-Ziv-Welch (LZW) and Arithmetic Coding (ARC). The effectiveness of LZW compression algorithms and the ARC algorithm has been examined in terms of mathematical performances using MATLAB R2022a. Also, an algorithm has been proposed by combining the LZW and ARC algorithms, demonstrating better performance as compared to each algorithm on its own. The evaluation included the metrics of Compression Ratio (CR), Compression Factor (CF), Bitrate (BR), and Saving Ratio (SR) metrics. On the other hand, at 100 kB the proposed algorithms achieve of 2.747, while 1.834, and 2.207 for both ARC and LZW in term of CR. The CF of the proposed algorithm was 0.364, outperforming both ARC (0.545) and LZW (0.453). The BR values were 2.219, 4.362, and 3.642 for the proposed algorithm, ARC, and LZW, respectively. The SR for the proposed algorithm was 63.59% which is higher than ARC at 45.47% and LZW at 54.68%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Assessing the effectiveness of polar coding with BP and BPL decoding at different Eb/No values in a BEC.
- Author
-
Hamza, Zahraa A. and Shandal, Shereen Abdalkadum
- Subjects
- *
ERROR rates , *ALGORITHMS , *DECODING algorithms , *NOISE - Abstract
Polar Codes are a new class of capacity-reaching codes that have low decoding complexity and excessive reliability. They are primarily based on the concept of channel polarization, which makes a few bits inside the codeword more reliable and a few much less reliable because the code duration increases. This examination comprehensively evaluates how effective Belief Propagation (BP) and Belief Propagation with List (BPL) Decoding algorithms are in the Binary Erasure Channel (BEC) setup. The fundamental purpose is to recognize how nicely these algorithms deal with errors and enhance the reliability of verbal exchange structures. Different code lengths and list sizes are examined to see how they affect the Block Error Rate (BLER). This paper considers 4 codes studied and carried out in the usage of MATLAB lengths: N=256, 512, 1024, and 2048, and varies the Energy per bit to Noise power (Eb/No) from 1 dB to a 3.5 dB with list sizes eight and sixteen. The experiments show how the BP and BPL algorithms perform in coping with erasure errors and ensuring reliable deciphering. The BLER figures provide an in-depth description and comparison of the BP and BPL interpreting algorithms. The analysis highlights the promising blunder-correction talents of each BP and BPL algorithm in the BEC context. As the code length increases, the capability to correct errors also improves, showing that these algorithms can scale effectively. The addition of list decoding in BPL similarly enhances blunder correction by offering multiple possible answers. These examine the effect of Eb/No stages on the performance of BP and BPL deciphering, displaying that better Eb/No stages enhance accuracy but also increase the erasure chance. This paper discusses the trade-offs between accuracy and complexity for BP and BPL deciphering, presenting insights into their performance traits and optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. A systematic review of homomorphic encryption techniques to preserve confidentiality in cloud environment.
- Author
-
Durai, Krishnakumar, Ramachandran, Ramkumar Ketti, and Mittal, Sonam
- Subjects
- *
SYSTEMS design , *CLOUD computing , *CONSUMERS , *ALGORITHMS , *PRIVACY - Abstract
With the advent of cloud computing, novel methods of system design have emerged. Cloud providers now offer computing power and storage as a service, allowing customers to outsource computations more extensively than ever before. As sensitive data migrates to the cloud, ensuring privacy and security becomes increasingly critical for users. Fully Homomorphic Encryption (FHE) presents a contemporary approach to address these concerns. As far as my knowledge extends, this appears to be the initial academic publication focused on FHE. The article employs not only to explore a systematic analysis of fully homomorphic encryption but also to assess its practical implementation feasibility with novel techniques. Various papers on FHE have been aimed at enhancing efficiency and reducing noise through innovative techniques. A novel algorithm has been introduced to enhance the security of data transfers. The final thematic modeling study of this paper ensures that all discussed articles center around cloud computing and FHE. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
44. Review on intelligent billing system.
- Author
-
Chhajed, G. J., Girniwale, Akshaya, Maid, Gauri, Gadhave, Nikita, More, Pooja, and Garg, Bindu
- Subjects
- *
OBJECT recognition (Computer vision) , *CONVOLUTIONAL neural networks , *ALGORITHMS , *AUTOMATION - Abstract
Automation in purchase process is todays need in every sector and specially for purchasing daily need products. This paper reviews the current trends in automation and precision of billing procedures. In this paper, an Intelligent Billing System that makes use of object detection algorithms are studied. The primary objective is to compare and contrast two well-known object detection algorithms:"Convolutional Neural Networks (CNN) and Cascade Region-based Convolutional Neural Networks (Cascade R-CNN)". The CNN and Cascade R-CNN are used in an object detection framework that is based on the "You Only Look Once (YOLO) model".The algorithms, advantages, limitations and their level of accuracy evaluated for the CNN and Cascade R-CNN algorithms' when combined with the YOLO model. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. Application of artificial intelligence technology in AI music creation.
- Author
-
Li, Haoyang
- Subjects
- *
ARTIFICIAL intelligence , *MUSICAL analysis , *MUSICAL intervals & scales , *MUSICAL composition , *ALGORITHMS - Abstract
Aiming at the problem of poor music source files and sound quality in the process of AI music creation, this paper proposes an automatic text generation algorithm to assist the analysis of AI music creation. Firstly, for the text generation task of independent multi-source syntactic structure diagram data, the relationship between multi-source input documents is modeled from semantic association and syntactic dependence, so as to realize the generation of final music writing text. Secondly, considering the problem of difficult to locate related work in massive music texts. Finally, the actual effect of AI music is comprehensively judged. The results show that this paper proposes a text automatic generation algorithm, which can optimize the multimodal encoder, make overall judgment on the internal data, network data, and graph structure of music text, and improve the encoding rate of information and semantics. Therefore, the text automatic generation algorithm can control the music unit, identify the characteristics of multiple modes in music creation, and improve the effect of AI music creation. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Comparison of PSO and TLBO optimizing techniques for better performance of multilevel inverters.
- Author
-
Narayana, V. Rama and Nageswararao, K.
- Subjects
- *
OPTIMIZATION algorithms , *MATHEMATICAL optimization , *NONLINEAR equations , *ALGORITHMS - Abstract
This paper presents the comparison ofselective harmonic elimination in a cascaded h-bridge multilevel (CHBMLI) inverter using PSO and TLBO optimization algorithms. The inverters are employed in a variety of applications, including high-voltage dc transmission, variable drive systems, and electrical vehicles. The inverter's output includes harmonics. PSO and TLBO algorithm is used in this paper To find out the best switching angles for a CHBMLI selective harmonic elimination. In order to get the appropriate fundamental component and get rid of low-order harmonics, this project solves nonlinear equations. These algorithms can produce the most effective triggering pulses to minimize Overall Harmonic Distortion(THD) and Selected Harmonics. If the harmonics are removed, the inverter's output will be improved. MATLAB is used to implement and compared both optimization techniques usingthe seven-level inverter. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Exploring consensus algorithms: A comprehensive examination and comparative analysis.
- Author
-
Tripathi, Arun Kumar, Jain, Apoorv, Kumar, Amit, Singh, Simran, and Shukla, Brijesh
- Subjects
- *
ALGORITHMS , *COMPARATIVE studies , *BLOCKCHAINS , *INDUSTRY 4.0 , *DATA recorders & recording , *MULTICASTING (Computer networks) - Abstract
The emergence of Industry 4.0 leads to the latest technology, and blockchain is one of them. Blockchain guarantees transparency, decentralization and protection of a transaction. It revolutionizes industries where entrust and security have vital significance. In the blockchain network, data is recorded in the form of blocks. The first block of the blockchain network is acknowledged as Genesis-Block. The rest of the blocks are added to the blockchain in chronological order so that participants entities can keep an eye on digital transactions deprived of the interference of third parties or central authorities. Transactions on the blockchain network require a set of rules and regulations. These rules are known as consensus algorithms. The consensus algorithm is a procedure employed for common agreement, validation, verification, and confirmation of transactions in a blockchain network. Examples of popular consensus algorithms are Proof-of-Work (PoW), Proof-of-Burn (PoB), Proof-of- Stake (BoS), Directed-Acyclic-Graph (DAG), Practical-Byzantine-Fault-Tolerance (PBFT), Proof-of-Elapsed-Time (PoET), etc. Initially, the paper introduces the evolution and categorization of blockchain networks. Subsequently, a brief discussion on available consensus algorithms and the inclusion process of a node in blockchain networks. Furthermore, the paper compares existing blockchain consensus algorithms based on various significant parameters such as scalability, transaction rate, tolerated power, etc. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Full wave function cloning for improving convergence of the multiconfigurational Ehrenfest method: Tests in the zero-temperature spin-boson model regime.
- Author
-
Brook, Ryan, Symonds, Christopher, and Shalashilin, Dmitrii V.
- Subjects
- *
QUANTUM theory , *TEST methods , *ALGORITHMS - Abstract
In this paper, we report a new algorithm for creating an adaptive basis set in the Multiconfigurational Ehrenfest (MCE) method, which is termed Full Cloning (FC), and test it together with the existing Multiple Cloning (MC) using the spin-boson model at zero-temperature as a benchmark. The zero-temperature spin-boson regime is a common hurdle in the development of methods that seek to model quantum dynamics. Two versions of MCE exist. We demonstrate that MC is vital for the convergence of MCE version 2 (MCEv2). The first version (MCEv1) converges much better than MCEv2, but FC improves its convergence in a few cases where it is hard to converge it with the help of a reasonably small size of the basis set. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. A novel metaheuristic for solving LSGO problems.
- Author
-
Vakhnin, Aleksei and Sopov, Evgenii
- Subjects
METAHEURISTIC algorithms ,EVOLUTIONARY algorithms ,PROBLEM solving ,GLOBAL optimization ,COEVOLUTION ,ALGORITHMS - Abstract
Evolutionary algorithms show outstanding performance when they are applied to optimization problems with a few variables, i.e. problems with less than a hundred continuous variables. Large-scale global optimization with continuous variables is still a challenging task for a wide range of evolutionary algorithms. Their performance decreases when the number of variables increases because the search space grows exponentially. Classic evolutionary algorithms cannot find a good solution using the allocated resources. A cooperative coevolution approach is a good tool for increasing the performance of an optimizer in solving high-dimensional problems. The approach splits the objective vector into a predefined number of parts (subcomponents), and each part is optimized by its optimizer. This paper makes an effort to solve the problem of selecting the number of subcomponents. The paper represents a novel metaheuristic for solving optimization problems with a huge number of continuous variables. The suggested approach is based on the self-adaptive cooperation of algorithms and the cooperative coevolution approach. Each algorithm has a unique number of subcomponents. The metaheuristic automatically allocates resources between algorithms during the optimization process. Algorithms optimize the same population one by one. The proposed metaheuristic is titled COSACC, coordination of self-adaptive cooperative coevolution algorithms. We have evaluated the proposed algorithm on fifteen problems from the IEEE LSGO CEC'2013 benchmark. The study demonstrates that COSACC outperforms in average cooperative coevolution algorithms with the static number of subcomponents. Wilcoxon test has proven the results of numerical experiments. We have tested COSACC performance with other state-of-the-art metaheuristics, COSACC is a competitive approach. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
50. Improved MAC protocol by back-off algorithm implementation using fuzzy logics and game theory.
- Author
-
Bhardwaja, Shambhu, Vishnoib, Navneet, and Sengarc, Alok Singh
- Subjects
FUZZY logic ,GAME theory ,ADAPTIVE fuzzy control ,CARRIER sense multiple access ,ALGORITHMS ,DATA transmission systems ,FUZZY sets ,UTILITY functions - Abstract
In a wireless network like ad-hoc, IEEE 802.11 Distributed Coordinated Function (DCF) is used for computation of idle channel that is predominantly built on Carrier Sensing Manifold Access Mechanism through Collision Avoidance (CSMA-CA) approach. While transmission of data among multiple stations at the same time, contention occurs and resolving the issue of contention Back-off (BO) algorithm is used and assigned on a contention window (CW).However, the current approaches for addressing the contention issue do not decrement the issue explicitly which gave rise to numerous issues and this paper provides an optimal solution to these issues. This paper proposes a Fuzzy and game theory-based on back off algorithm to multi-traffic classes, the proposed algorithm is compared with the efficient adaptive MAC protocol that is based on attributes which include but not limited to packet delivery ration, residual energy, packet drop along with throughput to upsurge the utility function, saturation throughput. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.