全文获取类型
收费全文 | 536篇 |
免费 | 216篇 |
国内免费 | 34篇 |
出版年
2024年 | 4篇 |
2023年 | 8篇 |
2022年 | 6篇 |
2021年 | 12篇 |
2020年 | 12篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 25篇 |
2014年 | 40篇 |
2013年 | 43篇 |
2012年 | 40篇 |
2011年 | 65篇 |
2010年 | 43篇 |
2009年 | 48篇 |
2008年 | 28篇 |
2007年 | 45篇 |
2006年 | 37篇 |
2005年 | 36篇 |
2004年 | 36篇 |
2003年 | 17篇 |
2002年 | 22篇 |
2001年 | 27篇 |
2000年 | 21篇 |
1999年 | 23篇 |
1998年 | 14篇 |
1997年 | 11篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有786条查询结果,搜索用时 46 毫秒
631.
632.
This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
633.
Ananth. V. Iyer 《海军后勤学研究》2002,49(4):376-390
We evaluate an approach to decrease inventory costs at retail inventory locations that share a production facility. The retail locations sell the same product but differ in the variance of retail demand. Inventory policies at retail locations generate replenishment orders for the production facility. The production facility carries no finished goods inventory. Thus, production lead time for an order is the sojourn time in a single server queueing system. This lead time affects inventory costs at retail locations. We examine the impact of moving from a First Come First Served (FCFS) production rule for orders arriving at the production facility to a rule in which we provide non‐preemptive priority (PR) to orders from retail locations with higher demand uncertainty. We provide three approximations for the ratio of inventory costs under PR and FCFS and use them to identify conditions under which PR decreases retail inventory costs over FCFS. We then use a Direct Approach to establish conditions when PR decreases retail inventory costs over FCFS. We extend the results to orders from locations that differ in the mean and variance of demand uncertainty. The analysis suggests that tailoring lead times to product demand characteristics may decrease system inventory costs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 376–390, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10016 相似文献
634.
对银河仿真工作站与共享内存实时网络的实时通信技术进行了研究 ,介绍了银河仿真工作站与实时网通信的应用程序接口API,并且描述了一个在YHSIM仿真程序中实现与实时网通信的例子 ,最后给出了实验结果。实验证明 ,该技术能有效地用于大规模复杂系统的半实物仿真 相似文献
635.
自行设计的超高分辨率图像实时显示系统由图形系统处理机、超高分辨率显示器组成 ,其核心是图形系统处理机 ,显示分辨率为 2 0 4 8× 2 0 4 8,逐行扫描 ,每像素 8位 ,图像输入速率最高 2 4 0MB/s ,可同时显示n (n =8,4 ,2 ,1)个CCD相机的实时图像数据 ,并能进行n抽m (n =8,4 ,2 ,1;m =8,4 ,2 ,1;n≥m)处理。采用的主要技术有 :图像输入双重缓冲抽样复合拼接技术 ,单帧存图形图像共体技术 ,视频双重并串转换技术等。该系统可用于卫星地面站、航测、医学成像及其他传感器的高分辨率图像的实时显示 相似文献
636.
637.
为使得多枚导弹在存在通信时延的情况下有效完成对机动目标的同时攻击,提出了一种抗通信时延的固定时间收敛分布式协同制导律。该制导律基于固定时间控制技术框架,实现了稳定时间边界不依赖于多导弹系统初始状态,提升了多导弹系统控制效率;采用一种快速非奇异终端滑模和虚拟领弹共同主导的方法,可实现制导律具有对抗通信时延的鲁棒性;利用了李雅普诺夫稳定性理论证明了固定时间内的一致性。仿真结果表明,存在通信时延的情况下,基于所设计的分布式协同制导律,多枚导弹能够有效地完成对目标的同时攻击。 相似文献
638.
为了让高精度数值格式在含间断和小尺度涡等复杂结构的超声速无粘可压缩流动情况下,仍能鲁棒地捕捉激波并快速得到流场高保真的模拟结果,研究了以子模板导数组合为基础的光滑度量算法,构造了精度与鲁棒性兼顾的新型间断探测器,使间断识别对小尺度涡也具有高分辨率;研究了混合加权紧致非线性格式(weighted compact nonlinear scheme, WCNS)方法,对流场中的光滑与间断区域分别使用线性与非线性加权格式求解,从而克服单一非线性格式在光滑区分辨率难以达到设计精度的问题。数值实验表明,使用新型间断探测器的混合WCNS格式对一维、二维Euler方程模拟结果良好,并且相比于在全流场使用局部特征分解的原始WCNS方法有计算效率的提高。 相似文献
639.
根据导弹仿真数据,绘制可直观显示弹道特性的理想弹道曲线。给出了比例导引法的差分方程,建立了比例导引法的三维弹道仿真模型。在对比例导引法进行三维弹道仿真的基础上,分别对增量比例导引、基于二次型的最优制导律和考虑动态特性的二次型最优制导律进行了三维弹道仿真,绘制出了可直观显示弹道特性的理想弹道,计算了导弹与目标的遭遇时间,并对结果进行了比较分析。最后得出考虑弹体动态特性的二次型最优制导律具有最优性。 相似文献
640.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献