全文获取类型
收费全文 | 85371篇 |
免费 | 15948篇 |
国内免费 | 11904篇 |
专业分类
电工技术 | 11136篇 |
技术理论 | 1篇 |
综合类 | 11278篇 |
化学工业 | 2318篇 |
金属工艺 | 1523篇 |
机械仪表 | 6294篇 |
建筑科学 | 1675篇 |
矿业工程 | 1157篇 |
能源动力 | 1618篇 |
轻工业 | 1809篇 |
水利工程 | 1266篇 |
石油天然气 | 966篇 |
武器工业 | 1507篇 |
无线电 | 16063篇 |
一般工业技术 | 5663篇 |
冶金工业 | 791篇 |
原子能技术 | 311篇 |
自动化技术 | 47847篇 |
出版年
2024年 | 731篇 |
2023年 | 1786篇 |
2022年 | 3110篇 |
2021年 | 3345篇 |
2020年 | 3750篇 |
2019年 | 3265篇 |
2018年 | 3146篇 |
2017年 | 3643篇 |
2016年 | 4055篇 |
2015年 | 4764篇 |
2014年 | 6090篇 |
2013年 | 6100篇 |
2012年 | 7333篇 |
2011年 | 7589篇 |
2010年 | 6131篇 |
2009年 | 6184篇 |
2008年 | 6459篇 |
2007年 | 6957篇 |
2006年 | 5592篇 |
2005年 | 4607篇 |
2004年 | 3703篇 |
2003年 | 2964篇 |
2002年 | 2230篇 |
2001年 | 1835篇 |
2000年 | 1584篇 |
1999年 | 1228篇 |
1998年 | 1008篇 |
1997年 | 825篇 |
1996年 | 657篇 |
1995年 | 477篇 |
1994年 | 395篇 |
1993年 | 340篇 |
1992年 | 310篇 |
1991年 | 175篇 |
1990年 | 206篇 |
1989年 | 140篇 |
1988年 | 96篇 |
1987年 | 44篇 |
1986年 | 48篇 |
1985年 | 42篇 |
1984年 | 56篇 |
1983年 | 41篇 |
1982年 | 37篇 |
1981年 | 23篇 |
1980年 | 32篇 |
1979年 | 15篇 |
1978年 | 17篇 |
1977年 | 13篇 |
1975年 | 10篇 |
1959年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Anis Zeglaoui Anouar Houmia Maher Mejai Radhouane Aloui 《International Journal of Adaptive Control and Signal Processing》2021,35(9):1842-1859
In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method. 相似文献
2.
针对现有混合入侵检测模型仅定性选取特征而导致检测精度较低的问题,同时为了充分结合误用检测模型和异常检测模型的优势,提出一种采用信息增益率的混合入侵检测模型.首先,利用信息增益率定量地选择特征子集,最大程度地保留样本信息;其次,采用余弦时变粒子群算法确定支持向量机参数构建误用检测模型,使其更好地平衡粒子在全局和局部的搜索能力,然后,选取灰狼算法确定单类支持向量机参数构建异常检测模型,以此来提高对最优参数的搜索效率和精细程度,综合提高混合入侵检测模型对攻击的检测效果;最后,通过两种数据集进行仿真实验,验证了所提混合入侵检测模型具有较好的检测性能. 相似文献
3.
稠油微生物开采技术现状及进展 总被引:2,自引:0,他引:2
综述了用微生物方法开采稠油的技术现状与进展,论题如下。①概述。②基本方法:异源微生物采油,包括微生物吞吐和微生物驱;本源微生物采油压大港孔店油田的实例。③主要机理,包括产表面活性剂,降解稠油中重质组分及其他。④技术研究,包括机理性、可行性及经济效益研究,列举了国内外6个实例。⑤现场应用,包括国外1个、国内6个实例。⑥该技术的优势及问题。参22。 相似文献
4.
马钢二烧结配料计算机控制系统 总被引:1,自引:0,他引:1
阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理;根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨;提供了系统的主要硬件结构,软件功能和程序框图。 相似文献
5.
Namyong Kim 《ETRI Journal》2006,28(2):155-161
In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance. 相似文献
6.
基于进化算法的常减压装置模拟 总被引:1,自引:0,他引:1
提出了基于优选优生进化算法(Select—best and prepotency evolution algorithm,SPEA)的常减压装置模拟方法。以各塔的温度分布为目标,基于生产过程和分析数据,采用SPEA确定各塔板Murphree效率,从而精确描述各塔板平衡偏离程度。在实际应用中,获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系,结果显示其取值为群体规模的10%最为合适。 相似文献
7.
8.
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. 相似文献
9.
论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。 相似文献
10.
在时变多径衰落信道下,接收到的CDMA信号功率变化较大,此时D-Rake盲自适应多用户检测器性能显著下降,将变步长LMS算法与基于主分量的相干合并引入到D-Rake(DecorrelatingRake)检测器中,构成一种变步长D-Rake,称之为VD-Rake(Variablestep-sizeDecorrelatingRake)检测器。该检测器能克服原D-Rake检测器对信号功率变化较敏感等缺点,有效地改善了D-Rake检测器的性能。 相似文献