The physical and morphological characteristics of porous silicon (PS) synthesized via gas sensor was assessed by electrochemical etching for a Si wafer in diluted HF acid in water (1:4) at different etching times and different currents. The morphology for PS wafers by AFM show that the average pore diameter varies from 48.63 to 72.54 nm with increasing etching time from 5 to 15min and from 72.54 to 51.37nm with increasing current from 10 to 30 mA. From the study, it was found that the gas sensitivity of In2O3: CdO semiconductor, against NO2 gas, directly correlated to the nanoparticles size, and its sensitivity increases with increasing operating temperature.

Information systems and data exchange between government institutions are growing rapidly around the world, and with it, the threats to information within government departments are growing. In recent years, research into the development and construction of secure information systems in government institutions seems to be very effective. Based on information system principles, this study proposes a model for providing and evaluating security for all of the departments of government institutions. The requirements of any information system begin with the organization's surroundings and objectives. Most prior techniques did not take into account the organizational component on which the information system runs, despite the relevance of

Tor (The Onion Routing) network was designed to enable users to browse the Internet anonymously. It is known for its anonymity and privacy security feature against many agents who desire to observe the area of users or chase users’ browsing conventions. This anonymity stems from the encryption and decryption of Tor traffic. That is, the client’s traffic should be subject to encryption and decryption before the sending and receiving process, which leads to delay and even interruption in data flow. The exchange of cryptographic keys between network devices plays a pivotal and critical role in facilitating secure communication and ensuring the integrity of cryptographic procedures. This essential process is time-consuming, which causes del

The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the

This study proposes a new version of the Autoregressive Integrated Moving Average (ARIMA) model using Artificial Neural Networks (ANNs) denoted by ARIMA-NN. The new model incorporates a multi-layer perceptron with matrix multiplication within a feed-forward network. The logistic, hyperbolic tangent (tanh), and sigmoid activation functions are used for weight updates in ARIMA-NN. A new forecasting algorithm is proposed, and one-step and multiple-steps forecasting procedures are rigorously analyzed. The proposed model was evaluated against existing forecasting model using performance metrics such as the Akaike Information Criterion (AIC) and Bayesian Information Criterion (

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us