Pub Date : 2009-09-01DOI: 10.1109/YCICT.2009.5382427
Funian Li, Haiming Du, Chao Zhang, Xinda Ke
Cooperative communication is an efficient solution to combat wireless channel fading and to increase system throughput in future board communication. In this paper, we consider the uplink scenario of multi-user cooperative network, in which the resource is allocated to the users with the consideration of both fairness guarantee and throughput enhancement. The system uplink throughput is optimized by using decode-and-forward (DF) opportunistic relaying. We show that the optimization problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity. Thus we decomposed the optimization problem into two sub-problems of opportunistic relaying strategy and power allocation. First, the opportunistic relaying strategy is given by making use of the equivalent channel power gain. Second, a low-complexity power allocation scheme is proposed. The simulation result shows that the proposed scheme can both improve the system throughput and ensure the fairness.
{"title":"Opportunistic relaying in multiuser cooperative networks with proportional rate constraints","authors":"Funian Li, Haiming Du, Chao Zhang, Xinda Ke","doi":"10.1109/YCICT.2009.5382427","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382427","url":null,"abstract":"Cooperative communication is an efficient solution to combat wireless channel fading and to increase system throughput in future board communication. In this paper, we consider the uplink scenario of multi-user cooperative network, in which the resource is allocated to the users with the consideration of both fairness guarantee and throughput enhancement. The system uplink throughput is optimized by using decode-and-forward (DF) opportunistic relaying. We show that the optimization problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity. Thus we decomposed the optimization problem into two sub-problems of opportunistic relaying strategy and power allocation. First, the opportunistic relaying strategy is given by making use of the equivalent channel power gain. Second, a low-complexity power allocation scheme is proposed. The simulation result shows that the proposed scheme can both improve the system throughput and ensure the fairness.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124947684","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382399
Q. Miao, Min Huang, Qing Wei
This paper introduced a parallel implementation of Numerical Manifold Method based on multiprocessor platforms. First, the computing performance for a class of rock engineering problems was analyzed. For solving simultaneous equations is the most time consuming, we choose parallelized Jacobi's iterative method to speed up the computing process. The implementation of parallel Jacobi's iterative method with OpenMP was introduced. A series of experiments shows that our parallel algorithm is an effective way to improve computing performance for such class of engineering problems.
{"title":"Parallel computing of Numerical Manifold Method with OpenMP","authors":"Q. Miao, Min Huang, Qing Wei","doi":"10.1109/YCICT.2009.5382399","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382399","url":null,"abstract":"This paper introduced a parallel implementation of Numerical Manifold Method based on multiprocessor platforms. First, the computing performance for a class of rock engineering problems was analyzed. For solving simultaneous equations is the most time consuming, we choose parallelized Jacobi's iterative method to speed up the computing process. The implementation of parallel Jacobi's iterative method with OpenMP was introduced. A series of experiments shows that our parallel algorithm is an effective way to improve computing performance for such class of engineering problems.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128203642","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382376
Juan Zhao, Kejun Dong, Le Yang, Kai Nan, Baoping Yan
Internet has become the essential platform for access, processing and dissemination of scientific data and literature. To greatly enhance academic search, a novel academic metasearch engine called e-Scholar is presented in this paper, which is combined with entity extraction techniques to link the relevant data in scientific databases with the literature. We demonstrate a scalable architecture implementing the functions with little overhead. We also present our innovational approach to linking techniques. We demonstrate the features and significant system performance improvements by comparing e-Scholar with other academic search engines.
{"title":"E- Scholar: Improving academic search through combining metasearch with entity extraction","authors":"Juan Zhao, Kejun Dong, Le Yang, Kai Nan, Baoping Yan","doi":"10.1109/YCICT.2009.5382376","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382376","url":null,"abstract":"Internet has become the essential platform for access, processing and dissemination of scientific data and literature. To greatly enhance academic search, a novel academic metasearch engine called e-Scholar is presented in this paper, which is combined with entity extraction techniques to link the relevant data in scientific databases with the literature. We demonstrate a scalable architecture implementing the functions with little overhead. We also present our innovational approach to linking techniques. We demonstrate the features and significant system performance improvements by comparing e-Scholar with other academic search engines.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129125426","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382381
Wang Yunlu, Wu Zhendong
An effective blind detection for four kinds of echo hiding based on three cepstrums is proposed. Due to statistic characteristic changing with echo in stego speech, real cepstrum, complex cepstrum and power cepstrum are analyzed. Firstly we calculate high order statistics of each cepstrum, including coefficients of skewness and kurtosis in combination. Then we train the combinatorial skewness and kurtosis in each cepstrum of orignal speech and echoed speech with SVM. By obtaining combinatorial skewness-kurtosis thresholds, we can used them for blind steganalysis of echo hiding. Experimental results show that our proposed blind detection with three cepstrums performs well in testing Ker.1 and Ker.3 echo hiding, and power cepstrum achieves high accuracy in four kinds of echo hiding.
{"title":"Blind detection on echo hiding based on cepstrums","authors":"Wang Yunlu, Wu Zhendong","doi":"10.1109/YCICT.2009.5382381","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382381","url":null,"abstract":"An effective blind detection for four kinds of echo hiding based on three cepstrums is proposed. Due to statistic characteristic changing with echo in stego speech, real cepstrum, complex cepstrum and power cepstrum are analyzed. Firstly we calculate high order statistics of each cepstrum, including coefficients of skewness and kurtosis in combination. Then we train the combinatorial skewness and kurtosis in each cepstrum of orignal speech and echoed speech with SVM. By obtaining combinatorial skewness-kurtosis thresholds, we can used them for blind steganalysis of echo hiding. Experimental results show that our proposed blind detection with three cepstrums performs well in testing Ker.1 and Ker.3 echo hiding, and power cepstrum achieves high accuracy in four kinds of echo hiding.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122673724","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382336
Peng Gang
This paper presents a methodology for modeling and simulation of analog/mixed-signal systems using Verilog-AMS. Through this approach, it becomes more efficient and convenient to model analog, digital and mixed-signal design. Moreover, it is also a good solution for analog/mixed-signal verification because simulation time will be greatly decreased in this way. The applied methodology brings together the modeling and simulation of a PLL (Phase Locked Loop) in the Cadence AMS design environment. The results show that this methodology provides a standardized framework in order to efficiently and accurately model and simulate complex analog/mixed signal applications.
{"title":"Behavioral modeling and simulation of analog/mixed-signal systems using Verilog-AMS","authors":"Peng Gang","doi":"10.1109/YCICT.2009.5382336","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382336","url":null,"abstract":"This paper presents a methodology for modeling and simulation of analog/mixed-signal systems using Verilog-AMS. Through this approach, it becomes more efficient and convenient to model analog, digital and mixed-signal design. Moreover, it is also a good solution for analog/mixed-signal verification because simulation time will be greatly decreased in this way. The applied methodology brings together the modeling and simulation of a PLL (Phase Locked Loop) in the Cadence AMS design environment. The results show that this methodology provides a standardized framework in order to efficiently and accurately model and simulate complex analog/mixed signal applications.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075749","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382396
Shuai Liu, Yutao Liu, Xuezhi Tan
Cognitive radio is recognized as an efficient way to improve the spectrum efficiency. In the distributed cognitive radio networks of multiple primary users and a secondary user, we proposed a utility function based on idle probability of primary users by using game model. The primary users can achieve the Nash equilibrium by adjusting the learning rate through repeated games. Simulations show that the primary user whose idle probability is larger, the system utility is higher and the system utility becomes the largest when the spectrum offered by primary users is totally idle. Besides, the Nash equilibrium is not efficient as the total profit of the primary users is not maximized. The cooperative optimality solution can obtain the highest system profit finally.
{"title":"Competitive spectrum allocation in cognitive radio based on idle probability of primary users","authors":"Shuai Liu, Yutao Liu, Xuezhi Tan","doi":"10.1109/YCICT.2009.5382396","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382396","url":null,"abstract":"Cognitive radio is recognized as an efficient way to improve the spectrum efficiency. In the distributed cognitive radio networks of multiple primary users and a secondary user, we proposed a utility function based on idle probability of primary users by using game model. The primary users can achieve the Nash equilibrium by adjusting the learning rate through repeated games. Simulations show that the primary user whose idle probability is larger, the system utility is higher and the system utility becomes the largest when the spectrum offered by primary users is totally idle. Besides, the Nash equilibrium is not efficient as the total profit of the primary users is not maximized. The cooperative optimality solution can obtain the highest system profit finally.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901790","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382425
K. Halawa
A method of regularization of orthogonal neural networks using fractional derivatives is proposed in the paper. The cost function with a penalty for non-smoothness with fractional derivatives enabling to use a priori knowledge. The formula for network weight values which minimize the proposed cost function was derived. It was demonstrated the obtained matrix in normal equations is nonnegative-definite. The results of simulation experiments where the outlined method was used for modeling static nonlinear systems were shown.
{"title":"Regularization of orthogonal neural networks using fractional derivatives","authors":"K. Halawa","doi":"10.1109/YCICT.2009.5382425","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382425","url":null,"abstract":"A method of regularization of orthogonal neural networks using fractional derivatives is proposed in the paper. The cost function with a penalty for non-smoothness with fractional derivatives enabling to use a priori knowledge. The formula for network weight values which minimize the proposed cost function was derived. It was demonstrated the obtained matrix in normal equations is nonnegative-definite. The results of simulation experiments where the outlined method was used for modeling static nonlinear systems were shown.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"64 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114024261","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382349
Zi Yun, Laixian Peng, Wendong Zhao, Chang Tian
CICQ (Combined Input-Crosspoint Queued) switch fabric is an ideal solution for high-speed routers, which brings its nice distributed parallel scheduling property with no internal speedup required. Studying through resent scheduling algorithms for CICQ, it is shown that the basic reason leading to instability and performance decrease of throughput under nonuniform traffic is the imbalance of input queues. Thus this paper proposes a novel scheduling algorithm based on queues' length balance named MUIQF (Most Urgent Input Queue First). The simulation results show that under any traffic, either uniform or nonuniform, MUIQF can keep the input queues balance, hence achieves 100% throughput and fine stability and time delay performance.
{"title":"Simulation study of queues' length balance in CICQ switching fabrics","authors":"Zi Yun, Laixian Peng, Wendong Zhao, Chang Tian","doi":"10.1109/YCICT.2009.5382349","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382349","url":null,"abstract":"CICQ (Combined Input-Crosspoint Queued) switch fabric is an ideal solution for high-speed routers, which brings its nice distributed parallel scheduling property with no internal speedup required. Studying through resent scheduling algorithms for CICQ, it is shown that the basic reason leading to instability and performance decrease of throughput under nonuniform traffic is the imbalance of input queues. Thus this paper proposes a novel scheduling algorithm based on queues' length balance named MUIQF (Most Urgent Input Queue First). The simulation results show that under any traffic, either uniform or nonuniform, MUIQF can keep the input queues balance, hence achieves 100% throughput and fine stability and time delay performance.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"13 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941755","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382350
Lei Zhang, Dingling Zhang, Guangming Huang
In a cognitive radio network, cooperative spectrum sensing is conducted among the secondary users so as to improve the sensing performance. However, it's not necessary to cooperate all users to perform spectrum sensing while achieve a given error bound. In this paper, we investigate the problem of optimal number of secondary users in cooperative spectrum sensing. Moreover, an efficient and robust cooperative spectrum sensing algorithm is presented. A few secondary users are selected to cooperative based on reputation, while guarantee an error bound. Simulation results show the improvement of the sensing performance and network security as opposed to the random choosing.
{"title":"Optimal number of secondary users for cooperative sensing in cognitive radio networks","authors":"Lei Zhang, Dingling Zhang, Guangming Huang","doi":"10.1109/YCICT.2009.5382350","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382350","url":null,"abstract":"In a cognitive radio network, cooperative spectrum sensing is conducted among the secondary users so as to improve the sensing performance. However, it's not necessary to cooperate all users to perform spectrum sensing while achieve a given error bound. In this paper, we investigate the problem of optimal number of secondary users in cooperative spectrum sensing. Moreover, an efficient and robust cooperative spectrum sensing algorithm is presented. A few secondary users are selected to cooperative based on reputation, while guarantee an error bound. Simulation results show the improvement of the sensing performance and network security as opposed to the random choosing.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114488794","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382449
Yue Deng, Qionghai Dai, Zengke Zhang
In this paper, a novel idea, which utilizes the metric on a graph, is proposed to extract prominent features for pattern recognition. This proposed model, called “Graphical Metrics Guided Transformation” (GMGT), aims to find projections that can preserve the original metric on the graphic domain in a new Euclidean subspace. With the functional analysis, we present the definition of the metric in the graphical domain and prove that the commute time of random walk is a metric on graphs with the help of real physical model. Furthermore, a new feature extraction algorithm based on GMGT and the commute time is proposed, and is applied to face recognition.
{"title":"Feature extraction using randomwalks","authors":"Yue Deng, Qionghai Dai, Zengke Zhang","doi":"10.1109/YCICT.2009.5382449","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382449","url":null,"abstract":"In this paper, a novel idea, which utilizes the metric on a graph, is proposed to extract prominent features for pattern recognition. This proposed model, called “Graphical Metrics Guided Transformation” (GMGT), aims to find projections that can preserve the original metric on the graphic domain in a new Euclidean subspace. With the functional analysis, we present the definition of the metric in the graphical domain and prove that the commute time of random walk is a metric on graphs with the help of real physical model. Furthermore, a new feature extraction algorithm based on GMGT and the commute time is proposed, and is applied to face recognition.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121464955","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
扫码关注我们
求助内容：
应助结果提醒方式：