首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   578篇
  免费   104篇
  国内免费   4篇
  2022年   1篇
  2021年   6篇
  2020年   9篇
  2019年   25篇
  2018年   26篇
  2017年   38篇
  2016年   36篇
  2015年   23篇
  2014年   30篇
  2013年   118篇
  2012年   30篇
  2011年   28篇
  2010年   30篇
  2009年   25篇
  2008年   31篇
  2007年   40篇
  2006年   30篇
  2005年   24篇
  2004年   25篇
  2003年   18篇
  2002年   19篇
  2001年   17篇
  2000年   14篇
  1999年   7篇
  1998年   3篇
  1997年   4篇
  1996年   3篇
  1995年   6篇
  1994年   3篇
  1993年   5篇
  1992年   2篇
  1991年   6篇
  1990年   2篇
  1989年   2篇
排序方式: 共有686条查询结果,搜索用时 15 毫秒
661.
运用泛函理论,对方差最小原则下射表逼近进行分析,给出了在给定基函数形式条件下的统一计算公式,并对最小二乘方法作了改进,消除系数矩阵的原理误差,给出了提高精度的方法。最后,提出了一个选择基函数的有效方法。  相似文献   
662.
介绍了现代通信技术的发展概况,其中对移动通信作了比较详细的说明,并针对基地通信现状和常规武器试验特点,对基地通信现代化建设,提出了有益的建议。  相似文献   
663.
以Cocl_2·6H_2O和NiCl_2·6H_2O为模板剂,邻苯二胺和邻苯二醛为原料,在无水乙醇中模板合成了两种新型的大环席夫碱配合物。通过元素分析、摩尔电导和磁化率的测定,红外光谱、紫外可见光谱等项表征,确定了配合物的组成和结构,进而观察和研究了它们的电致变色现象,并对其电致变色机理进行了初步探讨。  相似文献   
664.
科研选题中,周期短、见效快的课题重复率较高,其原因与科技人员晋级需求,社会集团易对“短、平、快”选题投资,科研管理人员的情报意识淡漠等因素有关。改变现状需要科技政策的制定者对基础科学研究和从事基础科学研究的人员给予更多的重视和政策的倾斜。科研管理部门应把握科研方向、人才培养、选题调整及发挥专家对审题的充分论证。采取各项综合措施,可望降低科研选题的重复。  相似文献   
665.
本文论述了一个后勤管理信息系统生成系统(LMIS-GS)的设计与实现,本系统综合采用了数据库模式自动生成技术、软件可重用技术、操作对象、控制信息与程序相分离的模块编码技术,系统中通过引入部件的概念,把庞大复杂的LMIS系统划分为若干个可独立研制开发的部件实体。LMIS的生成就是部件的组装,部件的生成就是数据基的组装与填写。系统还提供了数据库生成的两种方式,即可自动生成3NF的关系数据库模式。  相似文献   
666.
地形图中包含了大量的字体丰富的汉字注记 ,正确提取并识别这些汉字是图纸处理中的关键组成部分。简要分析了交互提取及自动提取两种方法的优缺点 ,提出并实现了一种基于主动知识库的结合两者优点的汉字注记智能提取方法 ,取得了很好的应用效果。  相似文献   
667.
If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver Mt/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an Mt/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015  相似文献   
668.
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015  相似文献   
669.
Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015  相似文献   
670.
In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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