首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1520篇
  免费   364篇
  国内免费   142篇
  2024年   9篇
  2023年   11篇
  2022年   17篇
  2021年   21篇
  2020年   27篇
  2019年   30篇
  2018年   30篇
  2017年   80篇
  2016年   84篇
  2015年   52篇
  2014年   114篇
  2013年   102篇
  2012年   122篇
  2011年   119篇
  2010年   80篇
  2009年   128篇
  2008年   100篇
  2007年   92篇
  2006年   89篇
  2005年   95篇
  2004年   95篇
  2003年   69篇
  2002年   60篇
  2001年   54篇
  2000年   50篇
  1999年   42篇
  1998年   39篇
  1997年   42篇
  1996年   31篇
  1995年   23篇
  1994年   31篇
  1993年   27篇
  1992年   22篇
  1991年   25篇
  1990年   5篇
  1989年   3篇
  1988年   4篇
  1987年   2篇
排序方式: 共有2026条查询结果,搜索用时 15 毫秒
981.
遥控两栖车的控制系统由控制端和受控端2部分组成.控制端负责采集各种驾驶信号,然后通过电台将控制信号传输到受控端.受控端接收到控制信号后,使相应的执行机构动作,达到车辆的遥控驾驶.本文着重进行了控制端的软硬件设计.该系统在试验中各项性能达到了使用要求.  相似文献   
982.
随着农业的发展,农业面源污染问题日益突出,农业面源污染已成为危害生态 环境的最重要的因子。在简要分析了农业面源污染的成因和目前农业面源污染研究情况的 基础上,对土壤生物热力学在农业面源控制上的应用机理进行了具体的阐述,结果表明土壤 生物热力学在指导农业生产过程中充盈着清洁生产理念,为农业面源污染控制提供了理论 基础和科学方法。  相似文献   
983.
提出了一种基于Rough集理论的数据库推理泄漏通道消除方法。在由数据库中所有数据生成的不完备决策表上,该方法应用Rough集理论,分析提取出敏感和非敏感数据之间的确定性推理关系,以此产生推理控制规则。利用这些规则对数据库系统返回给普通用户的数据动态地做最小修改,防止推理通道的产生。实验结果表明,该方法可扩展性强,在保证较高的数据库安全性的同时提高了数据可用性。  相似文献   
984.
挠性卫星姿态的模糊神经控制   总被引:1,自引:0,他引:1  
在卫星的姿态控制领域里,智能控制技术得到越来越多的关注。把模糊神经控制引入到挠性卫星姿态稳定控制中,给出了详尽的实现方法,并推导了模糊神经网络的自学习算法。由于在模糊神经控制器中规则参数初值的确定吸收利用了经验知识,故提高了模糊神经控制器的在线学习速度。仿真结果表明:该控制算法通过在线学习能有效地克服挠性卫星的不确定性,具有较强的鲁棒性,从而可实现较高精度的卫星姿态控制。  相似文献   
985.
An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
986.
This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
987.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
988.
We study markets for surplus components, which allow manufacturers with excess component inventory to sell to firms with a shortage. Recent developments in internet commerce have the potential to greatly increase the efficiency of such markets. We develop a one‐period model in which a monopolist supplier sells to a number of independent manufacturers who are uncertain about demand for final goods. After uncertainty is resolved, the manufacturers have the opportunity to trade. Because uncertainty is over demand functions, the model allows us to endogenize both the price of final goods and the price of components in wholesale and surplus markets. We derive conditions on demand uncertainty that determine whether a surplus market will increase or decrease supplier profits. Increased costs of transacting on the surplus market may benefit manufacturers, because of the impact of these costs on the supplier's pricing power. The surplus market can decrease overall efficiency of the supply chain, since the benefit of better allocation of components may be outweighed by an increased double‐marginalization effect. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
989.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
990.
This article studies the optimal control of a periodic‐review make‐to‐stock system with limited production capacity and multiple demand classes. In this system, a single product is produced to fulfill several classes of demands. The manager has to make the production and inventory allocation decisions. His objective is to minimize the expected total discounted cost. The production decision is made at the beginning of each period and determines the amount of products to be produced. The inventory allocation decision is made after receiving the random demands and determines the amount of demands to be satisfied. A modified base stock policy is shown to be optimal for production, and a multi‐level rationing policy is shown to be optimal for inventory allocation. Then a heuristic algorithm is proposed to approximate the optimal policy. The numerical studies show that the heuristic algorithm is very effective. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 43–58, 2011  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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