全文获取类型
收费全文 | 28944篇 |
免费 | 3602篇 |
国内免费 | 2821篇 |
专业分类
电工技术 | 2583篇 |
技术理论 | 3篇 |
综合类 | 3828篇 |
化学工业 | 714篇 |
金属工艺 | 539篇 |
机械仪表 | 1558篇 |
建筑科学 | 1838篇 |
矿业工程 | 555篇 |
能源动力 | 499篇 |
轻工业 | 427篇 |
水利工程 | 712篇 |
石油天然气 | 475篇 |
武器工业 | 214篇 |
无线电 | 4565篇 |
一般工业技术 | 1777篇 |
冶金工业 | 810篇 |
原子能技术 | 53篇 |
自动化技术 | 14217篇 |
出版年
2024年 | 90篇 |
2023年 | 295篇 |
2022年 | 552篇 |
2021年 | 680篇 |
2020年 | 902篇 |
2019年 | 696篇 |
2018年 | 755篇 |
2017年 | 787篇 |
2016年 | 952篇 |
2015年 | 1178篇 |
2014年 | 1911篇 |
2013年 | 1922篇 |
2012年 | 2294篇 |
2011年 | 2447篇 |
2010年 | 1977篇 |
2009年 | 2075篇 |
2008年 | 2309篇 |
2007年 | 2434篇 |
2006年 | 2121篇 |
2005年 | 1907篇 |
2004年 | 1524篇 |
2003年 | 1267篇 |
2002年 | 921篇 |
2001年 | 727篇 |
2000年 | 616篇 |
1999年 | 416篇 |
1998年 | 275篇 |
1997年 | 243篇 |
1996年 | 220篇 |
1995年 | 182篇 |
1994年 | 148篇 |
1993年 | 87篇 |
1992年 | 73篇 |
1991年 | 65篇 |
1990年 | 60篇 |
1989年 | 51篇 |
1988年 | 38篇 |
1987年 | 22篇 |
1986年 | 13篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 13篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 6篇 |
1963年 | 7篇 |
1961年 | 9篇 |
1960年 | 4篇 |
1957年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
52.
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm. 相似文献
53.
54.
计算机网络安全的分析与探索 总被引:1,自引:0,他引:1
针对计算机网络安全问题进行了探讨,分析了目前最为威胁网络安全的因素,介绍了网络安全的分类综合了一些保证网络安全的措施. 相似文献
55.
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations.
The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed
by conducting numerical experiments.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007. 相似文献
56.
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. 相似文献
57.
Simonetta Balsamo Vittoria De Nitto Person Paola Inverardi 《Performance Evaluation》2003,51(2-4):269-288
A review is carried out on how queueing network models with blocking have been applied so far into the performance evaluation and prediction of Software Architectures (SA). Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. Queueing network models have been often adopted as models for the evaluation of software performance. Starting from our own experience, we observe the need of a more accurate definition of the performance models of SA to capture some features of the communication systems. We consider queueing networks with finite capacity and blocking after service (BAS) to represent some synchronization constraints that cannot be easily modeled with queueing network models with infinite capacity queues. We investigate the use of queueing networks with blocking as performance models of SA with concurrent components and synchronous communication. Queueing theoretic analysis is used to solve the queueing network model and study the synchronous communication and performance of concurrent software components. Our experience is supported by other approaches that also propose the use of queueing networks with blocking. Directions for future research work in the field are included. 相似文献
58.
Garth Isaak 《Information Processing Letters》2004,92(3):107-111
Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient conditions for this feedback arc set to have minimum size. 相似文献
59.
60.
根据GPRS业务及业务发展情况,对GPRS业务模型进行深入研究,并对GPRS无线网络进行了更深入的探讨。 相似文献