{"title":"Centralized Solution to Securely Transfer Payment Information Electronically to Banks from Multiple Enterprise Resource Planning (ERP) Systems","authors":"Manu Kohli, Edgardo Suarez","doi":"10.1109/ICIT.2016.062","DOIUrl":"https://doi.org/10.1109/ICIT.2016.062","url":null,"abstract":"Financial transactions in an organization, for example payments to suppliers and employee salaries, are generated from Enterprise Resource Planning (ERP) applications and require secure transmission to bank. The payment models have been evolving over the years which confronted transformations from the usage of manual payment methods, cheque, cards, Electronic Fund Transfer (EFT) to Automatic Clearing House (ACH). Current models utilize Public key infrastructure methods for authorization procedures which require certification and verification of customer and payment information. The present case study proposes a consolidated model that has been developed and deployed using a centralized infrastructure enabling secured payment information exchange from various business units in an organization to the bank. The developed method achieves economies of scale and scope, provides set of standardized procedures that integrate multiple ERP applications deployed for various business units distributed over multiple geographies on a secured platform at a minimum reconstruction and waiting time. The model has proven effective leading to cost and schedule saving from 25 % to 75% and provides a plug and play platform to business units in an organization to exchange payment information securely with various banks.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631309","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":"Forward Load Aware Scheduling for Data-Intensive Workflow Applications in Cloud System","authors":"M. Kumar, Indrajeet Gupta, P. K. Jana","doi":"10.1109/ICIT.2016.030","DOIUrl":"https://doi.org/10.1109/ICIT.2016.030","url":null,"abstract":"Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131282443","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":"Novel System for Retrieval of Composite Trademarks Using Multi-feature Voting","authors":"Akriti Nigam, R. Tripathi","doi":"10.1109/ICIT.2016.058","DOIUrl":"https://doi.org/10.1109/ICIT.2016.058","url":null,"abstract":"Trademark retrieval systems have been a well researched field however majority of these researches have been done on device trademarks and do not consider the presence of text embedded within trademark images as in case of composite marks. In this work a unified retrieval system has been proposed and implemented for composite trademarks. The technique is invariant to font size, font style and orientations, further it can even apply to non standard/ artistic fonts. Three recognition techniques have been proposed based on directional chain codes, curvature of boundary and distance from centroids and a voting algorithm has been proposed to combine their results so as to avoid false positives in the result. Evaluation of the technique has been done on one benchmark dataset and on the self compiled dataset. The results obtained establish the proposed technique as a viable solution and effective contribution in the field of composite trademark retrieval. Owing to the significant advantages associated with the proposed method, an improvement of 13.5% in recognition accuracy is achieved.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127997921","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":"Location of the Fault in TCSC-based Transmission Line Using SVR","authors":"P. Ray, D. Mishra, G. K. Budumuru","doi":"10.1109/ICIT.2016.061","DOIUrl":"https://doi.org/10.1109/ICIT.2016.061","url":null,"abstract":"In this paper we inspect support vector regression (SVR) based fault position in a TCSC (thyristor controlled series capacitor) based long transmission line. This technique uses 1 cycle post faulty current signal from the transmission line and decomposed by wavelet packet transform. From the decomposed signal entropy and energy are extracted and fed to the forward feature selection method to eliminate the redundant data set. Then optimal future data set is normalized. Taking different simulation situation like fault type, resistance path, inception angle, and distance train and test data are produced. By using particle swarm optimization technique SVR parameters are optimized. Then normalized data set is fed to SVR to locate the fault position in TCSC based long transmission line. It is noticed that fault position error is less, than 0.29 percentages.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123527464","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":"Simultaneous Feature Selection and Cluster Analysis Using Genetic Algorithm","authors":"Sunanda Das, S. Chaudhuri, Sujata Ghatak, A. Das","doi":"10.1109/ICIT.2016.064","DOIUrl":"https://doi.org/10.1109/ICIT.2016.064","url":null,"abstract":"Cluster analysis being one of the important techniques of data mining applied in several fields such as bioinformatics, social networks, computer vision, and so on. It is an unsupervised learning technique for exploring the structure of the data without class label. Many clustering algorithms have been proposed to analyze high volume of data, but very few of them evaluate the quality of the clusters due to irrelevant and inconsistent features present in the dataset. So, feature selection is an important pre-processing step in data analysis mainly for high dimensional dataset. In the paper, we select optimal subset of features and perform clusters analysis simultaneously using genetic algorithm. Basically, genetic algorithm is used to select the optimal subset of features which automatically finds optimal number of clusters sat the end of the process. Optimality of the clusters is measured by calculating various cluster validation indices. The overall performance of the method is investigated on popular UCI datasets and the experimental results are compared with Fuzzy C-Means algorithm to demonstrate effectiveness of the proposed method.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"26 8-9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132363869","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":"Grid Based Data Gathering in Multi-channel Wireless Sensor Network","authors":"H. Sarma","doi":"10.1109/ICIT.2016.034","DOIUrl":"https://doi.org/10.1109/ICIT.2016.034","url":null,"abstract":"A data gathering protocol for multi-channel wireless sensor network is proposed in this paper. The sensor field is logically divided into some finite number of grids. Each grid is managed by a potential node called as grid manager. Each grid manager is also responsible for communicating aggregated data generated inside the respective grid to the base station either directly or via multi-hop communication. Proposed protocol can handle mobility of the sensor nodes. Numerical results are reported for performance evaluation of the proposed protocol. Future scope of the work is outlined.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116198530","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":"Text Categorization via Attribute Distance Weighted k-Nearest Neighbor Classification","authors":"H. Wandabwa, Defu Zhang, Korir Sammy","doi":"10.1109/ICIT.2016.053","DOIUrl":"https://doi.org/10.1109/ICIT.2016.053","url":null,"abstract":"Text categorization entails making a decision on whether a document belongs to a set of pre-specified classes of other documents. This can be in a supervised way in classification tasks or unsupervised reminiscent of clustering related tasks. Categorization can be a challenging task especially when the discriminating words are large. K-Nearest Neighbor is an instance based learning algorithm that has proven to be effective in such classification tasks including documents. The key element of this algorithm lies in the similarity measurement principle that is capable of identifying neighbors of a particular document to high accuracies. The only drawback of this approach is in the weighting of all features to determine the distance among the documents in question. This is not only time consuming but also overuses computer resources without adding anything substantial to the overall results. In our approach (Attribute Distance Weighted - KNN), we do not make use of all features in the corpus but first extract the most relevant ones by weighting them in relation to the corpus. We then calculated the distance between the highly ranked features in the corpus alone as a representative of the entire document set. So far no known literature has inclined towards this approach thus our comparison will be in relation to the classical KNN measure. Our approach showed marginal performance in distance measure compared to classical KNN.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124159393","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}
B. V. Srivastava, Shashikant Sharma, Deepanwita Datta, G. Sriram, S. Jambhulkar, Shashank Naik, Ganapa Jaswanth Reddy
{"title":"Genetic Algorithm Based Parallel Matrix Factorization for Recommender Systems","authors":"B. V. Srivastava, Shashikant Sharma, Deepanwita Datta, G. Sriram, S. Jambhulkar, Shashank Naik, Ganapa Jaswanth Reddy","doi":"10.1109/ICIT.2016.051","DOIUrl":"https://doi.org/10.1109/ICIT.2016.051","url":null,"abstract":"Matrix Factorization is one of the popular approaches for learning the latent characteristics from the sparse utility matrix of recommendation systems. In recent times, Coordinate Descent based matrix factorization approach (CCD) have outperformed the other existing approaches such as Alternating Least Squares (ALS) and Stochastic Gradient Descent (SGD). While ALS is not scalable due to its cubic time complexity, SGD suffers from slow convergence. An improved version of CCD, CCD++ was recently proposed to overcome the shortcomings of CCD. The difference in these two approaches lies in their update rules and the update sequences. CCD++ was shown to converge faster than CCD. In this paper, we hypothesize that use of Genetic Algorithm (GA) for initializing matrices may significantly speed up the convergence of CCD++. Also, parallelism could be exploited more efficiently at update stage. We update the rating matrix at regular intervals with GA, so that the convergence of CCD++ is relatively fast. Our experimental results show that optimum update of matrices enhances the convergence of CCD++ appreciably.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122759411","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":"Extraction of Network Information - Quality and Quantity - from Nodes of Neuronal Network","authors":"Sayan Biswas","doi":"10.1109/ICIT.2016.035","DOIUrl":"https://doi.org/10.1109/ICIT.2016.035","url":null,"abstract":"Neurons forms interconnected networks to process information. In brain such networks are implemented for the purpose of computation or decision making. Neuron cultures on Multi Electrode Array gives advantage to study the network topology of network of neurons as it facilitates recording from population of neurons. Spike train recorded from the dish is used for analysis of the information content in neuron network node. Shannon Entropy and Autocorrelation is applied to understand the quantity and quality of network information content in the signal recorded from the nodes of neuron network formed on the dish as result of the culture. The information content was quantified in bits and quality of information was found to be non-random hence good quality.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"89 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114043186","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":"Synaptic Coupling Strength and Seizures","authors":"Harshvardhan, D. K. Lobiyal","doi":"10.1109/ICIT.2016.038","DOIUrl":"https://doi.org/10.1109/ICIT.2016.038","url":null,"abstract":"In this paper, role of uneven coupling strength in the Hindmarsh-Rose neuronal model is investigated. Coupling strength may be different in between neurons due to multiple reasons. The spiking activity in a coupled neuro-system is affected by the variations in the coupling strength. Therefore, appropriate changes in the coupling strength lead to the interesting seizure like spiking activity.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648086","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}