检索结果-内蒙古大学图书馆

Predictive performance of ROX index and its variations for NIV failure

Medicina intensiva 2025年 502136页

作者： Lada Lijović Tomislav Radočaj Nataša Kovač Marinko Vučić Paul Elbers Department of Intensive Care Medicine Laboratory for Critical Care Computational Intelligence Amsterdam Medical Data Science Amsterdam Public Health Amsterdam Cardiovascular Science Amsterdam Institute for Infection and Immunity Amsterdam UMC University of Amsterdam Vrije Universiteit Amsterdam The Netherlands Department of Anesthesiology Intensive Care and Pain Management Sestre Milosrdnice University Hospital Center Zagreb Croatia. Electronic address: l.lijovic@amsterdamumc.nl. Department of Anesthesiology Intensive Care and Pain Management Sestre Milosrdnice University Hospital Center Zagreb Croatia. Department of Intensive Care Medicine Laboratory for Critical Care Computational Intelligence Amsterdam Medical Data Science Amsterdam Public Health Amsterdam Cardiovascular Science Amsterdam Institute for Infection and Immunity Amsterdam UMC University of Amsterdam Vrije Universiteit Amsterdam The Netherlands.

OBJECTIVE:To determine whether the ROX index and its variations can predict the risk of intubation in ICU patients receiving NIV ventilation using large public ICU databases. DESIGN:Retrospective observational cohort study. SETTING:Patient data was extracted from both the AmsterdamUMCdb and the MIMIC-IV ICU databases, which contained data related to 20,109 and 50,920 unique patients. PATIENTS:Non-invasively mechanically ventilated. INTERVENTIONS:Retrospective review of variables. MAIN VARIABLES OF INTEREST:To assess the predictive values of models for each index, the ROX and its variations mROX, ROX-HR and mROX-HR were calculated based on mean values of SpO, respiratory rate, FiO and PaO from 2-h windows within the first 12 h of NIV. RESULTS:3344 patients were eligible for analysis of which 1344 were intubated, died or returned to NIV within 24 h of ending NIV. NIV failure group had higher SOFA scores and higher CRP levels at admission. There was no difference in duration of NIV therapy or 28-day mortality, but patients who failed NIV had longer length of stay. The best performing index was ROX with an AUROC of 0.626 at 10-12 h. All other indices for all other time windows were less discriminating. CONCLUSIONS:The performance of ROX index and its variations to predict NIV failure in ICU patients across large public ICU databases was moderate at best and cannot currently be recommended for clinical decision support.

关键词： Bases de datos Big data Critical care Cuidado intensivo database Insuficiencia respiratoria Noninvasive ventilation Respiratory failure Ventilación no invasiva

来源：评论

学校读者我要写书评

暂无评论

Tensor BM-Decomposition for Compression and Analysis of Video data

arXiv

引用

arXiv 2023年

作者： Tian, Fan Kilmer, Misha E. Miller, Eric Patra, Abani Department of Mathematics Tufts University MedfordMA02115 United States Electrical and Computer Engineering Tufts University MedfordMA02115 United States Computer Science Department Tufts University MedfordMA02115 United States Data Intensive Studies Center Tufts University MedfordMA02115 United States Tufts Institute for Artificial Intelligence Tufts University MedfordMA02115 United States

Given tensors A, B, C of size m × 1 × n, m × p × 1, and 1 × p × n, respectively, their Bhattacharya-Mesner (BM) product will result in a third-order tensor of dimension m × p × ... 详细信息

Given tensors A, B, C of size m × 1 × n, m × p × 1, and 1 × p × n, respectively, their Bhattacharya-Mesner (BM) product will result in a third-order tensor of dimension m × p × n and BM-rank of 1 (Mesner and Bhattacharya, 1990). Thus, if an arbitrary m × p × n third-order tensor can be written as a sum of a small number, relative to m, p, n, of such BM-rank 1 terms, this BM-decomposition (BMD) offers an implicitly compressed representation of the tensor. In this paper, we first show that grayscale surveillance video can be accurately captured by a low BM-rank decomposition and give methods for efficiently computing this decomposition. To this end, we first give results that connect rank-revealing matrix factorizations to the BMD. Next, we present a generative model that illustrates that spatio-temporal video data can be expected to have low BM-rank. We combine these observations to derive a regularized alternating least squares (ALS) algorithm to compute an approximate BMD of the video tensor. The algorithm itself is highly parallelizable since the bulk of the computations break down into relatively small regularized least squares problems that can be solved independently. We study the ability of our algorithm to separate the video data into stationary and non-stationary components while simultaneously compressing the data. We then introduce a new type of BM-product suitable for color video and provide an algorithm that shows an impressive ability to extract important temporal information from color video while simultaneously compressing the data. Extensive numerical results compared against the state-of-the-art matrix-based DMD for surveillance video separation show our algorithms can consistently produce results with superior compression properties while simultaneously providing better separation of stationary and non-stationary features in the data. © 2023, CC BY.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Position: Bayesian deep learning is needed in the age of large-scale AI 24

Position: Bayesian deep learning is needed in the age of lar...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Theodore Papamarkou Maria Skoularidou Konstantina Palla Laurence Aitchison Julyan Arbel David Dunson Maurizio Filippone Vincent Fortuin Philipp Hennig José Miguel Hernández-Lobato Aliaksandr Hubin Alexander Immer Theofanis Karaletsos Mohammad Emtiyaz Khan Agustinus Kristiadi Yingzhen Li Stephan Mandt Christopher Nemeth Michael A. Osborne Tim G. J. Rudner David Rügamer Yee Whye Teh Max Welling Andrew Gordon Wilson Ruqi Zhang Department of Mathematics The University of Manchester Manchester UK Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge Spotify London UK Computational Neuroscience Unit University of Bristol Bristol UK Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany and Department of Computer Science Technical University of Munich Munich Germany and Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge UK Department of Mathematics University of Oslo Oslo Norway and Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative California Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London UK Department of Computer Science UC Irvine Irvine Department of Mathematics and Statistics Lancaster University Lancaster UK Department of Engineering Science University of Oxford Oxford UK Center for Data Science New York University New York Munich Center for Machine Learning Munich Germany and Department of Statistics LMU Munich Munich Germany DeepMind London UK and Department of Statistics University of Oxford Oxford UK Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences and Center for Data Science Computer Science Department New York University New York Department of Computer Science Purdue University West Lafayette

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal multistage group testing algorithm for 3 defectives

arXiv

引用

arXiv 2020年

作者： Vorobyev, Ilya Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow127051 Russia Advanced Combinatorics and Complex Networks Lab Moscow Institute of Physics and Technology Dolgoprudny141701 Russia

Group testing is a well-known search problem that consists in detecting of s defective members of a set of t samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests in the worst case. In this work, a multistage group testing problem is considered. Our goal is to construct a multistage search procedure, having asymptotically the same number of tests as an adaptive one. We propose a new approach to designing multistage algorithms, which allows us to construct a 5-stage algorithm for finding 3 defectives with the optimal number 3 log2 t(1 + o(1)) of *** Codes 68R05 Copyright © 2020, The Authors. All rights reserved.

关键词： Well testing

来源：评论

学校读者我要写书评

暂无评论

Prediction of Diblock Copolymer Morphology via Machine Learning

arXiv

引用

arXiv 2023年

作者： Park, Hyun Yu, Boyuan Park, Juhae Sun, Ge Tajkhorshid, Emad de Pablo, Juan J. Schneider, Ludwig Theoretical and Computational Biophysics Group NIH Resource Center for Macromolecular Modeling and Bioinformatics Beckman Institute for Advanced Science and Technology University of Illinois at Urbana-Champaign UrbanaIL61801 United States Center for Biophysics and Quantitative Biology University of Illinois at Urbana-Champaign UrbanaIL61801 United States Data Science and Learning Division Argonne National Laboratory LemontIL60439 United States Pritzker School of Molecular Engineering University of Chicago 5640 Ellis Ave ChicagoIL60637 United States Theoretical and Computational Biophysics Group Beckman Institute for Advanced Science and Technology University of Illinois at Urbana-Champaign UrbanaIL61801 United States Department of Biochemistry University of Illinois at Urbana-Champaign UrbanaIL61801 United States

A machine learning approach is presented to accelerate the computation of block polymer morphology evolution for large domains over long timescales. The strategy exploits the separation of characteristic times between coarse-grained particle evolution on the monomer scale and slow morphological evolution over mesoscopic scales. In contrast to empirical continuum models, the proposed approach learns stochastically driven defect annihilation processes directly from particle-based simulations. A UNet architecture that respects different boundary conditions is adopted, thereby allowing periodic and fixed substrate boundary conditions of arbitrary shape. Physical concepts are also introduced via the loss function and symmetries are incorporated via data augmentation. The model is validated using three different use cases. Explainable artificial intelligence methods are applied to visualize the morphology evolution over time. This approach enables the generation of large system sizes and long trajectories to investigate defect densities and their evolution under different types of confinement. As an application, we demonstrate the importance of accessing late-stage morphologies for understanding particle diffusion inside a single block. This work has implications for directed self-assembly and materials design in micro-electronics, battery materials, and membranes. Copyright © 2023, The Authors. All rights reserved.

关键词： Block copolymers

来源：评论

学校读者我要写书评

暂无评论

Exploiting the Intrinsic Neighborhood Semantic Structure for Domain Adaptation in EEG-based Emotion Recognition

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Yi Wang, Ze Song, Yu Jia, Ziyu Wang, Boyu Jung, Tzyy-Ping Wan, Feng Macau University of Science and Technology Macao Centre for Mathematical Sciences Respiratory Disease AI Laboratory on Epidemic Intelligence and Medical Big Data Instrument Applications Faculty of Innovation Engineering 999078 China Tianjin University of Technology School of Electrical Engineering and Automation Tianjin Key Laboratory of New Energy Power Conversion Transmission and Intelligent Control Tianjin300384 China Chinese Academy of Sciences Beijing Key Laboratory of Brainnetome and Brain-Computer Interface and Brainnetome Center Institute of Automation Beijing100045 China Western University Department of Computer Science Brain Mind Institute LondonONN6A 3K7 Canada University of California at San Diego Swartz Center for Computational Neuroscience Institute for Neural Computation La Jolla CA92093 United States University of Macau Department of Electrical and Computer Engineering Faculty of Science and Technology China University of Macau Centre for Cognitive and Brain Sciences Centre for Artificial Intelligence and Robotics Institute of Collaborative Innovation 999078 China

Due to the inherent non-stationarity and individual differences present in electroencephalogram (EEG) signals, developing a generalizable model that performs well on new subjects is challenging in EEG-based emotion recognition. Most existing domain adaptation (DA) methods typically mitigate these discrepancies by aligning the marginal distributions of domain feature representations. However, when there is a significant difference in the class-conditional distribution between domain features and labels, the domain-invariant features learned by aligning marginal distributions may have limited discriminative ability for unlabeled target instances or even prove counterproductive. To address this issue, we propose a Neighborhood Semantic Aware Learning-based Dynamic Graph Attention Convolution (NSAL-DGAT) approach that learns target semantic information by considering the inter-domain semantic topological structure, thereby improving classifier adaptation for target instances. Specifically, the proposed NSAL framework is designed to capitalize on the insight that after domain feature alignment, some target samples and their neighboring source samples exhibit similar semantics. By leveraging the neighborhood topological structure, we extract and incorporate semantic target features to train a more transferable classifier. Besides, we implement an entropy weighting mechanism to emphasize representative target semantic information, encouraging target instances to prioritize high-confidence individuals within the source neighborhood. We have conducted extensive experiments on the public SEED dataset and our collected the Hearing-Impaired EEG dataset (HIED). The experimental results underscore the efficacy of our proposed NSAL-DGAT approach, showcasing state-of-the-art accuracy in subject-dependent as well as subject-independent scenarios. The source code is available at https://***/YYingDL/NSAL-DGAT. © 2010-2012 IEEE.

关键词： Speech analysis

来源：评论

学校读者我要写书评

暂无评论

ABACUS: An Electronic Structure Analysis Package for the AI Era

arXiv

引用

arXiv 2025年

作者： Zhou, Weiqing Zheng, Daye Liu, Qianrui Lu, Denghui Liu, Yu Lin, Peize Huang, Yike Peng, Xingliang Bao, Jie J. Cai, Chun Jin, Zuxin Wu, Jing Zhang, Haochong Jin, Gan Ji, Yuyang Shen, Zhenxiong Liu, Xiaohui Sun, Liang Cao, Yu Sun, Menglin Liu, Jianchuan Chen, Tao Liu, Renxi Li, Yuanbo Han, Haozhi Liang, Xinyuan Bao, Taoni Chen, Nuo Ren, Hongxu Zhang, Xiaoyang Liu, Zhaoqing Fu, Yiwei Liu, Maochang Li, Zhuoyuan Wen, Tongqi Tang, Zechen Xu, Yong Duan, Wenhui Wang, Xiaoyang Gu, Qiangqiang Dai, Fu-Zhi Zheng, Qijing Zhao, Jin Zhang, Yuzhi Ou, Qi Jiang, Hong Liu, Shi Xu, Ben Xu, Shenzhen Ren, Xinguo He, Lixin Zhang, Linfeng Chen, Mohan AI for Science Institute Beijing100080 China HEDPS CAPT School of Physics College of Engineering Peking University Beijing100871 China College of Engineering Peking University Beijing100871 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230026 China Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Supercomputing Center University of Science and Technology of China Anhui Hefei230026 China Institute of Physics Chinese Academy of Sciences Beijing100190 China School of Materials Science and Engineering Peking University Beijing100871 China School of Electrical Engineering and Electronic Information Xihua University Chengdu610039 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China College of Chemistry and Molecular Engineering Peking University Beijing100871 China International Research Center for Renewable Energy State Key Laboratory of Multiphase Flow Xi’an Jiaotong University Shaanxi Xi’an710049 China Suzhou Academy of Xi’an Jiaotong University Jiangsu Suzhou215123 China Center for Structural Materials Department of Mechanical Engineering The University of Hong Kong Hong Kong The University of Hong Kong Shenzhen China State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing100084 China Frontier Science Center for Quantum Information Beijing China Saitama Wako351-0198 Japan Institute for Advanced Study Tsinghua University Beijing100084 China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Fenghao East Road 2 Beijing100094 China School of Artificial Intelligence and Data Science University of Science and Technology of China Hefei230026 China School of Materials Science and Engineering University of Science and Technology Beijing Beijing100083 China Department of Physics University of Science and

ABACUS (Atomic-orbital Based Ab-initio Computation at USTC) is an open-source software for first-principles electronic structure calculations and molecular dynamics simulations. It mainly features density functional theory (DFT) and is compatible with both plane-wave basis sets and numerical atomic orbital basis sets. ABACUS serves as a platform that facilitates the integration of various electronic structure methods, such as Kohn-Sham DFT, stochastic DFT, orbital-free DFT, and real-time time-dependent DFT, etc. In addition, with the aid of high-performance computing, ABACUS is designed to perform efficiently and provide massive amounts of first-principles data for generating general-purpose machine learning potentials, such as DPA models. Furthermore, ABACUS serves as an electronic structure platform that interfaces with several AI-assisted algorithms and packages, such as DeePKS-kit, DeePMD, DP-GEN, DeepH, DeePTB, etc. Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

PyMIC: A deep learning toolkit for annotation-efficient medical image segmentation

arXiv

引用

arXiv 2022年

作者： Wang, Guotai Luo, Xiangde Gu, Ran Yang, Shuojue Qu, Yijie Zhai, Shuwei Zhao, Qianfei Li, Kang Zhang, Shaoting School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu China Shanghai Artificial Intelligence Laboratory Shanghai China Laboratory for Computational Sensing and Robotics Johns Hopkins University Baltimore United States West China Biomedical Big Data Center West China Hospital Sichuan University Chengdu China

Background and Objective: Open-source deep learning toolkits are one of the driving forces for developing medical image segmentation models. Existing toolkits mainly focus on fully supervised segmentation and require full and accurate pixel-level annotations that are time-consuming and difficult to acquire for segmentation tasks, which makes learning from imperfect labels highly desired for reducing the annotation cost. We aim to develop a new deep learning toolkit to support annotation-efficient learning for medical image segmentation. Methods: Our proposed toolkit named PyMIC is a modular deep learning library for medical image segmentation tasks. In addition to basic components that support development of high-performance models for fully supervised segmentation, it contains several advanced components tailored for learning from imperfect annotations, such as loading annotated and unannounced images, loss functions for unannotated, partially or inaccurately annotated images, and training procedures for co-learning between multiple networks, etc. PyMIC supports development of semi-supervised, weakly supervised and noise-robust learning methods for medical image segmentation. Results: We present several illustrative medical image segmentation tasks based on PyMIC: (1) Achieving competitive performance on fully supervised learning;(2) Semi-supervised cardiac structure segmentation with only 10% training images annotated;(3) Weakly supervised segmentation using scribble annotations;and (4) Learning from noisy labels for chest radiograph segmentation. Conclusions: The PyMIC toolkit is easy to use and facilitates efficient development of medical image segmentation models with imperfect annotations. It is modular and flexible, which enables researchers to develop high-performance models with low annotation cost. The source code is available at:https://***/HiLab-git/PyMIC. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Mixing Time Lower Bound for a Simplified Version of BART

arXiv

引用

arXiv 2022年

作者： Ronen, Omer Saarinen, Theo Tan, Yan Shuo Duncan, James Yu, Bin Department of Statistics UC Berkeley United States Department of Electrical Engineering and Computer Sciences UC Berkeley United States Center for Computational Biology UC Berkeley United States Department of Statistics and Data Science National University of Singapore Singapore Microsoft Research United States Group in Biostatistics UC Berkeley United States

Bayesian Additive Regression Trees (BART) is a popular Bayesian non-parametric regression algorithm. The posterior is a distribution over sums of decision trees, and predictions are made by averaging approximate samples from the posterior. The combination of strong predictive performance and the ability to provide uncertainty measures has led BART to be commonly used in the social sciences, biostatistics, and causal inference. BART uses Markov Chain Monte Carlo (MCMC) to obtain approximate posterior samples over a parameterized space of sums of trees, but it has often been observed that the chains are slow to mix. In this paper, we provide the first lower bound on the mixing time for a simplified version of BART in which we reduce the sum to a single tree and use a subset of the possible moves for the MCMC proposal distribution. Our lower bound for the mixing time grows exponentially with the number of data points. Inspired by this new connection between the mixing time and the number of data points, we perform rigorous simulations on BART. We show qualitatively that BART’s mixing time increases with the number of data points. The slow mixing time of the simplified BART suggests a large variation between different runs of the simplified BART algorithm and a similar large variation is known for BART in the literature. This large variation could result in a lack of stability in the models, predictions and posterior intervals obtained from the BART MCMC samples. Our lower bound and simulations suggest increasing the number of chains with the number of data points. Copyright © 2022, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

引用

Frontiers of engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：