Urban land uses of all kinds are the constituent elements of the urban spatial structure. Because of the influence of economic and social factors, cities in general are characterized by the dynamic state of their elements over time. Urban functions occur in a certain way with different spatial patterns. Hence, urban planners and the relevant urban management teams should understand the future spatial pattern of these changes by resorting to quantitative models in spatial planning. This is to ensure that future predictions are made with a high level of accuracy so that appropriate strategies can be used to address the problems arising from such changes. The Markov chain method is one of the quantitative models used in spatial planning to ana

This work examines the ability of a special type of smart antenna array known as Switched Active Switched Parasitic Antenna (SASPA) to produce a directive and electronically steerable radiation pattern. The SASPA array consists of antenna elements that are switchable between active and parasitic states by using P-Intrinsic-N (PIN) diodes. The active element is the element that is supplied by the radio frequency while short-circuiting the terminals of an element in the array results in a parasitic element. Due to the strong mutual coupling between the elements, a directional radiation pattern with high gain and a small beamwidth can be produced with only one active element operating at a time. By changing the parasitic state to the active

Biped robots have gained much attention for decades. A variety of researches has been conducted to make them able to assist or even substitute for humans in performing special tasks. In addition, studying biped robots is important in order to understand the human locomotion and to develop and improve control strategies for prosthetic and orthotic limbs. Some challenges encountered in the design of biped robots are: (1) biped robots have unstable structures due to the passive joint located at the unilateral foot-ground contact. (2) They have different configuration when switching from walking phase to another. During the singlesupport phase, the robot is under-actuated, while turning into an over-actuated system during the double-support pha

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Briefly the term of cyber security is a bunch of operations and procedures working on insurance and protecting the network, computer devices, the programs and data from attack and from damaging penetration, also from breaking, abstraction and disturbing in spite of the fact that the concept of cyber conflict is got widening. So, the needs arise in the state to secure cyberspace and protect it by several methods to confront the electronic intrusions and threats which is known as cyber security. Countries seek to preserve its national security in particular the United States of America after the events of September 11 ,2001. In addition, the United States follow all ways to take over cyber threats.

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.