{"title":"No load Robustness Analysis of AI Based Controllers & Estimators for SRM Drive","authors":"S. Bishnoi, R. Kumar, R. A. Gupta","doi":"10.1145/2979779.2979888","DOIUrl":"https://doi.org/10.1145/2979779.2979888","url":null,"abstract":"In this paper no-load robustness analysis of Artificial Intelligence (AI) based drives using four phases 8/6 poles Switched Reluctance Motor (SRM). Models of SR motor, AI based controllers i.e. fuzzy, ANN & ANFIS and AI based angle estimators i.e. fuzzy, ANN & ANFIS were developed and integrated as fuzzy-fuzzy, ANNANN & ANFIS-ANFIS SRM drives. Simulation of drives has been done for robustness performance of the drives and compared results. Robustness of drives are tested by varying switched reluctance motor physical parameters, including phase winding resistance (R), damping constant (F) and rotor inertia (J) in the SRM model. Robustness performance at startup and steady-state conditions at 500 rpm has been obtained by simulating these drives for no-load condition. Robustness performance has been plotted and compared to figure-out most robust AI based SRM drive.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122027150","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":"Attribute Analysis using Fuzzy Association Rules and Interestingness Measures","authors":"Swati R. Ramdasi, S. Shirwaikar, V. Kharat","doi":"10.1145/2979779.2979867","DOIUrl":"https://doi.org/10.1145/2979779.2979867","url":null,"abstract":"While describing cross price elasticity of demand the terms complimentary and substitute goods are often used in Economics. If two goods are substitute if having one, fulfills consumer's requirements thus demand for other decreases while in case of complimentary goods, using more of good one increases requirement for the other. This categorization of items has several applications as in planning replacements in case of scarcity, bundling or packaging of goods, cross-selling etc. On similar lines this relationship between two items can be extended to quantified attributes. This paper uses fuzzy association rule and fuzzy support to define complimentary and substitute attributes and illustrates them using known data sets and discusses their applicability.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239945","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":"Overcome the Interference between Si rods based Add Drop Filter using Two-dimensional PCRR","authors":"P. Inaniya, Ekta Kumari, M. Kuri","doi":"10.1145/2979779.2979893","DOIUrl":"https://doi.org/10.1145/2979779.2979893","url":null,"abstract":"In this work, a novel optical Add-drop filter is designated on the essence of coupling betwixt the PCRR and waveguide. Its simulation process has been carried out through 2-D finite difference time domain method (FDTD). The plane wave expansion method is exploited for investigation of Band gap of proposed structure. The Proposed structure comprised silicon rods and rectangular lattice having index of refraction 3.47 Results demonstrates that 100% dropping efficiency at 1590 nm through waveguide afterwards optimization. The size of ring is also essence the ring resonator and its parameters.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974696","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":"DCCSR: Document Clustering by Conceptual and Semantic Relevance as Factors of Unsupervised Learning","authors":"A. Rao, S. Ramakrishna","doi":"10.1145/2979779.2979822","DOIUrl":"https://doi.org/10.1145/2979779.2979822","url":null,"abstract":"Unsupervised learning of text documents is an essential and significant process of knowledge discovery and data mining. The concept, context and semantic relevancy are the important and exclusive factors in text mining, where as in the case of unsupervised learning of record structured data, these factors are not in scope. The current majority of benchmarking document clustering models is keen and relies on term frequency, and all these models are not considering the concept, context and semantic relations during document clustering. In regard to this, our earlier work introduced a novel document clustering approach that named as Document Clustering by Conceptual Relevance (DCCR), which is aimed at concept relevancy. With the lessons learned from the empirical study of the DCCR, here we presented a novel document clustering approach, which is based on concept and semantic relevancy of the documents. The significant contribution of this proposal is feature formation by concept and semantic relevance. An unsupervised learning approach that estimates similarity between any two documents by concept and semantic relevance score is proposed. This novel method represents the concept as correlation between arguments and activities in given documents, and the semantic relevance is assessed by estimating the similarity between documents through the hyponyms of the arguments. The experiments was conducted to assess the significance of the proposed model and in regard to this, the benchmark datasets were used.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131008678","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 Modified RSA Approach for Encrypting and Decrypting Text and Images Using Multi- Power, Multi Public Keys, Multi Prime Numbers and K-nearest Neighbor Algorithm","authors":"Shikha Mathur, Deepika Gupta","doi":"10.1145/2979779.2979833","DOIUrl":"https://doi.org/10.1145/2979779.2979833","url":null,"abstract":"One of public key algorithm is RSA cryptosystem used for encryption and decryption. This paper suggest a new algorithm by presenting the modified form of RSA algorithm in order to increase security of data during data exchange over the network. In our proposed algorithm it includes exponential form of rsa with four prime numbers and multiple (i.e. two) public keys and k-nearest neighbor algorithm. In exponential RSA we use exponential form of rsa which is based factorization problem, and at same time we are using four prime number instead of two prime numbers, and multiple public keys, to provide more security over the network and 'n' prime numbers are not easily factorable and increased the efficiency. Simultaneously, I have included k-nearest neighbor algorithm. Sometimes there is a situation in which the cipher text is the same as the plaintext and in such cases attacker can easily encrypt original message. We can also apply our algorithm for special characters like @, #. $, %, &, *. Proposed algorithm also implemented on images. And in future we will apply our algorithm on audio and video encryption and decryption also. Finally we compare proposed RSA with the original RSA algorithm.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131176722","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":"Systematic Mapping Study of Metrics based Clone Detection Techniques","authors":"D. Rattan, J. Kaur","doi":"10.1145/2979779.2979855","DOIUrl":"https://doi.org/10.1145/2979779.2979855","url":null,"abstract":"A code clone is a code fragment that is similar or identical to other code fragments in the source code. Code clones generally occurs in large systems and affects the system maintenance and quality. Removing clones is one way to avoid problems that occur due to the presence of code clones. Clone detection techniques using software metrics provides less complexity in finding the clones. This systematic mapping study focuses on metric based clone detection techniques and various tools used in previous studies. The existing work is classified into different categories and presented in systematic maps. This paper also indicates some problems related to clone detection research.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127202570","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":"HTTP Flood Attack Detection using Ontology","authors":"D. Kshirsagar, Sandeep Kumar","doi":"10.1145/2979779.2979794","DOIUrl":"https://doi.org/10.1145/2979779.2979794","url":null,"abstract":"The use of web applications by the users over the Internet is increasing day by day. Analyzing the increasing demand, many organizations are providing their services through web applications. Number of users and web applications are increasing continuously. Moreover, the malicious traffic is also increasing with the same rate. Therefore, there is a need to secure web servers and applications. Web servers and applications are suffering from Flooding attacks from network to the application layer. Many solutions are available for flooding attacks at the network and transport layer. However, very few solutions are available for flooding attacks at application layer due to complexity in detecting the behavior of attack. This paper proposes the HTTP Request ontology for the efficient detection of HTTP Flood attack. The proposed ontology is useful for the development of semantic rules for attack detection, which produces a higher detection rate as compared to the current state of the art systems.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115826985","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":"Techno-innovative solution in the form of neural expert system to address the problem of high attrition rate","authors":"Viral Nagori","doi":"10.1145/2979779.2979890","DOIUrl":"https://doi.org/10.1145/2979779.2979890","url":null,"abstract":"The paper presents the solution to address the problem of high attrition rate by the way of technology innovation in the form of neural expert system. The neural expert system evaluates the motivational preferences of the employees based on their demographics. Based on the evaluation, the system generates set of customized motivational strategies for each individual employee to motivate them and thus in turn helps to retain them for the longer duration. The paper also justifies the need for the techno-innovation to address the problem of high attrition rate. The research is based on the population of ICT employees working in Ahmedabad and Gandhinagar region of Gujarat state in India. The system has been implemented and provides more than 90% of the accuracy in prediction. The comparison with such other neural network based systems indicates that our system is above par in performance evaluation criteria.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123887589","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":"SDN Control Plane Security in Cloud Computing Against DDoS Attack","authors":"Yadav Ashok Khimabhai, Vandana Milind Rohokale","doi":"10.1145/2979779.2979843","DOIUrl":"https://doi.org/10.1145/2979779.2979843","url":null,"abstract":"In Software Defined Networking a Denial-of- Service (DoS) or Distributed Denial-of-Service (DDoS) attack is an attempt to make a machine or network resources unreachable for its particular users. so, the require for security of such network controller against attacks from within or outside a network is very more important. Although network devices in OpenFlow can also be targeted by attackers and so required a Defense mechanism to avoid problems in smooth packet forwarding attack. SDN Give the Functionality to Overcome DDoS Attack use Control plan and data plan. Also, they manage the network use SDN controller to monitor network. SDN network flexibility provides they interface OpenFlow and switches network by Mininet. That all are merge to single centralized control point.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115298342","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":"Hidden Markov Model Implementation for Prediction of Stock Prices with TF-IDF features","authors":"V. Ingle, S. Deshmukh","doi":"10.1145/2979779.2979788","DOIUrl":"https://doi.org/10.1145/2979779.2979788","url":null,"abstract":"Stock data analysis is challenging research area. The proposed analysis works on online news data for prediction of stock market states such as high, low etc. The Hidden Markov Model along with features extracted such as TF-IDF is used to find out next day's stock market value for group of companies. The method can be further extended to adjustment of probability values to calculate tuned model for prediction.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125293282","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}