全文获取类型
收费全文 | 6348篇 |
免费 | 932篇 |
国内免费 | 672篇 |
专业分类
电工技术 | 737篇 |
综合类 | 709篇 |
化学工业 | 301篇 |
金属工艺 | 167篇 |
机械仪表 | 379篇 |
建筑科学 | 451篇 |
矿业工程 | 161篇 |
能源动力 | 70篇 |
轻工业 | 156篇 |
水利工程 | 76篇 |
石油天然气 | 109篇 |
武器工业 | 83篇 |
无线电 | 1493篇 |
一般工业技术 | 369篇 |
冶金工业 | 101篇 |
原子能技术 | 40篇 |
自动化技术 | 2550篇 |
出版年
2024年 | 26篇 |
2023年 | 103篇 |
2022年 | 173篇 |
2021年 | 170篇 |
2020年 | 198篇 |
2019年 | 198篇 |
2018年 | 150篇 |
2017年 | 207篇 |
2016年 | 248篇 |
2015年 | 281篇 |
2014年 | 417篇 |
2013年 | 400篇 |
2012年 | 527篇 |
2011年 | 506篇 |
2010年 | 382篇 |
2009年 | 446篇 |
2008年 | 481篇 |
2007年 | 524篇 |
2006年 | 384篇 |
2005年 | 403篇 |
2004年 | 311篇 |
2003年 | 262篇 |
2002年 | 252篇 |
2001年 | 188篇 |
2000年 | 173篇 |
1999年 | 123篇 |
1998年 | 84篇 |
1997年 | 63篇 |
1996年 | 46篇 |
1995年 | 48篇 |
1994年 | 32篇 |
1993年 | 28篇 |
1992年 | 30篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有7952条查询结果,搜索用时 15 毫秒
1.
Indoor surfaces may be adsorptive sinks with the potential to change Indoor Air Quality. To estimate this effect, the sorption parameters of formaldehyde and toluene were assessed on five floorings by an experimental method using solid-phase microextraction in an airtight emission cell. Adsorption rate constants ranged from 0.003 to 0.075 m·h−1, desorption rate constants from 0.019 to 0.51 h−1, and the partition coefficient from 0.005 to 3.9 m, and these parameters vary greatly from one volatile organic compound/material couple to another indicating contrasted sorption behaviors. A rubber was identified as a sink of formaldehyde characterized by a very low desorption constant close to 0. For these sorbent floorings identified, the adsorption rates of formaldehyde are from 2 to 4 times higher than those of toluene. Two models were used to evaluate the sink effects of floorings on indoor pollutant concentrations in one room from different realistic conditions. The scenarios tested came to the conclusion that the formaldehyde sorption on one rubber (identified as a sink) has a maximum contribution from 15% to 21% for the conditions of low air exchange rate. For other floorings, the sorption has a minor contribution less than or equal to 5%, regardless of the air exchange rate. 相似文献
2.
The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these. 相似文献
3.
现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变,不利于时态模式的快速挖掘和发现。为此,根据时态网络固有的特征提出自适应时间片划分方法(Adaptive Time Slice Partition method,ATSP)。在时态网络的两种表示方式(基于事件的表示方式和基于快照的表示方式)的基础上,构建了ATSP的基础模型,同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分,针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则,并提出了实现算法--层次划分算法(Hierarchical Partition algorithm,HP)和增量划分算法(Incremental Partition algorithm,IP)。实验结果表明,ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征,且该方法应用于可视化时,能有效归纳并展示网络的特征,明显提高了视觉分析的效率。 相似文献
4.
针对空空宽带高速通信的需求,设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能,并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能,其中粗跟踪误差为533.2 μrad(1σ),精跟踪误差为3.6 μrad(1σ),测试数据传输240 s,通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。 相似文献
5.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
6.
Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads
etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and
study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput
under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel
statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness
of service among users, hence reducing chances of buffer overflows for poorly located users.
The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time,
and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown
to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical
approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the
widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement.
Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users,
and the strongly recieved users at the base as “strong” users.
Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton,
NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs
in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management
and scheduling issues in telecommunication networks.
Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S.
from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University,
all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell
Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially
in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering. 相似文献
7.
Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology. 相似文献
8.
本文重点研究基于包错误率测量的链路自适应算法,分析了包错误率与信道参数的关系,提出了一种有别于固定门限值方案的优化门限值方案。仿真结果表明,优化门限值方案的网络吞吐量要大于固定门限值方案和基于信干比估计的链路自适应算法,最大增幅可达12Mbit/s。在系统引入重传机制后,网络吞吐量将有所损失,但最大不超过1Mbit/s,相比较服务质量的提高是值得的。需指出的是,虽然分析和仿真均以HIPERLAN/2为例,但不失一般性,它们同样适合于WPAN/WLAN等类似系统。 相似文献
9.
10.