Jamuna K, Yugin L. Selva, Gnanasekaran, Asso. Professor
{"title":"Placement of PMUs for Power System Observability Using Biogeography Based Optimization","authors":"Jamuna K, Yugin L. Selva, Gnanasekaran, Asso. Professor","doi":"10.1109/ICACC.2013.76","DOIUrl":"https://doi.org/10.1109/ICACC.2013.76","url":null,"abstract":"This paper presents a robust and optimal Phasor Measurement Unit (PMU) placement scheme for real time power system monitoring under both normal and contingency cases. The single branch outage and single PMU loss are considered as contingencies. Initially the Virtual Node Reduction Technique (VNRT) is applied to reduce the system nodes. The virtual nodes are neither physically present nor suitable for PMU placement. Then, the optimal PMUs are obtained using Biogeography Based Optimization (BBO) with the reduced system nodes. In the PMU placement study, the virtual node reduction technique is applied for reducing the scale of the system. Developed placement algorithm is illustrated using IEEE standard systems to demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864325","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":"Workflow Model for Distributed Access Control","authors":"Manoj V. Thomas, K. Sekaran","doi":"10.1109/ICACC.2013.78","DOIUrl":"https://doi.org/10.1109/ICACC.2013.78","url":null,"abstract":"In the distributed computing environments like cloud computing or service computing, users access various services and shared resources hosted by the service providers, to achieve their tasks done efficiently. Authentication and authorization are the two important functions to be performed in this context, to make sure that unauthorized users do not access the distributed system components. In this paper, we analyse the various distributed access control approaches already adopted in this area, considering the advantages and the disadvantages. We propose a distributed access control architecture for the cloud computing paradigm considering the present day requirements of the service consumers and service providers. We also give the workflow model for the proposed distributed access control system in the cloud. A few open issues in the area of distributed access control are also discussed.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130256766","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}
N. Das, A. Pal, Sanjoy Mazumder, Somenath Sarkar, D. Gangopadhyay, M. Nasipuri
{"title":"An SVM Based Skin Disease Identification Using Local Binary Patterns","authors":"N. Das, A. Pal, Sanjoy Mazumder, Somenath Sarkar, D. Gangopadhyay, M. Nasipuri","doi":"10.1109/ICACC.2013.48","DOIUrl":"https://doi.org/10.1109/ICACC.2013.48","url":null,"abstract":"Researches on identification of Skin diseases from the digital images are increasing due to multidimensional challenges of the domain. Most of the researches are based upon the freely available digital images from the internet instead of real ground truth data set. To address these problems, we first created a ground truth dataset consisting of 876 images of human skin affected with three prevalent skin diseases of the Indian subcontinent (viz. leprosy, tineaversicolor and vitiligo collected from the patients) together with normal skin and then developed a mechanism to recognize them automatically. It is worthy to mention here, leprosy, vitiligo (at early stage) and tineaversicolor are hypo pigmenting disorders and very similar in lesion shape and color. All the images are divided randomly into train and test sets, approximately in the ratio 4:1 for each class. For recognition of the diseases from the skin images different popular texture and frequency domain features such as Local Binary Pattern(LBP), Gray Level Co-occurrences Matrix (GLCM), Discrete Cosine Transform (DCT) and Discrete Fourier Transform (DFT) have been used with Support Vector Machines (SVM) based classifiers. Maximum recognition accuracies of 89.65% has been observed on test set using the LBP feature set. To the best of our knowledge this is the first automated noninvasive system to identify the three important skin diseases from digital images of the affected skin regions.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287197","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":"Prioritization of Messages on Community Based and Non Community Based Protocols in DTN","authors":"Anmol Aggarwal, P. Nagrath","doi":"10.1109/ICACC.2013.20","DOIUrl":"https://doi.org/10.1109/ICACC.2013.20","url":null,"abstract":"A Delay Tolerant Network (DTN) is characterised as partitioned networks with absence of end to- end connectivity and therefore conventional routing techniques applicable to MANET cannot be applied. DTN have found to be useful in number of application areas where prioritization of messages is essential. We have worked with prioritization of messages considering minimum consumption of network resources such as Buffer size and TTL. Two routing algorithms, Prophet and DSG are used for the implementation of the algorithm. The results show that highest priority messages are delivered more when the buffer and TTL is minimum as compared to low priority messages.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130495397","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":"DCA: An Approach for Face Recognition through Component Analysis","authors":"P. Shamna, C. Tripti, P. Augustine","doi":"10.1109/ICACC.2013.14","DOIUrl":"https://doi.org/10.1109/ICACC.2013.14","url":null,"abstract":"The developments in digital technologies is enhancing the communication between computers and Human. Face recognition is a vital technique that helps to develops user-friendly methods for Human Computer Interaction (HCI). In this paper we suggest a pattern recognition method using Difference Component Analysis (DCA) and present its application in face recognition. The DCA removes all the general features of images and compute the difference components of the images. The DCA is based on the principle that two similar images will have least difference components. Simulation of DCA is done by using Yale face database and AT&T face database. The experimental results indicate that, the presented approach is remarkably effective in recognizing faces under different conditions.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127848157","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":"OFDM Channel Estimation Using Compressed Sensing L1-Regularized Least Square Problem Solver","authors":"Vijitha Rajan, Arun A. Balakrishnan, K. Nissar","doi":"10.1109/ICACC.2013.24","DOIUrl":"https://doi.org/10.1109/ICACC.2013.24","url":null,"abstract":"Compressed Sensing is an emerging methodology to reconstruct signals with smaller number of projections. Nyquist rate yields too many samples, which is high for broadband signals that are used in many applications. The proposed method unveils the application of compressed sensing in the channel estimation of Orthogonal Frequency Division Multiplexing (OFDM). ℓ1-regularized Least square problem solver method is used as compressive sensing algorithm. Existing methods like Least square (LS) estimator and Minimum Mean Square Error (MMSE) estimator implementation has more complex formulations and utilizes many samples making the implementation cost of sensor to increase drastically. Results of the proposed method is compared with the existing MMSE method. The proposed compressed sensing approach in OFDM channel estimation results in good accuracy and less implementation cost.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121373002","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":"Demand Based Data Replication in MANETs","authors":"K. Priya, Mujeebudheen Khan, K. Preetha","doi":"10.1109/ICACC.2013.94","DOIUrl":"https://doi.org/10.1109/ICACC.2013.94","url":null,"abstract":"Mobile Ad-hoc Network (MANET) is an emerging research area as it utilizes a diversity of applications. MANET is a self configuring network with dynamic topology. The network does not have any permanent infrastructure and the network can be formed on the fly. The mobile nodes in the network move frequently and the topology changes dynamically. So there is a chance of frequent network partitions. The node in one partition cannot access data items from a node in another partition. To improve data availability the data in the nodes should be replicated at various nodes. There are various data replication techniques available in MANETs. This paper focuses on the data replication by reserving storage space for the most demanded data item. This also includes the selection of a node and selection of a data item for replication. Thus the data availability can be improved since there are multiple replicas in the network and the possibility of finding one copy of data item is higher.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117158450","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":"Towards Efficient and Secure Cloud","authors":"Tarek Radwan, Marianne A. Azer, Nashwa Abdelbaki","doi":"10.1109/ICACC.2013.34","DOIUrl":"https://doi.org/10.1109/ICACC.2013.34","url":null,"abstract":"Cloud computing is becoming more and more popular. It is increasing in popularity with companies as it enables them to share various resources in a cost effective way. Cloud computing has lots of advantages, however some issues need to be handled before organizations and individuals have the confidence to rely on it. Security and privacy are at the forefront of these important issues. In this paper, the evolution of cloud computing along with its deployment and delivery models are highlighted. Also, the difference between cloud computing and other deployment models are discussed. We present different security threats and propose some countermeasures. In addition, we discuss cloud computing security trends.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514519","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":"Multidimensional Data Mining for Anomaly Extraction","authors":"Pratima R. Patil, M. Bhamare","doi":"10.1109/ICACC.2013.8","DOIUrl":"https://doi.org/10.1109/ICACC.2013.8","url":null,"abstract":"Due to heavy traffic the network monitoring is very difficult and cumbersome job, hence the probability of network attacks increases substantially. So there is the need of extraction anomalies. Anomaly extraction means to find flows associated with the anomalous events, in a large set of flows observed during an anomalous time interval. Anomaly extraction is very important for root-cause analysis, network forensics, attack mitigation and anomaly modeling. To identify the suspicious flows, we use meta-data provided by several histogram based detectors and then apply association rule with multidimensional mining concept to find and summarize anomalous flows. By taking rich traffic data from a backbone network, we show that our technique effectively finds the flows associated with the anomalous events. So by applying multidimensional mining rule to extract anomaly, we can reduce the work-hours needed for analyzing alarms and making anomaly systems more effective.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131128456","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":"Prediction of Missing Items Using Naive Bayes Classifier and Graph Based Prediction","authors":"S. Menezes, Geeta Varkey","doi":"10.1109/ICACC.2013.15","DOIUrl":"https://doi.org/10.1109/ICACC.2013.15","url":null,"abstract":"The prediction of missing items in a set is an unresolved area of research on the web. Current approaches use association rule mining techniques which are applied to only small item sets. Association rule mining techniques increase rule generation complexity as the size of data increases. This paper proposes the use of Naïve Bayes text classifier prior to the prediction process to control the transaction length thereby reducing rule generation complexity. The lengthy transactions are reduced by classification to shorter transactions, the length of which have an upper bound determined by the number of classes that are in the training dataset. The prediction of missing classes uses a graph based approach. Graph based approaches offer an advantage of low memory requirements and require just one pass over the database. The proposed approach offers advantages of prediction at a higher level of abstraction and reduced rule generation complexity.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"11 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114001440","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}