全文获取类型
收费全文 | 4525篇 |
免费 | 535篇 |
国内免费 | 436篇 |
专业分类
电工技术 | 264篇 |
综合类 | 597篇 |
化学工业 | 196篇 |
金属工艺 | 64篇 |
机械仪表 | 220篇 |
建筑科学 | 67篇 |
矿业工程 | 17篇 |
能源动力 | 65篇 |
轻工业 | 44篇 |
水利工程 | 45篇 |
石油天然气 | 73篇 |
武器工业 | 36篇 |
无线电 | 736篇 |
一般工业技术 | 680篇 |
冶金工业 | 17篇 |
原子能技术 | 91篇 |
自动化技术 | 2284篇 |
出版年
2024年 | 8篇 |
2023年 | 47篇 |
2022年 | 50篇 |
2021年 | 76篇 |
2020年 | 119篇 |
2019年 | 106篇 |
2018年 | 120篇 |
2017年 | 136篇 |
2016年 | 169篇 |
2015年 | 165篇 |
2014年 | 225篇 |
2013年 | 374篇 |
2012年 | 320篇 |
2011年 | 356篇 |
2010年 | 235篇 |
2009年 | 273篇 |
2008年 | 318篇 |
2007年 | 324篇 |
2006年 | 285篇 |
2005年 | 238篇 |
2004年 | 197篇 |
2003年 | 214篇 |
2002年 | 175篇 |
2001年 | 112篇 |
2000年 | 118篇 |
1999年 | 91篇 |
1998年 | 89篇 |
1997年 | 85篇 |
1996年 | 66篇 |
1995年 | 40篇 |
1994年 | 73篇 |
1993年 | 50篇 |
1992年 | 47篇 |
1991年 | 24篇 |
1990年 | 24篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 17篇 |
1985年 | 17篇 |
1984年 | 9篇 |
1983年 | 15篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有5496条查询结果,搜索用时 15 毫秒
11.
混合Hermite-Lagrange插值之同时逼近 总被引:1,自引:1,他引:0
谢庭藩 《中国计量学院学报》1993,(2)
对于(-1,1)中的结点组{X_k}_(k=1)~n,记l_k(x)为相应的Lagrange插值基本多项式,又记A_n=‖∑(2-x~2-x_k~2)(1-x_k~2)~-1丨l_k(x)‖。对于f∈C_([-1,1)~q与r=[q+2/2],本文证明满足条件H_n(f,x_k)=f(x_k)(k=1,2,…,n),H_n~(s)(f,±1)=f~(s)(±1)(s=0,1,…,n-1)的n+2r-1次代数多项式H_n(f,x)有逼近性质H_n~(s)(f,x)-f~(s)(x)=(?)其中δ_n(x)=n~(-1)(1-x~2)~(1/2),△_n(x)=δ_n(x)+n~(-2).作为证明的重要工具,本文还对n次代数多项式P_n(x),建立了另一形式的Bernstein不等武:若 P_n(x)=O(1)δ_n~q(x)ω(δ_n(x)),则p_n~(S)(X)=O(1)δ_n~(q-2S)(X)ω(δ_n(X))△_n~s(X)。 相似文献
12.
基于局部多项式逼近的变参数梯度估计算法 总被引:1,自引:0,他引:1
本文分析了梯度辨识算法跟踪时变系统的缺点,提出了一种新的基于局部多项式逼近的变参数梯度估计算法。本算法具有良好跟踪性能特别适用于时变系统跟踪且其对噪声的敏感程度与一般梯度估计方法相当。仿真结果验证了其良好性能。 相似文献
13.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
14.
对称配筋小偏心受压构件的截面设计 总被引:4,自引:1,他引:3
对小偏心受压构件在对称配筋情况下的截面配筋计算,提出用最佳一次逼近多项式简化基本公式,直接按二次方程求解ξ的近似方法,具有精度高,相对误差小,计算方便等优点,可供工程设计人员参考。 相似文献
15.
16.
The Label-Cover problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10]. In this paper we present a direct combinatorial reduction from low error-probability PCP [Proceedings of 31st ACM Symposium on Theory of Computing, 1999, pp. 29-40] to Label-Cover showing it NP-hard to approximate to within 2(logn)1−o(1). This improves upon the best previous hardness of approximation results known for this problem.We also consider the Minimum-Monotone-Satisfying-Assignment (MMSA) problem of finding a satisfying assignment to a monotone formula with the least number of 1's, introduced by M. Alekhnovich, S. Buss, S. Moran, T. Pitassi [Minimum propositional proof length is NP-hard to linearly approximate, 1998]. We define a hierarchy of approximation problems obtained by restricting the number of alternations of the monotone formula. This hierarchy turns out to be equivalent to an AND/OR scheduling hierarchy suggested by M.H. Goldwasser, R. Motwani [Lecture Notes in Comput. Sci., Vol. 1272, Springer-Verlag, 1997, pp. 307-320]. We show some hardness results for certain levels in this hierarchy, and place Label-Cover between levels 3 and 4. This partially answers an open problem from M.H. Goldwasser, R. Motwani regarding the precise complexity of each level in the hierarchy, and the place of Label-Cover in it. 相似文献
17.
低云中短波红外表观辐射模型研究 总被引:2,自引:1,他引:1
在对空红外系统的多光谱探测和红外仿真中,云的干扰不可忽略,所以,对云的辐射特性的研究至关重要。在不同的波段,云的辐射特性会有很大的差异,为了研究各个不同波段云的表现辐射特性.需要计算云的光谱辐射量。在典型观测模式下建立了低云的表观光谱辐射模型,研究了对云背景辐射有贡献的各个辐射分量的计算方法。基于传统的二流近似模型获取各个参数,引入云的光谱光学厚度的经验公式。进而获得了低云在中短波段的光谱辐射特性,有效地计算出了云背景在1-5μm的中短波段内的表现光谱辐亮度数据,并且节省了计算时间。经过比较发现,该模型的计算结果与实测结果有较好的一致性。可以为云背景多光谱分析、探测及仿真提供背景数据。 相似文献
18.
Gilles Celeux Author VitaeFlorence ForbesAuthor Vitae Nathalie Peyrard Author Vitae 《Pattern recognition》2003,36(1):131-144
Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments. 相似文献
19.
We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries. 相似文献
20.
WKB近似下的Fourier衍射成象方法 总被引:1,自引:0,他引:1
对于介质目标微波衍射成象,本文引入了WKB近似来模拟目标内部总场。基于这种近似,我们导出了Fourier衍射公式,并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用WKB近似重建目标特性较Born近似有明显改善。 相似文献