Deep Learning-Based Short-Term Load Forecasting Approach in Smart Grid With Clustering and Consumption Pattern Recognition by Dabeeruddin Syed (16864260)

“…<p>Different aggregation levels of the electric grid's big data can be helpful to develop highly accurate deep learning models for Short-term Load Forecasting (STLF) in electrical networks. …”

Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams by Eduardo Feo-Flushing (23276023)

“…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …”

Optimization Techniques for Directional Overcurrent Relay Coordination: A Comprehensive Review by Tareq Foqha (17947778)

“…It also presents simulation software employed for examining and validating results obtained from optimization algorithms. …”

Single-Cell Transcriptome Analysis Highlights a Role for Neutrophils and Inflammatory Macrophages in the Pathogenesis of Severe COVID-19 by Hibah Shaath (5599658)

Cyberbullying Detection and Abuser Profile Identification on Social Media for Roman Urdu by Ayesha Atif (22155133)

A geographic information system method to generate long term regional solar radiation resource maps: enhancing decision-making by Sachin Jain (19161721)

“…<p dir="ltr">A long-term regional solar energy assessment improves decision-making processes for the selection of the best solar energy technology and helps understand how to define focused policies and investments. This study presents long-term solar resource monthly maps for Qatar. …”

An automated temporal partitioning tool for a class of DSP applications by Ouaiss, Iyad

“…This restructuring transformation is performed on the temporally partitioned behavior and results in near-optimization of throughput. Case study on the Joint Photographic Experts Group (jpeg) image compression algorithm demonstrates the e ectiveness of our approach.…”
Get full text
Get full text
Get full text

An automated temporal partitioning and loop fission approach for FPGA based reconfigurable synthesis of DSP applications by Ouaiss, I.

“…We discuss efficient memory mapping and address generation techniques for the synthesis of reconfigurable designs. A case study on the Joint Photographic Experts Group (JPEG) image compression algorithm demonstrates the effectiveness of our approach.…”
Get full text
Get full text
Get full text
Get full text

Blockchain-Based Decentralized Architecture for Software Version Control by Muhammad Hammad (17541570)

“…<p dir="ltr">Version control is an important component of configuration management, and most enterprise-level software uses different tools and technologies to manage the software version control such as CVS, Subversion, or Perforce. …”

Oversampling techniques for imbalanced data in regression by Samir Brahim Belhaouari (9427347)

“…The outcomes revealed a positive impact of data augmentation, with a success rate of 83.75% for Light Gradient Boosting Method (LightGBM) and 71.57% for the 18 other regressors employed in the study. This success rate is determined by the frequency of instances where models performed better when augmented data was used compared to instances with no augmentation. …”

A novel on design and implementation of hybrid MPPT controllers for solar PV systems under various partial shading conditions by Chakarajamula Hussaian Basha (21633167)

“…Here, the conventional converter helps increase the PV source voltage from one level to another level. The proposed system is investigated by using the MATLAB/Simulink tool.…”

Improving Active Resonance Damping and Unbalanced Voltage Mitigation Based on Combined DDSRF and Washout Filter in Islanded Microgrids by Ehsan Akbari (10803914)

“…Finally, Level 4 integrates a controller based on extracting positive and negative sequence components using the dual decoupled synchronous reference frame (DDSRF) algorithm. …”

Multi-Model Investigation and Adaptive Estimation of the Acoustic Release of a Model Drug From Liposomes by Wadi, Ali

“…Then, the algorithm was used to process the five experimental datasets. …”
Get full text

Multigrid solvers in reconfigurable hardware. (c2006) by Kasbah, Safaa J.

Get full text
Get full text

Evacuation of a highly congested urban city by El Khoury, John

“…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …”
Get full text
Get full text
Get full text

Uplink channel estimation for IMT-DS system by Sheikh, A.U.H.

“…The DRCE employs an adaptive filter whose weights are adapted by using an LMS algorithm. The performance of the RAKE receiver with DRCE for an IMT-DS system is evaluated in terms of BER by simulations for pedestrian and vehicular channels…”
Get full text
Get full text

Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

“…In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. The actions and rewards for the proposed algorithm are selected carefully to guide the agent to its objective. …”
Get full text
Get full text
Get full text

Inception voltage of corona in bipolar ionized fields-effect oncorona power loss by Al-Hamouz, Z.

“…In addition, the effect of ion penetration on reducing the positive conductor corona inception voltage is also studied. The present algorithm is applied to different laboratory and full scale transmission line configurations. …”
Get full text
Get full text

Charge and reduce by Abu-Khzam, Faisal N.

“…We prove that String-to-String Correction is fixed-parameter tractable, for parameter k, and present a simple fixed-parameter algorithm that solves the problem in O(2kn) time. …”
Get full text
Get full text
Get full text

On the parameterized parallel complexity and the vertex cover problem by Abu-Khzam, Faisal N.

“…In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n) , where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. …”
Get full text
Get full text
Get full text
Get full text