Pub Date : 2011-12-01DOI: 10.1109/ISCIT.2011.6092151
Jie Yang, Zhifeng Zhao, Honggang Zhang
Wireless sensor networks (WSN) is becoming large-scale. It's meaningful to gather sensor data quickly and efficiently. In this paper, we present a new approach to collect sensor data by distributed rateless coding. Rateless codes, such as Luby Transform (LT) codes have been proved possessing a very good property that receivers can decode all k original packets from arbitrary k(1+ε) encoded packets. Improved LT (iLT) codes with a new degree distribution are proposed. Each sensor packet does walks randomly, stops at a random node and selects the sensor packet of that node to exclusive-or (XOR) with an appropriate probability. The process continues until the required degree is achieved. Simulation results demonstrate that the proposed method requires less inter-communication cost to complete the encoding process. At the mean time, it also makes the data gathering much faster.
{"title":"Energy efficient data gathering based on distributed iLT coding","authors":"Jie Yang, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/ISCIT.2011.6092151","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092151","url":null,"abstract":"Wireless sensor networks (WSN) is becoming large-scale. It's meaningful to gather sensor data quickly and efficiently. In this paper, we present a new approach to collect sensor data by distributed rateless coding. Rateless codes, such as Luby Transform (LT) codes have been proved possessing a very good property that receivers can decode all k original packets from arbitrary k(1+ε) encoded packets. Improved LT (iLT) codes with a new degree distribution are proposed. Each sensor packet does walks randomly, stops at a random node and selects the sensor packet of that node to exclusive-or (XOR) with an appropriate probability. The process continues until the required degree is achieved. Simulation results demonstrate that the proposed method requires less inter-communication cost to complete the encoding process. At the mean time, it also makes the data gathering much faster.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133911795","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089734
Xiaoliang Xue, Xiaojing Huang
Block transform orthogonal frequency division multiplexing (BT-OFDM) — a system sitting in-between two extreme data transmission schemes, i.e., the conventional OFDM system and the single-carrier system, with a balanced system performance is proposed in this paper. Through data symbol grouping and block transformation, the BT-OFDM uses reduced size inverse fast Fourier transform to take the advantages of the single-carrier system to overcome the disadvantages of the conventional OFDM system. Frequency domain representation of the BT-OFDM signal reveals that the block transformation implicitly realizes a precoding or block spreading of the transmitted data symbols. When suitable IFFT size is selected, the BT-OFDM also offers the lowest overall system complexity.
{"title":"Block transform OFDM: A robust power and bandwidth efficient system with improved frequency diversity performance","authors":"Xiaoliang Xue, Xiaojing Huang","doi":"10.1109/ISCIT.2011.6089734","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089734","url":null,"abstract":"Block transform orthogonal frequency division multiplexing (BT-OFDM) — a system sitting in-between two extreme data transmission schemes, i.e., the conventional OFDM system and the single-carrier system, with a balanced system performance is proposed in this paper. Through data symbol grouping and block transformation, the BT-OFDM uses reduced size inverse fast Fourier transform to take the advantages of the single-carrier system to overcome the disadvantages of the conventional OFDM system. Frequency domain representation of the BT-OFDM signal reveals that the block transformation implicitly realizes a precoding or block spreading of the transmitted data symbols. When suitable IFFT size is selected, the BT-OFDM also offers the lowest overall system complexity.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134058991","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092156
X. Shi, C. Siriteanu, S. Yoshizawa, Y. Miyanaga
In recent years, there have been significant breakthroughs in wireless communication systems design based on the multiple-input multiple-output (MIMO) concept. Exploiting the channel state information at the transmitter (CSIT) can improve the link performance. Thus, MIMO precoding has been an active research area for wireless communications. By specifying a precoding matrix with full CSIT, one can activate the strongest channel modes. In practice, important issues include how to obtain an accurate estimated CSI and use it. In this paper, we exploit estimated CSI for a correlated realistic Rician fading channel with estimated statistics. Then, a new precoder by providing the statistical mean of the channel matrix is presented. Numerical results show the performance degradation exists between the typical channel assumption, i.e., Rayleigh fading, and the realistic channel, i.e., correlated Rician fading. The new CSIT by sufficiently considering the channel statistics can reduce the error rate. The rank of the Rician fading channel matrix renders performance sensitive for the precoding performance.
{"title":"MIMO precoding performance for correlated and estimated Rician fading","authors":"X. Shi, C. Siriteanu, S. Yoshizawa, Y. Miyanaga","doi":"10.1109/ISCIT.2011.6092156","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092156","url":null,"abstract":"In recent years, there have been significant breakthroughs in wireless communication systems design based on the multiple-input multiple-output (MIMO) concept. Exploiting the channel state information at the transmitter (CSIT) can improve the link performance. Thus, MIMO precoding has been an active research area for wireless communications. By specifying a precoding matrix with full CSIT, one can activate the strongest channel modes. In practice, important issues include how to obtain an accurate estimated CSI and use it. In this paper, we exploit estimated CSI for a correlated realistic Rician fading channel with estimated statistics. Then, a new precoder by providing the statistical mean of the channel matrix is presented. Numerical results show the performance degradation exists between the typical channel assumption, i.e., Rayleigh fading, and the realistic channel, i.e., correlated Rician fading. The new CSIT by sufficiently considering the channel statistics can reduce the error rate. The rank of the Rician fading channel matrix renders performance sensitive for the precoding performance.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"78 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131607420","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092166
Xin Song, Jinkuan Wang, Qiuming Li, Jingguo Ren, Han Wang
A novel robust least squares constant modulus algorithm (LSCMA) is proposed for blind adaptive beamforming, which is based on explicit modeling of uncertainty in the desired signal array. To improve robustness, the weight vector is optimized to involve minimization of cost function, while imposing the oblique projection constraint on the weight vector and maintaining a distortionless response for the worst-case signal steering vector. The proposed algorithm appears to be an appealing technique for blind adaptive beamforming that combines excellent robustness with low computational complexity. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement.
{"title":"Robust blind beamforming algorithm via the oblique projection method","authors":"Xin Song, Jinkuan Wang, Qiuming Li, Jingguo Ren, Han Wang","doi":"10.1109/ISCIT.2011.6092166","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092166","url":null,"abstract":"A novel robust least squares constant modulus algorithm (LSCMA) is proposed for blind adaptive beamforming, which is based on explicit modeling of uncertainty in the desired signal array. To improve robustness, the weight vector is optimized to involve minimization of cost function, while imposing the oblique projection constraint on the weight vector and maintaining a distortionless response for the worst-case signal steering vector. The proposed algorithm appears to be an appealing technique for blind adaptive beamforming that combines excellent robustness with low computational complexity. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128035496","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089725
J. Ha, Jin-Up Kim, Youngho Jeong
Considering multiple radio access technologies (RATs) environment for the future wireless access networks, effective RAT discovery and selection are important tasks. They enable discovery of various RATs and let the user select appropriate RAT considering users' preferences and other parameters. The wireless network operator may also take advantage of RAT selection in order to distribute loads among two or more RATs. This paper introduces our pilot design of smart radio research platform (SRRP), on which performance of RAT discovery and selection algorithms are tested. Designing SRRP, we stressed on compliance with existing technical standard specifications, e.g. IEEE P1900.4 and 802.21, efficient RAT discovery, and reasonable RAT selection performance. In regard to RAT discovery algorithm we focused on short discovery time in order to reduce battery consumption and minimize possible quality of service (QoS) degradation. Objective of RAT selection is two folded; one is to choose a satisfactory radio connection and the other one is to maintain the connection reliably. Besides RAT discovery and selection algorithms we incorporated spectrum aggregation capability into SRRP to support user's QoS requirement by allocating an extra spectrum block to a base station (BS) where the existing spectrum block is congested.
{"title":"A design of smart radio research platform for universal access in a multi-RAT environment","authors":"J. Ha, Jin-Up Kim, Youngho Jeong","doi":"10.1109/ISCIT.2011.6089725","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089725","url":null,"abstract":"Considering multiple radio access technologies (RATs) environment for the future wireless access networks, effective RAT discovery and selection are important tasks. They enable discovery of various RATs and let the user select appropriate RAT considering users' preferences and other parameters. The wireless network operator may also take advantage of RAT selection in order to distribute loads among two or more RATs. This paper introduces our pilot design of smart radio research platform (SRRP), on which performance of RAT discovery and selection algorithms are tested. Designing SRRP, we stressed on compliance with existing technical standard specifications, e.g. IEEE P1900.4 and 802.21, efficient RAT discovery, and reasonable RAT selection performance. In regard to RAT discovery algorithm we focused on short discovery time in order to reduce battery consumption and minimize possible quality of service (QoS) degradation. Objective of RAT selection is two folded; one is to choose a satisfactory radio connection and the other one is to maintain the connection reliably. Besides RAT discovery and selection algorithms we incorporated spectrum aggregation capability into SRRP to support user's QoS requirement by allocating an extra spectrum block to a base station (BS) where the existing spectrum block is congested.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114352933","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089948
Yanyan Shen, G. Feng, Bo Yang, X. Guan
This paper focuses on the problem of fair resource allocation in wireless multi-user multi-relay networks where both constant-rate users and variable-rate users exist. The problem is formulated as an optimization problem targeting at finding the Nash bargaining solution for the variable-rate users subject to a set of users' rate constraints and a set of relay power constraints. The formulated problem is proven to be a concave maximization problem, and the dual decomposition method is employed to find the optimal solution. Based on this method, a distributed algorithm is then proposed and its convergence is proved as well. Finally, simulations validate the convergence and fairness of the proposed algorithm.
{"title":"Distributed fair resource allocation in wireless multi-user multi-relay networks with heterogeneous rate constraints","authors":"Yanyan Shen, G. Feng, Bo Yang, X. Guan","doi":"10.1109/ISCIT.2011.6089948","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089948","url":null,"abstract":"This paper focuses on the problem of fair resource allocation in wireless multi-user multi-relay networks where both constant-rate users and variable-rate users exist. The problem is formulated as an optimization problem targeting at finding the Nash bargaining solution for the variable-rate users subject to a set of users' rate constraints and a set of relay power constraints. The formulated problem is proven to be a concave maximization problem, and the dual decomposition method is employed to find the optimal solution. Based on this method, a distributed algorithm is then proposed and its convergence is proved as well. Finally, simulations validate the convergence and fairness of the proposed algorithm.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126282594","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089950
B. Bhumiratana
Today, several online services are provided for free in exchange for the users private information/interaction online. It is common for these services on the internet to also act as data warehouse, gathering the usage information and all interaction of its users. The collection and dissemination of the data is governed by the service provider's privacy policy, which users must agree to prior to using the service. Once agreed to the policy, the user no longer has any say in regard to how the service provider uses the data. In this paper, we propose a model for 3 parties policy architecture that allows the consumer, the data warehouse, and a 3rd party service provider that want to use the data stored by the data warehouse to negotiate the privacy policy and the need to access the data. We propose an application architecture utilizing this policy model, and discuss how it can be used. Lastly, we discuss the dataset we perform simulation experiment on, and our findings.
{"title":"A model for privacy policy agreement in online services","authors":"B. Bhumiratana","doi":"10.1109/ISCIT.2011.6089950","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089950","url":null,"abstract":"Today, several online services are provided for free in exchange for the users private information/interaction online. It is common for these services on the internet to also act as data warehouse, gathering the usage information and all interaction of its users. The collection and dissemination of the data is governed by the service provider's privacy policy, which users must agree to prior to using the service. Once agreed to the policy, the user no longer has any say in regard to how the service provider uses the data. In this paper, we propose a model for 3 parties policy architecture that allows the consumer, the data warehouse, and a 3rd party service provider that want to use the data stored by the data warehouse to negotiate the privacy policy and the need to access the data. We propose an application architecture utilizing this policy model, and discuss how it can be used. Lastly, we discuss the dataset we perform simulation experiment on, and our findings.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125576573","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089958
Yiwei Yu, E. Dutkiewicz, Xiaojing Huang, M. Muck
In this paper, we proposed a comprehensive resource allocation scheme to achieve inter-cell interference coordination and performance enhancement for the shared relay network in LTE-Advanced systems. In the scheme, the allocation process is implemented by two steps. The global frequency planning strategies are first employed to realize the interference coordination in the multi-cell environment. Then dedicated local scheduling algorithms are applied to provide further performance enhancement for cell-edge users. As shown in the simulation results, our proposed scheme can achieve the significant performance improvement for cell-edge users while maintaining the high performance for cell-center users, and thus obtain the better performance balance in the system.
{"title":"Interference coordination and performance enhancement for shared relay networks in LTE-Advanced systems","authors":"Yiwei Yu, E. Dutkiewicz, Xiaojing Huang, M. Muck","doi":"10.1109/ISCIT.2011.6089958","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089958","url":null,"abstract":"In this paper, we proposed a comprehensive resource allocation scheme to achieve inter-cell interference coordination and performance enhancement for the shared relay network in LTE-Advanced systems. In the scheme, the allocation process is implemented by two steps. The global frequency planning strategies are first employed to realize the interference coordination in the multi-cell environment. Then dedicated local scheduling algorithms are applied to provide further performance enhancement for cell-edge users. As shown in the simulation results, our proposed scheme can achieve the significant performance improvement for cell-edge users while maintaining the high performance for cell-center users, and thus obtain the better performance balance in the system.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124881943","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092189
Xiaozhi Gao, Weijia Lei, Xianwei Xie
In this paper, the optimal power control strategies under four different types of power constraints are derived via convex optimization to maximize the ergodic capacity of secondary system based on spectrum sharing while guaranteeing QoS of the primary system transmission. The interference from primary user to secondary system is simultaneously considered in the analysis process besides the interference from secondary user to primary system. It is shown that both the transmission power of primary user and different power constraint parameters affect the ergodic capacity of secondary system severely, furthermore, the proposed power control strategies outperform the existing schemes without considering the effects of the transmission power of primary user via the achievable capacities during the simulation results.
{"title":"Optimal power control for secondary system based on spectrum sharing","authors":"Xiaozhi Gao, Weijia Lei, Xianwei Xie","doi":"10.1109/ISCIT.2011.6092189","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092189","url":null,"abstract":"In this paper, the optimal power control strategies under four different types of power constraints are derived via convex optimization to maximize the ergodic capacity of secondary system based on spectrum sharing while guaranteeing QoS of the primary system transmission. The interference from primary user to secondary system is simultaneously considered in the analysis process besides the interference from secondary user to primary system. It is shown that both the transmission power of primary user and different power constraint parameters affect the ergodic capacity of secondary system severely, furthermore, the proposed power control strategies outperform the existing schemes without considering the effects of the transmission power of primary user via the achievable capacities during the simulation results.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131038016","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089960
Dongho Lee, Kwangsung Ju, K. Chung
Multihop tactical network applications require that mission-critical data should be guaranteed to be delivered to their corresponding targets in time. However, end-to-end QoS (Quality of Service) assurance in multihop networks is a very challenging topic. Several schemes have been proposed to provide end-to-end delay assurance for multihop wireless network environment. However, these schemes do not consider the situation that the network is overloaded and burst collision is occurred. In this paper, we propose the dynamic traffic prioritization scheme for multihop tactical networks. The proposed scheme dynamically assigns priorities to traffic according to network status and the newly defined traffic categories in order to achieve guaranteed end-to-end QoS in multihop tactical networks. In addition, when the burst collision is occurred, the proposed scheme satisfies the requirement of mission-critical data by sacrificing the QoS requirement of non-mission-critical data.
{"title":"Dynamic traffic prioritization scheme for multihop tactical networks","authors":"Dongho Lee, Kwangsung Ju, K. Chung","doi":"10.1109/ISCIT.2011.6089960","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089960","url":null,"abstract":"Multihop tactical network applications require that mission-critical data should be guaranteed to be delivered to their corresponding targets in time. However, end-to-end QoS (Quality of Service) assurance in multihop networks is a very challenging topic. Several schemes have been proposed to provide end-to-end delay assurance for multihop wireless network environment. However, these schemes do not consider the situation that the network is overloaded and burst collision is occurred. In this paper, we propose the dynamic traffic prioritization scheme for multihop tactical networks. The proposed scheme dynamically assigns priorities to traffic according to network status and the newly defined traffic categories in order to achieve guaranteed end-to-end QoS in multihop tactical networks. In addition, when the burst collision is occurred, the proposed scheme satisfies the requirement of mission-critical data by sacrificing the QoS requirement of non-mission-critical data.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132746133","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
扫码关注我们
求助内容：
应助结果提醒方式：