全文获取类型
收费全文 | 346篇 |
免费 | 103篇 |
国内免费 | 25篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 14篇 |
2016年 | 22篇 |
2015年 | 16篇 |
2014年 | 24篇 |
2013年 | 18篇 |
2012年 | 20篇 |
2011年 | 18篇 |
2010年 | 18篇 |
2009年 | 29篇 |
2008年 | 23篇 |
2007年 | 23篇 |
2006年 | 35篇 |
2005年 | 21篇 |
2004年 | 23篇 |
2003年 | 17篇 |
2002年 | 16篇 |
2001年 | 19篇 |
2000年 | 22篇 |
1999年 | 8篇 |
1998年 | 6篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 12篇 |
1989年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有474条查询结果,搜索用时 31 毫秒
31.
32.
机械构件的不同的失效模式之间具有一定的相关性,而且随机载荷作用次数对机械构件的可靠性有一定程度的影响。因此对机械构件进行可靠性灵敏度分析时,需要充分考虑其不同失效模式和载荷作用次数的影响。通过运用顺序统计量理论考虑载荷多次作用以及多种失效模式条件下机械构件可靠性及可靠性灵敏度的变化规律,运用随机摄动理论和四阶矩技术,建立一种考虑载荷作用次数的多失效模式机械构件可靠性灵敏度分析数值方法的应力强度干涉模型。在随机变量前四阶矩已知的情况下,结合灵敏度分析的梯度算法,推导出关于随机变量均值和方差的灵敏度计算公式。以某履带车辆底盘扭力轴为例进行计算,得到其可靠度随载荷作用次数、随机变量均值和方差而改变的可靠性灵敏度变化曲线,为扭力轴的可靠性优化提供一定的理论依据。研究成果可以推广到相关机械可靠性灵敏度设计和结构优化领域,具有非常重要的实用意义。 相似文献
33.
34.
广泛工作在ISM(Industrial,Scientific and Medical)频段的无线传感器网络面临严重的频谱稀缺问题。在无线通信中,动态频谱分配被认为是提高频谱效能的重要途径。针对典型集中式管理的认知无线传感器网络设计了基于图着色结合负载强度的高效频谱分配算法。首先在协议干扰模型下确保频谱资源在空间上充分利用,随后综合考虑节点负载强度与公平性建立优化模型并按照乘子法加拟牛顿法框架求解最优值。仿真实验表明算法与固定频谱分配方式和传统自适应频谱分配算法相比,在系统吞吐量和节点缓冲区队列长度两个关键性能指标上具有显著优势。 相似文献
35.
36.
二进制偏移载波调制信号将在卫星导航系统中得到广泛应用。全球定位系统的L1C信号导频分量采用了时分二进制偏移载波调制,对此信号直接采用码参考波形算法消除多径时的鉴别曲线收敛点存在偏差,从而影响测距偏差。因此,提出一种时分二进制偏移载波调制信号的高精度无偏抗多径算法。通过时分的方式分别生成针对BOC(1,1)和BOC(6,1)分量的本地闸波,以保证鉴相函数在码相位无偏差时等于0。由于更好地利用了BOC(6,1)信号分量,该技术在实现无偏跟踪的同时,还能提高跟踪精度。 相似文献
37.
唐新 《兵团教育学院学报》2010,20(6):53-56
现代排球技战术的飞速发展,运动员的不断"身高化"使得排球比赛的网上对抗异常激烈,当主、副攻位置遭到拦网的阻挠而不能有效的扣球时,积极合理的采用排球吊球技术可以达到扣球同样效果,所以在平时的训练和比赛中要重视排球吊球在比赛中起到的作用。 相似文献
38.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
39.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
40.
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 相似文献