Pub Date : 2011-10-24DOI: 10.1109/iccit.2009.5407318
G. M. M. Bashir, A. S. M. L. Hoque
Computer Mediated Courseware (CMC) has been developed so far for individual courses considering single or multiple text books. A group of courseware can be developed by using multiple text books and in this case, it is a requirement to cluster the contents of different books to form a generalized clustered content. No work has been found to develop this generalized clustered content. We have proposed a methodology based on data mining techniques to construct a hierarchical general structure of a group of courseware combining the individual structure of a set of books. The clustering will help the courseware developer to dynamically allocate contents to develop different courses using a group of books. We have applied this methodology for different level of courses on database. The methodology is generalized and can be applied to any other courses.
{"title":"Content clustering of Computer Mediated Courseware using data mining technique","authors":"G. M. M. Bashir, A. S. M. L. Hoque","doi":"10.1109/iccit.2009.5407318","DOIUrl":"https://doi.org/10.1109/iccit.2009.5407318","url":null,"abstract":"Computer Mediated Courseware (CMC) has been developed so far for individual courses considering single or multiple text books. A group of courseware can be developed by using multiple text books and in this case, it is a requirement to cluster the contents of different books to form a generalized clustered content. No work has been found to develop this generalized clustered content. We have proposed a methodology based on data mining techniques to construct a hierarchical general structure of a group of courseware combining the individual structure of a set of books. The clustering will help the courseware developer to dynamically allocate contents to develop different courses using a group of books. We have applied this methodology for different level of courses on database. The methodology is generalized and can be applied to any other courses.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907108","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-01DOI: 10.1109/ICCIT.2009.5407140
I. Jahangir, D. Hasan, Shajid Islam, Nahian Alam Siddique, Mehedi Hasan
A completely new scheme for quaternary logic is proposed. Instead of conventional Fuzzy logic or Galois Field theory, the logic system is based on the extension of Boolean algebra. The logic is capable of handling both quaternary and coupled-binary inputs, where binary operands are coupled in pairs to form quaternary entities. All necessary operators are defined and several theorems and properties are derived to develop a way of expressing arbitrary truth tables with sum-of-product functions. To demonstrate the functionality of this novel logic scheme, some useful logic blocks such as decoder, multiplexer, and half-adder are designed.
{"title":"Development of a novel quaternary algebra with the design of some useful logic blocks","authors":"I. Jahangir, D. Hasan, Shajid Islam, Nahian Alam Siddique, Mehedi Hasan","doi":"10.1109/ICCIT.2009.5407140","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407140","url":null,"abstract":"A completely new scheme for quaternary logic is proposed. Instead of conventional Fuzzy logic or Galois Field theory, the logic system is based on the extension of Boolean algebra. The logic is capable of handling both quaternary and coupled-binary inputs, where binary operands are coupled in pairs to form quaternary entities. All necessary operators are defined and several theorems and properties are derived to develop a way of expressing arbitrary truth tables with sum-of-product functions. To demonstrate the functionality of this novel logic scheme, some useful logic blocks such as decoder, multiplexer, and half-adder are designed.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127112798","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-01DOI: 10.1109/ICCIT.2009.5407148
A. Sultana, Md. Naimul Hasan
Crosstalk is an intrinsic drawback of optical networks and avoiding crosstalk is important for making fruitful application of optical switching networks. Rearrangeable optical Multistage Interconnection Networks (MINs) are feasible since they have lower complexity than their strictly counterparts. In this paper, we propose a crosstalk free routing algorithm of optical MINs and we apply it to three examples of optical MINs, the Generalized Recursive Network (GRN), the Banyan Network and the Benes Network. The routing algorithm is derived based on the idea of the semi-permutation and it completes the decomposition of a permutation.
{"title":"A crosstalk free routing algorithm of optical Multistage Interconnection Networks","authors":"A. Sultana, Md. Naimul Hasan","doi":"10.1109/ICCIT.2009.5407148","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407148","url":null,"abstract":"Crosstalk is an intrinsic drawback of optical networks and avoiding crosstalk is important for making fruitful application of optical switching networks. Rearrangeable optical Multistage Interconnection Networks (MINs) are feasible since they have lower complexity than their strictly counterparts. In this paper, we propose a crosstalk free routing algorithm of optical MINs and we apply it to three examples of optical MINs, the Generalized Recursive Network (GRN), the Banyan Network and the Benes Network. The routing algorithm is derived based on the idea of the semi-permutation and it completes the decomposition of a permutation.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125127927","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-01DOI: 10.1109/ICCIT.2009.5407298
James Y. Xu, F. Alam
A cognitive radio (CR) is able to sense spectral environment over a wide range of frequencies, and provide opportunistic access to frequency bands temporarily unoccupied by an incumbent. Accurate channel sensing is the first important task for a CR, and energy detector is often used for this purpose. While a normal energy detector works well with well chosen window size based on prior knowledge about possible primary users, it often fails with signals that are narrow compared to the detector window, or if only a fraction of the signal is inside the detector window. We propose an adaptive energy detector that can adjust its detection window, and evaluate such detector's performance using experimental results obtained through a real time implementation.
{"title":"Adaptive energy detection for cognitive radio: An experimental study","authors":"James Y. Xu, F. Alam","doi":"10.1109/ICCIT.2009.5407298","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407298","url":null,"abstract":"A cognitive radio (CR) is able to sense spectral environment over a wide range of frequencies, and provide opportunistic access to frequency bands temporarily unoccupied by an incumbent. Accurate channel sensing is the first important task for a CR, and energy detector is often used for this purpose. While a normal energy detector works well with well chosen window size based on prior knowledge about possible primary users, it often fails with signals that are narrow compared to the detector window, or if only a fraction of the signal is inside the detector window. We propose an adaptive energy detector that can adjust its detection window, and evaluate such detector's performance using experimental results obtained through a real time implementation.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123747465","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-01DOI: 10.1109/ICCIT.2009.5407258
Rubaiyat Islam Rafat, K. Sakib
Excessive locking and cumulative updates in Distributed Shared Memory (DSM) not only reduces the parallelism for block access but also causes a serious degradation in response time for a dense network. This paper proposes a new consistency model in DSM named Last Update Consistency (LUC) model, where the model uses logical clock counter to keep the DSM consistent. The logical clock always increases never decreases. So the increasing order of the logical clock value is used to provide the request to the DSM. In this model, multiple nodes can perform READ operations over the same block at a time. For WRITE operation over the same block, only the last modification will exist and the earlier WRITE operations will be treated as obsolete WRITE and should be discarded. The experimental and analytical analysis showed that the proposed model effectively reduces the unnecessary network traffic and cumulative block updates that exist in the Sequential Consistency Model and Release Consistency Model.
{"title":"Logical clock based Last Update Consistency model for Distributed Shared Memory","authors":"Rubaiyat Islam Rafat, K. Sakib","doi":"10.1109/ICCIT.2009.5407258","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407258","url":null,"abstract":"Excessive locking and cumulative updates in Distributed Shared Memory (DSM) not only reduces the parallelism for block access but also causes a serious degradation in response time for a dense network. This paper proposes a new consistency model in DSM named Last Update Consistency (LUC) model, where the model uses logical clock counter to keep the DSM consistent. The logical clock always increases never decreases. So the increasing order of the logical clock value is used to provide the request to the DSM. In this model, multiple nodes can perform READ operations over the same block at a time. For WRITE operation over the same block, only the last modification will exist and the earlier WRITE operations will be treated as obsolete WRITE and should be discarded. The experimental and analytical analysis showed that the proposed model effectively reduces the unnecessary network traffic and cumulative block updates that exist in the Sequential Consistency Model and Release Consistency Model.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114490878","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-01DOI: 10.1109/ICCIT.2009.5407133
Md. Nazrul Islam, S. Haque, Kaji Masudul Alam, Md. Tarikuzzaman
Many malpractices in stock market trading e.g. price manipulation, circular trading, use the modus-operandi of collusion. Generally, a set of traders is a candidate collusion set when they are “trading heavily” among themselves in cross trading or circular trading. In real life not all colluders always trade with each other. In a perfectly circular collusion set of size 4, trader A will trade with B, B with C, C with D and D with A; there will be no cross trading among these traders. An existing method using shared, mutual nearest neighbor and collusion graph clustering algorithm fails to detect purely circular trading which is also a collusion set. In this paper, we have proposed a new approach to detect collusion sets using Markov Clustering Algorithm (MCL). Proposed method can detect purely circular collusions as well as cross trading collusions. We have used MCL at various strength of “residual value” to detect different cluster sets from the same stock flow graph. We have combined our collusion clusters with the existing method using Dempster Schafer theory of evidence. The experimental result shows that MCL algorithm provides better collusion clusters and the performance improved significantly.
{"title":"An approach to improve collusion set detection using MCL algorithm","authors":"Md. Nazrul Islam, S. Haque, Kaji Masudul Alam, Md. Tarikuzzaman","doi":"10.1109/ICCIT.2009.5407133","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407133","url":null,"abstract":"Many malpractices in stock market trading e.g. price manipulation, circular trading, use the modus-operandi of collusion. Generally, a set of traders is a candidate collusion set when they are “trading heavily” among themselves in cross trading or circular trading. In real life not all colluders always trade with each other. In a perfectly circular collusion set of size 4, trader A will trade with B, B with C, C with D and D with A; there will be no cross trading among these traders. An existing method using shared, mutual nearest neighbor and collusion graph clustering algorithm fails to detect purely circular trading which is also a collusion set. In this paper, we have proposed a new approach to detect collusion sets using Markov Clustering Algorithm (MCL). Proposed method can detect purely circular collusions as well as cross trading collusions. We have used MCL at various strength of “residual value” to detect different cluster sets from the same stock flow graph. We have combined our collusion clusters with the existing method using Dempster Schafer theory of evidence. The experimental result shows that MCL algorithm provides better collusion clusters and the performance improved significantly.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128354235","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-01DOI: 10.1109/ICCIT.2009.5407121
M. Rahim, Jieying Li
In recent years, Internet-based Banking (IB) applications are gaining popularity among retail banking customers. The long term success of these applications is however influenced by customer satisfaction because it affects customers' perceptions about banks' innovative ability and customer caring intentions. Hence, measuring customer satisfaction with IB applications is important. In this article, we report the development of an instrument to operationalise customer satisfaction following a rigorous mixed approach, and then apply that instrument to measure customer satisfaction with IB applications in Australia. Several interesting findings have emerged which are useful to research and practice alike.
{"title":"An empirical assessment of customer satisfaction with Internet Banking applications: An Australian experience","authors":"M. Rahim, Jieying Li","doi":"10.1109/ICCIT.2009.5407121","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407121","url":null,"abstract":"In recent years, Internet-based Banking (IB) applications are gaining popularity among retail banking customers. The long term success of these applications is however influenced by customer satisfaction because it affects customers' perceptions about banks' innovative ability and customer caring intentions. Hence, measuring customer satisfaction with IB applications is important. In this article, we report the development of an instrument to operationalise customer satisfaction following a rigorous mixed approach, and then apply that instrument to measure customer satisfaction with IB applications in Australia. Several interesting findings have emerged which are useful to research and practice alike.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128215350","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-01DOI: 10.1109/ICCIT.2009.5407265
K. Debnath, Jayanta kumar ahdikary, M. Shahjahan
This paper represents a currency recognition system using ensemble neural network (ENN). The individual neural networks (NN) in an ENN are trained via negative correlation learning. The object of using negative correlation learning (NCL) is to expertise the individuals in an ensemble on different parts or portion of input patterns. The available currencies in the market consist of new, old and noisy ones. It is often difficult for machine to recognize these currencies; therefore we propose a system that uses ENN to identify them. We performed our experiment for seven different types of TAKA (Bangladeshi currency) they are 2, 5, 10, 20, 50, 100 and 500 TAKA. The image of different types note is converted in gray scale and compressed in our desired range. Each pixel of the compressed image is given as an input to the network. This system is able to recognize highly noisy or old image of TAKA. Ensemble network is very useful for the classification of different types of currency. It reduces the chances of misclassification than a single network and ensemble network with independent training. In experimental results we have shown this. We also find good result for similar pattern available in market.
{"title":"A currency recognition system using negatively correlated neural network ensemble","authors":"K. Debnath, Jayanta kumar ahdikary, M. Shahjahan","doi":"10.1109/ICCIT.2009.5407265","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407265","url":null,"abstract":"This paper represents a currency recognition system using ensemble neural network (ENN). The individual neural networks (NN) in an ENN are trained via negative correlation learning. The object of using negative correlation learning (NCL) is to expertise the individuals in an ensemble on different parts or portion of input patterns. The available currencies in the market consist of new, old and noisy ones. It is often difficult for machine to recognize these currencies; therefore we propose a system that uses ENN to identify them. We performed our experiment for seven different types of TAKA (Bangladeshi currency) they are 2, 5, 10, 20, 50, 100 and 500 TAKA. The image of different types note is converted in gray scale and compressed in our desired range. Each pixel of the compressed image is given as an input to the network. This system is able to recognize highly noisy or old image of TAKA. Ensemble network is very useful for the classification of different types of currency. It reduces the chances of misclassification than a single network and ensemble network with independent training. In experimental results we have shown this. We also find good result for similar pattern available in market.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130372482","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-01DOI: 10.1109/ICCIT.2009.5407287
Md. Jahangir Alam, D. O'Shaughnessy, S. Selouani
There is an increasing interest in the development of robust quantitative speech quality measures that correlate well with subjective measures. This paper presents two objective criteria-the Perceptual Signal to Audible Noise Ratio (PSANR) and the Perceptual Signal to Audible Distortion Ratio (PSADR), to characterize the two kinds of degradation (i.e., residual background noise, speech distortion or both) in speech enhancement applications. For performance evaluation of speech enhancement algorithms it is necessary to determine with accuracy the kind of degradation present in the enhanced signal. Experimental results for speech enhancement using different well-known approaches depict the usefulness of the proposed objective criteria.
{"title":"Novel objective criteria for perceptual separation of two kinds of Distortion in speech enhancement applications","authors":"Md. Jahangir Alam, D. O'Shaughnessy, S. Selouani","doi":"10.1109/ICCIT.2009.5407287","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407287","url":null,"abstract":"There is an increasing interest in the development of robust quantitative speech quality measures that correlate well with subjective measures. This paper presents two objective criteria-the Perceptual Signal to Audible Noise Ratio (PSANR) and the Perceptual Signal to Audible Distortion Ratio (PSADR), to characterize the two kinds of degradation (i.e., residual background noise, speech distortion or both) in speech enhancement applications. For performance evaluation of speech enhancement algorithms it is necessary to determine with accuracy the kind of degradation present in the enhanced signal. Experimental results for speech enhancement using different well-known approaches depict the usefulness of the proposed objective criteria.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697987","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-01DOI: 10.1109/ICCIT.2009.5407161
Md. Shamim Ahsan, M. Lee, S. Newaz, S. M. Asif
Due to the rapid growth of Internet with new generation of services and applications, demand for faster and cheaper access network has been rising. To address the present and future demand, broadband fiber access technologies such as passive optical networks (PONs) are a potential solution. Mostly, time division multiplexed (TDM)-PON is deployed in all parts of the world. In order to mitigate the future demand, some next-generation PON systems have been investigated by the researchers. In this paper, we examine the current status of PONs and investigate the probable future PONs. We also explain the smooth migration process from the current status to the future technologies. Architecture of a self-restored tree-type hybrid wavelength division multiplexed/TDM-PON (WDM/TDM-PON) has been proposed, for migrating from TDM to WDM-PON. Due to the restorable capacity of the architecture, the availability of the system is increased. In addition, cost analysis of different PON architectures are performed and compared with the cost of the proposed architecture. It is found that, the proposed architecture provides more cost effective solution.
{"title":"Migration to the next generation passive optical network","authors":"Md. Shamim Ahsan, M. Lee, S. Newaz, S. M. Asif","doi":"10.1109/ICCIT.2009.5407161","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407161","url":null,"abstract":"Due to the rapid growth of Internet with new generation of services and applications, demand for faster and cheaper access network has been rising. To address the present and future demand, broadband fiber access technologies such as passive optical networks (PONs) are a potential solution. Mostly, time division multiplexed (TDM)-PON is deployed in all parts of the world. In order to mitigate the future demand, some next-generation PON systems have been investigated by the researchers. In this paper, we examine the current status of PONs and investigate the probable future PONs. We also explain the smooth migration process from the current status to the future technologies. Architecture of a self-restored tree-type hybrid wavelength division multiplexed/TDM-PON (WDM/TDM-PON) has been proposed, for migrating from TDM to WDM-PON. Due to the restorable capacity of the architecture, the availability of the system is increased. In addition, cost analysis of different PON architectures are performed and compared with the cost of the proposed architecture. It is found that, the proposed architecture provides more cost effective solution.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123337934","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
扫码关注我们
求助内容：
应助结果提醒方式：