The creation and characterisation of biodegradable blend films based on chitosan and polyvinyl alcohol for application in a range of packaging is described. The compatibility between the chitosan and PVA polymers was good. Composite films had a compact and homogeneous structure, according to the morphology analysis. The mechanical test result of PVA/CH at concentrations 5% showed, that The higher values of TS recorded in sample (p1, with 40 MPa) while the lower values appeared in sample (p9, with 22.09 MPa), the TS decreased gradually as the amount of PVA increased in blend film. While the blend film of pure Chitosan exhibits a poor mechanical strength which makes it a poor candidate for packaging but Blending CH with PVA together improved

This paper deals with novels for group of Iraqi Women novelists published in the time period 2003 – 2013, and the functioning of temporal anomalies in the Iraqi Women's narrative.
In general, the novel contains structural elements such as: the characters, events and the places, these elements must be collected by an artist creating a complete work of fiction. However the time dominates the other elements through progression and regaining called Time paradox, it has a modern critical importance because of its impact in highlighting of political, social and cultural events that make up the fictional environment which cast a shadow over other techniques. And that it is clear in the course of the narrative.

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

Community detection is one of the most fundamental applications in understanding the structure of complicated networks. Furthermore, it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships. Networking structures are highly sensitive in social networks, requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks. In addition, they miss out on accurately identifying clusters. Since single-objective optimization cannot always generate accurate and comprehensive results, as multi-objective optimization can.Therefore,we utilized two objective

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages