Big Data最新文献

Research on Sports Injury Rehabilitation Detection Based on IoT Models for Digital Health Care.

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-17 DOI: 10.1089/big.2023.0134

Zhiyong Wu, Zhida Huang, Nianhua Tang, Kai Wang, Chuanjie Bian, Dandan Li, Vumika Kuraki, Felix Schmid

{"title":"Research on Sports Injury Rehabilitation Detection Based on IoT Models for Digital Health Care.","authors":"Zhiyong Wu, Zhida Huang, Nianhua Tang, Kai Wang, Chuanjie Bian, Dandan Li, Vumika Kuraki, Felix Schmid","doi":"10.1089/big.2023.0134","DOIUrl":"https://doi.org/10.1089/big.2023.0134","url":null,"abstract":"Physical therapists specializing in sports rehabilitation detection help injured athletes recover from their wounds and avoid further harm. Sports rehabilitators treat not just commonplace sports injuries but also work-related musculoskeletal injuries, discomfort, and disorders. Sensor-equipped Internet of Things (IoT) monitors the real-time location of medical equipment such as scooters, cardioverters, nebulizer treatments, oxygenation pumps, or other monitor gear. Analysis of medicine deployment across sites is possible in real time. Health care delivery based on digital technology to improve access, affordability, and sustainability of medical treatment is known as digital health care. The challenging characteristics of such sports injury rehabilitation for digital health care are playing position, game strategies, and cybersecurity. Hence, in this research, health care IoT-enabled body area networks (HIoT-BAN) have been designed to improve sports injury rehabilitation detection for digital health care. The health care sector may benefit significantly from IoT adoption since it allows for enhanced patient safety; health care investment management includes controlling the hospital's pharmaceutical stock and monitoring the heat and humidity levels. Digital health describes a group of programmers made to aid health care delivery, whether by assisting with clinical decision-making or streamlining back-end operations in health care institutions. A HIoT-BAN effectively predicts the rise in sports injury rehabilitation detection with faster digital health care based on IoT. The research concludes that the HIoT-BAN effectively indicates sports injury rehabilitation detection for digital health care. The experimental analysis of HIoT-BAN outperforms the IoT method in terms of performance, accuracy, prediction ratio, and mean square error rate.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142848096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Prognostic Modeling for Liver Cirrhosis Mortality Prediction and Real-Time Health Monitoring from Electronic Health Data.

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-09 DOI: 10.1089/big.2024.0071

Chengping Zhang, Muhammad Faisal Buland Iqbal, Imran Iqbal, Minghao Cheng, Nadia Sarhan, Emad Mahrous Awwad, Yazeed Yasin Ghadi

{"title":"Prognostic Modeling for Liver Cirrhosis Mortality Prediction and Real-Time Health Monitoring from Electronic Health Data.","authors":"Chengping Zhang, Muhammad Faisal Buland Iqbal, Imran Iqbal, Minghao Cheng, Nadia Sarhan, Emad Mahrous Awwad, Yazeed Yasin Ghadi","doi":"10.1089/big.2024.0071","DOIUrl":"https://doi.org/10.1089/big.2024.0071","url":null,"abstract":"Liver cirrhosis stands as a prominent contributor to mortality, impacting millions across the United States. Enabling health care providers to predict early mortality among patients with cirrhosis holds the potential to enhance treatment efficacy significantly. Our hypothesis centers on the correlation between mortality and laboratory test results along with relevant diagnoses in this patient cohort. Additionally, we posit that a deep learning model could surpass the predictive capabilities of the existing Model for End-Stage Liver Disease score. This research seeks to advance prognostic accuracy and refine approaches to address the critical challenges posed by cirrhosis-related mortality. This study evaluates the performance of an artificial neural network model for liver disease classification using various training dataset sizes. Through meticulous experimentation, three distinct training proportions were analyzed: 70%, 80%, and 90%. The model's efficacy was assessed using precision, recall, F1-score, accuracy, and support metrics, alongside receiver operating characteristic (ROC) and precision-recall (PR) curves. The ROC curves were quantified using the area under the curve (AUC) metric. Results indicated that the model's performance improved with an increased size of the training dataset. Specifically, the 80% training data model achieved the highest AUC, suggesting superior classification ability over the models trained with 70% and 90% data. PR analysis revealed a steep trade-off between precision and recall across all datasets, with 80% training data again demonstrating a slightly better balance. This is indicative of the challenges faced in achieving high precision with a concurrently high recall, a common issue in imbalanced datasets such as those found in medical diagnostics.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Social Listening for Product Design Requirement Analysis and Segmentation: A Graph Analysis Approach with User Comments Mining. 面向产品设计需求分析和细分的社会倾听:基于用户评论挖掘的图分析方法。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-01 Epub Date: 2023-09-04 DOI: 10.1089/big.2022.0021

Xinjun Lai, Guitao Huang, Ziyue Zhao, Shenhe Lin, Sheng Zhang, Huiyu Zhang, Qingxin Chen, Ning Mao

{"title":"Social Listening for Product Design Requirement Analysis and Segmentation: A Graph Analysis Approach with User Comments Mining.","authors":"Xinjun Lai, Guitao Huang, Ziyue Zhao, Shenhe Lin, Sheng Zhang, Huiyu Zhang, Qingxin Chen, Ning Mao","doi":"10.1089/big.2022.0021","DOIUrl":"10.1089/big.2022.0021","url":null,"abstract":"This study investigates customers' product design requirements through online comments from social media, and quickly translates these needs into product design specifications. First, the exponential discriminative snowball sampling method was proposed to generate a product-related subnetwork. Second, natural language processing (NLP) was utilized to mine user-generated comments, and a Graph SAmple and aggreGatE method was employed to embed the user's node neighborhood information in the network to jointly define a user's persona. Clustering was used for market and product model segmentation. Finally, a deep learning bidirectional long short-term memory with conditional random fields framework was introduced for opinion mining. A comment frequency-invert group frequency indicator was proposed to quantify all user groups' positive and negative opinions for various specifications of different product functions. A case study of smartphone design analysis is presented with data from a large Chinese online community called Baidu Tieba. Eleven layers of social relationships were snowball sampled, with 14,018 users and 30,803 comments. The proposed method produced a more reasonable user group clustering result than the conventional method. With our approach, user groups' dominating likes and dislikes for specifications could be immediately identified, and the similar and different preferences of product features by different user groups were instantly revealed. Managerial and engineering insights were also discussed.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"456-477"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10508327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IDLIQ: An Incremental Deterministic Finite Automaton Learning Algorithm Through Inverse Queries for Regular Grammar Inference. 基于逆查询的正则语法推理的增量确定性有限自动机学习算法。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-01 Epub Date: 2023-05-18 DOI: 10.1089/big.2022.0158

Farah Haneef, Muddassar A Sindhu

{"title":"IDLIQ: An Incremental Deterministic Finite Automaton Learning Algorithm Through Inverse Queries for Regular Grammar Inference.","authors":"Farah Haneef, Muddassar A Sindhu","doi":"10.1089/big.2022.0158","DOIUrl":"10.1089/big.2022.0158","url":null,"abstract":"We present an efficient incremental learning algorithm for Deterministic Finite Automaton (DFA) with the help of inverse query (IQ) and membership query (MQ). This algorithm is an extension of the Identification of Regular Languages (ID) algorithm from a complete to an incremental learning setup. The learning algorithm learns by making use of a set of labeled examples and by posing queries to a knowledgeable teacher, which is equipped to answer IQs along with MQs and equivalence query. Based on the examples (elements of the live complete set) and responses against IQs from the minimally adequate teacher (MAT), the learning algorithm constructs the hypothesis automaton, consistent with all observed examples. The Incremental DFA Learning algorithm through Inverse Queries (IDLIQ) takes <math><mstyle><mi>O</mi></mstyle><mrow><mo>(</mo><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo><mi>N</mi><mo>+</mo><mo>|</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>c</mi></mrow></msub><mo>|</mo><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>)</mo></mrow></math> time complexity in the presence of a MAT and ensures convergence to a minimal representation of the target DFA with finite number of labeled examples. Existing incremental learning algorithms; the Incremental ID, the Incremental Distinguishing Strings have polynomial (cubic) time complexity in the presence of a MAT. Therefore, sometimes, these algorithms even fail to learn large complex software systems. In this research work, we have reduced the complexity (from cubic to square form) of the DFA learning in an incremental setup. Finally, we prove the correctness and termination of the IDLIQ algorithm.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"446-455"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9492270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DGSLSTM: Deep Gated Stacked Long Short-Term Memory Neural Network for Traffic Flow Forecasting of Transportation Networks on Big Data Environment. DGSLSTM：用于大数据环境下交通网络流量预测的深度门控堆叠长短期记忆神经网络。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-01 Epub Date: 2022-02-10 DOI: 10.1089/big.2021.0013

Rajalakshmi Gurusamy, Siva Ranjani Seenivasan

{"title":"DGSLSTM: Deep Gated Stacked Long Short-Term Memory Neural Network for Traffic Flow Forecasting of Transportation Networks on Big Data Environment.","authors":"Rajalakshmi Gurusamy, Siva Ranjani Seenivasan","doi":"10.1089/big.2021.0013","DOIUrl":"10.1089/big.2021.0013","url":null,"abstract":"Deep learning and big data techniques have become increasingly popular in traffic flow forecasting. Deep neural networks have also been applied to traffic flow forecasting. Furthermore, it is difficult to determine whether neural networks can be used for accurate traffic flow prediction. Moreover, since the network model is poorly structured and the parameter optimization technique is inappropriate, the traffic flow prediction is inaccurate because of the lack of certainty. The proposed system overcomes these problems by combining multiple simple recurrent long short-term memory (LSTM) neural networks with time traits to predict traffic flow using a deep gated stacked neural network. To deepen the model, the hidden layers have been trained using an unsupervised layer-by-layer approach. This approach provides a systematic representation of the time series data. A systematic representation of hidden layers improves the accuracy of time series forecasting by capturing information at multiple levels. Furthermore, it emphasizes the importance of model structure, random weight initialization, and hyperparameters used in stacked LSTM to enhance predictive performance. The prediction efficacy of the deep gated stacked LSTM model is compared with that of the gated recurrent unit model and the stacked autoencoder model.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"504-517"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39906258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Customer Prioritization Integrated Supply Chain Optimization Model with Outsourcing Strategies. 具有外包策略的客户优先级集成供应链优化模型。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-01 Epub Date: 2022-04-29 DOI: 10.1089/big.2021.0292

Iram Mushtaq, Muhammad Umer, Muhammad Attique Khan, Seifedine Kadry

{"title":"Customer Prioritization Integrated Supply Chain Optimization Model with Outsourcing Strategies.","authors":"Iram Mushtaq, Muhammad Umer, Muhammad Attique Khan, Seifedine Kadry","doi":"10.1089/big.2021.0292","DOIUrl":"10.1089/big.2021.0292","url":null,"abstract":"Pre-COVID-19, most of the supply chains functioned with more capacity than demand. However, COVID-19 changed traditional supply chains' dynamics, resulting in more demand than their production capacity. This article presents a multiobjective and multiperiod supply chain network design along with customer prioritization, keeping in view price discounts and outsourcing strategies to deal with the situation when demand exceeds the production capacity. Initially, a multiperiod, multiobjective supply chain network is designed that incorporates prices discounts, customer prioritization, and outsourcing strategies. The main objectives are profit and prioritization maximization and time minimization. The introduction of the prioritization objective function having customer ranking as a parameter and considering less capacity than demand and outsourcing differentiates this model from the literature. A four-valued neutrosophic multiobjective optimization method is introduced to solve the model developed. To validate the model, a case study of the supply chain of a surgical mask is presented as the real-life application of research. The research findings are useful for the managers to make price discounts and preferred customer prioritization decisions under uncertainty and imbalance between supply and demand. In future, the logic in the proposed model can be used to create web application for optimal decision-making in supply chains.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":"1 1","pages":"413-428"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41616147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Internet of Things Data Visualization for Business Intelligence. 用于商业智能的物联网数据可视化。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-12-01 Epub Date: 2022-02-08 DOI: 10.1089/big.2021.0200

Sima Attar-Khorasani, Ricardo Chalmeta

引用次数: 0

DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction. DMHANT：用于信息传播预测的 DropMessage 超图注意力网络。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-10-23 DOI: 10.1089/big.2023.0131

Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan

{"title":"DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction.","authors":"Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan","doi":"10.1089/big.2023.0131","DOIUrl":"https://doi.org/10.1089/big.2023.0131","url":null,"abstract":"Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142512575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding. 利用组合本地特征和基于深度学习的节点嵌入，最大化社交网络中的影响力。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-10-22 DOI: 10.1089/big.2023.0117

Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu

{"title":"Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding.","authors":"Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu","doi":"10.1089/big.2023.0117","DOIUrl":"https://doi.org/10.1089/big.2023.0117","url":null,"abstract":"The influence maximization problem has several issues, including low infection rates and high time complexity. Many proposed methods are not suitable for large-scale networks due to their time complexity or free parameter usage. To address these challenges, this article proposes a local heuristic called Embedding Technique for Influence Maximization (ETIM) that uses shell decomposition, graph embedding, and reduction, as well as combined local structural features. The algorithm selects candidate nodes based on their connections among network shells and topological features, reducing the search space and computational overhead. It uses a deep learning-based node embedding technique to create a multidimensional vector of candidate nodes and calculates the dependency on spreading for each node based on local topological features. Finally, influential nodes are identified using the results of the previous phases and newly defined local features. The proposed algorithm is evaluated using the independent cascade model, showing its competitiveness and ability to achieve the best performance in terms of solution quality. Compared with the collective influence global algorithm, ETIM is significantly faster and improves the infection rate by an average of 12%.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142480288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Attribute-Based Adaptive Homomorphic Encryption for Big Data Security. 基于属性的大数据安全自适应同态加密。

IF 2.6 4区计算机科学

Big Data Pub Date : 2024-10-01 Epub Date: 2021-12-13 DOI: 10.1089/big.2021.0176

R Thenmozhi, S Shridevi, Sachi Nandan Mohanty, Vicente García-Díaz, Deepak Gupta, Prayag Tiwari, Mohammad Shorfuzzaman

{"title":"Attribute-Based Adaptive Homomorphic Encryption for Big Data Security.","authors":"R Thenmozhi, S Shridevi, Sachi Nandan Mohanty, Vicente García-Díaz, Deepak Gupta, Prayag Tiwari, Mohammad Shorfuzzaman","doi":"10.1089/big.2021.0176","DOIUrl":"10.1089/big.2021.0176","url":null,"abstract":"There is a drastic increase in Internet usage across the globe, thanks to mobile phone penetration. This extreme Internet usage generates huge volumes of data, in other terms, big data. Security and privacy are the main issues to be considered in big data management. Hence, in this article, Attribute-based Adaptive Homomorphic Encryption (AAHE) is developed to enhance the security of big data. In the proposed methodology, Oppositional Based Black Widow Optimization (OBWO) is introduced to select the optimal key parameters by following the AAHE method. By considering oppositional function, Black Widow Optimization (BWO) convergence analysis was enhanced. The proposed methodology has different processes, namely, process setup, encryption, and decryption processes. The researcher evaluated the proposed methodology with non-abelian rings and the homomorphism process in ciphertext format. Further, it is also utilized in improving one-way security related to the conjugacy examination issue. Afterward, homomorphic encryption is developed to secure the big data. The study considered two types of big data such as adult datasets and anonymous Microsoft web datasets to validate the proposed methodology. With the help of performance metrics such as encryption time, decryption time, key size, processing time, downloading, and uploading time, the proposed method was evaluated and compared against conventional cryptography techniques such as Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC). Further, the key generation process was also compared against conventional methods such as BWO, Particle Swarm Optimization (PSO), and Firefly Algorithm (FA). The results established that the proposed method is supreme than the compared methods and can be applied in real time in near future.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"343-356"},"PeriodicalIF":2.6,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39718084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0