首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   15150篇
  免费   2541篇
  国内免费   2007篇
电工技术   912篇
综合类   1726篇
化学工业   2342篇
金属工艺   317篇
机械仪表   735篇
建筑科学   822篇
矿业工程   462篇
能源动力   348篇
轻工业   1720篇
水利工程   571篇
石油天然气   577篇
武器工业   197篇
无线电   1184篇
一般工业技术   1125篇
冶金工业   526篇
原子能技术   101篇
自动化技术   6033篇
  2024年   101篇
  2023年   244篇
  2022年   539篇
  2021年   619篇
  2020年   711篇
  2019年   614篇
  2018年   623篇
  2017年   696篇
  2016年   819篇
  2015年   752篇
  2014年   1106篇
  2013年   1073篇
  2012年   1351篇
  2011年   1278篇
  2010年   1097篇
  2009年   989篇
  2008年   901篇
  2007年   1035篇
  2006年   846篇
  2005年   718篇
  2004年   589篇
  2003年   486篇
  2002年   399篇
  2001年   357篇
  2000年   295篇
  1999年   256篇
  1998年   209篇
  1997年   164篇
  1996年   133篇
  1995年   118篇
  1994年   104篇
  1993年   92篇
  1992年   60篇
  1991年   65篇
  1990年   49篇
  1989年   25篇
  1988年   25篇
  1987年   20篇
  1986年   15篇
  1985年   20篇
  1984年   18篇
  1983年   13篇
  1982年   21篇
  1981年   5篇
  1980年   5篇
  1979年   4篇
  1964年   4篇
  1963年   4篇
  1960年   5篇
  1959年   6篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.  相似文献   
2.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.  相似文献   
3.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.  相似文献   
4.
前期杂交优化后赤芝菌种经液体深层发酵后,提取灵芝菌丝体多糖,并过DEAE-Sepharose Fast Flow柱分离纯化,利用高效体积排阻色谱(HPSEC)检测多糖级分的纯度,采用完全酸水解PMP柱前衍生化RP—HPLC测定多糖级分的单糖组成,多角度光散射仪联用装置(SEC—MALLS)测定其绝对重均分子量(Mw),并且根据分子旋转半径与分子摩尔数的关系曲线斜率初步推断其空间构象。结果显示:分离纯化得到3个多糖级分GLMP1、GLMP2和GLMP3,HPSEC检测其峰面积百分比分别为93.58%,97.64%,99.19%,单糖组成分析结果表明GLMP1、GLMP2和GLMP3均含有甘露糖、鼠李糖、半乳糖醛酸、葡萄糖、半乳糖、木糖、阿拉伯糖和岩藻糖,但单糖摩尔比各异。SEC—MALLS测试GLMP1、GLMP2和GLMP3的Mw分别为4.526×105,4.603×104,3.760×103 g/mol,3个多糖级分构象可能均为高度紧缩且具有分支结构的聚合物。  相似文献   
5.
6.
本文证明了当m>4时(2m,2,m)非线性等重码不是最佳检错码。  相似文献   
7.
通过密度测定和DSC热分析,观测了超高分子量聚乙烯的辐射效应。实验结果表明:在吸收剂量0—1.13MGy范围内,密度随吸收剂量的增加而增大,熔化热和熔点也有所增加,特别是在低剂量范围内增加十分明显。以上结果都说明,超高分子量聚乙烯在辐照过程中,结晶在完善或有新的结晶形成  相似文献   
8.
Poly(vinyl alcohol) is crosslinked in dilute solution (c=0.1 wt%) with glutaraldehyde. The reaction product is characterized by viscometry and gel permeation chromatography (g.p.c.). The intrinsic viscosity decreases with increasing degree of crosslinking and does not depend on temperature. G.p.c. reveals that the reaction product is not homogeneous, but consists of a mixture of particles with different sizes, possibly both intra- and intermolecularly crosslinked molecules. The intramolecularly crosslinked molecules are smaller in size than the initial polymer molecules and their size depends on the degree of crosslinking. They possess a narrow particle size distribution even if the initial polymer sample had a broad molecular weight distribution.  相似文献   
9.
Hock Chuan Chan   《Displays》2008,29(3):260-267
It is important to verify assumptions and methods of image retrieval against actual human behavior. A study was conducted to compare similarity methods of color histograms against human assessment of similarity. The similarity methods tested include basic histogram intersection, center histogram matching, locality histogram matching, and size-weighted histogram matching. 161 subjects participated in the empirical study. The findings, based on Spearman correlation analysis, showed that both the basic histogram intersection method and size-weighted histogram are very close to human assessment of similarity (Spearman correlation coefficient of 0.915). The other two are not close to human judgment on similarity. This study illustrates an alternative approach to evaluating matching algorithms. Unlike the usual measures of recall and precision, this approach emphasizes human validation. Fewer images are required with the use of statistical testing.  相似文献   
10.
用弯曲梁流变仪、直接拉伸试验机对7种国内外油源沥青样品进行了低温抗裂性能的评价,从沥青的四组分、相对分子质量及其分布来分析其对沥青低温抗裂性能的影响,结果表明,沥青的相对分子质量分布宽,对沥青的低温抗裂性能有利。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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