首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   24155篇
  免费   3129篇
  国内免费   2579篇
工业技术   29863篇
  2024年   101篇
  2023年   287篇
  2022年   513篇
  2021年   596篇
  2020年   770篇
  2019年   727篇
  2018年   686篇
  2017年   998篇
  2016年   1045篇
  2015年   1076篇
  2014年   1528篇
  2013年   1929篇
  2012年   1851篇
  2011年   1940篇
  2010年   1501篇
  2009年   1574篇
  2008年   1490篇
  2007年   1692篇
  2006年   1357篇
  2005年   1250篇
  2004年   1057篇
  2003年   887篇
  2002年   756篇
  2001年   654篇
  2000年   584篇
  1999年   491篇
  1998年   354篇
  1997年   367篇
  1996年   287篇
  1995年   255篇
  1994年   235篇
  1993年   176篇
  1992年   147篇
  1991年   138篇
  1990年   113篇
  1989年   88篇
  1988年   63篇
  1987年   48篇
  1986年   26篇
  1985年   26篇
  1984年   35篇
  1983年   37篇
  1982年   26篇
  1981年   23篇
  1980年   18篇
  1979年   10篇
  1978年   12篇
  1977年   13篇
  1976年   5篇
  1959年   5篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
21.
线性时变系统的区间稳定性与鲁棒稳定性   总被引:7,自引:0,他引:7  
本文应用向量比较定理研究线性时变系统的区间稳定性和具非线性时变摄动的线性时变系统的鲁棒稳定性,所得的新结果包含文献的一些主要结果作为特例,本文的研究方法说明向量比较方法是分析区间稳定性和鲁棒稳定性的一种自然而有力的工具。  相似文献   
22.
Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(nk) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L1 monotonic calculation. This procedure is highly efficient, requiring at most O(kn2) computer operations and O(n) best L1 monotonic calculations to subranges of data for a global minimum.  相似文献   
23.
With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.  相似文献   
24.
25.
A computational procedure for remapping material state information from one finite element mesh to another is described. The procedure is useful in connection with evolving meshes for inelastic problems, as for example occur in the context of fracture simulation and adaptive mesh refinement. The proposed method is based on weak enforcement of equality between corresponding fields on the two meshes, where piecewise‐constant fields on both meshes are generalized from the quadrature‐point values. The essential algorithmic problem is that of calculating the volume partition of an arbitrary convex region with respect to a covering set of disjoint convex regions. Instead of geometrically resolving the associated intersections, the problem is herein approximated by a constrained optimization problem, which may be readily and efficiently solved computationally. This formulation is a main contribution of the paper. Computational examples are given that illustrate the effectiveness of the proposed procedure. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
26.
赵丽华 《山西建筑》2003,29(7):123-124
就住宅电气设计中,常常被忽略的细节问题进行阐述,提出了在住宅室内几个功能区内,如何使灯具和插座的布置更合理,以最大限度地满足居住者的需求。  相似文献   
27.
采用固定床反应器,对催化剂的稳定性进行了初步评价。在120℃、空速相同、液固反应条件下,高苯烯比时催化剂的稳定性明显高于低苯烯比时;在苯烯比和空速相同、液固反应条件下,相对低温反应时,催化剂的稳定性明显高于高温反应。IR分析结果表明,同新鲜和反应后未失活的催化剂相比,失活后催化剂的活性组分特征衍射峰消失,出现的新的特征衍射峰可能同—CH基的振动有关。TG分析结果表明,失活后催化剂在空气流中焙烧,失重幅度比新鲜催化剂大。  相似文献   
28.
29.
雒海潮 《现代电子技术》2004,27(6):63-64,67
介绍了神经网络与线性分组码之间的关系,并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性,然后以(7,4,3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。  相似文献   
30.
It is necessary to determine the accurate reflectance of painted surfaces for the review of paint finishes by computer graphics (CG) before actual painting of the exterior color of automobiles, and for quality control during production and inspection processes. We have optimized a method for measuring reflectance by using a statistical technique. We have found that the reflectance of a painted surface is best measured at an incident angle of 60° and at five aspecular angles of 10°, 18°, 28°, 40°, and 90°. Our method makes it possible to accurately reproduce reflection characteristics of paint finishes containing special flake pigments, such as pearl mica. Also it was proved that our method can apply not only to solid and metallic coatings but to all painted surfaces. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 275–282, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20125  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号