Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285770
I. Fliss, M. Tagina
In this paper, a general methodology to diagnose multiple faults in hybrid dynamic systems is proposed. The considered dynamic hybrid systems exhibit continuous dynamics with discernable discrete functioning modes. The inputs of the proposed methodology are residuals representing the numerical evaluation of Analytical Redundancy Relations extended to hybrid systems. These residuals are generated due to the use of switched bond graph modeling. The evaluation of these residuals is based on the combination of adaptive thresholding and fuzzy logic reasoning optimized by Particle Swarm Optimization (PSO). The results of the detection module are displayed as a colored causal graph. This causal graph is exploited to correctly isolate multiple faults. The ongoing experiments focus on a simulation of the three-tank hydraulic system, a benchmark in the diagnosis domain.
{"title":"Exploiting fuzzy reasoning optimized by Particle Swarm Optimization and adaptive thresholding to diagnose multiple faults in dynamic hybrid systems","authors":"I. Fliss, M. Tagina","doi":"10.1109/ICCITECHNOL.2012.6285770","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285770","url":null,"abstract":"In this paper, a general methodology to diagnose multiple faults in hybrid dynamic systems is proposed. The considered dynamic hybrid systems exhibit continuous dynamics with discernable discrete functioning modes. The inputs of the proposed methodology are residuals representing the numerical evaluation of Analytical Redundancy Relations extended to hybrid systems. These residuals are generated due to the use of switched bond graph modeling. The evaluation of these residuals is based on the combination of adaptive thresholding and fuzzy logic reasoning optimized by Particle Swarm Optimization (PSO). The results of the detection module are displayed as a colored causal graph. This causal graph is exploited to correctly isolate multiple faults. The ongoing experiments focus on a simulation of the three-tank hydraulic system, a benchmark in the diagnosis domain.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264005","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285790
Badreddine Guizani, B. Ayeb, A. Koukam
Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. Reducing routing overhead is the key to resolve the scalability problem. In this context, we propose a new link state routing protocol named CLSR. It uses clustering to reduce the routing overhead and the size of routing table. It introduces one level hierarchy in the network and it applies proactive link state approach inside as well as outside clusters. We study through simulations the performances of our protocol CLSR, and we compare it to F-OLSR, OLSR-Tree and SA-OLSR protocols. Simulations show that our protocol provides comparable or better performances in term of the generated routing overhead and the data packets delivery ratio.
{"title":"A new cluster-based link state routing for mobile ad hoc networks","authors":"Badreddine Guizani, B. Ayeb, A. Koukam","doi":"10.1109/ICCITECHNOL.2012.6285790","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285790","url":null,"abstract":"Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. Reducing routing overhead is the key to resolve the scalability problem. In this context, we propose a new link state routing protocol named CLSR. It uses clustering to reduce the routing overhead and the size of routing table. It introduces one level hierarchy in the network and it applies proactive link state approach inside as well as outside clusters. We study through simulations the performances of our protocol CLSR, and we compare it to F-OLSR, OLSR-Tree and SA-OLSR protocols. Simulations show that our protocol provides comparable or better performances in term of the generated routing overhead and the data packets delivery ratio.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769958","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285802
R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour
Handover guarantees sustained connectivity during movement of mobile subscribers within cellular networks. In the planning phase of a typical cellular network, the neighboring cell list (NCL) construction depicts the most important feature that would guide the handover performance for each cell. The NCL defines a limited number of cells (neighbors) as candidates for handover from the serving cell of a given subscriber. The identity and number of members of a given NCL play a critical role in the performance of handover where successful handover procedures are mainly attributed to correct construction of NCL. NCLs that suffer from missing neighbor cells result in handover failure or sub-optimal handover decisions. On the other hand, long NCLs are associated with handover delay. In a typical cellular service provider, the initial NCLs are manually constructed and then the defined lists are further optimized during operation. Depending on the efficiency of the manually generated list, the network may suffer bad handover performance until these lists are optimized. To overcome this problem, this paper introduces a mechanism to automatically generate an efficient NCL for a new planned cell based on ranked overlapping coverage using empirical model calculations. The proposed algorithm was tested on a real-life network for two types of mobile generations (GSM and UMTS). The designed NCL is shown to contain all essential neighbors of operationally optimized lists with minimal increase of average NCL lengths.
{"title":"Ranked overlapping coverage based construction of efficient neighboring cell list for GSM/UMTS cellular networks","authors":"R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour","doi":"10.1109/ICCITECHNOL.2012.6285802","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285802","url":null,"abstract":"Handover guarantees sustained connectivity during movement of mobile subscribers within cellular networks. In the planning phase of a typical cellular network, the neighboring cell list (NCL) construction depicts the most important feature that would guide the handover performance for each cell. The NCL defines a limited number of cells (neighbors) as candidates for handover from the serving cell of a given subscriber. The identity and number of members of a given NCL play a critical role in the performance of handover where successful handover procedures are mainly attributed to correct construction of NCL. NCLs that suffer from missing neighbor cells result in handover failure or sub-optimal handover decisions. On the other hand, long NCLs are associated with handover delay. In a typical cellular service provider, the initial NCLs are manually constructed and then the defined lists are further optimized during operation. Depending on the efficiency of the manually generated list, the network may suffer bad handover performance until these lists are optimized. To overcome this problem, this paper introduces a mechanism to automatically generate an efficient NCL for a new planned cell based on ranked overlapping coverage using empirical model calculations. The proposed algorithm was tested on a real-life network for two types of mobile generations (GSM and UMTS). The designed NCL is shown to contain all essential neighbors of operationally optimized lists with minimal increase of average NCL lengths.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"60 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131809941","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285833
Inès Bousnina, Nessrine Rejeb, M. Salah, A. Samet
In this paper, we propose a new method to simultaneously estimate the maximum Doppler Spread (DS), the mean Angle of Arrival (AoA) and the Angular Spread (AS). To this end, the derivatives of the cross-correlation functions (DCCF) of the received signal at a Uniform Linear Array (ULA) are exploited. The Rayleigh channel model where the received signal AoAs follow a Gaussian angular distribution is considered. Simulation results show that, the proposed approach offers better accuracy for maximum DS than the algorithm developed in [1]. For the mean AoA and AS estimation, our approach presents NRMSEs close to the one developed in [2].
{"title":"Doppler and angular spreads estimation using the derivatives of the cross-correlation functions","authors":"Inès Bousnina, Nessrine Rejeb, M. Salah, A. Samet","doi":"10.1109/ICCITECHNOL.2012.6285833","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285833","url":null,"abstract":"In this paper, we propose a new method to simultaneously estimate the maximum Doppler Spread (DS), the mean Angle of Arrival (AoA) and the Angular Spread (AS). To this end, the derivatives of the cross-correlation functions (DCCF) of the received signal at a Uniform Linear Array (ULA) are exploited. The Rayleigh channel model where the received signal AoAs follow a Gaussian angular distribution is considered. Simulation results show that, the proposed approach offers better accuracy for maximum DS than the algorithm developed in [1]. For the mean AoA and AS estimation, our approach presents NRMSEs close to the one developed in [2].","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055543","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285791
S. K. Malekee, Ehsan Rahimi, M. Mayiami
In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.
{"title":"Opportunistic relaying in ad-hoc networks for throughput improvement","authors":"S. K. Malekee, Ehsan Rahimi, M. Mayiami","doi":"10.1109/ICCITECHNOL.2012.6285791","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285791","url":null,"abstract":"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122094006","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285822
Kao-Peng Chou, Jia-Chin Lin
In this paper, a hybrid Cramér-Rao bound (HCRB) for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward (NAF) relaying systems is derived. The HCRB is an effective benchmark for examining channel estimation performance. Several conventional frequency-domain channel estimations, such as the least-squares (LS), minimum-mean-square-error (MMSE) channel estimators are simulated and compared with the derived HCRB.
{"title":"A hybrid Cramér-Rao bound for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward cooperative OFDM systems","authors":"Kao-Peng Chou, Jia-Chin Lin","doi":"10.1109/ICCITECHNOL.2012.6285822","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285822","url":null,"abstract":"In this paper, a hybrid Cramér-Rao bound (HCRB) for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward (NAF) relaying systems is derived. The HCRB is an effective benchmark for examining channel estimation performance. Several conventional frequency-domain channel estimations, such as the least-squares (LS), minimum-mean-square-error (MMSE) channel estimators are simulated and compared with the derived HCRB.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072719","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285782
Hela Lajmi, A. Alimi
Due to the swift growth of network communication, Network monitoring is necessary for evaluating performance issues, recognizing and locating problems. There is increasing interest in passive monitoring obeying to high-bandwidth requirements. In order to decipher how to place monitors under cost-effective and real-time constraints within the network, a new approach is presented in this paper, which solves the problem of monitoring high bitrates and convenes three often-conflicting requirements. The first is supporting high bitrates (over 400 megabytes per second), and hence huge system throughputs. The second is opening a gigabyte file (over 100 Gigabytes) while insuring the real-time analysis of its data, and the third is running only one off-the-shelf and cost-effective computer. The monitoring and analysis chore in our system allows online and offline analysis. Its challenging task is collecting and analyzing such huge data on real-time using a centralized processing architecture.
{"title":"PEMONAS: Passive Ethernet traffic MONitoring and AnalySis system","authors":"Hela Lajmi, A. Alimi","doi":"10.1109/ICCITECHNOL.2012.6285782","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285782","url":null,"abstract":"Due to the swift growth of network communication, Network monitoring is necessary for evaluating performance issues, recognizing and locating problems. There is increasing interest in passive monitoring obeying to high-bandwidth requirements. In order to decipher how to place monitors under cost-effective and real-time constraints within the network, a new approach is presented in this paper, which solves the problem of monitoring high bitrates and convenes three often-conflicting requirements. The first is supporting high bitrates (over 400 megabytes per second), and hence huge system throughputs. The second is opening a gigabyte file (over 100 Gigabytes) while insuring the real-time analysis of its data, and the third is running only one off-the-shelf and cost-effective computer. The monitoring and analysis chore in our system allows online and offline analysis. Its challenging task is collecting and analyzing such huge data on real-time using a centralized processing architecture.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389021","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285780
H. Elbiaze
A key goal of designing memoryless OBS networks is the minimization of burst loss. Loss is due mainly to restraints that can occur at core nodes, such as contention. Such events occurring at OBS layer are misinterpreted by TCP congestion control mechanisms that reacts on (i) burst drops, (ii) end-to-end delay variation and (iii) throughput changes. This paper proposes a destination-ordering mechanism over a load balanced OBS network, that minimizes TCP misinterpretation and maximizes TCP throughput.
{"title":"Maximizing TCP throughput in OBS networks","authors":"H. Elbiaze","doi":"10.1109/ICCITECHNOL.2012.6285780","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285780","url":null,"abstract":"A key goal of designing memoryless OBS networks is the minimization of burst loss. Loss is due mainly to restraints that can occur at core nodes, such as contention. Such events occurring at OBS layer are misinterpreted by TCP congestion control mechanisms that reacts on (i) burst drops, (ii) end-to-end delay variation and (iii) throughput changes. This paper proposes a destination-ordering mechanism over a load balanced OBS network, that minimizes TCP misinterpretation and maximizes TCP throughput.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126291739","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285798
Sassi Maaloul, Mériem Afif, S. Tabbane
The international deployment of heterogeneous wireless networks is progressing steadily. It can offer unlimited services to mobile users, in order to provide ubiquitous broadband access. At the same time, with the broadband technologies (3/4G) and the releases mobility criterion interconnection problems and interoperability between networks raise a major matter. The handover procedure is a critical challenge to assure such a situation. The most of the previous handover mechanisms show inadequacy when making handover decision by considering a few metrics related to different radio access technologies. Also, with the diversification of the context metrics, it is difficult to find a reliable criterion that ensures the selection of the best candidate network. In this paper, an intelligent handover decision mechanism is proposed based on the context-aware strategy and Media Independent Handover in order to improve not only the continuity of the connection but to reduce the latency, to maximize performance level, to enable seamless handover and roaming from any access network to any other one guaranteeing always best connected.
{"title":"A new vertical handover decision based context awareness for ubiquitous access","authors":"Sassi Maaloul, Mériem Afif, S. Tabbane","doi":"10.1109/ICCITECHNOL.2012.6285798","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285798","url":null,"abstract":"The international deployment of heterogeneous wireless networks is progressing steadily. It can offer unlimited services to mobile users, in order to provide ubiquitous broadband access. At the same time, with the broadband technologies (3/4G) and the releases mobility criterion interconnection problems and interoperability between networks raise a major matter. The handover procedure is a critical challenge to assure such a situation. The most of the previous handover mechanisms show inadequacy when making handover decision by considering a few metrics related to different radio access technologies. Also, with the diversification of the context metrics, it is difficult to find a reliable criterion that ensures the selection of the best candidate network. In this paper, an intelligent handover decision mechanism is proposed based on the context-aware strategy and Media Independent Handover in order to improve not only the continuity of the connection but to reduce the latency, to maximize performance level, to enable seamless handover and roaming from any access network to any other one guaranteeing always best connected.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459941","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-06-26DOI: 10.1109/ICCITECHNOL.2012.6285776
Wassim Drira, É. Renault, D. Zeghlache
Applications in Wireless Sensor Networks are numerous and in different areas. However, these applications are mostly application-specific which makes communication between different sensors and the interaction with those sensors difficult. This paper aims at providing a generic back end middleware used to receive, store, index, manage and transform sensors measurements. Sensors from different networks and devices are supposed to send them data to a specific composite in the middleware. This composite should be set up by instantiating some default or personalized sub-components. The middleware is fully flexible and it is based on OSGi, XML and no-SQL databases.
{"title":"iSensors: A middleware for dynamic sensor networks","authors":"Wassim Drira, É. Renault, D. Zeghlache","doi":"10.1109/ICCITECHNOL.2012.6285776","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285776","url":null,"abstract":"Applications in Wireless Sensor Networks are numerous and in different areas. However, these applications are mostly application-specific which makes communication between different sensors and the interaction with those sensors difficult. This paper aims at providing a generic back end middleware used to receive, store, index, manage and transform sensors measurements. Sensors from different networks and devices are supposed to send them data to a specific composite in the middleware. This composite should be set up by instantiating some default or personalized sub-components. The middleware is fully flexible and it is based on OSGi, XML and no-SQL databases.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128022867","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
扫码关注我们
求助内容：
应助结果提醒方式：