Pub Date : 2019-01-31DOI: 10.5121/IJFCST.2019.9101
Afnan Alazbah, B. Zafar
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.
{"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":"7 1","pages":"0"},"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}
Pub Date : 2018-09-30DOI: 10.5121/IJFCST.2018.8501
M. Islam, M. Biswas, Md. Julkar Nayeen Mahi
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that open 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 protocol 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 to 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 compare 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 86.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 protocol
水下探测器网络是该领域最具挑战性和最具吸引力的分析领域之一，为该领域的众多研究人员打开了一扇令人愉悦的大门。在一些水下传感器应用中，节点是方形测量的，并通过这种方式影响能量。因此，每个传感器节点的移动性是通过基于传感器协议形成的水流的水大气来测量的。研究人员已经开发了许多路由协议。然而，随着时间的推移，它们失去了魅力。为水下执行器网络提供节能、可提升的强路由协议是时代的要求。在此工作中，作者倾向于提出一种习惯的路由协议，即基于层次的路由协议(level - based routing protocol, LBRP)，以提供强大的、可上升的和节能的路由。与其他路由协议相比，LBRP共同保证了总能耗的最有效利用，并确保了数据包传输的重定向作为额外的可靠性。在本工作中，作者使用转发节点级别、剩余能量和转发节点到引起节点的距离作为多播技术比较的证明。在整个工作过程中，作者在节点组播性能上获得了平均约86.35%的识别结果。在安静的气氛中进行了模拟，这代表了对计划协议更高性能的认可
{"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":"80 1","pages":"0"},"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}
Pub Date : 2018-05-30DOI: 10.5121/IJFCST.2018.8301
A. Ghodousian
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.
Frank t-norm是连续阿基米德t-norm的参数族，其成员也是严格函数。通常，这个t模族也被称为基本t模族因为它在一些应用中扮演着重要的角色。研究了一类具有模糊关系不等式约束的线性目标函数的优化问题。可行域是由frank t-范数族定义的两个不等式模糊系统的交集形成的，并将其视为模糊组合。首先，研究了用max-Frank组合定义两个模糊不等式系统的可行解集的解。其次，推导了一些相关的基本性质和理论性质。然后，给出了一个充分必要条件和另外三个必要条件来概念化问题的可行性。随后，证明了最优目标值的下界总是可以达到的。并证明了问题的最优解总是由可行域的唯一最大解和最小解得到的。最后，提出了一种求解该问题的算法，并给出了实例说明。此外，提出了一种生成随机可行max-Frank模糊关系不等式的方法。通过这种方法，我们可以很容易地生成一个可行的测试问题，并将我们的算法应用于该问题。
{"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":"27 1","pages":"0"},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：