In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restricting the search.
The stability and releasing profile of 2:1 core: wall ratio ibuprofen microcapsules prepared by aqueous coacervation (gelatin and acacia polymers coat) and an organic coacervation methods (ethyl cellulose and sodium alginate polymers coat) in weight equivalent to 300mg drug, were studied using different storage temperatures 40°C, 50°C ,60°C and refrigerator temperature 4°C in an opened and closed container for three months (releasing profile) and four months (stability study).It was found that, these ibuprofen microcapsules were stable with expiration dates of 4.1 and 3.1 years for aqueous and an organic method respectively.Aqueous prepared ibuprofen microcapsules were found more stable than those microcapsules prepared by or
... Show MoreData scarcity is a major challenge when training deep learning (DL) models. DL demands a large amount of data to achieve exceptional performance. Unfortunately, many applications have small or inadequate data to train DL frameworks. Usually, manual labeling is needed to provide labeled data, which typically involves human annotators with a vast background of knowledge. This annotation process is costly, time-consuming, and error-prone. Usually, every DL framework is fed by a significant amount of labeled data to automatically learn representations. Ultimately, a larger amount of data would generate a better DL model and its performance is also application dependent. This issue is the main barrier for
The influence of process speed (PS) and tillage depth (TD) , on growth of corn (Zea mays L) yield, for Maha cultivar, were tested at two ranges of PS of 2.483 and 4.011 km.hr-1, and three ranges of TD of 15,20 and 25cm. The experiments were conducted in a factorial experiment under complete randomized design with three replications. The results showed that the PS of 2.483 km.hr-1 was significantly better than the PS of 4.011km.hr-1 in all studied conditions. The , slippage ratio (SR) and the machine efficiency (ME), the physical soil characteristics represented by the soil density and porosity (SBD and TSP), and the plant characteristics represented the roots dry weight, PVI and the crop productivity (CP), except adjective of the fu
... Show MoreShadow removal is crucial for robot and machine vision as the accuracy of object detection is greatly influenced by the uncertainty and ambiguity of the visual scene. In this paper, we introduce a new algorithm for shadow detection and removal based on different shapes, orientations, and spatial extents of Gaussian equations. Here, the contrast information of the visual scene is utilized for shadow detection and removal through five consecutive processing stages. In the first stage, contrast filtering is performed to obtain the contrast information of the image. The second stage involves a normalization process that suppresses noise and generates a balanced intensity at a specific position compared to the neighboring intensit
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
The current study aims at identifying:
1-The intellectual stress of counselors according to gender variable (male, female ).
2-The five major factors of the Counselor's Personality.
3- The relationship between intellectual stress and the five major factors of the councilors' personality and according to gender variable (male, female ).
4-The significant differences in the relationship between intellectual stress and the five major factors of the councilors' personality and according to gender variable (male, female ).
The sample of the study includes (260) counselors (130 male
... Show More