Pub Date : 2020-03-13DOI: 10.1504/ijcse.2020.10027618
Mrinal Goswami, Subrata Chattopadhyay, Shiv Bhushan Tripathi, B. Sen
The shrinking size of transistors for satisfying the increasing demand for higher density and low power has made the VLSI circuits more vulnerable to faults. Therefore, new circuits in advanced VLSI technology have forced designers to use fault tolerant techniques in safety-critical applications. Also, the presence of some faults (not permanent) due to the complexity of the nanocircuit or its interaction with software results in malfunctioning of circuits. The fault tolerant scheme, where majority voter plays the core role in triple modular redundancy (TMR), is being implemented increasingly in digital systems. This work targets to implement a different fault tolerant scheme of majority voter for the implementation of TMR using quantum-dot cellular automata (QCA), viable alternative nanotechnology to CMOS VLSI. The fault masking ability of various voter designs has been analysed in details. The fault masking ratio of the proposed voter (FMV) is 66% considering single/multiple faults. Simulation results establish the validation of proposed logic in QCA which targets nano-scale devices. The proposed logic is also suitable for conventional CMOS technology, which is verified with the Cadence tool.
{"title":"Design of fault tolerant majority voter for error resilient TMR targeting micro to nano scale logic","authors":"Mrinal Goswami, Subrata Chattopadhyay, Shiv Bhushan Tripathi, B. Sen","doi":"10.1504/ijcse.2020.10027618","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027618","url":null,"abstract":"The shrinking size of transistors for satisfying the increasing demand for higher density and low power has made the VLSI circuits more vulnerable to faults. Therefore, new circuits in advanced VLSI technology have forced designers to use fault tolerant techniques in safety-critical applications. Also, the presence of some faults (not permanent) due to the complexity of the nanocircuit or its interaction with software results in malfunctioning of circuits. The fault tolerant scheme, where majority voter plays the core role in triple modular redundancy (TMR), is being implemented increasingly in digital systems. This work targets to implement a different fault tolerant scheme of majority voter for the implementation of TMR using quantum-dot cellular automata (QCA), viable alternative nanotechnology to CMOS VLSI. The fault masking ability of various voter designs has been analysed in details. The fault masking ratio of the proposed voter (FMV) is 66% considering single/multiple faults. Simulation results establish the validation of proposed logic in QCA which targets nano-scale devices. The proposed logic is also suitable for conventional CMOS technology, which is verified with the Cadence tool.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804042","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 : 2020-03-13DOI: 10.1504/ijcse.2020.10027616
Yunji Li, Yi Gao, Quansheng Liu, Li Peng
This paper is concerned with the problem of fault estimation for stochastic state-delay systems subject to adversaries under an event-triggered data-transmission framework. An adversarial fault estimator is designed for remote state and fault estimation simultaneously. Furthermore, a sufficient condition is provided for exponential stability in the mean-squared of the proposed event-triggered fault estimator. The corresponding event-triggered sensor data transmission scheme is to reduce the overall communication burden. Finally, an application example on a DC motor system is presented and the benefits of the obtained theoretical results are demonstrated by comparative experiments.
{"title":"Event-triggered fault estimation for stochastic state-delay systems against adversaries with application to a DC motor system","authors":"Yunji Li, Yi Gao, Quansheng Liu, Li Peng","doi":"10.1504/ijcse.2020.10027616","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027616","url":null,"abstract":"This paper is concerned with the problem of fault estimation for stochastic state-delay systems subject to adversaries under an event-triggered data-transmission framework. An adversarial fault estimator is designed for remote state and fault estimation simultaneously. Furthermore, a sufficient condition is provided for exponential stability in the mean-squared of the proposed event-triggered fault estimator. The corresponding event-triggered sensor data transmission scheme is to reduce the overall communication burden. Finally, an application example on a DC motor system is presented and the benefits of the obtained theoretical results are demonstrated by comparative experiments.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125721647","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027422
P. A. A. Samad, P. R. Shalij
The better mixing of ingredients is the key to improving the quality of the process in the manufacturing of several products. Gyro Shaker is a dual rotation mixer commonly used for mixing highly viscous fluids. In this work, CFD simulation for the multiphase mixing of Gyro Shaker is carried out for obtaining numerical solutions. Simulations of three different mixing models namely Eulerian granular model, mixture model and volume of fluid (VOF) model are compared with each other. Reynolds number and power number based on characteristic velocity were derived for the Gyro Shaker. Experiments were conducted to validate the mixing power by the simulation using torque method and viscous dissipation method. The viscous dissipation method for mixing power demonstrates a low deviation from the experiment data than torque method. Among the three simulation models, the multiphase mixture model shows the minimum variation of the experimental data. A comparison of the flow field of the different mixing models is also carried out.
{"title":"Experimental investigation and CFD simulation of power consumption for mixing in Gyro Shaker","authors":"P. A. A. Samad, P. R. Shalij","doi":"10.1504/ijcse.2020.10027422","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027422","url":null,"abstract":"The better mixing of ingredients is the key to improving the quality of the process in the manufacturing of several products. Gyro Shaker is a dual rotation mixer commonly used for mixing highly viscous fluids. In this work, CFD simulation for the multiphase mixing of Gyro Shaker is carried out for obtaining numerical solutions. Simulations of three different mixing models namely Eulerian granular model, mixture model and volume of fluid (VOF) model are compared with each other. Reynolds number and power number based on characteristic velocity were derived for the Gyro Shaker. Experiments were conducted to validate the mixing power by the simulation using torque method and viscous dissipation method. The viscous dissipation method for mixing power demonstrates a low deviation from the experiment data than torque method. Among the three simulation models, the multiphase mixture model shows the minimum variation of the experimental data. A comparison of the flow field of the different mixing models is also carried out.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596822","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027435
A. Tewari, B. Gupta
Recently, various applications of internet of things have been developed for the healthcare sector. Our contribution is to provide a secure and low-cost environment for the IoT devices in healthcare. The main goal is to make patients' lives easier and comfortable by providing them with more effective treatments. Nevertheless, we also intend to address the issues related to location privacy and security due to the deployment of IoT devices. We have proposed a very simple mutual authentication protocol, which provides strong location privacy by using one way hash, pseudo random number generators and bitwise operations. Strong location privacy is a key factor while ensuring healthcare security. We can enforce this property by making sure that tags in the network are indistinguishable and the protocol ensures forward secrecy. The security strength of our protocol is verified through a formal proof model for location privacy.
{"title":"An internet-of-things-based security scheme for healthcare environment for robust location privacy","authors":"A. Tewari, B. Gupta","doi":"10.1504/ijcse.2020.10027435","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027435","url":null,"abstract":"Recently, various applications of internet of things have been developed for the healthcare sector. Our contribution is to provide a secure and low-cost environment for the IoT devices in healthcare. The main goal is to make patients' lives easier and comfortable by providing them with more effective treatments. Nevertheless, we also intend to address the issues related to location privacy and security due to the deployment of IoT devices. We have proposed a very simple mutual authentication protocol, which provides strong location privacy by using one way hash, pseudo random number generators and bitwise operations. Strong location privacy is a key factor while ensuring healthcare security. We can enforce this property by making sure that tags in the network are indistinguishable and the protocol ensures forward secrecy. The security strength of our protocol is verified through a formal proof model for location privacy.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121971202","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027436
Xiangfeng Luo, Lei Zhang, Yawen Yi, Ruirong Xue, D. Jiang
Recently, more and more users publish their views on events in social media. Identifying influential users in social media can help to analyse the impact of hot events or enterprise products in the real world. The existing mainstream methods are based on attribute analysis or network analysis. But attribute-based methods only select relatively simple characteristics without examining the event targeted properties; the network-based methods only use the user behaviour relation or the content association relation to build a network without considering the user attributes. Therefore, they cannot effectively calculate the user importance. This paper proposes a multi-angle user importance calculation method with event-specificity. In our method, the overall importance of a user is measured by taking the four levels within the user layer, the fan layer, the microblog layer, and the event layer into account. Experimental results show that our method can effectively calculate the importance of users.
{"title":"The key user discovery model based on user importance calculation","authors":"Xiangfeng Luo, Lei Zhang, Yawen Yi, Ruirong Xue, D. Jiang","doi":"10.1504/ijcse.2020.10027436","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027436","url":null,"abstract":"Recently, more and more users publish their views on events in social media. Identifying influential users in social media can help to analyse the impact of hot events or enterprise products in the real world. The existing mainstream methods are based on attribute analysis or network analysis. But attribute-based methods only select relatively simple characteristics without examining the event targeted properties; the network-based methods only use the user behaviour relation or the content association relation to build a network without considering the user attributes. Therefore, they cannot effectively calculate the user importance. This paper proposes a multi-angle user importance calculation method with event-specificity. In our method, the overall importance of a user is measured by taking the four levels within the user layer, the fan layer, the microblog layer, and the event layer into account. Experimental results show that our method can effectively calculate the importance of users.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125519449","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027426
Jian Shen, Tianqi Zhou, Lina Chen
Collaborative filtering algorithm is widely used in the recommendation system of e-commerce website, which is based on the analysis of a large number of users' historical behaviour data, so as to explore the users' interest and recommend the appropriate products to users. In this paper, we focus on how to design a reliable and highly accurate algorithm for movie recommendation. It is worth noting that the algorithm is not limited to film recommendation, but can be applied in many other areas of e-commerce. In this paper, we use Java language to implement a movie recommendation system in Ubuntu system. Benefiting from the MapReduce framework and the recommendation algorithm based on items, the system can handle large datasets. The experimental results show that the system can achieve high efficiency and reliability in large datasets.
{"title":"Collaborative filtering-based recommendation system for big data","authors":"Jian Shen, Tianqi Zhou, Lina Chen","doi":"10.1504/ijcse.2020.10027426","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027426","url":null,"abstract":"Collaborative filtering algorithm is widely used in the recommendation system of e-commerce website, which is based on the analysis of a large number of users' historical behaviour data, so as to explore the users' interest and recommend the appropriate products to users. In this paper, we focus on how to design a reliable and highly accurate algorithm for movie recommendation. It is worth noting that the algorithm is not limited to film recommendation, but can be applied in many other areas of e-commerce. In this paper, we use Java language to implement a movie recommendation system in Ubuntu system. Benefiting from the MapReduce framework and the recommendation algorithm based on items, the system can handle large datasets. The experimental results show that the system can achieve high efficiency and reliability in large datasets.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130506929","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027432
João Fabrício Filho, Luis Gustavo Araujo Rodriguez, A. F. Silva
Evolutionary algorithms are metaheuristics for solving combinatorial and optimisation problems. A combinatorial problem, important in the context of software development, consists of selecting code transformations that must be utilised by the compiler while generating the target code. The objective of this paper is to propose and evaluate an evolutionary algorithm that is capable of finding an efficient sequence of optimising transformations, which will be used while generating the target code. The results indicate that it is efficient to find good transformation sequences, and a good option to generate databases for machine learning systems.
{"title":"An evolutionary algorithm for finding optimisation sequences: proposal and experiments","authors":"João Fabrício Filho, Luis Gustavo Araujo Rodriguez, A. F. Silva","doi":"10.1504/ijcse.2020.10027432","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027432","url":null,"abstract":"Evolutionary algorithms are metaheuristics for solving combinatorial and optimisation problems. A combinatorial problem, important in the context of software development, consists of selecting code transformations that must be utilised by the compiler while generating the target code. The objective of this paper is to propose and evaluate an evolutionary algorithm that is capable of finding an efficient sequence of optimising transformations, which will be used while generating the target code. The results indicate that it is efficient to find good transformation sequences, and a good option to generate databases for machine learning systems.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125911209","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027425
Yuling Liu, Jiao Wu, Guojiang Xin
By combining big data with the characteristics of steganography, carrier-free steganography was proposed to resist all the steganalysis attacks. A novel method named multi-keywords carrier-free text steganography method based on Chinese Pinyin is introduced in this paper. In the proposed method, the hidden tags are selected from the Pinyin combinations of two words. In the process of information hiding, the part of speech (POS) is used for hiding the number of keywords. Also, the redundancy of hidden tags in extraction process is eliminated by ensuring the uniqueness of each hidden tag in each stego-text. Meanwhile, the way of joint retrieval is used for hiding multi-keywords. Experimental results show that the proposed method has good performance in the hiding capacity, the success rate of hiding, the extraction accuracy and the time efficiency with appropriate hidden tags and large-scale of the big text data.
{"title":"Multi-keywords carrier-free text steganography method based on Chinese Pinyin","authors":"Yuling Liu, Jiao Wu, Guojiang Xin","doi":"10.1504/ijcse.2020.10027425","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027425","url":null,"abstract":"By combining big data with the characteristics of steganography, carrier-free steganography was proposed to resist all the steganalysis attacks. A novel method named multi-keywords carrier-free text steganography method based on Chinese Pinyin is introduced in this paper. In the proposed method, the hidden tags are selected from the Pinyin combinations of two words. In the process of information hiding, the part of speech (POS) is used for hiding the number of keywords. Also, the redundancy of hidden tags in extraction process is eliminated by ensuring the uniqueness of each hidden tag in each stego-text. Meanwhile, the way of joint retrieval is used for hiding multi-keywords. Experimental results show that the proposed method has good performance in the hiding capacity, the success rate of hiding, the extraction accuracy and the time efficiency with appropriate hidden tags and large-scale of the big text data.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709044","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027428
Yunpeng Cao, Haifeng Wang
MapReduce is a typical computing model for processing and analysis of big data. MapReduce computing job produces a large amount of intermediate data after map phase. Massive intermediate data results in a large amount of intermediate data communication across rack switches in the Shuffle process of MapReduce computing model, this degrades the performance of heterogeneous cluster computing. In order to optimise the intermediate data communication performance of map-intensive jobs, the characteristics of pre-running scheduling information of MapReduce computing jobs are extracted, and job classification is realised by machine learning. The jobs of active intermediate data communication are mapped into a rack to keep the communication locality of intermediate data. The jobs with inactive communication are deployed to the nodes sorted by computing performance. The experimental results show that the proposed communication optimisation scheme has a good effect on Shuffle-intensive jobs, and can reach 4%–5%. In the case of larger amount of input data, the communication optimisation scheme is robust and can adapt to heterogeneous cluster. In the case of multi-user application scene, the intermediate data communication can be reduced by 4.1%.
{"title":"Communication optimisation for intermediate data of MapReduce computing model","authors":"Yunpeng Cao, Haifeng Wang","doi":"10.1504/ijcse.2020.10027428","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027428","url":null,"abstract":"MapReduce is a typical computing model for processing and analysis of big data. MapReduce computing job produces a large amount of intermediate data after map phase. Massive intermediate data results in a large amount of intermediate data communication across rack switches in the Shuffle process of MapReduce computing model, this degrades the performance of heterogeneous cluster computing. In order to optimise the intermediate data communication performance of map-intensive jobs, the characteristics of pre-running scheduling information of MapReduce computing jobs are extracted, and job classification is realised by machine learning. The jobs of active intermediate data communication are mapped into a rack to keep the communication locality of intermediate data. The jobs with inactive communication are deployed to the nodes sorted by computing performance. The experimental results show that the proposed communication optimisation scheme has a good effect on Shuffle-intensive jobs, and can reach 4%–5%. In the case of larger amount of input data, the communication optimisation scheme is robust and can adapt to heterogeneous cluster. In the case of multi-user application scene, the intermediate data communication can be reduced by 4.1%.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124753146","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 : 2020-03-06DOI: 10.1504/ijcse.2020.10027434
Dat Do, Scott A. King, A. Sheta, Thanh Pham
The goal of the ambient intelligence system is not only to enhance the way people communicate with the surrounding environment but also to advance safety measures and enrich human lives. In this paper, we introduce an integrated ambient intelligence system (IAmIS) to perceive the presence of people, identify them, determine their locations, and provide suitable interaction with them. The proposed framework can be applied in various application domains such as a smart house, authorisation, surveillance, crime prevention, and many others. The proposed system has five components: body detection and tracking, face recognition, controller, monitor system, and interaction modules. The system deploys RGB cameras and Kinect depth sensors to monitor human activity. The developed system is designed to be fast and reliable for indoor environments. The proposed IAmIS can interact directly with the environment or communicate with humans acting on the environment. Thus, the system behaves as an intelligent agent. The system has been deployed in our research lab and can recognise lab members and guests to the lab as well as track their movements and have interactions with them depending upon their identity and location within the lab.
{"title":"An integrated ambient intelligence system for a Smart Lab environment","authors":"Dat Do, Scott A. King, A. Sheta, Thanh Pham","doi":"10.1504/ijcse.2020.10027434","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027434","url":null,"abstract":"The goal of the ambient intelligence system is not only to enhance the way people communicate with the surrounding environment but also to advance safety measures and enrich human lives. In this paper, we introduce an integrated ambient intelligence system (IAmIS) to perceive the presence of people, identify them, determine their locations, and provide suitable interaction with them. The proposed framework can be applied in various application domains such as a smart house, authorisation, surveillance, crime prevention, and many others. The proposed system has five components: body detection and tracking, face recognition, controller, monitor system, and interaction modules. The system deploys RGB cameras and Kinect depth sensors to monitor human activity. The developed system is designed to be fast and reliable for indoor environments. The proposed IAmIS can interact directly with the environment or communicate with humans acting on the environment. Thus, the system behaves as an intelligent agent. The system has been deployed in our research lab and can recognise lab members and guests to the lab as well as track their movements and have interactions with them depending upon their identity and location within the lab.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125216906","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
扫码关注我们
求助内容：
应助结果提醒方式：