全文获取类型
收费全文 | 2572篇 |
免费 | 279篇 |
国内免费 | 230篇 |
专业分类
电工技术 | 125篇 |
综合类 | 128篇 |
化学工业 | 152篇 |
金属工艺 | 77篇 |
机械仪表 | 86篇 |
建筑科学 | 54篇 |
矿业工程 | 21篇 |
能源动力 | 32篇 |
轻工业 | 77篇 |
水利工程 | 26篇 |
石油天然气 | 20篇 |
武器工业 | 63篇 |
无线电 | 470篇 |
一般工业技术 | 244篇 |
冶金工业 | 124篇 |
原子能技术 | 43篇 |
自动化技术 | 1339篇 |
出版年
2024年 | 4篇 |
2023年 | 37篇 |
2022年 | 64篇 |
2021年 | 40篇 |
2020年 | 53篇 |
2019年 | 83篇 |
2018年 | 74篇 |
2017年 | 86篇 |
2016年 | 93篇 |
2015年 | 116篇 |
2014年 | 165篇 |
2013年 | 182篇 |
2012年 | 186篇 |
2011年 | 195篇 |
2010年 | 137篇 |
2009年 | 157篇 |
2008年 | 191篇 |
2007年 | 163篇 |
2006年 | 166篇 |
2005年 | 132篇 |
2004年 | 89篇 |
2003年 | 99篇 |
2002年 | 76篇 |
2001年 | 62篇 |
2000年 | 78篇 |
1999年 | 45篇 |
1998年 | 57篇 |
1997年 | 48篇 |
1996年 | 42篇 |
1995年 | 20篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 16篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1966年 | 1篇 |
1955年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有3081条查询结果,搜索用时 15 毫秒
101.
102.
Eunsang Kim 《Information Processing Letters》2009,109(9):454-459
Bentley and Sedgewick proposed multikey Quicksort with ‘split-end’ partitioning for sorting strings. But it can be slow in case of many equal elements because it adopted ‘split-end’ partitioning that moves equal elements to the ends and swaps back to the middle. We present ‘collect-center’ partitioning to improve multikey Quicksort in that case. It moves equal elements to the middle directly like the ‘Dutch National Flag Problem’ partitioning approach and it uses two inner loops like Bentley and McIlroy's. In case of many equal elements such as DNA sequences, HTML files, and English texts, multikey Quicksort with ‘collect-center’ partitioning is faster than multikey Quicksort with ‘split-end’ partitioning. 相似文献
103.
This paper introduces a control strategy based on retuning a multi-rate PID controller in accordance with the variable delays detected in a networked control system, in order to avoid a decreased control performance. The basic idea is minimising the first-order Taylor terms of a performance measure via gain scheduling, i.e., making the controller gains delay dependent. As network delay is time-variant, the stability of this control approach will be proved by means of linear matrix inequalities. 相似文献
104.
Majority of the mesh-partitioning algorithms attempt to optimise the interprocessor communications, while balancing the computational load among the processors. However, it is desirable to simultaneously optimise the submesh aspect ratios in order to significantly improve the convergence characteristics of the domain decomposition based Preconditioned-conjugate-gradient algorithms, being used extensively in the state-of-the-art parallel finite element codes. Keeping this in view, a new distributed multi-objective mesh-partitioning algorithm using evolutionary computing techniques is proposed in this paper. Effectiveness of the proposed distributed mesh-partitioning algorithm is demonstrated by solving several unstructured meshes of practical-engineering problems and also benchmark problems. 相似文献
105.
This paper is concerned with boundedness, convergence of solution of a class of non-autonomous discrete-time delayed Hopfield neural network model. Using the inequality technique, we obtain some sufficient conditions ensuring the boundedness of solutions of the discrete-time delayed Hopfield models in time-varying situation. Then, by exploring intrinsic features between non-autonomous system and its asymptotic equations, several novel sufficient conditions are established to ensure that all solutions of the networks converge to the solution of its asymptotic equations. Especially, for case of asymptotic autonomous system or asymptotic periodic system, we obtain some sufficient conditions ensuring all solutions of original system convergent to equilibrium or periodic solution of asymptotic system, respectively. An example is provided for demonstrating the effectiveness of the global stability conditions presented. Our results are not only presented in terms of system parameters and can be easily verified but also are less restrictive than previously known criteria. 相似文献
106.
107.
108.
在大规模图数据的分布式处理中,往往需要将图数据进行划分并放置在不同的节点上。如果数据划分得不均衡,那么部分节点可能会成为分布式系统的瓶颈。为了提高图数据划分的均衡性,并且有效地应对图数据的快速更新,提出了一种松弛的优化均衡流式图划分算法。首先,定义了一种同时包含划分内部代价和划分之间的割的代价的目标函数作为图划分的整体框架。然后,在图划分框架的基础上通过最大化和最小化两种优化函数分析了均衡图划分问题,并给出了二者之间的关系。最后,针对流式图数据,提出一种贪婪的图最优k划分算法。该划分算法以最大化优化函数为基础,通过最大化顶点放置产生的目标函数增加值进行节点划分块的选取。实验表明,提出的图划分算法与相关算法相比,不仅均衡性好,而且通信开销小,在基于该算法进行图划分时上层应用的计算性能得到了明显的提高。 相似文献
109.
《Journal of Computer and System Sciences》2016,82(6):1044-1063
We study the Weighted t-Uniform Sparsest Cut (Weighted t-USC) and other related problems. In an instance of the Weighted t-USC problem, a parameter t and an undirected graph with edge-weights and vertex-weights are given. The goal is to find a vertex set with while minimizing , where is the total weight of the edges with exactly one endpoint in S and . For this problem, we present a factor bicriteria approximation algorithm. Our algorithm outperforms the current best algorithm when . We also present better approximation algorithms for Weighted ρ-Unbalanced Cut and Min–Max k-Partitioning problems. 相似文献
110.