For the centralized cognitive radio network, a resource allocation algorithm of joint channel quality evaluation based on non-cooperative game is proposed. The utility function for the game module considers both the receiving SINR threshold and transmitted power and tries to reduce interference as much as possible on the basis of guaranteeing the QoS demands for various services. The available channels can be evaluated through primary users occupying channel time and channel idle/occupied switching times. CR-BS (Cognitive Radio Base Station) calculates queue priority in a scheduling cycle based on users’ difierent services and dynamically adjusts service opportunities for realtime services and non-realtime services, which can provide difierential services and guarantee the equality for difierent services. The simulation shows that the proposed algorithm converges fast, can still ensures each user’s SINR value higher than its QoS demand threshold in low SNR environment, reduce the interference to primary users, and enhance network performance.
针对集中式认知无线网络，提出了一种基于非合作博弈的联合信道质量评估资源分配算法。游戏模块的效用函数同时考虑接收SINR阈值和发射功率，在保证各种业务的QoS需求的基础上尽量减少干扰。可用信道可以通过主要用户占用信道时间和信道空闲/占用的交换时间来评估。CR-BS (Cognitive Radio Base Station)基于用户的不同业务，在调度周期内计算队列优先级，动态调整实时业务和非实时业务的服务机会，提供差异化服务，保证不同业务的公平性。仿真结果表明，该算法收敛速度快，在低信噪比环境下仍能保证每个用户的信噪比值高于其QoS需求阈值，减少对主用户的干扰，提高网络性能。
{"title":"Resource Allocation Algorithm of Joint Channel Quality Evaluation Based on Non-cooperative Game in Cognitive Radio Network ?","authors":"Lin Li, Yi-na Deng, Xingang Xie, Wenjiang Feng","doi":"10.12733/JICS20105389","DOIUrl":"https://doi.org/10.12733/JICS20105389","url":null,"abstract":"For the centralized cognitive radio network, a resource allocation algorithm of joint channel quality evaluation based on non-cooperative game is proposed. The utility function for the game module considers both the receiving SINR threshold and transmitted power and tries to reduce interference as much as possible on the basis of guaranteeing the QoS demands for various services. The available channels can be evaluated through primary users occupying channel time and channel idle/occupied switching times. CR-BS (Cognitive Radio Base Station) calculates queue priority in a scheduling cycle based on users’ difierent services and dynamically adjusts service opportunities for realtime services and non-realtime services, which can provide difierential services and guarantee the equality for difierent services. The simulation shows that the proposed algorithm converges fast, can still ensures each user’s SINR value higher than its QoS demand threshold in low SNR environment, reduce the interference to primary users, and enhance network performance.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130673583","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}
Research on the service e‐ciency of port is signiflcance to port resource optimal allocation. On the basic of the analysis of port logistics operation mechanism, clearing the state transfer relationship in the port logistics service model, and puts forward some reasonable assumptions, establishing a port service e‐ciency evaluation model based on Markov queuing network, presents a method for calculating the e‐ciency of port services. At last, the example analysis indicates that the model achieves the quantitative assessment of the port service e‐ciency reasonably.
{"title":"The Evaluation of Port Service Efficiency Based on Markov Queuing Network","authors":"Hai Xiao, Xinxue Liu, Yaxiong Li, Jian Wu","doi":"10.12733/JICS20105384","DOIUrl":"https://doi.org/10.12733/JICS20105384","url":null,"abstract":"Research on the service e‐ciency of port is signiflcance to port resource optimal allocation. On the basic of the analysis of port logistics operation mechanism, clearing the state transfer relationship in the port logistics service model, and puts forward some reasonable assumptions, establishing a port service e‐ciency evaluation model based on Markov queuing network, presents a method for calculating the e‐ciency of port services. At last, the example analysis indicates that the model achieves the quantitative assessment of the port service e‐ciency reasonably.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132311660","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}
In this paper, we investigated and solved two issues in the research of Wireless Sensor Network (WSN). Firstly, we proposed a Scalable Uniform Localization Performance evaluated model (SULP evaluated model). There are two parts of this model, modules and data structures, both of them can be customized and extended by users as they need. By using this model researchers can save more time because they pay more attention to the algorithm itself but not to the evaluate environment and parameters. Secondly, we investigated the impacts of communications radius and anchor node ratio on localization algorithms. Four classical algorithms have been evaluated under the scalable model. Experimental results show that the performance including localization error rate, localization cover rate and energy consumption have difierent trends when communication radius and anchor node ratio changing in a reasonable range. Finally we concluded the regulars of the trends to provide instructions to industrial applications and other researchers.
{"title":"A Scalable Uniform Localization Performance Evaluated Model and Performance Analysis of Range-free Algorithms in WSN ?","authors":"Hongyu Sun, Zhiyi Fang, Zhiqiang Chen, Jin He","doi":"10.12733/JICS20105436","DOIUrl":"https://doi.org/10.12733/JICS20105436","url":null,"abstract":"In this paper, we investigated and solved two issues in the research of Wireless Sensor Network (WSN). Firstly, we proposed a Scalable Uniform Localization Performance evaluated model (SULP evaluated model). There are two parts of this model, modules and data structures, both of them can be customized and extended by users as they need. By using this model researchers can save more time because they pay more attention to the algorithm itself but not to the evaluate environment and parameters. Secondly, we investigated the impacts of communications radius and anchor node ratio on localization algorithms. Four classical algorithms have been evaluated under the scalable model. Experimental results show that the performance including localization error rate, localization cover rate and energy consumption have difierent trends when communication radius and anchor node ratio changing in a reasonable range. Finally we concluded the regulars of the trends to provide instructions to industrial applications and other researchers.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258431","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}
{"title":"A web page classification algorithm based on feature selection(EI)","authors":"Jie Guo, Hongfang Zhou","doi":"10.12733/JICS20105546","DOIUrl":"https://doi.org/10.12733/JICS20105546","url":null,"abstract":"","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239859","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}
As the satellite and space spectrum resource are constrained, most time, the WCDMA (Wideband Code Division Multiple Access) satellite system and the GMR (GEO-mobile radio interface) system have to transport information in the same frequency band. In this case the main interference is the narrowband interference which comes from the GMR system. The paper researched the method of the narrowband interference suppression in the WCDMA satellite system. Furthermore, because the WCDMA system also contains a multi-access interference, the paper proposed a code-aided interference suppression technology, which can suppress both the MAI (Multiple Address Interference) and NBI (Narrow Band Interference), into the WCDMA satellite system to eliminate the GMR interference. Theoretic analysis and system simulation show that, the GMR signal interference can effectively be inhibited with a more mature and better MMSE (Minimum Mean Square Error) and ZF (Zero-force) code-aided technology, the co-channel transmission performance of the WCDMA systems can be protected well.
由于卫星和空间频谱资源的限制，在大多数情况下，WCDMA(宽带码分多址)卫星系统和GMR (GEO-mobile radio interface)系统必须在同一频带上传输信息。在这种情况下，主要的干扰是来自GMR系统的窄带干扰。研究了WCDMA卫星系统中窄带干扰的抑制方法。此外，由于WCDMA系统中还存在多址干扰，本文提出了一种码辅助干扰抑制技术，该技术可以抑制多址干扰(MAI)和窄带干扰(NBI)进入WCDMA卫星系统，以消除GMR干扰。理论分析和系统仿真表明，采用较为成熟、性能较好的MMSE (Minimum Mean Square Error，最小均方误差)和ZF (Zero-force，零力)编码辅助技术可以有效抑制GMR信号干扰，很好地保护WCDMA系统的同信道传输性能。
{"title":"Research on the Suppression of GMR Interference in WCDMA Satellite System","authors":"Jinxi Qian","doi":"10.12733/JICS20105509","DOIUrl":"https://doi.org/10.12733/JICS20105509","url":null,"abstract":"As the satellite and space spectrum resource are constrained, most time, the WCDMA (Wideband Code Division Multiple Access) satellite system and the GMR (GEO-mobile radio interface) system have to transport information in the same frequency band. In this case the main interference is the narrowband interference which comes from the GMR system. The paper researched the method of the narrowband interference suppression in the WCDMA satellite system. Furthermore, because the WCDMA system also contains a multi-access interference, the paper proposed a code-aided interference suppression technology, which can suppress both the MAI (Multiple Address Interference) and NBI (Narrow Band Interference), into the WCDMA satellite system to eliminate the GMR interference. Theoretic analysis and system simulation show that, the GMR signal interference can effectively be inhibited with a more mature and better MMSE (Minimum Mean Square Error) and ZF (Zero-force) code-aided technology, the co-channel transmission performance of the WCDMA systems can be protected well.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127819213","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}
Lightning activities have a serious impact on the safe and reliable operation of high-speed railway. In order to make a proper assessment to lightning current withstand capacity of overhead contact line equipment, according to the improved electrical geometric model, the sites of contact netease by lightning were analyzed flrstly, then based on the ATP-EMTP software, lightning catenary model was established, and the lightning resisting levels of overhead contact line equipment under difierent in∞uencing factors were simulated. The results show that the catenary pillar, AF line and T line are highly vulnerable to lightning hazards. When lightning pillar, the lightning resisting level was under 7.1 kA. When lightning suspension wire, the lightning resisting level was under 2.5 kA. The level of lighting resistance can be enhanced when PW line was set up, but the levels of overhead contact line equipment will reduce after considering the power frequency voltage.
{"title":"Research on Lightning Protection Simulation of High-speed Railway Catenary Based on ATP-EMTP ?","authors":"Yuxin Yang, Youpeng Zhang","doi":"10.12733/JICS20105529","DOIUrl":"https://doi.org/10.12733/JICS20105529","url":null,"abstract":"Lightning activities have a serious impact on the safe and reliable operation of high-speed railway. In order to make a proper assessment to lightning current withstand capacity of overhead contact line equipment, according to the improved electrical geometric model, the sites of contact netease by lightning were analyzed flrstly, then based on the ATP-EMTP software, lightning catenary model was established, and the lightning resisting levels of overhead contact line equipment under difierent in∞uencing factors were simulated. The results show that the catenary pillar, AF line and T line are highly vulnerable to lightning hazards. When lightning pillar, the lightning resisting level was under 7.1 kA. When lightning suspension wire, the lightning resisting level was under 2.5 kA. The level of lighting resistance can be enhanced when PW line was set up, but the levels of overhead contact line equipment will reduce after considering the power frequency voltage.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114209988","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}
We consider the problem of online motion segmentation for video streams. Most existing motion segmentation algorithms based on subspace clustering operate in a batch fashion. The main di‐culty of applying these algorithms to real-world applications is that their e‐ciencies can hardly meet the speed requirement when dealing with video streams. In this paper, we propose an online motion segmentation method based on Sparse Subspace Clustering (SSC). Two strategies are adopted in our approach, namely the incremental Principal Component Analysis (PCA) and a warm start from previously obtained Sparse Representation (SR), to accelerate the dimension reduction and SSC in each trail. Through extensive experiments on both synthetic and real-world data sets, we conclude that our algorithm can achieve a signiflcant acceleration under a comparable misclassiflcation rate with respect to other state-of-the-art algorithms.
{"title":"Online Motion Segmentation Based on Sparse Subspace Clustering","authors":"Jianting Wang, Zhongqian Fu","doi":"10.12733/JICS20105521","DOIUrl":"https://doi.org/10.12733/JICS20105521","url":null,"abstract":"We consider the problem of online motion segmentation for video streams. Most existing motion segmentation algorithms based on subspace clustering operate in a batch fashion. The main di‐culty of applying these algorithms to real-world applications is that their e‐ciencies can hardly meet the speed requirement when dealing with video streams. In this paper, we propose an online motion segmentation method based on Sparse Subspace Clustering (SSC). Two strategies are adopted in our approach, namely the incremental Principal Component Analysis (PCA) and a warm start from previously obtained Sparse Representation (SR), to accelerate the dimension reduction and SSC in each trail. Through extensive experiments on both synthetic and real-world data sets, we conclude that our algorithm can achieve a signiflcant acceleration under a comparable misclassiflcation rate with respect to other state-of-the-art algorithms.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129034377","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}
Symbolic Aggregate Approximation (SAX) is a popular algorithm in the symbolic methods, but it doesn’t take the form characteristic of sequence into consideration and its description of time series information is incomplete. In this paper, a method for time series based on symbolic form and area difierence is introduced. This method applies the idea of layered in unvaried-time series similarity measure to combine the symbolic method with the area of sequence and coordinate axis, and the similarity can be searched from the rough to the subtle. Ultimately, not only can the overall trend of sequence be matched, but also the goal of fltting can be reached in detail. The experiments show that this method can be used efiectively for time series similarity matching.
{"title":"The Method for Time Series Based on Symbolic Form and Area Difference","authors":"Yan Wang, Yuanyuan Su","doi":"10.12733/JICS20105495","DOIUrl":"https://doi.org/10.12733/JICS20105495","url":null,"abstract":"Symbolic Aggregate Approximation (SAX) is a popular algorithm in the symbolic methods, but it doesn’t take the form characteristic of sequence into consideration and its description of time series information is incomplete. In this paper, a method for time series based on symbolic form and area difierence is introduced. This method applies the idea of layered in unvaried-time series similarity measure to combine the symbolic method with the area of sequence and coordinate axis, and the similarity can be searched from the rough to the subtle. Ultimately, not only can the overall trend of sequence be matched, but also the goal of fltting can be reached in detail. The experiments show that this method can be used efiectively for time series similarity matching.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115716010","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}
You Li, Yuming Lin, Jingwei Zhang, Jun Li, Lingzhong Zhao
Online review plays a crucial role in many current e-commerce applications. However, fake reviews would mislead users. Therefore, detecting such reviews is an important task for safeguarding the interests of users. But the review sequence has been neglected by the former work. In this paper, we explore the issue on fake review detection in review sequence, which is crucial for implementing online anti-opinion spam. We first analyze the characteristics of fake reviews. Based on review contents and reviewer behaviors, six time sensitive features are proposed to find the fake reviews. And then, we devise two type of detection methods, the supervised and the threshold-based, for spotting the fake reviews as early as possible. Finally, we carry out intensive experiments on a real-world review set to verify the effectiveness of our methods. The experimental results show that our methods can identify the fake reviews orderly with high precision and recall.
{"title":"Highlighting the Fake Reviews in Review Sequence with the Suspicious Contents and Behaviours","authors":"You Li, Yuming Lin, Jingwei Zhang, Jun Li, Lingzhong Zhao","doi":"10.12733/JICS20105452","DOIUrl":"https://doi.org/10.12733/JICS20105452","url":null,"abstract":"Online review plays a crucial role in many current e-commerce applications. However, fake reviews would mislead users. Therefore, detecting such reviews is an important task for safeguarding the interests of users. But the review sequence has been neglected by the former work. In this paper, we explore the issue on fake review detection in review sequence, which is crucial for implementing online anti-opinion spam. We first analyze the characteristics of fake reviews. Based on review contents and reviewer behaviors, six time sensitive features are proposed to find the fake reviews. And then, we devise two type of detection methods, the supervised and the threshold-based, for spotting the fake reviews as early as possible. Finally, we carry out intensive experiments on a real-world review set to verify the effectiveness of our methods. The experimental results show that our methods can identify the fake reviews orderly with high precision and recall.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122027560","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}
Yi Shen, Jiale Xu, Yang Liu, Shuang Liu, Yuancheng Xie
In this paper, we present the concept of self-similarity of edge weights, and propose a new deflnition of weighted communities, that groups of nodes in which the edge weights distribute uniformly but between which they distribute randomly, based on the concept. This deflnition of weighted communities is difierent form the conventional one that groups of nodes in which the edge weights are large while between which they are small, and can be used to reveal the steady connections between nodes or some similarity between nodes’ functions. In order to detect such communities, we propose a corresponding weighted modularity Q SW and a modifled spectral optimization algorithm. We apply our method to several compute-generated networks and real networks, the experiment results clearly show the functions of our method. Furthermore, by changing ‚ which we use for evaluating the equivalence of edge weights, we can discover a special hierarchical organization describing the various steady connections between nodes in groups with our method.
{"title":"Self-similarity of Edge Weights and Community Detection in Weighted Networks ?","authors":"Yi Shen, Jiale Xu, Yang Liu, Shuang Liu, Yuancheng Xie","doi":"10.12733/JICS20105538","DOIUrl":"https://doi.org/10.12733/JICS20105538","url":null,"abstract":"In this paper, we present the concept of self-similarity of edge weights, and propose a new deflnition of weighted communities, that groups of nodes in which the edge weights distribute uniformly but between which they distribute randomly, based on the concept. This deflnition of weighted communities is difierent form the conventional one that groups of nodes in which the edge weights are large while between which they are small, and can be used to reveal the steady connections between nodes or some similarity between nodes’ functions. In order to detect such communities, we propose a corresponding weighted modularity Q SW and a modifled spectral optimization algorithm. We apply our method to several compute-generated networks and real networks, the experiment results clearly show the functions of our method. Furthermore, by changing ‚ which we use for evaluating the equivalence of edge weights, we can discover a special hierarchical organization describing the various steady connections between nodes in groups with our method.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123401003","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
扫码关注我们
求助内容：
应助结果提醒方式：