全文获取类型
收费全文 | 20886篇 |
免费 | 1470篇 |
国内免费 | 419篇 |
专业分类
电工技术 | 522篇 |
技术理论 | 5篇 |
综合类 | 1476篇 |
化学工业 | 6501篇 |
金属工艺 | 419篇 |
机械仪表 | 692篇 |
建筑科学 | 1662篇 |
矿业工程 | 168篇 |
能源动力 | 430篇 |
轻工业 | 2670篇 |
水利工程 | 170篇 |
石油天然气 | 247篇 |
武器工业 | 129篇 |
无线电 | 1266篇 |
一般工业技术 | 3368篇 |
冶金工业 | 271篇 |
原子能技术 | 225篇 |
自动化技术 | 2554篇 |
出版年
2024年 | 81篇 |
2023年 | 318篇 |
2022年 | 1220篇 |
2021年 | 1245篇 |
2020年 | 497篇 |
2019年 | 521篇 |
2018年 | 525篇 |
2017年 | 662篇 |
2016年 | 755篇 |
2015年 | 789篇 |
2014年 | 1237篇 |
2013年 | 1495篇 |
2012年 | 1465篇 |
2011年 | 1229篇 |
2010年 | 983篇 |
2009年 | 1203篇 |
2008年 | 1121篇 |
2007年 | 910篇 |
2006年 | 713篇 |
2005年 | 624篇 |
2004年 | 511篇 |
2003年 | 437篇 |
2002年 | 368篇 |
2001年 | 330篇 |
2000年 | 286篇 |
1999年 | 229篇 |
1998年 | 191篇 |
1997年 | 134篇 |
1996年 | 1122篇 |
1995年 | 524篇 |
1994年 | 402篇 |
1993年 | 61篇 |
1992年 | 49篇 |
1991年 | 59篇 |
1990年 | 41篇 |
1989年 | 45篇 |
1988年 | 41篇 |
1987年 | 34篇 |
1986年 | 45篇 |
1985年 | 52篇 |
1984年 | 48篇 |
1983年 | 39篇 |
1982年 | 25篇 |
1981年 | 20篇 |
1980年 | 20篇 |
1979年 | 13篇 |
1978年 | 16篇 |
1977年 | 13篇 |
1976年 | 12篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 13 毫秒
51.
Huan Huang 《Information Sciences》2010,180(19):3806-3813
This paper shows that the Zadeh’s extensions of sendograph-metric-continuous fuzzy-valued functions are sendograph-metric-continuous fuzzy functions. 相似文献
52.
图案是所有设计专业的学生在学校学习时所必修的一门专业基础课。纵观中华五千年的文明,哪一朝哪一代都有自己独特的图案风格。那么,在今天的图案设计特别是儿童服装的图案设计与应用中,怎样为孩子营造一个童话的世界,展现孩子的童真与童趣?一名优秀的童装图案设计师,应该充分利用自然环境,社会环境,民族心理和传统文化结构所赋予的条件,来解决这个问题,从而构思出独特完美而富有表现力的童装图案设计作品。 相似文献
53.
Clients from Delay Tolerant Networks (DTNs) might encounter overtime exceptions when they aggregate autonomic commercial web service references to form an all-or-nothing transaction. Such exceptions may cause extra overhead—“compensation cost” when aborting transactions. Regarding the delay-related characteristics of DTNs, this paper models the expected compensation cost (ECC) for the schedulings of commit-requests, presents a calculability analysis for quantitative ECC prediction, and explores the limitation of ECC’s probabilistic prediction accordingly. The analysis is based on the timed-2PC plus compensation (t2PC+) protocol and the multi-step price tag pattern, which is verified conditionally by simulation tests through randomly-chosen severely-fluctuant samplings of compensation cost and delays. The ultimate target of this work is to demonstrate the high complexity, and in particular, the uncertainty of ECC predictions due to the randomicity of DTNs’ delays. 相似文献
54.
Geometrically non-linear behavior of structural systems with random material property: An asymptotic spectral stochastic approach 总被引:1,自引:0,他引:1
M. Tootkaboni L. Graham-Brady B.W. Schafer 《Computer Methods in Applied Mechanics and Engineering》2009,198(37-40):3173-3185
An asymptotic spectral stochastic approach is presented for computing the statistics of the equilibrium path in the post-bifurcation regime for structural systems with random material properties. The approach combines numerical implementation of Koiter’s asymptotic theory with a stochastic Galerkin scheme and collocation in stochastic space to quantify uncertainties in the parametric representation of the load–displacement relationship, specifically in the form of uncertain post-buckling slope, post-buckling curvature, and a family of stochastic displacement fields. Using the proposed method, post-buckling response statistics for two plane frames are obtained and shown to be in close agreement with those obtained from Monte Carlo simulation, provided a fine enough spectral representation is used to model the variability in the random dimension. 相似文献
55.
For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time. 相似文献
56.
B. Farhadinia 《Information Sciences》2011,181(7):1348-1357
The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets. 相似文献
57.
We investigate asymptotic behavior of the C0-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t). 相似文献
58.
Michaël Rao 《Theoretical computer science》2011,412(27):3010-3018
59.
《国际计算机数学杂志》2012,89(12):2514-2534
A new analytical method for the approximate computation of the time-dependent Green's function for the initial-boundary value problem of the three-dimensional wave equation on multi-layered bounded cylinder is suggested in this paper. The method is based on the derivation of eigenvalues and eigenfunctions for an ordinary differential equation with piecewise constant coefficients, and an approximate computation of Green's function in the form of the Fourier series with a finite number of terms relative to the orthogonal set of the derived eigenfunctions. The computational experiment confirms the robustness of the method. 相似文献
60.