A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
Arabic text classification is a challenging task because of the complex morphology of the language, the existence of different writing forms and a multitude of dialects, which can result in sparser common text representations. While transformer models such as AraBERT have obtained superior results on many Arabic NLP tasks, their high computational requirements make them difficult to deploy in environments with limited hardware resources. In some cases this can also make the model less practical for researchers working with basic computer systems. This study focuses on a more practical issue: how much accuracy a simple classifier may lose when the amount of required computation is reduced. We use a combined TF-IDF representation based on bo
... Show MoreBackground: Schneiderian first rank symptoms are
considered highly valuable in the diagnosis of
schneideria.
They are more evident in the acute phase of the
disorder and fading gradually with time. Many studies
have shown that the rate of these symptoms are
variable in different countries and are colored by
cultural beliefs and values.
Objectives: To find out the rate of Schneiderian first
rank symptoms among newly diagnosed schizophrenic
patients, to assess which symptom(s) might
predominate in those patients, and to find out if there
is/are any correlation(s) between the occurrence of
these symptoms and the sex of the patients.
Methods: Out of twenty-four patients with no past
psychiatric hi