Several problems are required to be fixed in order to apply geographical routing protocol greedy perimeter stateless routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability), which is not realistic for many practical sensor networks, since wireless links in sensor networks often are asymmetric. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address. Therefore, packets are routed to the home node, which is the node geographically closest to the destined location. Under GPSR, when the target location is outside the exterior perimeter of the sensor network, each packet has to visit all nodes on the boundary of the sensor network topology before it identifies the home node, which results in energy inefficiency. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose on-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little bit more packet delivery delay.
{"title":"Customizing a geographical routing protocol for wireless sensor networks","authors":"Jing Chen, Y. Guan, U. Pooch","doi":"10.1109/ITCC.2005.118","DOIUrl":"https://doi.org/10.1109/ITCC.2005.118","url":null,"abstract":"Several problems are required to be fixed in order to apply geographical routing protocol greedy perimeter stateless routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability), which is not realistic for many practical sensor networks, since wireless links in sensor networks often are asymmetric. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address. Therefore, packets are routed to the home node, which is the node geographically closest to the destined location. Under GPSR, when the target location is outside the exterior perimeter of the sensor network, each packet has to visit all nodes on the boundary of the sensor network topology before it identifies the home node, which results in energy inefficiency. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose on-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little bit more packet delivery delay.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128018905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The principal goal of near video-on-demand system is to minimize the average user waiting time. The user waiting time of popular videos can be reduced significantly by using broadcasting schemes such as fast broadcasting. Instead of allocating channels uniformly to all the videos, channels are nonuniformly distributed according to the relative popularity of the videos to minimize the average user waiting time. Since the demand for videos changes from time to time, the number of channels allocated to a video needs to be changed dynamically. The channel transition should be seamless so that the users currently watching the video do not experience any disruption due to this transition. Existing seamless channel transition scheme pads a dummy video stream at the end of the original video stream to produce exact correspondence between segments, but this approach causes some wastage of bandwidth. This paper proposes an improved seamless channel transition scheme which minimizes the wastage of bandwidth by preloading a postfix of the original video stream in the client buffer.
{"title":"Seamless channel transition for popular video broadcasting","authors":"S.A. Azad, M. Murshed","doi":"10.1109/ITCC.2005.251","DOIUrl":"https://doi.org/10.1109/ITCC.2005.251","url":null,"abstract":"The principal goal of near video-on-demand system is to minimize the average user waiting time. The user waiting time of popular videos can be reduced significantly by using broadcasting schemes such as fast broadcasting. Instead of allocating channels uniformly to all the videos, channels are nonuniformly distributed according to the relative popularity of the videos to minimize the average user waiting time. Since the demand for videos changes from time to time, the number of channels allocated to a video needs to be changed dynamically. The channel transition should be seamless so that the users currently watching the video do not experience any disruption due to this transition. Existing seamless channel transition scheme pads a dummy video stream at the end of the original video stream to produce exact correspondence between segments, but this approach causes some wastage of bandwidth. This paper proposes an improved seamless channel transition scheme which minimizes the wastage of bandwidth by preloading a postfix of the original video stream in the client buffer.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125462594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The business of content providers is being threatened by technology advances in hardware, software and IP networks resulting in an increasing amount of illegal copies available online as well as offline. Digital rights management standards are being developed for the digital content and digital watermarking, a popular technique for content authentication and forgery prevention is viewed as an enabling technology to protect distributed content from unauthorized reuse, or reuse with inadequate credit. This paper establishes the role of an administrative body, by the name of Central Watermarking Body, in sharing the responsibilities of the content providers, in securing the genuine content and in protecting the rights of the customers by allowing them to judge if the content they have paid for, is genuine. The paper also highlights the objectives, technological details, the economic feasibility, the issues pertaining to the practical implementation and the limitations of the watermark based DRM model.
{"title":"Watermark based digital rights management","authors":"Piyali Mandal, Ashish Thakral, S. Verma","doi":"10.1109/ITCC.2005.294","DOIUrl":"https://doi.org/10.1109/ITCC.2005.294","url":null,"abstract":"The business of content providers is being threatened by technology advances in hardware, software and IP networks resulting in an increasing amount of illegal copies available online as well as offline. Digital rights management standards are being developed for the digital content and digital watermarking, a popular technique for content authentication and forgery prevention is viewed as an enabling technology to protect distributed content from unauthorized reuse, or reuse with inadequate credit. This paper establishes the role of an administrative body, by the name of Central Watermarking Body, in sharing the responsibilities of the content providers, in securing the genuine content and in protecting the rights of the customers by allowing them to judge if the content they have paid for, is genuine. The paper also highlights the objectives, technological details, the economic feasibility, the issues pertaining to the practical implementation and the limitations of the watermark based DRM model.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127971871","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}
Internal structures of software artifacts, especially program source code, are very important to software engineers in developing a high-quality software. However, many existing version control and configuration management systems often treat program source code as a set of text lines and disregard logical structure. This creates burdensome for developers since the evolution of program structures is not recorded. This makes not only the development but also the maintenance of software systems less efficient. This paper describes a novel approach to fine-grained version control of source code and structured documents, called structure-oriented product versioning. The approach enables flexible management of the evolution of fine-grained units at any structural level in a software document.
{"title":"Structure-oriented product versioning","authors":"T. Nguyen, E. Munson, J. Boyland, C. Thao","doi":"10.1109/ITCC.2005.263","DOIUrl":"https://doi.org/10.1109/ITCC.2005.263","url":null,"abstract":"Internal structures of software artifacts, especially program source code, are very important to software engineers in developing a high-quality software. However, many existing version control and configuration management systems often treat program source code as a set of text lines and disregard logical structure. This creates burdensome for developers since the evolution of program structures is not recorded. This makes not only the development but also the maintenance of software systems less efficient. This paper describes a novel approach to fine-grained version control of source code and structured documents, called structure-oriented product versioning. The approach enables flexible management of the evolution of fine-grained units at any structural level in a software document.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129974933","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}
J. Long, D. Schwartz, S. Stoecklin, Mahesh K. Patel
Evidence of some attacks can be manifested by abnormal sequences of system calls of programs. Most approaches that have been developed so far mainly concentrate on some program-specific behaviors and ignore some plain behaviors of programs. According to the concept of locality of reference, programs tend to spend most of their time on a few lines of code rather than other parts of the program. We use this finding to propose a method of loop reduction. A loop reduction algorithm, when applied to a series of system calls, eliminates redundant data. We did experiments for the comparison before and after loop reduction with the same detection approach. The preliminary results show that loop reduction improves the quality of training data by removing redundancy.
{"title":"Application of loop reduction to learning program behaviors for anomaly detection","authors":"J. Long, D. Schwartz, S. Stoecklin, Mahesh K. Patel","doi":"10.1109/ITCC.2005.88","DOIUrl":"https://doi.org/10.1109/ITCC.2005.88","url":null,"abstract":"Evidence of some attacks can be manifested by abnormal sequences of system calls of programs. Most approaches that have been developed so far mainly concentrate on some program-specific behaviors and ignore some plain behaviors of programs. According to the concept of locality of reference, programs tend to spend most of their time on a few lines of code rather than other parts of the program. We use this finding to propose a method of loop reduction. A loop reduction algorithm, when applied to a series of system calls, eliminates redundant data. We did experiments for the comparison before and after loop reduction with the same detection approach. The preliminary results show that loop reduction improves the quality of training data by removing redundancy.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134407930","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}
Concept-based access to information promises important benefits over keyword-based access. One of these benefits is the ability to take advantage of semantic relationships among concepts in finding relevant documents. Another benefit is the elimination of irrelevant documents by identifying conceptual mismatches. Concepts are mental structures. Words and phrases are the linguistic representatives of concepts. Due to the inherent conciseness of natural language, words can represent multiple concepts and different words may represent the same or very similar concepts. Word sense disambiguation attempts to resolve this ambiguity using contextual information. The use of an ontology facilitates identification of related concepts and their linguistic representatives given a key concept. Latent semantic analysis, on the other hand, attempts to reveal the hidden conceptual relationships among words and phrases based on linguistic usage patterns. In this work we explore the potential of concept-based information access via these two methods. We examine under what circumstances concept-based access becomes feasible and improves user experience.
{"title":"Concept-based information access","authors":"R. Ozcan, Y. Aslandogan","doi":"10.1109/ITCC.2005.111","DOIUrl":"https://doi.org/10.1109/ITCC.2005.111","url":null,"abstract":"Concept-based access to information promises important benefits over keyword-based access. One of these benefits is the ability to take advantage of semantic relationships among concepts in finding relevant documents. Another benefit is the elimination of irrelevant documents by identifying conceptual mismatches. Concepts are mental structures. Words and phrases are the linguistic representatives of concepts. Due to the inherent conciseness of natural language, words can represent multiple concepts and different words may represent the same or very similar concepts. Word sense disambiguation attempts to resolve this ambiguity using contextual information. The use of an ontology facilitates identification of related concepts and their linguistic representatives given a key concept. Latent semantic analysis, on the other hand, attempts to reveal the hidden conceptual relationships among words and phrases based on linguistic usage patterns. In this work we explore the potential of concept-based information access via these two methods. We examine under what circumstances concept-based access becomes feasible and improves user experience.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133436662","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}
Jordi Castellà-Roca, G. Navarro, J. A. Ortega-Ruiz, Joaquín García
Unlike in traditional environments, e-gambling players must make a beforehand payment to start a game. Most on-line casinos currently solve this problem using prepayment systems where the on-line casino has absolute control over all the transactions among the players. However, this solution poses a great number of problems because of the necessary trust relation between players and the on-line casino managers. To reduce this strong trust relationship with the on-line casino, the authors proposed in this paper the use of a reliable digital chips system, which provides auditing facilities, and can be trusted by external parties. Digital chips, just like physical ones, will be used for players instead of legal course money. A set of cryptographic protocols will protect the different actions that players can perform using these digital chips.
{"title":"Digital chips for an on-line casino","authors":"Jordi Castellà-Roca, G. Navarro, J. A. Ortega-Ruiz, Joaquín García","doi":"10.1109/ITCC.2005.130","DOIUrl":"https://doi.org/10.1109/ITCC.2005.130","url":null,"abstract":"Unlike in traditional environments, e-gambling players must make a beforehand payment to start a game. Most on-line casinos currently solve this problem using prepayment systems where the on-line casino has absolute control over all the transactions among the players. However, this solution poses a great number of problems because of the necessary trust relation between players and the on-line casino managers. To reduce this strong trust relationship with the on-line casino, the authors proposed in this paper the use of a reliable digital chips system, which provides auditing facilities, and can be trusted by external parties. Digital chips, just like physical ones, will be used for players instead of legal course money. A set of cryptographic protocols will protect the different actions that players can perform using these digital chips.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133229971","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}
Constructing an e-gov affairs system requires complex systematic engineering, and it is difficult to be successful. Meanwhile, it is a very practical and independent action, and it is necessary to have a theoretic model suitable for an e-gov affairs environment. In this paper, based on the analysis of characteristics of e-government affairs, a role network model is proposed along with its relation to other relative models discussed. Finally, a formalization description of this model is given.
{"title":"Research on role-network model for e-government affairs","authors":"Han Shengju, Wang Ning, Yu Miao","doi":"10.1109/ITCC.2005.247","DOIUrl":"https://doi.org/10.1109/ITCC.2005.247","url":null,"abstract":"Constructing an e-gov affairs system requires complex systematic engineering, and it is difficult to be successful. Meanwhile, it is a very practical and independent action, and it is necessary to have a theoretic model suitable for an e-gov affairs environment. In this paper, based on the analysis of characteristics of e-government affairs, a role network model is proposed along with its relation to other relative models discussed. Finally, a formalization description of this model is given.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582878","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}
In multi-hop ad-hoc wireless networks with shared medium and a contention based media access control (MAC) protocol, guaranteed quality of service (QoS) support for realtime traffic (e.g. voice, video, interactive applications etc.) is very challenging. Commercially available contention based MAC protocols, e.g. IEEE 802.11e, do not provide any mechanism to prevent a network from getting overloaded. Hence they fail to provide desired QoS (e.g. throughput, end-to-end delay, delivery ratio) for realtime traffic when the network is loaded beyond certain limits. In our previous work we have explained in details why trivial solutions are inadequate to support deterministic QoS for real-time traffic in multi-hop ad-hoc networks. We have also presented an analytical model to offer a distributed admission control and bandwidth reservation scheme by extending the features of the basic channel access mechanism of IEEE 802.11e and coordinating with the network layer. In this paper we have extended our analytical model to make it more effective than the initial one by considering neighboring nodes in bandwidth calculation. We refer to the improved IEEE 802.11e as SAHN-MAC. The proposed admission control mechanism of SAHN-MAC prevents any new data stream from initiating if the new stream saturates or is about to saturate any part of the network. The bandwidth reservation scheme is necessary for the admission control scheme to work properly. The proposed mechanisms have also been verified and evaluated via various simulations.
{"title":"MAC layer support for real-time traffic in a SAHN","authors":"M. Islam, R. Pose, C. Kopp","doi":"10.1109/ITCC.2005.186","DOIUrl":"https://doi.org/10.1109/ITCC.2005.186","url":null,"abstract":"In multi-hop ad-hoc wireless networks with shared medium and a contention based media access control (MAC) protocol, guaranteed quality of service (QoS) support for realtime traffic (e.g. voice, video, interactive applications etc.) is very challenging. Commercially available contention based MAC protocols, e.g. IEEE 802.11e, do not provide any mechanism to prevent a network from getting overloaded. Hence they fail to provide desired QoS (e.g. throughput, end-to-end delay, delivery ratio) for realtime traffic when the network is loaded beyond certain limits. In our previous work we have explained in details why trivial solutions are inadequate to support deterministic QoS for real-time traffic in multi-hop ad-hoc networks. We have also presented an analytical model to offer a distributed admission control and bandwidth reservation scheme by extending the features of the basic channel access mechanism of IEEE 802.11e and coordinating with the network layer. In this paper we have extended our analytical model to make it more effective than the initial one by considering neighboring nodes in bandwidth calculation. We refer to the improved IEEE 802.11e as SAHN-MAC. The proposed admission control mechanism of SAHN-MAC prevents any new data stream from initiating if the new stream saturates or is about to saturate any part of the network. The bandwidth reservation scheme is necessary for the admission control scheme to work properly. The proposed mechanisms have also been verified and evaluated via various simulations.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127411153","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}
This paper describes a framework and process for ongoing curricular integration and innovation based on feedback from the performance of undergraduate interdisciplinary teams working on problems that reflect the needs of industry. The five-step process is based on a top-down, objectives-based approach to bringing the computer science and engineering curriculum in line with computing practice. Critical to the effort is the selection of projects for undergraduate teams since project definitions serve both as an opportunity to challenge students and to lay the foundation for departmental direction. Each project is associated with a set of capability requirements that reflect what team members should both know and be able to do to meet project requirements. Upon project completion, expectations and actual performance are used in a curricular feedback loop to identify possible curricular modifications. We report on an ongoing implementation of this framework at Southern Methodist University (SMU) where integration between computer science and computer engineering serves as a testbed for the framework. At SMU, undergraduate students from computer science and computer engineering are teamed to develop applications that serve to bring core curricula in line with current trends in computing and industry needs.
{"title":"A framework and process for curricular integration and innovation using project based interdisciplinary teams","authors":"F. Coyle, M. Thornton","doi":"10.1109/ITCC.2005.9","DOIUrl":"https://doi.org/10.1109/ITCC.2005.9","url":null,"abstract":"This paper describes a framework and process for ongoing curricular integration and innovation based on feedback from the performance of undergraduate interdisciplinary teams working on problems that reflect the needs of industry. The five-step process is based on a top-down, objectives-based approach to bringing the computer science and engineering curriculum in line with computing practice. Critical to the effort is the selection of projects for undergraduate teams since project definitions serve both as an opportunity to challenge students and to lay the foundation for departmental direction. Each project is associated with a set of capability requirements that reflect what team members should both know and be able to do to meet project requirements. Upon project completion, expectations and actual performance are used in a curricular feedback loop to identify possible curricular modifications. We report on an ongoing implementation of this framework at Southern Methodist University (SMU) where integration between computer science and computer engineering serves as a testbed for the framework. At SMU, undergraduate students from computer science and computer engineering are teamed to develop applications that serve to bring core curricula in line with current trends in computing and industry needs.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133837558","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
扫码关注我们
求助内容：
应助结果提醒方式：