Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579443
M. Chayon, T. Rahman, M. Rabbi, M. Masum
Today is the age of fast and automated system. In every part of our live we want the automated system. In communication system, this automated system is vastly needed. Now Bluetooth is compatible for large Scale sensor network. Bluetooth device is also very cheap and available. So we can use this technology in many practical cases in our country. We know flood destroy our poor country every year for lack of information about the rivers. So if we can monitor the rivers properly and timely we can overcome this destruction. To monitor these rivers we can use sensor network with the help of Bluetooth. If we can establish the sensor nodes that are integrated with Bluetooth in the river side we can easily monitor the rivers timely and properly. By this we can setup an automated river monitoring system using sensor network.
{"title":"Automated river monitoring system for Bangladesh using wireless sensor network","authors":"M. Chayon, T. Rahman, M. Rabbi, M. Masum","doi":"10.1109/ICCITECHN.2007.4579443","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579443","url":null,"abstract":"Today is the age of fast and automated system. In every part of our live we want the automated system. In communication system, this automated system is vastly needed. Now Bluetooth is compatible for large Scale sensor network. Bluetooth device is also very cheap and available. So we can use this technology in many practical cases in our country. We know flood destroy our poor country every year for lack of information about the rivers. So if we can monitor the rivers properly and timely we can overcome this destruction. To monitor these rivers we can use sensor network with the help of Bluetooth. If we can establish the sensor nodes that are integrated with Bluetooth in the river side we can easily monitor the rivers timely and properly. By this we can setup an automated river monitoring system using sensor network.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"23 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":"126598663","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579390
M. Islam, U. Kabir
Load balancing is the key to the efficient operation of distributed systems. To efficiently utilize computing resources provided by distributed systems, an underlying dynamic load balancing (DLB) scheme must address both heterogeneous and dynamic features of distributed systems. In this paper, a DLB scheme for solution adaptive finite element graph applications on distributed systems is proposed. Experiments show that by using the proposed distributed DLB scheme, the execution time and the number of process migration is close to using condensed binary tree load balancing (CBTLB) scheme which does not consider the dynamic nature and diverse platform of distributed systems.
{"title":"A dynamic load balancing approach for solution adaptive finite element graph applications on distributed systems","authors":"M. Islam, U. Kabir","doi":"10.1109/ICCITECHN.2007.4579390","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579390","url":null,"abstract":"Load balancing is the key to the efficient operation of distributed systems. To efficiently utilize computing resources provided by distributed systems, an underlying dynamic load balancing (DLB) scheme must address both heterogeneous and dynamic features of distributed systems. In this paper, a DLB scheme for solution adaptive finite element graph applications on distributed systems is proposed. Experiments show that by using the proposed distributed DLB scheme, the execution time and the number of process migration is close to using condensed binary tree load balancing (CBTLB) scheme which does not consider the dynamic nature and diverse platform of distributed systems.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"22 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":"132099574","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579370
D. Yasmin, S. Rafique
In this research study, an integrated network of GPS-24, GEO and LEO has been designed to improve the worst-case precision values. The precision values to be realized by the receiver with an algorithm have been proposed. It is expected that a good worldwide availability of best four selected orbiting satellites among many having maximum coverage would be the preferred constellation for navigation. A new approach for minimum dilution of precision (DOP) determination using integrated constellation is developed. Satellite visibility through GPS receiver has been investigated using complex simulations of failure scenarios by giving shadow effect. This work is to improve coverage and satellite visibility for accurate, flexible, fast and cost-effective navigation purpose using integrated network. Using a 3-step algorithm a set of best four satellites selection is possible by minimum calculation by determining minimum DOP. A measurement for positioning, satellites at low elevation angles and at high elevation angles has been compared. The proposed model and algorithm will hopefully be used for navigation purposes in the worst case. The system can also be used academically as well as for commercial purpose.
{"title":"Integration of GPS-24, GEO & LEO: Modeling, receiver selection algorithm and performance analysis for navigation","authors":"D. Yasmin, S. Rafique","doi":"10.1109/ICCITECHN.2007.4579370","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579370","url":null,"abstract":"In this research study, an integrated network of GPS-24, GEO and LEO has been designed to improve the worst-case precision values. The precision values to be realized by the receiver with an algorithm have been proposed. It is expected that a good worldwide availability of best four selected orbiting satellites among many having maximum coverage would be the preferred constellation for navigation. A new approach for minimum dilution of precision (DOP) determination using integrated constellation is developed. Satellite visibility through GPS receiver has been investigated using complex simulations of failure scenarios by giving shadow effect. This work is to improve coverage and satellite visibility for accurate, flexible, fast and cost-effective navigation purpose using integrated network. Using a 3-step algorithm a set of best four satellites selection is possible by minimum calculation by determining minimum DOP. A measurement for positioning, satellites at low elevation angles and at high elevation angles has been compared. The proposed model and algorithm will hopefully be used for navigation purposes in the worst case. The system can also be used academically as well as for commercial purpose.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"46 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":"132993573","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579388
A. Rahman, M. Murshed
Dynamic textures are textures with motion. Characterization of visual processes consisting of multiple dynamic textures is of vital importance to computer vision research, with a diverse set of applications in the field of robot navigation, and remote monitoring applications etc. In the current literature, however, studies are mostly limited to characterization of single dynamic textures. In this paper we aim to address the problem of segmenting image sequences consisting of multiple dynamic textures. More precisely we separate image segments having different characteristic motion patterns - a key attribute of individual dynamic textures. Experimental results demonstrate the ability of the proposed technique by segmenting a wide variety of multiple dynamic texture image sequences.
{"title":"Segmentation of dynamic textures","authors":"A. Rahman, M. Murshed","doi":"10.1109/ICCITECHN.2007.4579388","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579388","url":null,"abstract":"Dynamic textures are textures with motion. Characterization of visual processes consisting of multiple dynamic textures is of vital importance to computer vision research, with a diverse set of applications in the field of robot navigation, and remote monitoring applications etc. In the current literature, however, studies are mostly limited to characterization of single dynamic textures. In this paper we aim to address the problem of segmenting image sequences consisting of multiple dynamic textures. More precisely we separate image segments having different characteristic motion patterns - a key attribute of individual dynamic textures. Experimental results demonstrate the ability of the proposed technique by segmenting a wide variety of multiple dynamic texture image sequences.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"31 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":"133414690","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}
Pub Date : 2007-12-01DOI: 10.1109/ANTS.2007.4620211
T. Amin, S. Majumder
Performance analysis is carried out for an optical wireless link in the presence of atmospheric scintillation using OOK and M-ary PPM modulation schemes. The bit error rate (BER) performance results evaluated at a bit rate of 1 Gbps show that system suffers significant penalty in required photon count per bit to achieve a given BER due to atmospheric scintillation effect. It is noticed that penalty is approximately 128.2, 186.7, 215 and 356.6 photons per bit corresponding to OPPM, QPPM, OOK and BPPM respectively at a scintillation variance of 0.01.
{"title":"Performance limitation of M-ary pulse position modulation and on-off keying in a direct detection optical wireless communication system","authors":"T. Amin, S. Majumder","doi":"10.1109/ANTS.2007.4620211","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4620211","url":null,"abstract":"Performance analysis is carried out for an optical wireless link in the presence of atmospheric scintillation using OOK and M-ary PPM modulation schemes. The bit error rate (BER) performance results evaluated at a bit rate of 1 Gbps show that system suffers significant penalty in required photon count per bit to achieve a given BER due to atmospheric scintillation effect. It is noticed that penalty is approximately 128.2, 186.7, 215 and 356.6 photons per bit corresponding to OPPM, QPPM, OOK and BPPM respectively at a scintillation variance of 0.01.","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":"126373468","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579363
A. Saber, S. Ahmmed, A. Alshareef, A. Abdulwhab, K. Adbullah-Al-Mamun
This paper presents a modified particle swarm optimization (MPSO) for constrained non-linear optimization problems. Optimization problems are very complex in real life applications. The proposed modified PSO consists of problem (complexity) dependent variable number of promising values (in velocity vector), error-iteration dependent step length, unlocking the dead look of idle particles and so on. It reliably and accurately tracks a continuously changing solution of the complex function and no extra concentration/effort is needed for more complex higher order functions. Constraint management is incorporated in the modified PSO by penalty function. The modified PSO has balance between local and global searching abilities, and an appropriate fitness function helps to converge it quickly. To avoid the method to be frozen, stagnated/idle particles are reset. Finally, benchmark data and methods are used to show the effectiveness of the proposed method.
{"title":"Constrained non-linear optimization by modified particle swarm optimization","authors":"A. Saber, S. Ahmmed, A. Alshareef, A. Abdulwhab, K. Adbullah-Al-Mamun","doi":"10.1109/ICCITECHN.2007.4579363","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579363","url":null,"abstract":"This paper presents a modified particle swarm optimization (MPSO) for constrained non-linear optimization problems. Optimization problems are very complex in real life applications. The proposed modified PSO consists of problem (complexity) dependent variable number of promising values (in velocity vector), error-iteration dependent step length, unlocking the dead look of idle particles and so on. It reliably and accurately tracks a continuously changing solution of the complex function and no extra concentration/effort is needed for more complex higher order functions. Constraint management is incorporated in the modified PSO by penalty function. The modified PSO has balance between local and global searching abilities, and an appropriate fitness function helps to converge it quickly. To avoid the method to be frozen, stagnated/idle particles are reset. Finally, benchmark data and methods are used to show the effectiveness of the proposed method.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"106 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":"131450705","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579404
Md Faisal Kabir, S. Aziz, S. Ahmmed, C.M. Rahman
The efficient design of multiple Boolean functions is becoming important and necessary during computer aided design for circuit and systems (CADCS), especially the manufacture of chips have reached a density of several ten thousands transistors per chip, so called very large scale integration (VLSI). To simplify the Boolean expressions by conventional approaches like graphical observation-based K-MAP or other simplification procedures become tedious or even impossible when the number of variables in a truth table exceeds certain limit. In this paper we propose an information theory based circuit designing approach for deriving minimal sum of product (SOP) expressions for unlimited number of variable. We have verified our approach on a number of cases with the conclusion that the proposed approach is a better alternative to conventional approaches particularly when the numbers of variables restrict the use of conventional approaches. The key feature of proposed method is that it performs a hill-climbing search through the state space of Boolean variables using information theoretic heuristic to find the minimal SOP expression.
{"title":"Information theoretic SOP expression minimization technique","authors":"Md Faisal Kabir, S. Aziz, S. Ahmmed, C.M. Rahman","doi":"10.1109/ICCITECHN.2007.4579404","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579404","url":null,"abstract":"The efficient design of multiple Boolean functions is becoming important and necessary during computer aided design for circuit and systems (CADCS), especially the manufacture of chips have reached a density of several ten thousands transistors per chip, so called very large scale integration (VLSI). To simplify the Boolean expressions by conventional approaches like graphical observation-based K-MAP or other simplification procedures become tedious or even impossible when the number of variables in a truth table exceeds certain limit. In this paper we propose an information theory based circuit designing approach for deriving minimal sum of product (SOP) expressions for unlimited number of variable. We have verified our approach on a number of cases with the conclusion that the proposed approach is a better alternative to conventional approaches particularly when the numbers of variables restrict the use of conventional approaches. The key feature of proposed method is that it performs a hill-climbing search through the state space of Boolean variables using information theoretic heuristic to find the minimal SOP expression.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"519 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":"115905813","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579381
M.N. Islam, M. Islam, I.J. Shadaque, M. Khan
Searching is an important factor in p2p network for content retrieval. Most of the searches in p2p system are title-based with their limited functionality. Without knowing the unique filename we canpsilat retrieve the content of the file in title based search. Here super peer p2p network is designed that supports content-based search for relevant documents. At the beginning, a general and extensible framework is proposed which is based on hierarchical summary structure for searching similar documents in p2p network. The summary structure is formed by Vector Space Model (VSM), Latent Semantic Indexing (LSI) and Singular Value Decomposition (SVD) techniques. Than an effective document searching is developed by summarizing and maintaining all documents within the network with different factors. Finally at the end, the experimental result is verified on a real p2p prototype and large scale network. The results show the effectiveness, efficiency and scalability of the proposed system.
{"title":"Developing an extensible framework for content based searching in super peer p2p network","authors":"M.N. Islam, M. Islam, I.J. Shadaque, M. Khan","doi":"10.1109/ICCITECHN.2007.4579381","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579381","url":null,"abstract":"Searching is an important factor in p2p network for content retrieval. Most of the searches in p2p system are title-based with their limited functionality. Without knowing the unique filename we canpsilat retrieve the content of the file in title based search. Here super peer p2p network is designed that supports content-based search for relevant documents. At the beginning, a general and extensible framework is proposed which is based on hierarchical summary structure for searching similar documents in p2p network. The summary structure is formed by Vector Space Model (VSM), Latent Semantic Indexing (LSI) and Singular Value Decomposition (SVD) techniques. Than an effective document searching is developed by summarizing and maintaining all documents within the network with different factors. Finally at the end, the experimental result is verified on a real p2p prototype and large scale network. The results show the effectiveness, efficiency and scalability of the proposed system.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"17 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":"122192761","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579444
K. S. Arefin, E. Ahmed
This paper processes a new cross-layer framework design for Parallel Download and Upload (PDU). This technique has been called as Parallel Loading of Access Points (PLAP). We have shown here our PLAP for Access Point (AP) and integrate Ad-hoc Procedure with AP to support the parallel download or upload applications. The results show that the proposed PLAP mechanism is faster and efficient for service setup and maintenance.
{"title":"Cross-layer design of wireless networking for Parallel Loading of Access Points (PLAP)","authors":"K. S. Arefin, E. Ahmed","doi":"10.1109/ICCITECHN.2007.4579444","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579444","url":null,"abstract":"This paper processes a new cross-layer framework design for Parallel Download and Upload (PDU). This technique has been called as Parallel Loading of Access Points (PLAP). We have shown here our PLAP for Access Point (AP) and integrate Ad-hoc Procedure with AP to support the parallel download or upload applications. The results show that the proposed PLAP mechanism is faster and efficient for service setup and maintenance.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"70 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":"126705922","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}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579423
N. Jahangir, A. Chowdhury
Automated banknote recognition system can be a very good utility in banking systems and other field of commerce. It can also aid visually impaired people. Although in Bangladesh, bill money recognition machines are not common but it is used in other countries. In this paper, for the first time, we have proposed a Neural Network based recognition scheme for Bangladeshi banknotes. The scheme can efficiently be implemented in cheap hardware which may be very useful in many places. The recognition system takes scanned images of banknotes which are scanned by low cost optoelectronic sensors and then fed into a Multilayer Perceptron, trained by Backpropagation algorithm, for recognition. Axis Symmetric Masks are used in preprocessing stage which reduces the network size and guarantees correct recognition even if the note is flipped. Experimental results are presented which show that this scheme can recognize currently available 8 notes (1, 2, 5, 10, 20, 50, 100 & 500 Taka) successfully with an average accuracy of 98.57%.
{"title":"Bangladeshi banknote recognition by neural network with axis symmetrical masks","authors":"N. Jahangir, A. Chowdhury","doi":"10.1109/ICCITECHN.2007.4579423","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579423","url":null,"abstract":"Automated banknote recognition system can be a very good utility in banking systems and other field of commerce. It can also aid visually impaired people. Although in Bangladesh, bill money recognition machines are not common but it is used in other countries. In this paper, for the first time, we have proposed a Neural Network based recognition scheme for Bangladeshi banknotes. The scheme can efficiently be implemented in cheap hardware which may be very useful in many places. The recognition system takes scanned images of banknotes which are scanned by low cost optoelectronic sensors and then fed into a Multilayer Perceptron, trained by Backpropagation algorithm, for recognition. Axis Symmetric Masks are used in preprocessing stage which reduces the network size and guarantees correct recognition even if the note is flipped. Experimental results are presented which show that this scheme can recognize currently available 8 notes (1, 2, 5, 10, 20, 50, 100 & 500 Taka) successfully with an average accuracy of 98.57%.","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":"129190889","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：