Obtaining the computational models for the functioning of the brain gives us a chance to understand the brain functionality thoroughly. This would help the development of better treatments for neurological illnesses and disorders. We created a cortical model using Python language using the Brian simulator. The Brian simulator is specialized in simulating the neuronal connections and synaptic interconnections. The dynamic connection model has multiple parameters in order to ensure an accurate simulation (Bowman, 2016). We concentrated on the connection weights and studied their effect on the interactivity and connectivity of the cortical neurons in the same cortical layer and across multiple layers. As synchronization helps us to mea

Discotic liquid crystal compounds were synthesized and characterized. Liquid crystalline texture of these compounds was investigated by polarized optical microscopy (POM). The Hartree-Fock approximation (HF) was used to calculate theoretical molecular parameters for synthesized compounds such as optimization, hardness, EHOMO, ELUMO, and energy gap using the Gaussian 09W program.

In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

In this paper, we characterize normal composition operators induced by holomorphic self-map , when and .Moreover, we study other related classes of operators, and then we generalize these results to polynomials of degree n.

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

      In this research, the nonparametric technique has been presented to estimate the time-varying coefficients functions for the longitudinal balanced data that characterized by observations obtained through (n) from the independent subjects, each one of them is measured repeatedly by group of  specific time points (m). Although the measurements are independent among the different subjects; they are mostly connected within each subject and the applied techniques is the Local Linear kernel LLPK technique. To avoid the problems of dimensionality, and thick computation, the two-steps method has been used to estimate the coefficients functions by using the two former technique. Since, the two-

Form the series of generalization of the topic of supra topology is the generalization of separation axioms . In this paper we have been introduced (S * - SS *) regular spaces . Most of the properties of both spaces have been investigated and reinforced with examples . In the last part we presented the notations of supra *- -space ( =0,1) and we studied their relationship with (S * - SS *) regular spaces.