The concept of cloud computing has become one of the hot topics in the world of corporate information systems in recent years. Organisations are always interested in initiatives that allow them to pay less attention to the more mundane areas of information system management, such as maintenance, capacity management and storage management, and free up time and resources to concentrate on more strategic and tactical issues that are commonly perceived as being of higher value. A moment's consideration reveals, however, that the use of cloud computing services, like the use of outsourcing facilities, is not necessarily a panacea. Management will always retain responsibility for the confidentiality, integrity and availability of its applications and data, and being able to develop the confidence that these issues have been addressed. This paper outlines the background to cloud computing and presents the results of a survey of Swiss organisations and their attitudes towards data management and the use of the cloud.
{"title":"Structured and Unstructured Data in the Cloud: A Swiss Perspective on Readiness and Internal Controls","authors":"David Simms, S. Ghernaouti-Helie","doi":"10.1109/WAINA.2013.63","DOIUrl":"https://doi.org/10.1109/WAINA.2013.63","url":null,"abstract":"The concept of cloud computing has become one of the hot topics in the world of corporate information systems in recent years. Organisations are always interested in initiatives that allow them to pay less attention to the more mundane areas of information system management, such as maintenance, capacity management and storage management, and free up time and resources to concentrate on more strategic and tactical issues that are commonly perceived as being of higher value. A moment's consideration reveals, however, that the use of cloud computing services, like the use of outsourcing facilities, is not necessarily a panacea. Management will always retain responsibility for the confidentiality, integrity and availability of its applications and data, and being able to develop the confidence that these issues have been addressed. This paper outlines the background to cloud computing and presents the results of a survey of Swiss organisations and their attitudes towards data management and the use of the cloud.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124939997","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}
Takuya Sugitani, Masumi Shirakawa, T. Hara, S. Nishio
In this paper, we study how to detect local events regardless of the size and the type using Twitter, a social networking service. Our method is based on the observation that relevant tweets are simultaneously posted from the place where a local event is happening. Specifically, our method first extracts the place where and the time when multiple tweets are posted by using clustering techniques and then detects the co-occurrence of key terms in each cluster to find local events. For determining key terms, our method also leverages spatiotemporal locality of tweets. From experimental results on tweet data from 9:00 to 15:00 on October 9, 2011, we confirmed the effectiveness of our method.
{"title":"Detecting Local Events by Analyzing Spatiotemporal Locality of Tweets","authors":"Takuya Sugitani, Masumi Shirakawa, T. Hara, S. Nishio","doi":"10.1109/WAINA.2013.246","DOIUrl":"https://doi.org/10.1109/WAINA.2013.246","url":null,"abstract":"In this paper, we study how to detect local events regardless of the size and the type using Twitter, a social networking service. Our method is based on the observation that relevant tweets are simultaneously posted from the place where a local event is happening. Specifically, our method first extracts the place where and the time when multiple tweets are posted by using clustering techniques and then detects the co-occurrence of key terms in each cluster to find local events. For determining key terms, our method also leverages spatiotemporal locality of tweets. From experimental results on tweet data from 9:00 to 15:00 on October 9, 2011, we confirmed the effectiveness of our method.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125293153","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}
Admir Barolli, Tetsuya Oda, Evjola Spaho, L. Barolli, F. Xhafa, M. Takizawa
Wireless Mesh Networks (WMNs) are currently attracting a lot of attention from wireless research and technology community due to their importance for providing cost-efficient broadband wireless connectivity. Issues for achieving the network connectivity and user coverage are related with the node placement problem. In this paper, we evaluate the performance of WMN-GA system for node placement problem in WMNs. For evaluation, we consider Normal Distribution of mesh clients and different selection and mutation operators. The population size is considered 64 and the number of generation 200. For evaluation, we consider the giant component and the number of covered users metrics. The simulation results shows that the WMN-GA system performs better for Single Mutation and Linear Ranking.
{"title":"Performance Evaluation of WMN-GA System for Node Placement in WMNs Considering Normal Distribution of Mesh Clients and Different Selection and Mutation Operators","authors":"Admir Barolli, Tetsuya Oda, Evjola Spaho, L. Barolli, F. Xhafa, M. Takizawa","doi":"10.1109/WAINA.2013.105","DOIUrl":"https://doi.org/10.1109/WAINA.2013.105","url":null,"abstract":"Wireless Mesh Networks (WMNs) are currently attracting a lot of attention from wireless research and technology community due to their importance for providing cost-efficient broadband wireless connectivity. Issues for achieving the network connectivity and user coverage are related with the node placement problem. In this paper, we evaluate the performance of WMN-GA system for node placement problem in WMNs. For evaluation, we consider Normal Distribution of mesh clients and different selection and mutation operators. The population size is considered 64 and the number of generation 200. For evaluation, we consider the giant component and the number of covered users metrics. The simulation results shows that the WMN-GA system performs better for Single Mutation and Linear Ranking.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122613830","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. Pitropakis, C. Lambrinoudakis, D. Geneiatakis, D. Gritzalis
Several steganographic algorithms have been proposed for protecting message secrecy against unauthorized "reads". The most used method for hiding a message relies on embedding the secret message in Least Significant Bit (LSB) on the cover object. Though various digital formats have been proposed in literature to be used as cover objects, little attention has been paid on Matroska multimedia containers. In this work, we propose a practical method for applying steganography in these types of files. The proposed method consists of three distinct phases. The first one encrypts the hidden message, the second embeds it to the stego cover, while at the final step the stego cover is attached to a Matroska container. We tested our approach in various scenarios in order to evaluate the introduced overhead. Results shows that the use of several sizes for TXT and WAV files did not introduce considerable overhead. Depending on the file size the introduce overhead can be between 1 to 3 seconds.
{"title":"A Practical Steganographic Approach for Matroska Based High Quality Video Files","authors":"N. Pitropakis, C. Lambrinoudakis, D. Geneiatakis, D. Gritzalis","doi":"10.1109/WAINA.2013.39","DOIUrl":"https://doi.org/10.1109/WAINA.2013.39","url":null,"abstract":"Several steganographic algorithms have been proposed for protecting message secrecy against unauthorized \"reads\". The most used method for hiding a message relies on embedding the secret message in Least Significant Bit (LSB) on the cover object. Though various digital formats have been proposed in literature to be used as cover objects, little attention has been paid on Matroska multimedia containers. In this work, we propose a practical method for applying steganography in these types of files. The proposed method consists of three distinct phases. The first one encrypts the hidden message, the second embeds it to the stego cover, while at the final step the stego cover is attached to a Matroska container. We tested our approach in various scenarios in order to evaluate the introduced overhead. Results shows that the use of several sizes for TXT and WAV files did not introduce considerable overhead. Depending on the file size the introduce overhead can be between 1 to 3 seconds.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132363798","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}
Botnets are networks of compromised computers controlled under a common command and control channel. Recognized as one of the most serious security threats on current Internet infrastructure, botnets are often hidden in existing applications, e.g. IRC, HTTP, or peer-to-peer, which makes botnet detection a challenging problem. In this paper we propose a new, centralized, fully-encrypted, botnet system called Weasel. A set of signatures are examined and formalized to differentiate the behaviors of Weasel and normal web applications. Through these signatures, we apply a set of data mining techniques to detect the web based botnet behaviors on a web application community formed on a campus backbone network. The proposed approach was evaluated with over 400 thousand flows collected over seven consecutive days on a large scale network and results show the proposed approach successfully detects the botnet flows with a high detection rate and an acceptably low false alarm rate.
{"title":"Mining Botnet Behaviors on the Large-Scale Web Application Community","authors":"Dan Garant, Wei Lu","doi":"10.1109/WAINA.2013.235","DOIUrl":"https://doi.org/10.1109/WAINA.2013.235","url":null,"abstract":"Botnets are networks of compromised computers controlled under a common command and control channel. Recognized as one of the most serious security threats on current Internet infrastructure, botnets are often hidden in existing applications, e.g. IRC, HTTP, or peer-to-peer, which makes botnet detection a challenging problem. In this paper we propose a new, centralized, fully-encrypted, botnet system called Weasel. A set of signatures are examined and formalized to differentiate the behaviors of Weasel and normal web applications. Through these signatures, we apply a set of data mining techniques to detect the web based botnet behaviors on a web application community formed on a campus backbone network. The proposed approach was evaluated with over 400 thousand flows collected over seven consecutive days on a large scale network and results show the proposed approach successfully detects the botnet flows with a high detection rate and an acceptably low false alarm rate.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121755306","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}
Content-Centric Networking has recently emerged as a clean slate approach to rethink Internet foundations, which changes from host-centric communication model to content-centric model. However, one of the major challenges is supporting intelligent forwarding of Interests over multiple paths while keeping scalability and mobility. To address this challenge, this paper proposed an domain-based intelligent forwarding method based on our previous work. We divided the network into multiple domains. We adopted the ISP-based aggregation to reduce the content naming space and used a domain-based Greedy Ant Colony Forwarding (GACF) algorithm to support intelligent forwarding of packets. There are two kinds of ants in GACF which take different policies in the Inter-domain Forwarding and the Intra-domain Forwarding. The GACF algorithm is a Quality of Service aware forwarding algorithm in the dynamic complex network. The results of the evaluation prove that our proposals improve the cost-efficiency and scalability for content-centric networking.
{"title":"Ant Colony Based Forwarding Method for Content-Centric Networking","authors":"Chengming Li, K. Okamura, Wenjing Liu","doi":"10.1109/WAINA.2013.35","DOIUrl":"https://doi.org/10.1109/WAINA.2013.35","url":null,"abstract":"Content-Centric Networking has recently emerged as a clean slate approach to rethink Internet foundations, which changes from host-centric communication model to content-centric model. However, one of the major challenges is supporting intelligent forwarding of Interests over multiple paths while keeping scalability and mobility. To address this challenge, this paper proposed an domain-based intelligent forwarding method based on our previous work. We divided the network into multiple domains. We adopted the ISP-based aggregation to reduce the content naming space and used a domain-based Greedy Ant Colony Forwarding (GACF) algorithm to support intelligent forwarding of packets. There are two kinds of ants in GACF which take different policies in the Inter-domain Forwarding and the Intra-domain Forwarding. The GACF algorithm is a Quality of Service aware forwarding algorithm in the dynamic complex network. The results of the evaluation prove that our proposals improve the cost-efficiency and scalability for content-centric networking.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128119858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider a way as a grid computing platform in keeping with green IT. A grid computing platform can create a high performance environment consisting of ordinary computing devices. However, it has continuous energy requirements. This is undesirable in terms of environmental concerns, because of the increased CO2 emissions from generating the required electricity. Therefore, this study aimed at realizing a grid computing platform powered by solar power and low consumption electricity computation device to overcome the disadvantage. In this paper, in order to provide a movable system, we consider the steps to apply a handheld device using the ARM processor.
{"title":"Proposal of Solar Powered Grid Computing with Reuse Handheld Devices","authors":"M. Yamagiwa, Katsuyoshi Matsumoto, M. Uehara","doi":"10.1109/WAINA.2013.192","DOIUrl":"https://doi.org/10.1109/WAINA.2013.192","url":null,"abstract":"We consider a way as a grid computing platform in keeping with green IT. A grid computing platform can create a high performance environment consisting of ordinary computing devices. However, it has continuous energy requirements. This is undesirable in terms of environmental concerns, because of the increased CO2 emissions from generating the required electricity. Therefore, this study aimed at realizing a grid computing platform powered by solar power and low consumption electricity computation device to overcome the disadvantage. In this paper, in order to provide a movable system, we consider the steps to apply a handheld device using the ARM processor.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132579067","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}
Junhui Wang, Gang Han, Baoliang Li, Jia Lu, Wenhua Dou
Now energy efficiency is becoming the most critical design facet for the scaling of Network-on-Chip (NoC). Different with electronic network, photonic Network-on-Chip offers natural solutions to reduce energy consumption. In this paper, we propose an energy-efficient photonic Network-on-Chip with central controller (CPNoC). Our proposed on-chip network utilizes a hybrid architecture, comprised of an optical transmission network and an electronic control network. The most important feature of our proposed network is that electronic network uses just one central controller to process and forward control messages. Thus these control messages will not suffer from high hop count to reach destination node. Central controller holds a photonic switching element (PSE) state table and controls all PSEs' switch on/off. When a new control message arrives, it sets up or tears down an optical link quickly, according to the information carried by the message. Finally, we evaluate and compare the energy efficiency and average transmission latency for 16-/64-core electronic NoC, photonic mesh NoC and CPNoC under various packet sizes. The results show that on average our proposed network can reduce at least half of network energy consumption, while keeping lower transmission latency.
{"title":"CPNoC: An Energy-Efficient Photonic Network-on-Chip","authors":"Junhui Wang, Gang Han, Baoliang Li, Jia Lu, Wenhua Dou","doi":"10.1109/WAINA.2013.34","DOIUrl":"https://doi.org/10.1109/WAINA.2013.34","url":null,"abstract":"Now energy efficiency is becoming the most critical design facet for the scaling of Network-on-Chip (NoC). Different with electronic network, photonic Network-on-Chip offers natural solutions to reduce energy consumption. In this paper, we propose an energy-efficient photonic Network-on-Chip with central controller (CPNoC). Our proposed on-chip network utilizes a hybrid architecture, comprised of an optical transmission network and an electronic control network. The most important feature of our proposed network is that electronic network uses just one central controller to process and forward control messages. Thus these control messages will not suffer from high hop count to reach destination node. Central controller holds a photonic switching element (PSE) state table and controls all PSEs' switch on/off. When a new control message arrives, it sets up or tears down an optical link quickly, according to the information carried by the message. Finally, we evaluate and compare the energy efficiency and average transmission latency for 16-/64-core electronic NoC, photonic mesh NoC and CPNoC under various packet sizes. The results show that on average our proposed network can reduce at least half of network energy consumption, while keeping lower transmission latency.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132669368","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}
Doppler shifts and channel induced fading effects are more likely to induce inter carrier interference (ICI), which is the challenging research area in the orthogonal frequency division multiplexing (OFDM). This paper uses channel estimation for canceling the effect of ICI from the received signal. One dimensional frequency domain comb-type channel estimation is considered because of its low computational complexity and effective tracking ability of the fast fading channel. The channel at pilot subcarriers is estimated by using zero forcing (ZF) estimator. In this paper an improved and computationally efficient interpolation technique is proposed for the estimation of channel impulse response at the data subcarriers. Simulation results reveal that the proposed interpolation technique outperforms other one dimensional interpolation techniques. Errors induced by the channel results in degradation of the BER performance. Turbo codes have been used in addition to ZF estimator for further improving BER performance of the OFDM system. Log maximum a posteriori (Log-MAP) decoding algorithm is used for the component decoders in the iterative turbo decoder. Rayleigh fading channel in the presence of AWGN is used to evaluate the performance of the proposed OFDM system.
{"title":"Comparison of Three Interpolation Techniques in Comb-Type Pilot-Assisted Channel Coded OFDM System","authors":"L. U. Khan, Z. Sabir, S. Mahmud, G. M. Khan","doi":"10.1109/WAINA.2013.213","DOIUrl":"https://doi.org/10.1109/WAINA.2013.213","url":null,"abstract":"Doppler shifts and channel induced fading effects are more likely to induce inter carrier interference (ICI), which is the challenging research area in the orthogonal frequency division multiplexing (OFDM). This paper uses channel estimation for canceling the effect of ICI from the received signal. One dimensional frequency domain comb-type channel estimation is considered because of its low computational complexity and effective tracking ability of the fast fading channel. The channel at pilot subcarriers is estimated by using zero forcing (ZF) estimator. In this paper an improved and computationally efficient interpolation technique is proposed for the estimation of channel impulse response at the data subcarriers. Simulation results reveal that the proposed interpolation technique outperforms other one dimensional interpolation techniques. Errors induced by the channel results in degradation of the BER performance. Turbo codes have been used in addition to ZF estimator for further improving BER performance of the OFDM system. Log maximum a posteriori (Log-MAP) decoding algorithm is used for the component decoders in the iterative turbo decoder. Rayleigh fading channel in the presence of AWGN is used to evaluate the performance of the proposed OFDM system.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133522892","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}
The biological information coming from electro-physiologic signal sensors like ECG or molecular signal devices like mass spectrometry has to be compressed for an efficient medical use by clinicians or to retain only the pertinent explanatory information about the mechanisms at the origin of the recorded signal for the researchers in life sciences. When the signal is periodic in time and/or space, classical compression processes like Fourier and wavelets transforms give good results concerning the compression rate, but bring in general no supplementary information about the interactions between elements of the living system producing the studied signal. Here, we define a new transform called dynalet based on Liénard differential equations susceptible to model the mechanism that is the source of the signal and we propose to apply this new technique to real signals like ECG, pulse activity and protein spectra in mass spectrometry.
{"title":"Dynalets: A New Representation of Periodic Biological Signals and Spectral Data","authors":"J. Demongeot, A. Hamie, A. Glaria, C. Taramasco","doi":"10.1109/WAINA.2013.174","DOIUrl":"https://doi.org/10.1109/WAINA.2013.174","url":null,"abstract":"The biological information coming from electro-physiologic signal sensors like ECG or molecular signal devices like mass spectrometry has to be compressed for an efficient medical use by clinicians or to retain only the pertinent explanatory information about the mechanisms at the origin of the recorded signal for the researchers in life sciences. When the signal is periodic in time and/or space, classical compression processes like Fourier and wavelets transforms give good results concerning the compression rate, but bring in general no supplementary information about the interactions between elements of the living system producing the studied signal. Here, we define a new transform called dynalet based on Liénard differential equations susceptible to model the mechanism that is the source of the signal and we propose to apply this new technique to real signals like ECG, pulse activity and protein spectra in mass spectrometry.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133643891","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
扫码关注我们
求助内容：
应助结果提醒方式：