Pub Date : 2008-10-01DOI: 10.1142/S021812660800471X
K. Yamamura, Yasuaki Haga
In the tolerance analysis of electronic circuits, the concept of set-valued function is often useful. In this paper, an efficient algorithm is proposed for finding all solution sets of nonlinear resistive circuits described by systems of nonlinear equations containing set-valued functions termed piecewise-trapezoidal functions. By numerical examples, the effectiveness of the proposed algorithm is verified from various viewpoints. It is also shown that the proposed algorithm could find all solution regions to a system of 1000 piecewise-trapezoidal equations in practical computation time.
{"title":"DC Tolerance Analysis of Nonlinear Circuits Using Set-Valued Functions","authors":"K. Yamamura, Yasuaki Haga","doi":"10.1142/S021812660800471X","DOIUrl":"https://doi.org/10.1142/S021812660800471X","url":null,"abstract":"In the tolerance analysis of electronic circuits, the concept of set-valued function is often useful. In this paper, an efficient algorithm is proposed for finding all solution sets of nonlinear resistive circuits described by systems of nonlinear equations containing set-valued functions termed piecewise-trapezoidal functions. By numerical examples, the effectiveness of the proposed algorithm is verified from various viewpoints. It is also shown that the proposed algorithm could find all solution regions to a system of 1000 piecewise-trapezoidal equations in practical computation time.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270078","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-10-15DOI: 10.1109/ICCCAS.2007.4348185
Feng Qi Han, N. Rao
Genes with similar patterns of mRNA expression and similar functions are likely to be regulated via the same mechanisms. This work is based on Association Rules, combined with Hash-tree and Genetic Algorithm to mine co-regulated genes from yeast genome dataset by generating lots of co-regulated rules. The computer experiments verified the effectiveness of the proposed method. Comparing with the GO database, the results showed that some important relationships between the genes in function, component or process are found by our method. Some genes without annotation yet are also inferred to have similar functions with those annotated genes in same rule.
{"title":"Mining Co-regulated Genes Using Association Rules Combined with Hash-tree and Genetic Algorithms","authors":"Feng Qi Han, N. Rao","doi":"10.1109/ICCCAS.2007.4348185","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348185","url":null,"abstract":"Genes with similar patterns of mRNA expression and similar functions are likely to be regulated via the same mechanisms. This work is based on Association Rules, combined with Hash-tree and Genetic Algorithm to mine co-regulated genes from yeast genome dataset by generating lots of co-regulated rules. The computer experiments verified the effectiveness of the proposed method. Comparing with the GO database, the results showed that some important relationships between the genes in function, component or process are found by our method. Some genes without annotation yet are also inferred to have similar functions with those annotated genes in same rule.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116274081","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-07-11DOI: 10.1109/ICCCAS.2007.6251615
Lei Song, Du Xu, Guo Jiang, Qing Yao
In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.
{"title":"MMAR:A deadlock recovery-based fault tolerant routing algorithm for mesh/torus networks","authors":"Lei Song, Du Xu, Guo Jiang, Qing Yao","doi":"10.1109/ICCCAS.2007.6251615","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6251615","url":null,"abstract":"In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116895208","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-07-11DOI: 10.1109/ICCCAS.2007.4348195
Jianxin Wang, Yunqing Xia, Hongzhou Wang
Intrusion detection systems generally overload their human operators by triggering per day thousands of alarms most of which are false positives. A clustering method able to eliminate most false positives was put forward by Klaus Julisch, who proved that the clustering problem is NP-complete and proposed a low-quality approximation algorithm. In this paper, the simulated annealing technique is applied in the clustering procedure, to produce high-quality solutions. The local optimization strategy, cooling schedule, and evaluation function are discussed in details. A state-of-the-art selection table is proposed, which greatly reduces the evaluation operation. In order to validate the newly proposed algorithm, a kind of exhaustive searching is implemented, which can find global minima for comparison with the cost of long yet feasible execution time. The results show that the SA-based clustering algorithm can produce solutions with the quality very close to that of the best one, whilst the time consumption is within a reasonable range.
{"title":"Minining Intrusion Detection Alarms with an SA-based Clustering Approach","authors":"Jianxin Wang, Yunqing Xia, Hongzhou Wang","doi":"10.1109/ICCCAS.2007.4348195","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348195","url":null,"abstract":"Intrusion detection systems generally overload their human operators by triggering per day thousands of alarms most of which are false positives. A clustering method able to eliminate most false positives was put forward by Klaus Julisch, who proved that the clustering problem is NP-complete and proposed a low-quality approximation algorithm. In this paper, the simulated annealing technique is applied in the clustering procedure, to produce high-quality solutions. The local optimization strategy, cooling schedule, and evaluation function are discussed in details. A state-of-the-art selection table is proposed, which greatly reduces the evaluation operation. In order to validate the newly proposed algorithm, a kind of exhaustive searching is implemented, which can find global minima for comparison with the cost of long yet feasible execution time. The results show that the SA-based clustering algorithm can produce solutions with the quality very close to that of the best one, whilst the time consumption is within a reasonable range.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117274250","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-07-11DOI: 10.1109/ICCCAS.2007.4348291
Hongyan Zang, L. Min, Geng Zhao
A constructive theorem of generalized synchronization (GS) for discrete-time chaos system (DTCS) is introduced. Based on the theorem, one can design a GS driven DTCS via a driving chaotic DTCS. As an application, a GS DTCS is constructed based on the Lorenz three-dimensional chaotic map and the Theorem. Using the DTCS designs a encryption scheme with "one-time pad" function. This scheme is able successfully to encrypt and decrypt original information without any loss. The scheme is sensitive to the perturbations of the parameters and initial conditions of the DTCS. Any perturbations which are larger than 10-15 will make corresponding decryptions become impossible. The key space of the scheme is as large as 10204. The analysis of the key space, sensitivity of key parameters show that this scheme has sound security. Numerical simulations show that our scheme is effective to be used in secure communication.
{"title":"A generalized synchronization theorem for discrete-time chaos system with application in data encryption scheme","authors":"Hongyan Zang, L. Min, Geng Zhao","doi":"10.1109/ICCCAS.2007.4348291","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348291","url":null,"abstract":"A constructive theorem of generalized synchronization (GS) for discrete-time chaos system (DTCS) is introduced. Based on the theorem, one can design a GS driven DTCS via a driving chaotic DTCS. As an application, a GS DTCS is constructed based on the Lorenz three-dimensional chaotic map and the Theorem. Using the DTCS designs a encryption scheme with \"one-time pad\" function. This scheme is able successfully to encrypt and decrypt original information without any loss. The scheme is sensitive to the perturbations of the parameters and initial conditions of the DTCS. Any perturbations which are larger than 10-15 will make corresponding decryptions become impossible. The key space of the scheme is as large as 10204. The analysis of the key space, sensitivity of key parameters show that this scheme has sound security. Numerical simulations show that our scheme is effective to be used in secure communication.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127178335","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-07-11DOI: 10.1109/ICCCAS.2007.4348214
Jie Guo, Yibing Shi, Zhigang Wang
A DDR-based data acquisition storage module designed for a high-capacity high sampling rate digitizer is described in this paper. The architecture allows two identical data acquisition channels to record consecutive data streams in two acquisition modes-sequence mode in 256k points and single mode in 64M points per channel-at a sampling rate ranging from 40MSa/s to 400MSa/s. The prototype is accomplished by unique DDR SDRAM controller cores embedded in a FPGA device, long acquisition memories combined with a time interleaved ADC system. Also, a flexible trigger mechanism is imported to the module, which is a crucial component to a digitizer, enabling a precise trigger capture with adjustable pre-triggering depth.
{"title":"A Novel Design of DDR-based Data Acquisition Storage Module in a Digitizer","authors":"Jie Guo, Yibing Shi, Zhigang Wang","doi":"10.1109/ICCCAS.2007.4348214","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348214","url":null,"abstract":"A DDR-based data acquisition storage module designed for a high-capacity high sampling rate digitizer is described in this paper. The architecture allows two identical data acquisition channels to record consecutive data streams in two acquisition modes-sequence mode in 256k points and single mode in 64M points per channel-at a sampling rate ranging from 40MSa/s to 400MSa/s. The prototype is accomplished by unique DDR SDRAM controller cores embedded in a FPGA device, long acquisition memories combined with a time interleaved ADC system. Also, a flexible trigger mechanism is imported to the module, which is a crucial component to a digitizer, enabling a precise trigger capture with adjustable pre-triggering depth.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123308454","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-07-11DOI: 10.1109/ICCCAS.2007.6250072
D. Zhao, Peng Liu, Bingzhong Wang
Photoconductive microwave switches with inline-embedded resonating filter for the application in reconfigurable antenna systems are presented. The resonating filters are used to block microwave signals under the dark state so that it can effectively improve the isolation of the devices. These novel switches are numerically simulated by commercial software and results show that the proposed switches have great improvement of the isolation by 20dB than the photoconductive microstrip switches previously reported. The maximum isolation obtained at X band can be up to 53dB.
{"title":"Resonating photoconductive microwave switches for reconfigurable antenna system","authors":"D. Zhao, Peng Liu, Bingzhong Wang","doi":"10.1109/ICCCAS.2007.6250072","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250072","url":null,"abstract":"Photoconductive microwave switches with inline-embedded resonating filter for the application in reconfigurable antenna systems are presented. The resonating filters are used to block microwave signals under the dark state so that it can effectively improve the isolation of the devices. These novel switches are numerically simulated by commercial software and results show that the proposed switches have great improvement of the isolation by 20dB than the photoconductive microstrip switches previously reported. The maximum isolation obtained at X band can be up to 53dB.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123564295","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-07-11DOI: 10.1109/ICCCAS.2007.4348287
Zhao Jian-hong, Y. Jianyu
Received power of signal and clutter for airborne wideband radar is developed. Signal-clutter power ratio (SCR), signal-noise power ratio (SNR), clutter-noise power ratio (CNR), signal-clutter plus noise power ratio (SCNR) respectively for narrowband radar and wideband radar are given. Computer simulation shows, under the same conditions, wideband radar can provide better SNR, SCR and SCNR performance in one range resolution cell than narrowband radar, so wideband signal will be of more benefit to a target detector.
{"title":"Signal-clutter-noise power ratio of airborne wideband radar","authors":"Zhao Jian-hong, Y. Jianyu","doi":"10.1109/ICCCAS.2007.4348287","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348287","url":null,"abstract":"Received power of signal and clutter for airborne wideband radar is developed. Signal-clutter power ratio (SCR), signal-noise power ratio (SNR), clutter-noise power ratio (CNR), signal-clutter plus noise power ratio (SCNR) respectively for narrowband radar and wideband radar are given. Computer simulation shows, under the same conditions, wideband radar can provide better SNR, SCR and SCNR performance in one range resolution cell than narrowband radar, so wideband signal will be of more benefit to a target detector.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122738071","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-07-11DOI: 10.1109/ICCCAS.2007.4348173
Zhenming Peng, Tao Chen, Shengjun Tian, Heping Zhao, Fanbin Meng
This paper presents a new strategy to speed up the encoding process for fractal image compression. First, the range blocks are obtained by partitioning the image using adaptive quadtrees. Then we extract the high-order spectrum based on nonparametric double-spectrum estimation to constitute the eigenvector for the image block which size is larger than 4times4. The lower dimension kd-tree structure is to be created while orthogonal projecting these eigenvectors of high-order spectrum for the image block. The fractal code is quickly obtained by using nearest neighbor searching algorithm and quantizing the transform parameters. The experimental results show that, in comparison with conventional methods, the proposed algorithm can provide better speed-up and image quality under the same compression ratio.
{"title":"Fractal Image Coding Based on High Order Spectrum Using Nonparametric Estimation","authors":"Zhenming Peng, Tao Chen, Shengjun Tian, Heping Zhao, Fanbin Meng","doi":"10.1109/ICCCAS.2007.4348173","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348173","url":null,"abstract":"This paper presents a new strategy to speed up the encoding process for fractal image compression. First, the range blocks are obtained by partitioning the image using adaptive quadtrees. Then we extract the high-order spectrum based on nonparametric double-spectrum estimation to constitute the eigenvector for the image block which size is larger than 4times4. The lower dimension kd-tree structure is to be created while orthogonal projecting these eigenvectors of high-order spectrum for the image block. The fractal code is quickly obtained by using nearest neighbor searching algorithm and quantizing the transform parameters. The experimental results show that, in comparison with conventional methods, the proposed algorithm can provide better speed-up and image quality under the same compression ratio.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122834606","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-07-11DOI: 10.1109/ICCCAS.2007.6250052
Jijun Zheng, Weile Zhu
An efficient maximum likelihood estimator has been proposed by Moose [4] for carrier frequency estimation in orthogonal frequency division multiplexing systems. The scheme is based on the observation of two consecutive and identical symbols in the frequency domain and its estimation range is less than or equal to +0.5 of the subcarrier spacing. In this paper, we extend the algorithm by using training symbols in the time-domain. It can widen the estimation range and the performance is the same as the Moose algorithm at the cost of increasing the computational complexity.
{"title":"An improved method for OFDM carrier frequency offset estimation","authors":"Jijun Zheng, Weile Zhu","doi":"10.1109/ICCCAS.2007.6250052","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250052","url":null,"abstract":"An efficient maximum likelihood estimator has been proposed by Moose [4] for carrier frequency estimation in orthogonal frequency division multiplexing systems. The scheme is based on the observation of two consecutive and identical symbols in the frequency domain and its estimation range is less than or equal to +0.5 of the subcarrier spacing. In this paper, we extend the algorithm by using training symbols in the time-domain. It can widen the estimation range and the performance is the same as the Moose algorithm at the cost of increasing the computational complexity.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122908091","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
扫码关注我们
求助内容：
应助结果提醒方式：