全文获取类型
收费全文 | 154743篇 |
免费 | 18057篇 |
国内免费 | 12195篇 |
专业分类
电工技术 | 14018篇 |
综合类 | 17425篇 |
化学工业 | 18561篇 |
金属工艺 | 10908篇 |
机械仪表 | 11260篇 |
建筑科学 | 11757篇 |
矿业工程 | 7021篇 |
能源动力 | 3854篇 |
轻工业 | 19092篇 |
水利工程 | 5069篇 |
石油天然气 | 5599篇 |
武器工业 | 2505篇 |
无线电 | 15632篇 |
一般工业技术 | 12193篇 |
冶金工业 | 6289篇 |
原子能技术 | 2660篇 |
自动化技术 | 21152篇 |
出版年
2024年 | 1041篇 |
2023年 | 2616篇 |
2022年 | 6349篇 |
2021年 | 8047篇 |
2020年 | 5935篇 |
2019年 | 3859篇 |
2018年 | 4227篇 |
2017年 | 5200篇 |
2016年 | 4354篇 |
2015年 | 7214篇 |
2014年 | 9012篇 |
2013年 | 10338篇 |
2012年 | 12829篇 |
2011年 | 13408篇 |
2010年 | 12848篇 |
2009年 | 12496篇 |
2008年 | 12750篇 |
2007年 | 12066篇 |
2006年 | 10353篇 |
2005年 | 8234篇 |
2004年 | 6080篇 |
2003年 | 3967篇 |
2002年 | 3670篇 |
2001年 | 3296篇 |
2000年 | 2650篇 |
1999年 | 835篇 |
1998年 | 214篇 |
1997年 | 153篇 |
1996年 | 116篇 |
1995年 | 102篇 |
1994年 | 84篇 |
1993年 | 87篇 |
1992年 | 65篇 |
1991年 | 53篇 |
1990年 | 70篇 |
1989年 | 62篇 |
1988年 | 35篇 |
1987年 | 38篇 |
1986年 | 28篇 |
1985年 | 17篇 |
1984年 | 18篇 |
1983年 | 20篇 |
1982年 | 12篇 |
1981年 | 22篇 |
1980年 | 39篇 |
1979年 | 30篇 |
1959年 | 27篇 |
1951年 | 29篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
972.
Joint bandwidth and power allocation for a multi-radio access(MRA)system in a heterogeneous wireless access environment is studied.Since both the number of users being served by the system and the wireless channel state are time-varying,the optimal resource allocation is no longer a static optimum and will change with the varying network state.Moreover,distributed resource allocation algorithms that require iterative updating and signaling interactions cannot converge in negligible time.Thus,it is unrealistic to assume that the active user number and the wireless channel state remain unchanged during the iterations.In this paper,we propose an adaptive joint bandwidth and power allocation algorithm based on a novel iteration stepsize selection method,which can adapt to the varying network state and accelerate the convergence rate.A distributed solution is also designed for the adaptive joint resource allocation implementation.Numerical results show that the proposed algorithm can not only track the varying optimal resource allocation result much more quickly than a traditional algorithm with fixed iteration stepsize,but can also reduce the data transmission time for users and increase the system throughput. 相似文献
973.
The model for improving the robustness of sparse principal component analysis(PCA) is proposed in this paper. Instead of the l2-norm variance utilized in the conventional sparse PCA model,the proposed model maximizes the l1-norm variance,which is less sensitive to noise and outlier. To ensure sparsity,lp-norm(0 p 1) constraint,which is more general and effective than l1-norm,is considered. A simple yet efficient algorithm is developed against the proposed model. The complexity of the algorithm approximately linearly increases with both of the size and the dimensionality of the given data,which is comparable to or better than the current sparse PCA methods. The proposed algorithm is also proved to converge to a reasonable local optimum of the model. The efficiency and robustness of the algorithm is verified by a series of experiments on both synthetic and digit number image data. 相似文献
975.
976.
In this paper we propose Hoare style proof systems called PRD^0and PRKWD^0 for plan generation and plan verification under 0-approximation semantics of the action language AK.In PRD^0 (resp.PRKW0D),a Hoare triple of the form{X}c{Y}(resp.{X}c{KWp})means that all literals in Y become true(resp.p becomes known)after executing plan c in a state satisfying all literals in X.The proof systems are shown to be sound and complete,and more importantly,they give a way to efficiently generate and verify longer plans from existing verified shorter plans by applying so-called composition rule,provided that an enough number of shorter plans have been properly stored.The idea behind is a tradeoff between space and time,we refer it to off-line planning and point out that it could be applied to general planning problems. 相似文献
977.
978.
979.
980.
气固错流移动颗粒床过滤器压降特性研究 总被引:3,自引:0,他引:3
研究了错流移动颗粒床过滤器操作压降与过滤介质特性、表现过滤气速、颗粒层移动速度和床层粉尘沉积量之间的关系。结果表明,无粉尘沉积时,床层压降可以用Ergun方程计算。颗粒层移动速度的变化并不会造成床层压降的显著变化。除尘过程中,床层内粉尘沉积量随气体中粉尘浓度的增大、颗粒层移动速度的减小而增加,同时将导致床层压降的显著增大。错流移动床除尘操作压降可以用带修正项的Ergun方程计算,其修正项为比沉积率和颗粒层空欧率的函数。在实验数据范围内,该方程的计算结果与实验数据最大偏差小于15%。 相似文献