全文获取类型
收费全文 | 570篇 |
免费 | 22篇 |
国内免费 | 1篇 |
专业分类
593篇 |
出版年
2025年 | 6篇 |
2024年 | 6篇 |
2023年 | 9篇 |
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 12篇 |
2018年 | 6篇 |
2017年 | 21篇 |
2016年 | 22篇 |
2015年 | 18篇 |
2014年 | 30篇 |
2013年 | 34篇 |
2012年 | 31篇 |
2011年 | 45篇 |
2010年 | 27篇 |
2009年 | 37篇 |
2008年 | 17篇 |
2007年 | 37篇 |
2006年 | 27篇 |
2005年 | 23篇 |
2004年 | 29篇 |
2003年 | 12篇 |
2002年 | 17篇 |
2001年 | 18篇 |
2000年 | 19篇 |
1999年 | 22篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有593条查询结果,搜索用时 0 毫秒
361.
传统窄带模型仅能通过数值计算统计出超声信号渡越时间的测量性能。针对这一问题,提出基于拉盖尔模型计算理论克拉下限的方法。研究了拉盖尔函数及其时间导数的性质,得到时间导数内积矩阵,并将其应用到费舍尔矩阵中,能够快速精确计算克拉下限。对混合指数模型仿真表明,在高斯白噪声背景下,渡越时间方差与理论克拉下限具有良好的一致性;受窄带噪声和反射等因素影响,实测数据的渡越时间方差与理论克拉下限存在较大偏差。 相似文献
362.
针对飞行器跟踪预设轨迹的问题,提出非奇异快速终端滑模和角度约束的轨迹跟踪制导律。通过引入虚拟目标点,提出参考轨迹曲率半径的期望视线角约束条件,建立带有视线角约束并考虑自动驾驶仪动态特性的轨迹跟踪数学模型。为了保证在有限时间内跟踪预设轨迹并避免出现奇异问题,采用快速非奇异终端滑模和动态面控制方法进行制导律设计。推导出视线角误差和轨迹跟踪误差之间的数学关系,并利用Lyapunov稳定性准则证明轨迹跟踪误差最终有界任意小。与弹道成型轨迹跟踪制导律进行仿真对比,仿真结果表明所提出的制导律具有良好的跟踪性能及鲁棒性。 相似文献
363.
364.
对影响柴油机放热曲线精度计算的因素进行了讨论 ,并对影响放热率计算的主要问题如动态上止点修正、示功图光顺处理两个主要环节进行了分析研究 ,提出了解决方法 . 相似文献
365.
We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items. 相似文献
366.
We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019 相似文献
367.
We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
368.
We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
369.
传统的定位方法只能进行距离的估计,不能给出目标的深度信息,而时间反转处理基于声场的空间互易性,充分利用信道的多途特性.使能量在声源点得到聚焦,不仅能得到目标的距离,还能得到目标的深度.对于定位主动声自导鱼雷,可以利用其发射的脉冲信号,通过信道建模进行时间反转处理,使之匹配于真实信道,从而得到目标的距离和深度.实验仿真结果表明,此方法可以对主动声自导鱼雷进行距离和深度上的准确定位,而利用水平阵的阵长和阵元数目的优势,还能提高对弱信号的检测.这对潜艇水下防御有着重要的意义. 相似文献
370.