首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   115362篇
  免费   18594篇
  国内免费   4038篇
工业技术   137994篇
  2024年   225篇
  2023年   873篇
  2022年   1615篇
  2021年   2548篇
  2020年   3104篇
  2019年   4574篇
  2018年   4688篇
  2017年   5202篇
  2016年   5636篇
  2015年   6369篇
  2014年   7294篇
  2013年   9238篇
  2012年   7912篇
  2011年   8045篇
  2010年   7822篇
  2009年   7621篇
  2008年   7170篇
  2007年   6755篇
  2006年   6447篇
  2005年   5367篇
  2004年   4661篇
  2003年   4308篇
  2002年   4806篇
  2001年   4191篇
  2000年   3179篇
  1999年   2035篇
  1998年   1206篇
  1997年   985篇
  1996年   820篇
  1995年   725篇
  1994年   541篇
  1993年   412篇
  1992年   330篇
  1991年   259篇
  1990年   219篇
  1989年   143篇
  1988年   126篇
  1987年   106篇
  1986年   58篇
  1985年   75篇
  1984年   59篇
  1983年   46篇
  1982年   24篇
  1981年   23篇
  1980年   24篇
  1979年   21篇
  1978年   12篇
  1977年   17篇
  1976年   26篇
  1975年   10篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
This paper describes a model that can account for ad hoc user-responses to argument interrogative type of system-initiated questions. Successful implementation of the model can provide an alternative solution that is more effective than the menu-driven approach that has been proposed as a meager solution to enable the system to ask a question to the user. The proposed model assumes that when the system asks a question, it maintains an expectation of the potential answers. The system then uses the expectation as the focus to perform the most likely interpretation of the user's response. Without using such a focus the interpretation process could be unbounded. The interpretation process is mapped into a heuristic search problem. The interpretation process results in identifying a particular expectation-response relationship type, which the system can use to tailor its response strategy with respect to the given user-response. A prototype has been constructed to demonstrate the soundness of the proposed model  相似文献   
82.
Applies the technique of parallel processing to concept learning. A parallel version-space learning algorithm based upon the principle of divide-and-conquer is proposed. Its time complexity is analyzed to be O(k log2n) with n processors, where n is the number of given training instances and k is a coefficient depending on the application domains. For a bounded number of processors in real situations, a modified parallel learning algorithm is then proposed. Experimental results are then performed on a real learning problem, showing that our parallel learning algorithm works, and being quite consistent with the results of theoretical analysis. We conclude that when the number of training instances is large, it is worth learning in parallel because of its faster execution  相似文献   
83.
The transmembrane segments of sarcoplasmic reticulum Ca(2+)-ATPase were determined by trypsinization of cytoplasmic side-out intact sarcoplasmic reticulum vesicles. The membrane portion of tryptic digest comprising the transmembrane fragments, joined by the intravesicular segments, was separated by sodium dodecyl sulfate-polyacrylamide gel electrophoresis after labeling with fluorescein 5-maleimide in the presence of sodium dodecyl sulfate. In this way, seven fluorescent bands of tryptic fragments below 11 kDa were observed which were derived from 4 pairs of membrane spanning segments and one hydrophobic sequence at the C-terminal end. Two peptides of 10.8 and 10.6 kDa had the identical N-terminal sequence beginning at Glu826, representing the transmembrane segments M7 and M8 and their connecting loop. A band at 8.1 kDa contained one peptide beginning at Tyr36 (M1/loop/M2). A 7.7-kDa peptide starting at Leu253 (M3/loop/M4) and a 7.3-kDa peptide beginning at Ala752 (M5/loop/M6) were also observed. A band at 6.7 kDa contained two peptides, one beginning at Ser48 (M1/loop/M2) and another beginning at Tyr763 (M5/loop/M6). In addition, a 4-kDa peptide beginning at Met925 was observed. The size of this peptide did not allow for a complete pair of transmembrane segments, but this peptide could have been derived from trypsinolysis between the last pair of membrane spanning segments. These data therefore provide biochemical evidence for at least 8 transmembrane segments and perhaps two more at the C-terminal end of the enzyme.  相似文献   
84.
甲醇氧化羰化制碳酸二甲酯产物气相色谱分析   总被引:6,自引:1,他引:5  
以Chromosorb 10 1为固定相 ,气相色谱法分析甲醇氧化羰化制碳酸二甲酯产物中水、甲醇、乙酸甲酯和碳酸二甲酯等组份的含量 ,考察了柱温 ,载气流量对分离度的影响 ,确定了适宜的分析条件 ,并用校正面积归一化法定量。该方法操作简便 ,快速 ,精度高 ,重现性好  相似文献   
85.
水溶性油墨用富马酸改性松香树脂的研制   总被引:1,自引:0,他引:1  
介绍了一种水溶性富马酸改性松香树脂的制备方法 ,选取了较佳的工艺条件 ,本产品经国内几家油墨厂使用 ,结果表明适合水溶性油墨的应用要求  相似文献   
86.
环境中氚和碳-14   总被引:4,自引:0,他引:4  
方栋  李红 《辐射防护》2002,22(1):51-56
本文介绍了加拿大恰克河实验室有关氚和碳-14在环境中行为和评价的研究。  相似文献   
87.
In this letter, a concise process technology is proposed for the first time to enable the fabrication of good quality three-dimensional (3-D) suspended radio frequency (RF) micro-inductors on bulk silicon, without utilizing the lithography process on sidewall and trench-bottom patterning. Samples were fabricated to demonstrate the applicability of the proposed process technology.  相似文献   
88.
讨论了如何选择适当的规则,如何建立简洁实用的规则库,如何应用规则库.提出了四种主要的光学邻近矫正规则,在实验结果中列举了规则库中的部分数据.利用规则矫正后的版图光刻得到的硅片图形有了明显的改善.规则库的自动建立部分 (OPCL)是基于规则的光学邻近矫正系统的重要组成部分.  相似文献   
89.
In this paper, a localized MEI method (L-MEI) is developed and combined with the domain decomposition method (DDM) for the simulation of scattering by a concave cylinder. In the L-MEI, the whole domain is decomposed into many subdomains. Different from the conventional MEI method, the MEI coefficients of the L-MEI method in each subdomain are only dependent on the localized metrons that are defined in the subdomain. The localization of metrons has the following advantages: (1) speeding up the calculation of MEI coefficients and saving memory, (2) making the MEI method available for concave structures, and (3) obtaining a band sparse matrix directly without any modification  相似文献   
90.
基于数字信号处理器的直流电机控制系统   总被引:4,自引:0,他引:4  
介绍了定点数字信号处理器(DSP)TMS320F240的一般性能及其在永磁无刷直流电机控制上的应用,给出了硬件设计方案、软件策略及输出结果。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号