首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   18004篇
  免费   2032篇
  国内免费   1377篇
电工技术   1315篇
综合类   2450篇
化学工业   1087篇
金属工艺   1318篇
机械仪表   1714篇
建筑科学   1952篇
矿业工程   580篇
能源动力   567篇
轻工业   711篇
水利工程   638篇
石油天然气   1354篇
武器工业   164篇
无线电   1154篇
一般工业技术   1728篇
冶金工业   619篇
原子能技术   198篇
自动化技术   3864篇
  2024年   51篇
  2023年   176篇
  2022年   346篇
  2021年   457篇
  2020年   517篇
  2019年   469篇
  2018年   445篇
  2017年   671篇
  2016年   642篇
  2015年   754篇
  2014年   1087篇
  2013年   1143篇
  2012年   1363篇
  2011年   1404篇
  2010年   1097篇
  2009年   1170篇
  2008年   1114篇
  2007年   1335篇
  2006年   1197篇
  2005年   988篇
  2004年   786篇
  2003年   647篇
  2002年   570篇
  2001年   484篇
  2000年   438篇
  1999年   356篇
  1998年   277篇
  1997年   224篇
  1996年   242篇
  1995年   224篇
  1994年   167篇
  1993年   115篇
  1992年   101篇
  1991年   75篇
  1990年   56篇
  1989年   61篇
  1988年   46篇
  1987年   30篇
  1986年   16篇
  1985年   13篇
  1984年   20篇
  1983年   10篇
  1982年   8篇
  1981年   3篇
  1980年   3篇
  1979年   8篇
  1978年   2篇
  1975年   2篇
  1956年   1篇
  1955年   1篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.  相似文献   
2.
孙淑光  周琪 《计算机应用》2020,40(5):1522-1528
针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。  相似文献   
3.
In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.  相似文献   
4.
The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.  相似文献   
5.
Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.  相似文献   
6.
《Planning》2019,(6)
减少手术创伤始终是快速康复的决定性因素,这一点在目前的加速康复外科研究尤其是复杂手术,如妇科肿瘤手术中尚未得到充分重视。尊重学习曲线、全面规划手术方案、总结失利经验、开展前瞻性研究是解决此问题的主要方案。本文着重讨论妇科肿瘤手术创伤对术后加速康复的影响及可能的改进措施。  相似文献   
7.
The low price of lead-acid, the most popular battery, is often used in setting cost targets for emerging energy storage technologies. Future cost reductions in lead acid batteries could increase investment and time scales needed for emerging storage technologies to reach cost-parity. In this paper the first documented model of cost reductions for lead-acid batteries is developed. Regression to a standard experience curve using 1989–2012 data yield a poor fit, with R2 values of 0.17 for small batteries and 0.05 for larger systems. To address this problem, battery costs are separated into material and residual costs, and experience curves developed for residual costs. Depending on the year, residual costs account for 41–86% of total battery cost. Using running-time averages to address volatility in material costs, a 4-year time average experience curve for residual costs yield much higher R2, 0.78 for small and 0.74 for large lead-acid batteries. The learning rate for residual costs in lead-acid batteries is 20%, a discovery with policy implications. Neglecting to consider cost reductions in lead-acid batteries could result in failure of energy storage start-ups and public policy programs. Generalizing this result, learning in incumbent technologies must be understood to assess the potential of emerging ones.  相似文献   
8.
方原柏 《冶金自动化》2006,30(2):29-32,44
介绍了皮带秤秤架响应特性曲线分析方法,对四种结构形式的秤架进行了响应特性曲线分析和比较,得出的结论是:悬浮式秤架的计量特性最好。  相似文献   
9.
周萍 《电子工程师》2006,32(1):61-64
从扬声器系统的等效类比线路出发,得出了阻抗特性Z(jω)的表达形式及其曲线。采用全面最小二乘法识别扬声器系统的时域函数的全套系数,从而测出扬声器系统的低频特性参数。以计算机仿真技术为基础,通过MATLAB和EWB软件进行系统模拟分析仿真,得到扬声器系统的阶跃响应、阻抗曲线等特性。  相似文献   
10.
一种基于Normal基椭圆曲线密码芯片的设计   总被引:3,自引:3,他引:0  
文章设计了一款椭圆曲线密码芯片。实现了GF(2^233)域上normal基椭圆曲线数字签名和认证。并支持椭圆曲线参数的用户配置。在VLSI的实现上,提出了一种新的可支持GF(2^233)域和GF(p)域并行运算的normal基椭圆曲线VLSI架构。其架构解决了以往GF(p)CA算迟后于GF(2^233)域运算的问题,从而提高了整个芯片的运算吞吐率。基于SMIC 0.18μm最坏的工艺,综合后关键路径最大时延3.8ns,面积18mm^2;考虑布局布线的影响,芯片的典型的情况下,每秒可实现8000次签名或4500次认证。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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