Pub Date : 2020-07-27DOI: 10.1108/ijpcc-09-2019-0067
S. Saravanan, P. Sudhakar
Purpose Telemedicine is delivered to patient anywhere during emergency treatment care, and medical information is transferred from one site of patient to another site of specialist doctors by using mobile internet communication. Some rural areas have slow internet speed because of weak internet signal propagation from mobile towers. A good design of antenna is needed to improve mobile internet speed for big medial data transmission in telemedicine application. Hence, this paper aims to propose economically low-cost design of antenna. Design/methodology/approach Telemedicine recommended to design the satellite frequency modulation dish (SAT FMD) antenna ( where in FM radio antenna, dish antenna are combined ) to improve the internet speed at Telemedicine system and Hospitals for purpose of Telemedicine communication and information for emergency treatment. Findings In the proposed system, designed SAT FMD satellite-based antenna improved internet speed is achieved at 90.6% accuracy in this research method. Finding latitude and longitude angles to identify the patient location, nearest hospitals location and finding distance, shortest path routing between patient and hospital. Finding elevation, Azimuth, latitude, longitude, skew for alignment dish to focus satellite and mobile cell tower to improve internet speed at telemedicine area and hospitals and reduced transmission delay and nodal delay of big medical data. Social implications The social awareness among people can be shared information of accident patient to communicate Hospital and Ambulance driver by internet mobile app tools and help find nearest hospitals to emergency treatment for accident people. Originality/value This paper presents SAT FMD antenna model based on satellite dish antenna consisting of FM radio receiver antenna and dish antenna for telemedicine communication.
{"title":"Telemedicine system using mobile internet communication","authors":"S. Saravanan, P. Sudhakar","doi":"10.1108/ijpcc-09-2019-0067","DOIUrl":"https://doi.org/10.1108/ijpcc-09-2019-0067","url":null,"abstract":"\u0000Purpose\u0000Telemedicine is delivered to patient anywhere during emergency treatment care, and medical information is transferred from one site of patient to another site of specialist doctors by using mobile internet communication. Some rural areas have slow internet speed because of weak internet signal propagation from mobile towers. A good design of antenna is needed to improve mobile internet speed for big medial data transmission in telemedicine application. Hence, this paper aims to propose economically low-cost design of antenna.\u0000\u0000\u0000Design/methodology/approach\u0000Telemedicine recommended to design the satellite frequency modulation dish (SAT FMD) antenna ( where in FM radio antenna, dish antenna are combined ) to improve the internet speed at Telemedicine system and Hospitals for purpose of Telemedicine communication and information for emergency treatment.\u0000\u0000\u0000Findings\u0000In the proposed system, designed SAT FMD satellite-based antenna improved internet speed is achieved at 90.6% accuracy in this research method. Finding latitude and longitude angles to identify the patient location, nearest hospitals location and finding distance, shortest path routing between patient and hospital. Finding elevation, Azimuth, latitude, longitude, skew for alignment dish to focus satellite and mobile cell tower to improve internet speed at telemedicine area and hospitals and reduced transmission delay and nodal delay of big medical data.\u0000\u0000\u0000Social implications\u0000The social awareness among people can be shared information of accident patient to communicate Hospital and Ambulance driver by internet mobile app tools and help find nearest hospitals to emergency treatment for accident people.\u0000\u0000\u0000Originality/value\u0000This paper presents SAT FMD antenna model based on satellite dish antenna consisting of FM radio receiver antenna and dish antenna for telemedicine communication.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2020-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/ijpcc-09-2019-0067","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62801961","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-06-04DOI: 10.1108/ijpcc-03-2020-0013
Mannar Mannan J., K. S., D. M, Parameswaran T.
Purpose The purpose of this paper aims to reduce the manpower, electricity, and water consumption for irrigation. Design/methodology/approach The IoT-based smart irrigation system designed with various sensors to collect farm field data, and stored all the data in the cloud for scheduling the irrigation. Findings This system reduces the water and electricity consumption, and labor cost. Research limitations/implications Difficult to implement on a small farm field with different crops. Practical implications Crop type, soil type and environment data should be considered for better saving of water. Social implications Reduces the water consumption, electricity, man power and increase production. Originality/value The soil type, crop type and environment data have been added before irrigation. The climate data also included before scheduling. Dynamic changing of irrigation timings based on the climate and sensor data.
{"title":"Smart scheduling on cloud for IoT-based sprinkler irrigation","authors":"Mannar Mannan J., K. S., D. M, Parameswaran T.","doi":"10.1108/ijpcc-03-2020-0013","DOIUrl":"https://doi.org/10.1108/ijpcc-03-2020-0013","url":null,"abstract":"\u0000Purpose\u0000The purpose of this paper aims to reduce the manpower, electricity, and water consumption for irrigation.\u0000\u0000\u0000Design/methodology/approach\u0000The IoT-based smart irrigation system designed with various sensors to collect farm field data, and stored all the data in the cloud for scheduling the irrigation.\u0000\u0000\u0000Findings\u0000This system reduces the water and electricity consumption, and labor cost.\u0000\u0000\u0000Research limitations/implications\u0000Difficult to implement on a small farm field with different crops.\u0000\u0000\u0000Practical implications\u0000Crop type, soil type and environment data should be considered for better saving of water.\u0000\u0000\u0000Social implications\u0000Reduces the water consumption, electricity, man power and increase production.\u0000\u0000\u0000Originality/value\u0000The soil type, crop type and environment data have been added before irrigation. The climate data also included before scheduling. Dynamic changing of irrigation timings based on the climate and sensor data.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81945619","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 : 2009-04-03DOI: 10.1108/17427370910950294
Yuan Liang, Guo Chang-guo, Zou Peng
Purpose – The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.Design/methodology/approach – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.Findings – Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.Research limitations/implications – All these experiments are based on high speed wireline network. For wireless network, the results may be different.Originality/value – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than...
{"title":"The subscription‐cover‐based routeing algorithm in content‐based publish/subscribe","authors":"Yuan Liang, Guo Chang-guo, Zou Peng","doi":"10.1108/17427370910950294","DOIUrl":"https://doi.org/10.1108/17427370910950294","url":null,"abstract":"Purpose – The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.Design/methodology/approach – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.Findings – Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.Research limitations/implications – All these experiments are based on high speed wireline network. For wireless network, the results may be different.Originality/value – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than...","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17427370910950294","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62091543","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 : 2008-05-25DOI: 10.1108/17427371011033299
J. Wang, F. Ali, P. Srimani
With the recent availability of large number of bioinformatics data sources, query from such databases and rigorous annotation of experimental results often use semantic frameworks in the form of an ontology. With the growing access to heterogeneous and independent data repositories, determining the semantic similarity or difference of two ontologies is critical in information retrieval, information integration and semantic web services. In this paper, a sense refinement algorithm is proposed to construct a refined sense set (RSS) for an ontology so that the senses (synonym words) in this refined sense set represent the semantic meanings of the terms used by this ontology. In addition, a semantic set that combines the refined sense set of ontology with the relationship edges connecting the terms in this ontology is proposed to represent the semantics of this ontology. With the semantic sets, measuring the semantic similarity or difference of two ontologies is simplified as comparing the commonality or difference of two sets. The experimental studies show that the proposed method of measuring the semantic similarity or difference of two ontologies is efficient and accurate.
{"title":"An efficient method to measure the semantic similarity of ontologies","authors":"J. Wang, F. Ali, P. Srimani","doi":"10.1108/17427371011033299","DOIUrl":"https://doi.org/10.1108/17427371011033299","url":null,"abstract":"With the recent availability of large number of bioinformatics data sources, query from such databases and rigorous annotation of experimental results often use semantic frameworks in the form of an ontology. With the growing access to heterogeneous and independent data repositories, determining the semantic similarity or difference of two ontologies is critical in information retrieval, information integration and semantic web services. In this paper, a sense refinement algorithm is proposed to construct a refined sense set (RSS) for an ontology so that the senses (synonym words) in this refined sense set represent the semantic meanings of the terms used by this ontology. In addition, a semantic set that combines the refined sense set of ontology with the relationship edges connecting the terms in this ontology is proposed to represent the semantics of this ontology. With the semantic sets, measuring the semantic similarity or difference of two ontologies is simplified as comparing the commonality or difference of two sets. The experimental studies show that the proposed method of measuring the semantic similarity or difference of two ontologies is efficient and accurate.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2008-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78291159","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 : 2008-04-04DOI: 10.1108/IJPCC.2008.36104AAA.001
S. Zeadally, Lu Yan
{"title":"Recent advances of wireless communication technologies for ubiquitous computing","authors":"S. Zeadally, Lu Yan","doi":"10.1108/IJPCC.2008.36104AAA.001","DOIUrl":"https://doi.org/10.1108/IJPCC.2008.36104AAA.001","url":null,"abstract":"","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2008-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62801302","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 : 2007-12-20DOI: 10.1108/17427370710847318
T. T. Tiow, C. Yingyi, Sun-Jin Yang
Purpose – To utilize the idle computational resources in a network to collectively solve middle to large problems, this paper aims to propose an integrated distributed computing platform, Java distributed code generating and computing (JDGC). Design/methodology/approach – The proposed JDGC is fully decentralized in that every participating host is identical in function. It allows standard, single machine‐oriented Java programs to be transparently executed in a distributed system. The code generator reduces the communication overhead between runtime objects based on a detailed analysis of the communication affinities between them. Findings – The experimental results show that JDGC can efficiently reduce the execution time of applications by utilizing the networked computational resources. Originality/value – JDGC releases the developers from any special programming considerations for distributed environment, and solves the portability problem of using system‐specific programming methods.
{"title":"JDGC: An integrated decentralized distributed computing platform for Java program","authors":"T. T. Tiow, C. Yingyi, Sun-Jin Yang","doi":"10.1108/17427370710847318","DOIUrl":"https://doi.org/10.1108/17427370710847318","url":null,"abstract":"Purpose \u0000 \u0000 \u0000 \u0000– To utilize the idle computational resources in a network to collectively solve middle to large problems, this paper aims to propose an integrated distributed computing platform, Java distributed code generating and computing (JDGC). \u0000 \u0000 \u0000 \u0000 \u0000Design/methodology/approach \u0000 \u0000 \u0000 \u0000– The proposed JDGC is fully decentralized in that every participating host is identical in function. It allows standard, single machine‐oriented Java programs to be transparently executed in a distributed system. The code generator reduces the communication overhead between runtime objects based on a detailed analysis of the communication affinities between them. \u0000 \u0000 \u0000 \u0000 \u0000Findings \u0000 \u0000 \u0000 \u0000– The experimental results show that JDGC can efficiently reduce the execution time of applications by utilizing the networked computational resources. \u0000 \u0000 \u0000 \u0000 \u0000Originality/value \u0000 \u0000 \u0000 \u0000– JDGC releases the developers from any special programming considerations for distributed environment, and solves the portability problem of using system‐specific programming methods.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2007-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17427370710847318","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62091528","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 : 2007-12-20DOI: 10.1108/ijpcc.2007.36103baa.001
D. Wei
{"title":"Special issue on computer and information technology in pervasive environments","authors":"D. Wei","doi":"10.1108/ijpcc.2007.36103baa.001","DOIUrl":"https://doi.org/10.1108/ijpcc.2007.36103baa.001","url":null,"abstract":"","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2007-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62801103","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 : 2006-08-01DOI: 10.1108/17427370810890409
Soo-Young Suk, Hyun-Yeol Chung
A Speech and Character Combined Recognition Engine (SCCRE) is developed for working on Personal Digital Assistants (PDA) or on mobile devices. In SCCRE, feature extraction from speech and character is carried out separately, but recognition is performed in an engine. The recognition engine employs essentially CHMM (Continuous Hidden Markov Model) structure and this CHMM consists of variable parameter topology in order to minimize the number of model parameters and reduce recognition time. This model also adopts our proposed SSMS (Successive State and Mixture Splitting) for generating context independent model. SSMS optimizes the number of mixtures through splitting in mixture domain and the number of states through splitting in time domain. When we applied our developed engine which adopts SSMS to speech recognition for mobile devices, SSMS can reduce total number of Gaussian up to 40.0% compared with the fixed parameter models at the same recognition performance. This leads that SSMS can reduce the size of memory for models to 65% and that for processing to 82%. Moreover, recognition time decreases 17% with SSMS model but still maintains the recognition rate.
{"title":"A speech and character combined recognition engine for mobile devices","authors":"Soo-Young Suk, Hyun-Yeol Chung","doi":"10.1108/17427370810890409","DOIUrl":"https://doi.org/10.1108/17427370810890409","url":null,"abstract":"A Speech and Character Combined Recognition Engine (SCCRE) is developed for working on Personal Digital Assistants (PDA) or on mobile devices. In SCCRE, feature extraction from speech and character is carried out separately, but recognition is performed in an engine. The recognition engine employs essentially CHMM (Continuous Hidden Markov Model) structure and this CHMM consists of variable parameter topology in order to minimize the number of model parameters and reduce recognition time. This model also adopts our proposed SSMS (Successive State and Mixture Splitting) for generating context independent model. SSMS optimizes the number of mixtures through splitting in mixture domain and the number of states through splitting in time domain. When we applied our developed engine which adopts SSMS to speech recognition for mobile devices, SSMS can reduce total number of Gaussian up to 40.0% compared with the fixed parameter models at the same recognition performance. This leads that SSMS can reduce the size of memory for models to 65% and that for processing to 82%. Moreover, recognition time decreases 17% with SSMS model but still maintains the recognition rate.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81790659","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 : 2005-08-01DOI: 10.1108/17427370580000125
Roman Y. Shtykh, Guozhen Zhang, Qun Jin
In this study, we propose and develop an opensource groupware system called NetIsle. NetIsle is a general purpose groupware system for uniform open groups that integrate a number of tools for online collaboration to ensure fast information exchange and sharing, increase the productivity of working groups, and reduce maintenance and administration costs. The main technologies used for the construction of the system are peer‐to‐peer (P2P) and push, which are best fitted to those principles and beliefs we build our system upon.
{"title":"Peer‐to‐peer solution to support group collaboration and information sharing","authors":"Roman Y. Shtykh, Guozhen Zhang, Qun Jin","doi":"10.1108/17427370580000125","DOIUrl":"https://doi.org/10.1108/17427370580000125","url":null,"abstract":"In this study, we propose and develop an opensource groupware system called NetIsle. NetIsle is a general purpose groupware system for uniform open groups that integrate a number of tools for online collaboration to ensure fast information exchange and sharing, increase the productivity of working groups, and reduce maintenance and administration costs. The main technologies used for the construction of the system are peer‐to‐peer (P2P) and push, which are best fitted to those principles and beliefs we build our system upon.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2005-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17427370580000125","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62091480","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 : 2005-02-01DOI: 10.1108/17427370580000110
R. V. Eijk, A. Salden, J. D. Heer, A. Peddemors, Petri Määttä, Ville Haataja
The increasing number of context aware services, which depend on various multimodal sensing, processing and actuating techniques, technologies and formats ask for a physical framework that is able to handle their heterogeneity. Thereto, we propose a context model bridging the semantic gaps between context aware services. In addition we propose a simple system architecture of Distribution Servers and Transformation Servers that bridge semantic gaps among context aware services. Applying our framework we solve the heterogeneity problem existing for location services. Location is typically a form of context where heterogeneity is a problem.
{"title":"Handling heterogeneity in context aware services","authors":"R. V. Eijk, A. Salden, J. D. Heer, A. Peddemors, Petri Määttä, Ville Haataja","doi":"10.1108/17427370580000110","DOIUrl":"https://doi.org/10.1108/17427370580000110","url":null,"abstract":"The increasing number of context aware services, which depend on various multimodal sensing, processing and actuating techniques, technologies and formats ask for a physical framework that is able to handle their heterogeneity. Thereto, we propose a context model bridging the semantic gaps between context aware services. In addition we propose a simple system architecture of Distribution Servers and Transformation Servers that bridge semantic gaps among context aware services. Applying our framework we solve the heterogeneity problem existing for location services. Location is typically a form of context where heterogeneity is a problem.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87294878","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
扫码关注我们
求助内容：
应助结果提醒方式：