Abstract In large scale mobile ad hoc networks (MANETs), it is effective to reduce the load of routing by introducing hierarchical routing, and it is conducted by clustering of nodes. A clustering mechanism based on the diffusion equation is a typical autonomous clustering in MANETs, and gives appropriate clustering if all the node degrees are uniform. However, node degrees in MANETs are heterogeneous in general, the fact causes the difference in the strength of diffusion effect. This difference causes that the position of cluster head tends to be around the boundary of networks and degrade battery efficiency of nodes. In this paper, by introducing an asymmetric diffusion depending on node degree, we propose a new clustering method independent of heterogeneity of node degrees. We show that the proposed method has efficient characteristics for battery consumption. In addition, we show the comparison of the proposed method with the conventional method with respect to the efficiency of routing.
{"title":"Autonomous Clustering Scheme for Removing the Effects of Heterogeneous Node Degrees in Ad Hoc Networks","authors":"Ryosuke Morita, C. Takano, M. Aida","doi":"10.1515/ipc-2016-0010","DOIUrl":"https://doi.org/10.1515/ipc-2016-0010","url":null,"abstract":"Abstract In large scale mobile ad hoc networks (MANETs), it is effective to reduce the load of routing by introducing hierarchical routing, and it is conducted by clustering of nodes. A clustering mechanism based on the diffusion equation is a typical autonomous clustering in MANETs, and gives appropriate clustering if all the node degrees are uniform. However, node degrees in MANETs are heterogeneous in general, the fact causes the difference in the strength of diffusion effect. This difference causes that the position of cluster head tends to be around the boundary of networks and degrade battery efficiency of nodes. In this paper, by introducing an asymmetric diffusion depending on node degree, we propose a new clustering method independent of heterogeneity of node degrees. We show that the proposed method has efficient characteristics for battery consumption. In addition, we show the comparison of the proposed method with the conventional method with respect to the efficiency of routing.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132689476","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}
Abstract We present a comparative evaluation of different classification algorithms for a fusion engine that is used in a speaker identity selection task. The fusion engine combines the scores from a number of classifiers, which uses the GMM-UBM approach to match speaker identity. The performances of the evaluated classification algorithms were examined in both the text-dependent and text-independent operation modes. The experimental results indicated a significant improvement in terms of speaker identification accuracy, which was approximately 7% and 14.5% for the text-dependent and the text-independent scenarios, respectively. We suggest the use of fusion with a discriminative algorithm such as a Support Vector Machine in a real-world speaker identification application where the text-independent scenario predominates based on the findings.
{"title":"Speaker Identification Using Data-Driven Score Classification","authors":"Hock C. Gan, I. Mporas, Saeid Safavi, R. Sotudeh","doi":"10.1515/ipc-2016-0011","DOIUrl":"https://doi.org/10.1515/ipc-2016-0011","url":null,"abstract":"Abstract We present a comparative evaluation of different classification algorithms for a fusion engine that is used in a speaker identity selection task. The fusion engine combines the scores from a number of classifiers, which uses the GMM-UBM approach to match speaker identity. The performances of the evaluated classification algorithms were examined in both the text-dependent and text-independent operation modes. The experimental results indicated a significant improvement in terms of speaker identification accuracy, which was approximately 7% and 14.5% for the text-dependent and the text-independent scenarios, respectively. We suggest the use of fusion with a discriminative algorithm such as a Support Vector Machine in a real-world speaker identification application where the text-independent scenario predominates based on the findings.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128194188","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}
Abstract A communication link that accommodates different service-classes whose calls have different bandwidth requirements and compete for the available bandwidth under the Multiple Fractional Channel Reservation (MFCR) policy is considered. The MFCR policy allows the reservation of real number of channels in order to favor high speed calls. Two call arrival processes are studied: i) the Poisson (random) process and ii) the quasi-random process. In the first case, calls come from an infinite number of sources while in the second case calls are generated by a finite number of sources. To determine call blocking probabilities for Poisson arriving calls, recursive formulas are proposed based on reverse transition rates. To determine time and call congestion probabilities for quasi-random arriving calls, recursive formulas are proven based on the fact that the steady state probabilities cannot be described by a product form solution. The accuracy of the new formulas is verified through simulation.
{"title":"Congestion Probabilities in Erlang-Engset Multirate Loss Models under the Multiple Fractional Channel Reservation Policy","authors":"I. Moscholios","doi":"10.1515/ipc-2016-0003","DOIUrl":"https://doi.org/10.1515/ipc-2016-0003","url":null,"abstract":"Abstract A communication link that accommodates different service-classes whose calls have different bandwidth requirements and compete for the available bandwidth under the Multiple Fractional Channel Reservation (MFCR) policy is considered. The MFCR policy allows the reservation of real number of channels in order to favor high speed calls. Two call arrival processes are studied: i) the Poisson (random) process and ii) the quasi-random process. In the first case, calls come from an infinite number of sources while in the second case calls are generated by a finite number of sources. To determine call blocking probabilities for Poisson arriving calls, recursive formulas are proposed based on reverse transition rates. To determine time and call congestion probabilities for quasi-random arriving calls, recursive formulas are proven based on the fact that the steady state probabilities cannot be described by a product form solution. The accuracy of the new formulas is verified through simulation.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114639720","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}
V. Vassilakis, Liang Wang, I. Moscholios, M. Logothetis
Abstract Information-Centric Networking (ICN) is an emerging networking technology that has been designed to directly operate on named content/information objects, rather than relying on the knowledge of the content location. According to the ICN principles, a user requests the information object by its name or some other form of object identifier. After that, the ICN system is responsible for finding the particular object and sending it back to the user. Despite a large number of works on ICN in recent years, ICN systems still face security challenges. This is especially true when considering different types of alternative networks, such as the wireless community networks (WCNs). In this work, we explore the applicability of ICN principles in the challenging and unpredictable environments of WCNs. We consider stateless content dissemination using Bloom filters (BFs) and analyze two BF based approaches: the traditional single-stage BF and its generalization, the multi-stage BF. We focus on the security aspects of BF based approaches and in particular on distributed denial of service (DDoS) attacks. Finally, we investigate the attack probability for various system and network parameters, such as the number of hash functions, the BF maximum fill factor, and the number of hops toward the victim node.
{"title":"Calculating Distributed Denial of Service Attack Probability in Bloom-Filter based Information-Centric Networks","authors":"V. Vassilakis, Liang Wang, I. Moscholios, M. Logothetis","doi":"10.1515/ipc-2016-0001","DOIUrl":"https://doi.org/10.1515/ipc-2016-0001","url":null,"abstract":"Abstract Information-Centric Networking (ICN) is an emerging networking technology that has been designed to directly operate on named content/information objects, rather than relying on the knowledge of the content location. According to the ICN principles, a user requests the information object by its name or some other form of object identifier. After that, the ICN system is responsible for finding the particular object and sending it back to the user. Despite a large number of works on ICN in recent years, ICN systems still face security challenges. This is especially true when considering different types of alternative networks, such as the wireless community networks (WCNs). In this work, we explore the applicability of ICN principles in the challenging and unpredictable environments of WCNs. We consider stateless content dissemination using Bloom filters (BFs) and analyze two BF based approaches: the traditional single-stage BF and its generalization, the multi-stage BF. We focus on the security aspects of BF based approaches and in particular on distributed denial of service (DDoS) attacks. Finally, we investigate the attack probability for various system and network parameters, such as the number of hash functions, the BF maximum fill factor, and the number of hops toward the victim node.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130863113","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}
Abstract The over 5 GHz available spectral space allocated worldwide around the 60 GHz band, is very promising for very high data rate wireless short-range communications. In this article we present two key components for the 60 GHz front-end of a transceiver, in 130 nm RF CMOS technology: a single-balanced mixer with high Conversion Gain (CG), reduced Noise Figure (NF) and low power consumption, and an LC cross-coupled Voltage Controlled Oscillator (VCO) with very good linearity, with respect to Vctrl, and very low Phase Noise (PN). In both circuits, custom designed inductors and a balun structure for the mixer are employed, in order to enhance their performance. The VCO’s inductor achieves an inductance of 198 pH and a quality factor (Q) of 30, at 30 GHz. The balun shows less than 1o Phase Imbalance (PI) and less than 0.2 dB Amplitude Imbalance (AI), from 57 to 66 GHz. The mixer shows a CG greater than 15 dB and a NF lower than 12 dB. In addition, the VCO achieves a Phase Noise lower than -106 dBc/Hz at 1 MHz offset, and shows great linearity for the entire band. Both circuits are biased with a 1.2 V supply voltage and the total power consumption is about 10.6 mW for the mixer and 10.92 mW for the VCO.
{"title":"60 GHz Front-End Components for Broadband Wireless Communication in 130 nm CMOS Technology","authors":"Vasilis Kolios, K. Giannakidis, G. Kalivas","doi":"10.1515/ipc-2016-0006","DOIUrl":"https://doi.org/10.1515/ipc-2016-0006","url":null,"abstract":"Abstract The over 5 GHz available spectral space allocated worldwide around the 60 GHz band, is very promising for very high data rate wireless short-range communications. In this article we present two key components for the 60 GHz front-end of a transceiver, in 130 nm RF CMOS technology: a single-balanced mixer with high Conversion Gain (CG), reduced Noise Figure (NF) and low power consumption, and an LC cross-coupled Voltage Controlled Oscillator (VCO) with very good linearity, with respect to Vctrl, and very low Phase Noise (PN). In both circuits, custom designed inductors and a balun structure for the mixer are employed, in order to enhance their performance. The VCO’s inductor achieves an inductance of 198 pH and a quality factor (Q) of 30, at 30 GHz. The balun shows less than 1o Phase Imbalance (PI) and less than 0.2 dB Amplitude Imbalance (AI), from 57 to 66 GHz. The mixer shows a CG greater than 15 dB and a NF lower than 12 dB. In addition, the VCO achieves a Phase Noise lower than -106 dBc/Hz at 1 MHz offset, and shows great linearity for the entire band. Both circuits are biased with a 1.2 V supply voltage and the total power consumption is about 10.6 mW for the mixer and 10.92 mW for the VCO.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450346","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}
Taku Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, Y. Tanaka
Abstract In ad hoc networks, broadcast-based forwarding protocols called opportunistic routing have been proposed. In general backoff-based opportunistic routing protocols, each receiver autonomously makes a forwarding decision using a random backoff time based on logical distance. However, each potential forwarder must wait for the expiration of the backoff timer before the packet forwarding. Moreover, they cannot gain forwarding path diversity in sparse environments. In this paper, we propose a novel forwarder selection method for opportunistic routing. In the proposed method, a terminal called, a prioritized forwarder, and which is selected from among neighbours and can forward packets without using the backoff time. In addition, we integrate a hop-by-hop retransmission control in the proposed method, which improves the packet transmission success rate in sparse environments. We evaluate the proposed method in comparison with the conventional protocols in computer simulations.
{"title":"Opportunistic Routing Using Prioritized Forwarders with Retransmission Control","authors":"Taku Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, Y. Tanaka","doi":"10.1515/ipc-2016-0005","DOIUrl":"https://doi.org/10.1515/ipc-2016-0005","url":null,"abstract":"Abstract In ad hoc networks, broadcast-based forwarding protocols called opportunistic routing have been proposed. In general backoff-based opportunistic routing protocols, each receiver autonomously makes a forwarding decision using a random backoff time based on logical distance. However, each potential forwarder must wait for the expiration of the backoff timer before the packet forwarding. Moreover, they cannot gain forwarding path diversity in sparse environments. In this paper, we propose a novel forwarder selection method for opportunistic routing. In the proposed method, a terminal called, a prioritized forwarder, and which is selected from among neighbours and can forward packets without using the backoff time. In addition, we integrate a hop-by-hop retransmission control in the proposed method, which improves the packet transmission success rate in sparse environments. We evaluate the proposed method in comparison with the conventional protocols in computer simulations.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128904471","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}
Abstract This paper presents the implementation of a modified Genetic Programming (GP) method in forecasting fixed broadband telecommunications penetration percentage in Organisation for Economic Co-operation and Development (OECD) countries. The specific GP method combines the use of known diffusion models for technological forecasting purposes, such as Logistic, Gompertz and Bass and the GP. The combination method produces both time dependant and causal models with high performance statistical indicators. Also, multiple approaches to forecasting can be implemented, mainly with no big datasets.
{"title":"Forecasting the OECD Fixed Broadband Penetration with Genetic Programming Method, Diffusion Models and Macro-Economic Indicators","authors":"Konstantinos Salpasaranis, Vasilios Stylianakis","doi":"10.1515/ipc-2016-0004","DOIUrl":"https://doi.org/10.1515/ipc-2016-0004","url":null,"abstract":"Abstract This paper presents the implementation of a modified Genetic Programming (GP) method in forecasting fixed broadband telecommunications penetration percentage in Organisation for Economic Co-operation and Development (OECD) countries. The specific GP method combines the use of known diffusion models for technological forecasting purposes, such as Logistic, Gompertz and Bass and the GP. The combination method produces both time dependant and causal models with high performance statistical indicators. Also, multiple approaches to forecasting can be implemented, mainly with no big datasets.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124444765","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}
N. Sagias, A. Boucouvalas, K. Yiannopoulos, M. Uysal, Zabih Ghassemlooy
Abstract In this work we analytically investigate optimal combiners for pre-amplified diversity receivers that operate under medium-to-strong atmospheric turbulence. We first demonstrate that the combiner performance is strongly affected by the existence of a signal-amplified spontaneous emission beat noise at the output of the photodetector. Due to the signal-dependent nature of noise, the optimal combiner can be classified as a hybrid one, of which performance is between the well-known equal-gain and maximal-ratio combiner architectures. Having established the optimal design, we further assess the proposed combiner performance over gamma-gamma and negative-exponential fading environments.
{"title":"Optimal Combiners in Pre-Amplified Optical Wireless Systems under Medium-to-Strong Atmospheric Turbulence","authors":"N. Sagias, A. Boucouvalas, K. Yiannopoulos, M. Uysal, Zabih Ghassemlooy","doi":"10.1515/ipc-2016-0002","DOIUrl":"https://doi.org/10.1515/ipc-2016-0002","url":null,"abstract":"Abstract In this work we analytically investigate optimal combiners for pre-amplified diversity receivers that operate under medium-to-strong atmospheric turbulence. We first demonstrate that the combiner performance is strongly affected by the existence of a signal-amplified spontaneous emission beat noise at the output of the photodetector. Due to the signal-dependent nature of noise, the optimal combiner can be classified as a hybrid one, of which performance is between the well-known equal-gain and maximal-ratio combiner architectures. Having established the optimal design, we further assess the proposed combiner performance over gamma-gamma and negative-exponential fading environments.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122617851","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}
Abstract In this article a new solution of handwritten digits recognition system for postal applications is presented. Moreover, in this paper, a new approach of handwritten characters recognition was presented. The implemented algorithm is applied to recognition of postal items on the basis of postcode information. In connection with this article the research was carried with all digit characters used in authentic zip code of various mail pieces. Additionally, the paper contains some preliminary image processing for example normalization of the character. The main objective of this article is to use the Radon Transformation and other moments values to obtain an invariant set of character image features, on basis of which postal code will be classified. The reported experiments results prove the effectiveness of the proposed method. Furthermore, causes of errors as well as possible improvement of recognition results will be presented.
{"title":"Invariant Radon-Moment Descriptor for Postal Applications","authors":"M. Miciak","doi":"10.1515/ipc-2015-0040","DOIUrl":"https://doi.org/10.1515/ipc-2015-0040","url":null,"abstract":"Abstract In this article a new solution of handwritten digits recognition system for postal applications is presented. Moreover, in this paper, a new approach of handwritten characters recognition was presented. The implemented algorithm is applied to recognition of postal items on the basis of postcode information. In connection with this article the research was carried with all digit characters used in authentic zip code of various mail pieces. Additionally, the paper contains some preliminary image processing for example normalization of the character. The main objective of this article is to use the Radon Transformation and other moments values to obtain an invariant set of character image features, on basis of which postal code will be classified. The reported experiments results prove the effectiveness of the proposed method. Furthermore, causes of errors as well as possible improvement of recognition results will be presented.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126767579","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}
Abstract The share of video streaming services in the global network traffic is increasing every year. For this reason the problem of optimal use of the available bandwidth, while ensuring an acceptable level of quality of the transmitted video is becoming an important issue. A combination of two techniques, DASH streaming and H.264/AVC video coding can be an important step towards solving this problem. The article presents the discussion the choice of the proper gradation of SVC encoding parameters inside representation of video content in DASH systems. We propose the Temporal Preservation (T-P) method of selection of the SVC stream structure to optimize the grading changes of video quality. This method allows for the implementation of DASH adaptation to changes in available bandwidth on the transmission link, which minimizes the impact of this process on the quality of the received video. According to results of conducted tests, the T-P method offers a better final video quality in DASH systems than similar solutions based on a standard adaptation method. The comparison with the DASH system that uses H.264/AVC encoding also showed superiority of the T-P method, especially in situations of high network congestion
{"title":"Gradation of Video Quality in Dash Services Using the H.264/SVC Coding","authors":"S. Przylucki, A. Sierszen","doi":"10.1515/ipc-2015-0036","DOIUrl":"https://doi.org/10.1515/ipc-2015-0036","url":null,"abstract":"Abstract The share of video streaming services in the global network traffic is increasing every year. For this reason the problem of optimal use of the available bandwidth, while ensuring an acceptable level of quality of the transmitted video is becoming an important issue. A combination of two techniques, DASH streaming and H.264/AVC video coding can be an important step towards solving this problem. The article presents the discussion the choice of the proper gradation of SVC encoding parameters inside representation of video content in DASH systems. We propose the Temporal Preservation (T-P) method of selection of the SVC stream structure to optimize the grading changes of video quality. This method allows for the implementation of DASH adaptation to changes in available bandwidth on the transmission link, which minimizes the impact of this process on the quality of the received video. According to results of conducted tests, the T-P method offers a better final video quality in DASH systems than similar solutions based on a standard adaptation method. The comparison with the DASH system that uses H.264/AVC encoding also showed superiority of the T-P method, especially in situations of high network congestion","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"33 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987972","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
扫码关注我们
求助内容：
应助结果提醒方式：