Pub Date : 2012-09-24DOI: 10.1109/CSIP.2012.6309010
Xiaoyan Wei, Zhibin Pan
Kernel methods play important roles in machine learning algorithms such as support vector machines. However, how to construct a suitable kernel remains difficult. Recently Ye et al proposed a new kind of kernel function named Chebyshev kernel based on orthogonal Chebyshev polynomials. But in fact the features of the nonlinear mapping determined by Chebyshev kernel are not orthogonal to each other due to the denominator in Chebyshev kernel. Thus we propose a new kernel named orthogonal Chebyshev kernel which determines a nonlinear mapping with orthogonal features. We prove that it is a valid kernel. Experimental results in both classification and regression tasks show that orthogonal Chebyshev kernel is effective and competitive to Chebyshev kernel.
{"title":"Chebyshev kernel with orthogonal features","authors":"Xiaoyan Wei, Zhibin Pan","doi":"10.1109/CSIP.2012.6309010","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309010","url":null,"abstract":"Kernel methods play important roles in machine learning algorithms such as support vector machines. However, how to construct a suitable kernel remains difficult. Recently Ye et al proposed a new kind of kernel function named Chebyshev kernel based on orthogonal Chebyshev polynomials. But in fact the features of the nonlinear mapping determined by Chebyshev kernel are not orthogonal to each other due to the denominator in Chebyshev kernel. Thus we propose a new kernel named orthogonal Chebyshev kernel which determines a nonlinear mapping with orthogonal features. We prove that it is a valid kernel. Experimental results in both classification and regression tasks show that orthogonal Chebyshev kernel is effective and competitive to Chebyshev kernel.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130786643","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309092
G. Gu, Jiankun Yi, Feimeng Zhang, Shuyu Wang, Xiaoyun Wu
The plasma field distribution theory is studied through the establishment of Maxwell equations, experimental system of plasma antenna is designed and realized which based on glow discharge, then the 2 D games, 3 D games, vector field simulation is realized as well as gain characteristics of the antenna is analyzed. The results show that it should balance factors both plasma density, signal band and plasma body radius in order to absorb the detecting electromagnetic wave, reduce the radiation wave and stealth. Furthermore, plasma antenna performance is optimized.
{"title":"Design and simulation for the experiment system of plasma antennas","authors":"G. Gu, Jiankun Yi, Feimeng Zhang, Shuyu Wang, Xiaoyun Wu","doi":"10.1109/CSIP.2012.6309092","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309092","url":null,"abstract":"The plasma field distribution theory is studied through the establishment of Maxwell equations, experimental system of plasma antenna is designed and realized which based on glow discharge, then the 2 D games, 3 D games, vector field simulation is realized as well as gain characteristics of the antenna is analyzed. The results show that it should balance factors both plasma density, signal band and plasma body radius in order to absorb the detecting electromagnetic wave, reduce the radiation wave and stealth. Furthermore, plasma antenna performance is optimized.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128901148","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308833
Yuena Ma, Luobin Guo, Youqian Feng
Based on a relationship between a generator matrix of a given code and its weight distribution, all ternary [40s+28,4,27s+18] optimal self-orthogonal codes are determined by solving systems of linear equations. Then these optimal self-orthogonal codes for s≥0 are classified, and their generator matrices and weight polynomials of these optimal self-orthogonal codes for s≥1 are also given.
{"title":"Classification of ternary [40s+28,4] optimal self-orthogonal codes","authors":"Yuena Ma, Luobin Guo, Youqian Feng","doi":"10.1109/CSIP.2012.6308833","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308833","url":null,"abstract":"Based on a relationship between a generator matrix of a given code and its weight distribution, all ternary [40s+28,4,27s+18] optimal self-orthogonal codes are determined by solving systems of linear equations. Then these optimal self-orthogonal codes for s≥0 are classified, and their generator matrices and weight polynomials of these optimal self-orthogonal codes for s≥1 are also given.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"107 49","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131912955","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308903
Yang-Qiong Chen, Yi-ling Hou, Wu Chun-lian, Ding Xiang, W. Hou
Ribosonal protein L23 is a component of the 60s large ribosomal subunit, and plays an important role in ribosome. To explore the structure characteristic of RPL23 gene of giant panda and investigate its homologies with other species reported, the cDNA and genomic sequence of RPL23 gene were cloned using RT-PCR and touchdown-PCR technology. The sequence data were analyzed by corresponding software. The results showed the length of cDNA fragment cloned was 457bp; containing an open reading frame of 423 bp. Deduced protein was composed of 144 amino acids with an estimated molecular weight of 14.86kD and pI of 11.19. The length of the genomic sequence was 5011 bp, containing five exons and four introns. The predicted protein has six different patterns of functional sites. The RPL23 gene can be readily expressed in E. coli. When it was fused with the N-terminally His-tagged protein, it gave rise to accumulation of an expected 20.5 kD polypeptide, in good agreement with the predicted molecular weight. Alignment analysis indicated that RPL23 was highly similarity with the reported species at the level of DNA and protein. Topology prediction showed that three different patterns were found in the RPL23 protein of giant panda. In this paper, the results provided scientific material for enriching and improving the mammals RPL23 gene database.
{"title":"Cloning and sequence analysis of ribosomal protein L23 gene from Ailuropoda melanoleuca","authors":"Yang-Qiong Chen, Yi-ling Hou, Wu Chun-lian, Ding Xiang, W. Hou","doi":"10.1109/CSIP.2012.6308903","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308903","url":null,"abstract":"Ribosonal protein L23 is a component of the 60s large ribosomal subunit, and plays an important role in ribosome. To explore the structure characteristic of RPL23 gene of giant panda and investigate its homologies with other species reported, the cDNA and genomic sequence of RPL23 gene were cloned using RT-PCR and touchdown-PCR technology. The sequence data were analyzed by corresponding software. The results showed the length of cDNA fragment cloned was 457bp; containing an open reading frame of 423 bp. Deduced protein was composed of 144 amino acids with an estimated molecular weight of 14.86kD and pI of 11.19. The length of the genomic sequence was 5011 bp, containing five exons and four introns. The predicted protein has six different patterns of functional sites. The RPL23 gene can be readily expressed in E. coli. When it was fused with the N-terminally His-tagged protein, it gave rise to accumulation of an expected 20.5 kD polypeptide, in good agreement with the predicted molecular weight. Alignment analysis indicated that RPL23 was highly similarity with the reported species at the level of DNA and protein. Topology prediction showed that three different patterns were found in the RPL23 protein of giant panda. In this paper, the results provided scientific material for enriching and improving the mammals RPL23 gene database.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"42 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127065676","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309104
Guoxiang Liu, Fengxia Yang
Spam messages in mobile phone flooded and the management to it was not effective. The paper analyzes the characteristics of spam messages, its forming reason and its harm, discusses the classification method of filtering spam messages, and points out it is the key work of the researchers to develop the more effective classification method.
{"title":"The application of data mining in the classification of spam messages","authors":"Guoxiang Liu, Fengxia Yang","doi":"10.1109/CSIP.2012.6309104","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309104","url":null,"abstract":"Spam messages in mobile phone flooded and the management to it was not effective. The paper analyzes the characteristics of spam messages, its forming reason and its harm, discusses the classification method of filtering spam messages, and points out it is the key work of the researchers to develop the more effective classification method.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053552","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308822
Qijin Ji, Haojun Zhang, Yanpei Zhu
In a P2P video-on-demand (VoD) system, the asynchronous characteristic of users' random seeking makes data sharing among peers more challenging, and raises very high capability requirement of the source video server. In this paper, we propose adding one more server in a P2P VoD system to support the random seeking operations and investigate the capacity dimensioning problem for the new server. We use a simple queuing model to characterize the access of users' random seeking data requests to the server and formulate a quantitative relationship between request arrival rate of random seeking and the required bandwidth of the server under longest tolerant waiting time constraint. The numerical results show that only fairly small server capacity is needed to satisfy the bandwidth requirement of random seeking in a P2P VoD system with thousands of users.
{"title":"One more server for supporting random seeking in a P2P video-on-demand system","authors":"Qijin Ji, Haojun Zhang, Yanpei Zhu","doi":"10.1109/CSIP.2012.6308822","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308822","url":null,"abstract":"In a P2P video-on-demand (VoD) system, the asynchronous characteristic of users' random seeking makes data sharing among peers more challenging, and raises very high capability requirement of the source video server. In this paper, we propose adding one more server in a P2P VoD system to support the random seeking operations and investigate the capacity dimensioning problem for the new server. We use a simple queuing model to characterize the access of users' random seeking data requests to the server and formulate a quantitative relationship between request arrival rate of random seeking and the required bandwidth of the server under longest tolerant waiting time constraint. The numerical results show that only fairly small server capacity is needed to satisfy the bandwidth requirement of random seeking in a P2P VoD system with thousands of users.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123473056","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308986
Peiyong Yang, Zhiqiang Zhao, Peng Sun
This paper propose a two-step prefetching and active-passive prefetching and caching scheme to decrease the network delay in picture sharing system between smart devices. The scheme use the time that network is idle to prefetch data, reduce users' waiting time. It uses two-step prefetching to reduce bandwidth consumption, use active-passive prefetching to improve prefetching accuracy and efficiency. The experiment shows that this scheme can reduce user waiting time by 58.2%, improve prefetching shoot to 92%, and reduce the unused bandwidth to 5%.
{"title":"An intelligent prefetching and caching system for picture sharing system","authors":"Peiyong Yang, Zhiqiang Zhao, Peng Sun","doi":"10.1109/CSIP.2012.6308986","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308986","url":null,"abstract":"This paper propose a two-step prefetching and active-passive prefetching and caching scheme to decrease the network delay in picture sharing system between smart devices. The scheme use the time that network is idle to prefetch data, reduce users' waiting time. It uses two-step prefetching to reduce bandwidth consumption, use active-passive prefetching to improve prefetching accuracy and efficiency. The experiment shows that this scheme can reduce user waiting time by 58.2%, improve prefetching shoot to 92%, and reduce the unused bandwidth to 5%.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123974916","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309055
Feng-qing Zhang, D. Han
Cloud computing is now the hot spot of computer business and research. However cloud computing security issues have become more and more pronounced. To protect data confidentiality and integrity, making more reliable in cloud computing becomes priorities. Cloud computing security related to the survival of cloud computing, has become a key factor in the development of cloud computing. This paper presents a data security model for cloud computing, and introduces agents to data security module in order to provide more reliable services.
{"title":"Applying agents to the data security in cloud computing","authors":"Feng-qing Zhang, D. Han","doi":"10.1109/CSIP.2012.6309055","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309055","url":null,"abstract":"Cloud computing is now the hot spot of computer business and research. However cloud computing security issues have become more and more pronounced. To protect data confidentiality and integrity, making more reliable in cloud computing becomes priorities. Cloud computing security related to the survival of cloud computing, has become a key factor in the development of cloud computing. This paper presents a data security model for cloud computing, and introduces agents to data security module in order to provide more reliable services.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125901911","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309137
Yunqian Li, Liping Chang
Acoustic feedback is a serious problem in hearing aids. The feedback can result in whistling sound and make people who have severe hearing loss feel terrible. Traditional LMS and normalized LMS algorithm have been studied before, but these algorithms do not provide satisfactory performance for reducing feedback oscillation in hearing aids. So a band-limited NLMS algorithm is proposed. In order to determine which adaptive filter used is more suitable, we use these two kinds scheme to simulation and compare the Signal-to- Feedback-Ratio (SFR) of these two schemes, the band-limited algorithm has better performance and the output speech's quality is better. The commonly used adaptive filter is FIR filter, but it has more coefficients and high computational complexity, so a feedback reduction subsystem based on IIR adaptive filters is proposed. Its coefficients are fewer and computational cost is lower. In this case, the IIR filter is adapted with a modified version of the NLMS algorithm for this kind of filters. It uses fewer coefficients and obtains better performance.
{"title":"The application of band-limited NLMS algorithm in hearing aids","authors":"Yunqian Li, Liping Chang","doi":"10.1109/CSIP.2012.6309137","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309137","url":null,"abstract":"Acoustic feedback is a serious problem in hearing aids. The feedback can result in whistling sound and make people who have severe hearing loss feel terrible. Traditional LMS and normalized LMS algorithm have been studied before, but these algorithms do not provide satisfactory performance for reducing feedback oscillation in hearing aids. So a band-limited NLMS algorithm is proposed. In order to determine which adaptive filter used is more suitable, we use these two kinds scheme to simulation and compare the Signal-to- Feedback-Ratio (SFR) of these two schemes, the band-limited algorithm has better performance and the output speech's quality is better. The commonly used adaptive filter is FIR filter, but it has more coefficients and high computational complexity, so a feedback reduction subsystem based on IIR adaptive filters is proposed. Its coefficients are fewer and computational cost is lower. In this case, the IIR filter is adapted with a modified version of the NLMS algorithm for this kind of filters. It uses fewer coefficients and obtains better performance.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158011","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309044
Yan Li, Wang Jie
In this paper, it presented the method of network intrusion detection based on the neural network GCBP algorithm. By analyzing and comparing the BP algorithm with the GCBP algorithm, what learned is that the GCBP algorithm had overcome the weaknesses, which traditional BP algorithm has of slow convergent speed and easily getting into local minimum. Applicable effects of the method of the intrusion detection are much better, more highly accurate, and greater adaptively. I also showed the ability of more quickly learning. To a great extent, it can achieve the detection of unknown data packets, providing an effective way to efficiently and accurately realize intrusion detection.
{"title":"The method of network intrusion detection based on the neural network GCBP algorithm","authors":"Yan Li, Wang Jie","doi":"10.1109/CSIP.2012.6309044","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309044","url":null,"abstract":"In this paper, it presented the method of network intrusion detection based on the neural network GCBP algorithm. By analyzing and comparing the BP algorithm with the GCBP algorithm, what learned is that the GCBP algorithm had overcome the weaknesses, which traditional BP algorithm has of slow convergent speed and easily getting into local minimum. Applicable effects of the method of the intrusion detection are much better, more highly accurate, and greater adaptively. I also showed the ability of more quickly learning. To a great extent, it can achieve the detection of unknown data packets, providing an effective way to efficiently and accurately realize intrusion detection.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126159639","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
扫码关注我们
求助内容：
应助结果提醒方式：