In order to utilize computer resources efficiently, technologies have been developed to enable running multiple OSes on a single computer. In our study, we developed the Mint operating system, which enables running multiple Linux instances on a multi-core processor. Mint is different from traditional virtualization technologies in that Mint can achieve performance isolation between Linux instances by segmenting computer resources. Currently, Mint statically segments and assigns its physical memory to each Linux instance. By transferring physical memory ranges among the Linux instances depending on their physical memory utilization, Mint can adapt to the load variations. In this paper, we describe the requirements for segmentation and transfer of physical memory and provide a solution.
{"title":"Memory Segmentation and Transfer in Mint Operating System","authors":"K. Miyazaki, Y. Nomura, H. Taniguchi","doi":"10.1109/NBiS.2013.58","DOIUrl":"https://doi.org/10.1109/NBiS.2013.58","url":null,"abstract":"In order to utilize computer resources efficiently, technologies have been developed to enable running multiple OSes on a single computer. In our study, we developed the Mint operating system, which enables running multiple Linux instances on a multi-core processor. Mint is different from traditional virtualization technologies in that Mint can achieve performance isolation between Linux instances by segmenting computer resources. Currently, Mint statically segments and assigns its physical memory to each Linux instance. By transferring physical memory ranges among the Linux instances depending on their physical memory utilization, Mint can adapt to the load variations. In this paper, we describe the requirements for segmentation and transfer of physical memory and provide a solution.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878458","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}
Kuo-Feng Huang, Yi-Hsun Lin, Shao-Wei Tsao, Ying-Hong Wang
In traditional wireless sensor networks, the sensed data will be forwarded to sink by multi-hop, so that the hot spot problem will happen on the nodes near the sink. The power consumption of these nodes is higher than others, these nodes will be dead sooner. It leads to the network lifetime decreasing. We proposed a data transmission mechanism using mobile sink to solve this problem. We use two threshold values to prevent data overflow. If the data buffer of cluster head exceed to 1st threshold, the node will call sink to come and transmit data. If the sink didn't arrive the transmission range of the node, and the data buffer exceed to 2nd threshold. Instead of forwarding data to sink directly by multi-hop, we use forwarding data to cluster head of neighboring cluster to help buffer the exceeded data. It can decrease the number of node which has to help to help to forward data, so that it can decrease the power consumption of network, and prolong the network lifetime.
{"title":"Non-real Time Data Transmission Mechanism with Mobile Sink in Cluster-Based Wireless Sensor Networks","authors":"Kuo-Feng Huang, Yi-Hsun Lin, Shao-Wei Tsao, Ying-Hong Wang","doi":"10.1109/NBiS.2013.63","DOIUrl":"https://doi.org/10.1109/NBiS.2013.63","url":null,"abstract":"In traditional wireless sensor networks, the sensed data will be forwarded to sink by multi-hop, so that the hot spot problem will happen on the nodes near the sink. The power consumption of these nodes is higher than others, these nodes will be dead sooner. It leads to the network lifetime decreasing. We proposed a data transmission mechanism using mobile sink to solve this problem. We use two threshold values to prevent data overflow. If the data buffer of cluster head exceed to 1st threshold, the node will call sink to come and transmit data. If the sink didn't arrive the transmission range of the node, and the data buffer exceed to 2nd threshold. Instead of forwarding data to sink directly by multi-hop, we use forwarding data to cluster head of neighboring cluster to help buffer the exceeded data. It can decrease the number of node which has to help to help to forward data, so that it can decrease the power consumption of network, and prolong the network lifetime.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124293661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, the quantity of teletraffic is rapidly growing because of the explosive increase of Internet users and its applications. The needs of collection, storage, management, analysis, and measurement of the subsequent teletraffic have been emerged as one of very important issues. So far many studies for detecting anomaly teletraffic have been done. However, measurement and analysis studies for big data in cloud computing environments are not actively being made based on Hadoop. Thus, this paper presents for detecting anomaly teletraffic using stochastic self-similarity based on Hadoop. All simulations are conducted under control of our proposed platform, called ATM tool, for anomaly teletraffic intrusion detection system on Hadoop. Our numerical results show that the values of the estimated Hurst parameter obtained from the anomaly teletraffic are much higher when compared to ordinary local area network traffic.
{"title":"Detecting Anomaly Teletraffic Using Stochastic Self-Similarity Based on Hadoop","authors":"J. Lee, Sang-Kug Ye, H. Jeong","doi":"10.1109/NBiS.2013.43","DOIUrl":"https://doi.org/10.1109/NBiS.2013.43","url":null,"abstract":"In recent years, the quantity of teletraffic is rapidly growing because of the explosive increase of Internet users and its applications. The needs of collection, storage, management, analysis, and measurement of the subsequent teletraffic have been emerged as one of very important issues. So far many studies for detecting anomaly teletraffic have been done. However, measurement and analysis studies for big data in cloud computing environments are not actively being made based on Hadoop. Thus, this paper presents for detecting anomaly teletraffic using stochastic self-similarity based on Hadoop. All simulations are conducted under control of our proposed platform, called ATM tool, for anomaly teletraffic intrusion detection system on Hadoop. Our numerical results show that the values of the estimated Hurst parameter obtained from the anomaly teletraffic are much higher when compared to ordinary local area network traffic.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129651796","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}
With the adoption of cloud computing, a multitude of front-end mobile devices are emerging that require access to services in the cloud. Applications in the cloud are now commonly deployed as software as a service (SaaS). However, with the introduction of SaaS new security challenges need to be addressed. The challenge is to provide a single sign-on environment for services through an identity provider plus sufficient authorization granularity for backend services for the client applications to access. Through detailed discussion of the two standards (SAML 2.0 and OAuth 2.0) this paper presents a study how the two standards can provide a single sign-on solution for cloud computing. Furthermore, by outlining a case study/scenario of the two standards, the Federated Identity Access Broker Pattern for cloud computing is developed to present a solution for these security issues.
{"title":"Federated Identity Access Broker Pattern for Cloud Computing","authors":"Tim Reimer, P. Abraham, Qing Tan","doi":"10.1109/NBiS.2013.23","DOIUrl":"https://doi.org/10.1109/NBiS.2013.23","url":null,"abstract":"With the adoption of cloud computing, a multitude of front-end mobile devices are emerging that require access to services in the cloud. Applications in the cloud are now commonly deployed as software as a service (SaaS). However, with the introduction of SaaS new security challenges need to be addressed. The challenge is to provide a single sign-on environment for services through an identity provider plus sufficient authorization granularity for backend services for the client applications to access. Through detailed discussion of the two standards (SAML 2.0 and OAuth 2.0) this paper presents a study how the two standards can provide a single sign-on solution for cloud computing. Furthermore, by outlining a case study/scenario of the two standards, the Federated Identity Access Broker Pattern for cloud computing is developed to present a solution for these security issues.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125774513","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}
Masaru Miyazaki, Masanori Sano, M. Naemura, H. Sumiyoshi, S. Mitsuya, A. Fujii
The purpose of this study is to stimulate communication among the elderly population of Japan (where more than 21% of the population is aged 65 years and above) and to find ways to use their knowledge and labor skills with the aid of information and communications technology. Toward this end, we launched a joint research project called "Senior Cloud" in which we developed a prototype of a social TV system for the elderly. The first phase of the research project included a three-month field trial using the system in a local senior community. In this paper, we analyze the system log (posting and operational data) and the responses to questionnaires administered to obtain user impressions. These data reveal certain characteristics of communication among the elderly and methods that can stimulate it.
{"title":"A Social TV System for the Senior Community: Stimulating Elderly Communication Using Information and Communications Technology","authors":"Masaru Miyazaki, Masanori Sano, M. Naemura, H. Sumiyoshi, S. Mitsuya, A. Fujii","doi":"10.1109/NBiS.2013.68","DOIUrl":"https://doi.org/10.1109/NBiS.2013.68","url":null,"abstract":"The purpose of this study is to stimulate communication among the elderly population of Japan (where more than 21% of the population is aged 65 years and above) and to find ways to use their knowledge and labor skills with the aid of information and communications technology. Toward this end, we launched a joint research project called \"Senior Cloud\" in which we developed a prototype of a social TV system for the elderly. The first phase of the research project included a three-month field trial using the system in a local senior community. In this paper, we analyze the system log (posting and operational data) and the responses to questionnaires administered to obtain user impressions. These data reveal certain characteristics of communication among the elderly and methods that can stimulate it.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122636348","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}
H. Maeda, K. Yasumoto, Huili Chen, Kazuya Tomiura, Daichi Ogata
Post wall wave guide and photonic crystal wave guide are important structure for microwave transmission of integrated circuits with multi-layered substrates. It has simple periodic array of metallic or dielectric cylinders between parallel conducting plates for two-dimensional structure. In this study, return loss from branching part in Y-shaped wave guide was evaluated both numerically and experimentally for microwave. We successfully proposed an improvement method by shifting a post location at the branching part to reduce the return loss.
{"title":"Numerical and Experimental Study on Y-Shaped Branch Waveguide by Post Wall","authors":"H. Maeda, K. Yasumoto, Huili Chen, Kazuya Tomiura, Daichi Ogata","doi":"10.1109/NBiS.2013.84","DOIUrl":"https://doi.org/10.1109/NBiS.2013.84","url":null,"abstract":"Post wall wave guide and photonic crystal wave guide are important structure for microwave transmission of integrated circuits with multi-layered substrates. It has simple periodic array of metallic or dielectric cylinders between parallel conducting plates for two-dimensional structure. In this study, return loss from branching part in Y-shaped wave guide was evaluated both numerically and experimentally for microwave. We successfully proposed an improvement method by shifting a post location at the branching part to reduce the return loss.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126572698","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}
Identity-based encryption (IBE) and cryptographic systems based on IBE, timed-release encryption (TRE), attribute-based encryption (ABE), and functional encryption (FE), use information that identify individuals or groups (e.g., identities, attributes) for encryption and decryption. One significant advantage of FE is the fact that identity and attributes management leads to key management. If an infrastructure for managing identity and attributes existed, we could encrypt a message with identity and attributes (Functional Information, FI) for FE on it. With an infrastructure for FE, we can utilize existing FEs issued for FE and reduce the cost of issuing/managing a new FI only for FE. That is, we could regard FE as a service on the infrastructures in order to delegate management of FI to it. For PKG, a conventional IBE player, we propose a framework that divides it into three entities to enable it to correspond with complex FE systems that federate each function among several FE systems. We also examine use cases in which there are more than one instances of each entity in the same domain, and domain-use cases in which each entity coexists under multi-domain, and apply them to multiple FE systems among different domains. Consequently, we discover challenges that are not described in RFC 5408, also referred to as standardization scalability. On the basis of the use cases, to examine the management of these multi-domains, we develop ABE systems on ID management infrastructure with open protocols for authentication/authorization (OAuth and OpenID Connect) and demonstrate the feasibility of the framework in FE.
{"title":"Construction of a Multi-domain Functional Encryption System on Functional Information Infrastructure","authors":"Y. Niwa, Akira Kanaoka, E. Okamoto","doi":"10.1109/NBiS.2013.19","DOIUrl":"https://doi.org/10.1109/NBiS.2013.19","url":null,"abstract":"Identity-based encryption (IBE) and cryptographic systems based on IBE, timed-release encryption (TRE), attribute-based encryption (ABE), and functional encryption (FE), use information that identify individuals or groups (e.g., identities, attributes) for encryption and decryption. One significant advantage of FE is the fact that identity and attributes management leads to key management. If an infrastructure for managing identity and attributes existed, we could encrypt a message with identity and attributes (Functional Information, FI) for FE on it. With an infrastructure for FE, we can utilize existing FEs issued for FE and reduce the cost of issuing/managing a new FI only for FE. That is, we could regard FE as a service on the infrastructures in order to delegate management of FI to it. For PKG, a conventional IBE player, we propose a framework that divides it into three entities to enable it to correspond with complex FE systems that federate each function among several FE systems. We also examine use cases in which there are more than one instances of each entity in the same domain, and domain-use cases in which each entity coexists under multi-domain, and apply them to multiple FE systems among different domains. Consequently, we discover challenges that are not described in RFC 5408, also referred to as standardization scalability. On the basis of the use cases, to examine the management of these multi-domains, we develop ABE systems on ID management infrastructure with open protocols for authentication/authorization (OAuth and OpenID Connect) and demonstrate the feasibility of the framework in FE.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127603030","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}
There has been a paradigm shift in the way users interact with computerized systems and applications. This is driven by the increasing power and ubiquity of 'smart' mobile devices and the traction being generated in Cloud-based systems and the long-term evolution in service provision using Software-as-a-Service. These developments are supported by the rapid and far reaching developments in the related networking infrastructures. This paper considers the nature of Situational Awareness and addresses augmented context, Web 2.0, social media the Internet of Things, and the complexity of context. Mobile networks are considered with large-scale distributed systems and Cloud-based solutions. An illustration of the potential usage of collaborative interactions is presented to demonstrate the benefits which may be derived and the challenges faced. The paper closes with a discussion and conclusions including the identification of future directions for research and open research questions. The paper concludes that augmented context and Situational Awareness forms a central role in the effective provision of services going forward in Cloud-based systems accessed using mobile systems.
{"title":"Context and the Cloud: Situational Awareness in Mobile Systems","authors":"P. Moore, Mak Sharma, F. Xhafa, L. Barolli","doi":"10.1109/NBiS.2013.92","DOIUrl":"https://doi.org/10.1109/NBiS.2013.92","url":null,"abstract":"There has been a paradigm shift in the way users interact with computerized systems and applications. This is driven by the increasing power and ubiquity of 'smart' mobile devices and the traction being generated in Cloud-based systems and the long-term evolution in service provision using Software-as-a-Service. These developments are supported by the rapid and far reaching developments in the related networking infrastructures. This paper considers the nature of Situational Awareness and addresses augmented context, Web 2.0, social media the Internet of Things, and the complexity of context. Mobile networks are considered with large-scale distributed systems and Cloud-based solutions. An illustration of the potential usage of collaborative interactions is presented to demonstrate the benefits which may be derived and the challenges faced. The paper closes with a discussion and conclusions including the identification of future directions for research and open research questions. The paper concludes that augmented context and Situational Awareness forms a central role in the effective provision of services going forward in Cloud-based systems accessed using mobile systems.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126510808","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}
L. Barolli, Tao Yang, Elis Kulla, Shinji Sakamoto, Gjergji Mino
In this paper, we study the effect of mobile sink and mobile sensors in WSN performance. The WSNs should allow a systematic deployment of sensor nodes including mobility among them. The disseminated data from the sensor nodes are gathered at the sink node. Data dissemination is the major source for energy consumption in WSNs. We consider goodput, depletion and Routing Efficiency (RE) parameters to evaluate the performance of WSNs considering different speeds of mobile sink and sensor nodes. The simulation results show that when the network is congested (Tr is higher), the goodput decreases. For Static Sink (SS) scenario, the difference between evaluation parameters is not too much. For Moving Sink (MS) scenario, the goodput is higher for 10 m/s and RE is higher when moving speed is 5 m/s.
{"title":"Performance Comparison of Moving Sensors and Sink with Static Sink in WSNs","authors":"L. Barolli, Tao Yang, Elis Kulla, Shinji Sakamoto, Gjergji Mino","doi":"10.1109/NBiS.2013.104","DOIUrl":"https://doi.org/10.1109/NBiS.2013.104","url":null,"abstract":"In this paper, we study the effect of mobile sink and mobile sensors in WSN performance. The WSNs should allow a systematic deployment of sensor nodes including mobility among them. The disseminated data from the sensor nodes are gathered at the sink node. Data dissemination is the major source for energy consumption in WSNs. We consider goodput, depletion and Routing Efficiency (RE) parameters to evaluate the performance of WSNs considering different speeds of mobile sink and sensor nodes. The simulation results show that when the network is congested (Tr is higher), the goodput decreases. For Static Sink (SS) scenario, the difference between evaluation parameters is not too much. For Moving Sink (MS) scenario, the goodput is higher for 10 m/s and RE is higher when moving speed is 5 m/s.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In Elliptic Curve Cryptosystems (ECC), a scalar multiplication of a base point is the most time-consuming operation. Thus, a lot of improvemnets on the scalar multiplication algorithms have been proposed. In TwC 2013, Shirase introduced a new strategy for computing a scalar multiplication efficiently by transforming a base point to a new base point with its x-coordinate value 0 [Shi13]. In fact, Shirase showed that the strategy is efficient for ECADD in the projective coordinates. This paper applies Shirase's strategy to ECDBL in the projective coordinates, and to ECADD and ECDBL in the Jacobian coordinates, and evaluates the efficiency of Shirase's strategy for computing a scalar multiplication.
{"title":"Faster Scalar Multiplication for Elliptic Curve Cryptosystems","authors":"Y. Sakemi, T. Izu, Masaaki Shirase","doi":"10.1109/NBiS.2013.87","DOIUrl":"https://doi.org/10.1109/NBiS.2013.87","url":null,"abstract":"In Elliptic Curve Cryptosystems (ECC), a scalar multiplication of a base point is the most time-consuming operation. Thus, a lot of improvemnets on the scalar multiplication algorithms have been proposed. In TwC 2013, Shirase introduced a new strategy for computing a scalar multiplication efficiently by transforming a base point to a new base point with its x-coordinate value 0 [Shi13]. In fact, Shirase showed that the strategy is efficient for ECADD in the projective coordinates. This paper applies Shirase's strategy to ECDBL in the projective coordinates, and to ECADD and ECDBL in the Jacobian coordinates, and evaluates the efficiency of Shirase's strategy for computing a scalar multiplication.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124527285","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
扫码关注我们
求助内容：
应助结果提醒方式：