全文获取类型
收费全文 | 231070篇 |
免费 | 18252篇 |
国内免费 | 14603篇 |
学科分类
工业技术 | 263925篇 |
出版年
2024年 | 841篇 |
2023年 | 2439篇 |
2022年 | 3953篇 |
2021年 | 4995篇 |
2020年 | 5907篇 |
2019年 | 4576篇 |
2018年 | 4142篇 |
2017年 | 6116篇 |
2016年 | 6888篇 |
2015年 | 7788篇 |
2014年 | 14866篇 |
2013年 | 12881篇 |
2012年 | 16287篇 |
2011年 | 18176篇 |
2010年 | 13509篇 |
2009年 | 13797篇 |
2008年 | 13972篇 |
2007年 | 17302篇 |
2006年 | 15541篇 |
2005年 | 13828篇 |
2004年 | 11508篇 |
2003年 | 10355篇 |
2002年 | 8195篇 |
2001年 | 6649篇 |
2000年 | 5656篇 |
1999年 | 4615篇 |
1998年 | 3581篇 |
1997年 | 3105篇 |
1996年 | 2529篇 |
1995年 | 2077篇 |
1994年 | 1696篇 |
1993年 | 1259篇 |
1992年 | 967篇 |
1991年 | 739篇 |
1990年 | 549篇 |
1989年 | 499篇 |
1988年 | 382篇 |
1987年 | 237篇 |
1986年 | 178篇 |
1985年 | 181篇 |
1984年 | 221篇 |
1983年 | 179篇 |
1982年 | 162篇 |
1981年 | 119篇 |
1980年 | 75篇 |
1979年 | 88篇 |
1978年 | 69篇 |
1977年 | 71篇 |
1976年 | 43篇 |
1975年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
大型综合室内亲子乐园属于高大空间,设有游乐设施和游戏的特殊性使得对空间的舒适性要求一致,但是送风气流遇阻严重,室内存在较多气流死角,影响室内空气质量和儿童健康。因此其空调设计不仅需要考虑温度、风速的空间均匀度,还要考虑各点的空气龄和PMV-PPD指标。以天津某亲子乐园为研究对象,利用scSTREAM软件对适用于该房间的辐射供冷加新风、置换通风、混合通风三种空调方式的送风效果进行数值模拟分析,从流场的均匀性、人员的热舒适性等方面对模拟结果进行探讨,研究结果表明辐射供冷加新风方式的空间均匀性和PMV指标最佳,混合通风方式的空气龄最小。 相似文献
2.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。 相似文献
3.
4.
5.
分析了冶炼烟气制酸工艺的特点,介绍了由PROFIBUS-DP现场总线构建的冶炼厂烟气制酸监控系统,详细介绍了其硬件配置及相应的软件设计。 相似文献
6.
马钢二烧结配料计算机控制系统 总被引:1,自引:0,他引:1
阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理;根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨;提供了系统的主要硬件结构,软件功能和程序框图。 相似文献
7.
8.
Kurjenniemi Janne Hämäläinen Seppo Ristaniemi Tapani 《Wireless Personal Communications》2003,27(4):337-351
In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out. 相似文献
9.
移动通信系统中功率控制研究 总被引:2,自引:0,他引:2
在阐述功率控制在移动通信系统中的发展过程的基础上,着重研究了WCDMA系统的功率控制,最后对功率控制未来的研究方向做了简要的分析。 相似文献
10.
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. 相似文献