Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Fahad Islam"'
Publikováno v:
IEEE Access, Vol 8, Pp 179845-179856 (2020)
Could we detect anomalies during the run-time of a program by learning from the analysis of its previous traces for normally completed executions? In this paper we create a featured data set from program traces at run time, either during its regular
Externí odkaz:
https://doaj.org/article/114e320ca7cf488a990d7436559c6f82
Autor:
Tooba Salahuddin, Fatima Haouari, Fahad Islam, Rahma Ali, Sara Al-Rasbi, Nada Aboueata, Eman Rezk, Ali Jaoua
Publikováno v:
Informatics in Medicine Unlocked, Vol 13, Iss , Pp 176-185 (2018)
The increase in biomedical data has given rise to the need for developing data sampling techniques. With the emergence of big data and the rise of popularity of data science, sampling or reduction techniques have been assistive to significantly haste
Externí odkaz:
https://doaj.org/article/8d1348a186c6492b902c76556e93d4d9
Publikováno v:
IEEE Access, Vol 5, Pp 338-346 (2017)
This paper focuses on detecting inconsistencies within text corpora. It is a very interesting area with many applications. Most existing methods deal with this problem using complicated textual analysis, which is known for not being accurate enough.
Externí odkaz:
https://doaj.org/article/96d397fa5d1246a2aabc856dd9757d5e
Publikováno v:
Asia-Pacific Journal of Information Technology and Multimedia, Vol 2, Iss (2), Pp 39-51 (2013)
Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. The recent development of its variant: RRT* is considered as a major breakt
Externí odkaz:
https://doaj.org/article/fcdb38d0be584cb2b5091b7897e80eb5
Autor:
Jauwairia Nasir, Fahad Islam, Usman Malik, Yasar Ayaz, Osman Hasan, Mushtaq Khan, Mannan Saeed Muhammad
Publikováno v:
International Journal of Advanced Robotic Systems, Vol 10 (2013)
Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm. Although it ensures probabilistic completeness, it cannot
Externí odkaz:
https://doaj.org/article/29c34176e12e441080fd48bcddc08974
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:29-37
Heuristic search-based planning techniques are commonly used for motion planning on discretized spaces. The performance of these algorithms is heavily affected by the resolution at which the search space is discretized. Typically a fixed resolution i
Publikováno v:
Scholars Journal of Applied Medical Sciences. 8:2146-2151
Autor:
Mohammed Emran, Fahad Islam, Moniruzzaman Khan, Aparajeya Bivab Bikash Baral, Ripon Kumar Saha, Bijoya Dey Happy, SM Mazharul Islam
Publikováno v:
KYAMC Journal. 11:21-25
Background: Low back pain (LBP) has been identified as one of the most frequent, disabling and costly condition which create a significant clinical and socioeconomic burden on national economy. The Roland Morris Disability Questionnaire (RMDQ)is one
Publikováno v:
ICRA
In many applications, including logistics and manufacturing, robot manipulators operate in semi-structured environments alongside humans or other robots. These environments are largely static, but they may contain some movable obstacles that the robo
Publikováno v:
Robotics and Autonomous Systems. 116:51-63
In this paper, we present a motion planning framework for humanoid robots that combines whole-body motions as well as footsteps under a quasi-static flat ground plane assumption. Traditionally, these two have been treated as separate research domains