全文获取类型
收费全文 | 233012篇 |
免费 | 30752篇 |
国内免费 | 18720篇 |
专业分类
电工技术 | 60793篇 |
技术理论 | 11篇 |
综合类 | 25188篇 |
化学工业 | 15064篇 |
金属工艺 | 6766篇 |
机械仪表 | 13804篇 |
建筑科学 | 16485篇 |
矿业工程 | 6643篇 |
能源动力 | 14355篇 |
轻工业 | 5984篇 |
水利工程 | 11403篇 |
石油天然气 | 8703篇 |
武器工业 | 2637篇 |
无线电 | 24431篇 |
一般工业技术 | 15305篇 |
冶金工业 | 6557篇 |
原子能技术 | 3704篇 |
自动化技术 | 44651篇 |
出版年
2024年 | 1042篇 |
2023年 | 3263篇 |
2022年 | 6469篇 |
2021年 | 7658篇 |
2020年 | 8214篇 |
2019年 | 6956篇 |
2018年 | 6427篇 |
2017年 | 8518篇 |
2016年 | 9581篇 |
2015年 | 10315篇 |
2014年 | 15401篇 |
2013年 | 14740篇 |
2012年 | 17854篇 |
2011年 | 19408篇 |
2010年 | 14855篇 |
2009年 | 15119篇 |
2008年 | 14970篇 |
2007年 | 17202篇 |
2006年 | 15068篇 |
2005年 | 12769篇 |
2004年 | 10351篇 |
2003年 | 8790篇 |
2002年 | 6936篇 |
2001年 | 5842篇 |
2000年 | 4954篇 |
1999年 | 3721篇 |
1998年 | 2860篇 |
1997年 | 2370篇 |
1996年 | 2244篇 |
1995年 | 1863篇 |
1994年 | 1571篇 |
1993年 | 1066篇 |
1992年 | 898篇 |
1991年 | 659篇 |
1990年 | 521篇 |
1989年 | 462篇 |
1988年 | 302篇 |
1987年 | 191篇 |
1986年 | 152篇 |
1985年 | 144篇 |
1984年 | 172篇 |
1983年 | 100篇 |
1982年 | 131篇 |
1981年 | 57篇 |
1980年 | 63篇 |
1979年 | 61篇 |
1978年 | 31篇 |
1977年 | 15篇 |
1959年 | 35篇 |
1951年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
181.
水力射孔对套管强度的影响研究 总被引:4,自引:2,他引:2
水力射孔技术是一种新型的完井方式,深穿透水力射孔技术辅助定向水力压裂可以实现油气层改造和油气井增产。但是,水力射孔套管会在孔眼处造成应力集中,使得局部应力过大而削弱了套管和水泥环的强度,可能会影响套管的使用寿命。因此,文章利用有限元软件建立了射孔套管的三维有限元模型,分析了水力射孔后套管管体的应力分布,重点研究了水力射孔参数-孔密、孔径、孔深、射孔方位角等对套管强度的影响规律。分析结果表明,沿着最大水平地应力方向深穿透水力射孔,选择合适的孔密、孔径可将射孔对套管的损害降至最小。研究结果为提高水力射孔完井设计水平提供了一定的参数依据。 相似文献
182.
燃气管网动态仿真的研究及应用 总被引:2,自引:0,他引:2
研究和了解燃气在管道中的流动,是进行燃气管网系统优化和提高管网输运系统安全性的前提和基础。以流体力学三大守恒方程为基础,建立了等温和非等温条件下的燃气管网稳态和动态仿真理论模型。以有限差分法为基础,得到了上述模型的求解方法,并加入了耗散项,提高了求解方法的稳定性。通过增加初始点和延长出口点的方法,简化了模型的求解。通过在北京六环天然气管网中的初步应用,分别得到了与实际值综合相对误差为1.21%和2.62%的压力和流量仿真值,从而验证了模型及求解方法的可靠性。 相似文献
183.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
184.
介绍了对大桥的风向、风力和交通流量的测试依据和内容,分析了风向、风力的测试结果以及梁体在风力及交通流量等作用下的受力情况,指出钢箱梁体主要受到的力是风力。 相似文献
185.
为实现电源设备乃至通信机房的少人或无人值守和集中维护,必须建立一套完善的电信局动力环境集中监控系统。文中结合番禺区电信局的实际,讨论了提高系统运行可靠性的几点措施,包括硬件方面与软件方面的手段,关键在于加强系统的运行管理。 相似文献
186.
开关电源的平均电流自动均流技术 总被引:1,自引:0,他引:1
针对多个开关电源并联时易出现负载电流在各模块间分配不均的现象,介绍了常用的负载电流自动均流法——平均电流自动均流法及其工作特性。并针对其存在母线电压降低的缺陷,提出了一种改进的平均电流自动均流方法,经试验证明均流精度比较高。 相似文献
187.
188.
189.
190.
A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid
meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising
the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model
is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated
by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation.
The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest.
Sponsored by The Research Council of Norway, project number 125676/410
Dedicated to the memory of Prof. Mike Crisfield, a respected colleague 相似文献