全文获取类型
收费全文 | 970篇 |
免费 | 66篇 |
国内免费 | 63篇 |
专业分类
电工技术 | 33篇 |
综合类 | 122篇 |
化学工业 | 19篇 |
金属工艺 | 14篇 |
机械仪表 | 36篇 |
建筑科学 | 29篇 |
矿业工程 | 1篇 |
能源动力 | 4篇 |
轻工业 | 28篇 |
水利工程 | 4篇 |
石油天然气 | 4篇 |
武器工业 | 1篇 |
无线电 | 146篇 |
一般工业技术 | 143篇 |
冶金工业 | 17篇 |
原子能技术 | 8篇 |
自动化技术 | 490篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 20篇 |
2019年 | 18篇 |
2018年 | 24篇 |
2017年 | 22篇 |
2016年 | 27篇 |
2015年 | 30篇 |
2014年 | 40篇 |
2013年 | 69篇 |
2012年 | 92篇 |
2011年 | 79篇 |
2010年 | 42篇 |
2009年 | 51篇 |
2008年 | 57篇 |
2007年 | 46篇 |
2006年 | 52篇 |
2005年 | 47篇 |
2004年 | 40篇 |
2003年 | 37篇 |
2002年 | 27篇 |
2001年 | 27篇 |
2000年 | 21篇 |
1999年 | 17篇 |
1998年 | 23篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 15篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 19篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有1099条查询结果,搜索用时 234 毫秒
51.
《国际计算机数学杂志》2012,89(6):755-764
A Taylor collocation method has been presented for numerically solving systems of high-order linear ordinary, differential equations with variable coefficients. Using the Taylor collocation points, this method transforms the ODE system and the given conditions to matrix equations with unknown Taylor coefficients. By means of the obtained matrix equation, a new system of equations corresponding to the system of linear algebraic equations is gained. Hence by finding the Taylor coefficients, the Taylor polynomial approach is obtained. Also, the method can be used for the linear systems in the normal form. To illustrate the pertinent features of the method, examples are presented and results are compared. 相似文献
52.
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate a polytope defined as the convex hull of the coefficients with respect to the tensorial Bernstein basis, and we formulate several polytopes based on the Bernstein polynomials of the domain. These Bernstein polytopes can be defined by a polynomial number of halfspaces. We give the number of vertices, the number of hyperfaces, and the volume of each polytope for n=1,2,3,4, and we compare the computed range widths for random n-variate polynomials for n?10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size. 相似文献
53.
基于我国平原区1条典型高速公路3年的事故数据和交通流数据对两者之间的关系进行了研究.利用多变量多项式比率等方法建立了多个交通流参数和事故率之间的关系方程,并辅以三维曲面图加以直观反映.研究表明:大车比例、大小车平均速度差和饱和度是影响交通安全最为重要的3个交通流特征参数,多个交通流参数之间相互作用关系复杂,单个参数对交通安全的影响随着其他参数取值的变化而变化. 相似文献
54.
基于Chebyshev多项式的身份认证方案的研究 总被引:2,自引:0,他引:2
基于有限域的Chebyshev多项式由于其良好的单向性和半群特性,被广泛应用到公钥密码算法、密钥协商及身份认证方案中。在安全性方面对已有的基于Chebyshev多项式的身份认证方案进行了分析,并提出了一个新的身份认证方案。通过对其性能的研究,新的方案是安全有效的。 相似文献
55.
提出了一个建立在EPR关联之上的量子密钥分配协议,除了用作纠错部分之外,所有的量子位都对密钥生成有贡献,因此它是高效的,每个EPR对贡献密钥的两个位,所以本协议可以获得高容量,最后证明了该协议是安全的。 相似文献
56.
J. ZhangAuthor Vitae X. ZhangAuthor VitaeH. KrimAuthor Vitae G.G. WalterAuthor Vitae 《Pattern recognition》2003,36(5):1143-1154
In this paper, we describe a shape space based approach for invariant object representation and recognition. In this approach, an object and all its similarity transformed versions are identified with a single point in a high-dimensional manifold called the shape space. Object recognition is achieved by measuring the geodesic distance between an observed object and a model in the shape space. This approach produced promising results in 2D object recognition experiments: it is invariant to similarity transformations and is relatively insensitive to noise and occlusion. Potentially, it can also be used for 3D object recognition. 相似文献
57.
Numerical transform inversion can be useful to solve stochastic models arising in the performance evaluation of telecommunications and computer systems. We contribute to this technique in this paper by extending our recently developed variant of the Laguerre method for numerically inverting Laplace transforms to multidimensional Laplace transforms. An important application of multidimensional inversion is to calculate time-dependent performance measures of stochastic systems. Key features of our new algorithm are: (1) an efficient FFT-based extension of our previously developed variant of the Fourierseries method to calculate the coefficients of the multidimensional Laguerre generating function, and (2) systematic methods for scaling to accelerate convergence of infinite series, using Wynn's ε-algorithm and exploiting geometric decay rates of Laguerre coefficients. These features greatly speed up the algorithm while controlling errors. We illustrate the effectiveness of our algorithm through numerical examples. For many problems, hundreds of function evaluations can be computed in just a few seconds. 相似文献
58.
Consider a given pattern H and a random text T generated by a Markovian source. We study the frequency of pattern occurrences in a random text when overlapping copies
of the pattern are counted separately. We present exact and asymptotic formulae for moments (including the variance), and
probability of r pattern occurrences for three different regions of r , namely: (i) r=O(1) , (ii) central limit regime, and (iii) large deviations regime. In order to derive these results, we first construct certain
language expressions that characterize pattern occurrences which are later translated into generating functions. We then use
analytical methods to extract asymptotic behaviors of the pattern frequency from the generating functions. These findings
are of particular interest to molecular biology problems (e.g., finding patterns with unexpectedly high or low frequencies,
and gene recognition), information theory (e.g., second-order properties of the relative frequency), and pattern matching
algorithms (e.g., q -gram algorithms). 相似文献
59.
一种新的谱随机有限元方法 总被引:9,自引:2,他引:9
黄斌 《武汉理工大学学报》2004,26(5):42-44,51
提出了一种新的谱随机有限元分析方法——递推求解方法。讨论了已有的几种随机场的谱展式,提出将随机结构的随机响应表示成非正交多项式混沌展式,并证明了这个展式的收敛性。在此基础上将随机微分方程表示成了和摄动法类似的一系列确定的递推方程,这些递推方程可用确定性有限元方法求解。该方法比在正交多项式混沌基上投影并取期望的方法更简洁实用,更适合大规模有限元的求解。该方法同样能解决有较大随机涨落的力学问题。 相似文献
60.
Multi-degree reduction of NURBS curves based on their explicit matrix representation and polynomial approximation theory 总被引:8,自引:0,他引:8
CHENG Min & WANG GuojinInstitute of Images Graphics State Key Laboratory of CAD & CG Zhejiang University Hangzhou China 《中国科学F辑(英文版)》2004,47(1):44-54
NURBS curve is one of the most commonly used tools in CAD systems and geometric modeling for its various specialties, which means that its shape is locally adjustable as well as its continuity order, and it can represent a conic curve precisely. But how to do degree reduction of NURBS curves in a fast and efficient way still remains a puzzling problem. By applying the theory of the best uniform approximation of Chebyshev polynomials and the explicit matrix representation of NURBS curves, this paper gives the necessary and sufficient condition for degree reducible NURBS curves in an explicit form. And a new way of doing degree reduction of NURBS curves is also presented, including the multi-degree reduction of a NURBS curve on each knot span and the multi-degree reduction of a whole NURBS curve. This method is easy to carry out, and only involves simple calculations. It provides a new way of doing degree reduction of NURBS curves, which can be widely used in computer graphics and industrial design. 相似文献