Pub Date : 1998-12-14DOI: 10.1109/ICPADS.1998.741099
Sheng-de Wang, Ming-Jer Tsai
We propose an adaptive and deadlock-free routing algorithm to tolerate irregular faulty patterns using two virtual channels per physical link. It can improve the node utilization up to 100%. When a node becomes faulty or recovered, the central control unit constructs a directed path graph which is used for generating the intermediate nodes of the message path. Thus a message can be transmitted from sources or to destinations within faulty blocks via a set of "intermediate nodes". Our method requires the global failure information if the central control unit is not available.
{"title":"Adaptive and fault-tolerant routing with 100% node utilization for mesh multicomputer","authors":"Sheng-de Wang, Ming-Jer Tsai","doi":"10.1109/ICPADS.1998.741099","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741099","url":null,"abstract":"We propose an adaptive and deadlock-free routing algorithm to tolerate irregular faulty patterns using two virtual channels per physical link. It can improve the node utilization up to 100%. When a node becomes faulty or recovered, the central control unit constructs a directed path graph which is used for generating the intermediate nodes of the message path. Thus a message can be transmitted from sources or to destinations within faulty blocks via a set of \"intermediate nodes\". Our method requires the global failure information if the central control unit is not available.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415371","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741051
Gen-Huey Chen, Shien-Ching Hwang, M. Su, Dyi-Rong Duh
A recursive network can be constructed with basic building blocks in a recursive manner. For example the hypercube is a recursive network because an n-dimensional hypercube consists of two (n-1)-dimensional hypercubes. A recursive network is said to be with complete connection if the subnetwork that constitute it are connected as a complete graph. A general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Moreover, no redundant message will be generated. Four networks: WK-recursive networks, hypercomplete networks, hypernet networks, and star networks, are taken as examples to show the effectiveness of the scheme.
{"title":"A general broadcasting scheme for recursive networks with complete connection","authors":"Gen-Huey Chen, Shien-Ching Hwang, M. Su, Dyi-Rong Duh","doi":"10.1109/ICPADS.1998.741051","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741051","url":null,"abstract":"A recursive network can be constructed with basic building blocks in a recursive manner. For example the hypercube is a recursive network because an n-dimensional hypercube consists of two (n-1)-dimensional hypercubes. A recursive network is said to be with complete connection if the subnetwork that constitute it are connected as a complete graph. A general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Moreover, no redundant message will be generated. Four networks: WK-recursive networks, hypercomplete networks, hypernet networks, and star networks, are taken as examples to show the effectiveness of the scheme.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133005098","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741083
Katsuya Tanaka, T. Enokido, H. Higaki, M. Takizawa
Distributed applications are realized by cooperation of objects. A state of the object depends on in what order the object exchanges request and response messages and computes requests. In this paper, we newly define a significantly precedent order of messages based on a conflicting relation among requests. The objects can be mutually consistent if the objects take messages in the significantly precedent order. We discuss a protocol which supports the significantly ordered delivery of request and response messages. Here, an object vector is newly proposed to significantly order messages.
{"title":"Significant message precedence in object-based systems","authors":"Katsuya Tanaka, T. Enokido, H. Higaki, M. Takizawa","doi":"10.1109/ICPADS.1998.741083","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741083","url":null,"abstract":"Distributed applications are realized by cooperation of objects. A state of the object depends on in what order the object exchanges request and response messages and computes requests. In this paper, we newly define a significantly precedent order of messages based on a conflicting relation among requests. The objects can be mutually consistent if the objects take messages in the significantly precedent order. We discuss a protocol which supports the significantly ordered delivery of request and response messages. Here, an object vector is newly proposed to significantly order messages.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130253625","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741172
Jyh-Biau Chang, Y. Tsai, C. Shieh, P. Chung
The purpose of the paper is to demonstrate an efficient thread architecture for a distributed shared memory (DSM) system on symmetric multiprocessor (SMP) clusters. For DSM systems on SMP, how to utilize the processors efficiently without wasting available computational power is a major issue. We discuss three approaches that use the process, the kernel level thread, and the user level thread to map application threads onto execution entities respectively. Considering the advantages and disadvantages of each method, we construct our thread package by combining both the user level thread and the kernel level thread. User level threads correspond to application threads and kernel level threads schedule these user level threads across multiple processors. Threads are light weighted and can be migrated in our thread package. With this thread architecture, our DSM system performs well in elementary experiments.
{"title":"An efficient thread architecture for a distributed shared memory on symmetric multiprocessor clusters","authors":"Jyh-Biau Chang, Y. Tsai, C. Shieh, P. Chung","doi":"10.1109/ICPADS.1998.741172","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741172","url":null,"abstract":"The purpose of the paper is to demonstrate an efficient thread architecture for a distributed shared memory (DSM) system on symmetric multiprocessor (SMP) clusters. For DSM systems on SMP, how to utilize the processors efficiently without wasting available computational power is a major issue. We discuss three approaches that use the process, the kernel level thread, and the user level thread to map application threads onto execution entities respectively. Considering the advantages and disadvantages of each method, we construct our thread package by combining both the user level thread and the kernel level thread. User level threads correspond to application threads and kernel level threads schedule these user level threads across multiple processors. Threads are light weighted and can be migrated in our thread package. With this thread architecture, our DSM system performs well in elementary experiments.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114422626","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741088
T. Shih, A. Y. Chang, Hwei-Jen Lin, Shwu-Huey Yen, Chuan-Feng Chiu
Relations among temporal intervals can be used to model time dependent objects. The extension of temporal relation results in many researches related to the spatio-temporal modeling of distributed objects. We propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are detected and eliminated. The algorithms are extended for time-based media in an arbitrary n-dimensional space. The contributions of these algorithms and the interval algebra system can be used to detect and eliminate time conflicts, to generate the schedule and layout of multimedia presentations, to model interval-based synchronization specifications, to analyze the distributed real-time playout, to denote the semantics of natural language sentence tense, and to capture the temporal semantics among distributed multimedia objects.
{"title":"Interval algebra for spatio-temporal composition of distributed multimedia objects","authors":"T. Shih, A. Y. Chang, Hwei-Jen Lin, Shwu-Huey Yen, Chuan-Feng Chiu","doi":"10.1109/ICPADS.1998.741088","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741088","url":null,"abstract":"Relations among temporal intervals can be used to model time dependent objects. The extension of temporal relation results in many researches related to the spatio-temporal modeling of distributed objects. We propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are detected and eliminated. The algorithms are extended for time-based media in an arbitrary n-dimensional space. The contributions of these algorithms and the interval algebra system can be used to detect and eliminate time conflicts, to generate the schedule and layout of multimedia presentations, to model interval-based synchronization specifications, to analyze the distributed real-time playout, to denote the semantics of natural language sentence tense, and to capture the temporal semantics among distributed multimedia objects.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116170291","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741089
Chien I. Lee, Ye-In Chang, Wei-Pang Yang
One of the most important challenges in a video-on-demand system is to support interactive browsing functions such as fast forward and fast backward. There are several possible approaches to implementing these functions which require additional resources. Although the segment-sampling strategy proposed by Chen et al. (1995) can support browsing at any desired speed without any additional resource, this strategy only considers the display of a single continuous object at a time. In this paper, we propose a new strategy, called the multi-sampling strategy, which generalizes the approach of the segment-sampling strategy so that it can support continuous display of multiple objects at different display speed rates, simultaneously, without any additional resource.
视频点播系统最重要的挑战之一是支持交互式浏览功能，如快进快退。实现这些功能有几种可能的方法，但需要额外的资源。Chen et al.(1995)提出的分段采样策略虽然可以在不增加任何资源的情况下支持任意速度的浏览，但该策略一次只考虑单个连续对象的显示。在本文中，我们提出了一种新的策略，称为多采样策略，它推广了片段采样策略的方法，使其能够在不增加任何资源的情况下，以不同的显示速率同时支持多个对象的连续显示。
{"title":"An efficient multi-sampling strategy for interactive display in a video-on-demand server","authors":"Chien I. Lee, Ye-In Chang, Wei-Pang Yang","doi":"10.1109/ICPADS.1998.741089","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741089","url":null,"abstract":"One of the most important challenges in a video-on-demand system is to support interactive browsing functions such as fast forward and fast backward. There are several possible approaches to implementing these functions which require additional resources. Although the segment-sampling strategy proposed by Chen et al. (1995) can support browsing at any desired speed without any additional resource, this strategy only considers the display of a single continuous object at a time. In this paper, we propose a new strategy, called the multi-sampling strategy, which generalizes the approach of the segment-sampling strategy so that it can support continuous display of multiple objects at different display speed rates, simultaneously, without any additional resource.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121913462","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741131
Hae-Sun Shin, Gyeong-Hun Kim, Se-Jin Hwang, A-Rum Jun, Gun-Hee Kim, Myong-Soon Park
Caching and prefetching are well-known solutions to the problem of long latency in both wired and wireless networks. Caching is prevalently used to reduce round-trips and network traffic. The prefetching and uploading-prefetching data from fixed hosts on a wired network and uploading to mobile hosts-in the base station for the WWW has been proposed to solve those problems and has shown high performance improvement. The performance of prefetching in the base station can be improved when the base station has the caching information of mobile hosts. Cache-index forwarding can be used to let the base station see information of caching on mobile hosts. Here we propose a method named "CINDEX: Cache-Index Forwarding per Document for the WWW", which sends the information of caching data on mobile hosts per document to the base station to eliminate unessential data prefetching and uploading.
缓存和预取是有线和无线网络中解决长延迟问题的众所周知的解决方案。缓存通常用于减少往返和网络流量。为了解决这些问题，提出了在有线网络上从固定主机上预取数据并上传到移动主机的WWW基站预取和上传方法，并取得了较好的性能改进。当基站具有移动主机的缓存信息时，可以提高基站预取的性能。缓存索引转发可以让基站看到移动主机上的缓存信息。本文提出一种名为“CINDEX: Cache-Index Forwarding per Document for the WWW”的方法，将移动主机上每个文档缓存数据的信息发送到基站，消除不必要的数据预取和上传。
{"title":"An effective cache-index forwarding over wireless network for the World-Wide Web","authors":"Hae-Sun Shin, Gyeong-Hun Kim, Se-Jin Hwang, A-Rum Jun, Gun-Hee Kim, Myong-Soon Park","doi":"10.1109/ICPADS.1998.741131","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741131","url":null,"abstract":"Caching and prefetching are well-known solutions to the problem of long latency in both wired and wireless networks. Caching is prevalently used to reduce round-trips and network traffic. The prefetching and uploading-prefetching data from fixed hosts on a wired network and uploading to mobile hosts-in the base station for the WWW has been proposed to solve those problems and has shown high performance improvement. The performance of prefetching in the base station can be improved when the base station has the caching information of mobile hosts. Cache-index forwarding can be used to let the base station see information of caching on mobile hosts. Here we propose a method named \"CINDEX: Cache-Index Forwarding per Document for the WWW\", which sends the information of caching data on mobile hosts per document to the base station to eliminate unessential data prefetching and uploading.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124195747","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741012
S. Chung, S. Jhang, C. Jhon
The PANDA is a ring-based Cache Coherent Non-Uniform Memory Access (CC-NUMA) multiprocessor system under implementation at the Seoul National University. Its main goal is to ameliorate the data miss latency by using the unidirectional point-to-point interconnection network. We introduce the PANDA architecture and present a new snooping protocol for this system. We evaluate the performance of the PANDA for a small to medium scale multiprocessor system using analytical models and a program-driven simulator. We compare the proposed system to other alternatives of point-to-point connected machines, such as the Express Ring and full map directory based system. The simulation results show up to 29% performance improvement against the Express Ring. They also show that the PANDA performs no worse than the full map directory based system, which has the additional hardware costs for the directory management.
{"title":"PANDA: ring-based multiprocessor system using new snooping protocol","authors":"S. Chung, S. Jhang, C. Jhon","doi":"10.1109/ICPADS.1998.741012","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741012","url":null,"abstract":"The PANDA is a ring-based Cache Coherent Non-Uniform Memory Access (CC-NUMA) multiprocessor system under implementation at the Seoul National University. Its main goal is to ameliorate the data miss latency by using the unidirectional point-to-point interconnection network. We introduce the PANDA architecture and present a new snooping protocol for this system. We evaluate the performance of the PANDA for a small to medium scale multiprocessor system using analytical models and a program-driven simulator. We compare the proposed system to other alternatives of point-to-point connected machines, such as the Express Ring and full map directory based system. The simulation results show up to 29% performance improvement against the Express Ring. They also show that the PANDA performs no worse than the full map directory based system, which has the additional hardware costs for the directory management.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127975665","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741081
Tomoya Taka, T. Mizuno, Takashi Watanabe
Mobile agent technologies are becoming popular as an efficient way to access network resources. Because an application using mobile agents has some unique problems caused by frequent creation, migration and disappearance of mobile agents, a mobile agent platform has to provide not only agents and their execution engines but some functions and mechanisms which are specialized to mobile agent systems. We discuss the practical problems occurring in mobile agent environments, that is, agent controllability, resource restrictions and security. To solve these problems, we propose a mobile agent platform, called SFM (Secured Floating Market) model. This model fulfils the agent controllability by agent control parameters and has the measures against the resource restrictions such as location of resources and agents, processing capability and condition of load. Besides, this model guarantees some suitable security strength levels for flexible execution of various services and user requirements. We implement the prototype of this model using Aglets.
{"title":"A model of mobile agent services enhanced for resource restrictions and security","authors":"Tomoya Taka, T. Mizuno, Takashi Watanabe","doi":"10.1109/ICPADS.1998.741081","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741081","url":null,"abstract":"Mobile agent technologies are becoming popular as an efficient way to access network resources. Because an application using mobile agents has some unique problems caused by frequent creation, migration and disappearance of mobile agents, a mobile agent platform has to provide not only agents and their execution engines but some functions and mechanisms which are specialized to mobile agent systems. We discuss the practical problems occurring in mobile agent environments, that is, agent controllability, resource restrictions and security. To solve these problems, we propose a mobile agent platform, called SFM (Secured Floating Market) model. This model fulfils the agent controllability by agent control parameters and has the measures against the resource restrictions such as location of resources and agents, processing capability and condition of load. Besides, this model guarantees some suitable security strength levels for flexible execution of various services and user requirements. We implement the prototype of this model using Aglets.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115594715","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741084
Ting-Lu Huang
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.
{"title":"Fast mutual exclusion algorithms using read-modify-write and atomic read/write registers","authors":"Ting-Lu Huang","doi":"10.1109/ICPADS.1998.741084","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741084","url":null,"abstract":"Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115463938","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
扫码关注我们
求助内容：
应助结果提醒方式：