全文获取类型
收费全文 | 1295篇 |
免费 | 98篇 |
国内免费 | 72篇 |
专业分类
电工技术 | 18篇 |
综合类 | 145篇 |
化学工业 | 23篇 |
金属工艺 | 14篇 |
机械仪表 | 42篇 |
建筑科学 | 6篇 |
矿业工程 | 5篇 |
能源动力 | 5篇 |
轻工业 | 17篇 |
水利工程 | 1篇 |
石油天然气 | 6篇 |
武器工业 | 6篇 |
无线电 | 96篇 |
一般工业技术 | 78篇 |
冶金工业 | 19篇 |
原子能技术 | 3篇 |
自动化技术 | 981篇 |
出版年
2024年 | 5篇 |
2023年 | 31篇 |
2022年 | 22篇 |
2021年 | 19篇 |
2020年 | 16篇 |
2019年 | 24篇 |
2018年 | 23篇 |
2017年 | 38篇 |
2016年 | 38篇 |
2015年 | 43篇 |
2014年 | 62篇 |
2013年 | 70篇 |
2012年 | 73篇 |
2011年 | 91篇 |
2010年 | 60篇 |
2009年 | 92篇 |
2008年 | 81篇 |
2007年 | 68篇 |
2006年 | 81篇 |
2005年 | 52篇 |
2004年 | 54篇 |
2003年 | 65篇 |
2002年 | 50篇 |
2001年 | 29篇 |
2000年 | 29篇 |
1999年 | 18篇 |
1998年 | 21篇 |
1997年 | 23篇 |
1996年 | 21篇 |
1995年 | 24篇 |
1994年 | 17篇 |
1993年 | 27篇 |
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篇 |
排序方式: 共有1465条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
J. Balakrishnan W. A. Sethares C. R. Johnson 《International Journal of Adaptive Control and Signal Processing》2002,16(4):309-323
A method of approximate channel identification is proposed that is based on a simplification of the correlation estimator. Despite the numerical simplification (no multiplications or additions are required, only comparisons and an accumulator), the performance of the proposed estimator is not significantly worse than that of the standard correlation estimator. A free (user selectable) parameter moves ‘smoothly’ from a situation with small sum‐squared channel estimation error but hard‐to‐identify channel peaks, to one with a larger sum‐squared estimation error but easy‐to‐identify channel peaks. The proposed estimator is shown to be biased and its behaviour is analysed in a number of situations. Applications of the proposed estimator to sparsity detection, symbol timing recovery and to the initialization of blind equalizers are suggested. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
3.
4.
A. Kaveh M. A. Sayarinejad 《International journal for numerical methods in engineering》2006,67(7):1012-1043
Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
5.
Eddie Cheng 《Information Sciences》2007,177(22):4877-4882
We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices. 相似文献
6.
Sun-Yuan Hsieh 《The Journal of supercomputing》2007,39(1):39-57
A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known
classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect
domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property
of the problem, we also show that it can be easily parallelized on distance-hereditary graphs. 相似文献
7.
Louis Esperet 《Information Processing Letters》2007,101(5):215-219
A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H′ such that H has a homomorphism to H′. In this paper, we prove that 2-outerplanar graphs are 4-degenerate. We also show that oriented 2-outerplanar graphs have a homomorphism to the Paley tournament QR67, which implies that their (strong) oriented chromatic number is at most 67. 相似文献
8.
In this note, we show that any distributive lattice is isomorphic to the set of reachable configurations of an Edge Firing Game. Together with the result of James Propp, saying that the set of reachable configurations of any Edge Firing Game is always a distributive lattice, this shows that the two concepts are equivalent. 相似文献
9.
Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets. 相似文献
10.