全文获取类型
收费全文 | 11340篇 |
免费 | 1657篇 |
国内免费 | 1553篇 |
专业分类
电工技术 | 786篇 |
技术理论 | 1篇 |
综合类 | 1805篇 |
化学工业 | 346篇 |
金属工艺 | 219篇 |
机械仪表 | 761篇 |
建筑科学 | 1035篇 |
矿业工程 | 214篇 |
能源动力 | 209篇 |
轻工业 | 253篇 |
水利工程 | 290篇 |
石油天然气 | 156篇 |
武器工业 | 97篇 |
无线电 | 1073篇 |
一般工业技术 | 589篇 |
冶金工业 | 277篇 |
原子能技术 | 43篇 |
自动化技术 | 6396篇 |
出版年
2024年 | 118篇 |
2023年 | 358篇 |
2022年 | 538篇 |
2021年 | 509篇 |
2020年 | 377篇 |
2019年 | 287篇 |
2018年 | 297篇 |
2017年 | 335篇 |
2016年 | 381篇 |
2015年 | 433篇 |
2014年 | 657篇 |
2013年 | 673篇 |
2012年 | 830篇 |
2011年 | 892篇 |
2010年 | 714篇 |
2009年 | 758篇 |
2008年 | 795篇 |
2007年 | 802篇 |
2006年 | 746篇 |
2005年 | 608篇 |
2004年 | 525篇 |
2003年 | 446篇 |
2002年 | 340篇 |
2001年 | 343篇 |
2000年 | 269篇 |
1999年 | 244篇 |
1998年 | 183篇 |
1997年 | 191篇 |
1996年 | 145篇 |
1995年 | 124篇 |
1994年 | 111篇 |
1993年 | 88篇 |
1992年 | 71篇 |
1991年 | 64篇 |
1990年 | 53篇 |
1989年 | 46篇 |
1988年 | 46篇 |
1987年 | 13篇 |
1986年 | 14篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 9篇 |
1982年 | 14篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1976年 | 10篇 |
1971年 | 4篇 |
1955年 | 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.
Maenghyo Cho Hee Yuel Roh 《International journal for numerical methods in engineering》2003,56(1):81-115
In the present study first‐order shear deformable shell finite elements based on general curvilinear co‐ordinates are proposed. For the development of the present shell elements, a partial mixed variational functional with independently assumed strains is provided in order to avoid the severe locking troubles known as transverse shear and membrane lockings. Bubble functions are included in the shape function of displacement to improve the performance of the developed element. The proposed assumed strain four‐ and nine‐node elements based on the general tensor shell theory provide an efficient linkage framework for shell surface modelling and finite element analysis. In the several benchmark problems, the present shell elements with exact geometric representations demonstrate their performance compared to previously reported results. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
13.
本文在分析了双眼立体视觉面临的本质困难之后,提出了用金字塔图法匹配特征基元的三眼立体视觉方法,这种方法由于建筑在透视投影几何原理的稳固基础上,无须任何先验限制,也不以图象相似性为基础,故可较好地解决精度与匹配难度的矛盾,且运用金字塔图法进行匹配传播使在保证精度的基础上,匹配速度大大提高,对计算机人工图象的匹配结果表明,误匹配率几乎为零,且有较高的匹配速度和精度。 相似文献
14.
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. 相似文献
15.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
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.
18.
This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery. 相似文献
19.
One of the problems encountered by automatic feeding devices, such as vibratory bowl feeders, in robotic assembly systems is nesting which leads to inseparability of parts and jamming. In this paper, we describe a design evaluation procedure to determine whether a part is prone to nesting and to quantify the degree of nesting. The proposed methodology reduces the 3-D protrusion-hole polyhedral containment problem of nesting to a 2-D polygon containment problem by employing a loop-based feature recognition scheme. Subsequently, the 3-D containment configuration is reconstructed from that of the 2-D by using a strategy calleddrop, pull and push. In this context, we introduce the notion of axis as a characteristic direction of a feature that facilitates the analysis of generalized 3-D polyhedral containment. The algorithms are applicable to generic B-Rep CAD data, and their time and space complexities are polynomial. 相似文献