Pub Date : 2002-11-04DOI: 10.1109/TAI.2002.1180794
M. Fragouli, A. Delis
In this paper we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective paths. The tool's underlying algorithm is based on the breadth-first-search (BFS) algorithm and traces dynamically feasible routes on a terrain. Our rationale is to reduce the number of nodes representing the possible points for a transition and thus the complexity of EasyTransport's operation. Since our algorithm functions with increasingly coarse geographic granularities, it can achieve its successful termination fast. We, furthermore, suggest heuristics that effectively manage the potentially enormous data sets in the geographic areas involved EasyTransport, is a highly interactive system that allows for easy querying and features flexible adaptation and presentation of the generated answers, ensures short response times, and offers useful getting-a round-and-how guidelines.
{"title":"EasyTransport: an effective navigation and transportation guide for wide geographic areas","authors":"M. Fragouli, A. Delis","doi":"10.1109/TAI.2002.1180794","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180794","url":null,"abstract":"In this paper we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective paths. The tool's underlying algorithm is based on the breadth-first-search (BFS) algorithm and traces dynamically feasible routes on a terrain. Our rationale is to reduce the number of nodes representing the possible points for a transition and thus the complexity of EasyTransport's operation. Since our algorithm functions with increasingly coarse geographic granularities, it can achieve its successful termination fast. We, furthermore, suggest heuristics that effectively manage the potentially enormous data sets in the geographic areas involved EasyTransport, is a highly interactive system that allows for easy querying and features flexible adaptation and presentation of the generated answers, ensures short response times, and offers useful getting-a round-and-how guidelines.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129457955","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180788
Daniele Braga, A. Campi, S. Ceri, M. Klemettinen, P. Lanzi
The recent success of XML as a standard to represent semi-structured data, and the increasing amount of available XML data pose new challenges to the data mining community. In this paper we present the XMINE operator, a tool developed to extract XML association rules for XML documents. The operator, based on XPath and inspired by the syntax of XQuery, allows us to express complex mining tasks, compactly and intuitively. XMINE can be used to specify indifferently (and simultaneously) mining tasks both on the content and on the structure of the data, since the distinction in XML is slight.
{"title":"A tool for extracting XML association rules","authors":"Daniele Braga, A. Campi, S. Ceri, M. Klemettinen, P. Lanzi","doi":"10.1109/TAI.2002.1180788","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180788","url":null,"abstract":"The recent success of XML as a standard to represent semi-structured data, and the increasing amount of available XML data pose new challenges to the data mining community. In this paper we present the XMINE operator, a tool developed to extract XML association rules for XML documents. The operator, based on XPath and inspired by the syntax of XQuery, allows us to express complex mining tasks, compactly and intuitively. XMINE can be used to specify indifferently (and simultaneously) mining tasks both on the content and on the structure of the data, since the distinction in XML is slight.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912151","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}
Due to the entry of Taiwan into WTO and the recently liberalized Petroleum Management Law, the oil market in Taiwan is liberalized and thus is becoming more competitive. However, the space limitation and the residents' increasing awareness of environmental protection issues in the island make international vendors unavoidably have to rent tanks from domestic oil companies. In order to help the leaseholder maximize revenue by increasing the availability of tanks, an efficient maintenance scheduling is needed. This paper introduces a tabu-based genetic algorithm (TGA) and its implementation for solving a real-world maintenance scheduling problem of oil storage tanks. TGA incorporates a tabu list to prevent inbreeding and utilizes an aspiration criterion to supply moderate selection pressure so that the selection efficiency is improved, and the population diversity is maintained. The experimental results validate that TGA outperform GA in terms of solution quality and convergence efficiency. Keywords: Tabu-based genetic algorithm, maintenance scheduling, tabu search, genetic algorithm.
{"title":"Maintenance scheduling of oil storage tanks using tabu-based genetic algorithm","authors":"Sheng-Tun Li, Chuan-Kang Ting, Chungnan Lee, Shu‐Ching Chen","doi":"10.1109/TAI.2002.1180806","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180806","url":null,"abstract":"Due to the entry of Taiwan into WTO and the recently liberalized Petroleum Management Law, the oil market in Taiwan is liberalized and thus is becoming more competitive. However, the space limitation and the residents' increasing awareness of environmental protection issues in the island make international vendors unavoidably have to rent tanks from domestic oil companies. In order to help the leaseholder maximize revenue by increasing the availability of tanks, an efficient maintenance scheduling is needed. This paper introduces a tabu-based genetic algorithm (TGA) and its implementation for solving a real-world maintenance scheduling problem of oil storage tanks. TGA incorporates a tabu list to prevent inbreeding and utilizes an aspiration criterion to supply moderate selection pressure so that the selection efficiency is improved, and the population diversity is maintained. The experimental results validate that TGA outperform GA in terms of solution quality and convergence efficiency. Keywords: Tabu-based genetic algorithm, maintenance scheduling, tabu search, genetic algorithm.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132246433","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180790
A. Mali
Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical planners into two categories: (i) planners doing refinement search and (ii) planners iteratively processing a representation of finite size like a SAT encoding or planning graph or a constraint satisfaction problem (CSP). One key challenge in the development of planners casting planning as SAT or CSP is the identification of constraints which are satisfied if and only if there is a plan of k steps. This task is even more complex for planners handling metric time and/or resource quantities and/or quantifiers. In this paper we show how such a SAT encoding can be synthesized for temporal planning. This encoding contains twenty kinds of constraints. We show how this encoding can be simplified. The set of constraints we identify makes it easier to develop temporal planners casting planning as a constraint satisfaction problem other than SAT, like integer linear programming (ILP). The SAT encoding can be easily adapted to more complex cases of temporal planning such as that in which different preconditions and effects of an action may be true at different times during its execution. We also discuss two additional SAT encodings of temporal planning. The encoding schemes make it easier to exploit progress in SAT and CSP solving to solve temporal planning problems.
{"title":"On temporal planning as CSP","authors":"A. Mali","doi":"10.1109/TAI.2002.1180790","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180790","url":null,"abstract":"Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical planners into two categories: (i) planners doing refinement search and (ii) planners iteratively processing a representation of finite size like a SAT encoding or planning graph or a constraint satisfaction problem (CSP). One key challenge in the development of planners casting planning as SAT or CSP is the identification of constraints which are satisfied if and only if there is a plan of k steps. This task is even more complex for planners handling metric time and/or resource quantities and/or quantifiers. In this paper we show how such a SAT encoding can be synthesized for temporal planning. This encoding contains twenty kinds of constraints. We show how this encoding can be simplified. The set of constraints we identify makes it easier to develop temporal planners casting planning as a constraint satisfaction problem other than SAT, like integer linear programming (ILP). The SAT encoding can be easily adapted to more complex cases of temporal planning such as that in which different preconditions and effects of an action may be true at different times during its execution. We also discuss two additional SAT encodings of temporal planning. The encoding schemes make it easier to exploit progress in SAT and CSP solving to solve temporal planning problems.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116293845","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180837
J. Yen, Xiaocong Fan
Psychological studies about human teamwork have shown that members of an effective team can often anticipate needs of other teammates, and choose to assist teammates through appropriate ways. However the fulfillment of help behaviors among teammates is subject to team members' understanding of the underpinning communicative acts performed by individual agents. By extending the mental state analysis of performatives initiated by Cohen and Levesque (1990), we focus this paper on analyzing a missing class of performatives -proactive performatives, which are prevalently used by individual agents to exchange information among teammates.
{"title":"The semantics of proactive communication acts among team-based agents","authors":"J. Yen, Xiaocong Fan","doi":"10.1109/TAI.2002.1180837","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180837","url":null,"abstract":"Psychological studies about human teamwork have shown that members of an effective team can often anticipate needs of other teammates, and choose to assist teammates through appropriate ways. However the fulfillment of help behaviors among teammates is subject to team members' understanding of the underpinning communicative acts performed by individual agents. By extending the mental state analysis of performatives initiated by Cohen and Levesque (1990), we focus this paper on analyzing a missing class of performatives -proactive performatives, which are prevalently used by individual agents to exchange information among teammates.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415992","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180829
G. Manco, E. Masciari, Andrea Tagarelli
We introduce a technique based on data mining algorithms for classifying incoming messages, as a basis for an overall architecture for maintenance and management of e-mail messages. We exploit clustering techniques for grouping structured and unstructured information extracted from e-mail messages in an unsupervised way, and exploit the resulting algorithm in the process of folder creation (and maintenance) and e-mail redirection. Some initial experimental results show the effectiveness of the technique, both from an efficiency and a quality-of-results viewpoint.
{"title":"A framework for adaptive mail classification","authors":"G. Manco, E. Masciari, Andrea Tagarelli","doi":"10.1109/TAI.2002.1180829","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180829","url":null,"abstract":"We introduce a technique based on data mining algorithms for classifying incoming messages, as a basis for an overall architecture for maintenance and management of e-mail messages. We exploit clustering techniques for grouping structured and unstructured information extracted from e-mail messages in an unsupervised way, and exploit the resulting algorithm in the process of folder creation (and maintenance) and e-mail redirection. Some initial experimental results show the effectiveness of the technique, both from an efficiency and a quality-of-results viewpoint.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129536477","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180840
Mehmet Kaya, R. Alhajj
Most of the methods proposed to improve the learning ability in multiagent systems are not appropriate to more complex multiagent learning problems because the state space of each learning agent grows exponentially in terms of the number of partners present in the environment. We propose a novel and robust multiagent architecture to handle these problems. The architecture is based on a learning fuzzy controller whose rule base is partitioned into several different modules. Each module deals with a particular agent in the environment and the fuzzy controller maps the input fuzzy sets to the output fuzzy sets that represent the state space of each learning module and the action space, respectively. Also, each module uses an internal model table to estimate the action of the other agents. Experimental results show the robustness and effectiveness of the proposed approach.
{"title":"Reinforcement learning in multiagent systems: a modular fuzzy approach with internal model capabilities","authors":"Mehmet Kaya, R. Alhajj","doi":"10.1109/TAI.2002.1180840","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180840","url":null,"abstract":"Most of the methods proposed to improve the learning ability in multiagent systems are not appropriate to more complex multiagent learning problems because the state space of each learning agent grows exponentially in terms of the number of partners present in the environment. We propose a novel and robust multiagent architecture to handle these problems. The architecture is based on a learning fuzzy controller whose rule base is partitioned into several different modules. Each module deals with a particular agent in the environment and the fuzzy controller maps the input fuzzy sets to the output fuzzy sets that represent the state space of each learning module and the action space, respectively. Also, each module uses an internal model table to estimate the action of the other agents. Experimental results show the robustness and effectiveness of the proposed approach.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118202","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180800
H. Lau, Yam Guan Goh
An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the Web is proposed. In our system, customers specify job requests over the Web dynamically. An e-marketplace allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies in the e-marketplace optimally deciding which agents' bids should be satisfied based on a set of predetermined factors (pricing, preferences and fairness). We model the underlying brokering problem as a set packing problem (SPP), an NP-hard optimization problem. An iterative greedy approximation algorithm is proposed to solve the SPP, and experimental results show its effectiveness against the classical greedy method proposed by Chvatal (1979).
{"title":"An intelligent brokering system to support multi-agent Web-based 4/sup th/-party logistics","authors":"H. Lau, Yam Guan Goh","doi":"10.1109/TAI.2002.1180800","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180800","url":null,"abstract":"An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the Web is proposed. In our system, customers specify job requests over the Web dynamically. An e-marketplace allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies in the e-marketplace optimally deciding which agents' bids should be satisfied based on a set of predetermined factors (pricing, preferences and fairness). We model the underlying brokering problem as a set packing problem (SPP), an NP-hard optimization problem. An iterative greedy approximation algorithm is proposed to solve the SPP, and experimental results show its effectiveness against the classical greedy method proposed by Chvatal (1979).","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116126423","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180819
Henning Christiansen, V. Dahl
We propose an abductive model based on Constraint Handling Rule Grammars (CHRGs) for detecting and correcting errors in problem domains that can be described in terms of strings of words accepted by a logic grammar. We provide a proof of concept for the specific problem of detecting and repairing natural language errors, in particular those concerning feature agreement. Our methodology relies on grammar and string transformation in accordance with a user-defined dictionary of possible repairs. This transformation also serves as top-down guidance for our essentially bottom-up parser. With respect to previous approaches to error detection and repair including those that also use constraints and/or abduction, our methodology is surprisingly simple while far-reaching and efficient.
{"title":"Logic grammars for diagnosis and repair","authors":"Henning Christiansen, V. Dahl","doi":"10.1109/TAI.2002.1180819","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180819","url":null,"abstract":"We propose an abductive model based on Constraint Handling Rule Grammars (CHRGs) for detecting and correcting errors in problem domains that can be described in terms of strings of words accepted by a logic grammar. We provide a proof of concept for the specific problem of detecting and repairing natural language errors, in particular those concerning feature agreement. Our methodology relies on grammar and string transformation in accordance with a user-defined dictionary of possible repairs. This transformation also serves as top-down guidance for our essentially bottom-up parser. With respect to previous approaches to error detection and repair including those that also use constraints and/or abduction, our methodology is surprisingly simple while far-reaching and efficient.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124939543","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 : 2002-11-04DOI: 10.1109/TAI.2002.1180820
Tassadit Amghar, D. Battistelli, Thierry Charnois
This paper presents a modeling of time, aspect and verbal meanings in natural language processing within Simple Conceptual Graphs (SCG) by way of Semantico-Cognitive Schemes (SCS) and the aspectual-temporal theory. Our system translates a semantico-cognitive representation in terms of SCGs. The SCS allows us to build a representation of a text taking into account fine subtleties of natural language as the information about time and aspect. The Conceptual Graphs formalism provides a powerful inferential mechanism which makes it possible to reason from texts. Our work bears on French texts. A text is represented by two different structures both represented within the SCG model. The first structure models the semantico-cognitive representation while the second one is the temporal diagram representing the temporal constraints between the situations described in the text. Linking these structures entails an expansion of the original SCG model.
{"title":"Reasoning on aspectual-temporal information in French within conceptual graphs","authors":"Tassadit Amghar, D. Battistelli, Thierry Charnois","doi":"10.1109/TAI.2002.1180820","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180820","url":null,"abstract":"This paper presents a modeling of time, aspect and verbal meanings in natural language processing within Simple Conceptual Graphs (SCG) by way of Semantico-Cognitive Schemes (SCS) and the aspectual-temporal theory. Our system translates a semantico-cognitive representation in terms of SCGs. The SCS allows us to build a representation of a text taking into account fine subtleties of natural language as the information about time and aspect. The Conceptual Graphs formalism provides a powerful inferential mechanism which makes it possible to reason from texts. Our work bears on French texts. A text is represented by two different structures both represented within the SCG model. The first structure models the semantico-cognitive representation while the second one is the temporal diagram representing the temporal constraints between the situations described in the text. Linking these structures entails an expansion of the original SCG model.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105979","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
扫码关注我们
求助内容：
应助结果提醒方式：