Search Results - (( java simulation optimization algorithm ) OR ( using compressive case algorithm ))

Refine Results
  1. 1
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    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. …”
    Review
  5. 5

    Second compression for pixelated images under edge-based compression algorithms: JPEG-LS as an example by Al-Khayyat, Kamal, Alshaikhli, Imad Fakhri Taha, Al-Hagery, Mohammed

    Published 2021
    “…This paper details the examination of a particular case of data compression, where the compression algorithm removes the redundancy from data, which occurs when edge-based compression algorithms compress (previously com- pressed) pixelated images. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9
  10. 10

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Machine learning technique for the prediction of blended concrete compressive strength by Jubori, Dawood S. A., Abu B., Nabilah, Safiee, Nor A., Alias, Aidi H., Nasir, Noor A. M.

    Published 2024
    “…The best predictions were achieved using one hidden layer with 14 and 15 neurons for LM and BR algorithms respectively. …”
    Get full text
    Get full text
    Article
  12. 12

    A comparative review on symmetric and asymmetric dna-based cryptography by Hammad B.T., Sagheer A.M., Ahmed I.T., Jamil N.

    Published 2023
    “…Asymmetric cryptography was considered in the second case by incorporating the DNA codes in RSA algorithm. …”
    Article
  13. 13

    Wavelet-based compression of medical images: Filter-bank selection and evaluation by Saffor, A., Bin Ramli, A.R., Ng, K.H.

    Published 2003
    “…Wavelet-based image coding algorithms (lossy and lossless) use a fixed perfect reconstruction filter-bank built into the algorithm for coding and decoding of images. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Performance evaluation for compression-accuracy trade-off using compressive sensing for EEG-based epileptic seizure detection in wireless tele-monitoring by Abualsaud, Khalid, Mahmuddin, Massudi, Hussein, Ramy, Mohamed, Amr

    Published 2013
    “…Discrete cosine transform (DCT) and compressive sensing are used for EEG signals acquisition and compression.To obtain low-complexity energy-efficient, the best data accuracy with higher compression ratio is sought. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17
  18. 18

    Development Of A Robust Blind Digital Video Watermarking Algorithm Using Discrete Wavelet Transform by Al-Deen, Ahmed A. Baha'a

    Published 2007
    “…On the other hand, a random key is used to choose the frames to be watermarked to increase the security level of the algorithm and discourage piracy. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Image authentication using Zernike moment watermarking by Shojanazeri, Hamid

    Published 2013
    “…Experimental results showed that this algorithm achieves better bit error rate against JPEG compression, rotation, scale and noise attacks in comparison with other reviewed schemes in this work. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Computational Analysis of Gas Kinetic Bhatnagar-Grosskrook Scheme for Inviscid Compressible Flow by Ong, Jiunn Chit

    Published 2004
    “…In addition, an implicit time integration method known as the Approximate Factorization-Alternating Direction Implicit (AF-ADI) would be employed when dealing with two-dimensional flow problems in higher-order.In order to investigate the computational characteristics of the BGK scheme in detail, several cases of shock-shock interaction problem have been numerically analyzed.Developed code for the onedimensional flow is validated with three typical test cases, namely,quasi-onedimensional supersonic-subsonic nozzle flow, shock tube, and two interacting blast waves.Likewise,four typical two-dimensional test cases that are found in the literatures are used to validate the developed code for the two-dimensional flow.They are regular shock reflection,supersonic flow over a wedge, channel with a fifteen-degree ramp, and flow past a cylinder.From these validation cases, computed results are compared with the available exact solutions and with other computational results obtained by using some well known numerical discretization schemes.In comparison,the BGK scheme exhibits the most accurate shock resolution capabilities,least diffusiveness, least oscillatory,and great robustness.…”
    Get full text
    Get full text
    Thesis