In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

An approach for hiding information has been proposed for securing information using Slanlet transform and the T-codes. Same as the wavelet transform the Slantlet transform is better in compression signal and good time localization signal compression than the conventional transforms like (DCT) discrete cosine transforms. The proposed method provides efficient security, because the original secret image is encrypted before embedding in order to build a robust system that is no attacker can defeat it. Some of the well known fidelity measures like (PSNR and AR) were used to measure the quality of the Steganography image and the image after extracted. The results show that the stego-image is closed related to the cover image, with (PSNR) Peak Si

Video steganography has become a popular option for protecting secret data from hacking attempts and common attacks on the internet. However, when the whole video frame(s) are used to embed secret data, this may lead to visual distortion. This work is an attempt to hide sensitive secret image inside the moving objects in a video based on separating the object from the background of the frame, selecting and arranging them according to object's size for embedding secret image. The XOR technique is used with reverse bits between the secret image bits and the detected moving object bits for embedding. The proposed method provides more security and imperceptibility as the moving objects are used for embedding, so it is difficult to notice the

ABSTRACT. 4-Sulfosalicylic acid (SSA) was used as a ligand to prepare new triphenyltin and dimethyl-tin complexes by condensation with the corresponding organotin chloride salts. The complexes were identified by different techniques, such as infrared spectra (tin and proton), magnetic resonance, and elemental analyses. The 119Sn-NMR was studied to determine the prepared complexes' geometrical shape. Two methods examined the antioxidant activity of (SSA) and prepared complexes; Free radical scavenging activity (DPPH) and CUPRRAC methods. Tri and di-tin complexes gave high percentage inhibition than ligands with both methods due to tin moiety; the triphenyltin carboxylate complex was the best compared with the others. Also, antibacter