‎تم في هذه الدراسة ، تزيين ‏رقائق أكسيد الجرافين (‏GO‏) بجسيمات ‏كوبلتيت النيكل النانوية ‏NiCo2O4‎‏(‏NC‏) عن طريق الترسيب في ‏الموقع ، وتم استخدام المتراكب ‏المحضر (‏NC: GO‏) كسطح ماز لإزالة ‏صبغة الميثيل الخضراء ( ‏MG‏) من ‏المحاليل المائية. تم التحقق من ‏التغطية الناجحة لأوكسيد الجرافين ‏بجزيئات كوبلتيت النيكل النانوية ‏‏(‏NC‏) باستخدام دراسات ‏FT-IR‏ وحيود ‏الأشعة السينية (‏XRD‏). كانت أحجام  ‏الجسيم

Non uniform channelization is a crucial task in cognitive radio receivers for obtaining separate channels from the digitized wideband input signal at different intervals of time. The two main requirements in the channelizer are reconfigurability and low complexity. In this paper, a reconfigurable architecture based on a combination of Improved Coefficient Decimation Method (ICDM) and Coefficient Interpolation Method (CIM) is proposed. The proposed Hybrid Coefficient Decimation-Interpolation Method (HCDIM) based filter bank (FB) is able to realize the same number of channels realized using (ICDM) but with a maximum decimation factor divided by the interpolation factor (L), which leads to less deterioration in stop band at

Within this work, to promote the efficiency of organic-based solar cells, a series of novel A-π-D type small molecules were scrutinised. The acceptors which we designed had a moiety of N, N-dimethylaniline as the donor and catechol moiety as the acceptor linked through various conjugated π-linkers. We performed DFT (B3LYP) as well as TD-DFT (CAM-B3LYP) computations using 6-31G (d,p) for scrutinising the impact of various π-linkers upon optoelectronic characteristics, stability, and rate of charge transport. In comparison with the reference molecule, various π-linkers led to a smaller HOMO–LUMO energy gap. Compared to the reference molecule, there was a considerable red shift in the molecules under study (A1–A4). Therefore, based on

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T