Pub Date : 2011-03-20DOI: 10.1109/ISCI.2011.5958946
H. Oztekin, Feyzullah Temurtaş, A. Gulbag
The Computer Architecture and Organization course in Computer and Electrical Engineering departments faces with a big problem: the migration from theory to practice. In order to solve this problem, a Computer Architecture simulator named BZK.SAU[1] is designed using an emulator program for educational purpose. This approach has important limitations. While students can complete and simulate their designs using software, they do not have the chance to implement and to run their designs in actual hardware. This work presents our solution to this problem: the FPGA implementation of BZK.SAU so that it would look and behave like the computer architecture simulator published in [1]. So we have implemented BZK.SAU Computer Architecture Simulator by using Altera® FPGA board that is a reconfigurable hardware prototyping development platform.
{"title":"BZK.SAU.FPGA10.0: Microprocessor architecture design on reconfigurable hardware as an educational tool","authors":"H. Oztekin, Feyzullah Temurtaş, A. Gulbag","doi":"10.1109/ISCI.2011.5958946","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958946","url":null,"abstract":"The Computer Architecture and Organization course in Computer and Electrical Engineering departments faces with a big problem: the migration from theory to practice. In order to solve this problem, a Computer Architecture simulator named BZK.SAU[1] is designed using an emulator program for educational purpose. This approach has important limitations. While students can complete and simulate their designs using software, they do not have the chance to implement and to run their designs in actual hardware. This work presents our solution to this problem: the FPGA implementation of BZK.SAU so that it would look and behave like the computer architecture simulator published in [1]. So we have implemented BZK.SAU Computer Architecture Simulator by using Altera® FPGA board that is a reconfigurable hardware prototyping development platform.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621450","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958935
V. Sklyarov, I. Skliarova, D. Mihhailov, A. Sudnitson
The paper describes the hardware implementation and optimization of algorithms that sort data using tree-like structures combined with sorting networks. The emphasis is done on applications that require dynamic resorting for new incoming data items. Experiments and comparisons demonstrate that the performance is increased compared to other known implementations.
{"title":"Processing tree-like data structures for sorting and managing priorities","authors":"V. Sklyarov, I. Skliarova, D. Mihhailov, A. Sudnitson","doi":"10.1109/ISCI.2011.5958935","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958935","url":null,"abstract":"The paper describes the hardware implementation and optimization of algorithms that sort data using tree-like structures combined with sorting networks. The emphasis is done on applications that require dynamic resorting for new incoming data items. Experiments and comparisons demonstrate that the performance is increased compared to other known implementations.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"97 6 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116684623","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958909
R. A. Hamzah, M. S. Hamid, H. N. Rosly, N. M. Z. Hashim
This paper presents an analysis of multiple size region of interest in selected area or segment of disparity mapping in application of stereo vision. The mapping is about to deal with the intensities of pixels which allocate the depths of an image and can be extracted to get the distance values. This region is a reference view of the stereo camera and stereo vision baseline is based on horizontal configuration. The block matching technique is briefly described with the performance of its output. The disparity mapping is generated by the algorithm with the reference to the left image coordinate. The algorithm uses Sum of Absolute Differences (SAD) which is developed using Matlab software. The rectification and block matching processes are also briefly described in this paper.
本文对立体视觉视差映射中所选区域或区段的多尺度感兴趣区域进行了分析。映射处理的是像素的强度，像素的强度分配了图像的深度，可以提取得到距离值。该区域是立体摄像机的参考视图，立体视觉基线是基于水平配置的。简要介绍了块匹配技术及其输出性能。该算法以左侧图像坐标为参照，生成视差映射。该算法采用绝对差和算法(Sum of Absolute difference, SAD)，该算法是用Matlab软件开发的。本文还简要介绍了整流和块匹配过程。
{"title":"An analysis of multiple size region of interest in disparity mapping for stereo vision application","authors":"R. A. Hamzah, M. S. Hamid, H. N. Rosly, N. M. Z. Hashim","doi":"10.1109/ISCI.2011.5958909","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958909","url":null,"abstract":"This paper presents an analysis of multiple size region of interest in selected area or segment of disparity mapping in application of stereo vision. The mapping is about to deal with the intensities of pixels which allocate the depths of an image and can be extracted to get the distance values. This region is a reference view of the stereo camera and stereo vision baseline is based on horizontal configuration. The block matching technique is briefly described with the performance of its output. The disparity mapping is generated by the algorithm with the reference to the left image coordinate. The algorithm uses Sum of Absolute Differences (SAD) which is developed using Matlab software. The rectification and block matching processes are also briefly described in this paper.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363249","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958875
D. Yap, S. P. Koh, S. Tiong
Artificial immune system (AIS) is one of the nature-inspired algorithm for optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be further improved because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. Thus, a hybrid PSO-AIS and a new external memory CSA based scheme called EMCSA are proposed. In hybrid PSO-AIS, the good features of PSO and AIS are combined in order to reduce any limitation. Alternatively, EMCSA captures all the best antibodies into the memory in order to enhance global searching capability. In this preliminary study, the results show that the performance of hybrid PSO-AIS compares favourably with other algorithms while EMCSA produced moderate results in most of the simulations.
{"title":"Artificial immune system based on hybrid and external memory for mathematical function optimization","authors":"D. Yap, S. P. Koh, S. Tiong","doi":"10.1109/ISCI.2011.5958875","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958875","url":null,"abstract":"Artificial immune system (AIS) is one of the nature-inspired algorithm for optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be further improved because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. Thus, a hybrid PSO-AIS and a new external memory CSA based scheme called EMCSA are proposed. In hybrid PSO-AIS, the good features of PSO and AIS are combined in order to reduce any limitation. Alternatively, EMCSA captures all the best antibodies into the memory in order to enhance global searching capability. In this preliminary study, the results show that the performance of hybrid PSO-AIS compares favourably with other algorithms while EMCSA produced moderate results in most of the simulations.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"16 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125992494","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958963
R. Akbar, M. Hassan, Azrai Abdullah, S. Safdar, M. Qureshi
Since years software development industry is trying hard to show a remarkable performance in its project development work. Issues related to the software processes improvement, risk management, people's factors and effective project management still exist. Though academic researchers have produced good quality work on software industry issues, but unluckily, software industry could not get benefit of it as was being expected. Software engineering research work also seems unable to identify and understand the real industry problems and providing hands on solutions. The gap between researchers and actual industry practitioners is the sole reason behind it. It is the foremost need to learn from the academic research work and experiences of real software development industry practitioners. The objective of this study is to bridge this gap by highlighting the root causes of differences between software engineering research works and actual industry practices. An analysis of real industry projects, academic projects, research publications, and industry people is made to complete this research work. The outcome of this research is twofold. First, the identification of factors behind the academic-industry gap; second, presenting a set of measures to bridge this gap to produce actual industry based research works.
{"title":"An insight into real software industry paradigms and software engineering research","authors":"R. Akbar, M. Hassan, Azrai Abdullah, S. Safdar, M. Qureshi","doi":"10.1109/ISCI.2011.5958963","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958963","url":null,"abstract":"Since years software development industry is trying hard to show a remarkable performance in its project development work. Issues related to the software processes improvement, risk management, people's factors and effective project management still exist. Though academic researchers have produced good quality work on software industry issues, but unluckily, software industry could not get benefit of it as was being expected. Software engineering research work also seems unable to identify and understand the real industry problems and providing hands on solutions. The gap between researchers and actual industry practitioners is the sole reason behind it. It is the foremost need to learn from the academic research work and experiences of real software development industry practitioners. The objective of this study is to bridge this gap by highlighting the root causes of differences between software engineering research works and actual industry practices. An analysis of real industry projects, academic projects, research publications, and industry people is made to complete this research work. The outcome of this research is twofold. First, the identification of factors behind the academic-industry gap; second, presenting a set of measures to bridge this gap to produce actual industry based research works.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118039","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5959009
S. Kalwar, K. Heikkinen, J. Porras
The Internet has recently emerged with new kind of services, applications and countless contents. User reaction plays essential role in interacting with the Internet. The theoretical concepts on feelings are extracted from psychology, phenomenology and computer science. It is understood that feelings are subjective experience of users aroused from different emotions. As feelings changes based on time, circumstance, people and environment, it is extremely difficult to assess feelings objectively. User's interaction on the Internet is based on contents (text, audio and video materials) and context (past experience, surroundings, circumstances, environment, background, or settings). Thus, the potential of understanding feelings and its measure is very important. In this paper, a systematic measure of feelcalc module is introduced to measure user's reaction in order to reduce human anxiety on the Internet.
{"title":"Measuring user reaction to reduce Internet anxiety","authors":"S. Kalwar, K. Heikkinen, J. Porras","doi":"10.1109/ISCI.2011.5959009","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5959009","url":null,"abstract":"The Internet has recently emerged with new kind of services, applications and countless contents. User reaction plays essential role in interacting with the Internet. The theoretical concepts on feelings are extracted from psychology, phenomenology and computer science. It is understood that feelings are subjective experience of users aroused from different emotions. As feelings changes based on time, circumstance, people and environment, it is extremely difficult to assess feelings objectively. User's interaction on the Internet is based on contents (text, audio and video materials) and context (past experience, surroundings, circumstances, environment, background, or settings). Thus, the potential of understanding feelings and its measure is very important. In this paper, a systematic measure of feelcalc module is introduced to measure user's reaction in order to reduce human anxiety on the Internet.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126562798","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958943
T. Ali, Asad I. Khan, M. Nauman
Mobile ad-hoc applications create a link with other applications in an ad-hoc manner. Resources may be released to the peer applications. Access and usage control is an important requirement while sharing resources with peer application. Currently there is no controlling framework for the usage of shared resources in mobile ad-hoc applications. In this paper we introduce the notion of a usage control in mobile ad hoc application scenarios that manages the usage of individual objects registered with it. Whenever a node joins the ad-hoc network, it may share and use one or more objects while being part of the ad-hoc application domain. While releasing resources to UCAS it attaches the policy along with the resource. This policy may describe the number of total usages, the number of individual usages, location and timings etc. We have proposed a framework with the XML based policy for usage control of the shared resources. We show that our design effectively enforces usage control in the highly dynamic mobile ad hoc applications network.
{"title":"Usage control framework for mobile ad-hoc applications","authors":"T. Ali, Asad I. Khan, M. Nauman","doi":"10.1109/ISCI.2011.5958943","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958943","url":null,"abstract":"Mobile ad-hoc applications create a link with other applications in an ad-hoc manner. Resources may be released to the peer applications. Access and usage control is an important requirement while sharing resources with peer application. Currently there is no controlling framework for the usage of shared resources in mobile ad-hoc applications. In this paper we introduce the notion of a usage control in mobile ad hoc application scenarios that manages the usage of individual objects registered with it. Whenever a node joins the ad-hoc network, it may share and use one or more objects while being part of the ad-hoc application domain. While releasing resources to UCAS it attaches the policy along with the resource. This policy may describe the number of total usages, the number of individual usages, location and timings etc. We have proposed a framework with the XML based policy for usage control of the shared resources. We show that our design effectively enforces usage control in the highly dynamic mobile ad hoc applications network.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122362125","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958941
S. Jayaprakasam, T. Chuah, Su-Wei Tan
A new medium access control (MAC) scheme to enable collaborative transmit beamforming in IEEE 802.11 based wireless networks is proposed. The proposed scheme allows information sharing and simultaneous transmission in collaborative transmit beamforming, and is compatible with the existing distributed coordination function protocol. Performance comparisons with multi-hop and direct communications of the IEEE 802.11g wireless standard employing carrier sense multiple access with collision avoidance MAC are made. Results show that the proposed approach provides better throughput when greater distances or more hops are needed to complete communications, especially in a noisy environment.
{"title":"Medium access control for collaborative transmit beamforming in wireless networks","authors":"S. Jayaprakasam, T. Chuah, Su-Wei Tan","doi":"10.1109/ISCI.2011.5958941","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958941","url":null,"abstract":"A new medium access control (MAC) scheme to enable collaborative transmit beamforming in IEEE 802.11 based wireless networks is proposed. The proposed scheme allows information sharing and simultaneous transmission in collaborative transmit beamforming, and is compatible with the existing distributed coordination function protocol. Performance comparisons with multi-hop and direct communications of the IEEE 802.11g wireless standard employing carrier sense multiple access with collision avoidance MAC are made. Results show that the proposed approach provides better throughput when greater distances or more hops are needed to complete communications, especially in a noisy environment.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128147234","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958893
Pooia Lalbakhsh, M. S. K. Fasaei, M. Fesharaki
In this paper an improved version of Ant-Miner algorithm is introduced and compared to the previously proposed ant-based rule mining algorithms. Our algorithm modifies the rule pruning process and introduces a dynamic pheromone evaporation strategy. The algorithm was run on five standard datasets and the average accuracy rate and numbers of discovered rules were analyzed as two important performance metrics of rule mining. As simulation results show, not only the accuracy rate and rule comprehensiveness is improved by our algorithm, the algorithm runtime is also reduced.
{"title":"Focusing on rule quality and pheromone evaporation to improve ACO rule mining","authors":"Pooia Lalbakhsh, M. S. K. Fasaei, M. Fesharaki","doi":"10.1109/ISCI.2011.5958893","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958893","url":null,"abstract":"In this paper an improved version of Ant-Miner algorithm is introduced and compared to the previously proposed ant-based rule mining algorithms. Our algorithm modifies the rule pruning process and introduces a dynamic pheromone evaporation strategy. The algorithm was run on five standard datasets and the average accuracy rate and numbers of discovered rules were analyzed as two important performance metrics of rule mining. As simulation results show, not only the accuracy rate and rule comprehensiveness is improved by our algorithm, the algorithm runtime is also reduced.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"447 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126995086","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958936
Tsung-Sheng Lai, Chin-Hung Peng, F. Lai
Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm — local grouping (LG) — to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].
{"title":"Data driven approach for low-power pre-computation-based content addressable memory","authors":"Tsung-Sheng Lai, Chin-Hung Peng, F. Lai","doi":"10.1109/ISCI.2011.5958936","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958936","url":null,"abstract":"Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm — local grouping (LG) — to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127197475","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
扫码关注我们
求助内容：
应助结果提醒方式：