Ernest Ernest

Prof. Ernest Ernest


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2022 in Biochimica et Biophysica Acta (BBA) - Gene Regulatory Mechanisms
Verified
Journal Article
Closed access
JBJoseph Bonello
Joseph Bonello
EEErnest Ernest
Ernest Ernest
NANigel Alfino
Nigel Alfino

31 December 2019 in Malaysian Journal of Computer Science
Verified
Journal Article
Closed access
PDF file
VBVimala Balakrishnan
Vimala Balakrishnan
VGVithyatheri Govindan
Vithyatheri Govindan
NANOREEN IZZA ARSHAD
NOREEN IZZA ARSHAD
LSLiyana Shuib
Liyana Shuib
EEErnest Ernest
Ernest Ernest
With the advent of Web 2.0 technologies such as social media, online text sources provide large scale data repositories out of which valuable knowledge about human emotions can be derived. This paper aims to (i) detect and classify emotions of the Facebook diabetes community, (ii) examine the relationship of emotion and Facebook reactions, and (iii) identify user reaction predictors for each of the emotion. A total of 15K posts were randomly selected from several official Facebook diabetes support groups. Pre-processing was administered, resulting in 2475 Facebook posts for further analysis in this study. Emotion detection was first administered using Indico API, with results revealing anger, sadness and fear to be the top most emotions experienced, whilst love and wow emerged as the highest-ranking reactions. Precision and recall indicate the performance of the emotion detection mechanism ranged between 65 – 82% for all the emotions, compared to the human annotation. The average F-score recorded was 78%. Both love and wow were found to significantly predict joy and fear, whereas angry was found to predict anger. The findings indicate that human emotions can be effectively detected based on users’ textual communication, and significant relationships exists between several reactions and emotions.

24 September 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
JAJohn Abela
John Abela
EEErnest Ernest
Ernest Ernest
CLColin Layfield
Colin Layfield
We revisit the P ? = NP question through the joint lenses of time–relative description complexity and automated discovery. Our premise is epistemic rather than ontological: even if polynomial–time algorithms for NP–complete problems exist, they may have very high Kolmogorov (description) complexity and thus be undiscoverable by unaided humans. Formal barriers (relativization, natural proofs, and algebrization) already suggest that familiar techniques are insufficient to separate or collapse P and NP. Regardless of the ultimate truth of P ? = NP, we argue that systematic search in high–K code spaces is valuable today: it may yield stronger heuristics, tighter exponential bases, improved approximation schemes, and fixed–parameter runtimes. To make such artifacts scientifically credible, we advocate a certificate–first workflow ([9,78]) that couples (i) polytime–by–construction skeletons with (ii) machine–checkable evidence (e.g., DRAT/FRAT logs; LP/SDP duals) and (iii) non–uniform search distilled into uniform algorithms. We also note empirical motivation from large language models: scaling laws and energy budgets indicate that high capacity often unlocks new emergent behaviors, while internal mappings remain complex and opaque. The overarching message is pragmatic: capacity (high descriptive complexity) plus certification may provide a principled path to better algorithms and clearer limits without presuming a resolution of P ? = NP. This paper is best described as an position/expository essay. We synthesize existing work from complexity theory, Kolmogorov complexity, and algorithmic discovery, and offers a rational justification for a shift in emphasis: from the elusive goal of discovering polynomial-time algorithms for NP-complete problems, to the tractable and fruitful pursuit of discovering high-performance heuristics and approximation methods via automated search and learning.

22 December 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
JAJohn Abela
John Abela
EEErnest Ernest
Ernest Ernest
CLColin Layfield
Colin Layfield
The celebrated question of whether P=NP continues to define the boundary between the feasible and the intractable in computer science. In this paper, we revisit the problem from two complementary angles: Time-Relative Description Complexity and automated discovery, adopting an epistemic rather than ontological perspective. Even if polynomial-time algorithms for NP-complete problems do exist, their minimal descriptions may have very high Kolmogorov complexity. This creates what we call an epistemic barrier, making such algorithms effectively undiscoverable by unaided human reasoning. A series of structural results—relativization, Natural Proofs, and the Probabilistically Checkable Proofs (PCPs) theorem—already indicate that classical proof techniques are unlikely to resolve the question, which motivates a more pragmatic shift in emphasis. We therefore ask a different, more practical question: what can systematic computational search achieve within these limits? We propose a certificate-first workflow for algorithmic discovery, in which candidate algorithms are considered scientifically credible only when accompanied by machine-checkable evidence. Examples include Deletion/Resolution Asymmetric Tautology (DRAT)/Flexible RAT (FRAT) proof logs for SAT, Linear Programming (LP)/Semidefinite Programming (SDP) dual bounds for optimization, and other forms of independently verifiable certificates. Within this framework, high-capacity search and learning systems can explore algorithmic spaces far beyond manual (human) design, yet still produce artifacts that are auditable and reproducible. Empirical motivation comes from large language models and other scalable learning systems, where increasing capacity often yields new emergent behaviors even though internal representations remain opaque. This paper is best described as a position and expository essay that synthesizes insights from complexity theory, Kolmogorov complexity, and automated algorithm discovery, using Time-Relative Description Complexity as an organising lens and outlining a pragmatic research direction grounded in verifiable computation. We argue for a shift in emphasis from the elusive search for polynomial-time solutions to the constructive pursuit of high-performance heuristics and approximation methods grounded in verifiable evidence. The overarching message is that capacity plus certification offers a principled path toward better algorithms and clearer scientific limits without presuming a final resolution of P=?NP.