首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1163篇
  免费   68篇
  国内免费   47篇
电工技术   10篇
综合类   129篇
化学工业   9篇
金属工艺   13篇
机械仪表   39篇
建筑科学   5篇
矿业工程   3篇
能源动力   5篇
轻工业   21篇
水利工程   2篇
石油天然气   5篇
武器工业   5篇
无线电   74篇
一般工业技术   71篇
冶金工业   12篇
自动化技术   875篇
  2024年   3篇
  2023年   21篇
  2022年   20篇
  2021年   20篇
  2020年   15篇
  2019年   20篇
  2018年   13篇
  2017年   29篇
  2016年   22篇
  2015年   39篇
  2014年   42篇
  2013年   62篇
  2012年   69篇
  2011年   76篇
  2010年   51篇
  2009年   82篇
  2008年   73篇
  2007年   56篇
  2006年   67篇
  2005年   42篇
  2004年   50篇
  2003年   60篇
  2002年   45篇
  2001年   28篇
  2000年   30篇
  1999年   17篇
  1998年   20篇
  1997年   22篇
  1996年   20篇
  1995年   21篇
  1994年   17篇
  1993年   28篇
  1992年   14篇
  1991年   13篇
  1990年   7篇
  1989年   9篇
  1988年   7篇
  1987年   5篇
  1984年   4篇
  1983年   5篇
  1982年   2篇
  1981年   2篇
  1980年   4篇
  1979年   6篇
  1978年   3篇
  1977年   3篇
  1976年   4篇
  1975年   2篇
  1974年   2篇
  1973年   2篇
排序方式: 共有1278条查询结果,搜索用时 250 毫秒
1.
Eigensolutions of {X( = C,B,N),Y( = C,B,N)}-cyclacene graphs with next nearest neighbor (nnn) interactions have been obtained in analytical forms by adapting n-fold rotational symmetry followed by two-fold rotational symmetry (or a plane of symmetry). Expressions of eigensolution indicate the subspectral relationship among such cyclacenes with an even number of hexagonal rings e.g., eigenvalues of {X,Y}-di-cyclacene are found in the eigenspectra of all such even cyclacenes. Total π-electron energies and highest occupied molecular orbital and lowest unoccupied molecular orbital (HOMO–LUMO) gaps are calculated using the analytical expressions obtained and are found to vary negligibly with the variation of nnn interactions in such cyclacenes. Total π-electron energy is found to increase due to increase in restriction intensity of nnn interactions, whereas the HOMO–LUMO gap of polyacenecs having the even number of hexagonal rings and with one electron at each site (atom) decreases with increase in the restriction intensity since such systems contain degenerate half-filled HOMO (bonding or nonbonding) that are much more vulnerable for perturbations imposed through nnn interactions.  相似文献   
2.
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
3.
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.  相似文献   
4.
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.  相似文献   
5.
We show that an n-vertex bipartite K3,3-free graph with n?3 has at most 2n−4 edges and that an n-vertex bipartite K5-free graph with n?5 has at most 3n−9 edges. These bounds are also tight. We then use the bound on the number of edges in a K3,3-free graph to extend two known NC algorithms for planar graphs to K3,3-free graphs.  相似文献   
6.
The reliability of a system is the probability that the system will perform its intended mission under given conditions. This paper provides an overview of the approaches to reliability modelling and identifies their strengths and weaknesses. The models discussed include structure models, simple stochastic models and decomposable stochastic models. Ignoring time-dependence, structure models give reliability as a function of the topological structure of the system. Simple stochastic models make direct use of the properties of underlying stochastic processes, while decomposable models consider more complex systems and analyse them through subsystems. Petri nets and dataflow graphs facilitate the analysis of complex systems by providing a convenient framework for reliability analysis.  相似文献   
7.
Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90.  相似文献   
8.
证明了具有不小于6个顶点的不包含4圈的简单图的最大可能边数的下界是2n-5。  相似文献   
9.
针对国内许多企业由于在管理理念、模式、人员素质等因素的影响下导致引进的设备信息管理系统无法成功实施的难题,通过在海洋油田使用MAXIMO系统过程中对报表的开发应用,为提高MAXIMO系统在管理中的实施效果提出了新的管理思路。  相似文献   
10.
新型压滤机液压控制系统的研制   总被引:1,自引:0,他引:1       下载免费PDF全文
 针对压滤机的工艺要求,在对新型压滤机液压控制系统研究设计的基础上,利用功率键合图方法建立了压滤机液压系统数学模型,并运用Matlab语言进行动态特性仿真.在压滤机现场实际运用表明该系统性能达到了预期目标,为压滤机液压系统优化设计提供了依据.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号