International Journal in Foundations of Computer Science & Technology最新文献

筛选

英文中文

Pilgrimage (HAJJ) Crowd Management Using Agent-Based Method 基于智能体的朝觐人群管理

International Journal in Foundations of Computer Science & Technology Pub Date : 2019-01-31 DOI: 10.5121/IJFCST.2019.9101

Afnan Alazbah, B. Zafar

{"title":"Pilgrimage (HAJJ) Crowd Management Using Agent-Based Method","authors":"Afnan Alazbah, B. Zafar","doi":"10.5121/IJFCST.2019.9101","DOIUrl":"https://doi.org/10.5121/IJFCST.2019.9101","url":null,"abstract":"Each year, nearly two million Muslim pilgrims from all over the world come to Mecca to perform Hajj, which is the fifth pillar of Islam. The number of pilgrims increases every year, raising concerns regarding how to manage such huge crowds and how to prevent harmful incidents or crowd congestion disasters. The authorities have taken several steps to maintain free-flowing crowds; however, they continue to face difficulties. While numerous studies have been conducted to promote effective and efficient crowd management in Mecca, almost none of them have focused on crowd movements during the Rami AlJamarat ritual, which is when most of the causalities have occurred over the years. None of the studies proposed solutions to directly control the crowd movement without changing the path’s current structure. This study proposes a solution to prevent congestion at the Rami Al-Jamarat path without the need to change the structure, and it uses live crowd images to determine proper control signals that are then displayed directly to pilgrims as coloured lights. To demonstrate the results of this solution, a simulation is presented using an agent-based modelling platform.","PeriodicalId":270156,"journal":{"name":"International Journal in Foundations of Computer Science & Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

LBRP : A Resilient Energy Harvesting Noise Aware Routing Protocol for Under Water Sensor Networks (UWSNS) LBRP:水下传感器网络(UWSNS)的弹性能量收集噪声感知路由协议

International Journal in Foundations of Computer Science & Technology Pub Date : 2018-09-30 DOI: 10.5121/IJFCST.2018.8501

M. Islam, M. Biswas, Md. Julkar Nayeen Mahi

{"title":"LBRP : A Resilient Energy Harvesting Noise Aware Routing Protocol for Under Water Sensor Networks (UWSNS)","authors":"M. Islam, M. Biswas, Md. Julkar Nayeen Mahi","doi":"10.5121/IJFCST.2018.8501","DOIUrl":"https://doi.org/10.5121/IJFCST.2018.8501","url":null,"abstract":"Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that \u0000open the door of pleasing plenty of researchers during this field of study. In several under water based sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility of each sensor nodes are measured through the water atmosphere from the water flow for sensor based \u0000protocol formations. Researchers have developed many routing protocols. However, those lost their charm with the time. This can be the demand of the age to supply associate degree upon energy-efficient and ascendable strong routing protocol for under water actuator networks. During this work, the authors tend \u0000to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use of total energy consumption and ensures packet transmission which redirects as an additional reliability in \u0000compare to different routing protocols. In this work, the authors have used the level of forwarding node, residual energy and distance from the forwarding node to the causing node as a proof in multicasting technique comparisons. Throughout this work, the authors have got a recognition result concerning about \u000086.35% on the average in node multicasting performances. Simulation has been experienced each in a wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned \u0000protocol","PeriodicalId":270156,"journal":{"name":"International Journal in Foundations of Computer Science & Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129385822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

An Algorithm for Solving Linear Optimization Problems Subjected to the Intersection of Two Fuzzy Relational Inequalities Defined by Frank Family of T-Norms 求解由Frank t -范数族定义的两个模糊关系不等式相交的线性优化问题的一种算法

International Journal in Foundations of Computer Science & Technology Pub Date : 2018-05-30 DOI: 10.5121/IJFCST.2018.8301

A. Ghodousian

{"title":"An Algorithm for Solving Linear Optimization Problems Subjected to the Intersection of Two Fuzzy Relational Inequalities Defined by Frank Family of T-Norms","authors":"A. Ghodousian","doi":"10.5121/IJFCST.2018.8301","DOIUrl":"https://doi.org/10.5121/IJFCST.2018.8301","url":null,"abstract":"Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated. The feasible region is formed as the intersection of two inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can easily generate a feasible test problem and employ our algorithm to it.","PeriodicalId":270156,"journal":{"name":"International Journal in Foundations of Computer Science & Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134643420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5