Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

Objective conditions for the possibility of punishment are legal or material facts –positive or negative that depart from the activity of the offender. The legislator comments on their subsequent verification on the formation of some crimes the possibility of.The application of punishment to the offender , but although they are facts of an object nature that approach and overlap with many systems and cases , they are distinguished by a certain subjectivity that differentiates them from each case that may seem similar or approach them. To clarify the ambiguity that may surround these conditions , Which may lead to confusion between them and what be similar to other cases due to the common effect that they have in common , which is the f

Big data analysis is essential for modern applications in areas such as healthcare, assistive technology, intelligent transportation, environment and climate monitoring. Traditional algorithms in data mining and machine learning do not scale well with data size. Mining and learning from big data need time and memory efficient techniques, albeit the cost of possible loss in accuracy. We have developed a data aggregation structure to summarize data with large number of instances and data generated from multiple data sources. Data are aggregated at multiple resolutions and resolution provides a trade-off between efficiency and accuracy. The structure is built once, updated incrementally, and serves as a common data input for multiple mining an

The idea of ​​carrying out research on incomplete data came from the circumstances of our dear country and the horrors of war, which resulted in the missing of many important data and in all aspects of economic, natural, health, scientific life, etc.,. The reasons for the missing are different, including what is outside the will of the concerned or be the will of the concerned, which is planned for that because of the cost or risk or because of the lack of possibilities for inspection. The missing data in this study were processed using Principal Component  Analysis and self-organizing map methods using simulation. The variables of child health and variables affecting children's health were taken into account: breastfeed

Millions of lives might be saved if stained tissues could be detected quickly. Image classification algorithms may be used to detect the shape of cancerous cells, which is crucial in determining the severity of the disease. With the rapid advancement of digital technology, digital images now play a critical role in the current day, with rapid applications in the medical and visualization fields. Tissue segmentation in whole-slide photographs is a crucial task in digital pathology, as it is necessary for fast and accurate computer-aided diagnoses. When a tissue picture is stained with eosin and hematoxylin, precise tissue segmentation is especially important for a successful diagnosis. This kind of staining aids pathologists in disti

Although the number of stomach tumor patients reduced obviously during last decades in western countries, but this illness is still one of the main causes of death in developing countries. The aim of this research is to detect the area of a tumor in a stomach images based on fuzzy clustering. The proposed methodology consists of three stages. The stomach images are divided into four quarters and then features elicited from each quarter in the first stage by utilizing seven moments invariant. Fuzzy C-Mean clustering (FCM) was employed in the second stage for each quarter to collect the features of each quarter into clusters. Manhattan distance was calculated in the third stage among all clusters' centers in all quarters to disclosure of t

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la