期刊文献+
共找到22,577篇文章
< 1 2 250 >
每页显示 20 50 100
Online scheduling of image satellites based on neural networks and deep reinforcement learning
1
作者 Haijiao WANG Zhen YANG +1 位作者 Wugen ZHOU Dalin LI 《中国航空学报:英文版》 SCIE EI CAS CSCD 2019年第4期1011-1019,共9页
In the ‘‘Internet Plus' era, space-based information services require effective and fast image satellite scheduling. Most existing studies consider image satellite scheduling to be an optimization problem to sol... In the ‘‘Internet Plus' era, space-based information services require effective and fast image satellite scheduling. Most existing studies consider image satellite scheduling to be an optimization problem to solve with searching algorithms in a batch-wise manner. No real-time speed method for satellite scheduling exists. In this paper, with the idea of building a real-time speed method, satellite scheduling is remodeled based on a Dynamic and Stochastic Knapsack Problem(DSKP), and the objective is to maximize the total expected profit. No existing algorithm could be able to solve this novel scheduling problem properly. With inspiration from the recent achievements in Deep Reinforcement Learning(DRL) in video games, AlphaGo and dynamic controlling,a novel DRL-based method is applied to training a neural network to schedule tasks. The numerical results show that the method proposed in this paper can achieve relatively good performance with real-time speed and immediate respond style. 展开更多
关键词 DEEP REINFORCEMENT learning Dynamic SCHEDULING IMAGE SATELLITES Neural network Online SCHEDULING
Improved Task and Resource Partitioning Under the Resource-Oriented Partitioned Scheduling
2
作者 Ze-Wei Chen Hang Lei +2 位作者 Mao-Lin Yang Yong Liao Jia-Li Yu 《计算机科学技术学报:英文版》 SCIE EI CSCD 2019年第4期839-853,共15页
Coordinated partitioning and resource sharing have attracted considerable research interest in the field of real-time multiprocessor systems.However,finding an optimal partition is widely known as NP-hard,even for ind... Coordinated partitioning and resource sharing have attracted considerable research interest in the field of real-time multiprocessor systems.However,finding an optimal partition is widely known as NP-hard,even for independent tasks.A recently proposed resource-oriented partitioned(ROP)fixed-priority scheduling that partitions tasks and shared resources respectively has been shown to achieve a non-trivial speedup factor guarantee,which promotes the research of coordinated scheduling to a new level.Despite the theoretical elegance,the schedulability performance of ROP scheduling is restricted by the heuristic partitioning methods used in the original study.In this paper,we address the partitioning problem for tasks and shared resources under the ROP scheduling.A unified schedulability analysis framework for the ROP scheduling is proposed in the first place.A sophisticated partitioning approach based on integer linear programming(ILP)is then proposed based on the unified analysis.Empirical results show that the proposed methods improve the schedulability of ROP scheduling significantly,and the runtime complexity for searching a solution is reduced prominently compared with other ILP-based approaches as well. 展开更多
关键词 MULTIPROCESSOR real-time SCHEDULING partitioned fixed-priority SCHEDULING SHARED resource INTEGER linear pro-gramming
Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels
3
作者 CAI Shuang LIU Ke 《系统科学与复杂性学报:英文版》 SCIE EI CSCD 2019年第4期1180-1193,共14页
This paper considers the online scheduling problem on m(m≥3)parallel machines(the first k machines with grade 1 and the remaining m-k machines with grade 2)with two Go S levels and makespan as the objective function.... This paper considers the online scheduling problem on m(m≥3)parallel machines(the first k machines with grade 1 and the remaining m-k machines with grade 2)with two Go S levels and makespan as the objective function.The jobs arrive over time with grade 1 or 2 and an arrival job can be assigned to a machine only when the grade of the job is no less than the grade of the machine.Three cases are considered:(i)For k=1,the authors present an online algorithm with competitive ratio of9/5.(ii)For 1<k<m-1,an online algorithm with competitive ratio of 2.280 is proposed.(iii)For k=m-1,an online algorithm is presented with competitive ratio of 2.All the three algorithms are based on greedy algorithm with a similar structure.At last,numerical instances are given and the average competitive ratios of the instances show good performance of the proposed algorithms. 展开更多
关键词 GRADE of Service(GoS)constraints HEURISTIC algorithm online SCHEDULING parallel machine SCHEDULING
Mean-field Macro Computation in Large-scale Cloud Service Systems with Resource Management and Job Scheduling
4
作者 Feifei Yang Yanping Jiang Quanlin Li 《系统科学与系统工程学报:英文版》 SCIE EI CSCD 2019年第2期238-261,共24页
Service computing is an emerging and distributed computing mode in cloud service systems, and has become an interesting research direction for both academia and industry. Note that the cloud service systems always dis... Service computing is an emerging and distributed computing mode in cloud service systems, and has become an interesting research direction for both academia and industry. Note that the cloud service systems always display new characteristics, such as stochasticity, large scale, loose coupling, concurrency non-homogeneity and heterogeneity;thus their load balancing investigation has been more interesting, difficult and challenging until now. By using resource management and job scheduling, this paper proposes an integrated, real-time and dynamic control mechanism for large-scale cloud service systems and their load balancing through combining supermarket models with not only work stealing models but also scheduling of public reserved resource. To this end, this paper provides a novel stochastic model with weak interactions by means of nonlinear Markov processes. To overcome theoretical difficulties growing out of the state explosion in high-dimensional stochastic systems, this paper applies the mean-field theory to develop a macro computational technique in terms of an infinite-dimensional system of mean-field equations. Furthermore, this paper proves the asymptotic independence of the large-scale cloud service system, and show how to compute the fixed point by virtue of an infinite-dimensional system of nonlinear equations. Based on the fixed point, this paper provides effective numerical computation for performance analysis of this system under a high approximate precision. Therefore, we hope that the methodology and results given in this paper can be applicable to the study of more general large-scale cloud service systems. 展开更多
关键词 LARGE-SCALE cloud service system RESOURCE management job SCHEDULING SUPERMARKET MODEL work stealing MODEL SCHEDULING of public reserved RESOURCE
基于休假串联排队的三值光学计算机请求数分析 预览
5
作者 张杰 庞昆 +2 位作者 张冕 赵佳 王先超 《阜阳师范学院学报:自然科学版》 2019年第2期1-5,共5页
三值光学计算机(ternary optical computer,TOC)性能受到其研究者和潜在用户的关注。本文引入同步多重休假建立四阶段串联排队建立请求数数学模型对TOC性能进行分析。数值仿真结果表明均分成的小光学处理器数目对系统性能有重要影响。
关键词 串联排队 同步多重休假 处理器分配 调度
在线阅读 免费下载
基于光纤传输的大数据均衡合理调度模型设计
6
作者 卢瑛 周树林 +1 位作者 林旭东 别雄波 《激光杂志》 北大核心 2019年第1期140-144,共5页
光纤传输的大数据受到传输信道的多径扩展影响导致调度的时延和误差较大,为了提高光纤传输的大数据调度和无损传输能力,提出一种基于直接随机序列扩频的大数据均衡合理调度模型,结合传输信道均衡算法进行光纤传输性能的优化设计,构建光... 光纤传输的大数据受到传输信道的多径扩展影响导致调度的时延和误差较大,为了提高光纤传输的大数据调度和无损传输能力,提出一种基于直接随机序列扩频的大数据均衡合理调度模型,结合传输信道均衡算法进行光纤传输性能的优化设计,构建光纤传输的信道模型,采用多径干扰抑制方法进行光纤传输的大数据调度抗干扰设计,采用直接序列扩频和波特间隔均衡控制技术进行光纤传输通信系统的大数据传输和自适应调度,构建光纤网络传输大数据的信道均衡控制模型,计算大数据均衡合理调度的自适应加权系数,进行光纤网络传输大数据传感融合识别,实现对光纤传输网络的大数据均衡合理调度。仿真实验表明,该方法能提高光纤传输网络中大数据调度的均衡性,输出误码较低,提高了光纤传输的质量。 展开更多
关键词 光纤传输 大数据 均衡 调度 信道
具有反向学习能力的串车调度算法研究 预览
7
作者 王敏 陈峰 张磊石 《交通运输系统工程与信息》 EI CSCD 北大核心 2019年第2期102-107,115共7页
为了避免串车问题,研究了多条线路不同站点间隔的车辆实时串车调度算法.基于车辆自动定位(AVL)数据的分析预测,给出了具备反向学习能力的克隆选择优化算法(Opposition-learning Clonal Selection Algorithm, OCSA)求解避免串车的调度序... 为了避免串车问题,研究了多条线路不同站点间隔的车辆实时串车调度算法.基于车辆自动定位(AVL)数据的分析预测,给出了具备反向学习能力的克隆选择优化算法(Opposition-learning Clonal Selection Algorithm, OCSA)求解避免串车的调度序列,指导车辆调度.算法中设计了反向抗体库,反向抗体库存储了种群迭代过程中多个较差抗体的信息,利用较差基因位置信息,指导部分基因链以较快速度进行反向学习,将其迅速牵引出局部最优区域.反向学习过程可迅速改善抗体的多样性,使得算法在短时间内具有较强的全局寻优能力;且局部学习的缩放因子可随迭代过程动态调整,提高了算法的求解精度.实验结果表明,基于OCSA算法获取的调度序列与经典的调度算法相比有较好的适应性,求得的调度序列能够实时有效地降低站点串车问题. 展开更多
关键词 智能交通 串车 克隆选择 调度 反向学习
在线阅读 下载PDF
浅析教学辅助系统的开发研究 预览
8
作者 梁晶 《现代信息科技》 2019年第2期96-97,共2页
教学辅助系统已经走入人们的视线,尤其是在高职和本科院校当中。大量的教学工作与学生管理工作需要耗费较多的人力资源与物力资源。利用计算机软件技术,进行教学辅助系统的开发,可以将这些工作通过网络和辅助系统完成,从而简化教学以及... 教学辅助系统已经走入人们的视线,尤其是在高职和本科院校当中。大量的教学工作与学生管理工作需要耗费较多的人力资源与物力资源。利用计算机软件技术,进行教学辅助系统的开发,可以将这些工作通过网络和辅助系统完成,从而简化教学以及教学管理。本文就教学辅助系统的主要开发过程进行详细的阐述。 展开更多
关键词 软件技术 在线答疑 排课 数据库
在线阅读 下载PDF
西津二线船闸调度及控制系统设计特点 预览
9
作者 蒙平 《西部交通科技》 2019年第5期178-181,198共5页
文章介绍了西津水利枢纽二线船闸调度及控制系统的结构设计、运行控制工艺设计,可为类似工程的实施提供有益的经验借鉴。
关键词 船闸 调度 控制 工艺
在线阅读 下载PDF
分层异构网络下航运应急信息资源调度研究 预览
10
作者 杨顺韬 《舰船科学技术》 北大核心 2019年第1X期169-171,共3页
针对航运应急信息资源调度,由于采用传统方法调度时间过长,导致调度效率较低,提出了分层异构网络下资源调度方法研究。根据应急信息资源流转过程,在分层异构网络中,采用无向图模拟分层异构网络虚拟机,通过计算虚拟机性能异构因子,获取... 针对航运应急信息资源调度,由于采用传统方法调度时间过长,导致调度效率较低,提出了分层异构网络下资源调度方法研究。根据应急信息资源流转过程,在分层异构网络中,采用无向图模拟分层异构网络虚拟机,通过计算虚拟机性能异构因子,获取分层异构网络通信性能,由此建立最短时间调度模型。选择可靠路径,并将侧重点转移到所有场景最短路径差值上,从中选择最短路径作为继续执行任务备选路径,以此实现分层异构网络下航运应急信息资源高效调度。由实验结果可知,该方法最高调度效率可达到80%,为航运应急提供技术支持。 展开更多
关键词 分层异构 航运应急 信息资源 调度 路径
在线阅读 下载PDF
Personalized real-time pricing for efficient and fair demandresponse in energy cooperatives and highly competitive flexibility markets 预览
11
作者 Georgios TSAOUSOGLOU Nikolaos EFTHYMIOPOULOS +1 位作者 Prodrommos MAKRIS Emmanouel VARVARIGOS 《现代电力系统与清洁能源学报(英文)》 CSCD 2019年第1期151-162,共12页
This paper contributes to the well-known challenge of active user participation in demand side management(DSM).In DSM, there is a need for modern pricing mechanisms that will be able to effectively incentivize selfish... This paper contributes to the well-known challenge of active user participation in demand side management(DSM).In DSM, there is a need for modern pricing mechanisms that will be able to effectively incentivize selfishly behaving users in modifying their energy consumption pattern towards system-level goals like energy efficiency.Three generally desired properties of DSM algorithms are: user satisfaction, energy cost minimization and fairness.In this paper, a personalized real-time pricing(P-RTP) mechanism design framework is proposed that fairly allocates the energy cost reduction only to the users that provoke it.Thus, the proposed mechanism achieves significant reduction of the energy cost without sacrificing at all the welfare(user satisfaction)of electricity consumers.The business model that the proposed mechanism envisages is highly competitive flexibility market environments as well as energy cooperatives. 展开更多
关键词 DEMAND response Smart grid Electricity PRICING Scheduling DEMAND side management PERSONALIZED real-time PRICING ENERGY cooperative
在线阅读 下载PDF
5G空口实现超低时延的关键技术 预览
12
作者 牟晋宏 《移动通信》 2019年第9期79-85,共7页
超低时延是5G网络的重要特性之一,为了探究该特性在5G空口中的实现策略,首先描述了物理层的资源网格结构和资源分配方式,指出了物理层为上层提供了灵活的业务承载基础,随后分析了调度核心MAC的结构和功能变化,最后讨论了新的数传控制方... 超低时延是5G网络的重要特性之一,为了探究该特性在5G空口中的实现策略,首先描述了物理层的资源网格结构和资源分配方式,指出了物理层为上层提供了灵活的业务承载基础,随后分析了调度核心MAC的结构和功能变化,最后讨论了新的数传控制方案,递进地介绍了实现超低时延的关键技术。 展开更多
关键词 5G空口 低时延 物理层资源 调度
在线阅读 下载PDF
An efficient stochastic algorithm for mid-term scheduling of cascaded hydro systems 预览
13
作者 Xiaolin GE Shu XIA Wei-Jen LEE 《现代电力系统与清洁能源学报(英文)》 CSCD 2019年第1期163-173,共11页
Due to the stochastic and correlated attributes of natural inflows, the mid-term generation scheduling problem for cascaded hydro systems is a very challenging issue.This paper proposes a novel stochastic optimization... Due to the stochastic and correlated attributes of natural inflows, the mid-term generation scheduling problem for cascaded hydro systems is a very challenging issue.This paper proposes a novel stochastic optimization algorithm using Latin hypercube sampling and Cholesky decomposition combined with scenario bundling and sensitivity analysis(LC-SB-SA) to address this problem.To deal with the uncertainty of natural inflows, Latin hypercube sampling is implemented to provide an adequate number of sampling scenarios efficiently, and Cholesky decomposition is introduced to describe the correlated natural inflows among cascaded stations.In addition, to overcome the difficulties in solving the objectives of all the scenarios, scenario bundling and sensitivity analysis algorithms are developed to improve the computational efficiency.Simulation results from both two-station and tenstation systems indicate that the proposed method has the merits in accuracy as well as calculation speed for the midterm cascaded hydro generation scheduling.The consideration of natural inflow correlation makes the formulated problem more realistic. 展开更多
关键词 Cascaded HYDRO SYSTEMS Mid-term SCHEDULING Stochastic optimization algorithm Correlation Sensitivity
在线阅读 下载PDF
基于热释电红外传感器的车内实时人流量检测系统 预览
14
作者 解晨 刘建科 +1 位作者 毛晓姝 高媛 《电子设计工程》 2019年第7期94-97,共4页
改变公交调度方式是提升公交配置和公共资源利用率的有效方式。随着智能化手段的发展,在公交车前、后门装设实时人流量检测的系统,系统利用传感器检测人体红外射线,实时采集公交车内人流量信息,通过对数据的处理及分析,公交调度中心可... 改变公交调度方式是提升公交配置和公共资源利用率的有效方式。随着智能化手段的发展,在公交车前、后门装设实时人流量检测的系统,系统利用传感器检测人体红外射线,实时采集公交车内人流量信息,通过对数据的处理及分析,公交调度中心可以及时获取有效的客流量信息,并根据数据做出合理的公交调度,同时在公交车站站牌增加了车内实时人流量显示功能及车辆到站信息。对系统进行了模拟测试,系统能有效的记录通过传感器检测区域人流量,验证了数据处理及分析的可行性,便于根据数据进行合理调度。 展开更多
关键词 热释电红外传感器 人流量 数据传输 调度
在线阅读 下载PDF
双基球扁发射药生产线的改进遗传排产算法研究 预览
15
作者 周原令 胡晓兵 +1 位作者 霍云亮 张瀚铭 《四川大学学报:自然科学版》 CAS CSCD 北大核心 2019年第4期627-632,共6页
针对传统遗传算法在解决批次生产问题中存在的“早熟收敛”以及“局部搜索能力差”等问题,设计了基于预处理技术的改进遗传算法,实现对批次生产过程的处理.采用随机数法、定则生成法和块基因插补法三种方法,按照合适的比例,进行种群的... 针对传统遗传算法在解决批次生产问题中存在的“早熟收敛”以及“局部搜索能力差”等问题,设计了基于预处理技术的改进遗传算法,实现对批次生产过程的处理.采用随机数法、定则生成法和块基因插补法三种方法,按照合适的比例,进行种群的初始化,在保证初始化种群多样性同时提高其个体质量;通过精英保留策略和锦标赛选择策略进行选择操作,实现优质种群个体的选择;运用专家打分法对产品进行优先级排序;采用基于位置和优先级相结合的方法选择交叉位点,进行交叉操作,保留父代优良基因,避免“早熟收敛”;采用邻域重组策略进行变异操作,保证优质解种群的产生和质量解的继承.以最大化最小交货提前期为目标函数,实现排产算法研究.最后,以双基球扁发射药生产线为例,实现了改进遗传算法排产过程,大大提高公司的接单预估效率和产线的生产组织效率,然后运用单一随机初始化种群法和混合初始种群法进行比较分析,证明了改进算法的优越性. 展开更多
关键词 改进遗传算法 排产 块基因插补策略 邻域重组策略
在线阅读 免费下载
A Virtual Machine Scheduling Strategy with a Speed Switch and a Multi-Sleep Mode in Cloud Data Centers
16
作者 Shunfu Jin Shanshan Hao +1 位作者 Xiuchen Qie Wuyi Yue 《系统科学与系统工程学报:英文版》 SCIE EI CSCD 2019年第2期194-210,共17页
With the rapid growth of energy costs and the constant promotion of environmental standards, energy consumption has become a significant expenditure for the operating and maintaining of a cloud data center. Io improve... With the rapid growth of energy costs and the constant promotion of environmental standards, energy consumption has become a significant expenditure for the operating and maintaining of a cloud data center. Io improve the energy efficiency of cloud data centers, in this paper, we propose a Virtual Machine (VM) scheduling strategy with a speed switch and a multi-sleep mode. In accordance with the current traffic loads, a proportion of VMs operate at a low speed or a high speed, while the remaining VMs either sleep or operate at a high speed. Commensurate with our proposal, we develop a continuous-time queueing model with an adaptive service rate and a partial synchronous vacation. We construct a two dimensional Markov chain based on the total number of requests in the system and the state of all the VMs. Using a matrix geometric solution, we mathematically estimate the energy saving level and the response performance of the system. Numerical experiments with analysis and simulation show that our proposed VM scheduling strategy can effectively reduce the energy consumption without significant degradation in response performance. Additionally;we establish a system utility function to trade off the different performance measures. In order to determine the optimal sleep parameter and the maximum system utility function, we develop an improved Firefly intelligent searching Algorithm. 展开更多
关键词 Cloud data center virtual machine scheduling SPEED SWITCH multi-sleep matrix geometricSolution utility function improved FIREFLY Algorithm
Optimum Consecutive Preventive Maintenance Scheduling Model Considering Reliability
17
作者 刘葛辉 龙翔宇 +2 位作者 仝硕 张瑞 陈绍宽 《上海交通大学学报:英文版》 EI 2019年第4期490-495,共6页
As an effective means for improving system condition and reducing failures, a reasonable preventive maintenance scheduling guarantees the stability and safety of the system. This paper studies a consecutive maintenanc... As an effective means for improving system condition and reducing failures, a reasonable preventive maintenance scheduling guarantees the stability and safety of the system. This paper studies a consecutive maintenance scheduling problem for single-component systems with imperfect maintenance, and an optimum model with minimum reliability constraint for minimal cost rate is developed based on the renewal theory. The agebased and reliability-based maintenance strategies are modeled and compared according to a numerical example based on the degradation data of the actual system, which also verifies the optimality of the reliability-based strategy. At last, the influence of some key parameters is discussed by sensitive analysis. 展开更多
关键词 RELIABILITY imperfect maintenance maintenance SCHEDULING sensitivity analysis COST RATE
基于星间链路的卫星导航系统星地业务信息传输规划调度方法研究 预览
18
作者 宋炜琳 杨道宁 《兵工学报》 EI CAS CSCD 北大核心 2019年第8期1627-1633,共7页
星间链路是现代卫星导航系统的主要技术特征之一。针对星间链路条件下卫星导航系统业务数据传输规划调度问题,设计了一种规划调度数学模型,并在此基础上提出了启发式规划调度方法。基于北斗三号卫星导航系统的场景设置,对该方法进行了... 星间链路是现代卫星导航系统的主要技术特征之一。针对星间链路条件下卫星导航系统业务数据传输规划调度问题,设计了一种规划调度数学模型,并在此基础上提出了启发式规划调度方法。基于北斗三号卫星导航系统的场景设置,对该方法进行了仿真验证。仿真结果表明:启发式规划调度方法能在北京、新疆和海南3个地面站组成的区域监测网条件下成功实现卫星导航系统30颗卫星的业务数据传输规划调度,调度结果满足卫星导航系统任务需求;各任务周期内平均需要地面站天线15.375个,且绝大部分地面站资源利用率超过70%. 展开更多
关键词 卫星导航 星间链路 规划调度 北斗
在线阅读 下载PDF
循环赛通用方法研究 预览
19
作者 董东风 《湖南邮电职业技术学院学报》 2019年第1期21-26,共6页
依据关系数据库原理设计循环赛比赛轮次表,并通过对现有三种'固定轮转法'生成循环赛比赛轮次表的原理进行研究,从中找到了一种新的固定轮转法——循环赛通用方法。以此提高循环赛比赛轮次表的通用性,补充、完善循环赛方法理论,... 依据关系数据库原理设计循环赛比赛轮次表,并通过对现有三种'固定轮转法'生成循环赛比赛轮次表的原理进行研究,从中找到了一种新的固定轮转法——循环赛通用方法。以此提高循环赛比赛轮次表的通用性,补充、完善循环赛方法理论,为计算机编排提供科学算法依据。建议:在球类和棋类赛会制循环赛中,推广使用循环赛通用方法和循环赛比赛轮次表,以此统一、规范循环赛编排。 展开更多
关键词 循环赛 比赛轮次表 固定轮转法 赛程安排 计算机编排
在线阅读 下载PDF
A Modi ed Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
20
作者 Ghiath Al Aqel Xinyu Li Liang Gao 《中国机械工程学报:英文版》 SCIE EI CAS CSCD 2019年第2期157-167,共11页
The flexible job shop scheduling problem(FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are ca... The flexible job shop scheduling problem(FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are categorized as metaheuristic methods. Some of these methods normally consume more CPU time and some other methods are more complicated which make them di cult to code and not easy to reproduce. This paper proposes a modified iterated greedy(IG) algorithm to deal with FJSP problem in order to provide a simpler metaheuristic, which is easier to code and to reproduce than some other much more complex methods. This is done by separating the classical IG into two phases. Each phase is used to solve a sub-problem of the FJSP: sequencing and routing sub-problems. A set of dispatching rules are employed in the proposed algorithm for the sequencing and machine selection in the construction phase of the solution. To evaluate the performance of proposed algorithm, some experiments including some famous FJSP benchmarks have been conducted. By compared with other algorithms, the experimental results show that the presented algorithm is competitive and able to find global optimum for most instances. The simplicity of the proposed IG provides an e ective method that is also easy to apply and consumes less CPU time in solving the FJSP problem. 展开更多
关键词 ITERATED GREEDY Flexible JOB SHOP SCHEDULING problem DISPATCHING rules
上一页 1 2 250 下一页 到第
使用帮助 返回顶部 意见反馈