Deep Learning in Smart Grid Technology: A Review of Recent Advancements and Future Prospects حسب Mohamed Massaoudi (16888710)

"…This ongoing transition undergoes rapid changes, requiring a plethora of advanced methodologies to process the big data generated by various units. In this context, SG stands tied very closely to Deep Learning (DL) as an emerging technology for creating a more decentralized and intelligent energy paradigm while integrating high intelligence in supervisory and operational decision-making. …"

Using artificial bee colony to optimize software quality estimation models. (c2015) حسب Abou Assi, Tatiana Antoine

"…We validate our technique on data describing maintainability and reliability of classes in an Object-Oriented system. …"
احصل على النص الكامل
احصل على النص الكامل

From Collatz Conjecture to chaos and hash function حسب Masrat Rasool (17807813)

"…The effectiveness and dependability of the proposed hash function are evaluated by comparing it with two well-known hash algorithms, namely SHA-3 and SHA-2, as well as several other Chaos-based hash algorithms. …"

A Framework for Predictive Modeling in Sustainable Projects حسب Labban, Tarek

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

Nonlinear Friction Identification of A Linear Voice Coil DC Motor حسب Takrouri, Mohannad Hashem

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

Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité حسب Mourad, Azzam

"…The first one is the GAFlow, the Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, the Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

New aspect-oriented constructs for security hardening concerns حسب Mourad, Azzam

"…The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل