The cuneiform images need many processes in order to know their contents
and by using image enhancement to clarify the objects (symbols) founded in the
image. The Vector used for classifying the symbol called symbol structural vector
(SSV) it which is build from the information wedges in the symbol.
The experimental tests show insome numbersand various relevancy including
various drawings in online method. The results are high accuracy in this research,
and methods and algorithms programmed using a visual basic 6.0. In this research
more than one method was applied to extract information from the digital images
of cuneiform tablets, in order to identify most of signs of Sumerian cuneiform.

Hierarchical temporal memory (HTM) is a biomimetic sequence memory algorithm that holds promise for invariant representations of spatial and spatio-temporal inputs. This article presents a comprehensive neuromemristive crossbar architecture for the spatial pooler (SP) and the sparse distributed representation classifier, which are fundamental to the algorithm. There are several unique features in the proposed architecture that tightly link with the HTM algorithm. A memristor that is suitable for emulating the HTM synapses is identified and a new Z-window function is proposed. The architecture exploits the concept of synthetic synapses to enable potential synapses in the HTM. The crossbar for the SP avoids dark spots caused by unutil

The growing population and the rising standard of living in cities as well as the increased commercial, industrial and agricultural activities around the world led to
massive production of waste containing different materials and one of them is the municipal solid waste (MSW), so there is a major problem facing the cities around the world about the waste, how to collect, transfer it and how to discard it. Because the accumulation of wastes, whether in the city alleys or in its squares and especially in its residential areas affect the health of their populations besides this situation will be a major indication of the deteriorating quality of life in the city, as hygiene considered a fundamental criterion for the city beauty as well

Between October and December 2018, 27wounds and burn swab specimens were collected by laboratories at Al-Yarmook hospital, and cultured on Mannitol salt agar. the isolate was subjected to Nd: YAG laser in different power (400mJ, 500mJ, 800mJ and 900mJ). In general the laser showed effect on bacterial growth that reach to complete killing, the statistical analysis showed that there is weak correlation between laser at 400mJ with killed percentage. While in 500mJ its exhibit complete correlation with killing percentage, this correlation was decreased with increasing in power to 800mJ and 900Mj.

In the last years, the self-balancing platform has become one of the most common candidates to use in many applications such as flight, biomedical fields, industry. This paper introduced the simulated model of a proposed self-balancing platform that described the self–balancing attitude in (X-axis, Y-axis, or both axis) under the influence of road disturbance. To simulate the self-balanced platform's performance during the tilt, an integration between Solidworks, Simscape, and Simulink toolboxes in MATLAB was used. The platform's dynamic model was drawn in SolidWorks and exported as a STEP file used in the Simscape Multibody environment. The system is controlled using the proportional-integral-deriva

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