首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10497篇
  免费   1390篇
  国内免费   1106篇
电工技术   907篇
技术理论   1篇
综合类   1090篇
化学工业   133篇
金属工艺   62篇
机械仪表   433篇
建筑科学   403篇
矿业工程   104篇
能源动力   205篇
轻工业   72篇
水利工程   680篇
石油天然气   127篇
武器工业   128篇
无线电   2237篇
一般工业技术   585篇
冶金工业   924篇
原子能技术   18篇
自动化技术   4884篇
  2024年   109篇
  2023年   254篇
  2022年   348篇
  2021年   393篇
  2020年   404篇
  2019年   369篇
  2018年   332篇
  2017年   423篇
  2016年   473篇
  2015年   535篇
  2014年   781篇
  2013年   764篇
  2012年   896篇
  2011年   895篇
  2010年   668篇
  2009年   673篇
  2008年   682篇
  2007年   714篇
  2006年   542篇
  2005年   492篇
  2004年   424篇
  2003年   372篇
  2002年   274篇
  2001年   214篇
  2000年   144篇
  1999年   115篇
  1998年   115篇
  1997年   84篇
  1996年   65篇
  1995年   58篇
  1994年   39篇
  1993年   40篇
  1992年   26篇
  1991年   19篇
  1990年   16篇
  1989年   19篇
  1988年   12篇
  1987年   7篇
  1986年   12篇
  1985年   15篇
  1983年   8篇
  1980年   8篇
  1966年   10篇
  1965年   8篇
  1964年   17篇
  1963年   18篇
  1962年   9篇
  1961年   8篇
  1959年   12篇
  1956年   12篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.  相似文献   
2.
Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
3.
Evidence suggests that transient visual information, such as animations, may be more challenging to learn than static visualizations. However, when a procedural-manipulative task is involved, our evolved embodied cognition seems to reverse this transitory challenge. Hence, for object manipulative tasks, instructional animations may be more suitable than statics. We investigated this argument further by comparing animations with statics using a Lego task shown to university students, by examining three potential moderators of effectiveness: (a) the environment of manipulation (virtual or physical), (b) the quality of visual information (focused or unfocused), and (c) the presence of hands (no hands or with hands). In Experiment 1 we found an advantage of animation over statics, and no differences among the environments. In Experiment 2, we again observed an animation advantage, a small advantage of focused static information compared to unfocused static information, and a positive effect of not showing the hands.  相似文献   
4.
讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。  相似文献   
5.
本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法,该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法,能够较快的收敛到最佳的功率点。同时,易于用硬件和软件实现。  相似文献   
6.
贾乐堂 《河北冶金》2002,(4):3-6,46
分析了河北冶金近期行业发展特别关注的几个问题:钢铁生产发展过快;产业结构缺陷,资源供应和环境压力。同时,文章从分析国内外市场形势和国家宏观政策形势入手,提出了河北冶金工业对产品结构调整,工艺装备调整和组织结构调整的必要性,任务和需注意的问题。  相似文献   
7.
8.
根据美国国家标准学会 (ANSI)理事会主席、ISO现任主席OliverR .Smoot在日本东京召开的国际标准化协议会上的讲演整理。  相似文献   
9.
In this paper, we generalize the Linear VaR method from portfolios with normally distributed risk factors to portfolios with mixture of elliptically distributed ones. We treat both the Expected Shortfall and the Value-at-Risk of such portfolios. Special attention is given to the particular case of a mixture of multivariate t-distributions. This is a part of J. SADEFO-KAMDEM PhD Thesis[12] of the Université de Reims, France . It has been presented at the workshop on modelling and computation in Financial Engineering at Bad Herrenalb, Germany May 6-8, 2003. The author is an associate professor at the Department of mathematics, université d’Evry Val d’Essonne.  相似文献   
10.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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