全文获取类型
收费全文 | 34202篇 |
免费 | 4530篇 |
国内免费 | 3379篇 |
专业分类
电工技术 | 3414篇 |
技术理论 | 1篇 |
综合类 | 4750篇 |
化学工业 | 2737篇 |
金属工艺 | 2032篇 |
机械仪表 | 2179篇 |
建筑科学 | 999篇 |
矿业工程 | 613篇 |
能源动力 | 389篇 |
轻工业 | 1268篇 |
水利工程 | 309篇 |
石油天然气 | 1639篇 |
武器工业 | 409篇 |
无线电 | 4663篇 |
一般工业技术 | 4818篇 |
冶金工业 | 744篇 |
原子能技术 | 203篇 |
自动化技术 | 10944篇 |
出版年
2024年 | 127篇 |
2023年 | 478篇 |
2022年 | 901篇 |
2021年 | 1057篇 |
2020年 | 1009篇 |
2019年 | 1101篇 |
2018年 | 982篇 |
2017年 | 1303篇 |
2016年 | 1321篇 |
2015年 | 1585篇 |
2014年 | 2101篇 |
2013年 | 2313篇 |
2012年 | 2458篇 |
2011年 | 2625篇 |
2010年 | 2111篇 |
2009年 | 2301篇 |
2008年 | 2173篇 |
2007年 | 2534篇 |
2006年 | 2098篇 |
2005年 | 1831篇 |
2004年 | 1526篇 |
2003年 | 1260篇 |
2002年 | 1049篇 |
2001年 | 948篇 |
2000年 | 817篇 |
1999年 | 694篇 |
1998年 | 518篇 |
1997年 | 467篇 |
1996年 | 428篇 |
1995年 | 406篇 |
1994年 | 345篇 |
1993年 | 277篇 |
1992年 | 199篇 |
1991年 | 161篇 |
1990年 | 148篇 |
1989年 | 106篇 |
1988年 | 92篇 |
1987年 | 48篇 |
1986年 | 34篇 |
1985年 | 32篇 |
1984年 | 28篇 |
1983年 | 27篇 |
1982年 | 17篇 |
1981年 | 15篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 9篇 |
1976年 | 6篇 |
1951年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
基于F2上遍历矩阵的Shamir三次传递协议的实现 总被引:3,自引:0,他引:3
给出了Shamir三次传递协议的一种新的实现方案.与已有的基于离散对数问题的实现方案不同,它是基于在特定的非交换壹半群(m,·)中,由A和B=x·A·y求解x和y的难度;为此我们选取有限域F2上的n×n矩阵在F2矩阵乘法下所构成的非交换壹半群作为研究的对象,利用F2上"遍历矩阵"的密码学特性,提出了一个基于F2上遍历矩阵的Shamir三次传递协议的实现方案,并对可能的攻击手段进行了分析.为了增加通讯的安全性,提出了"强壮矩阵"的概念,并对于给定的两个遍历矩阵Q1和Q2,给出了关于Q1,Q2的强壮矩阵的判别标准和寻找算法;利用<Q1>,<Q2>以及关于Q1,Q2的强壮矩阵m,可以构造一个单向(陷门)函数,基于该单向函数,可具体实现Shamir三次传递协议、Diffie-Hellman密钥交换协议以及常规的公钥密码. 相似文献
92.
This paper considers the problem of determining the minimum Euclidean distance of a point from a polynomial surface in
. It is well known that this problem is in general non-convex. The main purpose of the paper is to investigate to what extent linear matrix inequality (LMI) techniques can be exploited for solving this problem. The first result of the paper shows that a lower bound to the global minimum can be achieved via the solution of a one-parameter family of linear matrix inequalities (LMIs). It is also pointed out that for some classes of problems the solution of a single LMI problem provides the lower bound. The second result concerns the tightness of the bound. It is shown that optimality of the lower bound amounts to solving a system of linear equations. An application example is finally presented to show the features of the approach. 相似文献
93.
94.
基于增广矩阵束方法的平面天线阵列综合 总被引:1,自引:1,他引:0
针对平面阵列的稀布优化问题,提出了一种基于增广矩阵束方法的减少阵元数目、求解阵元位置和设计幅度激励的优化方法。首先对期望平面阵的方向图进行采样并由采样点数据构造增广矩阵,对此矩阵进行奇异值(SVD)分解,确定在误差允许范围内所需的最小阵元数目;然后基于广义特征值分解分别计算两组特征值,并根据类ESPRIT算法对特征值进行配对;最后在最小二乘准则条件下根据正确的特征值对求解平面阵列的阵元位置和激励。仿真结果表明该算法具有较高的计算效率和数值精度。 相似文献
95.
《国际计算机数学杂志》2012,89(5):691-700
New splitting iterative methods for Toeplitz systems are proposed by means of recently developed matrix splittings based on discrete sine and cosine transforms due to Kailath and Olshevsky [Displacement structure approach to discrete-trigonometric transform-based preconditioners of G. Strang type and of T. Chan type, SIAM J. Matrix Anal. Appl. 26 (2005), pp. 706–734]. Theoretical analysis shows that new splitting iterative methods converge to the unique solution of a symmetric Toeplitz linear system. Moreover, an upper bound of the contraction factor of our new splitting iterations is derived. Numerical examples are reported to illustrate the effectiveness of new splitting iterative methods. 相似文献
96.
97.
98.
K. VivekanandanAuthor Vitae D. RamyachitraAuthor Vitae 《Future Generation Computer Systems》2012,28(4):647-656
Scientific applications such as protein sequence analysis require a coordination of resources. This is due to hundreds and hundreds of protein sequences being deposited into data banks by the research community which results in an extensive database search when one wants to find a similar protein sequence. This search becomes easier and the time taken is reduced when it is conducted in a grid environment implemented using the Globus tool kit. This paper proposes the use of Bacteria Foraging Optimization (BFO) for finding similar protein sequences in the existing databases. Usage of BFO further reduces the time taken by a resource to execute the user’s requests. Also, the resources utilized in the proposed method are better balanced compared to the existing scheduling algorithms. Also, it is found that the number of tasks executed is more compared to the existing algorithms even though there is a fall in the execution of tasks as the number of resources increases which might be due to network failure etc. The proposed BFO has been compared with the existing First Come First Serve (FCFS) and Minimum Execution Time (MET) scheduling algorithms and it has been found that the proposed BFO performs well compared to the existing algorithms in terms of makespan, resource utilization and minimization in the case of non-execution of client requests. 相似文献
99.
100.
A. E. Avramenko 《Measurement Techniques》2006,49(6):585-591
A new method of generating pulsar time based on a coherent representation of a sequence of observed events is considered.
The properties of pulsar time compared with the traditional approach are analyzed.
__________
Translated from Izmeritel’naya Tekhnika, No. 6, pp. 39–44, June, 2006. 相似文献