{"title":"A horizontal fat mesh interconnection network","authors":"Akash Punhani, Pardeep Kumar, Nitin","doi":"10.1109/IC3.2017.8284343","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284343","url":null,"abstract":"The mesh interconnection network is the most popular topology for the network on chip architecture. The horizontal fat mesh topology is designed to keep all the advantages of the mesh topologies prime of which is the almost wire area and the simplicity of the topology. The designed topology also does not have the non-planar links as present in most of the topologies which requires multiple layers. The performance of the topology has been tested on the uniform traffic for the latency, throughput and the power of the network. The topology has shown the improvement of in latency, throughput and power of network.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115952861","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":"Efficient design of full adder and subtractor using 5-input majority gate in QCA","authors":"Ramanand Jaiswal, T. Sasamal","doi":"10.1109/IC3.2017.8284336","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284336","url":null,"abstract":"Quantum dot cellular automata is the recent trend in the field of technology for the designing of any digital circuit involving inverters and majority gates that has the potential to substitute the age old technology of CMOS at the order of Nano level. Herein a full adder and full subtractor circuit is proposed using 5-input majority gate. The new full adder and subtractor reduced the requirement of occupied area, number of cells and energy dissipation. QCAPro tool is used for the calculation of energy dissipation. QCA designer 2.0.3 is used to design and simulate the circuits. A 4-bit ripple carry adder is also designed by one bit full adder.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836707","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":"Supporting collaborative software development in academic learning environment: A collaborative pair and quadruple programming based approach","authors":"R. Arora, S. Goel, R. Mittal","doi":"10.1109/IC3.2017.8284330","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284330","url":null,"abstract":"Collaborative Software Development (CSD) practices in software industry engage team of developers, to work over shared codebases hosted over distributed Configuration Management Systems. Several academicians and researchers have focused their efforts to inculcate these collaborative software development practices in engineering curriculum. In order to make this more effective, it is necessary that we replicate a similar environment, as existing in the software industry, and position it in the academic domain. A technology-enabled, teamoriented and collaboration-intensive environment facilitating structured collaborative programming practices is required to foster the collaborative programming competencies of students. In this paper, we propose a technology-enabled academic learning environment for promoting collaborative programming engagements of students. The collaborative activities of the students are structured as pairs and quadruples and are facilitated using the tool named Collaboration Over GitHub (COG). Real-time dashboards, combined with COG, facilitate monitoring and evaluation by teachers during collaborative programming activities. The environment also provides support for remote presence of teachers and students, facilitating remote laboratories, distance education, remote monitoring and evaluation and cross-university software development projects.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335266","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":"Neural network with multiple training methods for web service quality of service parameter prediction","authors":"L. Kumar, A. Sureka","doi":"10.1109/IC3.2017.8284307","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284307","url":null,"abstract":"Web services have several Quality of Service (QoS) properties. Some of the QoS parameters for web services are availability, response time, throughput, modularity, reliability, and interoperability. A client of a web service can have several web services with similar functionality but different QoS properties for application integration. QoS properties play a decisive factor in selecting the best web services from amongst services having similar functionality. Often QoS parameters are not available, not easy to compute or outdated. We present a method to estimate the QoS parameters of web services from the information contained in web service interfaces. We propose a method based on extracting several data, procedural and structural quantity metrics from the web service interfaces and using them as predictors for estimating the QoS properties. We apply neural network method with 6 different training methods for building a predictive model. Our results demonstrate that the proposed approach is effective. Our experimental results reveal that the structural quality metrics outperforms the procedural and data quality metrics in-terms of the RMSE (Root-Mean-Square Error) performance metric. We conclude that the NLM method (Neural Network with Levenberg-Marquardt training method) out performs five other popular neural network training methods.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131811294","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":"Implementation of Ciphertext Policy-Attribute Based Encryption (CP-ABE) for fine grained access control of university data","authors":"Shardha Porwal, S. Mittal","doi":"10.1109/IC3.2017.8284289","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284289","url":null,"abstract":"Ciphertext Policy-Attribute Based Encryption (CP-ABE) is an emerging encryption technology to address challenges of secure data sharing. In this paper, a CP-ABE based scheme has been implemented for fine grained access control of documents in a typical university setup. The documents are encrypted with an embedded access structure and can be decrypted by only those users whose attribute values satisfy the access structure defined for the document. Experimental simulations demonstrate the capability of proposed solution in providing real time encryption/ decryption services on varying number of attributes, file sizes and types.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123858640","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}
A. Nath, Ankit Khandelwal, A. Kanojia, Ishitva Minocha, R. Niyogi
{"title":"Design and implementation of an intelligent cab service system","authors":"A. Nath, Ankit Khandelwal, A. Kanojia, Ishitva Minocha, R. Niyogi","doi":"10.1109/IC3.2017.8284334","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284334","url":null,"abstract":"Cab booking service is a major transport service provided by the various transport operators in a particular city. Most of the people use cab service for their daily transportations need. More and more taxi companies are looking for integrated taxi booking systems as it makes life much easier for the customer as well for the company. Most of the existing online cabs booking systems use the centralized approach to search, find, and book the cab. The centralized approaches are highly prone to single point of failure. In this study, we design and implement the intelligent agents based distributed cab system for serving passengers using local information. The implementation and analysis of proposed approach are carried out by using a Java-based distributed multi-agent system framework — Java Agent DEvelopment Framework (JADE). Simulation results manifest that our approach is able to encounter the shortcomings of the centralized approach.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753107","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":"Fraud detection and frequent pattern matching in insurance claims using data mining techniques","authors":"Aayushi Verma, Anu Taneja, Anuja Arora","doi":"10.1109/IC3.2017.8284299","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284299","url":null,"abstract":"Fraudulent insurance claims increase the burden on society. Frauds in health care systems have not only led to additional expenses but also degrade the quality and care which should be provided to patients. Insurance fraud detection is quite subjective in nature and is fettered with societal need. This empirical study aims to identify and gauge the frauds in health insurance data. The contribution of this insurance claim fraud detection experimental study untangle the fraud identification frequent patterns underlying in the insurance claim data using rule based pattern mining. This experiment is an effort to assess the fraudulent patterns in the data on the basis of two criteria-period based claim anomalies and disease based anomalies. Rule based mining results according to both criteria are analysed. Statistical Decision rules and k-means clustering are applied on Period based claim anomalies outliers detection and association rule based mining with Gaussian distribution is applied on disease based anomalies outlier detection. These outliers depict fraud insurance claims in the data. The proposed approach has been evaluated on real-world dataset of a health insurance organization and results show that our proposed approach is efficient in detecting fraud insurance claim using rule based mining.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126007687","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":"Tension detection in online communities","authors":"Kriti Baindail, Pami Gupta, Parmeet Kaur","doi":"10.1109/IC3.2017.8284314","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284314","url":null,"abstract":"The use of online platforms to express views and opinions is creating an enormous amount of data from which relevant information may be extracted and utilized in a number of ways. This paper explores the use of this vast and readily available information for the cause of ensuring peace and harmony in the society. The work collects and analyzes the available online data to detect if tension in the society is aggravated due to a particular issue. The data set, consisting of tweets and comments on the news of an issue selected by the user, is given as an input to two types of classifiers, namely Naive Bayes and Support Vector Machine. The classifiers divide the documents into three classes, namely high tension low tension and moderate tension. These classes are given weights to identify and plot tension vs. time graphs. This system may be used by the police, social service agencies, policy makers, etc to determine the opinion of the masses on various issues and its effect on society.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418233","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":"MSD-Apriori: Discovering borderline-rare items using association mining","authors":"Shikhar Kesarwani, Astha Goel, Neetu Sardana","doi":"10.1109/IC3.2017.8284319","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284319","url":null,"abstract":"Ecommerce business constantly decides innovative strategies to increase their sales and hence earn profit. They mainly strive to boost the sale of those items that are rarely purchased. There are few borderline-rare items that lie just below the minimum support threshold and may have a strong correlation with frequent items. The minimum support threshold is the user-defined minimum support value for an item. If these borderlinerare items are strategically placed in the market then it can help the e-commerce industry to improve their sales further. In this paper, we propose a hybrid approach, MSD-Apriori to discover borderline-rare elements which are below but close to minimum support threshold and have strong correlation with frequent items. The hybrid approach is formed by integrating MS Apriori with Dynamic Apriori. MS Apriori finds the borderline-rare item sets from the web logs and Dynamic Apriori discovers those items among these that share strong correlation with the frequent items by association rule mining. The proposed method is evaluated on Kosarak, a real dataset that gives encouraging results.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121936130","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":"Network diffusion for information propagation in online social communities","authors":"Shubham Jain, Govind Mohan, Adwitiya Sinha","doi":"10.1109/IC3.2017.8284358","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284358","url":null,"abstract":"Analysis of online communities has pioneered extensive research initiatives towards impact of diffusion of information in online social network communities. There are various social analytical and mining techniques that assists in information propagation over online social networks. The main purpose behind diffusion is to spread the information in a social network in a less computational way which has been described in the proposed solution. For this purpose, our research involves community detection with centrality measures executed over nodes, i.e. social entities that assists in targeting advertising and anonymization over the social web. We detect communities from a social network using community detection algorithms, which is followed by identifying significant entities in those communities using centrality measures. This eventually helps to better track the spreading of information to maximum people in the connected network to promote better advertising of products or services, according to needs, preferences and search criteria.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261241","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}