{"title":"Designing a low cost microcontroller-based device for multipurpose learning","authors":"A. Arefin, K.M.M. Habib, R. Sultana, S. Kabir","doi":"10.1109/ICCITECHN.2007.4579378","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579378","url":null,"abstract":"A low cost microcontroller based device for multipurpose electronic learning has been developed. This paper describes the design methodology and the development of its hardware and software. Four applications and the development of the general purpose device have been explained in this paper. The technique presented can be applied, following the approach described in a small or in a large project.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123412975","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 analysis of beamforming algorithm for noise cancellation","authors":"M. Alom, I.A. Khan, M.Z. Alam, M. S. Nasrin","doi":"10.1109/ICCITECHN.2007.4579394","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579394","url":null,"abstract":"This paper presents performance analysis of beamforming algorithm for canceling multiple channel noise depending on variation of hidden layer of the multilayer feedforward network and the number of epoch (also known as number of iteration)[1]. A multi-layer perception (MLP) has been considered to perform beamforming. A beamforming is an array of sensors connected to the MLP inputs. We have also used the backpropagation algorithm as learning rule for MLP and improving our signal quality. This involves a desired signal whilst removing any noise or interference signals which may come from different sources.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130015114","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 learning algorithm for metasearching using rough set theory","authors":"R. Ali, M. M. Sufyan Beg","doi":"10.1109/ICCITECHN.2007.4579421","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579421","url":null,"abstract":"Metasearching is the process of combining search results of different search systems into a single set of ranked results, which is expected to be better than results of best of the participating search systems. In this paper, we present a supervised learning algorithm for metasearching. Our algorithm learns the ranking rules on the basis of user feedback based metasearching for the queries in the training set. We use rough set theory to mine the ranking rules. The ranking rules are validated using cross validation. The best of the ranking rules is then used to estimate the results of metasearching for the other queries. We compare our method with modified Shimura technique. We claim that our method is more useful than modified Shimura technique as it models userpsilas preference.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130637347","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":"VLSI implementation of Inverse Discrete Wavelet Transform for JPEG 2000","authors":"M. S. Bhuyan, N. Amin, M.A.H. Madesa, M.S. Islam","doi":"10.1109/ICCITECHN.2007.4579438","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579438","url":null,"abstract":"This paper presents hardware design flow of the inverse discrete wavelet transform (IDWT) core which is the second-most computationally intensive block in JPEG 2000 image compression standard. Lifting scheme (LS) is implemented in designing the IDWT hardwire module that reduces the number of execution steps involved in computation to almost one-half of those needed with a conventional convolution approach. In addition, the LS is amenable to ldquoin-placerdquo computation, so that the IDWT can be implemented in low memory systems. The IDWT module does not comprise any hardware multiplier unit and therefore suitable for development of high performance image processor. The IDWT module has been developed in VHDL using Quartus II from Altera. The VHDL model is validated through simulation using ModelSim-Altera. Simulation results show the IDWT module can perform three levels inverse transform on a 256times256 forward transformed image in 8.7 ms. Latency of the system is calculated 50 ns and the power dissipation by the device is 662 mW. The IDWT module consumes just 57 combinational ALUTs and 60 logic registers of a Stratix II device, and runs at 300 MHz clock frequency, reaches a speed performance suitable for several real-time applications. Throughput in terms of input coefficients processed per second of the IDWT core is 7.13Msamples. The motivation in designing is to reduce its complexity, enhance its performance and to make it suitable development on a reconfigurable FPGA based platform for VLSI implementation.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377533","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}
Md. Jahangir Hossain, M. S. Hossain, M. Hoque, M. S. Anower
{"title":"A novel Fuzzy logic based flux weakening speed control for IPMSM drive with variable direct and quadrature axis inductances","authors":"Md. Jahangir Hossain, M. S. Hossain, M. Hoque, M. S. Anower","doi":"10.1109/ICCITECHN.2007.4579367","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579367","url":null,"abstract":"This paper presents a novel flux weakening speed control scheme of an Interior Permanent Magnet Synchronous Motor (IPMSM) using Fuzzy logic controller considering variable direct and quadrature axis inductances. The Fuzzy logic controller (FLC) has been designed on the basis of indirect vector control scheme of the IPMSM drive. The complete vector control scheme of the IPMSM drive incorporating the FLC is simulated for a IPMSM using Matlab/Simulink. The performances of the proposed FLC based IPMSM drive are investigated and compared to those obtained from the conventional proportional integral (PI) controller based drive at various dynamic operating conditions, such as, certain change in command speed, step change in load, etc. The comparative results show that the FLC is more robust and, hence, found to be a suitable replacement of the conventional PI controller for the high performance industrial drive applications.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123832035","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":"Lossless compression of JPEG and GIF files through lexical permutation sorting with Greedy Sequential Grammar Transform based compression","authors":"S.K. Saha, M. K. Baowaly, M. Islam, M. Rahaman","doi":"10.1109/ICCITECHN.2007.4579416","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579416","url":null,"abstract":"This paper provides a way for lossless Compression of Color Images through lexical permutation sorting (LPS) and Greedy Sequential Grammar Transform based compression. The proposed model adopts the advantages of lexical permutation sorting for Color Images to produce a permuted data. Greedy Sequential Grammar Transform based compression, which is basically a text compression technique can now be applied easily on that permuted data. For comparison, we have taken Inversion Coding of Burrows Wheeler Compression (BWIC), and Burrows Wheeler Compression (BWC) and the model proposed in ICCIT 2006( on a paper named dasiaA New Approach for Lossless Compression of JPEG and GIF Files Using Bit Reduction and Greedy Sequential Grammar Transformpsila ).","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133544039","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":"High performance reliable obstacle detection and height measurement by stereo camera for Intelligent Home Service Robot","authors":"F. Siddiky, M. Alam, Tanveer Ahsan","doi":"10.1109/ICCITECHN.2007.4579364","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579364","url":null,"abstract":"This paper proposes a new dimensional intelligent robotic application that can track an obstacle throughout its way of moving by using active stereo camera. The central part of the proposed method is the resilient back-propagation algorithm which can intellectually find out the ground even though there have a complex surface. After detecting the obstacle, proposed method measures the height of the object so that it becomes possible for the robot to get on top of the obstacle if its height is negligible. The system is mainly proposed for an Intelligent Home Service Robot to work perfectly in different environment on different condition. A searching algorithm is proposed for the system to detect obstacle by neural-network which can search fast enough to apply it in real-time application. In best case its cost is only a constant and in worst case it also needs short time to find different obstacles.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115780753","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":"Lower bound on number of planes for vertically stacked optical banyan networks with link failures","authors":"B. Sultana, M. Khandker","doi":"10.1109/ICCITECHN.2007.4579384","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579384","url":null,"abstract":"Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the good properties of banyan network structures (such as the small depth and self-routing capability). Crosstalk between optical signals passing through the same DC is an intrinsic drawback in DC-based optical networks. Vertical stacking of multiple copies (planes) of an optical banyan network, namely vertically stacked optical banyan (VSOB) network, can remove the crosstalk problem in switch network, and can also make the network nonblocking. This paper deals with the blocking behavior of VSOB networks when some links are broken or failed. We found the approximate value for lower bound on number of planes required to make a VSOB networks nonblocking allowing link-failures. We have an interesting finding that the blocking probability of the VSOB networks does not always increase with the increase of link-failures; blocking probability decreases for certain range of link-failures, and then increases again. As far as we know that for switching networks, such fluctuating variation of blocking probability with the increase of link failures rate deserves special attention in switch design.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129977467","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 study on text summarization techniques and implement few of them for Bangla language","authors":"Md Nizam Uddin, Shakil Akter Khan","doi":"10.1109/ICCITECHN.2007.4579374","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579374","url":null,"abstract":"Text summarization is the technique which automatically creates an abstract or summary of a text. The technique has been developed for many years. So a survey has been done on different summarization techniques. No work in this area has been done for Bangla language. This paper presents a text summarizer for Bangla, which uses some extraction methods for text summarization.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128576628","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":"Iris Recognition: A Java based implementation","authors":"Kaushik Roy, Darrel Hudgin, Prabir Bhattacharya, Ramesh Chandra Debnath","doi":"10.1109/ICCITECHN.2007.4579428","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579428","url":null,"abstract":"Biometric authentication has become increasingly popular in security systems. Recently, the systems based on the human iris, which develops a unique pattern before birth, have produced very high rates of recognition. The iris image is first blurred using a Gaussian filter, and the edge is detected using the Canny edge detection technique. An algorithm, which uses the center of the image as a starting point, is proposed to isolate the pupillary region. The initial estimate of the location of the pupil is then refined, and the iris is located by using the integrodifferential operator. In order to detect the upper and the lower eyelids, we deploy the integrodifferential operator again; however, the path of contour integration is changed from circular to arcuate. A thresholding technique is then applied to locate the eyelashes. The annular iris region is unwrapped from a polar coordinate system to a rectangular canvas. The 2D Gabor wavelets are used to extract the discriminating features. Then, the phase information is extracted to produce an iris code of 2048 bit and a mask, which denotes the noisy regions, of the same length. The Hamming distance is applied for the matching purpose. We also design a graphical user interface (GUI) in Java which allows the comparison of two images, the verification that an image is that of a specific person, and to search through the previously scanned irises for an exact match. The proposed scheme is computationally effective as well as reliable in term of recognition rate of 99.21%.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122422032","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}