全文获取类型
收费全文 | 7373篇 |
免费 | 1315篇 |
国内免费 | 1407篇 |
专业分类
电工技术 | 409篇 |
综合类 | 1134篇 |
化学工业 | 134篇 |
金属工艺 | 94篇 |
机械仪表 | 513篇 |
建筑科学 | 112篇 |
矿业工程 | 108篇 |
能源动力 | 73篇 |
轻工业 | 96篇 |
水利工程 | 71篇 |
石油天然气 | 60篇 |
武器工业 | 41篇 |
无线电 | 821篇 |
一般工业技术 | 390篇 |
冶金工业 | 50篇 |
原子能技术 | 13篇 |
自动化技术 | 5976篇 |
出版年
2024年 | 156篇 |
2023年 | 369篇 |
2022年 | 519篇 |
2021年 | 478篇 |
2020年 | 326篇 |
2019年 | 240篇 |
2018年 | 239篇 |
2017年 | 276篇 |
2016年 | 280篇 |
2015年 | 344篇 |
2014年 | 400篇 |
2013年 | 418篇 |
2012年 | 549篇 |
2011年 | 546篇 |
2010年 | 437篇 |
2009年 | 481篇 |
2008年 | 508篇 |
2007年 | 473篇 |
2006年 | 452篇 |
2005年 | 375篇 |
2004年 | 301篇 |
2003年 | 270篇 |
2002年 | 200篇 |
2001年 | 195篇 |
2000年 | 164篇 |
1999年 | 170篇 |
1998年 | 125篇 |
1997年 | 134篇 |
1996年 | 97篇 |
1995年 | 97篇 |
1994年 | 78篇 |
1993年 | 61篇 |
1992年 | 56篇 |
1991年 | 48篇 |
1990年 | 44篇 |
1989年 | 36篇 |
1988年 | 36篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
Directed signature scheme allows only a designated verifier to check the validity of the signature issued to him; and at the time of trouble or if necessary, any third party can verify the signature with the help of the signer or the designated verifier as well. Due to its merits, directed signature scheme is widely used in situations where the receiver’s privacy should be protected. Threshold directed signature is an extension of the standard directed signature, in which several signers may be required to cooperatively sign messages for sharing the responsibility and authority. To the best of our knowledge, threshold directed signature has not been well studied till now. Therefore, in this paper, we would like to formalize the threshold directed signature and its security model, then present a new (t, n) threshold directed signature scheme from bilinear pairings and use the techniques from provable security to analyze its security. 相似文献
63.
Vladimir Yanovsky 《Information Processing Letters》2008,108(1):41-44
Dotted interval graphs were introduced by Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348] as a generalization of interval graphs. The problem of coloring these graphs found application in high-throughput genotyping. Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] improves the approximation ratio of Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In this work we improve the approximation ratio of Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] and Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In the exposition we develop a generalization of the problem of finding the maximum number of non-attacking queens on a triangle. 相似文献
64.
Abstract. In this paper two problems on the class of k -trees, a subclass of the class of chordal graphs, are considered: the fast reordering problem and the isomorphism problem. An O(log
2
n) time parallel algorithm for the fast reordering problem is described that uses O(nk(n-k)/\kern -1ptlog n) processors on a CRCW PRAM proving membership in the class NC for fixed k . An O(nk(k+1)!) time sequential algorithm for the isomorphism problem is obtained representing an improvement over the O(n
2
k(k+1)!) algorithm of Sekharan (the second author) [10]. A parallel version of this sequential algorithm is presented that runs in
O(log
2
n) time using O((nk((k+1)!+n-k))/log n) processors improving on a parallel algorithm of Sekharan for the isomorphism problem [10]. Both the sequential and parallel
algorithms use a concept introduced in this paper called the kernel of a k -tree. 相似文献
65.
A high performance algorithm for static task scheduling in heterogeneous distributed computing systems 总被引:2,自引:0,他引:2
Effective task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (HeDCSs). However, finding an effective task schedule in HeDCSs requires the consideration of both the heterogeneity of processors and high interprocessor communication overhead, which results from non-trivial data movement between tasks scheduled on different processors. In this paper, we present a new high-performance scheduling algorithm, called the longest dynamic critical path (LDCP) algorithm, for HeDCSs with a bounded number of processors. The LDCP algorithm is a list-based scheduling algorithm that uses a new attribute to efficiently select tasks for scheduling in HeDCSs. The efficient selection of tasks enables the LDCP algorithm to generate high-quality task schedules in a heterogeneous computing environment. The performance of the LDCP algorithm is compared to two of the best existing scheduling algorithms for HeDCSs: the HEFT and DLS algorithms. The comparison study shows that the LDCP algorithm outperforms the HEFT and DLS algorithms in terms of schedule length and speedup. Moreover, the improvement in performance obtained by the LDCP algorithm over the HEFT and DLS algorithms increases as the inter-task communication cost increases. Therefore, the LDCP algorithm provides a practical solution for scheduling parallel applications with high communication costs in HeDCSs. 相似文献
66.
67.
该文首先提出用Minkowski和的工具将多边形机器人的路径规划问题转化为点机器人的情况,然后基于移动机器人的安全考虑,提出了一种改进的可视图法。该方法用尽可能远离障碍物的路径表示弧,先确定可能的路径点作为节点,然后考虑可能路径,建立结点间的弧,并用Dijkstra算法求出图中的最短路径。最后通过仿真研究表明,用文章提出的方法规划的路径可以达到或接近最优路径。 相似文献
68.
语义桌面作为语义Web的一个重要分支,可以为个人计算机用户提供丰富的元数据,用以记录桌面文档的各种特征。这些特征包括文件的常规属性和与用户行为相关的属性,它们为桌面文档检索提供帮助。受到"概念图"理论的启发,本文提出了一种语义桌面环境下的文档检索算法。该算法能有效地利用语义桌面提供的元数据建立一种便于快速查找的文档索引结构,迅速地确定用户查询与桌面文档之间的投影算子。实验表明,该算法的时间效率比以往的基于匹配推理的投影算法有很大的提高,可以在很大程度上满足用户对桌面文档进行快速检索的需求。 相似文献
69.
为缩短复杂SoC系统的设计周期,降低系统设计的复杂性,提出了一种SoC系统级的并行划分方法.引入带有信号激活率和输入输出延时的过程模型图,为SoC系统构建模型.设计一启发式算法对该过程模型图进行并行划分,同时,该算法能解决有环图的划分问题.通过大量的实验证明,划分结果同要求吻合,说明该划分方法是可行、有效的. 相似文献
70.
Marching-Graph是一种将图形隐喻技术和空间隐喻技术集成为一体的新的可视化方法.它为用户提供了高度可交互性地图,使用户可访问那些具有地理属性的信息的逻辑结构.它通过有效的人图交互和跨空间浏览为用户提供了一种可视分析和挖掘未知信息的机制,而不是将已知的信息呈现在地图上.然而,传统的力导向布局算法在达到力量均衡配置方面非常慢.为使一个图形布局收敛,它们通常需花费几十秒的时间.因此。当用户快速行进于地理区间时,那些力导向布局算法就不能满足快速绘制一系列图形的要求.提出了一种快速收敛布局方法,当用户在Marching-Graph中通过力导向布局逐步探究一系列图形时,它可以加速交互时间.通过结合辐射树绘图技术和力导向图形绘制方法来取得能量最小化的快速收敛. 相似文献