Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713152
Shaokang Wang, Baoping Yan
Authorship attribution, i.e., identifying the authorship of a piece of disputed text, is an important problem due to the increased concerns on copyright violations. While various authorship attribution algorithms have been proposed to identify the authorship of articles, they fail in several situations. This paper proposes a new authorship attribution algorithm for Chinese text using the sentence rhythm features of articles. In our algorithm, a rhythm feature matrix is proposed to depict the sentence rhythm of Chinese text. In order to determine the similarity of rhythm feature matrices, we compare two definitions of similarity based on Euclidean distance and improved Kullback-Leibler Divergence, respectively. Experimental results show that our algorithm achieves a success rate of 80%.
{"title":"Authorship attribution for Chinese text based on sentence rhythm features","authors":"Shaokang Wang, Baoping Yan","doi":"10.1109/YCICT.2010.5713152","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713152","url":null,"abstract":"Authorship attribution, i.e., identifying the authorship of a piece of disputed text, is an important problem due to the increased concerns on copyright violations. While various authorship attribution algorithms have been proposed to identify the authorship of articles, they fail in several situations. This paper proposes a new authorship attribution algorithm for Chinese text using the sentence rhythm features of articles. In our algorithm, a rhythm feature matrix is proposed to depict the sentence rhythm of Chinese text. In order to determine the similarity of rhythm feature matrices, we compare two definitions of similarity based on Euclidean distance and improved Kullback-Leibler Divergence, respectively. Experimental results show that our algorithm achieves a success rate of 80%.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116507939","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713088
Yongjun Ma, G. Bai
The monitoring and management of the high density crowd in large scale public place is an important factor of city disaster reduction and mitigation. Automatic short term prediction of crowd density is a key problem. This paper introduces a prediction algorithm using v-support vector regression (v-SVR), which can control the accuracy of fitness and prediction error by adjusting the parameter v. An on-line training algorithm is discussed in detail to reduce the training complexity of v-SVR. As an important input feature, high crowd density estimation is also discussed. The experimental results show that v-SVR has low error rate and better generalization with appropriate v.
{"title":"Short term prediction of crowd density using v-SVR","authors":"Yongjun Ma, G. Bai","doi":"10.1109/YCICT.2010.5713088","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713088","url":null,"abstract":"The monitoring and management of the high density crowd in large scale public place is an important factor of city disaster reduction and mitigation. Automatic short term prediction of crowd density is a key problem. This paper introduces a prediction algorithm using v-support vector regression (v-SVR), which can control the accuracy of fitness and prediction error by adjusting the parameter v. An on-line training algorithm is discussed in detail to reduce the training complexity of v-SVR. As an important input feature, high crowd density estimation is also discussed. The experimental results show that v-SVR has low error rate and better generalization with appropriate v.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121892756","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713118
Yuanfeng Lian, Yan Zhao, Falin Wu, Huiguang He
This paper presents a new approach based on modified adaptive probabilistic neural network for brain segmentation with magnetic resonance imaging (MRI). The SOM (Self-Organizing Map) neural network is employed to overly segment the input MR image, and yield reference vectors with a large training data set for the probabilistic classification. For improving the training quality of neural work, the feature set is extracted from the statistical intensity and gradient information of the image pixels. The proposed approach also incorporates modified particle swarm optimization (MPSO) to optimize the smoothing parameter of the kernel function in the neural network, enhancing its performance. The experimental results demonstrate the effectiveness and robustness of the proposed approach.
{"title":"Modified adaptive probabilistic neural network using for MR image segmentation","authors":"Yuanfeng Lian, Yan Zhao, Falin Wu, Huiguang He","doi":"10.1109/YCICT.2010.5713118","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713118","url":null,"abstract":"This paper presents a new approach based on modified adaptive probabilistic neural network for brain segmentation with magnetic resonance imaging (MRI). The SOM (Self-Organizing Map) neural network is employed to overly segment the input MR image, and yield reference vectors with a large training data set for the probabilistic classification. For improving the training quality of neural work, the feature set is extracted from the statistical intensity and gradient information of the image pixels. The proposed approach also incorporates modified particle swarm optimization (MPSO) to optimize the smoothing parameter of the kernel function in the neural network, enhancing its performance. The experimental results demonstrate the effectiveness and robustness of the proposed approach.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123345390","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713099
Rong Chai, Jingjing Cheng, Qianbin Chen, Tao Dong
In next generation network (NGN), different access networks are integrated and seamless vertical handoff technique should be performed. Cross-layer design for vertical handoff has gained considerable attention in recent years. In this paper, we give a survey on cross-layer strategy in vertical handoff scheme design including both cross-layer system architectures and cross-layer information interaction mechanisms for handoff performances improvement in heterogeneous integration networks. Furthermore, we point out some open technical challenges in the cross-layer design for seamless integration of heterogeneous networks.
{"title":"Cross-layer design in vertical handoff technique","authors":"Rong Chai, Jingjing Cheng, Qianbin Chen, Tao Dong","doi":"10.1109/YCICT.2010.5713099","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713099","url":null,"abstract":"In next generation network (NGN), different access networks are integrated and seamless vertical handoff technique should be performed. Cross-layer design for vertical handoff has gained considerable attention in recent years. In this paper, we give a survey on cross-layer strategy in vertical handoff scheme design including both cross-layer system architectures and cross-layer information interaction mechanisms for handoff performances improvement in heterogeneous integration networks. Furthermore, we point out some open technical challenges in the cross-layer design for seamless integration of heterogeneous networks.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122992494","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713117
Chen-Guang He, S. Bao
AKA protocol is widely used for mutual authentication process of 3G communication system. The generation and the strength of cipher key during this process are the key problems about security. Some mathematic tools could be used to improve this performance of these features like Lorenz equations, which are a class of three-dimensional ordinary differential equations similar to the iterative equation with particular initial values and parameters in some cases. In fact, the value of sequence generated by Lorenz equation is of chaos characteristic. Appropriate pretreatment and quantification way can be adopted to transform them into two value chaos charactyeristic. Followed by using bit shift encryption method, it can provide more flexible and controllable of the encryption key to enhance the security of 3G air interface. This kind of encryption method achieved better results in terms of the key space and efficiency compared with standard encryption approach and one-dimensional Logistic chaotic encryption methods.
{"title":"An encryption algorithm based on chaotic system for 3G security authentication","authors":"Chen-Guang He, S. Bao","doi":"10.1109/YCICT.2010.5713117","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713117","url":null,"abstract":"AKA protocol is widely used for mutual authentication process of 3G communication system. The generation and the strength of cipher key during this process are the key problems about security. Some mathematic tools could be used to improve this performance of these features like Lorenz equations, which are a class of three-dimensional ordinary differential equations similar to the iterative equation with particular initial values and parameters in some cases. In fact, the value of sequence generated by Lorenz equation is of chaos characteristic. Appropriate pretreatment and quantification way can be adopted to transform them into two value chaos charactyeristic. Followed by using bit shift encryption method, it can provide more flexible and controllable of the encryption key to enhance the security of 3G air interface. This kind of encryption method achieved better results in terms of the key space and efficiency compared with standard encryption approach and one-dimensional Logistic chaotic encryption methods.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242036","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713086
Bo Wang, Xianfeng Liu
Fund reviews on the Web can help people to make investment decisions and their size is relatively small comparing with other products, which lowers PMI algorithm performance. Replacing words by morphemes can improve system capability in Chinese language environment, but defining the SO (sentiment orientation) of morphemes is generally a kind of heavy handwork. We propose a methodology to do this job automatically, whose basic idea is to introduce some outside language and statistical resources to assist polarity calculation. Experiments show that the algorithm is effective and the system get better performance.
{"title":"Extracting morphemes to improve sentiment analysis for Chinese fund reviews","authors":"Bo Wang, Xianfeng Liu","doi":"10.1109/YCICT.2010.5713086","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713086","url":null,"abstract":"Fund reviews on the Web can help people to make investment decisions and their size is relatively small comparing with other products, which lowers PMI algorithm performance. Replacing words by morphemes can improve system capability in Chinese language environment, but defining the SO (sentiment orientation) of morphemes is generally a kind of heavy handwork. We propose a methodology to do this job automatically, whose basic idea is to introduce some outside language and statistical resources to assist polarity calculation. Experiments show that the algorithm is effective and the system get better performance.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131877052","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713078
Yi-Hong Tan, Bin Li, Xue-yong Li, Ya-ping Lin
In super-peer semantic network, when a new peer joins the network, the peer will use the semantic feature of local share documents to select super-peers. In traditionally networks, client-peers use the semantic feature of clusters in peers to select the super-peers to connect. But the clusters are fixed, general, single-level, and not effective to represent the features of all documents. And, while selecting super-peers to connect, the client-peer cannot select some relative clusters in different level accord to the semantic categories of super-peers semantic group. In this paper, a Super-Peer semantic Network based on Hierarchical Clustering Tree (HCTSPN) is presented. First, an improved hierarchical clustering algorithm for organizing the share documents in a client-peer is proposed. Secondly, the method of constructing a super-peer semantic network based on hierarchical clustering tree and search mechanism are proposed. Finally, the experiments are implemented, and the results show that search efficiency and retrieval quality are improved in the network.
{"title":"Designing a Super-Peer semantic Network based on Hierarchical Clusters","authors":"Yi-Hong Tan, Bin Li, Xue-yong Li, Ya-ping Lin","doi":"10.1109/YCICT.2010.5713078","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713078","url":null,"abstract":"In super-peer semantic network, when a new peer joins the network, the peer will use the semantic feature of local share documents to select super-peers. In traditionally networks, client-peers use the semantic feature of clusters in peers to select the super-peers to connect. But the clusters are fixed, general, single-level, and not effective to represent the features of all documents. And, while selecting super-peers to connect, the client-peer cannot select some relative clusters in different level accord to the semantic categories of super-peers semantic group. In this paper, a Super-Peer semantic Network based on Hierarchical Clustering Tree (HCTSPN) is presented. First, an improved hierarchical clustering algorithm for organizing the share documents in a client-peer is proposed. Secondly, the method of constructing a super-peer semantic network based on hierarchical clustering tree and search mechanism are proposed. Finally, the experiments are implemented, and the results show that search efficiency and retrieval quality are improved in the network.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132068258","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713052
Xinda Ke, Funian Li, Tingting Hu, Liang Wang
In this paper we present two strategy to maximize user's throughput in Cooperative MU-OFDM network while considering fairness of users. Our strategy is proposed to improve throughput and fairness of users only with limited feedback. With perfect instantaneous channel state information(CSI) at receiver, the resource allocating strategy not only decided in base station, but also decided in users of the cell. Further, we decompose the joint resource allocation problem into three subproblems. First, a proportional user choosing strategy is introduced. Second, an adaptive relay choosing strategy is proposed in each user respectively. Finally, a suboptimal power allocation is given after subcarrier allocation. Based on the three step, we proposed two allocating strategy. The simulation results demonstrate that our strategy can greatly improves the throughput while ensuring users fairness only with limited feedback.
{"title":"Resource allocation with opportunistic feedback in Cooperative MU-OFDM network","authors":"Xinda Ke, Funian Li, Tingting Hu, Liang Wang","doi":"10.1109/YCICT.2010.5713052","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713052","url":null,"abstract":"In this paper we present two strategy to maximize user's throughput in Cooperative MU-OFDM network while considering fairness of users. Our strategy is proposed to improve throughput and fairness of users only with limited feedback. With perfect instantaneous channel state information(CSI) at receiver, the resource allocating strategy not only decided in base station, but also decided in users of the cell. Further, we decompose the joint resource allocation problem into three subproblems. First, a proportional user choosing strategy is introduced. Second, an adaptive relay choosing strategy is proposed in each user respectively. Finally, a suboptimal power allocation is given after subcarrier allocation. Based on the three step, we proposed two allocating strategy. The simulation results demonstrate that our strategy can greatly improves the throughput while ensuring users fairness only with limited feedback.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132138841","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713095
Xue-feng Luo, Li Han
A theoretical model is presented for multilayered surface plasmon resonance sensors composed of isotropic materials. In the framework of optical transmission theory in multilayers, by solving Helmholtz equations, the expression of electromagnetic field distribution inside multilayered structures is established. This model is applied in the simulation of surface plasmon resonance characteristics of single Au layer, bilayer Co/Au and trilayer Au/Co/Au respectively. The calculated reflectivity curves are in excellent agreement with the experimental results. The simulated field distribution inside layered structures give an explicit explanation to the variations of reflectivity as a function of incident angle. Thus, the presented model can be used as an analytical tool in the format of SPR sensors.
{"title":"A universal model of surface plasmon resonance characteristics for isotropic multilayer films","authors":"Xue-feng Luo, Li Han","doi":"10.1109/YCICT.2010.5713095","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713095","url":null,"abstract":"A theoretical model is presented for multilayered surface plasmon resonance sensors composed of isotropic materials. In the framework of optical transmission theory in multilayers, by solving Helmholtz equations, the expression of electromagnetic field distribution inside multilayered structures is established. This model is applied in the simulation of surface plasmon resonance characteristics of single Au layer, bilayer Co/Au and trilayer Au/Co/Au respectively. The calculated reflectivity curves are in excellent agreement with the experimental results. The simulated field distribution inside layered structures give an explicit explanation to the variations of reflectivity as a function of incident angle. Thus, the presented model can be used as an analytical tool in the format of SPR sensors.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365771","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 : 2010-11-01DOI: 10.1109/YCICT.2010.5713107
De-Qiang Fan, Su Zhang, B. Li
Emotional states are part of the information that is conveyed in many forms of network reviews. This paper presents a new sentiment polarity recognition model based on linguistic structure of emotion states-fixed sentiment terms model. The proposed method uses three types of specific collocation pattern to construct the recognition algorithm based on fixed sentiment terms. These feature term sets are gradually updated by relevance feedbacks from the users which based on incremental tf-idf model. Comparison is done between the traditional method and fixed sentiment terms model. All tests showed the proposed method gets a higher efficiency and accuracy rate of the emotion classifier.
{"title":"A new sentiment polarity recognition model based on linguistic structure of network reviews - Fixed sentiment terms model","authors":"De-Qiang Fan, Su Zhang, B. Li","doi":"10.1109/YCICT.2010.5713107","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713107","url":null,"abstract":"Emotional states are part of the information that is conveyed in many forms of network reviews. This paper presents a new sentiment polarity recognition model based on linguistic structure of emotion states-fixed sentiment terms model. The proposed method uses three types of specific collocation pattern to construct the recognition algorithm based on fixed sentiment terms. These feature term sets are gradually updated by relevance feedbacks from the users which based on incremental tf-idf model. Comparison is done between the traditional method and fixed sentiment terms model. All tests showed the proposed method gets a higher efficiency and accuracy rate of the emotion classifier.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904564","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
扫码关注我们
求助内容：
应助结果提醒方式：