Pub Date : 2004-03-28DOI: 10.1109/RIDE.2004.1281697
Chuang Liu, Ian T Foster
The need to discover and select entities that match specified requirements arises in many contexts in distributed systems. Meeting this need is complicated by the fact that not only may the potential consumer specify constraints on resources, but the owner of the entity in question may specify constraints on the consumer. This observation has motivated Raman et al. to propose that discovery and selection be implemented as symmetric matching process, an approach they take in their ClassAds system. We present here a new approach to symmetric matching that achieves significant advances in expressivities relative to the current ClassAds - for example, allowing for multi-way matches, expression and location of resource with negotiable capability. The key to our approach is that we reinterpret matching as a constraint problem and exploit constraint-solving technologies to implement matching operations. We have prototyped a matchmaking mechanism, named Redline, and used it to model and solve several challenging matching problems.
{"title":"A constraint language approach to matchmaking","authors":"Chuang Liu, Ian T Foster","doi":"10.1109/RIDE.2004.1281697","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281697","url":null,"abstract":"The need to discover and select entities that match specified requirements arises in many contexts in distributed systems. Meeting this need is complicated by the fact that not only may the potential consumer specify constraints on resources, but the owner of the entity in question may specify constraints on the consumer. This observation has motivated Raman et al. to propose that discovery and selection be implemented as symmetric matching process, an approach they take in their ClassAds system. We present here a new approach to symmetric matching that achieves significant advances in expressivities relative to the current ClassAds - for example, allowing for multi-way matches, expression and location of resource with negotiable capability. The key to our approach is that we reinterpret matching as a constraint problem and exploit constraint-solving technologies to implement matching operations. We have prototyped a matchmaking mechanism, named Redline, and used it to model and solve several challenging matching problems.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115782514","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281708
F. Arcieri, F. Fioravanti, E. Nardelli, M. Talamo
In this paper we describe the architectural solution defined and implemented to ensure secure interoperability among information technology (IT) systems managing personal data registries in Italian municipalities and Ministry of Interior. The architecture features a clear separation between security services, provided at an infrastructure level, and application services, exposed on the Internet as Web services. This approach has allowed to easily design and implement secure interoperability, since - notwithstanding the huge variety of IT solutions deployed all over the Italian municipalities to manage personal data registries - existing application services have not required major changes to be able to interoperate.
{"title":"A layered IT infrastructure for secure interoperability in personal data registry digital government services","authors":"F. Arcieri, F. Fioravanti, E. Nardelli, M. Talamo","doi":"10.1109/RIDE.2004.1281708","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281708","url":null,"abstract":"In this paper we describe the architectural solution defined and implemented to ensure secure interoperability among information technology (IT) systems managing personal data registries in Italian municipalities and Ministry of Interior. The architecture features a clear separation between security services, provided at an infrastructure level, and application services, exposed on the Internet as Web services. This approach has allowed to easily design and implement secure interoperability, since - notwithstanding the huge variety of IT solutions deployed all over the Italian municipalities to manage personal data registries - existing application services have not required major changes to be able to interoperate.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114908201","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281713
Zografoula Vagena, Mirella M. Moro, V. Tsotras
Many e-commerce and e-government applications are collaborative in nature (e.g. negotiation and e-catalog management). In collaborative environments, users typically define new document versions from any past version, which creates the need for supporting multiversion XML documents, particularly branched versioning. In this paper, we address the problem of evaluating path expression queries over XML documents with branched versions. We extend path joins to work in a branched version environment and to allow queries on multiple versions. We propose a storage scheme that efficiently maintains all branched document versions and describe changes required on Pathstack, an optimal pattern matching algorithm. Finally, we investigate the effectiveness of our techniques through experimental evaluation.
{"title":"Supporting branched versions on XML documents","authors":"Zografoula Vagena, Mirella M. Moro, V. Tsotras","doi":"10.1109/RIDE.2004.1281713","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281713","url":null,"abstract":"Many e-commerce and e-government applications are collaborative in nature (e.g. negotiation and e-catalog management). In collaborative environments, users typically define new document versions from any past version, which creates the need for supporting multiversion XML documents, particularly branched versioning. In this paper, we address the problem of evaluating path expression queries over XML documents with branched versions. We extend path joins to work in a branched version environment and to allow queries on multiple versions. We propose a storage scheme that efficiently maintains all branched document versions and describe changes required on Pathstack, an optimal pattern matching algorithm. Finally, we investigate the effectiveness of our techniques through experimental evaluation.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122546061","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281703
Kees Leune, W. Heuvel, M. Papazoglou
Service oriented computing (SOC) demands an infrastructure that seamlessly integrates all connection points between business processes, services and associated support resources. Parts of the infrastructure may be supported by existing standards such as XACML and BPEL. However, an integral and sound framework that takes into account all these issues and serves as the formal underpinning of this infrastructure is currently lacking. A multi-faceted framework to enforce minimal levels of security not only at the level of the network (e.g., using encryption), but also of business processes, is of paramount importance. To address this challenge, we explore an event-driven framework for service oriented computing (EFSOC) that is organized in four tiers: the event tier, the business process tier, the resource tier, and the access control tier. The event tier encompasses definitions of business-related events, and supports their propagation throughout the business process flow. The business process tier specifies the dynamic interactions between business processes and services. The resource tier describes how service invocations interact with organizational resources, while the access control tier defines access roles that are allowed to invoke certain services.
{"title":"Exploring a multi-faceted framework for SOC: how to develop secure Web-service interactions?","authors":"Kees Leune, W. Heuvel, M. Papazoglou","doi":"10.1109/RIDE.2004.1281703","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281703","url":null,"abstract":"Service oriented computing (SOC) demands an infrastructure that seamlessly integrates all connection points between business processes, services and associated support resources. Parts of the infrastructure may be supported by existing standards such as XACML and BPEL. However, an integral and sound framework that takes into account all these issues and serves as the formal underpinning of this infrastructure is currently lacking. A multi-faceted framework to enforce minimal levels of security not only at the level of the network (e.g., using encryption), but also of business processes, is of paramount importance. To address this challenge, we explore an event-driven framework for service oriented computing (EFSOC) that is organized in four tiers: the event tier, the business process tier, the resource tier, and the access control tier. The event tier encompasses definitions of business-related events, and supports their propagation throughout the business process flow. The business process tier specifies the dynamic interactions between business processes and services. The resource tier describes how service invocations interact with organizational resources, while the access control tier defines access roles that are allowed to invoke certain services.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894667","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281705
A. Dogac, Y. Kabak, G. Laleci
Web services, like their real life counterparts have several properties and thus truly useful semantic information can only be defined through standard ontology languages. Semantic Web is an important initiative in this respect. However, although service registries are the major mechanisms to discover services, the semantic support provided by service registries is completely detached from the semantic Web effort. In this paper, we address how ebXML registries can be enriched through OWL ontologies to describe Web service semantics. We describe how the various constructs of OWL can be mapped to ebXML classification hierarchies and show how the stored semantics can be queried through standardized queries by using the ebXML query facility. We also provide our observations on how ebXML registries can be extended to provide more efficient semantic support.
{"title":"Enriching ebXML registries with OWL ontologies for efficient service discovery","authors":"A. Dogac, Y. Kabak, G. Laleci","doi":"10.1109/RIDE.2004.1281705","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281705","url":null,"abstract":"Web services, like their real life counterparts have several properties and thus truly useful semantic information can only be defined through standard ontology languages. Semantic Web is an important initiative in this respect. However, although service registries are the major mechanisms to discover services, the semantic support provided by service registries is completely detached from the semantic Web effort. In this paper, we address how ebXML registries can be enriched through OWL ontologies to describe Web service semantics. We describe how the various constructs of OWL can be mapped to ebXML classification hierarchies and show how the stored semantics can be queried through standardized queries by using the ebXML query facility. We also provide our observations on how ebXML registries can be extended to provide more efficient semantic support.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130835941","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281712
M. Mahdavi, J. Shepherd
Nowadays, many Web sites employ dynamic Web pages by accessing a back-end database and formatting the results into HTML pages. Performance is one of the issues that today's Web-enabled applications should deal with. Throughput, network bandwidth usage and user-perceived delay are some of the performance measures. Abandonment of Web sites increases if they fail in meeting performance requirements. Caching is one of the key techniques that address the performance of such applications. In this paper, we focus on caching in Web portals, one of the emerging applications on the Web. Web portals provide a single interface for accessing different sources. We study a caching strategy based on the collaboration between portal and providers. Our experimental results show that the collaborative strategy out-performs the existing caching strategies.
{"title":"Enabling dynamic content caching in Web portals","authors":"M. Mahdavi, J. Shepherd","doi":"10.1109/RIDE.2004.1281712","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281712","url":null,"abstract":"Nowadays, many Web sites employ dynamic Web pages by accessing a back-end database and formatting the results into HTML pages. Performance is one of the issues that today's Web-enabled applications should deal with. Throughput, network bandwidth usage and user-perceived delay are some of the performance measures. Abandonment of Web sites increases if they fail in meeting performance requirements. Caching is one of the key techniques that address the performance of such applications. In this paper, we focus on caching in Web portals, one of the emerging applications on the Web. Web portals provide a single interface for accessing different sources. We study a caching strategy based on the collaboration between portal and providers. Our experimental results show that the collaborative strategy out-performs the existing caching strategies.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"51 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850929","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281711
M. Rodríguez-Martínez, E. Pagan, P. I. Rivera-Vega, Omar G. Rodríguez-Martínez, Maritere Martínez-Montes, José R. Arzuaga, Michael Rodríguez
Web services represent an attractive technology for e-government applications, since they can be used to disseminate documents such as tax return forms, budget reports, regulatory laws, etc. In this paper, we consider the problem of serving such documents through Web services, with the goal of completing the user's request in minimum time (turnaround time). We propose a distributed peer-to-peer mirror system, the Smart Mirrors System, which continuously collects information from peers, in order to decide the best approach to follow in serving each request. The different research issues being considered are: architecture of the system, cost model to estimate service time by each particular server, interchange of metadata and service requests among peers.
{"title":"Smart Mirrors: peer-to-peer Web services for publishing electronic documents","authors":"M. Rodríguez-Martínez, E. Pagan, P. I. Rivera-Vega, Omar G. Rodríguez-Martínez, Maritere Martínez-Montes, José R. Arzuaga, Michael Rodríguez","doi":"10.1109/RIDE.2004.1281711","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281711","url":null,"abstract":"Web services represent an attractive technology for e-government applications, since they can be used to disseminate documents such as tax return forms, budget reports, regulatory laws, etc. In this paper, we consider the problem of serving such documents through Web services, with the goal of completing the user's request in minimum time (turnaround time). We propose a distributed peer-to-peer mirror system, the Smart Mirrors System, which continuously collects information from peers, in order to decide the best approach to follow in serving each request. The different research issues being considered are: architecture of the system, cost model to estimate service time by each particular server, interchange of metadata and service requests among peers.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132470378","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281701
Yingjiu Li, Xinwen Zhang
Traditional credit card payment is not secure as semi-secret credit card numbers are repetitively used. One-time transaction numbers have been recently proposed to enhance the security in credit card payment. Following this idea, we use a hash function in generation of one-time credit card numbers: the next one-time number is computed by hashing the current one-time number with a secret that is known only by card holder and issuer. Compared with related work, our scheme places less burden on credit card issuers, and can be easily deployed in both on-line and offline payment scenarios.
{"title":"A security-enhanced one-time payment scheme for credit card","authors":"Yingjiu Li, Xinwen Zhang","doi":"10.1109/RIDE.2004.1281701","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281701","url":null,"abstract":"Traditional credit card payment is not secure as semi-secret credit card numbers are repetitively used. One-time transaction numbers have been recently proposed to enhance the security in credit card payment. Following this idea, we use a hash function in generation of one-time credit card numbers: the next one-time number is computed by hashing the current one-time number with a secret that is known only by card holder and issuer. Compared with related work, our scheme places less burden on credit card issuers, and can be easily deployed in both on-line and offline payment scenarios.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130321968","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281709
N. Lakhal, Takashi Kobayashi, H. Yokota
Web services emergence has triggered extensive research efforts. Currently, there is a trend towards deploying business processes as an orchestration of Web services compositions. Given that Web services are inherently loosely-coupled and are primarily built independently, they are most likely to have characteristics (e.g., transaction support, failure recovery, access policies) that might not be compliant with each other. It follows that guaranteeing the reliability and availability of the obtained Web services compositions is a challenging issue. Aligned with this tendency, we focus on the availability and reliability of Web services compositions. Specifically, in this paper, we propose THROWS, an architecture for highly available distributed execution of Web services compositions. In THROWS architecture, the execution control is hierarchically delegated among dynamically discovered engines. The progress of the compositions execution by several distributed engines is continuously captured. Moreover, the Web services compositions executed through the architecture we propose are previously specified as an hierarchy of arbitrary-nested transactions. These transactions execution is provided with retrial and compensation mechanisms which allow the highly available Web services compositions execution.
{"title":"THROWS: an architecture for highly available distributed execution of Web services compositions","authors":"N. Lakhal, Takashi Kobayashi, H. Yokota","doi":"10.1109/RIDE.2004.1281709","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281709","url":null,"abstract":"Web services emergence has triggered extensive research efforts. Currently, there is a trend towards deploying business processes as an orchestration of Web services compositions. Given that Web services are inherently loosely-coupled and are primarily built independently, they are most likely to have characteristics (e.g., transaction support, failure recovery, access policies) that might not be compliant with each other. It follows that guaranteeing the reliability and availability of the obtained Web services compositions is a challenging issue. Aligned with this tendency, we focus on the availability and reliability of Web services compositions. Specifically, in this paper, we propose THROWS, an architecture for highly available distributed execution of Web services compositions. In THROWS architecture, the execution control is hierarchically delegated among dynamically discovered engines. The progress of the compositions execution by several distributed engines is continuously captured. Moreover, the Web services compositions executed through the architecture we propose are previously specified as an hierarchy of arbitrary-nested transactions. These transactions execution is provided with retrial and compensation mechanisms which allow the highly available Web services compositions execution.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129113244","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 : 2004-03-28DOI: 10.1109/RIDE.2004.1281707
Soon Ae Chun, V. Atluri, N. Adam
With the proliferation of Web technologies, the need to deliver services via the Web has increased tremendously. More and more, customers now demand one-stop service that calls for multiple services crossing organizational boundaries, which are required to be carefully and dynamically composed in a customized manner. Such a composition should not only select the most appropriate available service, but should also adhere to the policies and regulations governing the organizational services. In this paper, we demonstrate how such a composition can be accomplished to form a coherent service flow by using rules and services expressed as a knowledge base and topic ontology. The description of rules with topic concepts allows the system to easily identify the relevant rules in a certain domain and to identify and select appropriate Web services for composition. We consider different types of compositional rules including syntactic, semantic and pragmatic (contextual), which play a major role in the discovery and selection of Web services. We model the knowledge of rules and of the topic ontology using OWL, DAML-S, RuleML and RDF standards.
{"title":"Policy-based Web service composition","authors":"Soon Ae Chun, V. Atluri, N. Adam","doi":"10.1109/RIDE.2004.1281707","DOIUrl":"https://doi.org/10.1109/RIDE.2004.1281707","url":null,"abstract":"With the proliferation of Web technologies, the need to deliver services via the Web has increased tremendously. More and more, customers now demand one-stop service that calls for multiple services crossing organizational boundaries, which are required to be carefully and dynamically composed in a customized manner. Such a composition should not only select the most appropriate available service, but should also adhere to the policies and regulations governing the organizational services. In this paper, we demonstrate how such a composition can be accomplished to form a coherent service flow by using rules and services expressed as a knowledge base and topic ontology. The description of rules with topic concepts allows the system to easily identify the relevant rules in a certain domain and to identify and select appropriate Web services for composition. We consider different types of compositional rules including syntactic, semantic and pragmatic (contextual), which play a major role in the discovery and selection of Web services. We model the knowledge of rules and of the topic ontology using OWL, DAML-S, RuleML and RDF standards.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"426 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116006928","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
扫码关注我们
求助内容：
应助结果提醒方式：