In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route for the transmission of the packets of data in the direction of their destination by taking into consideration the status of the traffic segment when selecting the next intersection. Through this algorithm, a new formula for assessing the status of the segment is presented based on three elements: density, connectivity, and distance. To evaluate this routing algorithm, simulations are performed, once the results are obtained, they are compared with the existing routing algorithms. The evaluation of results offered evidence that our routing algorithm did well in terms of packet delivery ratio and packet delivery delay.
Background: The objective of this in vitro study was to evaluate the vertical marginal fit of crowns fabricated with ZrO2 CAD/CAM, before and after porcelain firing cycles and after glaze cycles. Materials and Methods: An acrylic resin model of a left maxillary first molar was prepared and duplicated to have Nickel-Chromium master die. Ten die stone dies were sent to the CAD/CAM (Amann Girrbach) for crowns fabrication. Marginal gaps along vertical planes were measured at four indentations at the (mid mesial, mid distal, mid buccal, mid palatal) before (Time 0) and after porcelain firing cycles (Time 1) and after glaze cycles (Time 2) using a light microscope at a magnification of ×100. One way ANOVA LSD tests were performed to determine wh
... Show MoreAbstract
The research aims to identify tax exemptions, their objectives and types, as well as to shed light on the concept of sustainable development, its objectives, dimensions and indicators (economic, social and environmental), as well as to analyze the relationship between tax exemptions and economic development, in addition to measuring and analyzing the impact of tax exemptions on economic development in Iraq for the period ( 2015 - 2021) using the NARDL model. The research problem centers on the fact that failure to employ financial policy tools correctly led to a weakness in achieving economic justice, which leads to a failure to improve social welfar
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other
... Show MoreLK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2