{"title":"Identification of person or data using modified square blockwise approach","authors":"D. R. D. Braja, V. Dharun","doi":"10.1504/IJRIS.2019.10021319","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021319","url":null,"abstract":"Nowadays authentication is important to identify the originality of a person or document. Visual secret sharing scheme is one of the best methods to provide authentication without any complex computations. In this paper, we proposed novel method called modified square blockwise approach to generate shares. Here the personage photo or any biometric data can be used as an authenticated image. This approach will generate two shares, one share is printed on identity card and the other one is stored on database. To verify the originality of a document or a person, first receive the identity card and scan or take a photo of the share. Now this share is compared with the stored one, if it is reveal the authenticated image then it is accepted, otherwise simply rejected. This approach is used to authenticate any confidential data such as medical document, bank details and administration details also. Using this approach, we can restrict the use of confidential documents without knowing the originality of the document.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"465 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829419","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":"Analysis of heuristic-based multilevel thresholding methods for image segmentation using R programming","authors":"K. Suresh, U. Sakthi","doi":"10.1504/IJRIS.2019.10021327","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021327","url":null,"abstract":"The conventional way in analysing image segmentation algorithms manually is difficult since it requires a lot of human effort in keeping all data for analysis. Various heuristic algorithms are bundled with Otsu's and Kapur's objective function in finding optimal fitness and quality segmentation. In this work Otsu's and Kapur's objective function are bundled with heuristics such as harmony search optimisation (HSO) and electro magnetic optimisation (EMO) to compare the solution accuracy of segmented images In order to statistically analyse such algorithms, an automated tool is developed which takes an input image of any image category under consideration and extracts the segmented fitness values and quality parameters of the image. The extracted values are stored in a central database server constrained with image type, image category, methodology and heuristic used, no of thresholds and quality parameters. The central repository information is fed into data mining and data analytic tools to statistically rank the segmentation algorithms.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124648729","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 on contrastive opinion summarisation","authors":"S. Lavanya, B. Parvathavarthini","doi":"10.1504/IJRIS.2019.10021326","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021326","url":null,"abstract":"Contrastive opinion summarisation (COS) is jointly generating summaries for two entities in order to highlight their differences based on the features. COS comprises of feature extraction, Sentiment prediction and summarisation. Recently, the research focus in COS has been in using semantics associated with words and multi-word expressions to shift from syntactic to semantic level. This survey paper covers different methods used for feature extraction, various similarity measures and different types of summarisation. In addition to these, various datasets and performance measures are also addressed. Finally, future research directions are also suggested.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093281","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":"Aggregated clustering for grouping of users based on web page navigation behaviour","authors":"R. GeethaRamani, P. Revathy, L. Balasubramanian","doi":"10.1504/IJRIS.2019.10021328","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021328","url":null,"abstract":"In this epoch, a significant amount of patterns are retrieved using data mining techniques. Clustering is one of the technique that plays an vital role in web mining. This paper works on MSNBC dataset with the average access length of 6. It aims to cluster the users based on their navigation behaviour. An iterative aggregated clustering is proposed, in which various clustering algorithms like EM clustering, farthest first, K-means clustering, density based cluster, filtered cluster are applied on the dataset. The resultant clusters from various algorithms are aggregated correspondingly and the frequency of instances in each cluster is determined. Then the instance with two-third majority is grouped in that cluster. The work revealed that 91% of users clustered in the first iteration under 17 clusters and 99% of users in subsequent iterations in another 17 clusters and rest of the users are grouped as one cluster, resulting 35 hard clusters.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131436652","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":"Enhanced H-ABE-R and T-ABKS for cloud computing environment","authors":"Rachel Nallathamby, C. Robin","doi":"10.1504/IJRIS.2019.10021340","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021340","url":null,"abstract":"For a data owner (patient) wants to share his health data, data which is extremely sensitive in nature and when he wishes to maintain privacy it is common for data owners to encrypt the data. Sharing encrypted data leads to difficulties in key management (traditional PKI infrastructure). In the first half of our work, we propose an novel attribute-based encryption, a further extension of identity-based encryption that allows roles or policies to be defined over a set of attributes and propose a hybrid attribute-based encryption - with revocation (H-ABE-R) which is more suitable for multi-user hospital settings as it allows us to give permissions to access data for short periods of time. We then propose a time and attribute-based keyword search (T- ABKS). We check our algorithm and prove our scheme comparably efficient.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129689596","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}
Dakshinamurthy Sungeetha, G. Keerthana, K. Vijayakumar
{"title":"Design and implementation of finite state machine using quantum-dot cellular automata","authors":"Dakshinamurthy Sungeetha, G. Keerthana, K. Vijayakumar","doi":"10.1504/IJRIS.2019.10021331","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021331","url":null,"abstract":"Moore's law states that the number of transistors per square inch on integrated circuits has doubled approximately every two years; this is true for CMOS based VLSI circuit design. Quantum-dot cellular automata (QCA) replaces CMOS based VLSI technology. The assembly of quantum dots replaces transistors which is said to be 'quantum-dot cellular automata', an emerging nanotechnology in the field of quantum electronics. Such type of circuit can be used in many digital applications and has an advantage of reduced area utilisation. Quantum mechanics and cellular automata are together said to be QCA. QCA technology has advantages like small size and high speed. CMOS technology uses transistors to create a logic gates but in QCA technology, logic gates and wires are created by using QCA cells. The basic logic gates like AND, OR, inverter, majority gates are implemented. Many combinational and sequential circuits are designed by using these basic gates. This paper aims at the design of finite state machines and its use in vending machine and traffic light controller were discussed. The circuit was designed and the functionality of those was verified using QCADesigner tool.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200091","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":"Stimulated RR MAC protocol for power efficient wireless sensor networks","authors":"M. Kirubakaran, N. Sankarram","doi":"10.1504/IJRIS.2019.10021323","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021323","url":null,"abstract":"A wireless sensor network is a collection of sensor nodes scattered across a habitat of interest to collect crucial information from the habitat. The application of these networks is enormous, ranging from video surveillance, medical device monitoring, air traffic control, robot control, target monitoring, border protection, and disaster assessments, etc. Since the nodes in wireless sensor networks remain in the habitat for long duration, it is necessary they utilise the battery mounted onboard very efficiently. Research has grown along this area where in many protocols are being proposed in order to enable the nodes use the energy efficiently. This paper proposes one such protocol stimulated RR MAC protocol and discusses its benefits and performance over other existing protocols.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129882734","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":"Unified dynamic texture segmentation system based on local and global spatiotemporal techniques","authors":"S. Paygude, V. Vyas","doi":"10.1504/IJRIS.2019.10021329","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021329","url":null,"abstract":"Dynamic texture (DT) is temporal extension of static texture. There are two broad types of dynamic textures: natural and manmade. The examples of dynamic textures are waving tree, sea water, fountain, traffic, moving crowd, etc. Dynamic texture segmentation is a technique used to separate the moving objects from stationary content in the video. Majority of the techniques give good results either for natural or for manmade dynamic textures. The proposed approach for DT Segmentation is combination of local spatiotemporal technique, i.e., local binary pattern-Weber local descriptor and global spatiotemporal technique, i.e., contourlet transform. The local spatiotemporal technique considers the appearance and motion of the object for segmentation. The technique is computationally less complex than optical flow and gives good results for manmade dynamic textures. The global spatiotemporal technique is based on Laplacian pyramid and directional filters. It gives good results for natural dynamic textures. The proposed technique discussed in this paper is unified approach for any type of dynamic texture. The regions of images commonly segmented by both the techniques are considered as the final segmented output. The proposed system works equally well on any kind of dynamic texture.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126484203","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":"Students' performance analysis system using cumulative predictor algorithm","authors":"J. Rose, K. Vijayakumar, S. Sakthivel","doi":"10.1504/IJRIS.2019.10021324","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021324","url":null,"abstract":"Towards automation to do mundane tasks and the expectations for students already equipped with good programming skills is on the rise. In parallel, there has been a rising number of students who find it difficult to attain the skills necessary in order to get the dream IT job they desire. The aim of this project is to bridge the gap between the employer and the future employee of the company by the use of SPAS at college level. Student performance analysis system (SPAS) is an online web application system which enables students to know prior hand if their level of skills for the placement is enough to get placed or not, given the necessary inputs. SPAS has an intelligent learning algorithm which utilises a rich database, analyses the records of previous students' traits and develops a model for further prediction. The performance evaluation of students by SPAS is by the cumulative predictor algorithm involving generation of several random forest trees on the available data. SPAS learns and creates its model reaching higher accuracy with increasing data availability.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131634880","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":"Cloud platform load balancing based on bee colony algorithm","authors":"Fan Xue, Zhijian Wu","doi":"10.1504/IJRIS.2019.10019385","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10019385","url":null,"abstract":"In order to shorten the time needed to execute tasks in cloud system and maximise the utilisation of available resources in the system, this article proposes the cloud platform load balancing design under the background of bee colony algorithm (ABC algorithm). First of all, puts forward the designed mathematical model and then gives the basic algorithm of load balancing based on bee colony algorithm. In addition, in the design of the process, three experiments are respectively carried out. The first set of experiments results show that the result is stochastic and stable and the system overhead will affect the system performance; the second set of experiments results show that there is the presence of outliers, algorithm can guarantee the system to complete the system task implementation within a limited time and the system consumption continuously rises; the third set of experiments results show that the algorithm has stability and independence and the algorithm has stable efficiency in the range that the virtual machine can withstand; if it exceeds the range, the results will be unstable. Overall, the ABC algorithm has an effective implementation effect.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129672804","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}