首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7951篇
  免费   837篇
  国内免费   490篇
电工技术   1677篇
综合类   986篇
化学工业   956篇
金属工艺   90篇
机械仪表   224篇
建筑科学   1018篇
矿业工程   276篇
能源动力   617篇
轻工业   240篇
水利工程   592篇
石油天然气   276篇
武器工业   43篇
无线电   321篇
一般工业技术   639篇
冶金工业   286篇
原子能技术   16篇
自动化技术   1021篇
  2024年   61篇
  2023年   180篇
  2022年   304篇
  2021年   332篇
  2020年   365篇
  2019年   313篇
  2018年   286篇
  2017年   329篇
  2016年   330篇
  2015年   320篇
  2014年   538篇
  2013年   566篇
  2012年   555篇
  2011年   565篇
  2010年   430篇
  2009年   473篇
  2008年   392篇
  2007年   556篇
  2006年   458篇
  2005年   389篇
  2004年   289篇
  2003年   257篇
  2002年   188篇
  2001年   176篇
  2000年   118篇
  1999年   110篇
  1998年   77篇
  1997年   67篇
  1996年   53篇
  1995年   36篇
  1994年   23篇
  1993年   17篇
  1992年   16篇
  1991年   16篇
  1990年   5篇
  1989年   10篇
  1988年   5篇
  1987年   10篇
  1986年   6篇
  1985年   16篇
  1984年   8篇
  1983年   16篇
  1982年   4篇
  1980年   6篇
  1975年   1篇
  1972年   1篇
  1966年   1篇
  1962年   1篇
  1956年   1篇
  1954年   1篇
排序方式: 共有9278条查询结果,搜索用时 15 毫秒
121.
Duality properties have been investigated by many researchers in the recent literature. They are introduced in this paper for a fully fuzzified version of the minimal cost flow problem, which is a basic model in network flow theory. This model illustrates the least cost of the shipment of a commodity through a capacitated network in terms of the imprecisely known available supplies at certain nodes which should be transmitted to fulfil uncertain demands at other nodes. First, we review on the most valuable results on fuzzy duality concepts to facilitate the discussion of this paper. By applying Hukuhara’s difference, approximated and exact multiplication and Wu’s scalar production, we exhibit the flow in network models. Then, we use combinatorial algorithms on a reduced problem which is derived from fully fuzzified MCFP to acquire fuzzy optimal flows. To give duality theorems, we utilize a total order on fuzzy numbers due to the level of risk and realize optimality conditions for providing some efficient combinatorial algorithms. Finally, we compare our results with the previous worthwhile works to demonstrate the efficiency and power of our scheme and the reasonability of our solutions in actual decision-making problems.  相似文献   
122.
Action-reward learning is a reinforcement learning method. In this machine learning approach, an agent interacts with non-deterministic control domain. The agent selects actions at decision epochs and the control domain gives rise to rewards with which the performance measures of the actions are updated. The objective of the agent is to select the future best actions based on the updated performance measures. In this paper, we develop an asynchronous action-reward learning model which updates the performance measures of actions faster than conventional action-reward learning. This learning model is suitable to apply to nonstationary control domain where the rewards for actions vary over time. Based on the asynchronous action-reward learning, two situation reactive inventory control models (centralized and decentralized models) are proposed for a two-stage serial supply chain with nonstationary customer demand. A simulation based experiment was performed to evaluate the performance of the proposed two models. Chang Ouk Kim received his Ph.D. in industrial engineering from Purdue University in 1996 and his B.S. and M.S. degrees from Korea University, Republic of Korea in 1988 and 1990, respectively. From 1998--2001, he was an assistant professor in the Department of Industrial Systems Engineering at Myongji University, Republic of Korea. In 2002, he joined the Department of Information and Industrial Engineering at Yonsei University, Republic of Korea and is now an associate professor. He has published more than 30 articles at international journals. He is currently working on applications of artificial intelligence and adaptive control theory in supply chain management, RFID based logistics information system design, and advanced process control in semiconductor manufacturing. Ick-Hyun Kwon is a postdoctoral researcher in the Department of Civil and Environmental Engineering at University of Illinois at Urbana-Champaign. Previous to this position, Dr. Kwon was a research assistant professor in the Research Institute for Information and Communication Technology at Korea University, Seoul, Republic of Korea. He received his B.S., M.S., and Ph.D. degrees in Industrial Engineering from Korea University, in 1998, 2000, and 2006, respectively. His current research interests are supply chain management, inventory control, production planning and scheduling. Jun-Geol Baek is an assistant professor in the Department of Business Administration at Kwangwoon University, Seoul, Korea. He received his B.S., M.S., and Ph.D. degrees in Industrial Engineering from Korea University, Seoul, Korea, in 1993, 1995, and 2001 respectively. From March 2002 to February 2007, he was an assistant professor in the Department of Industrial Systems Engineering at Induk Institute of Technology, Seoul, Korea. His research interests include machine learning, data mining, intelligent machine diagnosis, and ubiquitous logistics information systems. An erratum to this article can be found at  相似文献   
123.
该文首先介绍了决策支持系统的概念,然后通过对高校招生进行需求分析,利用微软的产品MSSQLServer2005构建了招生决策支持系统平台。  相似文献   
124.
对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。  相似文献   
125.
提出了一种在设备级备份系统基础上的数据按需恢复方法,这种方法突破了设备级备份只能实现设备级恢复的限制,使得设备级备份系统能够提供数据的设备级、数据块级和文件级的按需恢复.按需恢复方法通过虚拟设备技术实现.这种技术具有一定的通用性,并详细介绍了虚拟设备技术的设计与实现.  相似文献   
126.
带有两次订购机会且两阶段需求相关的Newsboy模型   总被引:1,自引:0,他引:1  
首先建立需求形式为一般随机变量情形下零售商的两次订购决策模型,并从理论上证明了在两个阶段需求相互独立情形下,零售商期望利润函数的下凹性及最优订购策略的存在唯一性,从而弥补了已有模型在寻求最优订购策略时采用数值方法所存在的缺憾;然后,建立两阶段需求相关情形下带有两次订购的Newsboy模型,给出了模型的分析解.数值实例验证了模型的求解过程,并得到了相关管理启示.  相似文献   
127.
针对Hopfield网络求解TSP问题时出现无效解和收敛性能差的问题,对约束条件能量函数进行改进,构造了一种求解TSP问题的遗传Hopfield神经网络算法,并与经典Hopfield神经网络求解TSP方法进行对比.实验结果表明,本文算法具有更好的整体求解性能.  相似文献   
128.
出行信息服务关键技术研究进展与问题探讨   总被引:2,自引:1,他引:1       下载免费PDF全文
随着城市交通出行需求的不断增长.出行信息服务应运而生.介绍了出行信息服务产业的国内外发展状况,提出了出行信息服务技术平台的体系结构.分析了通讯平台、定位平台和地图平台的地位、作用及其发展趋势.从交通信息采集与处理、空间数据模型、路径规划算法、短时交通预测、信息可视化和服务标准规范等方面评述了关键技术的研究进展,分析了出行信息服务产业发展需要重点解决的科学与技术问题.以促进出行信息服务技术研究的进一步深化.  相似文献   
129.
The Amazon rainforest is one of the world's greatest natural wonders and holds great importance and significance for the world's environmental balance. Around 60% of the Amazon rainforest is located in the Brazilian territory. The two biggest states of the Amazon region are Amazonas (the upper Amazon) and Pará (the lower Amazon), which together account for around 73% of the Brazilian Legal Amazon, and are the only states that are serviced by international airports in Brazil's north region. The purpose of this paper is to model and forecast sustainable international tourism demand for the states of Amazonas, Pará, and the aggregate of the two states. By sustainable tourism is meant a distinctive type of tourism that has relatively low environmental and cultural impacts. Economic progress brought about by illegal wood extraction and commercial agriculture has destroyed large areas of the Amazon rainforest. The sustainable tourism industry has the potential to contribute to the economic development of the Amazon region without destroying the rainforest. The paper presents unit root tests for monthly and annual data, estimates alternative time series models and conditional volatility models of the shocks to international tourist arrivals, and provides forecasts for 2006 and 2007.  相似文献   
130.
This paper1 considers a single product and a single stocking location production/inventory control problem given a non-stationary stochastic demand. Under a widely-used control policy for this type of inventory system, the objective is to find the optimal number of replenishments, their timings and their respective order-up-to-levels that meet customer demands to a required service level. We extend a known CP approach for this problem using three cost-based filtering methods. Our approach can solve to optimality instances of realistic size much more efficiently than previous approaches, often with no search effort at all. This work was supported by Science Foundation Ireland under Grant No. 03/CE3/I405 as part of the Centre for Telecommunications Value-Chain-Driven Research (CTVR) and Grant No. 00/PI.1/C075. 1This paper is an extended version of [19].  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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