全文获取类型
收费全文 | 19365篇 |
免费 | 2851篇 |
国内免费 | 1724篇 |
专业分类
电工技术 | 1656篇 |
综合类 | 2403篇 |
化学工业 | 466篇 |
金属工艺 | 208篇 |
机械仪表 | 1120篇 |
建筑科学 | 784篇 |
矿业工程 | 382篇 |
能源动力 | 356篇 |
轻工业 | 346篇 |
水利工程 | 413篇 |
石油天然气 | 244篇 |
武器工业 | 399篇 |
无线电 | 5145篇 |
一般工业技术 | 952篇 |
冶金工业 | 290篇 |
原子能技术 | 114篇 |
自动化技术 | 8662篇 |
出版年
2024年 | 62篇 |
2023年 | 189篇 |
2022年 | 349篇 |
2021年 | 490篇 |
2020年 | 617篇 |
2019年 | 531篇 |
2018年 | 555篇 |
2017年 | 645篇 |
2016年 | 821篇 |
2015年 | 1000篇 |
2014年 | 1428篇 |
2013年 | 1321篇 |
2012年 | 1684篇 |
2011年 | 1823篇 |
2010年 | 1394篇 |
2009年 | 1345篇 |
2008年 | 1424篇 |
2007年 | 1443篇 |
2006年 | 1298篇 |
2005年 | 1054篇 |
2004年 | 810篇 |
2003年 | 747篇 |
2002年 | 562篇 |
2001年 | 479篇 |
2000年 | 360篇 |
1999年 | 274篇 |
1998年 | 191篇 |
1997年 | 169篇 |
1996年 | 164篇 |
1995年 | 153篇 |
1994年 | 106篇 |
1993年 | 68篇 |
1992年 | 62篇 |
1991年 | 60篇 |
1990年 | 51篇 |
1989年 | 43篇 |
1988年 | 33篇 |
1987年 | 20篇 |
1986年 | 7篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 13篇 |
1982年 | 5篇 |
1980年 | 5篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1963年 | 8篇 |
1961年 | 8篇 |
1960年 | 4篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
12.
Kurjenniemi Janne Hämäläinen Seppo Ristaniemi Tapani 《Wireless Personal Communications》2003,27(4):337-351
In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out. 相似文献
13.
A Lattice Approach to Image Segmentation 总被引:1,自引:0,他引:1
Jean Serra 《Journal of Mathematical Imaging and Vision》2006,24(1):83-130
After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function
f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem
8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then
be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other
one. Two propositions make precise the AND and OR combinations of connective criteria.
The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases
when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive
from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space
is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection
based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation
occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study.
The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the
two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations
to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase
when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly
as granulometric semi-groups.
The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization.
The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and
hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one. 相似文献
14.
基于多相滤波器的信道化接收机及其应用研究 总被引:16,自引:0,他引:16
本文主要研究了应用多相滤波技术的信道化接收机建模问题。在给定信道频谱划分方案下,推导了基于多相 滤波器的信道化接收机数学模型。并由此模型设计了一个四信道模拟系统。最后用仿真实验结果验证了模型的正确性。 相似文献
15.
Fatigue crack propagation of multiple coplanar cracks with the coupled extended finite element/fast marching method 总被引:1,自引:0,他引:1
A numerical technique for modeling fatigue crack propagation of multiple coplanar cracks is presented. The proposed method couples the extended finite element method (X-FEM) [Int. J. Numer. Meth. Engng. 48 (11) (2000) 1549] to the fast marching method (FMM) [Level Set Methods & Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, Cambridge University Press, Cambridge, UK, 1999]. The entire crack geometry, including one or more cracks, is represented by a single signed distance (level set) function. Merging of distinct cracks is handled naturally by the FMM with no collision detection or mesh reconstruction required. The FMM in conjunction with the Paris crack growth law is used to advance the crack front. In the X-FEM, a discontinuous function and the two-dimensional asymptotic crack-tip displacement fields are added to the finite element approximation to account for the crack using the notion of partition of unity [Comput. Meth. Appl. Mech. Engng. 139 (1996) 289]. This enables the domain to be modeled by a single fixed finite element mesh with no explicit meshing of the crack surfaces. In an earlier study [Engng. Fract. Mech. 70 (1) (2003) 29], the methodology, algorithm, and implementation for three-dimensional crack propagation of single cracks was introduced. In this paper, simulations for multiple planar cracks are presented, with crack merging and fatigue growth carried out without any user-intervention or remeshing. 相似文献
16.
基于粗糙集信息观的决策表属性约简方法 总被引:2,自引:0,他引:2
粗糙集理论是近年来发展起来的一种有效的处理不精确、不确定、含糊信息的数学理论方法,它被广泛应用于相容和不相容决策表的属性约简和核属性计算。利用反例指出目前基于粗糙集信息观[2、6]的决策表属性约简和核属性计算方法的局限性。对决策表的性质作了深入的研究,研究发现文献[2、6]方法的不足原因是:它们没有考虑U/ind(C)中等价类的相客性。给出了基于U/ind(C)中等价类相客性的属性约简定义和核属性定义,并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。讨论了该方法同文献[2、6]方法的区别。最后用相同实例验证了该方法的有效性。 相似文献
17.
测向定位技术是无线电管理的一个重要课题。测向定位过程中的误差的种类和产生的原因很多。选择适当的方法对误差进行校正,可以有效的减小测向误差带来的损失,提高无线电管理的效率。 相似文献
18.
二单元DPCA在机载相控阵雷达AMTI中的应用 总被引:2,自引:0,他引:2
二单元偏置相位中心天线技术 (DPCA)在机载相控阵雷达自适应动目标指示 (AMTI)中占有重要地位 ,其原理在很多文献中都有讨论。文中主要提出了将二单元DPCA应用到机载相控阵雷达的具体方法和实验步骤 ,针对接收数据是M×N矩阵的情况 ,分析了数据降维变换的具体过程 ,并从仿真结果中得到有效性证明。该方法对DPCA在实际工程中的应用具有重要参考价值 相似文献
19.
首先建立了数据传输网络选择的最小成本模型,给出了有效支撑树代表集的概念,并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题,分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。 相似文献
20.
隔河岩水电站大坝廊道排水控制系统存在设备备品、备件不足,技术落后,系统软件工作不稳定等问题,不能按库坝管理要求对排水量进行监控,严重影响廊道排水系统的可靠性。为此,对该系统进行了综合自动化改造,采用TCP6IP通讯,PLC直接上网,异种CPU热备冗余等技术,提高了整个系统的运行可靠性,满足了“无人值班”的要求。 相似文献