Search Results - (( developing one method algorithm ) OR ( java application during algorithm ))

Search alternatives:

Refine Results
  1. 1
    Talkout : Protecting mental health application with a lightweight message encryption

    Talkout : Protecting mental health application with a lightweight message encryption by Gavin Teo Juen

    Published 2022
    “…The project objectives includes:(i) To investigate lightweight message encryption algorithms by benchmarking their efficiency in terms of computation speed and generated cipher text size; (ii) To design and develop the TalkOut mobile application with lightweight message encryption by using prototype software development model.; and (iii) To evaluate the usability performance of the developed proposed TalkOut mobile application using System Usability Scale (SUS) approach. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  2. 2
    A malware analysis and detection system for mobile devices / Ali Feizollah

    A malware analysis and detection system for mobile devices / Ali Feizollah by Ali, Feizollah

    Published 2017
    “…We used a Drebin data sample, which is a collection of 5,560 applications, as well as clean data sample containing 1,846 applications. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Design & Development of a Robotic System Using LEGO Mindstorm

    Design & Development of a Robotic System Using LEGO Mindstorm by Abd Manap, Nurulfajar, Md Salim, Sani Irwan, Haron, Nor Zaidi

    Published 2006
    “…Since the model is built using LEGO bricks, the model is fully customized, in term of its applications, to perform any relevant tasks. Ultimately, the algorithm development program designed earlier is linked up directly to the robotic model for program implementation and verification. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    SUDOKU HELPER

    SUDOKU HELPER by Abdul Razak, Muhammad Asyraf

    Published 2015
    “…In this paper research, author presents an algorithm to provide a tutorial for any Sudoku player who got stuck during the solving process. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    Object-Oriented Programming semantics representation utilizing agents

    Object-Oriented Programming semantics representation utilizing agents by Mohd Aris, Teh Noranis

    Published 2011
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Multi-floor indoor location estimation system based on wireless local area network

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    An approach to improve detecting and removing cross- site scripting vulnerabilities in web applications

    An approach to improve detecting and removing cross- site scripting vulnerabilities in web applications by Hydara, Isatou

    Published 2015
    “…This research work was limited to Java based web applications. In future research, the method can be extended to include other programming languages as well as other similar web application security vulnerabilities.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Overview of metaheuristic: classification of population and trajectory

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…An algorithm that applies a metaheuristic method is used when there are no specific methods to find a solution. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Before incorporating the optimization methods, a sizing algorithm for large-scale GCPV systems was developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: