Search Results - (( developing new methods algorithm ) OR ( java implementation modified algorithm ))

Search alternatives:

Refine Results
  1. 1
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
    Save to List
    Saved in:
  4. 4
    Prevention And Detection Mechanism For Security In Passive Rfid System

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Automatic generation of content security policy to mitigate cross site scripting

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations

    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2018
    “…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Generalized Triad Design Algorithms

    Generalized Triad Design Algorithms by Saa, Tareq Mohammad Abu

    Published 2012
    “…Previous studies on TD(v) reported its existence when v≡1 or 5 (mod 6) and TD(7) was developed by using a brute-force method. In this study, generalized and new algorithms for developing TD(v) for any v = 6n + 1 or v = 6n + 5 were developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Semiparametric inference procedure for the accelarated failure time model with interval-censored data

    Semiparametric inference procedure for the accelarated failure time model with interval-censored data by Karimi, Mostafa

    Published 2019
    “…The main contribution of this research is developing statistical approaches, and introducing new algorithms and resampling methods for analysing interval-censored data through AFT models.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Development of a new method of crack modeling and prediction algorithm

    Development of a new method of crack modeling and prediction algorithm by Aibinu, Abiodun Musa, Shafie, Amir Akramin, Salami, Momoh Jimoh Emiyoka, Salami, Abdulazeez F., Bamgbopa, I. A., Lawal, Wahab Adetunji

    Published 2008
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  10. 10
    New Quasi-Newton Equation And Method Via Higher Order Tensor Models

    New Quasi-Newton Equation And Method Via Higher Order Tensor Models by Gholilou, Fahimeh Biglari

    Published 2010
    “…The comparison between this new method with that of the method developed by Xiao et al. (2008) shows better performance in numerical results for the new method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    SEALiP: A simple and efficient algorithm for listing permutation via starter set method

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Development of a new algorithm for segmentation of flotation froth images

    Development of a new algorithm for segmentation of flotation froth images by Jahedsaravani, Ali, Marhaban, Mohammad Hamiruce, Massinaei, Mohammad, Saripan, M. Iqbal, Mehrshad, Naser, Mohd Noor, Samsul Bahari

    Published 2014
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Development of a fingerprint gender classification algorithm using fingerprint global features

    Development of a fingerprint gender classification algorithm using fingerprint global features by Abdullah, Siti Fairuz, Abdul Rahman, Ahmad Fadzli Nizam, Abal Abas, Zuraida, Mohd Saad, Wira Hidayat

    Published 2016
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique

    New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique by Hamid, Nurul 'Atiqah

    Published 2016
    “…These 6 algorithms are divided into 3 main methods namely Method A, Method B, and Method C depending on their search patterns and strategies. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system

    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

    Published 2010
    “…These developed algorithms are tested on 14, 118 and 300 IEEE bus systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Developing triad design algorithms based on compatible factorization

    Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

    Published 2011
    “…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  19. 19
    New Algorithm for Determinant of Matrices Via Combinatorial Approach

    New Algorithm for Determinant of Matrices Via Combinatorial Approach by Zake, Lugen M.

    Published 2012
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Grid-Based Classifier as a Replacement for Multiclass Classifier in a Supervised Non-Parametric Approach

    Grid-Based Classifier as a Replacement for Multiclass Classifier in a Supervised Non-Parametric Approach by Moheb Pour, Majid Reza

    Published 2009
    “…In this thesis, a new method known as Grid Based Classifier was proposed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: