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-derivative (PID) co

The main subject of this poem is a chance meeting between Baudelaire and unknown beautiful lady.  Her presence represents the far-fetched, magnificent beauty. This beauty forms an aspect of idealism that takes its real existence and disappears immediately.

This emotional poem deals with the continuous despair that dates back to the Romantic age where it was a key topic; the passing woman embodies destiny. All this comes from constant experience and mad love through the poet’s view to a woman paving the way toward the unknown. Baudelaire, however, noticed this unknown through a passer-by that reflected the real and magical image of this unk

With wireless sensor network (WSN) wide applications in popularity, securing its data becomes a requirement. This can be accomplished by encrypting sensor node data. In this paper a new an efficient symmetric cryptographic algorithm is presented. This algorithm is called wireless sensor network wavelet curve ciphering system (WSN-WCCS).  The algorithm idea based on discrete wavelet transformation to generate keys for each node in WSN.  It implements on hierarchical clustering WSN using LEACH protocol. Python programming language version 2.7 was used to create the simulator of WSN framework and implement a WSN-WCCS algorithm. The simulation result of the proposed WSN-WCCS with other symmetric algorithms has show

The goal of this paper is to design a robust controller for controlling a pendulum
system. The control of nonlinear systems is a common problem that is facing the researchers in control systems design. The Sliding Mode Controller (SMC) is the best solution for controlling a nonlinear system. The classical SMC consists from two phases. The first phase is the reaching phase and the second is the sliding phase. The SMC suffers from the chattering phenomenon which is considered as a severe problem and undesirable property. It is a zigzag motion along the switching surface. In this paper, the chattering is reduced by using a saturation function instead of sign function. In spite of SMC is a good method for controlling a nonlinear system b

KE Sharquie, AF Hameed, AA Noaimi, Indian Journal of Pathology and Microbiology, 2016 - Cited by 12

Judo has witnessed tremendous developments since its inception until the present day. It has been distinguished by its adaptation to the various challenges it has faced throughout the ages. Judo is one of the sports that have been affected by social, technological and cultural changes. These changes reflect its transformation from the traditional Japanese martial art to a global sport practiced. All over the world, therefore, studying the historical development of judo is important, as it provides valuable insights into the development of martial arts over a century, by studying the origins, principles and techniques of judo for the period (1880 - 1980), and also enables us to gain an understanding A deeper understanding of how the art form

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