全文获取类型
收费全文 | 6957篇 |
免费 | 663篇 |
国内免费 | 328篇 |
专业分类
电工技术 | 381篇 |
技术理论 | 3篇 |
综合类 | 503篇 |
化学工业 | 1206篇 |
金属工艺 | 350篇 |
机械仪表 | 460篇 |
建筑科学 | 554篇 |
矿业工程 | 249篇 |
能源动力 | 205篇 |
轻工业 | 460篇 |
水利工程 | 141篇 |
石油天然气 | 441篇 |
武器工业 | 57篇 |
无线电 | 681篇 |
一般工业技术 | 892篇 |
冶金工业 | 330篇 |
原子能技术 | 79篇 |
自动化技术 | 956篇 |
出版年
2024年 | 35篇 |
2023年 | 134篇 |
2022年 | 230篇 |
2021年 | 345篇 |
2020年 | 254篇 |
2019年 | 204篇 |
2018年 | 244篇 |
2017年 | 264篇 |
2016年 | 239篇 |
2015年 | 318篇 |
2014年 | 366篇 |
2013年 | 411篇 |
2012年 | 439篇 |
2011年 | 469篇 |
2010年 | 416篇 |
2009年 | 383篇 |
2008年 | 337篇 |
2007年 | 335篇 |
2006年 | 351篇 |
2005年 | 321篇 |
2004年 | 206篇 |
2003年 | 228篇 |
2002年 | 217篇 |
2001年 | 179篇 |
2000年 | 191篇 |
1999年 | 171篇 |
1998年 | 115篇 |
1997年 | 91篇 |
1996年 | 100篇 |
1995年 | 81篇 |
1994年 | 61篇 |
1993年 | 39篇 |
1992年 | 41篇 |
1991年 | 41篇 |
1990年 | 23篇 |
1989年 | 20篇 |
1988年 | 15篇 |
1987年 | 12篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1975年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有7948条查询结果,搜索用时 15 毫秒
131.
132.
HT模型矢量生成的硬件电路设计与实现 总被引:1,自引:0,他引:1
为提高高速互连电路中串扰的测试速率,减少IC测试人员的分析和研究时间,降低测试成本;在对半跳变(Half transition,HT)模型进行深入研究的基础上,得出HT模型矢量跳变的规律,并依此设计了HT模型矢量生成电路;该设计采用Verilog HDL语言对HT故障模型矢量进行RTL级建模,在Cyclonell器件(EP2C8T144C8)完成了电路实现,并用安捷伦逻辑分析采集实验数据进行实际验证;仿真和验证表明,该设计有效地生成多互连线系统HT模型测试矢量,适用于串扰故障的测试分析和研究. 相似文献
133.
基于函数正交基展开的过程神经元网络训练,由于参数较多BP算法不易收敛。针对这一问题,本文提出了一种基于双链量子遗传算法的解决方案。首先按权值参数的个数确定染色体上的基因数,完成种群编码,然后通过染色体评估获得当前最优染色体,以该染色体为目标,用量子旋转门完成种群中个体的更新,用量子非门实现个体变异增加种群多样性。在该方法中,每条染色体携带两条基因链,因此可扩展对解空间的遍历性,加速优化进程。以两组二维三角函数的模式分类问题为例,仿真结果表明该方法不仅收敛速度快,而且寻优能力强。 相似文献
134.
In many real-world applications of evolutionary algorithms, the fitness of an individual requires a quantitative measure. This paper proposes a self-adaptive linear evolutionary algorithm (ALEA) in which we introduce a novel strategy for evaluating individual’s relative strengths and weaknesses. Based on this strategy, searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify ‘good’ individuals of the performance for a multiobjective optimization application, regardless of original space complexity. This is considered as our main contribution. In addition, the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase, namely, crossover and mutation. Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective, and provides good performance in terms of uniformity and diversity of solutions. 相似文献
135.
无论是普适计算还是物联网,实时定位均是其关键技术之一。在建筑物、洞室等复杂环境中,由于无线信号的不规则衰减、非视距传播,使得常用的一些定位算法(如接收信号强度、到达角度等)无法达到较高的定位精度。为了解决复杂环境中定位精度不足的问题,设计并实现了一个定位精度改进中间件。它集成了平滑、传感器融合、卡尔曼滤波、粒子滤波等多种精度改进策略,可以根据用户对定位精度的需求动态地选择相应的策略。通过实验分析了不同精度改进策略的性能,结果表明,该中间件能够较好地满足用户对不同精度的需求。 相似文献
136.
137.
138.
With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowadays and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a destination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data. 相似文献
139.
Travel planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of discovering probabilistic nearest neighbors and planning the corresponding travel routes in traffic-aware spatial networks (TANN queries) to avoid potential time delay/traffic congestions. We propose and study four novel probabilistic TANN queries. Thereinto two queries target at minimizing the travel time, including a congestion-probability threshold query, and a time-delay threshold query, while another two travel-time threshold queries target at minimizing the potential time delay/traffic congestion. We believe that TANN queries are useful in many real applications, such as discovering nearby points of interest and planning convenient travel routes for users, and location based services in general. The TANN queries are challenged by two difficulties: (1) how to define probabilistic metrics for nearest neighbor queries in traffic-aware spatial networks, and (2) how to process these TANN queries efficiently under different query settings. To overcome these challenges, we define a series of new probabilistic metrics and develop four efficient algorithms to compute the TANN queries. The performances of TANN queries are verified by extensive experiments on real and synthetic spatial data. 相似文献
140.
Quantum cryptography is believed to be unconditionally secure because its security is ensured by physical laws rather than computational complexity. According to spectrum characteristic, quantum information can be classified into two categories, namely discrete variables and continuous variables. Continuous-variable quantum protocols have gained much attention for their ability to transmit more information with lower cost. To verify the identities of different data sources in a quantum network, we propose a continuous-variable quantum homomorphic signature scheme. It is based on continuous-variable entanglement swapping and provides additive and subtractive homomorphism. Security analysis shows the proposed scheme is secure against replay, forgery and repudiation. Even under nonideal conditions, it supports effective verification within a certain verification threshold. 相似文献