{"title":"A parallel approach for region-growing segmentation","authors":"A. Baby, K. Balachandran","doi":"10.1109/ICACEA.2015.7164694","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164694","url":null,"abstract":"Image Segmentations play a heavy role in areas such as computer vision and image processing due to its broad usage and immense applications. Because of the large importance of image segmentation a number of algorithms have been proposed and different approaches have been adopted. In this theme I tried to parallelize the image segmentation using a region growing algorithm. The primary goal behind this theme is to enhance performance or speed up the image segmentation on large volume image data sets, i.e. Very high resolution images (VHR). In parliamentary law to get the full advantage of GPU computing, equally spread the workload among the available threads. Threads assigned to individual pixels iteratively merge with adjacent segments and always ensuring the standards that the heterogeneity of image objects should be belittled. An experimental analysis upon different orbital sensor images has made out in order to assess the quality of results.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980628","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":"Task allocation on cloud resources using analytic network process","authors":"Atul Tripathi, Deo Prakash Vidyathi","doi":"10.1109/ICACEA.2015.7164847","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164847","url":null,"abstract":"Cloud resources are increasing enormously with the growth in cloud technology. Allocating the resources is a cumbersome job as multiple criteria are involved. These criteria most often are dependent on each other. Analytic Network Process is well suited to solve such problems as it caters to dependent criteria that often give the feedback. The work proposes a task allocation model using Analytic Network Process for cloud resources. The model has been simulated and quite good results are obtained.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121625418","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":"Dynamic composition of web services based on Qos parameters using fuzzy logic","authors":"Namrata Kashyap, Kirti Tyagi","doi":"10.1109/ICACEA.2015.7164808","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164808","url":null,"abstract":"Composition, the process of combining many constituent web-services representing a workflow, is one of the crucial research issues of Service Oriented Architecture. QOS parameters being the illustrious basis for the composition of webservices is the motivation for writing this paper. Since the selection of web-services among many of them with the overlapping functionality is a decision problem, to satisfy user's end-to-end QOS requirements. So, to provide a smart choice to service providers to choose the best services for composition, this paper is a stupendous contribution as it comes up with a membership function that easily prioritizes the candidate webservices with the similar functionality to a more finer level on the basis of their response time so as to get selected for the composition as well as maximizing the user's satisfaction.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127032643","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":"Smart intrusion detection system for MANET","authors":"N. Kashyap","doi":"10.1109/ICACEA.2015.7164690","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164690","url":null,"abstract":"Mobile Ad hoc networks (MANET) are infrastructure less networks which consist of self organized & self configured multihop nodes. The topology of these networks change with time. The nodes in the network not only act as routers but also as hosts. Two main issues in MANET are challenging namely, optimized routing and security. The approach followed in this paper suggests use of data mining techniques such as clustering and classification in developing intrusion detection system for MANET. We will use Zone routing protocol (ZRP) for packet flow which is hybrid in nature. Then various properties of the malicious, selfish and loyal nodes are used to identify the cluster heads. Cluster head is one of the loyal nodes which are having sufficient energy to transmit the message in the mobile Ad hoc networks and also guarantees successful transmission of data from source to destination.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127161515","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":"Pragmatic approaches to implement self-checking mechanism in UVM based TestBench","authors":"R. Madan, N. Kumar, Sujay Deb","doi":"10.1109/ICACEA.2015.7164768","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164768","url":null,"abstract":"Functional Verification of today's highly complex designs cannot rely simply on static verification techniques as these techniques are incapable of verifying modern complex digital designs. However, Simulation-Based Verification (SBV) which comes under dynamic verification approach can handle these complex systems. Among the various modern SBV approaches, Universal Verification Methodology (UVM) provides well established and flexible solution for complex system design verification. Flexibility of UVM lies in the fact that the verification environment developed using UVM consists of reusable components and is supported by tools of all major vendors of the industry. UVM provides a complete framework to achieve coverage driven verification that includes automatic test generation, self-checking testbenches and coverage metrics [1]. The self-checking capability provided by UVM is not very well defined and, hence, forces verification engineer to develop complex checking mechanism even for very small designs and also provides less resources for thorough checking of complex designs. In this paper, we will discuss implementation details of different kind of checking mechanisms that can be used along with UVM based verification environment to improve its capability of functional checking, protocol checking and reaching hidden bugs of the Design Under Verification (DUV).","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125113692","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}
Radhika Tayal, Shivani Saluja, T. Bedwal, A. Sardana
{"title":"Open data kit-use of smartphone technology for surveying","authors":"Radhika Tayal, Shivani Saluja, T. Bedwal, A. Sardana","doi":"10.1109/ICACEA.2015.7164749","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164749","url":null,"abstract":"Currently surveys are paper-based which are slow and even prone to errors. So to mitigate these problems it is useful to replace the work paper work with electronic devices such as smart phones, tablets, and laptops. To replace the paper forms with electronic devices such as smart phones or tablet, I used open data kit as an application and build a survey form for pregnant women. With the help of Open data Kit (ODK), it takes very less time and very less to prone errors. It helps us in development and improvement of the growth of notation and provides us the useful result.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114887084","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":"Fuzzy inference system & fuzzy cognitive maps based classification","authors":"Kanika Bhutani, Gaurav, Megha Kumar","doi":"10.1109/ICACEA.2015.7164720","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164720","url":null,"abstract":"Fuzzy classification is very necessary because it has the ability to use interpretable rules. It has got control over the limitations of crisp rule based classifiers. This paper mainly deals with classification on the basis of soft computing techniques fuzzy cognitive maps and fuzzy inference system on the lenses dataset. The results obtained with FIS shows 100% accuracy. Sometimes the data available for classification contain missing or ambiguous data so Neutrosophic logic is used for classification to deal with indeterminacy.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131450669","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":"PAPR improvement in cognitive radio using interleaved SC-FDMA","authors":"Ashish Sharma, Avinash Singh","doi":"10.1109/ICACEA.2015.7164825","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164825","url":null,"abstract":"Cognitive Radio has emerged as a promising solution to the spectral congestion problem so as to enable the opportunistic users to share the unoccupied portions of licensed frequency bands. For the purpose of spectrum pooling, OFDMA based multi-carrier techniques such as NC-OFDM offers a good choice due to flexibility in deactivating the subcarriers occupied by primary licensed users to avoid interference, but suffer from high PAPR, not desirable particularly at the user equipment (UE) end. Single Carrier FDMA with localized and interleaved mapping gives lower PAPR at the UE end in the uplink. While Interleaved SC-FDMA has least PAPR along with higher frequency diversity, it requires the free subcarriers to be in a certain pattern, i.e. equi-spaced which is not guaranteed in spectrum pooling due to the fact that the total number of free subcarriers and their locations might change continuously in a dynamic spectrum access network. In this paper, we propose a spectrum allocation algorithm that gives an optimum DFT size and the bandwidth spreading factor to decide the number of users that can be allocated depending on specified required spectral efficiency so that the UE can employ Interleaved SC-FDMA to improve PAPR performance at its transmitter. The simulation results show that the algorithm aims to find an optimum DFT size that balances the required spectral efficiency with significantly reduced PAPR at the UE end as compared to NC-OFDMA and localized SC-FDMA.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132492069","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":"An application of data mining to improve personnel performance evaluation in higher education sector in India","authors":"Mugdha Sharma, Ankit Goyal","doi":"10.1109/ICACEA.2015.7164755","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164755","url":null,"abstract":"Data mining is a process of extracting knowledge from large databases. Knowledge is appreciated as ultimate power now a days and considered as very important factor for the success of any organization because it has impacted the role of people working in that organization. In last decade, the higher education sector in India has grown radically. Thus HR management has implemented various improvements and it is hard for organizations to retain a motivated and competent workforce. Clever investment in human resource and its effective management has become very necessary today. HRM in higher education sector is further complicated by qualitative and multidimensional definition of “performance” of an academician (employee) in this sector. This paper aims to propose a model for predicting employee performance in higher education institutes with the help of classification and prediction techniques of data mining. The objective of model is to facilitate decisions in a challenging and emerging field of HRM in higher education sector.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132016906","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. Chakraverty, Bhawna Juneja, U. Pandey, Ashima Arora
{"title":"Dual lexical chaining for context based text classification","authors":"S. Chakraverty, Bhawna Juneja, U. Pandey, Ashima Arora","doi":"10.1109/ICACEA.2015.7164744","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164744","url":null,"abstract":"Text Classification enhances the accessibility and systematic organization of the vast reserves of data populatingthe world-wide-web. Despite great strides in the field, the domain of context driven text classification provides fresh opportunities to develop more efficient context oriented techniques with refined metrics. In this paper, we propose a novel approach to categorize text documents using a dual lexical chaining technique. The algorithm first prepares a cohesive category-keyword matrix by feeding category names into the WordNet and Wikipedia ontology, extracting lexically and semantically related keywords from them and then adding to the keywords by employing a keyword enrichment process. Next, the WordNet is referred again to find the degree of lexical cohesiveness between the tokens of a document. Terms that are strongly related are woven together into two separate lexical chains; one for their noun senses and another for their verb senses, that represent the feature set for the document. This segregation enables a better expression of word cohesiveness as concept terms and action terms are treated distinctively. We propose a new metric to calculate the strength of a lexical chain. It includes a statistical part given by Term Frequency-Inverse Document Frequency-Relative Category Frequency (TF-IDF-RCF) which itself is an improvement upon the conventional TF-IDF measure. The chain's contextual strength is determined by the degree of its lexical matching with the category-keyword matrix as well as by the relative positions of its constituent terms. Results indicate the efficacy of our approach. We obtained an average accuracy of 90% on 6 categories derived from the 20 News Group and the Reuters corpora. Lexical chaining has been applied successfully to text summarization. Our results indicate a positive direction towards its usefulness for text classification.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590521","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}