Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689227
M. Niimi, H. Noda, B. Segee
This paper discusses a visual attack to BPCS-Steganography (Bit-Plane Complexity Segmentation-Steganography) and presents a countermeasure. BPCS categorizes each small block within cover images into either a "noise-like region" or an "informative region" by means of the binary-image feature called complexity and replaces noisy blocks with the binary patterns mapped from the bit sequences of secret data. The binary patterns must be complex because it is replacing complex regions. If the binary patterns to be inserted are simple, then the logical operation called conjugate operation is applied that transforms a simple pattern to a complex pattern. We need to keep, for each block, the flag called a conjugation flag representing whether or not conjugation had been applied to correctly extract the embedded information. In the case where the conjugation flags must be embedded within cover images, we are unable to use the complexity thresholding for the embedding of the flags. Thus the flags must be embedded into a fixed area. To this effect it is easy to recognize unnatural patterns on the LSB plane of stego-images. It can be used as a signature or a distinguishing mark between natural images and images with information embedded by BPCS. We propose secure BPCS which is robust against the visual attack. It is realized by assigning the meaning of the conjugation flag to a pixel of each block and making the specific rule to embed and extract it
{"title":"A Robust BPCS-Steganography against the Visual Attack","authors":"M. Niimi, H. Noda, B. Segee","doi":"10.1109/ICICS.2005.1689227","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689227","url":null,"abstract":"This paper discusses a visual attack to BPCS-Steganography (Bit-Plane Complexity Segmentation-Steganography) and presents a countermeasure. BPCS categorizes each small block within cover images into either a \"noise-like region\" or an \"informative region\" by means of the binary-image feature called complexity and replaces noisy blocks with the binary patterns mapped from the bit sequences of secret data. The binary patterns must be complex because it is replacing complex regions. If the binary patterns to be inserted are simple, then the logical operation called conjugate operation is applied that transforms a simple pattern to a complex pattern. We need to keep, for each block, the flag called a conjugation flag representing whether or not conjugation had been applied to correctly extract the embedded information. In the case where the conjugation flags must be embedded within cover images, we are unable to use the complexity thresholding for the embedding of the flags. Thus the flags must be embedded into a fixed area. To this effect it is easy to recognize unnatural patterns on the LSB plane of stego-images. It can be used as a signature or a distinguishing mark between natural images and images with information embedded by BPCS. We propose secure BPCS which is robust against the visual attack. It is realized by assigning the meaning of the conjugation flag to a pixel of each block and making the specific rule to embed and extract it","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115281853","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689039
Y. Yoon, Hyung-Myung Kim
The improper signals are often encountered in communications and signal processing. Since the known maximum-likelihood (ML) multiuser detection problem is only for proper noises, we derive the improper version of this expansion. We show that the proposed scheme improves the near-far resistance (NFR) for any spreading sequences and channel conditions. This gain comes from appropriate management of the additional information contained in nonzero pseudo-covariance matrix. The average NFR is obtained in a random channel environment and random spreading sequence. The proposed scheme halves the effective number of users. Although the ML multiuser detection gives us the optimum bit error rate (BER) performance, the computational complexity that is exponential in the number of users makes it impractical. In this paper, an efficient ML multiuser detection is developed. First, we relieve the combinatorial constraint of ML detection and obtain the initial decision of the symbols. Then, the most error probable symbols are chosen by referring the reliability measures of the initial symbols. The ML searching is accomplished with only the chosen symbols. Computer simulations demonstrate the results of the paper and show the error rate performance of the proposed near-ML multiuser detection
{"title":"Maximum Likelihood Multiuser Detection of DS/CDMA Signals in Improper Noiset","authors":"Y. Yoon, Hyung-Myung Kim","doi":"10.1109/ICICS.2005.1689039","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689039","url":null,"abstract":"The improper signals are often encountered in communications and signal processing. Since the known maximum-likelihood (ML) multiuser detection problem is only for proper noises, we derive the improper version of this expansion. We show that the proposed scheme improves the near-far resistance (NFR) for any spreading sequences and channel conditions. This gain comes from appropriate management of the additional information contained in nonzero pseudo-covariance matrix. The average NFR is obtained in a random channel environment and random spreading sequence. The proposed scheme halves the effective number of users. Although the ML multiuser detection gives us the optimum bit error rate (BER) performance, the computational complexity that is exponential in the number of users makes it impractical. In this paper, an efficient ML multiuser detection is developed. First, we relieve the combinatorial constraint of ML detection and obtain the initial decision of the symbols. Then, the most error probable symbols are chosen by referring the reliability measures of the initial symbols. The ML searching is accomplished with only the chosen symbols. Computer simulations demonstrate the results of the paper and show the error rate performance of the proposed near-ML multiuser detection","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115419779","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689271
Y. Chong, Liang Wang, S. Ting, W. Gan
An integrated approach towards the development of an active noise control (ANC) headset for audio and communication applications is explored and evaluated. Two different ANC methods are presented and their performance compared. The first method called the integrated feedback active noise control (IFBANC) system employs adaptive feedback ANC technique. Its main advantage is the use of a single error microphone per ear-cup. The second method is the integrated hybrid active noise control (IHANC) system. This approach combines adaptive feedforward and feedback ANC techniques and requires the use of an error microphone and a reference microphone that is mounted on the external of the ear-cup. Simulations have been conducted for both integrated ANC methods and they performed equally well in the lower frequency range. However, the IHANC system continues to perform moderately well in the mid frequency range where the IFBANC system exhibits only slight attenuation. In addition, the IHANC system performs better than the IFBANC system in attenuating narrowly spaced periodic noise in the lower frequency range
{"title":"Integrated Headsets Using the Adaptive Hybrid Active Noise Control System","authors":"Y. Chong, Liang Wang, S. Ting, W. Gan","doi":"10.1109/ICICS.2005.1689271","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689271","url":null,"abstract":"An integrated approach towards the development of an active noise control (ANC) headset for audio and communication applications is explored and evaluated. Two different ANC methods are presented and their performance compared. The first method called the integrated feedback active noise control (IFBANC) system employs adaptive feedback ANC technique. Its main advantage is the use of a single error microphone per ear-cup. The second method is the integrated hybrid active noise control (IHANC) system. This approach combines adaptive feedforward and feedback ANC techniques and requires the use of an error microphone and a reference microphone that is mounted on the external of the ear-cup. Simulations have been conducted for both integrated ANC methods and they performed equally well in the lower frequency range. However, the IHANC system continues to perform moderately well in the mid frequency range where the IFBANC system exhibits only slight attenuation. In addition, the IHANC system performs better than the IFBANC system in attenuating narrowly spaced periodic noise in the lower frequency range","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115422971","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689175
Mikko Löytynoja, N. Cvejic, Eeva Lähetkangas, Tapio Seppänen MediaTeam
The main application area for digital watermarking is copyright protection. We propose a method that increases the robustness of copyright protection watermarks by persuading users not to try attacking the watermark. The method embeds two watermarks into media; a robust one and fragile one. Copy protection information is embedded into the robust watermark. The fragile watermark contains some application specific information that the user do not want to lose. The fragile watermark is constructed so that it is destroyed, if the robust watermark is attacked. The proposed method is demonstrated with a audio encryption scenario that uses the mobile phone to play protected audio files. The audio decryption keys are embedded into the fragile watermark
{"title":"Audio Encryption Using Fragile Watermarking","authors":"Mikko Löytynoja, N. Cvejic, Eeva Lähetkangas, Tapio Seppänen MediaTeam","doi":"10.1109/ICICS.2005.1689175","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689175","url":null,"abstract":"The main application area for digital watermarking is copyright protection. We propose a method that increases the robustness of copyright protection watermarks by persuading users not to try attacking the watermark. The method embeds two watermarks into media; a robust one and fragile one. Copy protection information is embedded into the robust watermark. The fragile watermark contains some application specific information that the user do not want to lose. The fragile watermark is constructed so that it is destroyed, if the robust watermark is attacked. The proposed method is demonstrated with a audio encryption scenario that uses the mobile phone to play protected audio files. The audio decryption keys are embedded into the fragile watermark","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"382 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350042","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689304
S. Xie, Z. Gu, S. Rahardja, J. C. Wong, Y. Xin
The performance of a direct-sequence code division multiple access (DS-CDMA) system is largely dependent on the correlation properties of the spreading sequences in use. Given a set of sequences, it is thus important to select an appropriate subset for optimal performance. In this paper, two new selection criteria of sequence subsets are given for synchronous and asynchronous DS-CDMA systems over multipath fading channels respectively when the multipath intensity profiles (MIP) are known. Simulation results show that subsets of sequences based on the proposed selection criteria can provide better bit-error rate (BER) performance than those based on the existing mean-square correlation selection criteria
{"title":"Selection of Spreading Sequence Subsets for DS-CDMA Systems over Multipath Channels","authors":"S. Xie, Z. Gu, S. Rahardja, J. C. Wong, Y. Xin","doi":"10.1109/ICICS.2005.1689304","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689304","url":null,"abstract":"The performance of a direct-sequence code division multiple access (DS-CDMA) system is largely dependent on the correlation properties of the spreading sequences in use. Given a set of sequences, it is thus important to select an appropriate subset for optimal performance. In this paper, two new selection criteria of sequence subsets are given for synchronous and asynchronous DS-CDMA systems over multipath fading channels respectively when the multipath intensity profiles (MIP) are known. Simulation results show that subsets of sequences based on the proposed selection criteria can provide better bit-error rate (BER) performance than those based on the existing mean-square correlation selection criteria","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123548638","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689306
N. Benvenuto, G. Carnevale, S. Tomasin
In an uplink CDMA transmission, we consider a base station that utilizes successive interference cancellation (SIC) and performs power control of the mobile terminals to minimize the system power. Since the joint optimization of power control and ordering (JOPCO) detection in SIC requires a computational effort that grows exponentially with the number of active users, in this paper we propose an approximated solution obtained by modelling JOPCO as a discrete stochastic optimization problem. The proposed algorithm is based on the construction of a Markov chain whose states are the orderings. Moreover, in order to further reduce complexity, an efficient description of the state probabilities is derived. Simulations performed on an UMTS scenario show that the proposed technique yields a performance close to the optimal JOPCO solution
{"title":"Optimization of SIC Receiver and CDMA Power Control by Discrete Stochastic Approximation","authors":"N. Benvenuto, G. Carnevale, S. Tomasin","doi":"10.1109/ICICS.2005.1689306","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689306","url":null,"abstract":"In an uplink CDMA transmission, we consider a base station that utilizes successive interference cancellation (SIC) and performs power control of the mobile terminals to minimize the system power. Since the joint optimization of power control and ordering (JOPCO) detection in SIC requires a computational effort that grows exponentially with the number of active users, in this paper we propose an approximated solution obtained by modelling JOPCO as a discrete stochastic optimization problem. The proposed algorithm is based on the construction of a Markov chain whose states are the orderings. Moreover, in order to further reduce complexity, an efficient description of the state probabilities is derived. Simulations performed on an UMTS scenario show that the proposed technique yields a performance close to the optimal JOPCO solution","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122633715","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689244
Xiao liu, N. Saberi, Mark J. Coates, Lorne G. Mason
The internal switches in all-photonic networks do not perform data conversion into the electronic domain. Although this removal of O-E-O conversion eliminates a potential capacity bottleneck, it also introduces scheduling challenges; photonic switches cannot perform queuing operations, so traffic arrivals at these switches must be carefully scheduled. The (overlaid) star topology is an excellent match for an all-photonic network because it simplifies the scheduling problem. In such a network architecture, optical time division multiplexing (OTDM) approaches for scheduling the state of the central switch in the star are attractive. In this paper, we describe two OTDM algorithms that we have recently developed, one that performs scheduling on a slot-by-slot basis and another that schedules frames of multiple slots. We report and analyze the results of OPNET simulations that compare the performance of these scheduling algorithms
{"title":"A Comparison between Tnime-slot Scheduling Approaches for All-Photonic Networks","authors":"Xiao liu, N. Saberi, Mark J. Coates, Lorne G. Mason","doi":"10.1109/ICICS.2005.1689244","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689244","url":null,"abstract":"The internal switches in all-photonic networks do not perform data conversion into the electronic domain. Although this removal of O-E-O conversion eliminates a potential capacity bottleneck, it also introduces scheduling challenges; photonic switches cannot perform queuing operations, so traffic arrivals at these switches must be carefully scheduled. The (overlaid) star topology is an excellent match for an all-photonic network because it simplifies the scheduling problem. In such a network architecture, optical time division multiplexing (OTDM) approaches for scheduling the state of the central switch in the star are attractive. In this paper, we describe two OTDM algorithms that we have recently developed, one that performs scheduling on a slot-by-slot basis and another that schedules frames of multiple slots. We report and analyze the results of OPNET simulations that compare the performance of these scheduling algorithms","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983229","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689137
S. Tansuriyavong, T. Suzuki, M. Takeda, M. Iwahashi
This paper aims at extracting human region based on the multi-resolution expression of wavelet transform technique, and also creating transparent image of person based on bit-plane encoding technique, which both techniques are a constituent technology of JPEG2000. The purpose of using these techniques is to reduce the computational cost and data transfer bit rate. We developed the privacy conscious video communication system by using these techniques. In this system, the persons who stay far from the camera at the sending site are displayed as a high-transparent person at the receiving site, in order to protect their privacy
{"title":"Development of a Privacy Conscious Video Communication System Using JPEG2000 Technology","authors":"S. Tansuriyavong, T. Suzuki, M. Takeda, M. Iwahashi","doi":"10.1109/ICICS.2005.1689137","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689137","url":null,"abstract":"This paper aims at extracting human region based on the multi-resolution expression of wavelet transform technique, and also creating transparent image of person based on bit-plane encoding technique, which both techniques are a constituent technology of JPEG2000. The purpose of using these techniques is to reduce the computational cost and data transfer bit rate. We developed the privacy conscious video communication system by using these techniques. In this system, the persons who stay far from the camera at the sending site are displayed as a high-transparent person at the receiving site, in order to protect their privacy","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125570417","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689124
Z. Gu, S. Xie, S. Rahardja, E. T. Sze, Y. Xin
The bit error rate (BER) performance of various spreading sequences in a synchronous multicarrier code-division multiple access (MC-CDMA) system is compared by numerical simulations in this paper. The underlying subcarriers are correlated. Gold, orthogonal Gold, 4-phase family A, Walsh-Hadamard (WH) and new orthogonal unified complex Hadamard transform (UCHT) sequences are investigated here. Simulation results show that both orthogonal WH and UCHT sequences give the best BER performance among various spreading sequences. The disparity in performance between the various spreading sequences can be explained by the property of the zero-delay cross-correlation in frequency domain
{"title":"Performance Comparison of Spreading Sequences in Synchronous MC-CDMA Systems","authors":"Z. Gu, S. Xie, S. Rahardja, E. T. Sze, Y. Xin","doi":"10.1109/ICICS.2005.1689124","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689124","url":null,"abstract":"The bit error rate (BER) performance of various spreading sequences in a synchronous multicarrier code-division multiple access (MC-CDMA) system is compared by numerical simulations in this paper. The underlying subcarriers are correlated. Gold, orthogonal Gold, 4-phase family A, Walsh-Hadamard (WH) and new orthogonal unified complex Hadamard transform (UCHT) sequences are investigated here. Simulation results show that both orthogonal WH and UCHT sequences give the best BER performance among various spreading sequences. The disparity in performance between the various spreading sequences can be explained by the property of the zero-delay cross-correlation in frequency domain","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126177776","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 : 2005-12-06DOI: 10.1109/ICICS.2005.1689246
Bin Chen, S. Bose, W. Zhong
Handling low and medium speed traffic flows using cost-effective traffic grooming strategies is becoming increasingly important for the efficient operation of WDM networks. In this paper, we apply the saturated cut method to routing sub-wavelength multicast traffic in reconfigurable, unicast, mesh WDM networks. Simulations show that setting up lightpaths for the saturated cut significantly improves network-blocking performance
{"title":"Applying Saturated Cut Method in Dynamic Multicast Traffic Grooming in IP/MPLS over WDM Mesh Networks","authors":"Bin Chen, S. Bose, W. Zhong","doi":"10.1109/ICICS.2005.1689246","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689246","url":null,"abstract":"Handling low and medium speed traffic flows using cost-effective traffic grooming strategies is becoming increasingly important for the efficient operation of WDM networks. In this paper, we apply the saturated cut method to routing sub-wavelength multicast traffic in reconfigurable, unicast, mesh WDM networks. Simulations show that setting up lightpaths for the saturated cut significantly improves network-blocking performance","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130007393","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
扫码关注我们
求助内容：
应助结果提醒方式：