Pub Date : 2009-12-15DOI: 10.1109/IIT.2009.5413638
Bekim Cilku, A. Grnarov, Alajdin Abazi
The rapid growth of devices that can be connected wirelessly and the high bandwidth communication capacity among these devices makes implementation of Grid services practical in an ad hoc network today. In this paper we have proposed a new layer called Ad Hoc Grid Layer (AHGL) which contains all necessary services to create a grid environment in ad hoc networks. This layer considers the unreliability and resource limited nature of nodes that are part of ad hoc network also. We have also simulated AHGL in NS-2 simulator, and from the gained results we show that the Grid implementation in ad-hoc networks is not always efficient to speed up the process of job execution. Based on this we have also defined some constraints to see when the Grid implementation in ad-hock networks is efficient to be used. This is done by considering the influence of network transmission time in job execution time.
{"title":"Usability constraints of grid in ad hoc networks","authors":"Bekim Cilku, A. Grnarov, Alajdin Abazi","doi":"10.1109/IIT.2009.5413638","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413638","url":null,"abstract":"The rapid growth of devices that can be connected wirelessly and the high bandwidth communication capacity among these devices makes implementation of Grid services practical in an ad hoc network today. In this paper we have proposed a new layer called Ad Hoc Grid Layer (AHGL) which contains all necessary services to create a grid environment in ad hoc networks. This layer considers the unreliability and resource limited nature of nodes that are part of ad hoc network also. We have also simulated AHGL in NS-2 simulator, and from the gained results we show that the Grid implementation in ad-hoc networks is not always efficient to speed up the process of job execution. Based on this we have also defined some constraints to see when the Grid implementation in ad-hock networks is efficient to be used. This is done by considering the influence of network transmission time in job execution time.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121800557","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413372
F. Firouzi, M. Salehi, A. Azarpeyvand, S. M. Fakhraie, S. Safari
Advances in silicon technology and shrinking the feature size to nanometer scale make unreliability of nano devices the most important concern of fault-tolerant designs. Design of reliable and fault-tolerant embedded processors is mostly based on developing techniques that compensate adding hardware or software redundancy. The recently-proposed redundancy techniques are generally applied uniformly to a system and lead to inefficiencies in terms of performance, power, and area. Non-uniform redundancy requires a quantitative analysis of the system behavior encountering transient faults. In this paper, we introduce a custom fault injection framework that helps to locate the most vulnerable nodes and components of embedded processors. Our framework is based on an exhaustive transient fault injection to candidate nodes which are selected from a user-defined list. Furthermore, the list of nodes containing the microarchitectural state is also defined by user to validate execution of instructions. Based on the reported results, the most vulnerable nodes, components, and instructions are found and could be used for an effective non-uniform fault-tolerant redundancy technique.
{"title":"Analysis of single-event effects in embedded processors for non-uniform fault tolerant design","authors":"F. Firouzi, M. Salehi, A. Azarpeyvand, S. M. Fakhraie, S. Safari","doi":"10.1109/IIT.2009.5413372","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413372","url":null,"abstract":"Advances in silicon technology and shrinking the feature size to nanometer scale make unreliability of nano devices the most important concern of fault-tolerant designs. Design of reliable and fault-tolerant embedded processors is mostly based on developing techniques that compensate adding hardware or software redundancy. The recently-proposed redundancy techniques are generally applied uniformly to a system and lead to inefficiencies in terms of performance, power, and area. Non-uniform redundancy requires a quantitative analysis of the system behavior encountering transient faults. In this paper, we introduce a custom fault injection framework that helps to locate the most vulnerable nodes and components of embedded processors. Our framework is based on an exhaustive transient fault injection to candidate nodes which are selected from a user-defined list. Furthermore, the list of nodes containing the microarchitectural state is also defined by user to validate execution of instructions. Based on the reported results, the most vulnerable nodes, components, and instructions are found and could be used for an effective non-uniform fault-tolerant redundancy technique.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128053984","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413764
K. Zolfaghar, S. Mohammadi
Wireless technologies provide a new channel for implementation of mobile payments systems. In this regard, the potential of short-range wireless technologies such as Bluetooth is enormous. These systems can be used for proximity payment to vending machines or offering banking service in the bank area. However, unsolved security issues are the biggest barriers to the growth of mobile payment. This paper is focused on the security of banking services which can be offered through Bluetooth technology. We propose a solution using honeypots in bank environment to mitigate the risk of Bluetooth-enabled payment transactions. In this paper, we try to elaborate how honeypot systems can be exploited to reduce the chance of Bluetooth enabled attacks' success by limiting the client device discoverability for attackers.
{"title":"Securing Bluetooth-based payment system using honeypot","authors":"K. Zolfaghar, S. Mohammadi","doi":"10.1109/IIT.2009.5413764","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413764","url":null,"abstract":"Wireless technologies provide a new channel for implementation of mobile payments systems. In this regard, the potential of short-range wireless technologies such as Bluetooth is enormous. These systems can be used for proximity payment to vending machines or offering banking service in the bank area. However, unsolved security issues are the biggest barriers to the growth of mobile payment. This paper is focused on the security of banking services which can be offered through Bluetooth technology. We propose a solution using honeypots in bank environment to mitigate the risk of Bluetooth-enabled payment transactions. In this paper, we try to elaborate how honeypot systems can be exploited to reduce the chance of Bluetooth enabled attacks' success by limiting the client device discoverability for attackers.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904586","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413777
Y. Gadallah, Ikbal Taleb
The use of voice to control devices and applications provides a flexible, convenient and secure method for operating these systems. Users can control these systems using voice commands while they are in the proximity of the system to be controlled. Attempting to apply such control over the internet may be affected by several network impairments, e.g. jitter, errors, losses, etc. The effects of these impairments, while may not be felt by the normal human ear, can impact the operation of the software that processes these commands. This processing system is usually based on speaker identification and speech recognition components. In this paper, we study these network effects on the correct operation of such systems. We experiment with different types of network impairments and measure the effects on the voice-controlled operation. Our experiments show that network impairments affect the processing of voice commands to varying degrees. They also provide a comparative view between the behavior of command processing modules and the perceived quality of voice.
{"title":"Network effects on the functionality of voice-controlled systems and applications","authors":"Y. Gadallah, Ikbal Taleb","doi":"10.1109/IIT.2009.5413777","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413777","url":null,"abstract":"The use of voice to control devices and applications provides a flexible, convenient and secure method for operating these systems. Users can control these systems using voice commands while they are in the proximity of the system to be controlled. Attempting to apply such control over the internet may be affected by several network impairments, e.g. jitter, errors, losses, etc. The effects of these impairments, while may not be felt by the normal human ear, can impact the operation of the software that processes these commands. This processing system is usually based on speaker identification and speech recognition components. In this paper, we study these network effects on the correct operation of such systems. We experiment with different types of network impairments and measure the effects on the voice-controlled operation. Our experiments show that network impairments affect the processing of voice commands to varying degrees. They also provide a comparative view between the behavior of command processing modules and the perceived quality of voice.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130818204","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413640
A. Omidi, M. A. Azgomi
The explosion in the use of information technology and widespread use of the Internet makes the countries to utilize the information and communication technologies in order to get their inevitable benefits. Some of these benefits are: accuracy, speed, cost saving and etc. Election and voting is one of the cases, which is recently tended to be performed electronically. Web services, due to their advantages, may have a key role in usage and deployment of e-voting systems. However, employment of web services faces some major dependability and security issues. In this paper, an architecture for e-voting systems based on dependable web services is proposed. The proposed architecture is then modeled using stochastic Petri nets (SPNs), and the reliability and availability measures are evaluated.
{"title":"An architecture for e-voting systems based on dependable web services","authors":"A. Omidi, M. A. Azgomi","doi":"10.1109/IIT.2009.5413640","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413640","url":null,"abstract":"The explosion in the use of information technology and widespread use of the Internet makes the countries to utilize the information and communication technologies in order to get their inevitable benefits. Some of these benefits are: accuracy, speed, cost saving and etc. Election and voting is one of the cases, which is recently tended to be performed electronically. Web services, due to their advantages, may have a key role in usage and deployment of e-voting systems. However, employment of web services faces some major dependability and security issues. In this paper, an architecture for e-voting systems based on dependable web services is proposed. The proposed architecture is then modeled using stochastic Petri nets (SPNs), and the reliability and availability measures are evaluated.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131073273","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413365
Andreas Henschel, W. Woon, Thomas Wachter, S. Madnick
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing taxonomy. Variants of the algorithm are created by altering the way and the frequency, generality of terms is calculated. We analyse the performance and the complexity of the variants combined with a systematic threshold evaluation on a set of seven manually created benchmark sets. As a result, betweenness centrality calculated on unweighted similarity graphs often performs best but requires threshold fine-tuning and is computationally more expensive than closeness centrality. Finally, we show how an entropy-based filter can lead to more precise taxonomies.
{"title":"Comparison of generality based algorithm variants for automatic taxonomy generation","authors":"Andreas Henschel, W. Woon, Thomas Wachter, S. Madnick","doi":"10.1109/IIT.2009.5413365","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413365","url":null,"abstract":"We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing taxonomy. Variants of the algorithm are created by altering the way and the frequency, generality of terms is calculated. We analyse the performance and the complexity of the variants combined with a systematic threshold evaluation on a set of seven manually created benchmark sets. As a result, betweenness centrality calculated on unweighted similarity graphs often performs best but requires threshold fine-tuning and is computationally more expensive than closeness centrality. Finally, we show how an entropy-based filter can lead to more precise taxonomies.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131120558","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413789
Baydaa T. Al-Hamadani1, R. Alwan, Joan Lu
XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network band-width for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.
{"title":"XQPoint: A queriable homomorphic XML compressor","authors":"Baydaa T. Al-Hamadani1, R. Alwan, Joan Lu","doi":"10.1109/IIT.2009.5413789","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413789","url":null,"abstract":"XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network band-width for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114448410","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413366
Mohamed Alnas, I. Awan, D. Holton
Handover latency is the primary cause of packet loss resulting in performance degradation of the standard Mobile IPv6. Mobile IPv6 with fast Handover enables a Mobile Node (MN) to quickly detect at that IP layer it has moved to a new subnet by receiving link-related information from the link-layer; furthermore it gathers anticipative information about the new Access Point (AP) and the associated subnet prefix when the MN is still connected to the previous Corresponding Node (CN). This paper proposes an enhancement to Fast Mobile IPv6 Handover (FMIPv6), based on link layer information, we also present performance evaluations in terms of the packet loss and Handover latency using evaluation models.
{"title":"Performance evaluation of Mobile IPv6 fast Handover","authors":"Mohamed Alnas, I. Awan, D. Holton","doi":"10.1109/IIT.2009.5413366","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413366","url":null,"abstract":"Handover latency is the primary cause of packet loss resulting in performance degradation of the standard Mobile IPv6. Mobile IPv6 with fast Handover enables a Mobile Node (MN) to quickly detect at that IP layer it has moved to a new subnet by receiving link-related information from the link-layer; furthermore it gathers anticipative information about the new Access Point (AP) and the associated subnet prefix when the MN is still connected to the previous Corresponding Node (CN). This paper proposes an enhancement to Fast Mobile IPv6 Handover (FMIPv6), based on link layer information, we also present performance evaluations in terms of the packet loss and Handover latency using evaluation models.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115828299","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413367
A. Karachalios, K. Nakos, D. Reisis, H. Alnuweiri
We present a new FFT architecture for multi-input multi-output (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 × k, up to 2048 points. The architecture scales to support 4 × 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.
{"title":"A new FFT architecture for 4 × 4 MIMO-OFDMA systems with variable symbol lengths","authors":"A. Karachalios, K. Nakos, D. Reisis, H. Alnuweiri","doi":"10.1109/IIT.2009.5413367","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413367","url":null,"abstract":"We present a new FFT architecture for multi-input multi-output (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 × k, up to 2048 points. The architecture scales to support 4 × 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389034","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413765
V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni
The growing of networks and the success of fully distributed mechanisms and protocols to exchange data - as peer-to-peer networks - emphasise the need of trustworthiness. Usually both trust and reputation are taken into account: the former expresses the direct experience, whereas the latter represents the common opinion of the whole network. Their applicability and usefulness however could become uncertain when some node of the network is fraudulent, i.e. reports false opinion in order to enhance/reduce the reputation of someone else. In this paper we argue an algorithm - that takes inspiration from the secure Eigen-Trust - aiming at reducing the impact of such fraudulent nodes. We report some preliminary results of simulations performed on Advogato and SqueakFoundation datasets.
{"title":"Struggling with misbehaviours in trust systems","authors":"V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni","doi":"10.1109/IIT.2009.5413765","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413765","url":null,"abstract":"The growing of networks and the success of fully distributed mechanisms and protocols to exchange data - as peer-to-peer networks - emphasise the need of trustworthiness. Usually both trust and reputation are taken into account: the former expresses the direct experience, whereas the latter represents the common opinion of the whole network. Their applicability and usefulness however could become uncertain when some node of the network is fraudulent, i.e. reports false opinion in order to enhance/reduce the reputation of someone else. In this paper we argue an algorithm - that takes inspiration from the secure Eigen-Trust - aiming at reducing the impact of such fraudulent nodes. We report some preliminary results of simulations performed on Advogato and SqueakFoundation datasets.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126524889","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
扫码关注我们
求助内容：
应助结果提醒方式：