全文获取类型
收费全文 | 5913篇 |
免费 | 385篇 |
国内免费 | 295篇 |
专业分类
电工技术 | 683篇 |
技术理论 | 3篇 |
综合类 | 298篇 |
化学工业 | 1092篇 |
金属工艺 | 626篇 |
机械仪表 | 236篇 |
建筑科学 | 431篇 |
矿业工程 | 118篇 |
能源动力 | 210篇 |
轻工业 | 311篇 |
水利工程 | 27篇 |
石油天然气 | 151篇 |
武器工业 | 27篇 |
无线电 | 582篇 |
一般工业技术 | 517篇 |
冶金工业 | 321篇 |
原子能技术 | 243篇 |
自动化技术 | 717篇 |
出版年
2024年 | 17篇 |
2023年 | 75篇 |
2022年 | 194篇 |
2021年 | 212篇 |
2020年 | 164篇 |
2019年 | 140篇 |
2018年 | 111篇 |
2017年 | 159篇 |
2016年 | 203篇 |
2015年 | 224篇 |
2014年 | 336篇 |
2013年 | 446篇 |
2012年 | 399篇 |
2011年 | 478篇 |
2010年 | 384篇 |
2009年 | 419篇 |
2008年 | 312篇 |
2007年 | 410篇 |
2006年 | 386篇 |
2005年 | 288篇 |
2004年 | 182篇 |
2003年 | 185篇 |
2002年 | 158篇 |
2001年 | 113篇 |
2000年 | 115篇 |
1999年 | 106篇 |
1998年 | 80篇 |
1997年 | 50篇 |
1996年 | 45篇 |
1995年 | 37篇 |
1994年 | 31篇 |
1993年 | 25篇 |
1992年 | 20篇 |
1991年 | 21篇 |
1990年 | 14篇 |
1989年 | 5篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1978年 | 4篇 |
1975年 | 1篇 |
排序方式: 共有6593条查询结果,搜索用时 0 毫秒
71.
Hou-Biao Li Ting-Zhu Huang Yong Zhang Xing-Ping Liu Hong Li 《Mathematics and computers in simulation》2009
In this paper, to obtain an efficient parallel algorithm to solve sparse block-tridiagonal linear systems, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are suitable when the desired goal is to maximize parallelism. Moreover, some theoretical results concerning these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block tridiagonal H-matrices is also described. In addition, the validity of these preconditioners is illustrated with some numerical experiments arising from the second order elliptic partial differential equations and oil reservoir simulations. 相似文献
72.
We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred). 相似文献
73.
This paper presents a novel quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems via H∞ approach. In the proposed algorithm, a self-constructing neural fuzzy network (SCNFN) is developed with both structure and parameter learning phases, so that the number of fuzzy rules and network parameters can be adaptively determined. Based on the SCNFN, an uncertainty observer is first introduced to watch compound system uncertainties. Subsequently, an optimal NFN-based controller is designed to overcome the effects of unstructured uncertainty and approximation error by integrating the NFN identifier, linear optimal control and H∞ approach as a whole. The adaptive tuning laws of network parameters are derived in the sense of quadratic stability technique and Lyapunov synthesis approach to ensure the network convergence and H∞ synchronization performance. The merits of the proposed control scheme are not only that the conservative estimation of NFN approximation error bound is avoided but also that a suitable-sized neural structure is found to sufficiently approximate the system uncertainties. Simulation results are provided to verify the effectiveness and robustness of the proposed control method. 相似文献
74.
基于多元线性回归的雾霾预测方法研究 总被引:1,自引:0,他引:1
提出了一种在线样本更新的多元线性回归分析的雾霾预测方法。首先搜集了北京市天气状况,包括平均气温、湿度、风级等气象数据以及PM2.5、CO、NO2、SO2等大气成分浓度数据,然后通过散点图对这些因素进行主要影响因素分析,筛选出对雾霾影响比较明显的因素作为雾霾预测的依据。通过在线样本更新的多元线性回归建立了PM2.5含量预测模型,并将气象要素作为雾霾的判断标准。最后给出实际例子,利用多元线性回归对北京未来一天、三天及一周的PM2.5含量进行较为精确的预测。 相似文献
75.
76.
Embedding a number of displacement features into a base surface is common in industrial product design and modeling, where displaced surface regions are blended with the unmodified surface region. The cubic Hermite interpolant is usually adopted for surface blending, in which tangent plane smoothness across the boundary curve is achieved. However, the polynomial degree of the tangent field curve obtained symbolically is considerably higher, and the reduction of the degree of a freeform curve is a non-trivial task. In this work, an approximation surface blending approach is proposed to achieve tangential continuity across the boundary curve. The boundary curve is first offset in the tangent field with the user-specified tolerance, after which it is refined to be compatible with the offset curve for surface blending. Since the boundary curve is offset in a three-dimensional (3D) space, the local self-intersection in the offset curve is addressed in a 2D space by approximately mapping the offset vectors in the respective tangent planes to the parameter space of the base surface. The proposed algorithm is validated using examples, and the normal vector deviation along the boundary curve is investigated. 相似文献
77.
介绍了PCS7软件在四重式全液压可逆十一辊矫直机控制系统中的应用,以及一个包含了自动化站、主操作站、监控站、工程师站等的分布式计算机控制系统。该系统通过PLC控制变频器,实现传动电机速度控制,以及通过液压调整位置控制回路,实现板材矫直中辊缝位置的设定与恒定保持;这样矫直的钢板,头尾均得到很好的矫直质量。 相似文献
78.
We propose a cascadic multigrid algorithm for a semilinear indefinite elliptic problem. We use a standard finite element
discretization with piecewise linear finite elements. The arising nonlinear equations are solved by a cascadic organization
of Newton's method with frozen derivative on a sequence of nested grids. This gives a simple version of a multigrid method
without projections on coarser grids. The cascadic multigrid algorithm starts on a comparatively coarse grid where the number
of unknowns is small enough to obtain an approximate solution within sufficiently high precision without substantial computational
effort. On each finer grid we perform exactly one Newton step taking the approximate solution from the coarsest grid as initial
guess. The linear Newton systems are solved iteratively by a Jacobi-type iteration with special parameters using the approximate
solution from the previous grid as initial guess. We prove that for a sufficiently fine initial grid and for a sufficiently
good start approximation the algorithm yields an approximate solution within the discretization error on the finest grid and
that the method has multigrid complexity with logarithmic multiplier.
Received February 1999, revised July 13, 1999 相似文献
79.
Ana Gàl 《Computational Complexity》2001,10(4):277-296
We give a characterization of span program size by a
combinatorial-algebraic measure. The measure we consider is a generalization
of a measure on covers which has been used to prove lower
bounds on formula size and has also been studied with respect to communication
complexity.?In the monotone case our new methods yield lower bounds for
the monotone span program complexity of explicit Boolean functions in
n variables over arbitrary fields, improving the previous lower bounds
on monotone span program size. Our characterization of span program
size implies that any matrix with superpolynomial separation between
its rank and cover number can be used to obtain superpolynomial lower
bounds on monotone span program size. We also identify a property
of bipartite graphs that is suficient for constructing Boolean functions
with large monotone span program complexity.
Received: September 30, 2000. 相似文献
80.
潘磊 《数字社区&智能家居》2008,3(11):815-816
以当前流行的开源软件和操作系统为基础,介绍了两种服务器端电子邮件服务的实现方式。涉及到服务器配置以及软件模块的编写。并分析了不同方式实现电子邮件服务的优劣。 相似文献