A Fast and Robust Gas Recognition Algorithm Based on Hybrid Convolutional and Recurrent Neural Network حسب Xiaofang Pan (1895950)

CNN and HEVC Video Coding Features for Static Video Summarization حسب Issa, Obada

احصل على النص الكامل

Novel algorithms for accurate DNA base-calling حسب Mohammed, Omniyah Gul

احصل على النص الكامل

Predicting Patient ICU Readmission Using Recurrent Neural Networks With Long Short-Term Memory حسب Nadia Rasheed (22997257)

The Use of Microwave Tomography in Bone Healing Monitoring حسب Alkhodari, Mohanad Ahmed

احصل على النص الكامل

Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars حسب Abathar Al-Hamrani (16494884)

"…Finally, a design equation that can predict the shear capacity of one-way BFRC-BFRP slabs was proposed based on genetic algorithm. The proposed model showed the best prediction accuracy compared to the available design codes and guidelines with a mean of predicted to experimental shear capacities (V_pred/V_exp) ratio of 0.97 and a coefficient of variation of 17.91%.…"

Deep Learning-Based Coding Strategy for Improved Cochlear Implant Speech Perception in Noisy Environments حسب Billel Essaid (22047578)

Competitive learning/reflected residual vector quantization for coding angiogram images حسب Mourn, W.A.H.

احصل على النص الكامل
احصل على النص الكامل

Automatic Video Summarization Using HEVC and CNN Features حسب Issa, Obada

احصل على النص الكامل

Design of acoustic absorbing metasurfaces using a data-driven approach حسب Hamza Baali (14603380)

الموضوعات:

Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing حسب Abualigah, Laith

"…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …"
احصل على النص الكامل

Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study حسب Alkhodari, Mohanad Ahmed

"…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …"
احصل على النص الكامل

MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments حسب Hend Gedawy (23275984)

"…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …"

Nonlinear analysis of shell structures using image processing and machine learning حسب M.S. Nashed (16392961)

A hybrid approach for XML similarity حسب Tekli, Joe

"…In the past few years, XML has been established as an effective means for information management, and has been widely exploited for complex data representation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A novel technique for fast multiplication حسب Sait, Sadiq M.

"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل

Face Recognition in Uncontrolled Indoor Environment حسب Abuqaaud, Kamal Adel

احصل على النص الكامل

The maximum common subgraph problem حسب Abu-Khzam, Faisal N.

"…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Localizing-ground Transmitters Using Airborne Antenna Array حسب Daffalla, Mirghani Moutaman

احصل على النص الكامل

A new approach and faster exact methods for the maximum common subgraph problem حسب Abu-Khzam, Faisal N.

"…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل