Urban morphological approach (concepts and practices) plays a significant role in forming our cities not only in terms of theoretical perspective but also in how to practice and experience the urban form structures over time. Urban morphology has been focused on studying the processes of formation and transformation of urban form based on its historical development. The main purpose of this study is to explore and describe the existing literature of this approach and thus aiming to summarize the most important studies that put into understanding the city form. In this regard, there were three schools of urban morphological studies, namely: the British, the Italian, and the French School. A reflective comparison between t

There have been many writings and discussions that dealt with the details and interpretation of the research methods and the identification of the methods and methodological methods used by researchers and writers as they deal with research topics and problems in all fields of natural and human sciences. But we noticed that the movement of science and its knowledge and development requires the identification of suitable tools and methodological methods appropriate for each type of science. In other words, attempts should be established to build appropriate methodological tools for human and cognitive activity that can be referred to as a specific science that sets out certain paths of the human sciences which is certainly the ori

Wisdom in the era before Islam is soo famous and so mature And Wisdom in the age of Islam {the holy quran and AI Hadeeth AI shareef }is dealt with by different meanings that agree with the contexts in which it occurs its contacs One of meanings is wisesaying that occuars in the Halal and Haram .As to the wisdom of the Amawy age ,it was some times absent since it was not dealt with by the great Poets of that age .In the Poetry of AL-FARAZDAK , Wisdom was little and it expressed religious and phsycological meanings because wisdom is amessage that has along –rang .

In cognitive radio system, the spectrum sensing has a major challenge in needing a sensing method, which has a high detection capability with reduced complexity. In this paper, a low-cost hybrid spectrum sensing method with an optimized detection performance based on energy and cyclostationary detectors is proposed. The method is designed such that at high signal-to-noise ratio SNR values, energy detector is used alone to perform the detection. At low SNR values, cyclostationary detector with reduced complexity may be employed to support the accurate detection. The complexity reduction is done in two ways: through reducing the number of sensing samples used in the autocorrelation process in the time domain and through using the Slid

DBN Rashid, Astra Salvensis, 2018 - Cited by 1

BN Rashid, Nasaq, 2015

Software Defined Networking (SDN) with centralized control provides a global view and achieves efficient network resources management. However, using centralized controllers has several limitations related to scalability and performance, especially with the exponential growth of 5G communication. This paper proposes a novel traffic scheduling algorithm to avoid congestion in the control plane. The Packet-In messages received from different 5G devices are classified into two classes: critical and non-critical 5G communication by adopting Dual-Spike Neural Networks (DSNN) classifier and implementing it on a Virtualized Network Function (VNF). Dual spikes identify each class to increase the reliability of the classification

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C