首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8988篇
  免费   957篇
  国内免费   810篇
电工技术   499篇
综合类   1016篇
化学工业   368篇
金属工艺   264篇
机械仪表   656篇
建筑科学   478篇
矿业工程   126篇
能源动力   271篇
轻工业   95篇
水利工程   306篇
石油天然气   350篇
武器工业   106篇
无线电   838篇
一般工业技术   703篇
冶金工业   123篇
原子能技术   124篇
自动化技术   4432篇
  2024年   13篇
  2023年   97篇
  2022年   101篇
  2021年   138篇
  2020年   182篇
  2019年   231篇
  2018年   173篇
  2017年   233篇
  2016年   235篇
  2015年   291篇
  2014年   410篇
  2013年   539篇
  2012年   460篇
  2011年   635篇
  2010年   489篇
  2009年   584篇
  2008年   616篇
  2007年   716篇
  2006年   608篇
  2005年   554篇
  2004年   449篇
  2003年   389篇
  2002年   367篇
  2001年   271篇
  2000年   273篇
  1999年   219篇
  1998年   204篇
  1997年   196篇
  1996年   166篇
  1995年   131篇
  1994年   161篇
  1993年   116篇
  1992年   87篇
  1991年   88篇
  1990年   44篇
  1989年   55篇
  1988年   37篇
  1987年   30篇
  1986年   21篇
  1985年   33篇
  1984年   24篇
  1983年   26篇
  1982年   16篇
  1981年   11篇
  1980年   8篇
  1979年   5篇
  1978年   5篇
  1976年   4篇
  1974年   3篇
  1962年   2篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
进行了CO2泡沫压裂液的室内配制、流变性测定以及摩阻计算方法研究。室内实验中观测了CO2泡沫压裂液的形成、动态变化、泡沫结构,测定了CO2泡沫压裂液的流变性,发现其属于假塑性非牛顿流体。推导了CO2泡沫压裂液在油管内流动的摩阻计算公式,计算了不同管径、不同排量、不同泡沫质量时的摩阻曲线,进行了井筒内CO2泡沫压裂液摩阻压降实测,与计算方法相比误差在工程应用允许范围内。该研究所得到的CO2泡沫压裂液流动特性、摩阻压降计算方法、经验图版等,可供工程应用中参考。  相似文献   
102.
针对化学反应优化对反馈信息利用不足导致后期求解效率低的问题,提出化学反应蚁群优化算法.该算法利用化学反应优化生成较优解,通过信息素转换策略将较优解转换为蚁群算法的初始信息素,最后由蚁群算法累积更新信息素得到最优解.以TSP为例进行仿真,结果表明,与化学反应优化、蚁群算法、模拟退火算法相比,所提算法具有更高的寻优能力、收敛效率和计算效率.  相似文献   
103.
为提高基于单播测量的网络链路时延分布估计速度,提出了一种基于显式计算的单播链路时延快速估计方法.由于网络设备多样化导致链路时延特征存在差异,首先根据端到端测量数据为各链路分配不同的离散间隔;然后利用背靠背探测包在网络中引入的二层二叉树结构,通过显式计算推断各链路的时延分布,能明显提高估计速度.仿真结果表明,该方法将链路时延分布的估计时间降低至数百毫秒,同时更准确地捕获链路时延特征.该方法基于显式计算,计算复杂度非常低,因此能够满足实际应用的实时性要求.  相似文献   
104.
基于几何统计差异性的伪造印鉴识别方法   总被引:1,自引:0,他引:1  
针对印鉴识别任务中有效印文的提取以及伪造印鉴的识别这两个难点问题,建立在监督分类体系下的印鉴识别系统.利用有效印文与背景的颜色统计差异以及真伪印鉴间的几何统计差异分别解决上述难点.在构建的包含3000个印鉴的印鉴数据库上进行实验,实验结果表明,该方法对于有效印文的提取准确率可达到(95.27±3.73%),对于伪造印鉴的识别准确率可达到97.62%,具有可行性和有效性.  相似文献   
105.
Abstract. A symbolic method which can be used to obtain the asymptotic bias and variance coefficients to order O(1/n) for estimators in stationary time series is discussed. Using this method, the large‐sample bias of the Burg estimator in the AR(p) for p = 1, 2, 3 is shown to be equal to that of the least squares estimators in both the known and unknown mean cases. Previous researchers have only been able to obtain simulation results for the Burg estimator's bias because this problem is too intractable without using computer algebra. The asymptotic bias coefficient to O(1/n) of Yule–Walker as well as least squares estimates is also derived in AR(3) models. Our asymptotic results show that for the AR(3), just as in the AR(2), the Yule–Walker estimates have a large bias when the parameters are near the nonstationary boundary. The least squares and Burg estimates are much better in this situation. Simulation results confirm our findings.  相似文献   
106.
The objective of this study was to determine how the fracture of adhesive joints depends on elastic beam parameters describing the adherends and the applied loads. The basic specimen geometry was the cracked lap shear joint constructed of aluminium alloy with various adherend and bondline thicknesses. Loads were applied in different combinations of bending, tension and shear to generate a failure envelope for each adhesive and specimen geometry. It was found that crack propagation for precracked specimens occured at a critical strain energy release rate but was also a function of the GI/GII ratio and the bondline thickness. The experiments also showed that the loads required to propagate a crack in a precracked specimen were always lower than the loads required to break the fillet. Hence, by treating uncracked joints as being cracked, where the fictitious crack tip is assumed to coincide with the location of the fillet, a conservative estimate of the failure load is obtained.  相似文献   
107.
An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , ,  and  have built a systematical theory. In this paper, we reduce SRP on domain size k≥3k3 to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3k3.  相似文献   
108.
We study asynchronously communicating open systems modeled as Petri nets with an interface. An accordance preorder describes when one open system can be safely replaced by another open system without affecting some behavioral property of the overall system. Although accordance is decidable for several behavioral properties if we assume a previously known bound on the maximal number of pending messages, we show that it is not decidable without this assumption.  相似文献   
109.
We introduce order-k α-hulls and α-shapes – generalizations of α-hulls and α-shapes. Being also a generalization of k-hull (known in statistics as “k-depth contour”), order-k α-hull provides a link between shape reconstruction and statistical depth. As a generalization of α-hull, order-k α-hull gives a robust shape estimation by ignoring locally up to k outliers in a point set. Order-k α-shape produces an “inner” shape of the set, with the amount of “digging” into the points controlled by k. As a generalization of k-hull, order-k α-hull is capable of determining “deep” points amidst samples from a multimodal distribution: it correctly identifies points which lie outside clusters of samples.The order-k α-hulls and α-shapes are related to order-k Voronoi diagrams in the same way in which α-hulls and α-shapes are related to Voronoi diagrams. This implies that order-k α-hull and α-shape can be readily built from order-k Voronoi diagram, and that the number of different order-k α-shapes for all possible values of α is proportional to the complexity of order-k Voronoi diagram.  相似文献   
110.
In a laboratory experiment 5 cm depth of water was allowed to percolate daily down through a 15 cm thick soil (Typic Ustipsamment) layer. It was observed that leaching losses of urea supergranules (USG)-N could be decreased by about 20% by the placement of four 0.25 g granules at four points instead of one 1 g granule at one point. In field microplots, the placement of approximately 30 granules of 0.30 g size instead of 9 granules of 1.00 g size resulted in reduced leaching of USG-N and, in turn, increased rice yield. In a follow-up field study, the advantage of more frequently placed USG was confirmed. As compared with 1 g USG placed in the usual manner in the center of four rice hills, increasing the density of placement in soil produced 15% more rice grain. Further increase in rice yield could be obtained by increasing the number of USG placed in the soil and decreasing the size of the granule from 1.00 g to 0.70 or 0.35 g. With USG of 0.35 and 0.70 g yields were equal or sometimes even slightly higher than with split application of prilled urea on a heavily percolating, low-CEC, light-textured soil.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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