全文获取类型
收费全文 | 44602篇 |
免费 | 5390篇 |
国内免费 | 3956篇 |
专业分类
电工技术 | 4084篇 |
综合类 | 6133篇 |
化学工业 | 4787篇 |
金属工艺 | 1842篇 |
机械仪表 | 3172篇 |
建筑科学 | 4530篇 |
矿业工程 | 1334篇 |
能源动力 | 1753篇 |
轻工业 | 1460篇 |
水利工程 | 1982篇 |
石油天然气 | 1640篇 |
武器工业 | 563篇 |
无线电 | 4894篇 |
一般工业技术 | 4719篇 |
冶金工业 | 1134篇 |
原子能技术 | 804篇 |
自动化技术 | 9117篇 |
出版年
2024年 | 193篇 |
2023年 | 569篇 |
2022年 | 1058篇 |
2021年 | 1195篇 |
2020年 | 1474篇 |
2019年 | 1331篇 |
2018年 | 1267篇 |
2017年 | 1753篇 |
2016年 | 1782篇 |
2015年 | 1863篇 |
2014年 | 2582篇 |
2013年 | 3287篇 |
2012年 | 3309篇 |
2011年 | 3437篇 |
2010年 | 2645篇 |
2009年 | 2783篇 |
2008年 | 2662篇 |
2007年 | 3074篇 |
2006年 | 2575篇 |
2005年 | 2276篇 |
2004年 | 1911篇 |
2003年 | 1594篇 |
2002年 | 1407篇 |
2001年 | 1194篇 |
2000年 | 1078篇 |
1999年 | 884篇 |
1998年 | 695篇 |
1997年 | 691篇 |
1996年 | 570篇 |
1995年 | 492篇 |
1994年 | 439篇 |
1993年 | 319篇 |
1992年 | 283篇 |
1991年 | 259篇 |
1990年 | 238篇 |
1989年 | 176篇 |
1988年 | 132篇 |
1987年 | 89篇 |
1986年 | 58篇 |
1985年 | 48篇 |
1984年 | 55篇 |
1983年 | 41篇 |
1982年 | 41篇 |
1981年 | 31篇 |
1980年 | 31篇 |
1979年 | 13篇 |
1978年 | 12篇 |
1977年 | 13篇 |
1975年 | 6篇 |
1959年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 6 毫秒
41.
The Logarithmic Image Processing Model: Connections with Human Brightness Perception and Contrast Estimators 总被引:1,自引:0,他引:1
Jean-Charles Pinoli 《Journal of Mathematical Imaging and Vision》1997,7(4):341-358
The logarithmic image processing (LIP) model is amathematical framework based on abstract linear mathematicswhich provides a set of specific algebraic and functionaloperations that can be applied to the processing of intensityimages valued in a bounded range. The LIP model has been provedto be physically justified in the setting of transmitted lightand to be consistent with several laws and characteristics ofthe human visual system. Successful application examples havealso been reported in several image processing areas, e.g.,image enhancement, image restoration, three-dimensional imagereconstruction, edge detection and image segmentation.The aim of this article is to show that the LIP model is atractable mathematical framework for image processing which isconsistent with several laws and characteristics of humanbrightness perception. This is a survey article in the sensethat it presents (almost) previously published results in arevised, refined and self-contained form. First, an introductionto the LIP model is exposed. Emphasis will be especially placedon the initial motivation and goal, and on the scope of themodel. Then, an introductory summary of mathematicalfundamentals of the LIP model is detailed. Next, the articleaims at surveying the connections of the LIP model with severallaws and characteristics of human brightness perception, namelythe brightness scale inversion, saturation characteristic, Weber'sand Fechner's laws, and the psychophysical contrast notion. Finally,it is shown that the LIP model is a powerful and tractable framework for handling the contrast notion. This is done througha survey of several LIP-model-based contrast estimators associated with special subparts (point, pair of points,boundary, region) of intensity images, that are justified bothfrom a physical and mathematical point of view. 相似文献
42.
线性时变系统的区间稳定性与鲁棒稳定性 总被引:7,自引:0,他引:7
本文应用向量比较定理研究线性时变系统的区间稳定性和具非线性时变摄动的线性时变系统的鲁棒稳定性,所得的新结果包含文献的一些主要结果作为特例,本文的研究方法说明向量比较方法是分析区间稳定性和鲁棒稳定性的一种自然而有力的工具。 相似文献
43.
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. 相似文献
44.
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. 相似文献
45.
46.
以聚醚为基础油辅以抗磨剂、抗氧剂、防锈剂等多种添加剂研制而成的KGW聚醚合成工业齿轮油具有优异的黏温性能和低温性能,优异的极压抗磨性,极优的减摩性能,可满足高负荷、强冲击等苛刻条件下各类齿轮传动装置的润滑要求。该系列产品达到国外同类油品质量水平。 相似文献
47.
E. GLASER 《Journal of microscopy》2005,218(1):1-5
It is well known that the estimation of an object's volume by means of serial cross-sections, the so-called Cavalieri method, yields an unbiased estimate. But by itself it provides no means by which to estimate how precise this estimate is unless the shape of the volume is fully known beforehand. This knowledge can only be partially determined from the serial section information that is collected. Methods have been developed that claim to surmount this difficulty by using the serial section data to create a mathematical model of the volume's shape properties. The model then is used to estimate (predict) the precision of the volume estimate (its CE) from the single set of data available. Unfortunately, the theory underlying the model is flawed and so the model itself amounts to no more than an unsubstantiated guess about the shape of the volume. Therefore, the precision of the volume estimates that one obtains from the method is only as good as the model and this cannot be ascertained from the single set of acquired data. In this letter I explain the inadequacies of the modelling method. I suggest that it be used only with caution, if at all. Instead I suggest two alternative ways to predict the CE, one that is based upon a rule-of-thumb approach to the object's shape, and another that is based upon spectral analysis of the measurement function and that is easy to implement with available computer software. 相似文献
48.
49.
50.
M. M. Rashid 《International journal for numerical methods in engineering》2002,55(4):431-450
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. 相似文献