全文获取类型
收费全文 | 10339篇 |
免费 | 2104篇 |
国内免费 | 1919篇 |
专业分类
电工技术 | 712篇 |
综合类 | 1670篇 |
化学工业 | 201篇 |
金属工艺 | 113篇 |
机械仪表 | 676篇 |
建筑科学 | 251篇 |
矿业工程 | 165篇 |
能源动力 | 124篇 |
轻工业 | 143篇 |
水利工程 | 175篇 |
石油天然气 | 130篇 |
武器工业 | 87篇 |
无线电 | 1404篇 |
一般工业技术 | 749篇 |
冶金工业 | 84篇 |
原子能技术 | 22篇 |
自动化技术 | 7656篇 |
出版年
2024年 | 187篇 |
2023年 | 442篇 |
2022年 | 631篇 |
2021年 | 620篇 |
2020年 | 486篇 |
2019年 | 438篇 |
2018年 | 414篇 |
2017年 | 451篇 |
2016年 | 488篇 |
2015年 | 566篇 |
2014年 | 677篇 |
2013年 | 688篇 |
2012年 | 874篇 |
2011年 | 853篇 |
2010年 | 670篇 |
2009年 | 667篇 |
2008年 | 701篇 |
2007年 | 648篇 |
2006年 | 598篇 |
2005年 | 503篇 |
2004年 | 384篇 |
2003年 | 329篇 |
2002年 | 270篇 |
2001年 | 246篇 |
2000年 | 205篇 |
1999年 | 202篇 |
1998年 | 153篇 |
1997年 | 163篇 |
1996年 | 116篇 |
1995年 | 113篇 |
1994年 | 96篇 |
1993年 | 77篇 |
1992年 | 69篇 |
1991年 | 59篇 |
1990年 | 59篇 |
1989年 | 47篇 |
1988年 | 44篇 |
1987年 | 14篇 |
1986年 | 13篇 |
1985年 | 12篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
12.
本文在分析了双眼立体视觉面临的本质困难之后,提出了用金字塔图法匹配特征基元的三眼立体视觉方法,这种方法由于建筑在透视投影几何原理的稳固基础上,无须任何先验限制,也不以图象相似性为基础,故可较好地解决精度与匹配难度的矛盾,且运用金字塔图法进行匹配传播使在保证精度的基础上,匹配速度大大提高,对计算机人工图象的匹配结果表明,误匹配率几乎为零,且有较高的匹配速度和精度。 相似文献
13.
In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time. 相似文献
14.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
15.
基于分层加权的多边形图形匹配 总被引:6,自引:3,他引:3
提出了一种适用凸凹多边形匹配的分层加权测度方法,在此方法中,对凹多边形、首先进行基于提取凸多边形的模式分解,对凹多边形添加辅助线,形成新的外接凸多边形、通过依次抽取外接凸多边形,将凹多边形表达为仅由凸多边形组成的多层拓扑结构,然后,利用预先定义的互为模板的相似度量准则和分层加权测度模型,计算得到多边形的相似度系数,从而实现凹多边形的匹配和检索。 相似文献
16.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
17.
L. M. CRUZ-ORIVE 《Journal of microscopy》2005,219(1):18-28
A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples. 相似文献
18.
Until recently, numerical simulations of discontinuities in highly super-Alfvénic plasmas have been severely limited by comparatively crude resolution and accuracy. Significant progress in the numerical simulation of such plasmas was achieved with the recently implemented Central Weighted Essentially Non-Oscillatory (CWENO) scheme. Combining this technique with that of adaptive mesh refinement (AMR), we have developed a third-order numerical scheme, which is able to efficiently capture strong gradients on spatial scales being small compared to the overall scale of the plasma system considered. Here, we first describe important algorithmic aspects of the scheme as well as the physics included in it. Second, we present the results of various performance tests. And, third, we illustrate its application to ‘real world problems’ using the example of the dynamics of a Sedov-type explosion. 相似文献
19.
20.
This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences. 相似文献