全文获取类型
收费全文 | 2041篇 |
免费 | 106篇 |
国内免费 | 93篇 |
专业分类
电工技术 | 31篇 |
综合类 | 146篇 |
化学工业 | 14篇 |
金属工艺 | 23篇 |
机械仪表 | 62篇 |
建筑科学 | 7篇 |
矿业工程 | 5篇 |
能源动力 | 7篇 |
轻工业 | 18篇 |
水利工程 | 2篇 |
石油天然气 | 7篇 |
武器工业 | 5篇 |
无线电 | 366篇 |
一般工业技术 | 98篇 |
冶金工业 | 12篇 |
原子能技术 | 1篇 |
自动化技术 | 1436篇 |
出版年
2024年 | 4篇 |
2023年 | 33篇 |
2022年 | 37篇 |
2021年 | 51篇 |
2020年 | 37篇 |
2019年 | 55篇 |
2018年 | 50篇 |
2017年 | 93篇 |
2016年 | 115篇 |
2015年 | 109篇 |
2014年 | 175篇 |
2013年 | 139篇 |
2012年 | 139篇 |
2011年 | 150篇 |
2010年 | 79篇 |
2009年 | 105篇 |
2008年 | 104篇 |
2007年 | 79篇 |
2006年 | 87篇 |
2005年 | 55篇 |
2004年 | 69篇 |
2003年 | 69篇 |
2002年 | 50篇 |
2001年 | 36篇 |
2000年 | 30篇 |
1999年 | 25篇 |
1998年 | 26篇 |
1997年 | 28篇 |
1996年 | 25篇 |
1995年 | 24篇 |
1994年 | 18篇 |
1993年 | 28篇 |
1992年 | 15篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有2240条查询结果,搜索用时 15 毫秒
1.
Somnath Karmakar 《Polycyclic Aromatic Compounds》2019,39(2):159-171
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.
In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources. 相似文献
3.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
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. 相似文献
4.
In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network
with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities
and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the
network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability.
The problem is to route the multicast session from each source to the members of every multicast session, and to assign an
appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session
provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per
multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the
current network topology as well as its residual network resource information. We formulate the per session multicast routing
and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success
probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed
online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation
results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes
are SaD nodes. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
Parthasarathy P. Tirumalai Meng Lee Michael S. Schlansker 《The Journal of supercomputing》1991,5(2-3):119-136
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. 相似文献
10.