全文获取类型
收费全文 | 15868篇 |
免费 | 1634篇 |
国内免费 | 628篇 |
专业分类
化学 | 1332篇 |
晶体学 | 31篇 |
力学 | 1165篇 |
综合类 | 190篇 |
数学 | 9005篇 |
物理学 | 1610篇 |
无线电 | 4797篇 |
出版年
2024年 | 62篇 |
2023年 | 247篇 |
2022年 | 441篇 |
2021年 | 505篇 |
2020年 | 430篇 |
2019年 | 434篇 |
2018年 | 424篇 |
2017年 | 572篇 |
2016年 | 620篇 |
2015年 | 542篇 |
2014年 | 924篇 |
2013年 | 958篇 |
2012年 | 1077篇 |
2011年 | 904篇 |
2010年 | 719篇 |
2009年 | 877篇 |
2008年 | 899篇 |
2007年 | 957篇 |
2006年 | 804篇 |
2005年 | 704篇 |
2004年 | 559篇 |
2003年 | 518篇 |
2002年 | 467篇 |
2001年 | 419篇 |
2000年 | 424篇 |
1999年 | 308篇 |
1998年 | 337篇 |
1997年 | 303篇 |
1996年 | 199篇 |
1995年 | 209篇 |
1994年 | 175篇 |
1993年 | 157篇 |
1992年 | 129篇 |
1991年 | 110篇 |
1990年 | 96篇 |
1989年 | 72篇 |
1988年 | 63篇 |
1987年 | 51篇 |
1986年 | 41篇 |
1985年 | 68篇 |
1984年 | 62篇 |
1983年 | 19篇 |
1982年 | 32篇 |
1981年 | 30篇 |
1980年 | 25篇 |
1979年 | 40篇 |
1978年 | 30篇 |
1977年 | 36篇 |
1976年 | 21篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
我国的军工科研所成立于上世纪,它以军工项目的科研、预研为主,为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长,军工科研院所也转变了原有的工业专属性质,走上了军民两用、寓军于民的道路,并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点,以项目管理的优化为具体策略进行军工科研开发工作。 相似文献
3.
在介绍宽带无线移动发展趋势所采用的新技术的基础上,论述了宽带无线移动通信网络优化及相关发展策略的一些问题。 相似文献
4.
Ying Tan 《The Journal of VLSI Signal Processing》2002,32(1-2):45-54
In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications. 相似文献
5.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
6.
7.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
8.
Stefan Nörtemann 《Applied Categorical Structures》2002,10(4):417-429
The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C
0 of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved. 相似文献
9.
10.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献