首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1221篇
  免费   79篇
电工技术   31篇
综合类   18篇
化学工业   289篇
金属工艺   17篇
机械仪表   14篇
建筑科学   70篇
矿业工程   15篇
能源动力   18篇
轻工业   241篇
水利工程   19篇
石油天然气   2篇
无线电   51篇
一般工业技术   198篇
冶金工业   115篇
原子能技术   2篇
自动化技术   200篇
  2024年   3篇
  2023年   16篇
  2022年   10篇
  2021年   61篇
  2020年   32篇
  2019年   26篇
  2018年   47篇
  2017年   40篇
  2016年   49篇
  2015年   40篇
  2014年   46篇
  2013年   82篇
  2012年   61篇
  2011年   101篇
  2010年   52篇
  2009年   43篇
  2008年   83篇
  2007年   73篇
  2006年   49篇
  2005年   57篇
  2004年   37篇
  2003年   35篇
  2002年   24篇
  2001年   27篇
  2000年   17篇
  1999年   22篇
  1998年   27篇
  1997年   21篇
  1996年   19篇
  1995年   14篇
  1994年   12篇
  1993年   15篇
  1992年   8篇
  1991年   6篇
  1990年   5篇
  1989年   3篇
  1988年   2篇
  1987年   9篇
  1986年   3篇
  1984年   2篇
  1980年   2篇
  1978年   2篇
  1975年   5篇
  1974年   1篇
  1973年   1篇
  1972年   1篇
  1967年   1篇
  1958年   1篇
  1955年   2篇
  1922年   1篇
排序方式: 共有1300条查询结果,搜索用时 15 毫秒
1.
2.
Proton-detected 100 kHz magic-angle-spinning (MAS) solid-state NMR is an emerging analysis method for proteins with only hundreds of microgram quantities, and thus allows structural investigation of eukaryotic membrane proteins. This is the case for the cell-free synthesized hepatitis C virus (HCV) nonstructural membrane protein 4B (NS4B). We demonstrate NS4B sample optimization using fast reconstitution schemes that enable lipid-environment screening directly by NMR. 2D spectra and relaxation properties guide the choice of the best sample preparation to record 2D 1H-detected 1H,15N and 3D 1H,13C,15N correlation experiments with linewidths and sensitivity suitable to initiate sequential assignments. Amino-acid-selectively labeled NS4B can be readily obtained using cell-free synthesis, opening the door to combinatorial labeling approaches which should enable structural studies.  相似文献   
3.
The present study investigates the impact of different key solutions of mobile phones on users' effectiveness and efficiency using the devices. In the first experiment, 36 children (9 - 14 years) and in the second experiment 45 young adults (19 - 33 years) completed four common phone tasks twice consecutively on three simulated phones that had identical menus, but different key solutions. An approach was undertaken to quantify the complexity of keys in three models, incorporating different factors contributing to the keys' complexity (number of key options, number of modes and number of modes with a semantically dissimilar meaning), in order to predict users' performance decrements. As a further main factor, the degree of the users' locus of control (LOC) was measured and interactions with performance outcomes were studied. As dependent measures, the number of inefficient keystrokes, the number of tasks solved and the processing time were determined. Results showed a significant effect of control key solutions on users' efficiency and effectiveness for both children and young adults. Moreover, children's LOC values significantly interacted with performance: children with low LOC values showed the lowest performance and no learnability, especially when using keys with a high complexity. From the three factors contributing to the complexity of keys, keys exerting different functions with semantically inconsistent meanings had the worst effect on performance. It is concluded that in mobile user interface design keys with semantically inconsistent meanings should be generally avoided.  相似文献   
4.
5.
Document caching and connection caching are extensively studied problems. In document caching, one has to maintain caches containing documents accessible in a network. In connection caching, one has to maintain a set of open network connections that handle data transfer. Previous work investigated these two problems separately while in practice the problems occur together: In order to load a document, one has to establish a connection between network nodes if the required connection is not already open. In this paper we present the first study that integrates document and connection caching. We first consider a very basic model in which all documents have the same size and the cost of loading a document or establishing a connection is equal to 1. We present deterministic and randomized online algorithms that achieve nearly optimal competitive ratios unless the size of the connection cache is extremely small. We then consider general settings where documents have varying sizes. We investigate a FAULT model in which the loading cost of a document is 1 as well as a BIT model in which the loading cost is equal to the size of the document.  相似文献   
6.
7.
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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