Pub Date : 2014-03-01DOI: 10.1109/ICISCON.2014.6965217
S. B. Shirude, S. Kolhe
In the development of recommender system either the content or collaborative filtering is necessary. To filter the records it is required to measure the similarity between profile of user and items present in the dataset. This experiment is performed on the dataset containing 978 books related to computer science field and 7 users. Similarity between profile of user and contents of book is measured using Euclidean, Manhattan, Minkowski, Cosine distances. The results are evaluated and compared. This work is useful in the development of library recommender system.
{"title":"Measuring similarity between user profile and library book","authors":"S. B. Shirude, S. Kolhe","doi":"10.1109/ICISCON.2014.6965217","DOIUrl":"https://doi.org/10.1109/ICISCON.2014.6965217","url":null,"abstract":"In the development of recommender system either the content or collaborative filtering is necessary. To filter the records it is required to measure the similarity between profile of user and items present in the dataset. This experiment is performed on the dataset containing 978 books related to computer science field and 7 users. Similarity between profile of user and contents of book is measured using Euclidean, Manhattan, Minkowski, Cosine distances. The results are evaluated and compared. This work is useful in the development of library recommender system.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130245356","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 : 2014-03-01DOI: 10.1109/ICISCON.2014.6965224
G. Chauhan, M. K. Gupta, A. Khunteta
With the growth of trends in computing and requirement for developing a reliable computing environment the need for performing tasks in distributed manner has gained much importance. Atomic commit protocols (ACP) are used to preserve the ACID property in distributed systems. Two-Phase Commit (2PC) is most widely used but the blocking of sites is undesirable as these sites may be holding locks on the resources. As alternative, non-blocking ACP has been suggested: This nonblocking protocol is Three-Phase Commit (3PC) protocol which requires an extra phase (pre-commit) to remove blocking state. The existing protocols require so many messages transfer from the coordinator to participants and vice versa during different phases and corresponding increase communication and time complexity and hold the locks acquire by different participants till the end of last phase, forcing other transactions also to be blocked just because of the objects that are locked. All the existing protocols give the same performance for both deferred and immediate consistency constraints databases. Lots of protocols are being proposed and mainly the concentration was to make the 2PC protocol non-blocking or to minimize the blocking possibilities in 2PC. There has been a renewed interest in developing and optimization of more efficient ACPs. This paper is an effort to propose a new technique to optimize atomic commit protocols by optimizing voting phase based on deferred and immediate consistency constraints. Also an attempt has been made to propose reduction in communication complexity which will require less number of messages to be shared between coordinator and participants, the cost of execution as well as time delays.
{"title":"RC-OCP: Reverse coordinated optimized commit protocol","authors":"G. Chauhan, M. K. Gupta, A. Khunteta","doi":"10.1109/ICISCON.2014.6965224","DOIUrl":"https://doi.org/10.1109/ICISCON.2014.6965224","url":null,"abstract":"With the growth of trends in computing and requirement for developing a reliable computing environment the need for performing tasks in distributed manner has gained much importance. Atomic commit protocols (ACP) are used to preserve the ACID property in distributed systems. Two-Phase Commit (2PC) is most widely used but the blocking of sites is undesirable as these sites may be holding locks on the resources. As alternative, non-blocking ACP has been suggested: This nonblocking protocol is Three-Phase Commit (3PC) protocol which requires an extra phase (pre-commit) to remove blocking state. The existing protocols require so many messages transfer from the coordinator to participants and vice versa during different phases and corresponding increase communication and time complexity and hold the locks acquire by different participants till the end of last phase, forcing other transactions also to be blocked just because of the objects that are locked. All the existing protocols give the same performance for both deferred and immediate consistency constraints databases. Lots of protocols are being proposed and mainly the concentration was to make the 2PC protocol non-blocking or to minimize the blocking possibilities in 2PC. There has been a renewed interest in developing and optimization of more efficient ACPs. This paper is an effort to propose a new technique to optimize atomic commit protocols by optimizing voting phase based on deferred and immediate consistency constraints. Also an attempt has been made to propose reduction in communication complexity which will require less number of messages to be shared between coordinator and participants, the cost of execution as well as time delays.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132479102","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}
Mobile applications and services make things simpler fulfilling our daily needs for information, communication, entertainment or leisure. Mobile Applications have brought a new revolution. In this paper we provide one such mobile application “Agro-App” under development by us, which can lead to a healthy life. Agro-App is a mobile application built keeping the farmers in mind and also a common man who wants to grow vegetables for his daily need. It keeps a farmer updated with all the information related to crop, pesticides, insecticides, financial sector etc. It provides detailed information about which crop to grow in which season and which crop is suitable for that particular area in which the farmer is living. Government of India is spending millions of money to make ICT helpful for agriculture purpose but the hindrance is the literacy of farmers mobile being a common device now, with this application we aim to make it friendly for farmers.
{"title":"Agro App: An application for healthy living","authors":"Mayank Aggarwal, Apoorv Kaushik, Arpit Sengar, Aarju Gangwar, Ambuj Singh, V. Raj","doi":"10.1109/ICISCON.2014.6965213","DOIUrl":"https://doi.org/10.1109/ICISCON.2014.6965213","url":null,"abstract":"Mobile applications and services make things simpler fulfilling our daily needs for information, communication, entertainment or leisure. Mobile Applications have brought a new revolution. In this paper we provide one such mobile application “Agro-App” under development by us, which can lead to a healthy life. Agro-App is a mobile application built keeping the farmers in mind and also a common man who wants to grow vegetables for his daily need. It keeps a farmer updated with all the information related to crop, pesticides, insecticides, financial sector etc. It provides detailed information about which crop to grow in which season and which crop is suitable for that particular area in which the farmer is living. Government of India is spending millions of money to make ICT helpful for agriculture purpose but the hindrance is the literacy of farmers mobile being a common device now, with this application we aim to make it friendly for farmers.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372195","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 : 2014-03-01DOI: 10.1109/ICISCON.2014.6965210
Syed Imran Ali, P. Singh, Sameer Jain
This paper presents a user alertness identification system based on fatigue detection. The user may be a person like computer operator, operating critical operations on distant machines, hands free interaction with computational devices/machines, controlling heavy machineries like cranes or performing time critical operations like air traffic controlling etc. Same system can also be employed to detect and notifying the driver vigilance level and hence to avoid possibility of road accidents. The proposed system uses the time-efficient image processing techniques to measure eyes closer count, blinking rate of eye and user yawning as the parameters to conclude user's fatigue. The proposed system continuously captures the image of the subject on site using web camera and detects face region, then focuses on eyes and lips using efficient image processing techniques to monitor their behavior. If abnormality either in behavior of eyes or mouth is detected, it indicates that the subject is falling asleep or having state of drowsiness therefore fatigue is detected and a warning alarm is generated.
{"title":"An efficient system to identify user attentiveness based on fatigue detection","authors":"Syed Imran Ali, P. Singh, Sameer Jain","doi":"10.1109/ICISCON.2014.6965210","DOIUrl":"https://doi.org/10.1109/ICISCON.2014.6965210","url":null,"abstract":"This paper presents a user alertness identification system based on fatigue detection. The user may be a person like computer operator, operating critical operations on distant machines, hands free interaction with computational devices/machines, controlling heavy machineries like cranes or performing time critical operations like air traffic controlling etc. Same system can also be employed to detect and notifying the driver vigilance level and hence to avoid possibility of road accidents. The proposed system uses the time-efficient image processing techniques to measure eyes closer count, blinking rate of eye and user yawning as the parameters to conclude user's fatigue. The proposed system continuously captures the image of the subject on site using web camera and detects face region, then focuses on eyes and lips using efficient image processing techniques to monitor their behavior. If abnormality either in behavior of eyes or mouth is detected, it indicates that the subject is falling asleep or having state of drowsiness therefore fatigue is detected and a warning alarm is generated.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132502877","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 : 2014-03-01DOI: 10.1109/ICISCON.2014.6965220
Manvi, A. Dixit, K. Bhatia, Bhumika Wadhwa
Tremendous information present on the Internet is available only when the user type set of keywords for search for getting the result pages. Those pages are often referred as Hidden Web. The components like hidden Web crawler which wants to retrieve this hidden information has to fill the search interfaces automatically. For automatically filling these types of interfaces precise and relevant information is needed. A database that stores semantic information about objects and their relations may solve this purpose. This database can be defined with the help of Ontology defines common vocabulary. The work presented here mainly focuses on generating domain specific ontology for retrieving hidden Web contents. In this paper a knowledge base of Book domain has created using Protégé. All information stores as knowledge base in form of RDF triples <;subject predicate object>. This Knowledge base may be used in automatically filling up search interfaces for retrieving hidden Web data.
{"title":"Generating domain specific ontology for retrieving Hidden Web contents","authors":"Manvi, A. Dixit, K. Bhatia, Bhumika Wadhwa","doi":"10.1109/ICISCON.2014.6965220","DOIUrl":"https://doi.org/10.1109/ICISCON.2014.6965220","url":null,"abstract":"Tremendous information present on the Internet is available only when the user type set of keywords for search for getting the result pages. Those pages are often referred as Hidden Web. The components like hidden Web crawler which wants to retrieve this hidden information has to fill the search interfaces automatically. For automatically filling these types of interfaces precise and relevant information is needed. A database that stores semantic information about objects and their relations may solve this purpose. This database can be defined with the help of Ontology defines common vocabulary. The work presented here mainly focuses on generating domain specific ontology for retrieving hidden Web contents. In this paper a knowledge base of Book domain has created using Protégé. All information stores as knowledge base in form of RDF triples <;subject predicate object>. This Knowledge base may be used in automatically filling up search interfaces for retrieving hidden Web data.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123570656","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}
ZigBee is the most powerful standard for wireless sensor network. Pre-emptive Distributed Address Assignment (PDAA) Mechanism used to improves Zig-Bee address assignment and PDAA Mechanism Presents an auto-routing mechanism which doesn't store any information into routing table. There are two types of devices such as router and end device. But in ZigBee & PDAA mechanism has a problem that there is parent & child relationship i.e. packet follow Tree topology to forward the packet from source to destination and second problem is address reuse mechanism. So, This Paper Proposes a Hybrid routing scheme to reduce the routing cost by using the neighbor table that is originally defined in the ZigBee standard and Provide address reuse facility. In ZigBee and PDAA mechanism address reuse facility is a main issue so by using AODV routing protocol is used to provide address reuse facility.
{"title":"Hybrid addressing scheme for preemptive distributed address mechanism","authors":"Ketki P. Kardile-gawali, V. Kimbahune","doi":"10.5120/14563-2671","DOIUrl":"https://doi.org/10.5120/14563-2671","url":null,"abstract":"ZigBee is the most powerful standard for wireless sensor network. Pre-emptive Distributed Address Assignment (PDAA) Mechanism used to improves Zig-Bee address assignment and PDAA Mechanism Presents an auto-routing mechanism which doesn't store any information into routing table. There are two types of devices such as router and end device. But in ZigBee & PDAA mechanism has a problem that there is parent & child relationship i.e. packet follow Tree topology to forward the packet from source to destination and second problem is address reuse mechanism. So, This Paper Proposes a Hybrid routing scheme to reduce the routing cost by using the neighbor table that is originally defined in the ZigBee standard and Provide address reuse facility. In ZigBee and PDAA mechanism address reuse facility is a main issue so by using AODV routing protocol is used to provide address reuse facility.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115470633","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
扫码关注我们
求助内容：
应助结果提醒方式：