全文获取类型
收费全文 | 93749篇 |
免费 | 7875篇 |
国内免费 | 4055篇 |
专业分类
电工技术 | 5762篇 |
技术理论 | 2篇 |
综合类 | 5753篇 |
化学工业 | 14573篇 |
金属工艺 | 5047篇 |
机械仪表 | 5308篇 |
建筑科学 | 6738篇 |
矿业工程 | 1820篇 |
能源动力 | 2831篇 |
轻工业 | 7114篇 |
水利工程 | 1824篇 |
石油天然气 | 3865篇 |
武器工业 | 674篇 |
无线电 | 12677篇 |
一般工业技术 | 12466篇 |
冶金工业 | 4962篇 |
原子能技术 | 1058篇 |
自动化技术 | 13205篇 |
出版年
2024年 | 310篇 |
2023年 | 1322篇 |
2022年 | 2484篇 |
2021年 | 3632篇 |
2020年 | 2520篇 |
2019年 | 2140篇 |
2018年 | 2425篇 |
2017年 | 2813篇 |
2016年 | 2509篇 |
2015年 | 3431篇 |
2014年 | 4519篇 |
2013年 | 5896篇 |
2012年 | 6192篇 |
2011年 | 6942篇 |
2010年 | 6018篇 |
2009年 | 5820篇 |
2008年 | 5730篇 |
2007年 | 5477篇 |
2006年 | 5253篇 |
2005年 | 4287篇 |
2004年 | 2933篇 |
2003年 | 2445篇 |
2002年 | 2456篇 |
2001年 | 2092篇 |
2000年 | 1994篇 |
1999年 | 2007篇 |
1998年 | 1955篇 |
1997年 | 1676篇 |
1996年 | 1474篇 |
1995年 | 1263篇 |
1994年 | 999篇 |
1993年 | 832篇 |
1992年 | 652篇 |
1991年 | 516篇 |
1990年 | 432篇 |
1989年 | 340篇 |
1988年 | 293篇 |
1987年 | 221篇 |
1986年 | 191篇 |
1985年 | 192篇 |
1984年 | 137篇 |
1983年 | 98篇 |
1982年 | 105篇 |
1981年 | 90篇 |
1980年 | 86篇 |
1979年 | 60篇 |
1978年 | 50篇 |
1977年 | 60篇 |
1976年 | 89篇 |
1973年 | 46篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
印刷术的发明是中国人的骄傲。从1041年毕升发明活字印刷算起,经历了近千年的磨砺。“当代毕升”王选教授研制成功的中国汉字北大方正印前桌面系统,彻底淘汰了热排,淘汰了铅与火,改写了印前排版的历史,成为近代印刷的里程碑。虽然王选先生永远地离开了我们,但他对我国出版印刷事业所作的贡献将飚炳史册,光耀千秋。 相似文献
102.
从做大到做强的主体是PCB企业(集团) 中国PCB工业如何从做大到做强!(6) 总被引:2,自引:2,他引:0
从做大到做强是中国PCB工业的唯一出路.而做强中国PCB工业的主体是中国的PCB企业(集团).只有大多数的中国PCB企业做大并做强了,中国PCB工业才能称得上是PCB强国. 相似文献
103.
文章针对使用USB存储设备造成的内部泄密问题,提出了一种USB存储设备访问控制方案,该方案对用户的身份认证基于安全强度很高的椭圆曲线数字签名算法,同时使用过滤器驱动程序实现了USB存储设备的读写控制,因而此方案具有较好的安全性、实用性和通用性。 相似文献
104.
105.
福建周宁水电站工程由闽东水电开发有限公司负责项目管理。该项目严格按照《招投标法》进行工程和设备的招标,进行了多项设计优化,注重工程质量和安全文明生产,积极开展达标投产工作,实现了进度快、质量优、投资省、效益好的管理目标。 相似文献
106.
107.
108.
Sethuraman B.A. Rajan B.S. Shashidhar V. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(10):2596-2616
We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented. 相似文献
109.
A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee
the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined
as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests
may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first
present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests
on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design
a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective,
we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each
request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are
provided for the ease of understanding.
Recommended by: Ashfaq Khokhar 相似文献
110.
Why does it pay to be selfish in a MANET? 总被引:2,自引:0,他引:2
Younghwan Yoo Dharma P. Agrawal 《Wireless Communications, IEEE》2006,13(6):87-97
Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions 相似文献