In the present study multiple linear regression technique was used to carry out the downscaling of GCM predictors.The large scale GCM predictors were obtained from the Global Climate Model namely CGCM3 (Canadian Global Climate model) and were related to locally observed precipitation and temperature at Pahalgam meteorological station which is located in the Lidder River Basin.Appropriate predictandpredictor relationships were found out for the region by carrying out regression analysis. So the future projections of climate were made for the basin upto 21st century using CGCM3 model. At the end of the 21st century the mean annual temperature of theLidder river basin is predicted to increase by 1.91°C, whereas the average annual precipitation is predicted to decrease substantially by 27.56% using CGCM3 model.
{"title":"Statistical Downscaling Based On Multiple Linear Regression Analysis for Temperature and Precipitation inLidder River Basin of India","authors":"Mehnaza Akhter","doi":"10.9790/3021-0706015560","DOIUrl":"https://doi.org/10.9790/3021-0706015560","url":null,"abstract":"In the present study multiple linear regression technique was used to carry out the downscaling of GCM predictors.The large scale GCM predictors were obtained from the Global Climate Model namely CGCM3 (Canadian Global Climate model) and were related to locally observed precipitation and temperature at Pahalgam meteorological station which is located in the Lidder River Basin.Appropriate predictandpredictor relationships were found out for the region by carrying out regression analysis. So the future projections of climate were made for the basin upto 21st century using CGCM3 model. At the end of the 21st century the mean annual temperature of theLidder river basin is predicted to increase by 1.91°C, whereas the average annual precipitation is predicted to decrease substantially by 27.56% using CGCM3 model.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90832681","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}
Recommender system is a growing proliferation in today online applications contributed to the problems of Information overloading. In a day to day life enormous amount of data is generated and collected leads to a problem of information overloading. This paper focuses on how to deal with the problem of information overloading and how to recommend an additional product to the end user using collaborative filtering (CF) recommendation algorithms. The personalized recommendation algorithm with their benefits and limitations are described. A pitfall occurs in CF recommendation system is described. An outline framework is proposed for the initial stage of recommendation. A sample problem statement is framed to show how recommendation technology is embedded in to the framework.
{"title":"A Study on Ontology Based Collaborative Filtering Recommendation Algorithms in E-Commerce Applications","authors":"H. Mohana, M. Suriakala","doi":"10.9790/0661-1904011419","DOIUrl":"https://doi.org/10.9790/0661-1904011419","url":null,"abstract":"Recommender system is a growing proliferation in today online applications contributed to the problems of Information overloading. In a day to day life enormous amount of data is generated and collected leads to a problem of information overloading. This paper focuses on how to deal with the problem of information overloading and how to recommend an additional product to the end user using collaborative filtering (CF) recommendation algorithms. The personalized recommendation algorithm with their benefits and limitations are described. A pitfall occurs in CF recommendation system is described. An outline framework is proposed for the initial stage of recommendation. A sample problem statement is framed to show how recommendation technology is embedded in to the framework.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75445310","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}
This paper present a new bit redundancy coding for image compression in binary bit planar coding. In the compression model, images are coded into binary level to stream over a communication medium or to store the processed data in a remote location. In this processing, the representative coefficients are coded in binary level and to minimize the resource overhead these bits are compressed using binary compression logic. Among different coding logic, Huffman coding is the standard coding approach, standardized by JPEG and JPEG-2K image compression committee. The coding schemes computes a bit pattern occurrence probability and derive a allocating code word for a pattern to be compressed. The advantage of utilizing redundancy coding result in higher compression. However, the over-coding issue for lower pattern probability gives a inverse compression affect in image compression. In this paper, this issue is addressed an a new hybrid image coding approach developing a mixed model approach of variable entropy coding and fixed pattern allotment is proposed. The proposed hybrid approach termed “Selective Hybrid Coding” is used for the compression of medical samples and compared for performance evaluation to the conventional image compression model.
{"title":"Entropy Driven Bit Coding For Image Compression In Medical Application","authors":"S. Jagadeesh, E. Nagabhooshanam","doi":"10.9790/0661-1903035360","DOIUrl":"https://doi.org/10.9790/0661-1903035360","url":null,"abstract":"This paper present a new bit redundancy coding for image compression in binary bit planar coding. In the compression model, images are coded into binary level to stream over a communication medium or to store the processed data in a remote location. In this processing, the representative coefficients are coded in binary level and to minimize the resource overhead these bits are compressed using binary compression logic. Among different coding logic, Huffman coding is the standard coding approach, standardized by JPEG and JPEG-2K image compression committee. The coding schemes computes a bit pattern occurrence probability and derive a allocating code word for a pattern to be compressed. The advantage of utilizing redundancy coding result in higher compression. However, the over-coding issue for lower pattern probability gives a inverse compression affect in image compression. In this paper, this issue is addressed an a new hybrid image coding approach developing a mixed model approach of variable entropy coding and fixed pattern allotment is proposed. The proposed hybrid approach termed “Selective Hybrid Coding” is used for the compression of medical samples and compared for performance evaluation to the conventional image compression model.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72438762","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}
This paper applies wavelet analysis to speech compression. A mother or basis wavelet is first chosen for the compression. The signal is then decomposed to a set of scaled and translated versions of the mother wavelet. The resulting wavelet coefficients that are insignificant or close to zero are truncated achieving signal compression. Analysis of the compression process was performed by comparing the compressed-decompressed signal against the original. This was conducted to determine the effect of the choice of mother wavelet on the speech compression. The results however showed that regardless of bases wavelet used the compression ratio is relatively close to one another.
{"title":"Speech Compression Using Wavelet Transform","authors":"H. Petkar","doi":"10.9790/0661-1903063341","DOIUrl":"https://doi.org/10.9790/0661-1903063341","url":null,"abstract":"This paper applies wavelet analysis to speech compression. A mother or basis wavelet is first chosen for the compression. The signal is then decomposed to a set of scaled and translated versions of the mother wavelet. The resulting wavelet coefficients that are insignificant or close to zero are truncated achieving signal compression. Analysis of the compression process was performed by comparing the compressed-decompressed signal against the original. This was conducted to determine the effect of the choice of mother wavelet on the speech compression. The results however showed that regardless of bases wavelet used the compression ratio is relatively close to one another.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77394573","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}
Ambrose Kinyanjui Muchonjo, G. Wanyembi, C. Makori
The information age society is becoming highly dependent on technological advancements and in particular software platform and devices that can access the cyberspace. The way people acquire, access and share data, files and, information have significantly revolutionized peoples‟ social-technical interactions shaping their lifestyle and activities in regard to both the physical space and cyberspace. Ubiquitous computing for instance tends to offer digital society great, exciting, powerful features and capabilities that enable reliable and productive encounters within convenient environments. In ubiquitous environments however, there is high possibility of users‟ data, files and other users‟ digital assets being exposed to high risk of disclosure and tampering by iPredators. Such disclosure and tampering of users‟ sensitive data and information potentially exposes the targeted persons in society to many risks in regard to their digital and environmental security and privacy. In event of a successful iPredator‟s attacks on targets, the aftermath tend to be quite devastating sometimes leading to loss of lives, financial investments, critical data, human dignity and/or freedom. Dangers lurking in the cyberspace where there is increased usage of ICTs within a highly connected society of people and devices are therefore real and costly. The iPredators attack on users in cyberspace is a problem that requires cyber security awareness for users to address. To achieve this, this paper explored the various typologies of iPredators attacks targeting users in the cyberspace. The output of the study lead to a proposed framework by the researcher for preventing iPredators attacks on cyberspace. Desktop study research technique was adopted by the study which inclined to qualitative research design.
{"title":"An Investigation into Ipredation in Cyberspace towards Developing a Framework for Preventing Ipredators’ Attacks","authors":"Ambrose Kinyanjui Muchonjo, G. Wanyembi, C. Makori","doi":"10.9790/0661-1903052836","DOIUrl":"https://doi.org/10.9790/0661-1903052836","url":null,"abstract":"The information age society is becoming highly dependent on technological advancements and in particular software platform and devices that can access the cyberspace. The way people acquire, access and share data, files and, information have significantly revolutionized peoples‟ social-technical interactions shaping their lifestyle and activities in regard to both the physical space and cyberspace. Ubiquitous computing for instance tends to offer digital society great, exciting, powerful features and capabilities that enable reliable and productive encounters within convenient environments. In ubiquitous environments however, there is high possibility of users‟ data, files and other users‟ digital assets being exposed to high risk of disclosure and tampering by iPredators. Such disclosure and tampering of users‟ sensitive data and information potentially exposes the targeted persons in society to many risks in regard to their digital and environmental security and privacy. In event of a successful iPredator‟s attacks on targets, the aftermath tend to be quite devastating sometimes leading to loss of lives, financial investments, critical data, human dignity and/or freedom. Dangers lurking in the cyberspace where there is increased usage of ICTs within a highly connected society of people and devices are therefore real and costly. The iPredators attack on users in cyberspace is a problem that requires cyber security awareness for users to address. To achieve this, this paper explored the various typologies of iPredators attacks targeting users in the cyberspace. The output of the study lead to a proposed framework by the researcher for preventing iPredators attacks on cyberspace. Desktop study research technique was adopted by the study which inclined to qualitative research design.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85628241","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}
S. Sawant, V. Kamat, Vishal Snedan Robertson, Sneha Kamat, Anish Thali, Anuj Shetgaonkar
Data security has become a growing concern in this digital age. Current cryptographic algorithms either compromise on computational speed or data security. We put forth a variable key length 1024-bit symmetric cryptosystem which encrypts and decrypts text data in the form of 256-bit blocks at a time. It is fast as well secure and it is completely dependent on the key.
{"title":"RSA-A Symmetric Key Cryptosystem","authors":"S. Sawant, V. Kamat, Vishal Snedan Robertson, Sneha Kamat, Anish Thali, Anuj Shetgaonkar","doi":"10.9790/0661-1903035357","DOIUrl":"https://doi.org/10.9790/0661-1903035357","url":null,"abstract":"Data security has become a growing concern in this digital age. Current cryptographic algorithms either compromise on computational speed or data security. We put forth a variable key length 1024-bit symmetric cryptosystem which encrypts and decrypts text data in the form of 256-bit blocks at a time. It is fast as well secure and it is completely dependent on the key.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85818906","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}
Real time processing of image deals with applying all required operations within a range of time not exceed the acceptable time of human eyes. Real time processing does not realized on standalone computer, so it need special hardware. The big challenge of image processing work is the processing time, in which there are big amount of data (pixels) that must be processed at a specific time. The most important objective aspect of this work and any image processing algorithm (software or hardware) is how to implement it in an efficient way via the effective management of the scheduling of the processing jobs and time allocated for each job. This work try to avoid this problem by inserting a Raspberry Pi device which is working as microcomputer and has the ability to work with image, video, audio and data. Compensating between hardware and software is very important to achieve an efficient implemented system. This work mixing between hardware (Raspberry Pi device) and the software compression algorithm to reach acceptable low cost and high speed operated system. The synchronization between hardware and software leads to an efficient architecture that can achieve the real time processing.
{"title":"Hardware Implementation of a Real Time Image Compression","authors":"M. Al-Ani","doi":"10.9790/0661-1903050613","DOIUrl":"https://doi.org/10.9790/0661-1903050613","url":null,"abstract":"Real time processing of image deals with applying all required operations within a range of time not exceed the acceptable time of human eyes. Real time processing does not realized on standalone computer, so it need special hardware. The big challenge of image processing work is the processing time, in which there are big amount of data (pixels) that must be processed at a specific time. The most important objective aspect of this work and any image processing algorithm (software or hardware) is how to implement it in an efficient way via the effective management of the scheduling of the processing jobs and time allocated for each job. This work try to avoid this problem by inserting a Raspberry Pi device which is working as microcomputer and has the ability to work with image, video, audio and data. Compensating between hardware and software is very important to achieve an efficient implemented system. This work mixing between hardware (Raspberry Pi device) and the software compression algorithm to reach acceptable low cost and high speed operated system. The synchronization between hardware and software leads to an efficient architecture that can achieve the real time processing.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77942967","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}
Information mining came into the presence because of mechanical advances in numerous various controls. As it were, every one of the information on the planet are of no incentive without components to proficiently and successfully remove data and learning from them. In contrast with other information mining fields, visit design mining is a generally late improvement. This paper exhibits a novel approach through which the Apriori calculation can be progressed. The adjusted calculation presents elements time devoured in exchanges filtering for competitor itemsets and the quantities of tenets produced are additionally diminished. Catchphrases: Apriori, Frequent itemsets, Minimum Support, Confidence, Greedy Method.
{"title":"Extracting the Frequent Item Sets by Using Greedy Strategy in Hadoop","authors":"B. Veerendranadh, Mr. Manoj Kumar","doi":"10.9790/0661-1904018390","DOIUrl":"https://doi.org/10.9790/0661-1904018390","url":null,"abstract":"Information mining came into the presence because of mechanical advances in numerous various controls. As it were, every one of the information on the planet are of no incentive without components to proficiently and successfully remove data and learning from them. In contrast with other information mining fields, visit design mining is a generally late improvement. This paper exhibits a novel approach through which the Apriori calculation can be progressed. The adjusted calculation presents elements time devoured in exchanges filtering for competitor itemsets and the quantities of tenets produced are additionally diminished. Catchphrases: Apriori, Frequent itemsets, Minimum Support, Confidence, Greedy Method.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87747421","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}
{"title":"A Survey: Searching Techniques","authors":"M. S. Teli, Asst. Prof. Priti S. Subramanium","doi":"10.9790/0661-1903064748","DOIUrl":"https://doi.org/10.9790/0661-1903064748","url":null,"abstract":"","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83244871","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}
Ultrasonic vibration (UV) turning is a method with micro-scale high frequency vibration on the cutting tool to make the tool-workpiece interaction a periodically separation and the direction of the friction between tool and chip changed in each cycle of the ultrasonic vibration .The investigations show that the turning efficiency,the micro topography of machined surface can be improved and the ware of cutting tool, the deformation zone in a workpiece can be reduced by the application of the ultrasonic vibration machining. Finite element software simulation are performed on turning in this paper to clarify the advantages of applying tool ultrasonic vibration. The separation-contact process of ultrasonic vibration cutting and compare of ultrasonic vibration cutting force and normal cutting cutting force are studied.
{"title":"Investigations of Ultrasonic Vibration Turning","authors":"Zhang Jia-jia, D. Bang, H. Tao","doi":"10.9790/3021-0705015457","DOIUrl":"https://doi.org/10.9790/3021-0705015457","url":null,"abstract":"Ultrasonic vibration (UV) turning is a method with micro-scale high frequency vibration on the cutting tool to make the tool-workpiece interaction a periodically separation and the direction of the friction between tool and chip changed in each cycle of the ultrasonic vibration .The investigations show that the turning efficiency,the micro topography of machined surface can be improved and the ware of cutting tool, the deformation zone in a workpiece can be reduced by the application of the ultrasonic vibration machining. Finite element software simulation are performed on turning in this paper to clarify the advantages of applying tool ultrasonic vibration. The separation-contact process of ultrasonic vibration cutting and compare of ultrasonic vibration cutting force and normal cutting cutting force are studied.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89587217","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
扫码关注我们
求助内容：
应助结果提醒方式：