全文获取类型
收费全文 | 393篇 |
免费 | 144篇 |
国内免费 | 30篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 12篇 |
2018年 | 6篇 |
2017年 | 21篇 |
2016年 | 21篇 |
2015年 | 18篇 |
2014年 | 27篇 |
2013年 | 31篇 |
2012年 | 27篇 |
2011年 | 44篇 |
2010年 | 27篇 |
2009年 | 36篇 |
2008年 | 18篇 |
2007年 | 36篇 |
2006年 | 27篇 |
2005年 | 24篇 |
2004年 | 29篇 |
2003年 | 12篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 18篇 |
1999年 | 20篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有567条查询结果,搜索用时 15 毫秒
451.
针对拦截高速机动目标的需求,研究了一种变论域模糊自适应滑模有限时间收敛制导律。推导了导弹-目标空间拦截模型,设计了三维滑模制导律;根据有限时间收敛制导律专家的经验,采用模糊自适应控制方法对滑模制导律的非切换项进行逼近,并设计了有限时间收敛模糊控制规则;提出了一种新型变论域伸缩因子,设计了基于新型伸缩因子的变论域模糊自适应滑模有限时间收敛制导律。仿真结果表明,所设计的制导律能够使导弹准确命中目标,并能够达到视线角速率有限时间收敛,且与比例制导律相比,具有更高的制导精度和更短的飞行时间。 相似文献
452.
For the case that two pursuers intercept an evasive target, the cooperative strategies and state estimation methods taken by pursuers can seriously affect the guidance accuracy for the target, which performs a bang For the case that two pursuers intercept an evasive target, the cooperative strategies and state estimation methods taken by pursuers can seriously affect the guidance accuracy for the target, which performs a bang-bang evasive maneuver with a random switching time. Combined Fast multiple model adaptive estimation (Fast MMAE) algorithm, the cooperative guidance law takes detection configuration affecting the accuracy of interception into consideration. Introduced the detection error model related to the line-of-sight (LOS) separation angle of two interceptors, an optimal cooperative guidance law solving the optimization problem is designed to modulate the LOS separation angle to reduce the estimation error and improve the interception performance. Due to the uncertainty of the target bang-bang maneuver switching time and the effective fitting of its multi-modal motion, Fast MMAE is introduced to identify its maneuver switching time and estimate the acceleration of the target to track and intercept the target accurately. The designed cooperative optimal guidance law with Fast MMAE has better estimation ability and interception performance than the traditional guidance law and estimation method via Monte Carlo simulation. 相似文献
453.
In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
454.
自行设计的超高分辨率图像实时显示系统由图形系统处理机、超高分辨率显示器组成 ,其核心是图形系统处理机 ,显示分辨率为 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)处理。采用的主要技术有 :图像输入双重缓冲抽样复合拼接技术 ,单帧存图形图像共体技术 ,视频双重并串转换技术等。该系统可用于卫星地面站、航测、医学成像及其他传感器的高分辨率图像的实时显示 相似文献
455.
We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f1(C1), f2(C2), … , fn(Cn)), where fi(Ci) is a general, nondecreasing function of the completion time Ci of task i. We show that the optimal sequence to minimize the maximum cost MC = max fi(Ci) can be derived by a simple rule if there exists an order f1(t) ≤ … ≤ fn(t) for all t between the functions {fi(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ fi(Ci) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
456.
457.
458.
459.
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. 相似文献
460.
经典的数字信道化思想的实施都是建立在一组硬件滤波器构成的并行多路,虽然能实时处理,但随着处理数据带宽的增大和子信道频率分辨率的增加,设备开销将线性增长,整体可靠性也必然下降.基于信号的检测理论,在利用时频分析工具得到的时频图上进行信号检测,提出了检测去噪法.针对宽带数据背景噪声的特点,提出了噪声基底的3种估计算法:去大留小法、对数统计法和频移均值法,并线面结合对噪声基底进行平滑,实现了天电干扰的去除.通过实际接收到的某短波信号检验,证明了算法的有效性. 相似文献