Pub Date : 2014-02-01DOI: 10.1109/ICICES.2014.7033924
P. Bharathi, P. Kalaivaani
Due to the advanced technologies of Web 2.0, people are participating in and exchanging opinions through social media sites such as Web forums and Weblogs etc., Classification and Analysis of such opinions and sentiment information is potentially important for both service and product providers, users because this analysis is used for making valuable decisions. Sentiment is expressed differently in different domains. Applying a sentiment classifiers trained on source domain does not produce good performance on target domain because words that occur in the train domain might not appear in the test domain. We propose a hybrid model to detect sentiment and topics from text by using weakly supervised learning technique. First we create sentiment sensitive thesaurus using both labeled and unlabeled data from multiple domains. The created thesaurus is then used to classify sentiments from text. This model is highly portable to various domains. This is verified by experimental results from four different domains where the hybrid model even outperforms existing semi-supervised approaches.
{"title":"Sentiment classification using weakly supervised learning techniques","authors":"P. Bharathi, P. Kalaivaani","doi":"10.1109/ICICES.2014.7033924","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033924","url":null,"abstract":"Due to the advanced technologies of Web 2.0, people are participating in and exchanging opinions through social media sites such as Web forums and Weblogs etc., Classification and Analysis of such opinions and sentiment information is potentially important for both service and product providers, users because this analysis is used for making valuable decisions. Sentiment is expressed differently in different domains. Applying a sentiment classifiers trained on source domain does not produce good performance on target domain because words that occur in the train domain might not appear in the test domain. We propose a hybrid model to detect sentiment and topics from text by using weakly supervised learning technique. First we create sentiment sensitive thesaurus using both labeled and unlabeled data from multiple domains. The created thesaurus is then used to classify sentiments from text. This model is highly portable to various domains. This is verified by experimental results from four different domains where the hybrid model even outperforms existing semi-supervised approaches.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"12 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77127058","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034140
M. Vimalraj, B. Alex, M. Tamilarasi
In this paper investigations on a fixed speed wind farm with squirrel cage induction generators directly connected to the grid in combination with a StatCom under unbalanced grid voltage fault are given by means of theory and simulations. The stability of fixed speed wind turbines can be improved by a StatCom, which is well known and documented in literature for balanced grid voltage dips. Under unbalanced grid voltage dips the negative sequence voltage causes additional generator torque oscillations. A StatCom control structure with the capability to control the positive or negative sequence of the voltage is used. The simulation results clarify the effect of positive and negative sequence voltage compensation by a StatCom on the operation of a fixed speed wind farm. The influence of different StatCom control targets is investigated that lead to an increased network voltage stability and lower torque pulsations.
{"title":"StatCom control for voltage stability improvement at a fixed speed wind farm under unbalanced faults","authors":"M. Vimalraj, B. Alex, M. Tamilarasi","doi":"10.1109/ICICES.2014.7034140","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034140","url":null,"abstract":"In this paper investigations on a fixed speed wind farm with squirrel cage induction generators directly connected to the grid in combination with a StatCom under unbalanced grid voltage fault are given by means of theory and simulations. The stability of fixed speed wind turbines can be improved by a StatCom, which is well known and documented in literature for balanced grid voltage dips. Under unbalanced grid voltage dips the negative sequence voltage causes additional generator torque oscillations. A StatCom control structure with the capability to control the positive or negative sequence of the voltage is used. The simulation results clarify the effect of positive and negative sequence voltage compensation by a StatCom on the operation of a fixed speed wind farm. The influence of different StatCom control targets is investigated that lead to an increased network voltage stability and lower torque pulsations.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"247 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77527567","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033760
M. Shanthi, S. Suresh
We present an approach to detect a selfish node in a wireless network by passive monitoring. This does not require any access to the network nodes. Our approach requires deploying multiple sniffers across the network to capture wireless traffic traces among multiple channels. IEEE 802.11 networks support multiple channels, and a wireless interface can monitor only a single channel at one time. Thus, capturing all frames passing an interface on all channels is an impossible task, and we need strategies to capture the most representative sample. When a large area is to be monitored, several sniffers must be deployed, and these will typically overlap in their area of coverage. The goals of effective wireless monitoring are to capture as many frames as possible, while minimizing the number of those frames that are captured redundantly by more than one sniffer. The above goals May be addressed with a coordinated sampling strategy that directs neighboring sniffer to different channels during any period. These traces are then analyzed using hidden markov model to infer the misbehavior node in wifi networks.
{"title":"Detecting misbehavior node in Wifi networks by co-ordinated sampling of network monitoring","authors":"M. Shanthi, S. Suresh","doi":"10.1109/ICICES.2014.7033760","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033760","url":null,"abstract":"We present an approach to detect a selfish node in a wireless network by passive monitoring. This does not require any access to the network nodes. Our approach requires deploying multiple sniffers across the network to capture wireless traffic traces among multiple channels. IEEE 802.11 networks support multiple channels, and a wireless interface can monitor only a single channel at one time. Thus, capturing all frames passing an interface on all channels is an impossible task, and we need strategies to capture the most representative sample. When a large area is to be monitored, several sniffers must be deployed, and these will typically overlap in their area of coverage. The goals of effective wireless monitoring are to capture as many frames as possible, while minimizing the number of those frames that are captured redundantly by more than one sniffer. The above goals May be addressed with a coordinated sampling strategy that directs neighboring sniffer to different channels during any period. These traces are then analyzed using hidden markov model to infer the misbehavior node in wifi networks.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"27 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91085653","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033808
S. Sobitha Ahila, K. L. Shunmuganathan
Mobile agent systems are an active area of research with many issues still to be addressed before they achieve practical widespread use. Mobile agent is a mobile object that moves from host to host under the control of its own will to achieve task. Mobile agents are mainly intended to be used for applications distributed over large-scale networks since they permit reduction in communication costs by moving computation part to the host on which the target data resides. This paper gives an overview of the main security issues related to the mobile agent paradigm. These issues include security threats, requirements, and techniques for keeping the mobile agent platform and the agent itself secure against each other.
{"title":"Overview of mobile agent security issues — Solutions","authors":"S. Sobitha Ahila, K. L. Shunmuganathan","doi":"10.1109/ICICES.2014.7033808","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033808","url":null,"abstract":"Mobile agent systems are an active area of research with many issues still to be addressed before they achieve practical widespread use. Mobile agent is a mobile object that moves from host to host under the control of its own will to achieve task. Mobile agents are mainly intended to be used for applications distributed over large-scale networks since they permit reduction in communication costs by moving computation part to the host on which the target data resides. This paper gives an overview of the main security issues related to the mobile agent paradigm. These issues include security threats, requirements, and techniques for keeping the mobile agent platform and the agent itself secure against each other.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"32 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72868095","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034081
S. Aruna, K. S. Neelukumari
MISR architectures are proposed to remove the unknown (X) values in the output sequences. The MISR signature is represented as a system of linear equations in terms of unknown's (X). The method of symbolic simulation is used to represent each bit of the MISR signature. The combination of linear equations of the MISR signature bits is determined with Gauss-Jordan Elimination algorithm to remove unknown values in the output responses. These X-cancelled combinations are then computed in a separate storage register to provide X-free combinations values. Experimental result describes that maximum error coverage and test time can be obtained with the help of theses MISR architectures.
{"title":"MISR architectures to remove unknown values in output response compaction","authors":"S. Aruna, K. S. Neelukumari","doi":"10.1109/ICICES.2014.7034081","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034081","url":null,"abstract":"MISR architectures are proposed to remove the unknown (X) values in the output sequences. The MISR signature is represented as a system of linear equations in terms of unknown's (X). The method of symbolic simulation is used to represent each bit of the MISR signature. The combination of linear equations of the MISR signature bits is determined with Gauss-Jordan Elimination algorithm to remove unknown values in the output responses. These X-cancelled combinations are then computed in a separate storage register to provide X-free combinations values. Experimental result describes that maximum error coverage and test time can be obtained with the help of theses MISR architectures.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"77 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73810618","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034093
S. Marcia, R. Meenupriya, S. Priyadharshini, P. Bhuvaneswari
This paper investigates the sensing characteristics of the gas sensor. When Gas Sensor is subjected to ethanol gas, the corresponding analog voltage output is obtained. This analog voltage output is proportional to the concentration of the ethanol gas in the vicinity of the sensor. In order to enhance the accuracy of sensing, various analysis such as range analysis, orientation analysis and concentration analysis are performed. Based on the experimental results obtained, the optimal values for sensing in real time is determined. Further the response and recovery time of gas sensing characteristics is also measured to validate the usage of gas sensor in multi-sensing scenario.
{"title":"An experimental analysis to study the characteristic features of gas sensor","authors":"S. Marcia, R. Meenupriya, S. Priyadharshini, P. Bhuvaneswari","doi":"10.1109/ICICES.2014.7034093","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034093","url":null,"abstract":"This paper investigates the sensing characteristics of the gas sensor. When Gas Sensor is subjected to ethanol gas, the corresponding analog voltage output is obtained. This analog voltage output is proportional to the concentration of the ethanol gas in the vicinity of the sensor. In order to enhance the accuracy of sensing, various analysis such as range analysis, orientation analysis and concentration analysis are performed. Based on the experimental results obtained, the optimal values for sensing in real time is determined. Further the response and recovery time of gas sensing characteristics is also measured to validate the usage of gas sensor in multi-sensing scenario.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"51 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73373991","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033909
Yash Dave, Avani S. Shelat, Dhara Patel, R. Jhaveri
Cloud Computing provides a Computing environment where different resources, infrastructures, development platforms and software are delivered as a service to customers virtually on pay per time basis. Low cost, scalability, reliability, utility-based computing are important aspects of cloud computing. Job scheduling is an essential and most important part in any cloud environment. With increasing number of users, Job scheduling becomes a strenuous task. Ordering the jobs by scheduler while maintaining the balance between quality of services (QoS), efficiency and fairness of jobs is quite challenging. Scheduling algorithms are implemented considering parameters such as throughput, resource utilization, latency, cost, priority, computational time, physical distances, performance, bandwidth, resource availability. Though there are different scheduling algorithms available in cloud computing, a very less comparative study has been done on performance of various scheduling algorithms with respect to above mentioned parameters. This paper aims at a comparative study of various types of job scheduling algorithms that provide efficient cloud services.
{"title":"Various job scheduling algorithms in cloud computing: A survey","authors":"Yash Dave, Avani S. Shelat, Dhara Patel, R. Jhaveri","doi":"10.1109/ICICES.2014.7033909","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033909","url":null,"abstract":"Cloud Computing provides a Computing environment where different resources, infrastructures, development platforms and software are delivered as a service to customers virtually on pay per time basis. Low cost, scalability, reliability, utility-based computing are important aspects of cloud computing. Job scheduling is an essential and most important part in any cloud environment. With increasing number of users, Job scheduling becomes a strenuous task. Ordering the jobs by scheduler while maintaining the balance between quality of services (QoS), efficiency and fairness of jobs is quite challenging. Scheduling algorithms are implemented considering parameters such as throughput, resource utilization, latency, cost, priority, computational time, physical distances, performance, bandwidth, resource availability. Though there are different scheduling algorithms available in cloud computing, a very less comparative study has been done on performance of various scheduling algorithms with respect to above mentioned parameters. This paper aims at a comparative study of various types of job scheduling algorithms that provide efficient cloud services.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"128 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73323997","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034029
S. Mohan, N. Rangaswamy
This paper focuses on the design of 1 bit full adder circuit using Gate Diffusion Input Logic. The proposed adder schematics are developed using DSCH2 CAD tool, and their layouts are generated with Microwind 3 VLSI CAD tool. A 1 bit adder circuits are analyzed using standard CMOS 120nm features with corresponding voltage of 1.2V. The Simulated results of the proposed adder is compared with those of Pass transistor, Transmission Function, and CMOS based adder circuits. The proposed adder dissipates low power and responds faster.
{"title":"Performance analysis of 1 bit full adder using GDI logic","authors":"S. Mohan, N. Rangaswamy","doi":"10.1109/ICICES.2014.7034029","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034029","url":null,"abstract":"This paper focuses on the design of 1 bit full adder circuit using Gate Diffusion Input Logic. The proposed adder schematics are developed using DSCH2 CAD tool, and their layouts are generated with Microwind 3 VLSI CAD tool. A 1 bit adder circuits are analyzed using standard CMOS 120nm features with corresponding voltage of 1.2V. The Simulated results of the proposed adder is compared with those of Pass transistor, Transmission Function, and CMOS based adder circuits. The proposed adder dissipates low power and responds faster.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"8 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74460985","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034136
E. Porkodi, M. .. Kumar, J. Gobinath
The IEEE 802.11n-2009 based Wireless Local Area Networks (WLANs) standard presents very high data rate at the physical layer and seeks to attain a throughput at the Medium Access Control (MAC) layer that is higher than 100 Mbps. The mechanism of frame aggregation and Block-ACK frames are implemented to increase the MAC efficiency. However the standard does not introduce a mechanism to reduce the probability of collision. Where, with high data rate, an AP would able to serve more number of stations, which results in a high collision rate. This paper proposes a Group-based MAC (GMAC) scheme that minimizes the probability of collision and also applies frame aggregation to improve the efficiency. Here, grouping the contending station in such a way that each group has one station that is the group leader. This means that only the leader stations contend, hence, reduces the probability of a collision. We evaluate the performance of our proposal with analytic result. The result shows that GMAC attain a high throughput, high fairness, low delay and attains a high performance with high data rates.
{"title":"Implementing high throughput group-based MAC for WLANs","authors":"E. Porkodi, M. .. Kumar, J. Gobinath","doi":"10.1109/ICICES.2014.7034136","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034136","url":null,"abstract":"The IEEE 802.11n-2009 based Wireless Local Area Networks (WLANs) standard presents very high data rate at the physical layer and seeks to attain a throughput at the Medium Access Control (MAC) layer that is higher than 100 Mbps. The mechanism of frame aggregation and Block-ACK frames are implemented to increase the MAC efficiency. However the standard does not introduce a mechanism to reduce the probability of collision. Where, with high data rate, an AP would able to serve more number of stations, which results in a high collision rate. This paper proposes a Group-based MAC (GMAC) scheme that minimizes the probability of collision and also applies frame aggregation to improve the efficiency. Here, grouping the contending station in such a way that each group has one station that is the group leader. This means that only the leader stations contend, hence, reduces the probability of a collision. We evaluate the performance of our proposal with analytic result. The result shows that GMAC attain a high throughput, high fairness, low delay and attains a high performance with high data rates.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"38 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74579760","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033813
C. B. Saravanan, R. Sugumar
In the milieu of civil rights law, favoritism refers to undue or crooked healing of people based on affiliate-ship to a sort or a marginal, without gaze at to dignitary merit. Rules extract from statistics bases by in filament mining piece, such as classification or pact rules, when used for verdict tasks such as benefit or acclaim endorsement, can be prejudiced in the above sense. In this paper, the impression of inequitable classification rules is forging and premeditated. On stipulation that a pledge of non-favoritism is exposed to be a non-trivial task. A naive loom, like captivating away all bigoted constituencies, is exposed to be not ample when other milieu fluency is available. Loom lead to a strict formulation of the redlining crisis alongside with a ritual corollary pertaining to prejudiced rules with apparently safe ones by affluence of milieu acuity.
{"title":"Nepotism responsive of data mining for prejudice inimitability","authors":"C. B. Saravanan, R. Sugumar","doi":"10.1109/ICICES.2014.7033813","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033813","url":null,"abstract":"In the milieu of civil rights law, favoritism refers to undue or crooked healing of people based on affiliate-ship to a sort or a marginal, without gaze at to dignitary merit. Rules extract from statistics bases by in filament mining piece, such as classification or pact rules, when used for verdict tasks such as benefit or acclaim endorsement, can be prejudiced in the above sense. In this paper, the impression of inequitable classification rules is forging and premeditated. On stipulation that a pledge of non-favoritism is exposed to be a non-trivial task. A naive loom, like captivating away all bigoted constituencies, is exposed to be not ample when other milieu fluency is available. Loom lead to a strict formulation of the redlining crisis alongside with a ritual corollary pertaining to prejudiced rules with apparently safe ones by affluence of milieu acuity.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"20 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74885095","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
扫码关注我们
求助内容：
应助结果提醒方式：