Author of the publication

Development of Fatigue-Associated Measuresment to Determine Fitness for Duty and Monitor Driving Performance.

, , and . HCI (24), volume 8027 of Lecture Notes in Computer Science, page 608-617. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Brain biomarkers based assessment of cognitive workload in pilots under various task demands., , , , , , , , , and . EMBC, page 5860-5863. IEEE, (2014)Novel Tools for Driving Fatigue Prediction: (1) Dry Eeg Sensor and (2) Eye Tracker., , , , , and . HCI (24), volume 8027 of Lecture Notes in Computer Science, page 618-627. Springer, (2013)Maximizing spectral radii of uniform hypergraphs with few edges., , , and . Discussiones Mathematicae Graph Theory, 36 (4): 845-856 (2016)A Composite Cognitive Workload Assessment System in Pilots Under Various Task Demands Using Ensemble Learning., , , , , , , , , and 3 other author(s). HCI (15), volume 9183 of Lecture Notes in Computer Science, page 91-100. Springer, (2015)Singaporean Conversational English-Malay Code-Switching Speech: An Analysis Based on Code-switching Points and Part -of-Speech., , , , , , , and . IALP, page 95-99. IEEE, (2023)On the (Non-)Existence of Tight Distance-Regular Graphs: a Local Approach., , , , , and . Electron. J. Comb., (2024)Development of Fatigue-Associated Measuresment to Determine Fitness for Duty and Monitor Driving Performance., , and . HCI (24), volume 8027 of Lecture Notes in Computer Science, page 608-617. Springer, (2013)To r or Not to r: a Sociophonetic Analysis of /ɹ/ in Singapore English.. ICPhS, page 1954-1957. (2011)Nonsingular mixed graphs with few eigenvalues greater than two., , , , and . Eur. J. Comb., 28 (6): 1694-1702 (2007)Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number., , and . Ars Comb., (2016)