The background subtraction is a leading technique adopted for detecting the moving objects in video surveillance systems. Various background subtraction models have been applied to tackle different challenges in many surveillance environments. In this paper, we propose a model of pixel-based color-histogram and Fuzzy C-means (FCM) to obtain the background model using cosine similarity (CS) to measure the closeness between the current pixel and the background model and eventually determine the background and foreground pixel according to a tuned threshold. The performance of this model is benchmarked on CDnet2014 dynamic scenes dataset using statistical metrics. The results show a better performance against the state-of the art

One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed

      The Indonesian language is used as a means of communication, including written communication. Unfortunately, many mistakes are found in Indonesian language writing, such as the writing of active verbs with the prefix mem- followed by the letter P. This problem can be addressed with the spell-checking method. Spell checking is a process in computer programs to check the spelling of each word in electronic text or documents in the correct order.  To better the active verb this study used  the Jaro-Winkler Distance algorithm. Meanwhile, for system development, the Iterative Waterfall method was used. The system output is active verbs of mem- + P which is standardized according to the Great Dictionary of the In

An experimental study is carried out on the effect of vortex generators (Circular and square) on the flow and heat transfer at variable locations at (X = 0.5, 1.5, 2.5 cm) ahead of a heat exchanger with Reynolds number ranging from 62000< Re < 125000 and heat flux from 3000 ≤ q ≤ 8000 W/m² .

In the experimental investigation, an apparatus is set up to measure the velocity and temperatures around the heat exchanger.                     

The results show that there is an effect for using vortex generators on heat transfer. Also, heat transfer depends on the shape and location. The circular is found t

In this study, the genus Xylocopa Latreille, 1802 (Hymenoptera: Apidae) was revised. There were 4 species registered in our investigations: X. hottentotta Smith, 1854; X. olivieri Lepeletier, 1841; X. pubescens Spinola, 1838 and X. valga Gerstäcker, 1872, the first species was described as being found for the first time for the insect fauna of Iraq, which were obtained from Solanum melogena L. flowers. Key to the species was constructed and supported by figures of the main diagnostic characters and some morphological features, illustrated and compared with other species, which are recorded in the current survey.

The ground pearls, Porphyrophora tritici (Bod.) is a new insect pest on wheat recorded for
the first time from Mousl Province, North of Iraq.

Signature verification involves vague situations in which a signature could resemble many reference samples or might differ because of handwriting variances. By presenting the features and similarity score of signatures from the matching algorithm as fuzzy sets and capturing the degrees of membership, non-membership, and indeterminacy, a neutrosophic engine can significantly contribute to signature verification by addressing the inherent uncertainties and ambiguities present in signatures. But type-1 neutrosophic logic gives these membership functions fixed values, which could not adequately capture the various degrees of uncertainty in the characteristics of signatures. Type-1 neutrosophic representation is also unable to adjust to various

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

In this work, we are concerned with how to find an explicit approximate solution (AS) for the telegraph equation of space-fractional order (TESFO) using Sumudu transform method (STM). In this method, the space-fractional order derivatives are defined in the Caputo idea. The Sumudu method (SM) is established to be reliable and accurate. Three examples are discussed to check the applicability and the simplicity of this method. Finally, the Numerical results are tabulated and displayed graphically whenever possible to make comparisons between the AS and exact solution (ES).