Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285832
Souheila Boudouda, Mahmoud Boufaïda
Modeling and managing Supply chain management systems that span multiple organizations involves new challenges, mainly regarding the ability to cope with change on the wide variety of languages and technologies which are heterogeneous in permanent evolution. The goal of our work is to contribute to the field of modeling and designing Supply chain management systems. Let's put forward a methodological approach which is based on four aspects (resource aspect, organizational aspect, functional aspect and interaction aspect) and which uses the multi agents system to model their different actors. Each actor in the proposed model is represented by a subsystem. They interact with each other to accomplish their tasks using two types of interaction, internal and external. They can communicate, negotiate and collaborate through a communication interface in order to discuss and negotiate the stocks, make the system more responsive and reduce inventory carrying costs.
{"title":"A methodological approach for modeling supply chain management","authors":"Souheila Boudouda, Mahmoud Boufaïda","doi":"10.1109/ICCITECHNOL.2012.6285832","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285832","url":null,"abstract":"Modeling and managing Supply chain management systems that span multiple organizations involves new challenges, mainly regarding the ability to cope with change on the wide variety of languages and technologies which are heterogeneous in permanent evolution. The goal of our work is to contribute to the field of modeling and designing Supply chain management systems. Let's put forward a methodological approach which is based on four aspects (resource aspect, organizational aspect, functional aspect and interaction aspect) and which uses the multi agents system to model their different actors. Each actor in the proposed model is represented by a subsystem. They interact with each other to accomplish their tasks using two types of interaction, internal and external. They can communicate, negotiate and collaborate through a communication interface in order to discuss and negotiate the stocks, make the system more responsive and reduce inventory carrying costs.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131316114","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285773
Nassima Aleb, Samir Kechid
The aim of this paper is to present a new method for automated software testing as a cloud computing service. Unlike actual testing services, our goal is to provide a fully automated testing without human involvement from the service user's or provider's side. We use a program modeling allowing an easy symbolic execution and a scalable parallelization of the testing. Programs are divided into several parts assigned to different nodes (Workers) of the cloud. A particular node (Coordinator) allocates tasks to Workers and collects the final results.
{"title":"Path coverage testing in the cloud","authors":"Nassima Aleb, Samir Kechid","doi":"10.1109/ICCITECHNOL.2012.6285773","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285773","url":null,"abstract":"The aim of this paper is to present a new method for automated software testing as a cloud computing service. Unlike actual testing services, our goal is to provide a fully automated testing without human involvement from the service user's or provider's side. We use a program modeling allowing an easy symbolic execution and a scalable parallelization of the testing. Programs are divided into several parts assigned to different nodes (Workers) of the cloud. A particular node (Coordinator) allocates tasks to Workers and collects the final results.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121137869","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285779
S. Primak
This paper presents a dynamic model of a Primary User and joint Primary-Secondary Users dynamic models. Analytical solutions and markov approximations are derived based on the traffic and channel parameters. The suggested models will be used in energy efficient design of spectrum sensing in cognitive networks.
{"title":"On a dynamic model of cognitive radio systems","authors":"S. Primak","doi":"10.1109/ICCITECHNOL.2012.6285779","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285779","url":null,"abstract":"This paper presents a dynamic model of a Primary User and joint Primary-Secondary Users dynamic models. Analytical solutions and markov approximations are derived based on the traffic and channel parameters. The suggested models will be used in energy efficient design of spectrum sensing in cognitive networks.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125483816","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285769
N. Hammami, M. Bedda, N. Farah
Mel Frequency Cepstral Coefficients (MFCCs) are the most popularly used speech features in many speech and speaker recognition applications. In this paper, we study the effect of the second-order derivatives of MFCC on the recognition of the Spoken Arabic digits. The system was developed using the Hidden Markov Models (HMMs) and Tree distribution approximation model. Experimentally it has been shown that, the second-order derivatives of MFCC parameters compared to the MFCC yield improved rates of 4.60% for CHMM. We were able to reach an overall recognition accuracy of 98.41%, which is satisfactory compared to previous work on spoken Arabic digits speech recognition.
{"title":"The second-order derivatives of MFCC for improving spoken Arabic digits recognition using Tree distributions approximation model and HMMs","authors":"N. Hammami, M. Bedda, N. Farah","doi":"10.1109/ICCITECHNOL.2012.6285769","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285769","url":null,"abstract":"Mel Frequency Cepstral Coefficients (MFCCs) are the most popularly used speech features in many speech and speaker recognition applications. In this paper, we study the effect of the second-order derivatives of MFCC on the recognition of the Spoken Arabic digits. The system was developed using the Hidden Markov Models (HMMs) and Tree distribution approximation model. Experimentally it has been shown that, the second-order derivatives of MFCC parameters compared to the MFCC yield improved rates of 4.60% for CHMM. We were able to reach an overall recognition accuracy of 98.41%, which is satisfactory compared to previous work on spoken Arabic digits speech recognition.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128744585","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285814
Khlifi Nesrine, M. B. Jemaa
Wireless Sensors Networks (WSN) are increasingly used in various applications such as environment tracking, health monitoring, industrial control and intrusion detection applications. WSN consists of small-sized nodes, deployed generally in inaccessible environment to the human, in order to collect information about it. These motes are autonomous and work with battery. The critical characteristic of these networks is energy, which is their main design constraint to increase their lifetime. Energy consumption has a major impact on all levels: application software, motes (software and hardware) routing and communication channel. This paper proposes a new routing mechanism to reduce energy consumption in WSNs, and subsequently increasing their lifetime. In particular, we describe a new routing protocol named: Hierarchical Energy Efficient Routing Protocol (HEERP). Using computer simulations, we show that HEERP outperforms LEACH, is the most existing popular routing pool.
{"title":"HEERP: Hierarchical energy efficient routing protocol for Wireless Sensor Networks","authors":"Khlifi Nesrine, M. B. Jemaa","doi":"10.1109/ICCITECHNOL.2012.6285814","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285814","url":null,"abstract":"Wireless Sensors Networks (WSN) are increasingly used in various applications such as environment tracking, health monitoring, industrial control and intrusion detection applications. WSN consists of small-sized nodes, deployed generally in inaccessible environment to the human, in order to collect information about it. These motes are autonomous and work with battery. The critical characteristic of these networks is energy, which is their main design constraint to increase their lifetime. Energy consumption has a major impact on all levels: application software, motes (software and hardware) routing and communication channel. This paper proposes a new routing mechanism to reduce energy consumption in WSNs, and subsequently increasing their lifetime. In particular, we describe a new routing protocol named: Hierarchical Energy Efficient Routing Protocol (HEERP). Using computer simulations, we show that HEERP outperforms LEACH, is the most existing popular routing pool.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132398162","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285820
A. Gallas, W. Barhoumi, E. Zagrouba
Avoiding the “curse of dimensionality” in contentbased image retrieval becomes one of the most essential tasks to achieve because of the high number of stocked images as well as the high dimensionality of the descriptive vectors' space. In this context, our work consists on minimizing low-level features describing an image by using a reduced descriptor that combines color and texture information which is wavelet transformation. In fact, we propose to describe the image by high frequency subbands of discrete wavelet transformation (DWT) related to weighted salient regions after a fuzzy segmentation step. Moreover, images comparison guided by the most weighted regions is presented. Experiments and comparative study with other similar works prove the efficiency of the proposed approach for image retrieval in heterogeneous image bases.
{"title":"Image retrieval based on wavelet sub-bands and fuzzy weighted regions","authors":"A. Gallas, W. Barhoumi, E. Zagrouba","doi":"10.1109/ICCITECHNOL.2012.6285820","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285820","url":null,"abstract":"Avoiding the “curse of dimensionality” in contentbased image retrieval becomes one of the most essential tasks to achieve because of the high number of stocked images as well as the high dimensionality of the descriptive vectors' space. In this context, our work consists on minimizing low-level features describing an image by using a reduced descriptor that combines color and texture information which is wavelet transformation. In fact, we propose to describe the image by high frequency subbands of discrete wavelet transformation (DWT) related to weighted salient regions after a fuzzy segmentation step. Moreover, images comparison guided by the most weighted regions is presented. Experiments and comparative study with other similar works prove the efficiency of the proposed approach for image retrieval in heterogeneous image bases.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134166590","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285836
Yu Ting Sun, Jia-Chin Lin
Orthogonal frequency-division multiplexing (OFDM) communication is a promising technique for use in fourth-generation (4G) mobile communications. Meanwhile, the carrier aggregation technique becomes crucial for raising the transmission rate. The achievable data rate of an OFDM system is generally limited by spectral efficiency and the available bandwidth; the former strongly depends on the adopted modulation techniques, and the latter strongly depends on the spectrum policy. A carrier aggregation method is a feasible and flexible bandwidth utilization technique that facilitates upgrades to transmission throughput by aggregating several contiguous or non-contiguous carriers. Unlike conventional OFDM systems, multiple carrier frequency offsets (CFOs) must be taken into consideration for carrier-aggregated OFDM (CA-OFDM) communications. Several preambles are constructed as pilots for individual component carriers. With knowledge of the preamble property, novel estimation methods for multiple CFOs are proposed and investigated by taking advantage of either a multiple signal classification (MUSIC) or a root-MUSIC algorithm. Simulation results show that the proposed method can achieve good performance in terms of the error rate of detection and the mean-square error (MSE) over time-varying multipath fading channels. With assistance from the accurate multi-CFO estimation and compensation proposed in this paper, the carrier aggregation, which is conventionally accomplished on the medium access control (MAC) layer with a few parallel, ordinary OFDM inner receivers, can be effectively transformed to be a physical-layer (PHY) multiplexing technique by means of a larger-size fast Fourier transform (FFT) demodulation. This transformation can reduce the implementation overhead needed by independently building several parallel ordinary inner receivers. This transformation can also save the header length prefixed on the MAC layer for conducting carrier aggregations.
{"title":"Multi-carrier frequency-offset estimation based on MUSIC for carrier-aggregation orthogonal frequency-division multiplexing communications","authors":"Yu Ting Sun, Jia-Chin Lin","doi":"10.1109/ICCITECHNOL.2012.6285836","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285836","url":null,"abstract":"Orthogonal frequency-division multiplexing (OFDM) communication is a promising technique for use in fourth-generation (4G) mobile communications. Meanwhile, the carrier aggregation technique becomes crucial for raising the transmission rate. The achievable data rate of an OFDM system is generally limited by spectral efficiency and the available bandwidth; the former strongly depends on the adopted modulation techniques, and the latter strongly depends on the spectrum policy. A carrier aggregation method is a feasible and flexible bandwidth utilization technique that facilitates upgrades to transmission throughput by aggregating several contiguous or non-contiguous carriers. Unlike conventional OFDM systems, multiple carrier frequency offsets (CFOs) must be taken into consideration for carrier-aggregated OFDM (CA-OFDM) communications. Several preambles are constructed as pilots for individual component carriers. With knowledge of the preamble property, novel estimation methods for multiple CFOs are proposed and investigated by taking advantage of either a multiple signal classification (MUSIC) or a root-MUSIC algorithm. Simulation results show that the proposed method can achieve good performance in terms of the error rate of detection and the mean-square error (MSE) over time-varying multipath fading channels. With assistance from the accurate multi-CFO estimation and compensation proposed in this paper, the carrier aggregation, which is conventionally accomplished on the medium access control (MAC) layer with a few parallel, ordinary OFDM inner receivers, can be effectively transformed to be a physical-layer (PHY) multiplexing technique by means of a larger-size fast Fourier transform (FFT) demodulation. This transformation can reduce the implementation overhead needed by independently building several parallel ordinary inner receivers. This transformation can also save the header length prefixed on the MAC layer for conducting carrier aggregations.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267828","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285816
I. Amdouni, P. Minet
In data gathering applications which is a typical application paradigm in wireless sensor networks, sensor nodes may have different traffic demands. Assigning equal channel access to each node may lead to congestion, inefficient use of the bandwidth and decrease of the application performance. In this paper, we prove that the time slot assignment problem is NP-complete when p-hop nodes are not assigned the same slot, with 1 ≤ p ≤ h for any strictly positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment algorithm able to allocate slots to sensors proportionally to their demand. We evaluate the performance of TRASA for different heuristics and prove that it provides an optimized spatial reuse and a minimized cycle length.
{"title":"TRASA: Traffic aware slot assignment algorithm in wireless sensor networks","authors":"I. Amdouni, P. Minet","doi":"10.1109/ICCITECHNOL.2012.6285816","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285816","url":null,"abstract":"In data gathering applications which is a typical application paradigm in wireless sensor networks, sensor nodes may have different traffic demands. Assigning equal channel access to each node may lead to congestion, inefficient use of the bandwidth and decrease of the application performance. In this paper, we prove that the time slot assignment problem is NP-complete when p-hop nodes are not assigned the same slot, with 1 ≤ p ≤ h for any strictly positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment algorithm able to allocate slots to sensors proportionally to their demand. We evaluate the performance of TRASA for different heuristics and prove that it provides an optimized spatial reuse and a minimized cycle length.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603525","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285828
Jamal Abu Rrub, Jamil Al-Jabi, K. El-Khatib
Radio frequency identification (RFID) found its way very quickly in different industries. Supply chain was the pioneer adopter of the technology, and as a result, inventory and goods tracking cost decreased while the tracking speed and accuracy increased. Although the healthcare sector could highly benefit from the RFID technology specifically in increasing patients' safety, it is still having difficulties due to different concerns in security, privacy, radio frequency interference with medical equipments and trust to list a few. This paper looks at enabling security framework for RFID technology in contactless payment module used in credit cards, and how this infrastructure can be partially used to design a secure, practical and cost effective solution for the healthcare sector.
{"title":"Security model for real time tracking system (RTLS) in the healthcare sector","authors":"Jamal Abu Rrub, Jamil Al-Jabi, K. El-Khatib","doi":"10.1109/ICCITECHNOL.2012.6285828","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285828","url":null,"abstract":"Radio frequency identification (RFID) found its way very quickly in different industries. Supply chain was the pioneer adopter of the technology, and as a result, inventory and goods tracking cost decreased while the tracking speed and accuracy increased. Although the healthcare sector could highly benefit from the RFID technology specifically in increasing patients' safety, it is still having difficulties due to different concerns in security, privacy, radio frequency interference with medical equipments and trust to list a few. This paper looks at enabling security framework for RFID technology in contactless payment module used in credit cards, and how this infrastructure can be partially used to design a secure, practical and cost effective solution for the healthcare sector.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053528","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285783
H. Fathallah, A. Helmy
Long-Reach passive optical networks (LR-PONs) suffer from extremely long propagation delays that degrade the performance of centralized algorithms proposed for upstream bandwidth-allocation in traditional PONs. In this paper, we analyze the performance of two centralized dynamic bandwidth allocation algorithms; so called online interleaved polling and offline multi-thread polling, recently proposed in the literature for LR-PON. We investigate their performances in terms of packet pre-transmission delay. Simulation results show that although multi-thread polling succeeds in decreasing reporting and queuing delays, interleaved polling keeps a lower grant delay and therefore has better overall delay performance.
{"title":"Analyzing the performance of centralized polling for long-reach passive optical networks","authors":"H. Fathallah, A. Helmy","doi":"10.1109/ICCITECHNOL.2012.6285783","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285783","url":null,"abstract":"Long-Reach passive optical networks (LR-PONs) suffer from extremely long propagation delays that degrade the performance of centralized algorithms proposed for upstream bandwidth-allocation in traditional PONs. In this paper, we analyze the performance of two centralized dynamic bandwidth allocation algorithms; so called online interleaved polling and offline multi-thread polling, recently proposed in the literature for LR-PON. We investigate their performances in terms of packet pre-transmission delay. Simulation results show that although multi-thread polling succeeds in decreasing reporting and queuing delays, interleaved polling keeps a lower grant delay and therefore has better overall delay performance.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382291","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
扫码关注我们
求助内容：
应助结果提醒方式：