Pub Date : 2015-11-30DOI: 10.1109/PACRIM.2015.7334870
Sajida Imran, Özgür Erçetin, Young-Bae Ko
To track and detect continuous natured objects in wireless sensor networks, large number of sensor nodes are involved. These continuous objects like bio-chemical diffusions, forest fires, oil spills usually spread over larger area. Phenomena sensing nodes need to communicate with each other for information exchange and also send sensing information to sink, possibly by passing through many intermediate nodes. The process consumes a lot of communication overhead and waste of sensors scarce energy. In this paper, we proposed an optimized approach to reduce number of communications and report data size to the sink. Sensors locally broadcast their sensing status to one-hop neighbors, and suppress any transmission that contains any trivial data. Intermediate nodes further suppress the report data by applying data aggregation and filtering. Simulation results show a significant decrease in number of communications and report data size.
{"title":"Continuous phenomena boundary detection and tracking in wireless sensor networks through optimized monitoring","authors":"Sajida Imran, Özgür Erçetin, Young-Bae Ko","doi":"10.1109/PACRIM.2015.7334870","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334870","url":null,"abstract":"To track and detect continuous natured objects in wireless sensor networks, large number of sensor nodes are involved. These continuous objects like bio-chemical diffusions, forest fires, oil spills usually spread over larger area. Phenomena sensing nodes need to communicate with each other for information exchange and also send sensing information to sink, possibly by passing through many intermediate nodes. The process consumes a lot of communication overhead and waste of sensors scarce energy. In this paper, we proposed an optimized approach to reduce number of communications and report data size to the sink. Sensors locally broadcast their sensing status to one-hop neighbors, and suppress any transmission that contains any trivial data. Intermediate nodes further suppress the report data by applying data aggregation and filtering. Simulation results show a significant decrease in number of communications and report data size.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122480973","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334885
J. D. Jacoby, Melanie Tory, J. Tanaka
Neurofeedback paradigms are of increasing interest, both for brain-computer interfaces and for training purposes. In the current study we examine multi-session training in a P3 speller application which uses P300 evoked response potentials to identify the letter of a word a participant is attempting to spell. Because neurofeedback training is most effective over time, there is an advantage to using low-cost hardware that can be used in the home rather than expensive research-grade equipment. This study is performed on an Emotiv Epoc EEG headset and some of the problems and workarounds inherent in this are discussed. This headset is sensitive enough to detect evoked response potentials and evidence of a training effect is found. Motivational aspects of ERP training are discussed and an alternate P300 training paradigm is presented.
{"title":"Evoked response potential training on a consumer EEG headset","authors":"J. D. Jacoby, Melanie Tory, J. Tanaka","doi":"10.1109/PACRIM.2015.7334885","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334885","url":null,"abstract":"Neurofeedback paradigms are of increasing interest, both for brain-computer interfaces and for training purposes. In the current study we examine multi-session training in a P3 speller application which uses P300 evoked response potentials to identify the letter of a word a participant is attempting to spell. Because neurofeedback training is most effective over time, there is an advantage to using low-cost hardware that can be used in the home rather than expensive research-grade equipment. This study is performed on an Emotiv Epoc EEG headset and some of the problems and workarounds inherent in this are discussed. This headset is sensitive enough to detect evoked response potentials and evidence of a training effect is found. Motivational aspects of ERP training are discussed and an alternate P300 training paradigm is presented.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127606141","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 coupling of microwaves into apertures plays an important part in many electromagnetic physics and engineering fields. When the width of apertures is very small, Finite Difference Time Domain (FDTD) simulation of the coupling is very time-consuming. As a many-core architecture, the Intel's Many Integrated Core (MIC) architecture owns 512-bit vector units and more than 200 threads. In this paper, we parallelize FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture. In the implementation, the parallel programming model OpenMP is used to exploit thread parallelism while loop unrolling and SIMD intrinsic functions are utilized to accomplish vectorization. Compared with the serial version on Intel Xeon E5-2670 CPU, the implementation on the MIC coprocessor including 57 cores obtains a speedup of 11.57 times. The experiment results also demonstrate that the parallelization has good scalability in performance. Additionally, how binding relationship between OpenMP threads and hardware threads in MIC influences performance is also reported.
{"title":"Accelerating FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture","authors":"Qinglin Wang, Jie Liu, Xiantao Cui, Guitao Fu, Chunye Gong, Zuocheng Xing","doi":"10.1109/PACRIM.2015.7334845","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334845","url":null,"abstract":"The coupling of microwaves into apertures plays an important part in many electromagnetic physics and engineering fields. When the width of apertures is very small, Finite Difference Time Domain (FDTD) simulation of the coupling is very time-consuming. As a many-core architecture, the Intel's Many Integrated Core (MIC) architecture owns 512-bit vector units and more than 200 threads. In this paper, we parallelize FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture. In the implementation, the parallel programming model OpenMP is used to exploit thread parallelism while loop unrolling and SIMD intrinsic functions are utilized to accomplish vectorization. Compared with the serial version on Intel Xeon E5-2670 CPU, the implementation on the MIC coprocessor including 57 cores obtains a speedup of 11.57 times. The experiment results also demonstrate that the parallelization has good scalability in performance. Additionally, how binding relationship between OpenMP threads and hardware threads in MIC influences performance is also reported.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127733831","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334836
Yukihiro Kunishige, K. Baba, S. Shimojo
In recent years, data centers have been required to manage ever-increasing amounts of data resulting from the explosive growth of data-intensive Internet services. Data centers must provide high performance while minimizing energy consumption. To achieve these objectives, optical network technology can be implemented in data center networks. Optical networks in large-scale data centers must be configured to transmit large amounts of data with minimal latency. In this paper, we propose data center network configurations that are designed to reduce end-to-end latency. We configure two data center optical networks by splitting switches into groups and subgroups. Full mesh networks are used to connect groups and subgroups, and to implement connections within subgroups. Based on evaluations conducted using simulations, the proposed networks show high performance against Torus networks, and show low configuration costs against FatTree networks.
{"title":"Optical network configuration methods considering end-to-end latency in data centers","authors":"Yukihiro Kunishige, K. Baba, S. Shimojo","doi":"10.1109/PACRIM.2015.7334836","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334836","url":null,"abstract":"In recent years, data centers have been required to manage ever-increasing amounts of data resulting from the explosive growth of data-intensive Internet services. Data centers must provide high performance while minimizing energy consumption. To achieve these objectives, optical network technology can be implemented in data center networks. Optical networks in large-scale data centers must be configured to transmit large amounts of data with minimal latency. In this paper, we propose data center network configurations that are designed to reduce end-to-end latency. We configure two data center optical networks by splitting switches into groups and subgroups. Full mesh networks are used to connect groups and subgroups, and to implement connections within subgroups. Based on evaluations conducted using simulations, the proposed networks show high performance against Torus networks, and show low configuration costs against FatTree networks.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126514807","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334801
Fumito Konaka, T. Miura
In this investigation, we introduce new kinds of sentence similarity, called Euclid similarity and Levenshtein similarity, to capture both word sequences and semantic aspects. This is especially useful for Semantic Textual Similarity (STS) so that we could retrieve SNS texts, short sentences or something including collocations. We show the usefulness of our approach by some experimental results.
{"title":"Semantic similarity for sequenced shingles","authors":"Fumito Konaka, T. Miura","doi":"10.1109/PACRIM.2015.7334801","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334801","url":null,"abstract":"In this investigation, we introduce new kinds of sentence similarity, called Euclid similarity and Levenshtein similarity, to capture both word sequences and semantic aspects. This is especially useful for Semantic Textual Similarity (STS) so that we could retrieve SNS texts, short sentences or something including collocations. We show the usefulness of our approach by some experimental results.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131215904","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334805
Naoya Okumura, T. Miura
Recently cloud systems have been spread widely through internet so that we can get to huge amount of complex information (mainly in text) easily and quickly. However we can hardly catch up with the changes inside since we should go through them and see quickly what's going on. This is why automatic labelling is indispensable. In this work, assuming concept hierarchy, we extract suitable labels for documents by abstracting and ranking characteristic words.
{"title":"Automatic labelling of documents based on ontology","authors":"Naoya Okumura, T. Miura","doi":"10.1109/PACRIM.2015.7334805","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334805","url":null,"abstract":"Recently cloud systems have been spread widely through internet so that we can get to huge amount of complex information (mainly in text) easily and quickly. However we can hardly catch up with the changes inside since we should go through them and see quickly what's going on. This is why automatic labelling is indispensable. In this work, assuming concept hierarchy, we extract suitable labels for documents by abstracting and ranking characteristic words.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124393379","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334855
Sol Lim, Sung-Hoon Kim, I. Hwang, So Yeon Kim, Hui-Yong Kim, Daejin Kim
In August 2014, ATSC adapted 3DTV standard which is service compatible 3DTV using main and mobile hybrid delivery (SC-MMH), and the 3DTV standard uses the ATSC M/H transmission system. Because the M/H system transmits both main and mobile training sequences for equalization, ATSC 3DTV reception performance can be improved by using both training sequences. This paper introduces the LMS-DFE and proposes an equalizer concatenated with channel estimation. And the computer simulations were performed on Rician channel of K = 0 dB and Rayleigh channel in order to evaluate the performance of both equalizers. Simulation result shows that the proposed equalizer works well on both channels within the time of a half VSB frame.
{"title":"An equalization technique concatenated with channel estimation for ATSC 3DTV receivers","authors":"Sol Lim, Sung-Hoon Kim, I. Hwang, So Yeon Kim, Hui-Yong Kim, Daejin Kim","doi":"10.1109/PACRIM.2015.7334855","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334855","url":null,"abstract":"In August 2014, ATSC adapted 3DTV standard which is service compatible 3DTV using main and mobile hybrid delivery (SC-MMH), and the 3DTV standard uses the ATSC M/H transmission system. Because the M/H system transmits both main and mobile training sequences for equalization, ATSC 3DTV reception performance can be improved by using both training sequences. This paper introduces the LMS-DFE and proposes an equalizer concatenated with channel estimation. And the computer simulations were performed on Rician channel of K = 0 dB and Rayleigh channel in order to evaluate the performance of both equalizers. Simulation result shows that the proposed equalizer works well on both channels within the time of a half VSB frame.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128315705","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334857
Takeo Hidaka, Daiki Nobayashi, Y. Fukuda, K. Tsukamoto, T. Ikenaga
Wireless sensor and actuator networks (WSANs) are expected to be come fundamental technologies supporting machine-to-machine (M2M) communication and the internet of things (IoT). However, wireless sensors face inherent limitations because they must provide high demand response (DR) despite severely limited battery power. In an effort to achieve both power-saving characteristics in addition to high DR, we are working on research and development of radio-on-demand sensor and actuator networks (ROD-SANs), in which each node is equipped with a wake-up receiver that allows all nodes to stay in sleep mode most of the time, and transmit only after a wake-up signal is received. Since the wake-up signal can also include channel information, the sender nodes can direct the receiver nodes to switch communication channels when needed. However, as the number of nodes using the same channel increases, packet collisions occur more frequently, thereby degrading response performance. On the other hand, frequent channel switching inevitably increases channel switching delays. To simultaneously reduce both packet collisions and channel switching delays, we have extended the average-channel-utilization-based channel switching (ACS) scheme, discussed in our previous work on single-hop communication in a way that allows it to provide efficient performance in multi-hop communication. In this paper, based on simulations, we show how our scheme can improve the delivery ratio performance by approximately 20%.
{"title":"Performance evaluation of multi-hop communication with a dynamic channel switching scheme in ROD-SAN","authors":"Takeo Hidaka, Daiki Nobayashi, Y. Fukuda, K. Tsukamoto, T. Ikenaga","doi":"10.1109/PACRIM.2015.7334857","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334857","url":null,"abstract":"Wireless sensor and actuator networks (WSANs) are expected to be come fundamental technologies supporting machine-to-machine (M2M) communication and the internet of things (IoT). However, wireless sensors face inherent limitations because they must provide high demand response (DR) despite severely limited battery power. In an effort to achieve both power-saving characteristics in addition to high DR, we are working on research and development of radio-on-demand sensor and actuator networks (ROD-SANs), in which each node is equipped with a wake-up receiver that allows all nodes to stay in sleep mode most of the time, and transmit only after a wake-up signal is received. Since the wake-up signal can also include channel information, the sender nodes can direct the receiver nodes to switch communication channels when needed. However, as the number of nodes using the same channel increases, packet collisions occur more frequently, thereby degrading response performance. On the other hand, frequent channel switching inevitably increases channel switching delays. To simultaneously reduce both packet collisions and channel switching delays, we have extended the average-channel-utilization-based channel switching (ACS) scheme, discussed in our previous work on single-hop communication in a way that allows it to provide efficient performance in multi-hop communication. In this paper, based on simulations, we show how our scheme can improve the delivery ratio performance by approximately 20%.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125624705","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334864
David Johnson, G. Tzanetakis
The main goal of this paper is to explore the recognition of particular guitar models from single instrument audio recordings. This is different than existing work in music instrument recognition that deals with identifying different instrument types. Through a set of experiments we evaluate different sets of audio features and classifiers for this purpose. To improve accuracy a composite classifier is implemented to first discriminate between electric and acoustic guitars. This affords flexibility in training different models for each guitar type. A data set consisting of audio recordings from 15 guitar models, each recorded with a set of different playing configurations, is used for training and testing. We have found that K Nearest Neighbors and Support Vector Machine (SVM) classifiers perform the best. Testing is done by leaving a specific playing configuration out of the training model. Specific test cases show satisfactory results, with one test case achieving over 70% accuracy and a second one over 50%; both using a composite SVM model.
{"title":"Guitar model recognition from single instrument audio recordings","authors":"David Johnson, G. Tzanetakis","doi":"10.1109/PACRIM.2015.7334864","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334864","url":null,"abstract":"The main goal of this paper is to explore the recognition of particular guitar models from single instrument audio recordings. This is different than existing work in music instrument recognition that deals with identifying different instrument types. Through a set of experiments we evaluate different sets of audio features and classifiers for this purpose. To improve accuracy a composite classifier is implemented to first discriminate between electric and acoustic guitars. This affords flexibility in training different models for each guitar type. A data set consisting of audio recordings from 15 guitar models, each recorded with a set of different playing configurations, is used for training and testing. We have found that K Nearest Neighbors and Support Vector Machine (SVM) classifiers perform the best. Testing is done by leaving a specific playing configuration out of the training model. Specific test cases show satisfactory results, with one test case achieving over 70% accuracy and a second one over 50%; both using a composite SVM model.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133531095","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 : 2015-11-30DOI: 10.1109/PACRIM.2015.7334813
Abdulmajeed Alghamdi, F. Gebali
This paper introduces performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles. We evaluate conventional carry lookahead adder (CLA) and hierarchical carry lookahead adder (HCLA) using different parameters. Our design is targeted into FPGA Virtex 7 family. Area, delay, and area-delay product of all design choices are reported. In the experimental results, we reduced CLA delay and area using radix-2 which performed better than traditionally used radix-4 CLA. In addition, we showed that CLA using conventional structure has better performance than the hierarchical structure.
{"title":"Performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles","authors":"Abdulmajeed Alghamdi, F. Gebali","doi":"10.1109/PACRIM.2015.7334813","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334813","url":null,"abstract":"This paper introduces performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles. We evaluate conventional carry lookahead adder (CLA) and hierarchical carry lookahead adder (HCLA) using different parameters. Our design is targeted into FPGA Virtex 7 family. Area, delay, and area-delay product of all design choices are reported. In the experimental results, we reduced CLA delay and area using radix-2 which performed better than traditionally used radix-4 CLA. In addition, we showed that CLA using conventional structure has better performance than the hierarchical structure.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124285","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
扫码关注我们
求助内容：
应助结果提醒方式：