{"title":"CAD model to compute input impedance and bandwidth of tunable right angle isosceles triangular patch antenna","authors":"M. Dam, S. Mazumder, M. Biswas","doi":"10.1109/C3IT.2015.7060154","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060154","url":null,"abstract":"A fast and accurate CAD model based on cavity model analysis has been proposed to predict the input impedance and bandwidth of a tunable right angle isosceles triangular patch antenna (RAITPA). The effect of suspended substrate on the input impedance and bandwidth has been thoroughly investigated. The accuracy of the present model is computed against the HFSS simulated results. The present model shows very good agreement with the simulated results. For designing the MIC on semiconductor materials with εr≥ 10, this model will be widely applicable.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"477 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123052832","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 novel in-place sorting algorithm with element wise restricted swap","authors":"Rupayan Dutta, Sayan Nayak","doi":"10.1109/C3IT.2015.7060123","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060123","url":null,"abstract":"Constraint based sorting is considered to be one of the fundamental topics of discussion in computer science. Even though a large number of sorting algorithms have already been proposed and verified, but still new algorithms are being developed with respect to emerging problem statements. As sorting is the common operation of many algorithms, so efficient sorting makes easy searching, arranging and locating the information. This paper introduces a novel in-place sorting algorithm which works under the restriction of the number of movements. The restriction of movement is element wise i.e. there is a constraint on the number of movements for a particular element. The proposed algorithm is useful when cost of moving each element is not same and we have to sort the list keeping in mind that elements with higher movement cost should be swapped lesser number of times. In this paper, the algorithm has been presented with time complexity, space complexity analysis and experimental results.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375890","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":"Big data parallelism: Challenges in different computational paradigms","authors":"Koushik Mondal, P. Dutta","doi":"10.1109/C3IT.2015.7060186","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060186","url":null,"abstract":"Developers are engaged themselves in processing big data for different computational environments especially in different information systems, biological expression preparations and visual and graphical modelling. Digital Elevation Models (DEMs) in Geographic Information Systems (GIS) is one such information systems where in memory computation faces a lot challenges to manipulate and visualize the data. Scalable distributed framework broadly exhibit two design characteristics: (i) they are using memory scalability in such a manner that the amount of memory required by each process decreases as the number of processes used to solve a given problem instance increases, and (ii) they exploit coarse grain parallelism in the sense that they structure their computations into a sequence of local computation followed by communication phases in which the local computations take a non-trivial amount of time and often involve a non-trivial subset of the process' memory. In this paper we will discuss about big data, data science, different models available in the parallel paradigms, the pros and cons and the probable way out to work with high dimensional data.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124697398","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 based gene regulatory network reconstruction","authors":"S. Mandai, Goutam Saha, R. Pal","doi":"10.1109/C3IT.2015.7060112","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060112","url":null,"abstract":"Gene Regulatory Networks (GRN) is used to model the regulations in living organisms. Inferring genetic network from different experimental high throughput biological data (like microarray) is a challenging job for all researchers. In this paper, Artificial Neural Network, which is a very effective soft computing tool to learn and model the dynamics or dependencies between genes, is used for reconstruction of small scale GRN from the reduced microarray dataset of Lung Adenocarcinoma. The significances of regulations of one gene to other genes of the system are expressed by a weight matrix which is computed using Perceptron based biologically significant weight updating method by minimizing the error during learning. Based on the values of elements of filtered weight matrix, a directed weighted graph can be drawn successfully that denotes gene regulatory network.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407739","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}
Tamal Das, A. Ghosh, Soumyo Chatterjee, S. Chatterjee
{"title":"Design expression for first null beam width of broadside Dolph Chebyshev antenna array","authors":"Tamal Das, A. Ghosh, Soumyo Chatterjee, S. Chatterjee","doi":"10.1109/C3IT.2015.7060124","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060124","url":null,"abstract":"This paper strives to postulate a design expression for the first null beam width (FNBW) of Dolph Chebyshev linear antenna array which facilitates the angular resolution analysis of main beam. The formula for FNBW has been deduced by observing variation of FNBW with required side lobe ratio. Variation of FNBW with inter-element spacing for different array configurations has also been taken in to consideration. FNBW value obtained using the proposed formula has been compared with that of FNBW value obtained from the array factor plot proving its effectiveness.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121887813","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":"Design and fabrication of A T.E.N.S. pain relief unit","authors":"Jayjeet Sarkar","doi":"10.1109/C3IT.2015.7060136","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060136","url":null,"abstract":"In this paper, a T.E.N.S. (Transcutaneous Electrical Nerve Stimulation) pain relief unit is designed and fabricated. A low-frequency pulsed electromagnetic field (PEMF) of spike signals applied to ruptured bone, damaged soft tissues, pain and cancerous tumors have considerable healing effects. The effectiveness of PEMF for curing of pain and osteoarthritis is the focus of this article. Precise low frequency pulsed electromagnetic fields (PEMFs) produce definite cellular and biological effects, based on the amplitude, pulse width, pulse rate and wave shape. Here a pain relief unit is designed having spike waveform of varying amplitude ranging from 0 to 300 volt, frequency range between 30Hz and 130Hz and pulse duration of 1μsec.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130353981","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":"Genetic algorithm and gravitational emulation based hybrid load balancing strategy in cloud computing","authors":"Scintami Dam, G. Mandal, K. Dasgupta, P. Dutta","doi":"10.1109/C3IT.2015.7060176","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060176","url":null,"abstract":"Cloud computing enables a new supplement of consumption and delivery model for internet based services and protocol. It helps to provide software, hardware and data in form of collaborative services on the demand of the end user. To meet the QoS and ensure high interoperability and scalability is one of the most challenging tasks for cloud service provider. However, there are also several technical challenges that need to be tackled before the benefits can be fully realized. Among them reliability, resource provisioning, and efficient resources consuming etc are major concern. Load balancing also one of them. It includes selecting a proper node that must be full filled end user demand and also distribution of dynamic workload evenly into the multiple nodes. So load balancing can be described as an optimization problem and should be adapting nature due to the changing needs. In this paper we suggest a novel load balancing strategy to search under loaded node to balance load from overwhelmed node. CloudAnalyst used as a simulation tool for the proposed load balancing strategy. Experimental results of the sample application are really very encouraging. Significantly the results of the proposed algorithm are compared and outperformed the traditional strategy like First Come First Serve(FCFS), local search algorithm like Stochastic Hill Climbing(SHC) and soft computing approaches like Genetic Algorithm (GA) and Ant Colony Optimization(ACO).","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124417029","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":"Revocable key generation from irrevocable biometric data for symmetric cryptography","authors":"Subhas Barman, D. Samanta, Samiran Chattopadhyay","doi":"10.1109/C3IT.2015.7060182","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060182","url":null,"abstract":"Crypto-biometric system (CBS) is a combination of biometrie with cryptography to enhance network security. Biometrie is the most trustworthy measure to identify a person uniquely using his or her behavioral and physiological characteristics. Cryptography is an effective concern to the security of information. The security of cryptography depends on the strength of cryptographic key and strength of key depends on the length of key. In the traditional cryptography, key is generated randomly and it is very difficult to remember as the key is not linked with user. To address this limitation of cryptography, CBS uses biometrie data of user to bind key with its owner and as the key is linked with user's biometrie data, user does not need to remember the key. As biometrie data is irrevocable, it becomes useless when compromised and as a result the biometrie based key becomes also useless. In this approach, fingerprint features are used to generate key for cryptographic application. The key is revocable and easy to revoke when required. In our experiment, FVC2004 fingerprint database is used to investigate the result.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645469","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}
Srirupa Dasgupta, Goutam Saha, Ritwik Mondal, R. Pal, A. Chanda
{"title":"A comparision between methods for generating differentially expressed genes from microarray data for prediction of disease","authors":"Srirupa Dasgupta, Goutam Saha, Ritwik Mondal, R. Pal, A. Chanda","doi":"10.1109/C3IT.2015.7060148","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060148","url":null,"abstract":"Feature selection from microarray data has become an ever evolving area of research. Numerous techniques have widely been applied for extraction of genes which are expressed differentially in microarray data. Some of these comprise of studies related to fold-change approach, classical t-statistics and modified t-statistics. It has been found that the gene lists returned by these methods are dissimilar. In this work we compare the outputs of two different feature selection methods using three classifiers based on different algorithms namely the Random Forest Ensemble based method, the Support vector machine (SVM) and the KNN methods, using the prediction accuracy of the test datasets.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731178","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 close encounter with Random Numbers","authors":"Subrata Das, P. Dasgupta, A. Pandey, Pabitra Roy","doi":"10.1109/C3IT.2015.7060206","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060206","url":null,"abstract":"Performance profiling or empirical testing, and statistical testing of algorithms for NP-complete problems is typically based on random sample testing. Random values constitute a good source of data for testing the effectiveness of a computer algorithm. Random number generation is an absolute proposition. As such, generally the concentration is on realistic pseudorandom number generation. There are numerous pseudorandom number generation algorithms. We propose here another drop in the sea which is at least as efficient as the existing algorithms and simpler in certain respects.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839403","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}