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

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

Traditionally, 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).

 The current research aims to: (know the effectiveness of the harvesting strategy in the achievement of the students of the Institute of Fine Arts in environmental art.
- In order to know this effectiveness, the researcher put a main zero hypothesis and derived six sub-hypotheses from it. the usual way; As the research community reached (120) male and female students of the Fine Arts Institutes for the morning study in Baghdad. As for the research sample, it was chosen by the simple random method, and the number was (75) male and female students for the year 2021-2022 AD. The researcher applied a pre-knowledge test for the four groups of research to find out the level of previous experiences of students in the subject of environmen

<p>Recently, reconfigurable intelligent surfaces have an increasing role to enhance the coverage and quality of mobile networks especially when the received signal level is very weak because of obstacles and random fluctuation. This motivates the researchers to add more contributions to the fields of reconfigurable intelligent surfaces (RIS) in wireless communications. A substantial issue in reconfigurable intelligent surfaces is the huge overhead for channel state information estimation which limits the system’s performance, oppressively. In this work, a newly proposed method is to estimate the angle of arrival and path loss at the RIS side and then send short information to the base station rather than huge overhe