This paper proposes a novel fuzzy computational algorithm for IoT smart irrigation systems. It describes all the possible sensors, actuators and microcontrollers that could be used in the irrigation systems. Based on these sensors a novel system architecture is presented. The irrigation system continuously monitoring air temperature and humidity, and ground moisture. The ground humidity sensors are interspersed all over the field. The measurements are send in a microcontroller that applies a fuzzy computational algorithm and decides whether to open a servo valve or not. All the data collected from the microcontroller are sent to a cloud database for statistical information and processing.
{"title":"A Smart IoT Fuzzy Irrigation System","authors":"G. Kokkonis, Sotirios Kontogiannis, D. Tomtsis","doi":"10.9790/3021-0706011521","DOIUrl":"https://doi.org/10.9790/3021-0706011521","url":null,"abstract":"This paper proposes a novel fuzzy computational algorithm for IoT smart irrigation systems. It describes all the possible sensors, actuators and microcontrollers that could be used in the irrigation systems. Based on these sensors a novel system architecture is presented. The irrigation system continuously monitoring air temperature and humidity, and ground moisture. The ground humidity sensors are interspersed all over the field. The measurements are send in a microcontroller that applies a fuzzy computational algorithm and decides whether to open a servo valve or not. All the data collected from the microcontroller are sent to a cloud database for statistical information and processing.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74948652","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}
Cloud Computing provides access to a shared pool of computing resources such as servers, storage, computer networks and services, which can be rapidly provisioned and released, for the execution of various scientific and business applications. Scheduling scientific workflows modeled by Directed Acyclic Graphs is an NP complete problem. In cloud environment, there are fluctuations in resource availability due to shared resources and vastly varying workloads. The performance variations in virtual machines, have an impact on task execution times and data transfer times. This has a great impact on the performance of scheduling algorithms. Schedulers should map tasks to cloud resources considering the effective utilization of underlying resources. We propose a new static workflow scheduling algorithm called Predictive Probabilistic Resource Availability based Cloud Workflow Scheduling (PPRA) with the objective of minimizing makespan considering the probability of resource availability of cloud resources. This algorithm is compared with existing algorithms which assume full resource availability while making scheduling decisions. The proposed algorithm is found to be more reliable and performing better than existing HEFT and ECTS algorithms, in terms of minimized makespan.
{"title":"Predictive Probabilistic Resource Availability based Cloud Workflow Scheduling (PPRA)","authors":"S. Chitra, R. PrashanthCS","doi":"10.9790/0661-1904015463","DOIUrl":"https://doi.org/10.9790/0661-1904015463","url":null,"abstract":"Cloud Computing provides access to a shared pool of computing resources such as servers, storage, computer networks and services, which can be rapidly provisioned and released, for the execution of various scientific and business applications. Scheduling scientific workflows modeled by Directed Acyclic Graphs is an NP complete problem. In cloud environment, there are fluctuations in resource availability due to shared resources and vastly varying workloads. The performance variations in virtual machines, have an impact on task execution times and data transfer times. This has a great impact on the performance of scheduling algorithms. Schedulers should map tasks to cloud resources considering the effective utilization of underlying resources. We propose a new static workflow scheduling algorithm called Predictive Probabilistic Resource Availability based Cloud Workflow Scheduling (PPRA) with the objective of minimizing makespan considering the probability of resource availability of cloud resources. This algorithm is compared with existing algorithms which assume full resource availability while making scheduling decisions. The proposed algorithm is found to be more reliable and performing better than existing HEFT and ECTS algorithms, in terms of minimized makespan.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84233357","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}
Most of the transactions at the Point of Sale (POS) terminals are carried out by payments through Credit or Debit cards.Many leading banks have started the door step banking service with the help of microATM device.The current authentication system uses fingerprint authentication or PIN based authentication method.Biometric features are unique for every individual and hence can be widely used in fusion for enhancing the security system for micro-ATMS and POS terminals.
{"title":"Enhancing Micro-ATMs and POS Terminals Authentication System Using AdvancedBiometric Techniques","authors":"Priya Tawde, G. Lakshmi","doi":"10.9790/0661-1904017477","DOIUrl":"https://doi.org/10.9790/0661-1904017477","url":null,"abstract":"Most of the transactions at the Point of Sale (POS) terminals are carried out by payments through Credit or Debit cards.Many leading banks have started the door step banking service with the help of microATM device.The current authentication system uses fingerprint authentication or PIN based authentication method.Biometric features are unique for every individual and hence can be widely used in fusion for enhancing the security system for micro-ATMS and POS terminals.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83082648","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}
Wireless sensor networks are able to provide crucial and real time information in many scenarios of crisis response and management. Sensor node localization is one of research hotspots in the applications of wireless sensor networks (WSNs) field. A localization algorithm based on improved Support Vector Machine (SVM) for WSNs is proposed in this paper. SVM classification accuracy is the key to the localization accuracy. The selection of parameters is the important factor that influences the performance of SVM. Therefore, this paper proposes a parameter optimization algorithm based on Krill-herd algorithm (KH-SVM). The experimental results show that KH-SVM algorithm has better searching optimization ability compared with other optimization algorithms. In order to improve the fault tolerance against both random attacks and deliberate attacks for wireless sensor networks, this paper proposes a evolution model.We present an efficient seismic data sensing scheme in wireless sensor networks based on the promising compressed sensing technology to mitigate wireless communication load, data processing and caching complexity on nodes.
{"title":"A Compressed Sensing Method for Wireless Sensor Networks with Evolution Model Based on KH-SVM","authors":"Pengxi Liu","doi":"10.9790/0661-1903062126","DOIUrl":"https://doi.org/10.9790/0661-1903062126","url":null,"abstract":"Wireless sensor networks are able to provide crucial and real time information in many scenarios of crisis response and management. Sensor node localization is one of research hotspots in the applications of wireless sensor networks (WSNs) field. A localization algorithm based on improved Support Vector Machine (SVM) for WSNs is proposed in this paper. SVM classification accuracy is the key to the localization accuracy. The selection of parameters is the important factor that influences the performance of SVM. Therefore, this paper proposes a parameter optimization algorithm based on Krill-herd algorithm (KH-SVM). The experimental results show that KH-SVM algorithm has better searching optimization ability compared with other optimization algorithms. In order to improve the fault tolerance against both random attacks and deliberate attacks for wireless sensor networks, this paper proposes a evolution model.We present an efficient seismic data sensing scheme in wireless sensor networks based on the promising compressed sensing technology to mitigate wireless communication load, data processing and caching complexity on nodes.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86327834","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}
Given the increasing complexity of the economic context, it is important for each company to master information and build a robust strategic planning process. Competitive Intelligence (CI) is important for companies to manage their information. CI identifies opportunities and determinants of success, anticipates threats and prevents risks. CI becomes an imperative for any company wishing to sustain its growth and innovation sustainably. In addition, decision-makers have a key role to play when making decisions, some of which can have a significant impact and therefore justify the effort to reflect and deliberate on possible options before making a decision. Strategic decisions can be defined as important and far-reaching decisions in terms of actions taken, resources committed, number of actors involved and impact on all future operations. Our answer to this challenge is an approach that uses Rough set theory. Our approach is designed to support decisionmaking and respects the characteristics of strategic decision support in complex, uncertain and evolving situations. Rough set theory can effectively process data and information in complex system. In this article, we propose a CI approach where we used the rough set theory to generate rules in order to help decision makers make a decision in a complex and multi-criteria situation and under a context of uncertainty. We applied our model on the choice of implementation of an Enterprise Resource Planning (ERP) within the company.
{"title":"A Competitive Intelligence framework to support decisionmaking based on Rough Set Theory","authors":"Fatima-Zzahra Cheffah, Mostafa Hanoune","doi":"10.9790/0661-1903061520","DOIUrl":"https://doi.org/10.9790/0661-1903061520","url":null,"abstract":"Given the increasing complexity of the economic context, it is important for each company to master information and build a robust strategic planning process. Competitive Intelligence (CI) is important for companies to manage their information. CI identifies opportunities and determinants of success, anticipates threats and prevents risks. CI becomes an imperative for any company wishing to sustain its growth and innovation sustainably. In addition, decision-makers have a key role to play when making decisions, some of which can have a significant impact and therefore justify the effort to reflect and deliberate on possible options before making a decision. Strategic decisions can be defined as important and far-reaching decisions in terms of actions taken, resources committed, number of actors involved and impact on all future operations. Our answer to this challenge is an approach that uses Rough set theory. Our approach is designed to support decisionmaking and respects the characteristics of strategic decision support in complex, uncertain and evolving situations. Rough set theory can effectively process data and information in complex system. In this article, we propose a CI approach where we used the rough set theory to generate rules in order to help decision makers make a decision in a complex and multi-criteria situation and under a context of uncertainty. We applied our model on the choice of implementation of an Enterprise Resource Planning (ERP) within the company.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88602422","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}
The publication suggests how to significantly improve the spacecraft center of mass movement stabilization accuracy in the active phases of trajectory correction during interplanetary and transfer flights, which in some cases provides for high navigation accuracy, when rigid trajectory control method is used.
{"title":"Improving the Spacecraft Center of Mass Stabilization Accuracy","authors":"N. Zosimovych","doi":"10.9790/3021-0706010714","DOIUrl":"https://doi.org/10.9790/3021-0706010714","url":null,"abstract":"The publication suggests how to significantly improve the spacecraft center of mass movement stabilization accuracy in the active phases of trajectory correction during interplanetary and transfer flights, which in some cases provides for high navigation accuracy, when rigid trajectory control method is used.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85247040","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}
Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced recently and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. Let S be a subset of the set E of edges of G. Then the total bondage number bt(G) of G, is the minimum cardinality among all sets S such that γt(G S) > γt(G). In this paper the values for total bondage number of butterfly graph of dimension n are presented.
{"title":"Total Bondage Number Of A Butterfly Graph","authors":"P. Jyothi","doi":"10.9790/3021-0706010106","DOIUrl":"https://doi.org/10.9790/3021-0706010106","url":null,"abstract":"Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced recently and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. Let S be a subset of the set E of edges of G. Then the total bondage number bt(G) of G, is the minimum cardinality among all sets S such that γt(G S) > γt(G). In this paper the values for total bondage number of butterfly graph of dimension n are presented.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87523141","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}
Operations research on computers interact in numerous logical fields of imperative significance to our society. These incorporate, among others, transportation, financial matters, speculation procedure, stock control, co ordinations, wellbeing, dependability, urban arranging, and ecology. Computers and Operations Research (COR) gives a global discussion to the application of computers and operations research techniques to issues in these and related fields. The field of mathematics plays essential part in various fields. One of the important areas in mathematics is Operations research which is utilized as a part of basic models. This basic course of action of different articles or technologies prompt new innovations and adjustments in the current condition for upgrade in those fields. This paper gives a review of the utilizations of Operations research in heterogeneous fields to some degree yet predominantly concentrates on the computer science application that utilizes Operations research ideas. Various papers in light of Operations research have been concentrated identified with booking ideas, computer science applications and an outline has been presented here.
{"title":"Impact of Operations Research on Computer Science","authors":"M. Ahmad","doi":"10.9790/0661-1904015053","DOIUrl":"https://doi.org/10.9790/0661-1904015053","url":null,"abstract":"Operations research on computers interact in numerous logical fields of imperative significance to our society. These incorporate, among others, transportation, financial matters, speculation procedure, stock control, co ordinations, wellbeing, dependability, urban arranging, and ecology. Computers and Operations Research (COR) gives a global discussion to the application of computers and operations research techniques to issues in these and related fields. The field of mathematics plays essential part in various fields. One of the important areas in mathematics is Operations research which is utilized as a part of basic models. This basic course of action of different articles or technologies prompt new innovations and adjustments in the current condition for upgrade in those fields. This paper gives a review of the utilizations of Operations research in heterogeneous fields to some degree yet predominantly concentrates on the computer science application that utilizes Operations research ideas. Various papers in light of Operations research have been concentrated identified with booking ideas, computer science applications and an outline has been presented here.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82378615","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}
Pedestrian identification systemplays an important role in vehicle safetyassistant driving technology. In order toidentify the movement of pedestriansmore quickly and easily, motion pedestrian identification is carried out based on the Bayesian classifier. The identificationprocess was realized in two steps. Firstly, Bayesian classifier is designed based on the HOG feature. Secondly, the image captured by the camera is processed by taking the five-frame difference methodto extract the identification target from the pre-processed images and the HOG feature of the identification target is extracted as the input of the classifier to identify the target. The results show that this method can achieve the goal of identifying pedestrians quickly and simply.
{"title":"Research on Moving Pedestrian Identification Based on Bayesian Classifier","authors":"Wu Hua-zhi","doi":"10.9790/0661-1903044147","DOIUrl":"https://doi.org/10.9790/0661-1903044147","url":null,"abstract":"Pedestrian identification systemplays an important role in vehicle safetyassistant driving technology. In order toidentify the movement of pedestriansmore quickly and easily, motion pedestrian identification is carried out based on the Bayesian classifier. The identificationprocess was realized in two steps. Firstly, Bayesian classifier is designed based on the HOG feature. Secondly, the image captured by the camera is processed by taking the five-frame difference methodto extract the identification target from the pre-processed images and the HOG feature of the identification target is extracted as the input of the classifier to identify the target. The results show that this method can achieve the goal of identifying pedestrians quickly and simply.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81773456","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}
The cuckoo hashing methodology completely avoids hash collisions. An insertion of a new item causes a failure and an endless loop when there are collisions in all probed positions till achieving the timeout status. To interrupt the countless loops, an intuitive manner is to carry out a complete rehash if this uncommon incident takes place. In practice, the high priced overhead of acting a rehashing operation can be dramatically decreased by using taking benefit of a very small extra regular-size space. In our proposed paper hashing involve collisions in which the stored buckets with one item will be reduced to probe the hash collision and query about the buckets. The enumerator that allocates each hash bucket will reduce the endless loops. As an accession we include intrusion detection and defense implementation (IDDI) that scrutinizes the hash and cache memory utilization efficiently. Cuckoo hashing is more prone to intrusion attack for which we alleviate such attacks by avoiding loops in buckets. Through detection and avoidance mechanism of intrusion we enhance the transmission in cuckoo hashing simultaneously by providing strong security towards its data.
{"title":"Intrusion Detection and Defense Implementation (IDDI) in Cuckoo Hashing","authors":"D. Seethalakshmi, Dr.G.M. Nasira","doi":"10.9790/0661-1903064952","DOIUrl":"https://doi.org/10.9790/0661-1903064952","url":null,"abstract":"The cuckoo hashing methodology completely avoids hash collisions. An insertion of a new item causes a failure and an endless loop when there are collisions in all probed positions till achieving the timeout status. To interrupt the countless loops, an intuitive manner is to carry out a complete rehash if this uncommon incident takes place. In practice, the high priced overhead of acting a rehashing operation can be dramatically decreased by using taking benefit of a very small extra regular-size space. In our proposed paper hashing involve collisions in which the stored buckets with one item will be reduced to probe the hash collision and query about the buckets. The enumerator that allocates each hash bucket will reduce the endless loops. As an accession we include intrusion detection and defense implementation (IDDI) that scrutinizes the hash and cache memory utilization efficiently. Cuckoo hashing is more prone to intrusion attack for which we alleviate such attacks by avoiding loops in buckets. Through detection and avoidance mechanism of intrusion we enhance the transmission in cuckoo hashing simultaneously by providing strong security towards its data.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80754528","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
扫码关注我们
求助内容：
应助结果提醒方式：