全文获取类型
收费全文 | 13823篇 |
免费 | 1497篇 |
国内免费 | 385篇 |
专业分类
化学 | 1456篇 |
晶体学 | 32篇 |
力学 | 1081篇 |
综合类 | 148篇 |
数学 | 6929篇 |
物理学 | 1509篇 |
无线电 | 4550篇 |
出版年
2024年 | 40篇 |
2023年 | 201篇 |
2022年 | 350篇 |
2021年 | 463篇 |
2020年 | 372篇 |
2019年 | 363篇 |
2018年 | 356篇 |
2017年 | 499篇 |
2016年 | 539篇 |
2015年 | 478篇 |
2014年 | 862篇 |
2013年 | 851篇 |
2012年 | 964篇 |
2011年 | 858篇 |
2010年 | 656篇 |
2009年 | 827篇 |
2008年 | 844篇 |
2007年 | 856篇 |
2006年 | 722篇 |
2005年 | 614篇 |
2004年 | 458篇 |
2003年 | 446篇 |
2002年 | 383篇 |
2001年 | 337篇 |
2000年 | 306篇 |
1999年 | 230篇 |
1998年 | 248篇 |
1997年 | 216篇 |
1996年 | 154篇 |
1995年 | 171篇 |
1994年 | 144篇 |
1993年 | 127篇 |
1992年 | 108篇 |
1991年 | 93篇 |
1990年 | 79篇 |
1989年 | 63篇 |
1988年 | 49篇 |
1987年 | 40篇 |
1986年 | 39篇 |
1985年 | 56篇 |
1984年 | 50篇 |
1983年 | 15篇 |
1982年 | 23篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 921 毫秒
11.
CDMA系统的网络优化 总被引:1,自引:0,他引:1
CDMA技术已经成为下一代移动通信的主流技术,CDMA网络的建设也初具规模。移动网络的优化则是实际运营过程中的一个重要环节。文中试图反映CDMA网络优化的一般原理,阐述了CDMA网络优化时需要考虑的几个主要问题,介绍了优化时需要调整的一些关键参数。 相似文献
12.
高速贴片机优化软件的设计与开发 总被引:9,自引:4,他引:5
SMT生产线要达到最大的产量,必须要考虑生产线的效率。贴片机是SMT生产线中的关键设备,因此提高贴片机的生产效率具有十分重要的意义。本文以松下贴片机为例,介绍了贴片机程序优化软件的设计与开发中的思想、方法和经验,希望对从事CAM软件研究的工程人员有一定帮助。 相似文献
13.
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. 相似文献
14.
Ji-Ming Peng 《Mathematical Programming》1997,78(3):347-355
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions,
the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit
functions and give conditions under which the stationary points of these functions are the solutions of VI.
This work was supported by the state key project “Scientific and Engineering Computing”. 相似文献
15.
16.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
17.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
18.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
19.
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. 相似文献
20.