全文获取类型
收费全文 | 487篇 |
免费 | 173篇 |
国内免费 | 38篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 6篇 |
2021年 | 18篇 |
2020年 | 11篇 |
2019年 | 13篇 |
2018年 | 6篇 |
2017年 | 29篇 |
2016年 | 33篇 |
2015年 | 18篇 |
2014年 | 34篇 |
2013年 | 52篇 |
2012年 | 30篇 |
2011年 | 35篇 |
2010年 | 29篇 |
2009年 | 40篇 |
2008年 | 44篇 |
2007年 | 36篇 |
2006年 | 31篇 |
2005年 | 33篇 |
2004年 | 27篇 |
2003年 | 24篇 |
2002年 | 23篇 |
2001年 | 18篇 |
2000年 | 12篇 |
1999年 | 20篇 |
1998年 | 16篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 18篇 |
1989年 | 2篇 |
排序方式: 共有698条查询结果,搜索用时 15 毫秒
31.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
32.
33.
34.
35.
采用低中频架构设计了一种0.18μm CMOS工艺的GPS/BDS双模可重构接收机射频前端,能在GPS L1模式或BDS B1模式下工作。通过频率自适应电路调整中频滤波器的时间常数,降低其频率不确定度;压控振荡器中加入4位开关电容阵列,以提高频率调谐范围和相位噪声性能;通过硬件复用的方式降低系统功耗。测试结果表明,在1.8 V电源电压下,功耗37.8 m W,电压增益为103 d B,GPS L1和BDS B1波段噪声系数均小于3.2 d B。 相似文献
36.
二进制偏移载波调制信号将在卫星导航系统中得到广泛应用。全球定位系统的L1C信号导频分量采用了时分二进制偏移载波调制,对此信号直接采用码参考波形算法消除多径时的鉴别曲线收敛点存在偏差,从而影响测距偏差。因此,提出一种时分二进制偏移载波调制信号的高精度无偏抗多径算法。通过时分的方式分别生成针对BOC(1,1)和BOC(6,1)分量的本地闸波,以保证鉴相函数在码相位无偏差时等于0。由于更好地利用了BOC(6,1)信号分量,该技术在实现无偏跟踪的同时,还能提高跟踪精度。 相似文献
37.
Gonzalo F-de-Córdoba 《Defence and Peace Economics》2016,27(4):549-570
This paper develops a Dynamic Stochastic General Equilibrium model where national security is an argument in the agent’s utility function and the government chooses optimally the level of military spending to maximize social welfare. National defense depends on military expenditure and on the strategic environment reflecting a potential hostile external threat. We use aggregate data on consumption, investment, and military spending for the US economy to estimate the parameters of the model. Estimation results suggest that consumption and national defense are complements and that military spending variability is mainly explained by external threat shocks although it also depends on the macroeconomic conditions. We compute impulse response functions of the main macroeconomic variables to several shocks: a total factor productivity shock, a defense technology shock, and a strategic environment shock. Surprisingly, we find that the optimal response to an increase in the external threat (a worsening in the strategic environment) will rise output by reducing consumption and increasing investment. 相似文献
38.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
39.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
40.