首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1124篇
  免费   18篇
  国内免费   8篇
  1150篇
  2025年   4篇
  2024年   2篇
  2023年   9篇
  2022年   10篇
  2021年   8篇
  2020年   15篇
  2019年   23篇
  2018年   13篇
  2017年   36篇
  2016年   53篇
  2015年   29篇
  2014年   59篇
  2013年   114篇
  2012年   72篇
  2011年   88篇
  2010年   59篇
  2009年   78篇
  2008年   69篇
  2007年   72篇
  2006年   55篇
  2005年   44篇
  2004年   47篇
  2003年   41篇
  2002年   37篇
  2001年   25篇
  2000年   25篇
  1999年   17篇
  1998年   4篇
  1997年   7篇
  1996年   12篇
  1995年   7篇
  1994年   3篇
  1993年   4篇
  1992年   2篇
  1991年   1篇
  1990年   3篇
  1989年   1篇
  1988年   2篇
排序方式: 共有1150条查询结果,搜索用时 0 毫秒
941.
介绍图像处理技术在桨叶表面应力分布测试试验中的应用情况 ,对实际使用中的图像处理技术进行了较详细的分析讨论 .经过处理后的桨叶试验图像 ,不仅增加了图像的清晰程度 ,而且从中可获得半定量以至定量的参数 ,以帮助对桨叶表面应力分布进行分析  相似文献   
942.
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ jN, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001  相似文献   
943.
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  相似文献   
944.
A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mkr(n?s)), O (nks(m?r))), and O (mkrn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.  相似文献   
945.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001  相似文献   
946.
本研究采用《学习适应性测验》、《中国中学生心理健康量表》对石河子市内初班初一、初二年级少数民族学生进行了测查。结果表明:从总体上看学习适应性与心理健康之间存在显著相关;从内容上看心理健康与学习适应性之间存在显著相关;学习态度、学习环境和心身健康三个方面受到心理健康的影响最大。  相似文献   
947.
新疆高校体育教师风险管理认知研究   总被引:1,自引:0,他引:1  
本研究以对新疆地区高校体育教师教学风险管理为研究内容,从高校体育教师对风险管理的认知角度进行分析,了解新疆地区高校体育教师对意外伤害风险管理的认知程度,以期发掘受到忽视的意外伤害危险因素,从而找到规避体育教学风险的捷径,更好地服务于体育教学。  相似文献   
948.
在新课程的背景下,根据教学实际采用适应差异、注意个性发展的多样化教学模式,以弥补传统教学模式的不足,成为我国今后教学模式改革的重要走向。本文在通过对国内外历史上各种不同的教学模式与理念分析对比的基础上,对如何在高中物理教学过程中应用不同的教学模式、实施各种教学模式时所需注意的问题进行探讨,并提出建设性的意见。  相似文献   
949.
一般带容量限制的网络图中流出源点与流入汇点的流量相等,但在实际应用中,存在一类流量经过弧发生变化的网络,使得流出源点与流入汇点的流量不相等。针对此类问题,建立了增益网络最大流模型,并通过增设虚弧将增益网络转换成循环网络,利用循环网络中汇点流量瞬间平衡的优点简化了模型。最后,结合实例进行分析,编写程序对实例进行了计算,计算结果验证了该模型的有效性。  相似文献   
950.
    
In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in begin{align*}mathcal O(n^2kappa)end{align*} time, where n is the planning horizon and begin{align*}kappa=mathcal O(n)end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号