{"title":"Word Size Removal (WSR) method for Bit Parallel String Matching","authors":"K. Soni, V. Sharma","doi":"10.1109/IADCC.2015.7154720","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154720","url":null,"abstract":"Bit Parallel String Matching algorithms are the most efficient and latest class of String Matching Algorithms. These algorithms use the intrinsic property of computer known as Bit Parallelism for performing bit operations in parallel with-in single computer word. BNDM, TNDM, BNDMq are the popular single pattern bit parallel string matching algorithms whereas Shift-OR and Shift-OR with Q-grams algorithms are popular in multiple pattern string matching. All these algorithms are restricted by the limitation of pattern size. These all algorithms are not working on patterns whose sizes are longer than computer word. In this paper, we proposed the generic method named WSR (Word Size Removal) for bit parallel string matching. With the inclusion of WSR these bit parallel string matching algorithms can work on longer than computer word size patterns. This paper presented WSR method and all modified algorithms.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584617","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":"Modified HYPR algorithm - A promising technique for low dose imaging","authors":"S. Desai, L. Kulkarni","doi":"10.1109/IADCC.2015.7154798","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154798","url":null,"abstract":"Medical imaging has grown tremendously over years. The CT and MRI are well thought-out to be most extensively used imaging modalities. MRI is less dangerous, but one cannot underrate the unsafe side effects of CT. Current study reveals the actuality of escalating risk of cancer as side effect for patients who go through recurring CT scanning. Consequently the devise of low dose imaging protocol is of the enormous significance in the current scenario. In this paper we present modified highly constrained back projection (M-HYPR) as a most promising method to address low dose imaging. HYPR is basically an iterative process in nature and hence computational greedy, and is the root cause for being neglected by CT developers. The weight matrix module, being main reason for huge computation time is modified in this work. Considerable speed up factor is recorded, as compared original HYPR (O-HYPR) on a lone thread CPU implementation. The superiority of reconstructed image in each platform has been analyzed. The evidenced results convey substantial improved performance by M-HYPR algorithm, and appreciable usage of GPU in medical image applications.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131001083","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}
Supriya M. Pharande, Priyanka Pawar, P. Wani, A. Patki
{"title":"Application of Hurst parameter and fuzzy logic for denial of service attack detection","authors":"Supriya M. Pharande, Priyanka Pawar, P. Wani, A. Patki","doi":"10.1109/IADCC.2015.7154823","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154823","url":null,"abstract":"Normal legitimate network traffic on both LANs and wide area IP networks has self-similarity feature i.e. scale invariance property. Superimposition of legitimate traffic and high intensity non-self-similar traffic results into degradation in self-similarity of normal traffic. Rescaled range method is used to calculate Hurst parameter and its deviation from normal value. Two inputs and one output fuzzy logic block is used to determine the intensity of Denial of Service (DoS) attack. In order to detect self-similarity, we have used synthetic self-similar data generated using Fractional Gaussian Noise process and to identify existence of Denial of Service, DARPA IDS evaluation dataset is used. C code for statistical method is implemented on DSP Processor TMS320C6713 platform.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114612654","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}
Navin Bhagwan Mordani, N. Tamhane, Rohan Ravindra Tipare, Vishal Zagade
{"title":"Generic trajectory model for Network Centric Warfare enhanced using data mining","authors":"Navin Bhagwan Mordani, N. Tamhane, Rohan Ravindra Tipare, Vishal Zagade","doi":"10.1109/IADCC.2015.7154756","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154756","url":null,"abstract":"The field of Network Centric Warfare seeks to use information technology in order to gain competitive advantage over the enemies during war. An essential part of network centric warfare deals with the firing of highly destructive weapons. It includes the determination of exact direction of firing the weapon so as to successfully destroy the target for a given unguided shell. This can be done using different trajectory models. The major challenge is that this decision be quick in the time critical scenario of war and this urges the use of previous experience using data mining.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133664325","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 simplified approach for joint source and channel coding for data transmission over wireless channel","authors":"Dayanand S. Shambhu, P. G. Poddar","doi":"10.1109/IADCC.2015.7154868","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154868","url":null,"abstract":"A simple and efficient method for communication of text information using joint source-channel coding is presented in this paper. The information is encoded by the use of symmetric reversible variable length code and corresponding header sequence is generated. The header information, headers and codewords forms a frame. Since the header plays a crucial role for decoding the codewords at the receiver, it is channel encoded and the coded frame is transmitted after modulation. Orthogonal Frequency Division Multiplexing (OFDM) technique, which is known to provide high data rate and better performance over wireless channels, is used in designing the transceiver system.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213401","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}
P. Anuradha, H. Rallapalli, G. Narasimha, Syed Musthak Ahmed
{"title":"Efficient workload characterization technique for heterogeneous processors","authors":"P. Anuradha, H. Rallapalli, G. Narasimha, Syed Musthak Ahmed","doi":"10.1109/IADCC.2015.7154819","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154819","url":null,"abstract":"As the embedded computing becomes advanced, more and more functionality is becoming available on the mobile devices. The workloads on earlier generations of mobile devices were mostly limited to chat, e-mail or Web browsing apart from the use as phones. Multi-media workloads such as the video are on the rise; in addition many users play games or use apps on the latest mobile devices. The emergence of these new workloads has resulted in the high performance demands on the mobile devices. System level design space exploration for high performance embedded systems is a very important problem that has become very challenging due to the advent of multi cores, GPUs, FPGAs and DSPs along with a large variety of energy efficient memory systems. To perform efficient design space exploration for SoCs adopted workload characterizations approach. This paper shows workload characterization for a variety of heterogeneous processors such as the DSPs and FPGAs.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124808907","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":"Performance improvement for navigating named destinations in PDF documents","authors":"Deepak Mittal, C. Sudarshan","doi":"10.1109/IADCC.2015.7154849","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154849","url":null,"abstract":"PDF (Portable Document Format) documents have become popular in recent times. PDF documents have named destinations that have reference to info like page number, zoom level, scale factor etc. These named destinations should be resolved when user loads URL with named destination or select link in the PDF. Resolving named destinations in PDF is taking more time that affects response time in PDF after user selection or resolving named destination at the URL load time for rendering PDF in Chrome Browser. In this paper, we present a new dictionary based novel solution for improving time to resolve named destinations. Dictionary is the map of named destinations and corresponding page number in the PDF document. We then present the results of some tests on the purposed approach with the already existing approach to show that the purposed approach performs better compared to existing approach while creation of named destinations dictionary does not take significant time. We conclude that our algorithm can perform better as asynchronous message passing is avoided and we have access to page number corresponding to the named destination in constant time and in synchronous manner.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125916997","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":"Adaptive Look Ahead algorithm for 2-D mesh NoC","authors":"A. Menon, Lian Zeng, Xin Jiang, Takahiro Watanabe","doi":"10.1109/IADCC.2015.7154718","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154718","url":null,"abstract":"The existing System on Chip (SoC) design will soon become a critical bottle neck in chip performance with its inability to scale its communication network effectively with decreasing feature sizes and increasing number of transistors. The Network on Chip (NoC) has been recognized as the next evolutionary step to tackle these issues by using an intelligent and common communication network between all the different components within chip. In this paper we propose a new routing algorithm that uses a combination of a fully adaptive and partial adaptive routing algorithm called Adaptive Look Ahead algorithm. The algorithm decides next two hops within one node to allow quick packet transfer in next node, hence the algorithm only periodically calculates the packets route along the minimal path. Experimental results show that our proposed algorithm has lower latency and higher throughput than existing benchmarks.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115090711","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 of reversible Quantum equivalents of classical circuits using Hybrid Quantum Inspired Evolutionary Algorithm","authors":"S. Satsangi, C. Patvardhan","doi":"10.1109/IADCC.2015.7154709","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154709","url":null,"abstract":"This paper illustrates the application of a Hybrid Quantum Inspired Evolutionary Algorithm (HQIEA) in evolving a variety of Quantum equivalents of classical circuits. Taking the matrix corresponding to an oracle as input, this HIQEA designs classical circuits using quantum gates. A library consisting of single, two and three qubit Quantum gates and the desired circuit matrix were given as input and algorithm was able to successfully design half adder, full adder and binary-gray conversion circuits apart from circuits for two, three and four qubit Boolean functions, using Quantum gates. The circuits obtained compare favorably with earlier attempts in terms of number of gates, ancillary inputs and garbage outputs required for constructing these circuits and the time taken to evolve them.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158329","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}
Saurabh Naik, S. Bale, Tejas Raut Dessai, Gandhar Kamat, M. H. Vasantha
{"title":"0.5V, 225nW, 100 Hz Low pass filter in 0.18µm CMOS process","authors":"Saurabh Naik, S. Bale, Tejas Raut Dessai, Gandhar Kamat, M. H. Vasantha","doi":"10.1109/IADCC.2015.7154775","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154775","url":null,"abstract":"This paper presents a low power continuous time 2nd order Low Pass Butterworth filter operating at power supply of 0.5V suitably designed for biomedical applications. A 3-dB bandwidth of 100 Hz using technology node of 0.18μm is achieved. The operational transconductance amplifier is a significant building block in continuous time filter design. To achieve necessary voltage headroom a pseudo-differential architecture is used to design bulk driven transconductor. In contrast, to the gate-driven OTA bulk-driven have the ability to operate over a wide input range. The output common mode voltage of the transconductor is set by a Common Mode Feedback (CMFB) circuit. The simulation results show that the filter has a peak-to-peak signal swing of 150mV (differential) for 1% THD, a dynamic range of 74.62 dB and consumes a total power of 0.225μW when operating at a supply voltage of 0.5V. The Figure of Merit (FOM) achieved by the filter is 0.055 fJ, lowest among similar low-voltage filters found in the literature.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122683333","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}