-
1101
New modification of the hestenes-stiefel with strong wolfe line search
Published 2021“…Besides, the conjugate gradient method with the proposed conjugate gradient also guarantees low computation of iteration and CPU time by comparing with other classical conjugate gradient parameters. …”
Get full text
Conference or Workshop Item -
1102
Flowfield-dependent variant method for moving-boundary problems
Published 2014“…The formulation itself yields a sparse matrix, which can be solved by using any iterative algorithm. Several benchmark problems in two-dimensional inviscid and viscous flow have been selected to validate the method. …”
Get full text
Article -
1103
ACOustic: A nature-inspired exploration indicator for ant colony optimization
Published 2015“…A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens’ acoustics of their ant hosts.The parasites’ reaction results from their ability to indicate the state of penetration.The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance’s matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied.The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms.Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation.The analytical results showed that the proposed indicator is more informative and more robust.…”
Get full text
Article -
1104
Strategic oscillation for exploitation and exploration of ACS algorithm for job scheduling in static grid computing
Published 2015“…However, the rate remains unchanged during the algorithm iterations, which makes the algorithm either bias toward exploitation or exploration.Hence, this study proposes a strategic oscillation rate to control the exploitation and exploration in ant colony system.The proposed algorithm was evaluated with job scheduling problem benchmarks on grid computing.Experimental results show that the proposed algorithm outperforms other metaheuristics algorithms in terms of makespan and flowtime. …”
Get full text
Conference or Workshop Item -
1105
Feature engineering for energy systems
Published 2020“…To ensure that the experiment is as unbiased and functional as possible, we apply several measures such as repeated iterations for up to 25 times, 5-fold cross-validation techniques, and Matthews Correlation Coefficient. …”
Get full text
Final Year Project (FYP) -
1106
Mobile application for price sharing and comparison
Published 2020“…WeSave started in August 2016 and its fourth development iteration has been completed by the final year project student in March 2020. …”
Get full text
Final Year Project (FYP) -
1107
Facebook image enhancer
Published 2013“…Before the start of the implementation, researches on related projects had been carried out. Incremental and Iterative development model is adopted as the software development model for the application. …”
Get full text
Final Year Project (FYP) -
1108
Investigations of surface potentials
Published 2015“…In order to probe this possibility, the theoretical foundations of Density Functional Theory are studied, and the need for numerical calculations is understood. Iterative methods to solve numerical calculations are presented. …”
Get full text
Final Year Project (FYP) -
1109
Machine learning on FPGA CAD
Published 2015“…A classifier was built and refined iteratively from CAD run records; and it was used to predict whether a new set of parameters would produce a good design. …”
Get full text
Final Year Project (FYP) -
1110
Self-paced regularization in label distribution learning
Published 2019“…However, the process of training is time-consuming as it requires repetitively iterating over a huge training set. To combat this problem, we propose a combinatory method of self-paced regularization with deep learning, where the deep learning model is presented with training data with progressive levels of size, and by extension, difficulty. …”
Get full text
Final Year Project (FYP) -
1111
Registration using Gaussian mixture map for localization
Published 2019“…This GMM approach is compared to traditional Iterative Closest Point (ICP) approach in terms of point-to-point distance accuracy and computation time. …”
Get full text
Thesis -
1112
Development of interactive storybook / Maslizawati Mohamad Masnan
Published 2005“…It is suitable because ADDIE model is an iterative instructional design process, where the resuhs of the formative evaluation of each phase may lead the instructional designer back to any previous phase. …”
Student Project -
1113
A New Approach of Optimal Search Solution in Particle Swarm Optimization (PSO) Algorithm for Object Detection Method
Published 2018“…Finally, performance analysis will be undertaken to justify the strength of the proposed method over conventional algorithm can reduce more than 60% of the required number of particles and iteration.…”
Get full text
Article -
1114
Comparative analysis of the model-free tuning techniques for integral state feedback controller of a liquid slosh suppression system
Published 2022“…Data-driven Pole Placement (DPP) and Fictitious-Reference-Iterative-Tuning with Particle Swarm Optimization (FRIT-PSO) are the two algorithms proposed as the tuning methods for the selected controller structure. …”
Get full text
Conference or Workshop Item -
1115
Agents for Fuzzy Indices of Reliability Power System with Uncertainty Using Monte Carlo Algorithm
Published 2014“…The standard deviation of load level uncertainty in power system reliability assessment has a different value for each load level leading to complexity iterations required in the convergence of Monte Carlo algorithm. …”
Get full text
Conference or Workshop Item -
1116
Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
Published 2011“…The experimental results show that the number of iteration is reduced to 50% and the run time is lower and constantly based on maximum distance of data points, regardless of how many data points.…”
Get full text
Article -
1117
An Extension of DNA Splicing Systems
Published 2011“…This model consists of a finite alphabet, a finite set of initial strings over the alphabet, and a finite set of rules that act upon the strings by iterated cutting and pasting, generating new strings. …”
Get full text
Conference or Workshop Item -
1118
Dual-Criteria Method For Determining Critical Plane Orientation For Multiaxial Fatigue Prediction Using A Genetic Algorithm
Published 2015“…The results show that the proposed model reduces the number of iterations by 90% with greater accuracy than the conventional methods and multiple candidate planes can easily be identified. …”
Get full text
Article -
1119
Reinforcement learning based predictive maintenance for a machine with multiple deteriorating yield levels
Published 2015“…The optimal maintenance policy associated with each possible observed system state is learnt by modeling the problem as hidden semi-Markov decision processes and solving it using policy iteration based Q-P learning. Then the future maintenance time can be estimated by re-simulating the system model using the learned maintenance policy. …”
Get full text
Get full text
Get full text
Journal Article -
1120
New developments in transport of intensity equation for phase retrieval and computational imaging
Published 2014“…Compared to many other phase retrieval algorithms, TIE is non-iterative, purely computational and no complicated auxiliary device needs to be introduced. …”
Get full text
Get full text
Conference Paper