全文获取类型
收费全文 | 760篇 |
免费 | 79篇 |
国内免费 | 33篇 |
专业分类
电工技术 | 64篇 |
综合类 | 30篇 |
化学工业 | 86篇 |
金属工艺 | 60篇 |
机械仪表 | 43篇 |
建筑科学 | 75篇 |
矿业工程 | 23篇 |
能源动力 | 23篇 |
轻工业 | 37篇 |
水利工程 | 19篇 |
石油天然气 | 20篇 |
武器工业 | 3篇 |
无线电 | 155篇 |
一般工业技术 | 69篇 |
冶金工业 | 36篇 |
原子能技术 | 28篇 |
自动化技术 | 101篇 |
出版年
2024年 | 6篇 |
2023年 | 18篇 |
2022年 | 30篇 |
2021年 | 32篇 |
2020年 | 38篇 |
2019年 | 25篇 |
2018年 | 22篇 |
2017年 | 31篇 |
2016年 | 34篇 |
2015年 | 47篇 |
2014年 | 37篇 |
2013年 | 46篇 |
2012年 | 48篇 |
2011年 | 61篇 |
2010年 | 42篇 |
2009年 | 44篇 |
2008年 | 23篇 |
2007年 | 30篇 |
2006年 | 36篇 |
2005年 | 27篇 |
2004年 | 26篇 |
2003年 | 19篇 |
2002年 | 16篇 |
2001年 | 25篇 |
2000年 | 17篇 |
1999年 | 15篇 |
1998年 | 8篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1980年 | 2篇 |
排序方式: 共有872条查询结果,搜索用时 15 毫秒
191.
针对单源数据经验模型估算精度较低等问题,提出采用最小二乘法联合光学和雷达遥感数据构建联合估算模型,以中国科学院河北怀来遥感综合实验站为研究区,以夏季玉米为研究对象,利用Landsat8和Radarsat2影像实现研究区叶面积指数估算:首先分别建立了多光谱数据和雷达数据与实测叶面积指数之间的回归模型,然后利用最小二乘算法联合不同数据间的回归模型构建估算模型,最后利用迭代法估算叶面积指数并通过验证数据对估算结果进行评价分析,同时与单源数据经验模型、多源数据加权平均模型和基于物理模型查找表估算结果进行对比。通过对研究区59个样本点数据分析表明:基于最小二乘算法联合光学与雷达遥感数据能够提高叶面积指数的估算精度(R2=0.5442,RMSE=0.81),优于单源遥感数据拟合经验模型(DVI经验模型:(R2=0.485,RMSE=1.27))、基于权重的光学微波联合模型(R2=0.447,RMSE=1.36)和物理模型查找表法(R2=0.333,RMSE=1.36),并当叶面积指数大于3时,对其由于信息饱和或误差引起的低估或高估现象具有一定的抑制作用。 相似文献
192.
由于利用不分光红外吸收法(NDIR)的多组分气体传感器对汽车尾气(主要成分为CO2、CO、HC化合物)进行同时测量时,所测气体浓度是交叉吸收干扰后的结果,造成测量误差大,分析精度低。针对此问题,将遗传算法优化的小波神经网络用于建立基于红外光谱的三组分气体定量分析模型中。采集CO2、CO、HC的浓度信号,作为模型输入,通过模型回归分析,得到对应的混合气体组分浓度,解决气体之间相互干扰的问题。最后通过实验数据对模型性能进行仿真分析,结果表明,该模型的平均误差相比于传统模型明显减低,取得较好的精度。 相似文献
193.
针对利用不分光红外吸收法(NDIR)的多组分气体传感器对汽车尾气进行同时测量时,红外光谱特征吸收谱线重叠较为严重,所测气体浓度是交叉吸收干扰后的结果,造成测量误差大,分析精度低的问题,提出了一种自适应变异粒子群算法的混合核ε-SVM方法,建立三组分混合气体定量分析模型,已消除混合气体之间相互干扰产生的误差问题。实验中,采集CO2、CO、C3H8的浓度信号,作为模型输入,通过模型回归分析,得到对应的混合气体组分浓度,通过实验数据对模型性能进行分析,结果表明,该模型的平均误差相比于传统模型明显减低,取得较好的精度。 相似文献
194.
Optical network virtualization enables multiple virtual optical networks constructed for different infrastructure users(renters) or applications to coexist over a physical infrastructure. Virtual optical network(VON) mapping algorithm is used to allocate necessary resources in the physical infrastructure to the VON requests(VRs). In this paper, we investigate the opaque VON mapping problems in elastic optical networks(EONs). Based on the concept of available spectrum adjacency(AvS A) on links or paths, we consider both node resource and AvS A on links for node mapping, and present a link mapping method which chooses the routing and spectrum plan whose AvS A on paths is the largest among all the candidates. Finally, the overall VON mapping algorithm(i.e., AvS A-opaque VON mapping, AvS A-OVONM) coordinated node and link mapping is proposed. Extensive simulations are conducted and the results show that AvS A-OVONM has better performance of blocking probability and revenue-to-cost ratio than current algorithms. 相似文献
195.
Yuefeng Ji Jiawei Zhang Yongli Zhao Xiaosong Yu Jie Zhang Xue Chen 《中国科学:信息科学(英文版)》2016,59(10):101301
Research into all optical network (AON) technology has been ongoing over the past decade, and new features are constantly being developed. The advantages of AON include large-bandwidth provisioning, lowlatency transmission and low energy consumption. The basic concept underlying AON is transmission of data signals entirely through the optical domain from source to destination nodes, with no optical-electrical-optical (O-E-O) conversion at intermediate nodes. The technologies used to implement AON have undergone a series of evolutions, which encompass time division multiplexing (TDM), frequency division multiplexing (FDM), and space division multiplexing (SDM). Multi-dimensional AON (MD-AON), which leads the trend of AON’s future architecture, provides a vibrant state for emerging applications such as cloud computing and Internet of Things (IoT). In this article, we review the evolution of AON architectures based on the different all optical switching and multiplexing technologies (i.e., TDM, FDM, and SDM), which is one of the main areas of focus in this article. The other main area is detailed discussion of implementations such as data plane and control plane technologies as well as resource optimization technologies for realizing AON. We also introduce several AON testbeds with their compositions and functions, and some potential application scenarios that can be implemented based on these testbeds 相似文献
196.
Tao Yang Wentao Liu Xue Chen Erkun Sun Huitao Wang Taili Wang Min Zhang Jie Zhang Yuefeng Ji 《中国科学:信息科学(英文版)》2017,60(2):022305
We demonstrate a novel modulation format independent algorithm for adaptive blind polarization demultiplexing for elastic optical networks (EONs). We compare the proposed algorithm with traditional constant modulus algorithm (CMA) and radius-directed algorithm (RDA), in terms of performance in PM-QPSK, PM-16QAM and PM-64QAM coherent system, by simulating in back-to-back (BTB) and transmission sceneries. The simulation result shows that the modulation format independent algorithm can achieve universal adaptive blind polarization demultiplexing for PM-mQAM signals and gain slightly better performance in condition of lower optical signal noise ratio (OSNR). Furthermore, we also carry out experiments to investigate the performance of the proposed algorithm in BTB and 800 km transmission scenarios for 16 GBaud PM-QPSK and PM-16QAM. The experimental results demonstrate the conclusion of the numerical simulations. 相似文献
197.
198.
199.
V形尾翼无人机喷流对气动力特性干扰的数值模拟 总被引:1,自引:0,他引:1
全球鹰外形的无人机,其V形尾翼位于发动机喷管两侧,发动机的高温、高速喷流对尾翼和飞机的气动干扰影响很大。文章通过数值模拟分析了V形尾翼与发动机喷流的相互干扰作用,给出了全球鹰外形无人机在不同高度、马赫数以及相应的发动机工作状态下的气动力特性,定量对比不带发动机喷流和带有喷流的计算结果,得出了发动机喷流对尾翼及全机的气动影响,可作为无人机V型尾翼和发动机气动布局设计的参考。 相似文献
200.
In telecommunications networks, to enable a valid data transmission based on network coding, any intermediate node within a given network is allowed, if necessary, to perform coding operations. The more coding operations needed, the more coding resources consumed and thus the more computational overhead and transmission delay incurred. This paper investigates an efficient evolutionary algorithm to minimize the amount of coding operations required in network coding based multicast. Based on genetic algorithms, we adapt two extensions in the proposed evolutionary algorithm, namely a new crossover operator and a neighbourhood search operator, to effectively solve the highly complex problem being concerned. The new crossover is based on logic OR operations to each pair of selected parent individuals, and the resulting offspring are more likely to become feasible. The aim of this operator is to intensify the search in regions with plenty of feasible individuals. The neighbourhood search consists of two moves which are based on greedy link removal and path reconstruction, respectively. Due to the specific problem feature, it is possible that each feasible individual corresponds to a number of, rather than a single, valid network coding based routing subgraphs. The neighbourhood search is applied to each feasible individual to find a better routing subgraph that consumes less coding resource. This operator not only improves solution quality but also accelerates the convergence. Experiments have been carried out on a number of fixed and randomly generated benchmark networks. The results demonstrate that with the two extensions, our evolutionary algorithm is effective and outperforms a number of state-of-the-art algorithms in terms of the ability of finding optimal solutions. 相似文献