• Title/Summary/Keyword: computer algorithms

Search Result 3,790, Processing Time 0.035 seconds

A Survey about Consensus Algorithms Used in Blockchain

  • Nguyen, Giang-Truong;Kim, Kyungbaek
    • Journal of Information Processing Systems
    • /
    • v.14 no.1
    • /
    • pp.101-128
    • /
    • 2018
  • Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

Academic Registration Text Classification Using Machine Learning

  • Alhawas, Mohammed S;Almurayziq, Tariq S
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.93-96
    • /
    • 2022
  • Natural language processing (NLP) is utilized to understand a natural text. Text analysis systems use natural language algorithms to find the meaning of large amounts of text. Text classification represents a basic task of NLP with a wide range of applications such as topic labeling, sentiment analysis, spam detection, and intent detection. The algorithm can transform user's unstructured thoughts into more structured data. In this work, a text classifier has been developed that uses academic admission and registration texts as input, analyzes its content, and then automatically assigns relevant tags such as admission, graduate school, and registration. In this work, the well-known algorithms support vector machine SVM and K-nearest neighbor (kNN) algorithms are used to develop the above-mentioned classifier. The obtained results showed that the SVM classifier outperformed the kNN classifier with an overall accuracy of 98.9%. in addition, the mean absolute error of SVM was 0.0064 while it was 0.0098 for kNN classifier. Based on the obtained results, the SVM is used to implement the academic text classification in this work.

A Hybrid Learning Model to Detect Morphed Images

  • Kumari, Noble;Mohapatra, AK
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.364-373
    • /
    • 2022
  • Image morphing methods make seamless transition changes in the image and mask the meaningful information attached to it. This can be detected by traditional machine learning algorithms and new emerging deep learning algorithms. In this research work, scope of different Hybrid learning approaches having combination of Deep learning and Machine learning are being analyzed with the public dataset CASIA V1.0, CASIA V2.0 and DVMM to find the most efficient algorithm. The simulated results with CNN (Convolution Neural Network), Hybrid approach of CNN along with SVM (Support Vector Machine) and Hybrid approach of CNN along with Random Forest algorithm produced 96.92 %, 95.98 and 99.18 % accuracy respectively with the CASIA V2.0 dataset having 9555 images. The accuracy pattern of applied algorithms changes with CASIA V1.0 data and DVMM data having 1721 and 1845 set of images presenting minimal accuracy with Hybrid approach of CNN and Random Forest algorithm. It is confirmed that the choice of best algorithm to find image forgery depends on input data type. This paper presents the combination of best suited algorithm to detect image morphing with different input datasets.

Enhancement OLSR Routing Protocol using Particle Swarm Optimization (PSO) and Genrtic Algorithm (GA) in MANETS

  • Addanki, Udaya Kumar;Kumar, B. Hemantha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.131-138
    • /
    • 2022
  • A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

Classification for Imbalanced Breast Cancer Dataset Using Resampling Methods

  • Hana Babiker, Nassar
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.89-95
    • /
    • 2023
  • Analyzing breast cancer patient files is becoming an exciting area of medical information analysis, especially with the increasing number of patient files. In this paper, breast cancer data is collected from Khartoum state hospital, and the dataset is classified into recurrence and no recurrence. The data is imbalanced, meaning that one of the two classes have more sample than the other. Many pre-processing techniques are applied to classify this imbalanced data, resampling, attribute selection, and handling missing values, and then different classifiers models are built. In the first experiment, five classifiers (ANN, REP TREE, SVM, and J48) are used, and in the second experiment, meta-learning algorithms (Bagging, Boosting, and Random subspace). Finally, the ensemble model is used. The best result was obtained from the ensemble model (Boosting with J48) with the highest accuracy 95.2797% among all the algorithms, followed by Bagging with J48(90.559%) and random subspace with J48(84.2657%). The breast cancer imbalanced dataset was classified into recurrence, and no recurrence with different classified algorithms and the best result was obtained from the ensemble model.

Performance analysis and comparison of various machine learning algorithms for early stroke prediction

  • Vinay Padimi;Venkata Sravan Telu;Devarani Devi Ningombam
    • ETRI Journal
    • /
    • v.45 no.6
    • /
    • pp.1007-1021
    • /
    • 2023
  • Stroke is the leading cause of permanent disability in adults, and it can cause permanent brain damage. According to the World Health Organization, 795 000 Americans experience a new or recurrent stroke each year. Early detection of medical disorders, for example, strokes, can minimize the disabling effects. Thus, in this paper, we consider various risk factors that contribute to the occurrence of stoke and machine learning algorithms, for example, the decision tree, random forest, and naive Bayes algorithms, on patient characteristics survey data to achieve high prediction accuracy. We also consider the semisupervised self-training technique to predict the risk of stroke. We then consider the near-miss undersampling technique, which can select only instances in larger classes with the smaller class instances. Experimental results demonstrate that the proposed method obtains an accuracy of approximately 98.83% at low cost, which is significantly higher and more reliable compared with the compared techniques.

A VISION SYSTEM IN ROBOTIC WELDING

  • Absi Alfaro, S. C.
    • Proceedings of the KWS Conference
    • /
    • 2002.10a
    • /
    • pp.314-319
    • /
    • 2002
  • The Automation and Control Group at the University of Brasilia is developing an automatic welding station based on an industrial robot and a controllable welding machine. Several techniques were applied in order to improve the quality of the welding joints. This paper deals with the implementation of a laser-based computer vision system to guide the robotic manipulator during the welding process. Currently the robot is taught to follow a prescribed trajectory which is recorded a repeated over and over relying on the repeatability specification from the robot manufacturer. The objective of the computer vision system is monitoring the actual trajectory followed by the welding torch and to evaluate deviations from the desired trajectory. The position errors then being transfer to a control algorithm in order to actuate the robotic manipulator and cancel the trajectory errors. The computer vision systems consists of a CCD camera attached to the welding torch, a laser emitting diode circuit, a PC computer-based frame grabber card, and a computer vision algorithm. The laser circuit establishes a sharp luminous reference line which images are captured through the video camera. The raw image data is then digitized and stored in the frame grabber card for further processing using specifically written algorithms. These image-processing algorithms give the actual welding path, the relative position between the pieces and the required corrections. Two case studies are considered: the first is the joining of two flat metal pieces; and the second is concerned with joining a cylindrical-shape piece to a flat surface. An implementation of this computer vision system using parallel computer processing is being studied.

  • PDF

Efficient Load Balancing Algorithms for a Resilient Packet Ring

  • Cho, Kwang-Soo;Joo, Un-Gi;Lee, Heyung-Sub;Kim, Bong-Tae;Lee, Won-Don
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.110-113
    • /
    • 2005
  • The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

  • PDF

A study on Variable Step Size algorithms for Convergence Speed Improvement of Frequency-Domain Adaptive Filter (주파수영역 적응필터의 수렴속도 향상을 위한 가변스텝사이즈 알고리즘에 관한 연구)

  • 정희준;오신범;이채욱
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.191-194
    • /
    • 2000
  • Frequency domain adaptive filter is effective to communication fields of many computational requirements. In this paper we propose a new variable step size algorithms which improves the convergence speed and reduces computational complexity for frequency domain adaptive filter. we compared MSE of the proposed algorithms with one of normalized FLMS using computer simulation of adaptive noise canceler based on synthesis speech.

  • PDF

Handwritten Digit Recognition with Softcomputing Techniques

  • Cho, Sung-Bae
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.707-712
    • /
    • 1998
  • This paper presents several softcomputing techniques such as neural networks, fuzzy logic and genetic algorithms : Neural networks as brain metaphor provide fundamental structure, fuzzy logic gives a possibility to utilize top-down knowledge from designer, and genetic algorithms as evolution metaphor determine several system parameters with the process of bottom up development. With these techniques, we develop a pattern recognizer which consists of multiple neural networks aggregated by fuzzy integral in which genetic algorithms determine the fuzzy density values. The experimental results with the problem of recognizing totally unconstrained handwritten numeral show that the performance of the proposed method is superior to that of conventional methods.

  • PDF