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

IEEE International Conference on Mechatronics and Automation

作者： Yunong Zhang Liangjie Ming Min Yang Binbin Qiu Zhonghua Li School of Data and Computer Science Sun Yat-sen University Guangzhou P. R. China Research Institute of Sun Yat-sen University in Shenzhen Shenzhen P. R. China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou P. R. China School of Electronics and Information Technology Sun Yat-sen University Guangzhou P. R. China School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou P. R. China

ISBN: (数字)9781728164168

ISBN: (纸本)9781728164175

In this paper, a concept of Zhang equivalency (ZE) is presented, and its type of inequality to inequality (simply termed, inequality type) is further discussed. By applying Zhang neural dynamics method, we thus propose the order-1, order2, and order-3 ZE general formulas of such an inequality type, respectively. Then, the inequalities in four different situations are investigated, i.e., the robot situation, matrix situation (including matrix-vector situation), state-control situation, and state situation. We propose the corresponding order-1, order-2, and order-3 ZE formulas to prepare for solving corresponding time-varying inequality-related problems.

关键词： Mechatronics Automation Conferences Linear matrix inequalities Problem-solving Robots

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MFPR: A Personalized Ranking Recommendation with Multiple Feedback

引用

ACM Transactions on Social computing 2018年第2期1卷 1–22页

作者： Shi, Chuan Liu, Jian Zhang, Yiding Hu, Binbin Liu, Shenghua Yu, Philip S. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications No. 10 Xi Tu Cheng Road Beijing China Cas Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Beijing China Department of Computer Science University of Illinois at Chicago 851 South Morgan Street Chicago United States

Recently, recommender systems have played an important role in improving web user experiences and increasing profits. Recommender systems exploit users' behavioral history (i.e., feedback on items) to build models. The feedback usually includes explicit feedback (e.g., ratings) and implicit feedback (e.g., browsing history, click logs), which are both useful for improving recommendations. However, as far as we are concerned, no existing works have integrated both explicit and multiple implicit feedback simultaneously. Therefore, we propose a unified and flexible model, named Multiple Feedback-based Personalized Ranking (MFPR), to make full use of multiple feedback, which uses a personalized ranking framework. To train model MFPR, we design an algorithm to generate ordered item pairs as labeled data, with consideration of both rating scores and multiple implicit feedback. Extensive experiments on two real-world datasets validate the effectiveness of the MFPR model. With the integration of multiple feedback, MFPR significantly improves recommendation performance. © 2018 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Petri Net Control Method for Pipe-line Systems and Its Implementation via CIF3 ⁎

引用

IFAC-PapersOnLine 2019年第24期52卷 261-266页

作者： YuHao Fu JiLiang Luo Huifeng Wu Jianhong Ye Yi-sheng Huang College Information Science and Engineering Huaqiao University Xiamen 361021 China College Information Science and Engineering Huaqiao University Xiamen 361021 China and also with Fujian Engineering Research Center of Motor Control and System Optimal Schedule Xiamen 361021 China Institute of Intelligent and Software Technology Hangzhou Dianzi University Hangzhou 310018 China Computer Science and Technology Huaqiao University Xiamen 361021 China and also with Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000 China Department of Electrical Engineering National Ilan University Taiwan

As for a pipe-line system subjected to complex operations, an approach is proposed to synthesize the controller via Petri nets (PNs) such that the plant is run as concurrently as possible and the loads of equipments are balanced. A P-timed and labeled PN is designed to model the whole process of a pipe-line system, where tasks, including transporting material from one tank to another and cleaning tank, are represented by operational places, and level sensors amounted in tanks are represented by labels assigned to transitions. Further, monitor places are designed to resolve the conflict relations among tasks due to the shared valves and pipes. An method is presented to translate an PN controller into a CIF3 (Compositional Interchange Format) model, which can be converted into a PLC program in the CIF3 tool. A beer filtration plant is taken as an example to illustrate the approach, and its simulation experiments are carried out to verify the theoretic results.

关键词： Chemical plant Valve control Petri net CIF3

来源：评论

学校读者我要写书评

暂无评论

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

引用

Nature methods 2023年第6期20卷 824-835页

作者： Linus Manubens-Gil Zhi Zhou Hanbo Chen Arvind Ramanathan Xiaoxiao Liu Yufeng Liu Alessandro Bria Todd Gillette Zongcai Ruan Jian Yang Miroslav Radojević Ting Zhao Li Cheng Lei Qu Siqi Liu Kristofer E Bouchard Lin Gu Weidong Cai Shuiwang Ji Badrinath Roysam Ching-Wei Wang Hongchuan Yu Amos Sironi Daniel Maxim Iascone Jie Zhou Erhan Bas Eduardo Conde-Sousa Paulo Aguiar Xiang Li Yujie Li Sumit Nanda Yuan Wang Leila Muresan Pascal Fua Bing Ye Hai-Yan He Jochen F Staiger Manuel Peter Daniel N Cox Michel Simonneau Marcel Oberlaender Gregory Jefferis Kei Ito Paloma Gonzalez-Bellido Jinhyun Kim Edwin Rubel Hollis T Cline Hongkui Zeng Aljoscha Nern Ann-Shyn Chiang Jianhua Yao Jane Roskams Rick Livesey Janine Stevens Tianming Liu Chinh Dang Yike Guo Ning Zhong Georgia Tourassi Sean Hill Michael Hawrylycz Christof Koch Erik Meijering Giorgio A Ascoli Hanchuan Peng Institute for Brain and Intelligence Southeast University Nanjing China. Microsoft Corporation Redmond WA USA. Tencent AI Lab Bellevue WA USA. Computing Environment and Life Sciences Directorate Argonne National Laboratory Lemont IL USA. Kaya Medical Seattle WA USA. University of Cassino and Southern Lazio Cassino Italy. Center for Neural Informatics Structures and Plasticity Krasnow Institute for Advanced Study George Mason University Fairfax VA USA. Faculty of Information Technology Beijing University of Technology Beijing China. Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing China. Nuctech Netherlands Rotterdam the Netherlands. Janelia Research Campus Howard Hughes Medical Institute Ashburn VA USA. Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada. Ministry of Education Key Laboratory of Intelligent Computation and Signal Processing Anhui University Hefei China. Paige AI New York NY USA. Scientific Data Division and Biological Systems and Engineering Division Lawrence Berkeley National Lab Berkeley CA USA. Helen Wills Neuroscience Institute and Redwood Center for Theoretical Neuroscience UC Berkeley Berkeley CA USA. RIKEN AIP Tokyo Japan. Research Center for Advanced Science and Technology (RCAST) The University of Tokyo Tokyo Japan. School of Computer Science University of Sydney Sydney New South Wales Australia. Texas A&M University College Station TX USA. Cullen College of Engineering University of Houston Houston TX USA. Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taipei Taiwan. National Centre for Computer Animation Bournemouth University Poole UK. PROPHESEE Paris France. Department of Neuroscience Columbia University New York NY USA. Mortimer B. Zuckerman Mind Brain Behavior Institute Columbia University New York NY USA. Department of Computer Science Northern Illinois Universit

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. We observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Advancing the Scientific Method with Large Language Models: From Hypothesis to Discovery

arXiv

引用

arXiv 2025年

作者： Zhang, Yanbo Khan, Sumeer A. Mahmud, Adnan Yang, Huck Lavin, Alexander Levin, Michael Frey, Jeremy Dunnmon, Jared Evans, James Bundy, Alan Dzeroski, Saso Tegner, Jesper Zenil, Hector Allen Discovery Center Tufts University MedfordMA United States Living Systems Lab KAUST Thuwal Saudi Arabia Intelligent Infrastructure Team Network Rail United Kingdom Department for AI in Society Science and Technology Zuse Institute Berlin Germany NVIDIA Research United States Biological and Environmental Science and Engineering Division King Abdullah University of Science and Technology Thuwal Saudi Arabia SDAIA-KAUST Center of Excellence in Data Science and Artificial Intelligence Thuwal23952 Saudi Arabia Pasteur Labs BrooklynNY United States Wyss Institute for Biologically Inspired Engineering Harvard University BostonMA United States Department of Chemistry University of Southampton University Road Hampshire Southampton United Kingdom Department of Biomedical Data Science Stanford University StanfordCA United States Knowledge Lab Department of Sociology University of Chicago IL United States Santa Fe Institute NM United States School of Informatics The University of Edinburgh United Kingdom Department of Knowledge Technologies Jožef Stefan Institute Ljubljana Slovenia Thuwal23955-6900 Saudi Arabia Unit of Computational Medicine Department of Medicine Center for Molecular Medicine Karolinska Institutet Karolinska University Hospital L8:05 StockholmSE-171 76 Sweden Thuwal23955-6900 Saudi Arabia Science for Life Laboratory Tomtebodavagen 23A SolnaSE-17165 Sweden Algorithmic Dynamics Lab Research Departments of Biomedical Computing and Digital Twins School of Biomedical Engineering and Imaging Sciences King’s College London United Kingdom King’s Institute for Artificial Intelligence London United Kingdom The Alan Turing Institute London United Kingdom Oxford Immune Algorithmics Oxford University Innovation London Institute for Healthcare Engineering London United Kingdom Cancer Interest Group Francis Crick Institute London United Kingdom

With recent Nobel Prizes recognising AI contributions to science, Large Language Models (LLMs) are transforming scientific research by enhancing productivity and reshaping the scientific method. LLMs are now involved in experimental design, data analysis, and workflows, particularly in chemistry and biology. However, challenges such as hallucinations and reliability persist. In this contribution, we review how Large Language Models (LLMs) are redefining the scientific method and explore their potential applications across different stages of the scientific cycle, from hypothesis testing to discovery. We conclude that, for LLMs to serve as relevant and effective creative engines and productivity enhancers, their deep integration into all steps of the scientific process should be pursued in collaboration and alignment with human scientific goals, with clear evaluation metrics. The transition to AI-driven science raises ethical questions about creativity, oversight, and responsibility. With careful guidance, LLMs could evolve into creative engines, driving transformative breakthroughs across scientific disciplines responsibly and effectively. However, the scientific community must also decide how much it leaves to LLMs to drive science, even when associations with ‘reasoning’, mostly currently undeserved, are made in exchange for the potential to explore hypothesis and solution regions that might otherwise remain unexplored by human exploration alone. Copyright © 2025, The Authors. All rights reserved.

关键词： Plants (botany)

来源：评论

学校读者我要写书评

暂无评论

Learning knowledge representation across knowledge graphs 31

Learning knowledge representation across knowledge graphs

引用

31st AAAI Conference on Artificial Intelligence, AAAI 2017

作者： Cai, Pengshan Li, Wei Feng, Yansong Wang, Yuanzhuo Jia, Yantao CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Science Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China Institute of Computer Science and Technology Peking University Beijing China

ISBN: (纸本)9781577357865

Distributed knowledge representation learning (KRL) methods encode both entities and relations in knowledge graphs (KG) in a lower-dimensional semantic space, which model relatively dense knowledge graphs well and greatly improve the performance of knowledge graph completion and knowledge reasoning. However, existing KRL methods including Trans(E, H, R, D and Sparse) hardly obtain comparative performances on sparse KGs where most of entities and relations have very low frequencies. Furthermore, all existing methods target at KRL on one knowledge graph independently. The embeddings of different KGs are independent with each other. In this paper, we propose a novel cross-knowledge- graph (cross-KG) KRL method which learns embeddings for two different KGs simultaneously. Through projecting semantic related entities and relations in two KGs to a uniform semantic space, our method could learn better embeddings for sparse KGs by incorporating information from another relatively larger and denser KG. The learned embeddings are also helpful for downstream cross-KGs or cross-linguals tasks like ontology alignment. The experiment results show that our method could significandy outperform corresponding baseline methods on knowledge graph completion on single KG and cross-KG entity prediction and mapping tasks. © 2017, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Flickr group recommendation with auxiliary information in heterogeneous information networks

Flickr group recommendation with auxiliary information in he...

引用

作者： Wang, Yueyang Xia, Yuanfang Tang, Siliang Wu, Fei Zhuang, Yueting Key Laboratory of Big Data Intelligent Computing of Zhejiang Province Innovation Joint Research Center for ICPS College of Computer Science and Technology Zhejiang University Hangzhou China

Over the past few years, the appropriate utilization of user communities or image groups in social networks (i.e., Flickr or Facebook) has drawn a great deal of attention. In this paper, we are particularly interested in recommending preferred groups to users who may favor according to auxiliary information. In real world, the images captured by mobile equipments explicitly record a lot of contextual information (e.g., locations) about users generating images. Meanwhile, several words are employed to describe the particular theme of each group (e.g., "Dogs for Fun Photos" image group in Flickr), and the words may mention particular entities as well as their belonging categories (e.g., "Animal"). In fact, the group recommendation can be conducted in heterogeneous information networks, where informative cues are in general multi-typed. Motivated by the assumption that the auxiliary information (visual features of images, mobile contextual information and entity-category information of groups in this paper) in heterogeneous information networks will boost the performance of the group recommendation, this paper proposes to combine auxiliary information with implicit user feedback for group recommendation. In general, the group recommendation in this paper is formulated as a non-negative matrix factorization (NMF) method regularized with user–user similarity via visual features and heterogeneous information networks. Experiments show that our proposed approach outperforms other counterpart recommendation approaches. © 2016, Springer-Verlag Berlin Heidelberg.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Radio detection of an elusive millisecond pulsar in the Globular Cluster NGC 6397

arXiv

引用

arXiv 2022年

作者： Zhang, Lei Ridolfi, Alessandro Blumer, Harsha Freire, Paulo C.C. Manchester, Richard N. McLaughlin, Maura Kremer, Kyle Cameron, Andrew D. Zhang, Zhiyu Behrend, Jan Burgay, Marta Buchner, Sarah Champion, David J. Chen, Weiwei Dai, Shi Feng, Yi Fu, Xiaoting Guo, Meng Hobbs, George Keane, Evan F. Kramer, Michael Levin, Lina Li, Xiangdong Ni, Mengmeng Pan, Jingshan Padmanabh, Prajwal V. Possenti, Andrea Ransom, Scott M. Tsai, Chao-Wei Krishnan, Vivek Venkatraman Wang, Pei Zhang, Jie Zhi, Qijun Zhang, Yongkun Li, Di National Astronomical Observatories Chinese Academy of Sciences A20 Datun Road Chaoyang District Beijing100101 China Centre for Astrophysics and Supercomputing Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia SelargiusI-09047 Italy Department of Physics and Astronomy West Virginia University MorgantownWV26506 United States Max-Planck Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany CSIRO Space and Astronomy Australia Telescope National Facility PO Box 76 EppingNSW1710 Australia TAPIR California Institute of Technology PasadenaCA91125 United States The Observatories of the Carnegie Institution for Science PasadenaCA91101 United States Swinburne University of Technology Mail H74 PO Box 218 VIC3122 Australia School of Astronomy and Space Science Nanjing University Nanjing210023 China Ministry of Education Nanjing210093 China South African Radio Astronomy Observatory Fir Street Black River Park Cape Town7925 South Africa School of Science Western Sydney University Locked Bag 1797 PenrithNSW2751 Australia Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Purple Mountain Observatory Chinese Academy of Sciences Nanjing210023 China National Supercomputing Center in Jinan Qilu University of Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China Jinan Institute of Supercomputing Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China School of Physics Trinity College Dublin College Green Dublin Ireland Jodrell Bank Centre for Astrophysics Department of Physics and Astronomy The University of Manchester ManchesterM13 9PL United Kingdom HannoverD-30167 Germany MonserratoI-09042 Italy NRAO 520 Edgemont Road CharlottesvilleVA22903 United States College of Physics and Electronic Engineering Qilu Normal University 2 Wenbo Road Zhangqiu District Jinan250200 China Guizhou Provincial Key Laboratory of Radio

We report the discovery of a new 5.78 ms-period millisecond pulsar (MSP), PSR J1740−5340B (NGC 6397B), in an eclipsing binary system discovered with the Parkes radio telescope (now also known as Murriyanga), Australia, and confirmed with the MeerKAT radio telescope in South Africa. The measured orbital period, 1.97 days, is the longest among all eclipsing binaries in globular clusters (GCs) and consistent with that of the coincident X-ray source U18, previously suggested to be a ‘hidden MSP’. Our XMM-Newton observations during NGC 6397B’s radio quiescent epochs detected no X-ray flares. NGC 6397B is either a transitional MSP or an eclipsing binary in its initial stage of mass transfer after the companion star left the main sequence. The discovery of NGC 6397B potentially reveals a subgroup of extremely faint and heavily obscured binary pulsars, thus providing a plausible explanation to the apparent dearth of binary neutron stars in core-collapsed GCs as well as a critical constraint on the evolution of GCs. Copyright © 2022, The Authors. All rights reserved.

关键词： Mass transfer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：