Pub Date : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943237
Arvinder Kaur, Diksha Dani, Gaurav Agrawal
Technology offers the potential to improve healthcare service delivery. The objective of healthcare website is to provide services and updated information at low cost to all the people regardless of their abilities and disabilities, which can reduce overcrowding in hospitals and reduce spread of disease. In a developing country like India, where hospitals are overcrowded, healthcare websites can play a major role in delivering updated healthcare services. Therefore, designing an effective healthcare website is becoming essential as numerous people are accessing the web for gathering information about hospitals and their healthcare services. There are no specific guidelines available for designing the health care website. So, it has become extremely important to evaluate hospital websites and address the design issues. The objective of this paper is to evaluate the accessibility, usability and security of hospitals websites in metro cities of India. Accessibility is evaluated using WCAG 2.0 accessibility guidelines, usability is evaluated using readability score and language analysis. Security analysis takes content management system into account.
{"title":"Evaluating the accessibility, usability and security of Hospitals websites: An exploratory study","authors":"Arvinder Kaur, Diksha Dani, Gaurav Agrawal","doi":"10.1109/CONFLUENCE.2017.7943237","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943237","url":null,"abstract":"Technology offers the potential to improve healthcare service delivery. The objective of healthcare website is to provide services and updated information at low cost to all the people regardless of their abilities and disabilities, which can reduce overcrowding in hospitals and reduce spread of disease. In a developing country like India, where hospitals are overcrowded, healthcare websites can play a major role in delivering updated healthcare services. Therefore, designing an effective healthcare website is becoming essential as numerous people are accessing the web for gathering information about hospitals and their healthcare services. There are no specific guidelines available for designing the health care website. So, it has become extremely important to evaluate hospital websites and address the design issues. The objective of this paper is to evaluate the accessibility, usability and security of hospitals websites in metro cities of India. Accessibility is evaluated using WCAG 2.0 accessibility guidelines, usability is evaluated using readability score and language analysis. Security analysis takes content management system into account.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"81 1","pages":"674-680"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82590601","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943128
Preeti Arora, Deepali Virmani, Shipra Varshney
Our research is based is to create implementations of two common clustering algorithms K-Means and Affinity Propagation. There are certain drawbacks of K-Means however the main drawback with this and the same kind of similar algorithms is in selecting some number of clusters, and choosing the initial set of points. Affinity Propagation locates exemplars between datum or data points or series points and thus forms clusters of this datum around these exemplars. After forming the groups it operates by simultaneously considering all d atum as probable exemplars and interchange messages between data points till a good set of exemplars and clusters appears. Finally, we have finish making an Affinity Propagation program which nearly supervene the details laid out because the affinity propagation has an aptness to form many clusters. Using these two programs we slandered a variety of one and two dimensional datasets, and we examined the results to confirm that Affinity Propagation produces clustering errors in involving competition with that of K-Means in an order of enormity less time.
{"title":"Substantiation of K-Means and Affinity Propagation algorithm","authors":"Preeti Arora, Deepali Virmani, Shipra Varshney","doi":"10.1109/CONFLUENCE.2017.7943128","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943128","url":null,"abstract":"Our research is based is to create implementations of two common clustering algorithms K-Means and Affinity Propagation. There are certain drawbacks of K-Means however the main drawback with this and the same kind of similar algorithms is in selecting some number of clusters, and choosing the initial set of points. Affinity Propagation locates exemplars between datum or data points or series points and thus forms clusters of this datum around these exemplars. After forming the groups it operates by simultaneously considering all d atum as probable exemplars and interchange messages between data points till a good set of exemplars and clusters appears. Finally, we have finish making an Affinity Propagation program which nearly supervene the details laid out because the affinity propagation has an aptness to form many clusters. Using these two programs we slandered a variety of one and two dimensional datasets, and we examined the results to confirm that Affinity Propagation produces clustering errors in involving competition with that of K-Means in an order of enormity less time.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"28 1","pages":"82-85"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82979095","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943138
Smriti Sehgal, Sushil Kumar, M. H. Bindu
Remotely sensed images have detailed stored information spreaded over many spectral bands coving full Electromagnetic spectrum. This information needs to be carefully extracted based on the type of segmentation one is doing or on the type of objects to be classified. In this paper, segmentation of high resolution image is done through bi-level and multi-level thresholding techniques. For bi-level, traditional OTSU method is used and Differential Evolution with OTSU technique as its objective function is used for multi-level thresholding. Segmented results with both the techniques are shown and it is clearly seen that differential evolution with OTSU method yield better results.
{"title":"Remotely sensed image thresholding using OTSU & differential evolution approach","authors":"Smriti Sehgal, Sushil Kumar, M. H. Bindu","doi":"10.1109/CONFLUENCE.2017.7943138","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943138","url":null,"abstract":"Remotely sensed images have detailed stored information spreaded over many spectral bands coving full Electromagnetic spectrum. This information needs to be carefully extracted based on the type of segmentation one is doing or on the type of objects to be classified. In this paper, segmentation of high resolution image is done through bi-level and multi-level thresholding techniques. For bi-level, traditional OTSU method is used and Differential Evolution with OTSU technique as its objective function is used for multi-level thresholding. Segmented results with both the techniques are shown and it is clearly seen that differential evolution with OTSU method yield better results.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"493 1","pages":"138-142"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77788423","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943182
Divya Upadhyay, Ashwani Kumar Dubey
Advancements in the applications of Wireless Sensor Networks such as tracking, surveillance, localizing, and so on, synchronization of sensor nodes clock time is very important. Therefore, in recent decades to synchronize the network lot of time synchronization protocols are available. These protocols give good precision in various ways. This paper discusses a sender-receiver protocol for which a proposed procedure for selecting the most probable clock offset is applied. The proposed procedure is based on the statistical tool of maximum probability theory.
{"title":"Statistical tool for clock offset selection in time synchronization protocols of Wireless Sensor Network","authors":"Divya Upadhyay, Ashwani Kumar Dubey","doi":"10.1109/CONFLUENCE.2017.7943182","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943182","url":null,"abstract":"Advancements in the applications of Wireless Sensor Networks such as tracking, surveillance, localizing, and so on, synchronization of sensor nodes clock time is very important. Therefore, in recent decades to synchronize the network lot of time synchronization protocols are available. These protocols give good precision in various ways. This paper discusses a sender-receiver protocol for which a proposed procedure for selecting the most probable clock offset is applied. The proposed procedure is based on the statistical tool of maximum probability theory.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"9 1","pages":"397-401"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78746364","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943195
S. Singal, N. Rakesh, Rakesh Matam
The distributed storage system maintains the data at multiple nodes in the network to provide faster access to data. In case of failure of one node the data is made available to the users from other nodes and the lost data can be recovered from the surviving nodes. Network coding plays an important role in managing the distributed data. Various coding mechanism like Replication, Erasure Coding, Local Reconstruction, Regeneration, Hybrid and Double Coding have been found beneficial for distributed storage systems. The parameters that make these approaches different from each other are storage requirement, repair bandwidth, node access, fault tolerance etc. This paper proposes a new approach that is capable of repairing the damages with minimum repair bandwidth and occupies less storage compared to other related approaches.
{"title":"Optimal storage and repair in distributed storage system","authors":"S. Singal, N. Rakesh, Rakesh Matam","doi":"10.1109/CONFLUENCE.2017.7943195","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943195","url":null,"abstract":"The distributed storage system maintains the data at multiple nodes in the network to provide faster access to data. In case of failure of one node the data is made available to the users from other nodes and the lost data can be recovered from the surviving nodes. Network coding plays an important role in managing the distributed data. Various coding mechanism like Replication, Erasure Coding, Local Reconstruction, Regeneration, Hybrid and Double Coding have been found beneficial for distributed storage systems. The parameters that make these approaches different from each other are storage requirement, repair bandwidth, node access, fault tolerance etc. This paper proposes a new approach that is capable of repairing the damages with minimum repair bandwidth and occupies less storage compared to other related approaches.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"35 1","pages":"461-465"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89213748","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943227
K. S. Kalsi, P. Rai
Gender classification and emotion detection plays an important role in the areas security. Gender classification and emotion detection aids in identification of a person by recognizing its gender (male/female) with their emotions (happy/sad) from the face image only. Individual works has been done in the Gender classification and emotion detection fields but not together. In this paper, we proposed a system to do detection of emotion and gender simultaneously for a specific face image. In this paper AIGLBP (Approximation image Gabor local binary pattern) is applied for feature extraction and SVM is used for classification. The number of experiments is initiated on a standard face image databases taken in controlled (FERET and INDIAN FACE) environment. The experimental results demonstrate that the proposed system is effective enough to give high performance in terms of speed and accuracy.
{"title":"A classification of emotion and gender using approximation image Gabor local binary pattern","authors":"K. S. Kalsi, P. Rai","doi":"10.1109/CONFLUENCE.2017.7943227","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943227","url":null,"abstract":"Gender classification and emotion detection plays an important role in the areas security. Gender classification and emotion detection aids in identification of a person by recognizing its gender (male/female) with their emotions (happy/sad) from the face image only. Individual works has been done in the Gender classification and emotion detection fields but not together. In this paper, we proposed a system to do detection of emotion and gender simultaneously for a specific face image. In this paper AIGLBP (Approximation image Gabor local binary pattern) is applied for feature extraction and SVM is used for classification. The number of experiments is initiated on a standard face image databases taken in controlled (FERET and INDIAN FACE) environment. The experimental results demonstrate that the proposed system is effective enough to give high performance in terms of speed and accuracy.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"24 1","pages":"623-628"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87452056","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943235
Parvendra Kumar, S. Chaudhary
In this paper, a novel approach of pade approximation has been proposed. Pade approximation is used to convert higher order model into a lower order model. In this reduction a deep analysis gives some new results about pade approximation and its pole placement. Therefore shifting the pole of higher order model, a novel approach has been proposed for the pole placement of reduced order model.
{"title":"Novel approach in classical pade approximation","authors":"Parvendra Kumar, S. Chaudhary","doi":"10.1109/CONFLUENCE.2017.7943235","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943235","url":null,"abstract":"In this paper, a novel approach of pade approximation has been proposed. Pade approximation is used to convert higher order model into a lower order model. In this reduction a deep analysis gives some new results about pade approximation and its pole placement. Therefore shifting the pole of higher order model, a novel approach has been proposed for the pole placement of reduced order model.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"548 1","pages":"667-670"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78893524","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943163
Fagmie Davids, J. Van Belle
Organizations are faced with business environments that rapidly change and are fiercely competitive. Information Technology (IT) can assist the organization to achieve business value, provided it is an enabler. The purpose of this paper is to investigate various business strategy categories, and align those to the various cloud computing options available to organizations may undertake. To achieve this objective, literature was reviewed to provide insight into cloud computing, organizational impacts, business strategies, the role IT plays within an organization, and finally the various strategic contributions cloud computing. The findings revealed that organizations adopting IT to achieve business value should at minimum consider the role of their management staff, the organizational agility, and the organizational culture. From a business strategy perspective it is important to understand the type of business strategy the organization is undertaking, its strategic position, and what execution strategy will be applied. Strategically, IT can assist in playing various roles and require an understanding of the organizational view of IT. This research enables a better understanding of how cloud computing can contribute towards business strategy; provides a consolidated view of consideration when adopting cloud computing within an organization; and insight into what level of strategic contribution each form of cloud computing option provides towards a business strategy.
{"title":"Understanding the business strategy factors that drive the business impacts of cloud computing","authors":"Fagmie Davids, J. Van Belle","doi":"10.1109/CONFLUENCE.2017.7943163","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943163","url":null,"abstract":"Organizations are faced with business environments that rapidly change and are fiercely competitive. Information Technology (IT) can assist the organization to achieve business value, provided it is an enabler. The purpose of this paper is to investigate various business strategy categories, and align those to the various cloud computing options available to organizations may undertake. To achieve this objective, literature was reviewed to provide insight into cloud computing, organizational impacts, business strategies, the role IT plays within an organization, and finally the various strategic contributions cloud computing. The findings revealed that organizations adopting IT to achieve business value should at minimum consider the role of their management staff, the organizational agility, and the organizational culture. From a business strategy perspective it is important to understand the type of business strategy the organization is undertaking, its strategic position, and what execution strategy will be applied. Strategically, IT can assist in playing various roles and require an understanding of the organizational view of IT. This research enables a better understanding of how cloud computing can contribute towards business strategy; provides a consolidated view of consideration when adopting cloud computing within an organization; and insight into what level of strategic contribution each form of cloud computing option provides towards a business strategy.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"9 1","pages":"281-287"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87635037","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943221
Kanwal Deep Kaur, P. Rai, P. Khanna
Recognizing the gender from the half face image is a challenging problem in the field of computer vision. This paper investigates the issue and proposes a gender classification system that works for full-face images to half face images. In this manuscript, a Discrete Wavelet Transform (DWT) followed by MMDA is used for feature extraction. The proposed approach uses DWT to gather the potential information from the face images. Support Vector Machine (SVM) and k-NN classifiers are used to finds the features that can discriminate between male and female. The proposed method is evaluated on FERET and FEI databases and the experimental result shows that the proposed technique achieves the gender classification target with more than 94% accuracy for both half face and full-face images.
{"title":"Gender classification system for half face images using multi manifold discriminant analysis","authors":"Kanwal Deep Kaur, P. Rai, P. Khanna","doi":"10.1109/CONFLUENCE.2017.7943221","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943221","url":null,"abstract":"Recognizing the gender from the half face image is a challenging problem in the field of computer vision. This paper investigates the issue and proposes a gender classification system that works for full-face images to half face images. In this manuscript, a Discrete Wavelet Transform (DWT) followed by MMDA is used for feature extraction. The proposed approach uses DWT to gather the potential information from the face images. Support Vector Machine (SVM) and k-NN classifiers are used to finds the features that can discriminate between male and female. The proposed method is evaluated on FERET and FEI databases and the experimental result shows that the proposed technique achieves the gender classification target with more than 94% accuracy for both half face and full-face images.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"21 1","pages":"595-598"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85741249","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 : 2017-01-01DOI: 10.1109/CONFLUENCE.2017.7943118
B. Saini, Navdeep Kaur, K. Bhatia
Keystroke dynamics is the study to identify/authenticate a person based on his/her typing rhythms, which are inferred from keystroke events like key-press and key-release. A lot of research work has been done in this field where the researchers have used either only alphabetic or alphanumeric or only numeric inputs. In this paper we address the question — What is the best possible numeric input for authentication using keystroke dynamics. We accomplished this by making the users enter four different numbers. Each number consisted of 8-digits. Out of these four numbers two were random numbers while the other two were formed using digits which had some pattern to them. Random Forest and Naive Bayes were used as classifiers. The results showed that using Random Forest classifier yielded best results when a random number is taken as input. The study also proved that a combination of hold time and latency as features yielded improved results. We achieved an average false acceptance rate of 2.7% and false rejection rate of 35.9%.
{"title":"Keystroke dynamics based user authentication using numeric keypad","authors":"B. Saini, Navdeep Kaur, K. Bhatia","doi":"10.1109/CONFLUENCE.2017.7943118","DOIUrl":"https://doi.org/10.1109/CONFLUENCE.2017.7943118","url":null,"abstract":"Keystroke dynamics is the study to identify/authenticate a person based on his/her typing rhythms, which are inferred from keystroke events like key-press and key-release. A lot of research work has been done in this field where the researchers have used either only alphabetic or alphanumeric or only numeric inputs. In this paper we address the question — What is the best possible numeric input for authentication using keystroke dynamics. We accomplished this by making the users enter four different numbers. Each number consisted of 8-digits. Out of these four numbers two were random numbers while the other two were formed using digits which had some pattern to them. Random Forest and Naive Bayes were used as classifiers. The results showed that using Random Forest classifier yielded best results when a random number is taken as input. The study also proved that a combination of hold time and latency as features yielded improved results. We achieved an average false acceptance rate of 2.7% and false rejection rate of 35.9%.","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"51 1","pages":"25-29"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73566391","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
扫码关注我们
求助内容：
应助结果提醒方式：