全文获取类型
收费全文 | 538篇 |
免费 | 108篇 |
国内免费 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 9篇 |
2020年 | 12篇 |
2019年 | 11篇 |
2018年 | 8篇 |
2017年 | 24篇 |
2016年 | 22篇 |
2015年 | 15篇 |
2014年 | 38篇 |
2013年 | 34篇 |
2012年 | 42篇 |
2011年 | 45篇 |
2010年 | 31篇 |
2009年 | 54篇 |
2008年 | 42篇 |
2007年 | 39篇 |
2006年 | 39篇 |
2005年 | 31篇 |
2004年 | 34篇 |
2003年 | 29篇 |
2002年 | 23篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 4篇 |
排序方式: 共有671条查询结果,搜索用时 15 毫秒
121.
吴颖瑜 《国防科技大学学报》1990,12(3):102-105
本文把马尔可夫过程和目标规划结合起来,提出人才结构系统分析的单项控制和多项控制,并在单项控制模型的基础上发展成了多项控制模型,加强了模型的可信度和通用性。 相似文献
122.
金治明 《国防科技大学学报》1990,12(3):58-62
设(X_n,F_n)_1~∞是适应的报酬序列,(γ_n)是相应的snell 包,(A_n)是(γ_n)的Doob-Meyer 分解中零初值的可料增过程。本文继J.Klass 的研究证明了σ_1=inf{K≥1:X_k≥γ_k}是最小半最优的且是最大严格正则的广义规则,而K_0=sup{n≥0:A_n=0}<∞是最大正则的广义规则,从而得出了广义最优规则唯一性的另一表述。 相似文献
123.
An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025 相似文献
124.
王秋彧 《中国人民武装警察部队学院学报》2009,25(10):16-19
简述了煤制油的发展历程,分析了煤制油工业的火灾危险性和火灾特点,初步总结和探讨了煤制油工业火灾的扑救方法,对引发的相关问题作了一些思考。 相似文献
125.
王玉宝 《兵团教育学院学报》2009,19(1):28-30
经济全球化的趋势使民族文化传统遭遇到一种普遍的危机。目前,我国高等学校的古代文学研究与教学已经面临这种危机与挑战。本文认为转变古代文学研究中“纯学术”立场,关注精神价值,强化生命意识,多一些人间情怀,注重古典文学中的情感、心态等精神价值方面的研究,对传承文明,重塑华夏民族精神,具有重要意义。 相似文献
126.
从深刻理解数学概念内涵、熟悉数学公式及变式和注重解题过程分析三个方面谈如何有效培养学生的解题能力 ,进而促进学生数学能力的发展 相似文献
127.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
128.
Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
129.
This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011 相似文献
130.