ORCID Profile
0000-0002-6923-7079
Current Organisations
UNSW Sydney
,
UNSW
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Elsevier BV
Date: 02-2021
Publisher: Springer International Publishing
Date: 14-11-2022
Publisher: Springer International Publishing
Date: 2016
Publisher: IEEE
Date: 10-2008
Publisher: IEEE
Date: 12-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 2003
Publisher: IEEE
Date: 09-2017
Publisher: IEEE
Date: 06-2012
Publisher: IEEE
Date: 2002
Publisher: Elsevier BV
Date: 06-2023
Publisher: Springer Science and Business Media LLC
Date: 2008
Publisher: Elsevier BV
Date: 02-2013
Publisher: Elsevier BV
Date: 12-2018
Publisher: Elsevier BV
Date: 06-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Elsevier BV
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Elsevier BV
Date: 06-2020
Publisher: IEEE
Date: 2002
Publisher: IEEE
Date: 06-2013
Publisher: Springer Science and Business Media LLC
Date: 25-08-2011
Abstract: Many Bioinformatics studies begin with a multiple sequence alignment as the foundation for their research. This is because multiple sequence alignment can be a useful technique for studying molecular evolution and analyzing sequence structure relationships. In this paper, we have proposed a Vertical Decomposition with Genetic Algorithm (VDGA) for Multiple Sequence Alignment (MSA). In VDGA, we ide the sequences vertically into two or more subsequences, and then solve them in idually using a guide tree approach. Finally, we combine all the subsequences to generate a new multiple sequence alignment. This technique is applied on the solutions of the initial generation and of each child generation within VDGA. We have used two mechanisms to generate an initial population in this research: the first mechanism is to generate guide trees with randomly selected sequences and the second is shuffling the sequences inside such trees. Two different genetic operators have been implemented with VDGA. To test the performance of our algorithm, we have compared it with existing well-known methods, namely PRRP, CLUSTALX, DIALIGN, HMMT, SB_PIMA, ML_PIMA, MULTALIGN, and PILEUP8, and also other methods, based on Genetic Algorithms (GA), such as SAGA, MSA-GA and RBT-GA, by solving a number of benchmark datasets from BAliBase 2.0. The experimental results showed that the VDGA with three vertical isions was the most successful variant for most of the test cases in comparison to other isions considered with VDGA. The experimental results also confirmed that VDGA outperformed the other methods considered in this research.
Publisher: Springer Science and Business Media LLC
Date: 12-12-2009
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: IEEE
Date: 06-2013
Publisher: Penerbit UTM Press
Date: 21-06-2016
DOI: 10.11113/JT.V78.9162
Abstract: Supply chains face risks from various unexpected events that make disruptions almost inevitable. This paper presents a disruption recovery model for a single stage production and inventory system, where finished product supply is randomly disrupted for periods of random duration. A production facility that manufactures a single product following the Economic Production Quantity policy is considered. The model is solved using a search algorithm combined with a penalty function method to find the best recovery plan. It is shown that the optimal recovery schedule is dependent on the extent of the disruption, as well as the back order cost and lost sales cost parameters. The proposed model is seen to be a very useful tool for manufacturers to make quick decisions on the optimal recovery plan after the occurrence of a disruption.
Publisher: Springer Science and Business Media LLC
Date: 02-02-2018
Publisher: Elsevier BV
Date: 02-2017
Publisher: IEEE
Date: 06-2012
Publisher: Elsevier BV
Date: 12-2020
Publisher: Elsevier BV
Date: 10-2015
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 2002
Publisher: Informa UK Limited
Date: 15-08-2011
Publisher: Elsevier BV
Date: 2015
Publisher: IEEE
Date: 07-2014
Publisher: Springer International Publishing
Date: 22-11-2017
Publisher: IEEE
Date: 10-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 06-2011
Publisher: IEEE
Date: 06-2011
Publisher: Elsevier BV
Date: 08-2021
Publisher: Elsevier BV
Date: 03-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2013
Publisher: Elsevier BV
Date: 10-2017
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 12-2018
Publisher: Springer Science and Business Media LLC
Date: 02-11-2021
Publisher: Elsevier BV
Date: 08-2014
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 10-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-12-2022
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: IEEE
Date: 02-2011
Publisher: Elsevier BV
Date: 07-2019
Publisher: Springer Science and Business Media LLC
Date: 06-2014
Publisher: Elsevier BV
Date: 02-2014
Publisher: Elsevier BV
Date: 06-2017
Publisher: Elsevier BV
Date: 11-2020
Publisher: IEEE
Date: 11-2011
Publisher: Informa UK Limited
Date: 05-2009
Publisher: Elsevier BV
Date: 10-2019
Publisher: IEEE
Date: 11-2011
Publisher: Elsevier BV
Date: 12-2017
Publisher: Springer International Publishing
Date: 27-12-2017
Publisher: Elsevier BV
Date: 06-2015
Publisher: Elsevier BV
Date: 08-2020
Publisher: Elsevier BV
Date: 12-2015
Publisher: IGI Global
Date: 2005
DOI: 10.4018/978-1-59140-640-2.CH001
Abstract: With the increase in the complexity of terrorism’s networks and activities, the advances in chemical and biological warfare, and the use of organized criminal activities, it is becoming apparent that dealing with this complexity is not possible with traditional problem-solving approaches. The artificial complexity area (Artificial Life, or ALife), complex systems and agent-based distillation (ABD) provide a new perspective to the problem and emphasize the importance of modeling the interaction between system components to tackle these issues. This chapter presents an introduction to Cellular Automota and ABD, and then reviews and critiques how these approaches specifically have been used to model aspects of bushfires, epidemics, biological warfare and terrorism. This chapter then extends upon previous works to present an overview of the possible use of artificial complexity models to the larger field of security and safety applications.
Publisher: IEEE
Date: 07-2018
Publisher: Association for Computing Machinery (ACM)
Date: 16-08-2019
DOI: 10.1145/3329709
Abstract: Sentiment analysis is an important sub-task of Natural Language Processing that aims to determine the polarity of a review. Most of the work done on sentiment analysis is for the resource-rich languages of the world, but very limited work has been done on resource-poor languages. In this work, we focus on developing a Sentiment Analysis System for Roman Urdu, which is a resource-poor language. To this end, a dataset of 11,000 reviews has been gathered from six different domains. Comprehensive annotation guidelines were defined and the dataset was annotated using the multi-annotator methodology. Using the annotated dataset, state-of-the-art algorithms were used to build a sentiment analysis system. To improve the results of these algorithms, four different studies were carried out based on: word-level features, character level features, and feature union. The best results showed that we could reduce the error rate by 12% from the baseline (80.07%). Also, to see if the improvements are statistically significant, we applied t-test and Confidence Interval on the obtained results and found that the best results of each study are statistically significant from the baseline.
Publisher: IEEE
Date: 07-2014
Publisher: Elsevier BV
Date: 12-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2016
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: IEEE
Date: 11-2013
Publisher: Springer International Publishing
Date: 2016
Publisher: IEEE
Date: 12-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2022
Publisher: Springer International Publishing
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2012
Publisher: Elsevier BV
Date: 03-2021
Publisher: Springer Science and Business Media LLC
Date: 07-05-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2011
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 12-2015
Publisher: Elsevier BV
Date: 2014
Publisher: Elsevier BV
Date: 12-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2022
Publisher: Elsevier BV
Date: 2021
Publisher: IEEE
Date: 07-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
Publisher: IGI Global
Date: 2005
Publisher: IEEE
Date: 06-2011
Publisher: IEEE
Date: 06-2011
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Cambridge University Press (CUP)
Date: 06-06-2017
DOI: 10.1017/S0890060416000196
Abstract: The aim of this work is to bridge the gap between the theory and actual practice of production scheduling by studying a problem from a real-life production environment. This paper considers a practical Sanitaryware production system as a number of make-to-order permutation flowshop problems. Due to the wide range of variation in its products, real-time arrival of customer orders, dynamic batch adjustments, and time for machine setup, Sanitaryware production system is complex and also time sensitive. In practice, many such companies run with suboptimal solutions. To tackle this problem, in this paper, a memetic algorithm based real-time approach has been proposed. Numerical experiments based on real data are also been presented in this paper.
Publisher: Springer Science and Business Media LLC
Date: 21-05-2018
Publisher: World Scientific Pub Co Pte Lt
Date: 12-2015
DOI: 10.1142/S146902681550025X
Abstract: Many infrastructures, such as those of finance and banking, transportation, military and telecommunications, are highly dependent on the Internet. However, as the Internet’s underlying structural protocols and governance can be disturbed by intruders, for its smooth operation, it is important to minimize such disturbances. Of the available techniques for achieving this, computational intelligence methodologies, such as evolutionary algorithms and swarm intelligence approaches, are popular and have been successfully applied to detect intrusions. In this paper, we present an overview of these techniques and related literature on intrusion detection, analyze their research contributions, compare their approaches and discuss new research directions which will provide useful insights for intrusion detection researchers and practitioners.
Publisher: Elsevier BV
Date: 03-2013
Publisher: IEEE
Date: 06-2011
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 09-2016
Publisher: IEEE
Date: 07-2014
Publisher: IEEE
Date: 14-12-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 14-09-2021
DOI: 10.36227/TECHRXIV.16601546
Abstract: Its RESEARCH ARTICLE IN DOMAIN OF BLOCKCHAIN TECHNOLGY.
Publisher: IEEE
Date: 10-2008
Publisher: Informa UK Limited
Date: 05-11-2014
Publisher: Elsevier BV
Date: 10-2017
Publisher: Elsevier BV
Date: 2015
Publisher: SPIE
Date: 28-12-2006
DOI: 10.1117/12.644283
Publisher: Elsevier BV
Date: 10-2012
Publisher: Elsevier BV
Date: 09-2011
Publisher: IEEE
Date: 07-2010
Publisher: IEEE
Date: 12-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Elsevier BV
Date: 11-2006
Publisher: Fuji Technology Press Ltd.
Date: 20-05-2009
DOI: 10.20965/JACIII.2009.P0237
Abstract: Symbolic Regression is one of the most important applications of Genetic Programming, but suffers from one of the key issues in Genetic Programming, bloat. For a variety of reasons, reliable techniques to remove bloat are highly desirable. This paper introduces a novel approach of removing bloat, Equivalent Decision Simplification, in which subtrees are evaluated over the set of regression points. The effectiveness of the proposed method is confirmed by computer simulation taking simple Symbolic Regression problems as ex les.
Publisher: Elsevier BV
Date: 05-2016
Publisher: Elsevier BV
Date: 11-2017
Publisher: Elsevier BV
Date: 03-2021
Publisher: Springer Science and Business Media LLC
Date: 24-04-2011
Publisher: Elsevier BV
Date: 12-2011
Publisher: IEEE
Date: 06-2012
Publisher: Elsevier BV
Date: 11-2021
Publisher: Elsevier BV
Date: 03-2023
Publisher: Elsevier BV
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Elsevier BV
Date: 05-2015
Publisher: Elsevier BV
Date: 03-2019
Publisher: Elsevier BV
Date: 12-2011
Publisher: Springer Science and Business Media LLC
Date: 03-06-2022
Publisher: Cambridge University Press (CUP)
Date: 09-06-2016
DOI: 10.1017/S0890060415000323
Abstract: The job scheduling problem (JSP) is considered as one of the most complex combinatorial optimization problems. JSP is not an independent task, but is rather a part of a company business case. In this paper, we have studied JSPs under sudden machine breakdown scenarios that introduce a risk of not completing the jobs on time. We have first solved JSPs using an improved memetic algorithm and extended the algorithm to deal with the disruption situations, and then developed a simulation model to analyze the risk of using a job order and delivery scenario. This paper deals with job scheduling under ideal conditions and rescheduling under machine breakdown, and provides a risk analysis for a production business case. The extended algorithm provides better understanding and results than existing algorithms, the rescheduling shows a good way of recovering from disruptions, and the risk analysis shows an effective way of maximizing return under such situations.
Publisher: Elsevier BV
Date: 05-2019
Publisher: IEEE
Date: 06-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2006
Publisher: Elsevier BV
Date: 08-2014
Publisher: Elsevier BV
Date: 10-2013
Publisher: Elsevier BV
Date: 09-2020
Publisher: Springer Science and Business Media LLC
Date: 05-02-2018
Publisher: Elsevier BV
Date: 2022
Publisher: ACTAPRESS
Date: 2013
Publisher: Springer Science and Business Media LLC
Date: 26-06-2013
Publisher: Elsevier BV
Date: 11-2012
Publisher: IEEE
Date: 05-2015
Publisher: AIP
Date: 2010
DOI: 10.1063/1.3314271
Publisher: IEEE
Date: 06-2012
Publisher: Elsevier BV
Date: 02-2020
Publisher: IEEE
Date: 05-2010
Publisher: Springer International Publishing
Date: 02-11-2019
Publisher: Springer Science and Business Media LLC
Date: 04-10-2013
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11729976_25
No related grants have been discovered for Daryl Essam.