TRIPS agreement was The first to apply protection by patents. However, this type of protection, which grants exclusive and monopoly rights to patent owners, came at the expense of developing countries which are considered rich in biodiversity and also at the expense of traditional and poor knowledge of modern technologies. The release of new plant varieties has led to the emergence of biopiracy and looting of the rights of developing countries without a license

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

We are, today, facing a torrent of information, ideas, images and videos due to advances of communication technology and electronic publishing. In addition to the proliferation of social networking sites that allow individuals to use them and participate in their channels without any restrictions limiting their freedom in publishing. Due to these sites many terms have emerged like alternative media which use internet and its various techniques to serve its objectives notably the freedom of expression without restrictions. This research studies the phenomenon of interactive media i.e. alternative media through Facebook along with the freedom that makes it spreading in the society and the relation of individual freedom with social diversit

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

تستهدف هذه الدراسة وبشكل أساس، الكشف عن طبيعة وخصائص البعد السياسي لهندسة/صناعة الخصائص الاجتماعية والسياسية للإنسان والمجتمع، بوصفها العملية المسؤولة عن تصميم هذه الخصائص وصناعتها وتغييرها جزئيا أو كليا، دون أبعادها الأخرى المتعددة والمتنوعة، لا لمجرد الانسياق وراء دوافع الرغبة الذاتية، أو اعتبارات التخصص الدقيق وأحكامه، لأن معهما أيضا، بل وقبلهما أحيانا، دوافع واعتبارات أخرى موضوع

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

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a