Pub Date : 2012-09-24DOI: 10.1109/CSIP.2012.6308849
Zhenhong Shao, Yingtao Niu, Lianfeng Shen
HAPS has become a hot research issue due to low free space loss, low system investment and high flexible local coverage in recent years. The various frequency bands have been assigned for HAPS applications by International Telecommunication Union (ITU). The interference between HAPS and FSS is unavoidable because of the same frequency band and the overlap coverage. We propose an interference model and analyze three kinds of interference scenarios in C-band. Simulation results show that the enough separated distance and stagger-point of antennas are very important for decreasing the interference between HAPS and FSS.
{"title":"Interference assessment between High Altitude Platform System (HAPS) and Fixed Satellite Service (FSS) in C-band","authors":"Zhenhong Shao, Yingtao Niu, Lianfeng Shen","doi":"10.1109/CSIP.2012.6308849","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308849","url":null,"abstract":"HAPS has become a hot research issue due to low free space loss, low system investment and high flexible local coverage in recent years. The various frequency bands have been assigned for HAPS applications by International Telecommunication Union (ITU). The interference between HAPS and FSS is unavoidable because of the same frequency band and the overlap coverage. We propose an interference model and analyze three kinds of interference scenarios in C-band. Simulation results show that the enough separated distance and stagger-point of antennas are very important for decreasing the interference between HAPS and FSS.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"115 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":"124822768","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.6309039
Meilin Liu, Yong Wang, Kai Li, Xuezhong Wei, Xiangxin Liu, Lan Li
A framework of product management system which supports IETM generation and management function (called IETM system in this paper) is introduced in this paper. In this system, the IETM is based on the S1000D specification, which is an international specification on the procurement and production of the technical publications.
{"title":"Design and implementation of product management system supporting IETM generation and management function","authors":"Meilin Liu, Yong Wang, Kai Li, Xuezhong Wei, Xiangxin Liu, Lan Li","doi":"10.1109/CSIP.2012.6309039","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309039","url":null,"abstract":"A framework of product management system which supports IETM generation and management function (called IETM system in this paper) is introduced in this paper. In this system, the IETM is based on the S1000D specification, which is an international specification on the procurement and production of the technical publications.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"2 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":"129520636","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.6309109
Shiping Zhu, Jie Gao
3D affine measurement, 3D geometrical modeling and further 3D rendering of the scene are achieved through the uncalibrated single view perspective-projecting image of the scene under the minimum geometrical constraints. The minimum geometrical constraints contain the 3D vanishing points and also the corresponding 3D measured distances along XYZ directions. The camera internal calibration parameters and external calibration parameters between the camera coordinates system and the world coordinates system are not required. Firstly, the algorithm of proportional or full real 3D geometrical modeling and also the 3D rendering of the scene based on the uncalibrated single view perspective-projecting image of the scene are given; Secondly, the examples of 3D affine measurement, 3D geometrical modeling and 3D rendering of the real shot images are presented. The experimental results indicate the correctness and validity of the algorithm.
{"title":"3D modeling and rendering based on uncalibrated single view image in undergraduate final design","authors":"Shiping Zhu, Jie Gao","doi":"10.1109/CSIP.2012.6309109","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309109","url":null,"abstract":"3D affine measurement, 3D geometrical modeling and further 3D rendering of the scene are achieved through the uncalibrated single view perspective-projecting image of the scene under the minimum geometrical constraints. The minimum geometrical constraints contain the 3D vanishing points and also the corresponding 3D measured distances along XYZ directions. The camera internal calibration parameters and external calibration parameters between the camera coordinates system and the world coordinates system are not required. Firstly, the algorithm of proportional or full real 3D geometrical modeling and also the 3D rendering of the scene based on the uncalibrated single view perspective-projecting image of the scene are given; Secondly, the examples of 3D affine measurement, 3D geometrical modeling and 3D rendering of the real shot images are presented. The experimental results indicate the correctness and validity of the algorithm.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"93 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":"128459550","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.6309064
Xie Ningxin, Zhou Yangquan
In order to avoid the premature convergence of the Particle Swarm Optimization (PSO) algorithm, a modified PSO algorithm is proposed. As an example, the improved algorithm is used for an approximate factorization of multivariate polynomials and the experiment result has proved its efficiency. The method in this paper may be as certain generalization of an precise factorization of multivariate polynomials.
{"title":"An approximate factorization of multivariate polynomials using improved PSO","authors":"Xie Ningxin, Zhou Yangquan","doi":"10.1109/CSIP.2012.6309064","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309064","url":null,"abstract":"In order to avoid the premature convergence of the Particle Swarm Optimization (PSO) algorithm, a modified PSO algorithm is proposed. As an example, the improved algorithm is used for an approximate factorization of multivariate polynomials and the experiment result has proved its efficiency. The method in this paper may be as certain generalization of an precise factorization of multivariate polynomials.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"2 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":"128499065","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.6309114
Yi Xiaoqing, Wang Ming
IKE protocol is an important part of the IPSec protocol suite meanwhile it is a prerequisite and guarantee for the IPSec VPN secure transmission. Since IKEv2 is a proposed technology, it is widely used in professional fields. With study of the IKEv2 protocol, the Public Key Infrastructure (PKI) system is introduced in this paper. And based on the data communication features, Online Certificate Status Protocol (OCSP) is combined with the IKEv2 protocol and the improved IKEv2 is designed with PKI/OCSP so that the efficiency and security of the IPSec VPN system is increased.
IKE协议是IPSec协议组的重要组成部分，是IPSec VPN安全传输的前提和保证。由于IKEv2是一项被提出的技术，因此在专业领域得到了广泛的应用。本文通过对IKEv2协议的研究，介绍了公钥基础设施(PKI)系统。并根据数据通信的特点，将OCSP (Online Certificate Status Protocol)协议与IKEv2协议相结合，利用PKI/OCSP设计改进的IKEv2协议，提高了IPSec VPN系统的效率和安全性。
{"title":"Design of IKEv2 protocol based on the PKI/OCSP","authors":"Yi Xiaoqing, Wang Ming","doi":"10.1109/CSIP.2012.6309114","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309114","url":null,"abstract":"IKE protocol is an important part of the IPSec protocol suite meanwhile it is a prerequisite and guarantee for the IPSec VPN secure transmission. Since IKEv2 is a proposed technology, it is widely used in professional fields. With study of the IKEv2 protocol, the Public Key Infrastructure (PKI) system is introduced in this paper. And based on the data communication features, Online Certificate Status Protocol (OCSP) is combined with the IKEv2 protocol and the improved IKEv2 is designed with PKI/OCSP so that the efficiency and security of the IPSec VPN system is increased.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"97 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":"128560783","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.6308898
Li Sun, G. Zou
In this paper, the work principle of multi-stage hydraulic cylinder with equal thrust (short in multi-stage hydraulic cylinder) is explained at first. The virtual prototype modeled by Pro/E is imported into ADAMS to establish dynamic model. and then establish control model in Matlab/Simulink according to mathematical model. At last, co-simulate for multi-stage hydraulic cylinders by ADAMS and Matlab, and obtains curves of first-edge piston velocity and acceleration and time of multi-stage hydraulic cylinder being fully extended, which lay the foundation for performance optimize for multi-stage hydraulic cylinder.
{"title":"Research on multi-stage hydraulic cylinder with equal thrust based on co-simulation","authors":"Li Sun, G. Zou","doi":"10.1109/CSIP.2012.6308898","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308898","url":null,"abstract":"In this paper, the work principle of multi-stage hydraulic cylinder with equal thrust (short in multi-stage hydraulic cylinder) is explained at first. The virtual prototype modeled by Pro/E is imported into ADAMS to establish dynamic model. and then establish control model in Matlab/Simulink according to mathematical model. At last, co-simulate for multi-stage hydraulic cylinders by ADAMS and Matlab, and obtains curves of first-edge piston velocity and acceleration and time of multi-stage hydraulic cylinder being fully extended, which lay the foundation for performance optimize for multi-stage hydraulic cylinder.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"29 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":"128742996","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.6308788
Huang Wenqi, Zeng Zhizhong, Fu Zhanghua, Ruchu Xu
To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.
{"title":"A new algorithm for packing unequal disks in a larger circle","authors":"Huang Wenqi, Zeng Zhizhong, Fu Zhanghua, Ruchu Xu","doi":"10.1109/CSIP.2012.6308788","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308788","url":null,"abstract":"To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.","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":"129838193","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.6308828
Jifu Nong
Regression problem is an important application area for neural networks (NNs). Among a large number of existing NN architectures, the feedforward NN (FNN) paradigm is one of the most widely used structures. Although one-hidden-layer feedforward neural networks (OHL-FNNs) have simple structures, they possess interesting representational and learning capabilities. In this paper, we are interested particularly in incremental constructive training of OHL-FNNs. In the proposed incremental constructive training schemes for an OHL-FNN, input-side training and output-side training may be separated in order to reduce the training time. A new technique is proposed to scale the error signal during the constructive learning process to improve the input-side training efficiency and to obtain better generalization performance. Two pruning methods for removing the input-side redundant connections have also been applied. Numerical simulations demonstrate the potential and advantages of the proposed strategies when compared to other existing techniques in the literature.
{"title":"Strategies for constructive neural networks and its application to regression models","authors":"Jifu Nong","doi":"10.1109/CSIP.2012.6308828","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308828","url":null,"abstract":"Regression problem is an important application area for neural networks (NNs). Among a large number of existing NN architectures, the feedforward NN (FNN) paradigm is one of the most widely used structures. Although one-hidden-layer feedforward neural networks (OHL-FNNs) have simple structures, they possess interesting representational and learning capabilities. In this paper, we are interested particularly in incremental constructive training of OHL-FNNs. In the proposed incremental constructive training schemes for an OHL-FNN, input-side training and output-side training may be separated in order to reduce the training time. A new technique is proposed to scale the error signal during the constructive learning process to improve the input-side training efficiency and to obtain better generalization performance. Two pruning methods for removing the input-side redundant connections have also been applied. Numerical simulations demonstrate the potential and advantages of the proposed strategies when compared to other existing techniques in the literature.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"28 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":"127273511","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}
Ribosomal protein S18 is a component of the 40S subunit, encoded by the RPS18 gene in eucaryotic cell, belonging to the S13P family of ribosomal proteins. To explore the structure characteristic of RPS18 gene of the Ailuropoda melanoleuca, primers we re designed based on the known nucleotide sequence of RPS18 gene to clone the cDNA and genomic sequences of RPS18 gene of A. melanoleuca by RT-PCR and PCR strategy respectively, and then the cloned cDNA and genomic sequences were sequenced and analyzed preliminarily. The results indicated that the length of cDNA fragment of the RPS18 from the giant panda is 503 bp in size, containing an open reading frame (ORF) of 459 bp, encoding 152 amino acids. The length of the genomic sequence is 5,518 bp, with six exons and five introns. The coding sequence shows a high degree of homology to those of Homo sapiens, Bos taurus, Mus musculus, Sus scrofa, Canis lupus and Rattus norvegicus; the degree of homology was 92.16 %,92.59%, 86.64%, 91.50%, 94.77% and 89.54%, respectively. While all the homologies for amino acid sequences are high up to 98.68%. Primary structure analysis revealed that the molecular weight of the putative RPS18 protein is 17.65 KD, with a theoretical pI of 11.39. Based on topology prediction, there is one Tyrosine kinase phosphorylation site, three protein kinase C phosphorylation site, two casein kinase II phosphorylation site, three amidation site and one ribosomal protein S13 signature in the RPS18 protein of the giant panda.
{"title":"Cloning and sequence analysis of ribosomal protein S18 gene (RPS18) from Ailuropoda melanoleuca","authors":"Xiao Cui, Zheng-song Peng, Jun Yang, Yi-ling Hou, Xiang Ding, Wan-Ruhou","doi":"10.1109/CSIP.2012.6308906","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308906","url":null,"abstract":"Ribosomal protein S18 is a component of the 40S subunit, encoded by the RPS18 gene in eucaryotic cell, belonging to the S13P family of ribosomal proteins. To explore the structure characteristic of RPS18 gene of the Ailuropoda melanoleuca, primers we re designed based on the known nucleotide sequence of RPS18 gene to clone the cDNA and genomic sequences of RPS18 gene of A. melanoleuca by RT-PCR and PCR strategy respectively, and then the cloned cDNA and genomic sequences were sequenced and analyzed preliminarily. The results indicated that the length of cDNA fragment of the RPS18 from the giant panda is 503 bp in size, containing an open reading frame (ORF) of 459 bp, encoding 152 amino acids. The length of the genomic sequence is 5,518 bp, with six exons and five introns. The coding sequence shows a high degree of homology to those of Homo sapiens, Bos taurus, Mus musculus, Sus scrofa, Canis lupus and Rattus norvegicus; the degree of homology was 92.16 %,92.59%, 86.64%, 91.50%, 94.77% and 89.54%, respectively. While all the homologies for amino acid sequences are high up to 98.68%. Primary structure analysis revealed that the molecular weight of the putative RPS18 protein is 17.65 KD, with a theoretical pI of 11.39. Based on topology prediction, there is one Tyrosine kinase phosphorylation site, three protein kinase C phosphorylation site, two casein kinase II phosphorylation site, three amidation site and one ribosomal protein S13 signature in the RPS18 protein of the giant panda.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"24 2 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":"128918571","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.6309077
Sizhe Sun, Junhui Li
Street dance was founded in late 1970s in the United States, and was introduced into China in late 1990s, which is more and more popular in young people. This paper analyzes the reasons why street dance is popular in the world from its characteristics, the main ways and means are, outstanding communicators; emphasis on performing communication; communication mode of “fitness club”; the fourth medium communication; communication mode of network media; choose economically developed areas to communicate; schools are the main carriers of its communication; communicate with emphasis on sports concepts; nature changes “from dance to sport”; street dance's inherent charm, and so on. The 21st century is an age with wide range of information, things spread also shows a wide range of trends, street dance carries the trend of modern information technology, uses all communication methods appropriate for its communication to transmit in the world, regardless of whether their nature is good or bad, it is amazing only in the use of modern means and skills of communication.
{"title":"International communication dynamics of U.S. street dance","authors":"Sizhe Sun, Junhui Li","doi":"10.1109/CSIP.2012.6309077","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309077","url":null,"abstract":"Street dance was founded in late 1970s in the United States, and was introduced into China in late 1990s, which is more and more popular in young people. This paper analyzes the reasons why street dance is popular in the world from its characteristics, the main ways and means are, outstanding communicators; emphasis on performing communication; communication mode of “fitness club”; the fourth medium communication; communication mode of network media; choose economically developed areas to communicate; schools are the main carriers of its communication; communicate with emphasis on sports concepts; nature changes “from dance to sport”; street dance's inherent charm, and so on. The 21st century is an age with wide range of information, things spread also shows a wide range of trends, street dance carries the trend of modern information technology, uses all communication methods appropriate for its communication to transmit in the world, regardless of whether their nature is good or bad, it is amazing only in the use of modern means and skills of communication.","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":"129084201","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
扫码关注我们
求助内容：
应助结果提醒方式：