首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7559篇
  免费   791篇
  国内免费   665篇
电工技术   435篇
综合类   1474篇
化学工业   269篇
金属工艺   76篇
机械仪表   313篇
建筑科学   153篇
矿业工程   37篇
能源动力   113篇
轻工业   110篇
水利工程   79篇
石油天然气   92篇
武器工业   56篇
无线电   1056篇
一般工业技术   940篇
冶金工业   31篇
原子能技术   103篇
自动化技术   3678篇
  2024年   16篇
  2023年   73篇
  2022年   86篇
  2021年   111篇
  2020年   158篇
  2019年   168篇
  2018年   171篇
  2017年   195篇
  2016年   255篇
  2015年   238篇
  2014年   344篇
  2013年   539篇
  2012年   491篇
  2011年   571篇
  2010年   386篇
  2009年   463篇
  2008年   482篇
  2007年   525篇
  2006年   451篇
  2005年   394篇
  2004年   309篇
  2003年   341篇
  2002年   285篇
  2001年   204篇
  2000年   243篇
  1999年   185篇
  1998年   169篇
  1997年   162篇
  1996年   120篇
  1995年   113篇
  1994年   158篇
  1993年   96篇
  1992年   96篇
  1991年   70篇
  1990年   61篇
  1989年   61篇
  1988年   45篇
  1987年   33篇
  1986年   24篇
  1985年   31篇
  1984年   13篇
  1983年   18篇
  1982年   11篇
  1981年   12篇
  1980年   10篇
  1979年   6篇
  1978年   7篇
  1977年   8篇
  1976年   2篇
  1975年   3篇
排序方式: 共有9015条查询结果,搜索用时 15 毫秒
81.
Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG.  相似文献   
82.
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.  相似文献   
83.
多矩阵变量线性矩阵方程(LME)约束解的计算问题在参数识别、结构设计、振动理论、自动控制理论等领域都有广泛应用。本文借鉴求线性矩阵方程(LME)同类约束最小二乘解的迭代算法,通过构造等价的线性矩阵方程组,建立了求多矩阵变量LME的一种异类约束最小二乘解的迭代算法,并证明了该算法的收敛性。在不考虑舍入误差的情况下,利用该算法不仅可在有限步计算后得到LME的一组异类约束最小二乘解,而且选取特殊初始矩阵时,可求得LME的极小范数异类约束最小二乘解。另外,还可求得指定矩阵在该LME的异类约束最小二乘解集合中的最佳逼近解。算例表明,该算法是有效的。  相似文献   
84.
The Kirchhoff approximation is used to show that the time domain impulse response of an isolated flat crack can be given a simple geometrical interpretation in terms of the derivative of a projected length function. For an elliptical crack, this derivative can be obtained explicitly to yield the two edge-diffracted waves which originate from the flashpoints of the crack. An explicit coordinate invariant expression is obtained from this elliptical crack solution which relates the time difference, t, between the arrival of these edge-diffracted waves and the crack size and orientation. Previously, we have proposed that this expression, together with t measurements in different scattering directions, could be used in a regression analysis as the basis for performing a constrained inversion of crack scattering data (i.e., where we attempt to obtain the best equivalent flat elliptical crack that fits the scattering measurements). Here we will demonstrate some results of applying the proposed algorithm using noisy synthetic data. The sensitivity of the results to both, number of measurements and transducer orientation, will be discussed.  相似文献   
85.
在再生核$W_2^1[a, b]$空间中研究自适应正交贪婪分解算法, 利用能量下降最快的原理自适应性地构造出最佳$n$项逼近函数, 并从理论上证明其收敛性成立。最后, 实验验证了在$W_2^1[a, b]$再生核空间中, 利用正交贪婪原理构造的$n$项数值原函数比用等分结点构造出的最佳$n$项数值原函数收敛效果更优。  相似文献   
86.
依据概率密度逼近提出了一种新的无监督特征排序,应用于特征选择降维.实验证明,这种方法与一些现有的方法相比,更为有效.  相似文献   
87.
图像的多尺度几何分析概述*   总被引:1,自引:0,他引:1  
以函数的稀疏表示为主线,详细介绍了各种多尺度几何分析产生的背景、发展历程和逼近性能,并分析了它们各自存在的优缺点,最后指出了其发展方向.  相似文献   
88.
ANEWELECTROMAGNETICIMAGINGSCHEME①ZhangRongfeng,HeJishanColegeofResource,EnvironmentandCivilEnginering,CentralSouthUniversityo...  相似文献   
89.
Weighting model is the only valuation model of life cycle impact assessment(LCIA) profile now. It simplifies evaluation function into linear function, and makes the determination of weighting factor complicated. Therefore the valuation of LCIA profile is the most critical and controversial step in life cycle assessment(LCA). Development on valuation models, which are understood easily and accepted widely, is urgently needed in the field of LCA.The modeling approaches for the linear evaluation function were summed up. The modeling approaches for the nonlinear evaluation function were set up by function approximation theory, which include choosing preference products, forming preference data, establishing artificial neural network(ANN) and training ANN by preference data.By selecting 7 material products as preference product, experience was done with modeling approaches of the nonlinear evaluation function. The results show that the modeling approaches and valuation model of the nonlinear evaluation function are more practical than the weighting model.  相似文献   
90.
本文用WKB近似方法讨论了势垒贯穿问题系数T和其透射反射系数R之和恒等为1,即满足恒等式T R=1,并进一步得出这一结论不仅适用于一般势垒贯穿而且在方势垒贯穿中也成立,最后讨论了势垒贯穿的几种极限情况,例如,h→0(即经典情况),势垒高度v→∞、v→0,势垒宽度a→∞、a→0,等几种特殊情况下的T及R的取值问题。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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