Many different complex systems display emergent behavior, and quite a few of these systems have been studied in the past. The science of complexity, popularly known as chaos theory, deals with emergent systems in other fields. Designing emergence is something of a paradoxical task because one of the defining aspects of emergent behavior is that it occurs only after a system is put into motion. In this paper, we begin with the definition of complex systems. Then, we describe the continuum between strictly ordered systems and entirely chaotic ones and show that emergence takes place somewhere between the two. After that, we survey and show how gameplay emerges from the complex system. Our survey points out that three structural features of complex systems contribute to emergence: (a) active and interconnected elements; (b) feedback loops; and (c) interaction at different scales. To show the active and interconnected elements, we explain cellular automata as an example of simple systems that can produce emergence in games. Moreover, we described how a system can be stabilized/destabilized by feedback loops and how different behaviors may emerge in a system at different scales, along with particular games. In this survey, we identified seven classes of emergence that can be considered in games. These classes are Simple, Weak, Multiple, Strong, Cluster, Hub, and Complex Emergence. These classes are produced by different combinations of feedback loops and interactions among the elements of a system at different scales. Manuscript profile

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional simplex algorithm for Linear Programs. Many random data are generated and fed to the model for 50 vehicles. The results show that NSA is fast and efficient. It is found that, in practice, NSA takes polynomial time to solve problems in this application. Manuscript profile

هدف این پژوهش بررسی تأثیر بازی چندکاربره آنلاین در موقعیت مشارکتی بر انگیزش تحصیلی و یادگیری است. روش پژوهش از نوع شبه آزمایشی با طرح پیش‌آزمون و پس‌آزمون با گروه کنترل است. جامعه آماری شامل کلیه دانش آموزان پسر پایه ششم ابتدایی شهر تهران می‌شود که در سال تحصیلی 1401-1400 مشغول به تحصیل بودند. با روش نمونه‌گیری هدفمند دو مدرسه و دو کلاس به‌عنوان نمونه انتخاب شدند و 50 دانش‌آموز در این پژوهش مشارکت داشتند. ابزار جمع‌آوری داده‌های انگیزش تحصیلی پرسشنامه استانداردشده پورآقا رودبرده و طالع پسند بود که برای پایه هفتم طراحی‌شده بود. برای جمع‌آوری داده‌های متغیر یادگیری از آزمون چهارگزینه‌ای معلم ساخته استفاده گردید. روایی این آزمون با توجه به استفاده از جدول هدف - محتوا، نظر معلمان و متخصصان موضوع، در سطح مناسبی تعیین شد. پایایی آن نیز از طریق کودر-ریچاردسون 21، 71/0 مشاهده شد. نتایج به‌دست‌آمده از تحلیل کوواریانس تک متغیره و چندمتغیره نشان داد که سطح معناداری کوچک‌تر از 05/0 است (05/0>p). بدین ترتیب فرض صفر آماری رد و با تأیید فرض پژوهشی، مشخص گردید که بین دو گروه آزمایش و گواه، در نمرات انگیزش تحصیلی و یادگیری تفاوت معناداری وجود دارد. Manuscript profile

In this paper, we focus on the availability of software systems. Software systems with long-running execution may lead to software aging. This phenomenon affects the performance of software system and may eventually cause them to crash or failures. To counteract the phenomenon aging, software rejuvenation is implemented to prevent severe software failures. Generally, when software is initiated, amounts of memory are allocated. Then the body of software is executed for providing a service and when the software is terminated, the allocated memory is released. We propose a software rejuvenation model based on degraded physical memory. This model is implemented with a Markov chain and the system performance due to memory usage, by services, divided into four equal level. Hence, we offer four types of policies for software rejuvenation. The goal of the proposed method is to optimize availability of system. The results we achieve show the superiority of proposed method. Manuscript profile

Requirement engineering is one of the critical phases in the software systems development process. Functional Requirements (FR) and Non- Functional Requirements(NFR) are two of the fundamental requirements in software systems that are observed in the classifications of most of the researchers in this field. Conflicting and overlapping among the requirements in both intra and extra communications levels are some of the problems and challenges in the elicitation and prioritization phases. This paper defines and presents a decision strategy called requirements conflicts management strategy (RCMS). This strategy is defined to manage conflict and overlap of NFRs in the prioritization of the constraints satisfaction model for requirements prioritization, known as "CSOP + RP" model, in which the necessary constraints are also applied. RCMS is applied as a pre-processing phase by the requirement analyser and the results are delivered to the system manager in the "CSOP+RP" model. The composition of multiple components, such as conflict catalogue of NFRs and the relation table, the mapping model of NFRs to the domain systems, and precedence of weighted decision units in this strategy, leads to proper management of implicit and explicit knowledge conflicts and applying to overlap. The results show that using the proposed strategy leads to make a better decision, conflict management and overlapping control optimization. Therefore, ambiguities and influencing of NFRs and between NFRs and FRs reduces requirement ranking in the search-based prioritization approach. Furthermore, the system manager facilitated the final list of requirements prioritization. Manuscript profile