全文获取类型
收费全文 | 354篇 |
免费 | 103篇 |
国内免费 | 34篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 24篇 |
2016年 | 15篇 |
2015年 | 12篇 |
2014年 | 22篇 |
2013年 | 33篇 |
2012年 | 30篇 |
2011年 | 35篇 |
2010年 | 23篇 |
2009年 | 41篇 |
2008年 | 23篇 |
2007年 | 40篇 |
2006年 | 22篇 |
2005年 | 22篇 |
2004年 | 26篇 |
2003年 | 19篇 |
2002年 | 15篇 |
2001年 | 15篇 |
2000年 | 12篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1990年 | 5篇 |
1988年 | 1篇 |
排序方式: 共有491条查询结果,搜索用时 15 毫秒
411.
412.
由于阵元间相位差变化率这一观测量与通道不一致性关系不大,信号到达两阵元间的相位差变化率常用于无源定位测量中。提出了一种新的快速高精度的相位差变化率测量方法,利用分时间片思想,首先通过对无模糊相位差进行一次相位平移,得到各个时间片含模糊的相位差值;然后对得到的各个时间片的含模糊相位差进行一次相位平移,得到各时间片间相对无模糊的相位差;最后对相对无模糊相位差采用最小二乘算法求得相位差变化率。理论分析和仿真实验表明,本算法可以很好地解决测量中由于相位模糊造成的相位差抖动问题,能够在短时间内得到高精度相位差变化率信息,可以满足定位要求。 相似文献
413.
414.
415.
Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001 相似文献
416.
为了研究空间站平均力矩平衡姿态的影响因素,建立了空间站的姿态运动模型,分析了气动力矩对空间站平均力矩平衡姿态的影响。建立了空间站的动力学与控制模型,采用典型的比例微分控制器,分别得出了两种条件下的24组平均力矩平衡姿态(Average Torque Equilibrium Attitude,ATEA),结果表明气动力矩对ATEA的影响显著。为了保持空间站ATEA,需要提供周期性的控制力矩。气动力矩引起的空间站角动量卸载和积累效应不能被忽视。 相似文献
417.
A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003 相似文献
418.
We consider the ??p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010 相似文献
419.
420.
Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献