Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626958
Guoping Wang, J. Shield
Multiplication is one of the basic and critical operations in the computations. Efficient implementations of multipliers are required in many applications. In this paper, a new implementation of the array multiplier for unsigned numbers is proposed which significantly reduces the silicon area compared to recently published array multiplier while with no penalty of speed and power. The proposed scheme is applicable for VLSI and FPGA application and it can be easily extended to signed number computations
{"title":"The efficient implementation of an array multiplier","authors":"Guoping Wang, J. Shield","doi":"10.1109/EIT.2005.1626958","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626958","url":null,"abstract":"Multiplication is one of the basic and critical operations in the computations. Efficient implementations of multipliers are required in many applications. In this paper, a new implementation of the array multiplier for unsigned numbers is proposed which significantly reduces the silicon area compared to recently published array multiplier while with no penalty of speed and power. The proposed scheme is applicable for VLSI and FPGA application and it can be easily extended to signed number computations","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122580481","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626989
Chung-Yen Chang, Y. Chu, R. Taylor
Backup and restore are critical tasks performed on every system that holds important data. This paper evaluates the performance of two innovative backup methods based on frozen image technologies. VERITAS netbackup instant recovery option utilizes frozen images created from file system or volume manager utilities and manages these frozen images as backups. Because creating frozen images involve no actual copying of data, such backups are significantly faster. In addition, the frozen images reside on online storages, making restore from them much more efficient as well. In this paper, we conducted backups and restores in a database environment to demonstrate the advantages of using the frozen image based backup/restore with the VERITAS file system's storage checkpoint and VERITAS volume manager's volume snapshot. With both methods, taking a full backup of a 26 gigabytes database took less than 4% of the time compared to traditional tape-based backup. The amount of time to restore different database objects from frozen images ranges from 3 to 47% of the time restoring from tapes. While both backup and restore from frozen images are much more efficient than traditional backup methods, they are meant to complement, not to replace the traditional backups. This is because frozen images share common resources with the system they are protecting and are subjected to the same risks that might damage the data. The traditional backup method offers protection against a wider array of risks that can cause data loss and should be kept in as part of an overall data protection strategy
{"title":"Performance analysis of two frozen image based backup/restore methods","authors":"Chung-Yen Chang, Y. Chu, R. Taylor","doi":"10.1109/EIT.2005.1626989","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626989","url":null,"abstract":"Backup and restore are critical tasks performed on every system that holds important data. This paper evaluates the performance of two innovative backup methods based on frozen image technologies. VERITAS netbackup instant recovery option utilizes frozen images created from file system or volume manager utilities and manages these frozen images as backups. Because creating frozen images involve no actual copying of data, such backups are significantly faster. In addition, the frozen images reside on online storages, making restore from them much more efficient as well. In this paper, we conducted backups and restores in a database environment to demonstrate the advantages of using the frozen image based backup/restore with the VERITAS file system's storage checkpoint and VERITAS volume manager's volume snapshot. With both methods, taking a full backup of a 26 gigabytes database took less than 4% of the time compared to traditional tape-based backup. The amount of time to restore different database objects from frozen images ranges from 3 to 47% of the time restoring from tapes. While both backup and restore from frozen images are much more efficient than traditional backup methods, they are meant to complement, not to replace the traditional backups. This is because frozen images share common resources with the system they are protecting and are subjected to the same risks that might damage the data. The traditional backup method offers protection against a wider array of risks that can cause data loss and should be kept in as part of an overall data protection strategy","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129165436","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627053
S. Datta, S. Biswas
In this paper we propose and analyze a new interface idling mechanism for improving carrier-sense energy expenditure of IEEE 802.11 based wireless network interfaces. A novel protocol state analysis technique is developed for detecting time windows during which a node consumes energy due to erroneous carrier sensing. During this window, energy savings at the MAC layer is accomplished by forcing a wireless interface to a relatively low-energy idling state. At the end of this window, an interface is transitioned back to its regular receiving mode. Energy savings are realized by exploiting the difference in power consumption between the erroneous carrier sensing state and the idling state. We evaluate the proposed protocols using ns-2 simulator. Simulation experiments demonstrate that the proposed mechanisms are capable of significantly reducing erroneous carrier sensing expenditure for newer generation of 802.11 cards that support low-energy idling modes as described above. Our experimentation with Socket Communication Inc.'s low power 802.11 card demonstrate that the reduction in combined overhearing and erroneous carrier sensing expenditure can be up to 62% and can extend network life by up to 154%. Results also show that the proposed MAC layer idling is fairly insensitive to mobility
本文提出并分析了一种新的接口空转机制，以改善基于IEEE 802.11的无线网络接口的载波感知能量消耗。提出了一种新的协议状态分析技术，用于检测节点因载波感知错误而消耗能量的时间窗。在这个窗口期间，MAC层的节能是通过迫使无线接口进入相对低能量的空闲状态来实现的。在此窗口结束时，接口将转换回其常规接收模式。通过利用错误载波感知状态和空转状态之间的功耗差异来实现节能。我们使用ns-2模拟器对所提出的协议进行了评估。仿真实验表明，所提出的机制能够显著减少新一代802.11卡的错误载波传感支出，支持上述低能量空转模式。我们对Socket Communication Inc.的低功耗802.11卡进行的实验表明，侦听和错误载波感知支出的组合减少可高达62%，并可将网络寿命延长高达154%。结果还表明，所提出的MAC层空转对移动性相当不敏感
{"title":"Energy savings by intelligent interface idling in 802.11 based wireless networks","authors":"S. Datta, S. Biswas","doi":"10.1109/EIT.2005.1627053","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627053","url":null,"abstract":"In this paper we propose and analyze a new interface idling mechanism for improving carrier-sense energy expenditure of IEEE 802.11 based wireless network interfaces. A novel protocol state analysis technique is developed for detecting time windows during which a node consumes energy due to erroneous carrier sensing. During this window, energy savings at the MAC layer is accomplished by forcing a wireless interface to a relatively low-energy idling state. At the end of this window, an interface is transitioned back to its regular receiving mode. Energy savings are realized by exploiting the difference in power consumption between the erroneous carrier sensing state and the idling state. We evaluate the proposed protocols using ns-2 simulator. Simulation experiments demonstrate that the proposed mechanisms are capable of significantly reducing erroneous carrier sensing expenditure for newer generation of 802.11 cards that support low-energy idling modes as described above. Our experimentation with Socket Communication Inc.'s low power 802.11 card demonstrate that the reduction in combined overhearing and erroneous carrier sensing expenditure can be up to 62% and can extend network life by up to 154%. Results also show that the proposed MAC layer idling is fairly insensitive to mobility","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132049012","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626979
B. Lekkala, B. Ramamurthy
Routing techniques used in wavelength routed optical networks (WRN) do not give an efficient solution with waveband routed optical networks (WBN) as the objective of routing in WRN is to reduce the blocking probability and that in WBN is to reduce the number of switching ports. Routing in WBN can be divided two parts, finding the route and grouping the wavelength assigned into that route with some existing wavelengths/wavebands. In this paper, we propose a heuristic for waveband routing, which uses a new grouping strategy called discontinuous waveband grouping to group the wavelengths into a waveband. The main objective of our algorithm is to decrease the total number of ports required and reduce the blocking probability of the network. The performance of the heuristic is analyzed using simulation on a WBN with non-uniform wavebands
{"title":"Discontinuous waveband switching in WDM optical networks","authors":"B. Lekkala, B. Ramamurthy","doi":"10.1109/EIT.2005.1626979","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626979","url":null,"abstract":"Routing techniques used in wavelength routed optical networks (WRN) do not give an efficient solution with waveband routed optical networks (WBN) as the objective of routing in WRN is to reduce the blocking probability and that in WBN is to reduce the number of switching ports. Routing in WBN can be divided two parts, finding the route and grouping the wavelength assigned into that route with some existing wavelengths/wavebands. In this paper, we propose a heuristic for waveband routing, which uses a new grouping strategy called discontinuous waveband grouping to group the wavelengths into a waveband. The main objective of our algorithm is to decrease the total number of ports required and reduce the blocking probability of the network. The performance of the heuristic is analyzed using simulation on a WBN with non-uniform wavebands","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130456015","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627037
Xiaoping Jia, Adam Steele, Lizhang Qin, Hongming Liu, Christopher Jones
Modern driven development (MDD) defines a new approach to develop software system other than programming. MDD emphasizes the model level design by defining the specifications for a software system, and uses automatic tools to generate implementations on specific platforms. In the MDD process, many separate views and models are specified for different parts of the system. In the ZOOM notation, which is a formal notation we proposed to enhance the existing modeling notations and support MDD, the structural, behavioral and UI models are three components for a software model. In this paper, we present a pre-defined event model, processed through an event-driven framework, which integrates these views, and provides the run-time execution model for ZOOM
{"title":"An event-based framework for model integration","authors":"Xiaoping Jia, Adam Steele, Lizhang Qin, Hongming Liu, Christopher Jones","doi":"10.1109/EIT.2005.1627037","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627037","url":null,"abstract":"Modern driven development (MDD) defines a new approach to develop software system other than programming. MDD emphasizes the model level design by defining the specifications for a software system, and uses automatic tools to generate implementations on specific platforms. In the MDD process, many separate views and models are specified for different parts of the system. In the ZOOM notation, which is a formal notation we proposed to enhance the existing modeling notations and support MDD, the structural, behavioral and UI models are three components for a software model. In this paper, we present a pre-defined event model, processed through an event-driven framework, which integrates these views, and provides the run-time execution model for ZOOM","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130550903","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627021
R. Shyam Sunder, C. Eswaran, N. Sriraam
In this paper, 3-D discrete Hartley, cosine and Fourier transforms are used for the compression of magnetic resonance images and X-ray angiograms. The performance results are then compared and evaluated. The transforms are applied on image blocks of sizes 8times8timesM where M represents the number of slices. The resultant transform coefficients are quantized and then encoded using a combination of run length and Huffman coding schemes to achieve maximum compression. The performances of the transforms are evaluated in terms of peak signal to noise ratio and bit rate. It is found from the experimental results, that 3-D discrete Hartley transform yields the best results for magnetic resonance brain images whereas for X-ray angiograms the 3-D discrete cosine transform is found to be superior to the other two transforms
{"title":"Performance evaluation of 3-D transforms for medical image compression","authors":"R. Shyam Sunder, C. Eswaran, N. Sriraam","doi":"10.1109/EIT.2005.1627021","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627021","url":null,"abstract":"In this paper, 3-D discrete Hartley, cosine and Fourier transforms are used for the compression of magnetic resonance images and X-ray angiograms. The performance results are then compared and evaluated. The transforms are applied on image blocks of sizes 8times8timesM where M represents the number of slices. The resultant transform coefficients are quantized and then encoded using a combination of run length and Huffman coding schemes to achieve maximum compression. The performances of the transforms are evaluated in terms of peak signal to noise ratio and bit rate. It is found from the experimental results, that 3-D discrete Hartley transform yields the best results for magnetic resonance brain images whereas for X-ray angiograms the 3-D discrete cosine transform is found to be superior to the other two transforms","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127263947","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626978
G. Yu, Leen-Kiat Soh, A. Bond
Clustering is a practical data mining approach of pattern detection. Because of the sensitivity of initial conditions, k-means clustering often suffers from low clustering performance. We present a procedure to refine initial conditions of k-means clustering by analyzing density distributions of a data set before estimating the number of clusters k necessary for the data set, as well as the positions of the initial centroids of the clusters. We demonstrate that this approach indeed improves the accuracy and performance of k-means clustering measured by average intra to inter-clustering error ratio. This method is applied to the virtual ecology project to design a virtual blue jay system
{"title":"K-means clustering with multiresolution peak detection","authors":"G. Yu, Leen-Kiat Soh, A. Bond","doi":"10.1109/EIT.2005.1626978","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626978","url":null,"abstract":"Clustering is a practical data mining approach of pattern detection. Because of the sensitivity of initial conditions, k-means clustering often suffers from low clustering performance. We present a procedure to refine initial conditions of k-means clustering by analyzing density distributions of a data set before estimating the number of clusters k necessary for the data set, as well as the positions of the initial centroids of the clusters. We demonstrate that this approach indeed improves the accuracy and performance of k-means clustering measured by average intra to inter-clustering error ratio. This method is applied to the virtual ecology project to design a virtual blue jay system","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124154844","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627000
S. H. Chandio, D. Bastola, P. Iwen, S. Hinrichs
The lack of rapid diagnostic procedures is a major obstacle in the successful management of fungal disease. Most of the methods now used in the microbiology laboratory include growth-based phenotypic testing. However, polymerase chain reaction (PCR) has allowed for rapid identification of organism without the need for a growing culture. An ion-paired reverse phase chromatography (IP-RP)-based assay using high performance liquid chromatography (HPLC) was developed with commercially available IP-RP-HPLC system called the WAVE to differentiate medically important fungi. Universal fungus-specific primers and restriction fragment length polymorphism (RFLP) of PCR amplicon were done prior to WAVE analysis. The assay was enhanced when combined with a searchable relational database of retention time. Discrimination among closely related fungal species was possible by evaluation of distinct-retention time patterns. This assay is simple, rapid, and allows for the identification of medically important fungi by searching the database with the information obtained from PCR-WAVE analysis
{"title":"Identification of pathogenic fungi using computational and molecular biological approaches","authors":"S. H. Chandio, D. Bastola, P. Iwen, S. Hinrichs","doi":"10.1109/EIT.2005.1627000","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627000","url":null,"abstract":"The lack of rapid diagnostic procedures is a major obstacle in the successful management of fungal disease. Most of the methods now used in the microbiology laboratory include growth-based phenotypic testing. However, polymerase chain reaction (PCR) has allowed for rapid identification of organism without the need for a growing culture. An ion-paired reverse phase chromatography (IP-RP)-based assay using high performance liquid chromatography (HPLC) was developed with commercially available IP-RP-HPLC system called the WAVE to differentiate medically important fungi. Universal fungus-specific primers and restriction fragment length polymorphism (RFLP) of PCR amplicon were done prior to WAVE analysis. The assay was enhanced when combined with a searchable relational database of retention time. Discrimination among closely related fungal species was possible by evaluation of distinct-retention time patterns. This assay is simple, rapid, and allows for the identification of medically important fungi by searching the database with the information obtained from PCR-WAVE analysis","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125294828","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
扫码关注我们
求助内容：
应助结果提醒方式：