全文获取类型
收费全文 | 8948篇 |
免费 | 1124篇 |
国内免费 | 346篇 |
专业分类
化学 | 754篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5486篇 |
物理学 | 2808篇 |
出版年
2024年 | 22篇 |
2023年 | 90篇 |
2022年 | 296篇 |
2021年 | 269篇 |
2020年 | 187篇 |
2019年 | 205篇 |
2018年 | 226篇 |
2017年 | 340篇 |
2016年 | 444篇 |
2015年 | 294篇 |
2014年 | 544篇 |
2013年 | 601篇 |
2012年 | 488篇 |
2011年 | 543篇 |
2010年 | 430篇 |
2009年 | 570篇 |
2008年 | 585篇 |
2007年 | 595篇 |
2006年 | 480篇 |
2005年 | 433篇 |
2004年 | 374篇 |
2003年 | 316篇 |
2002年 | 296篇 |
2001年 | 252篇 |
2000年 | 226篇 |
1999年 | 194篇 |
1998年 | 182篇 |
1997年 | 158篇 |
1996年 | 135篇 |
1995年 | 105篇 |
1994年 | 71篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 45篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
出了Heishenberg方程的保等时交换关系-辛格式,为Heishenberg图景下计算量子系统(特别是时间相关外场中的原子)的时间演化提供了保结构的算法,用这种算法计算了一个非线性谐振子,结果显示保等时交换关系-辛格式对求解Heishenberg方程是精确和有效的. 相似文献
992.
In this paper, we develop and analyze a simple algorithm for scheduling variable length messages in WDM networks with a passive star coupler. We base our schemes on a star topology with centralized control and use a scheduling algorithm similar to the process management in UNIX system. Every node and message have a scheduling priority associated with them. By comparing our algorithm with random select algorithm, we find that significant improvement in performance can be achieved with very little extra cost. 相似文献
993.
Walter Zulehner. 《Mathematics of Computation》2002,71(238):479-505
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cases the iteration matrix can be transformed to a symmetric matrix by block diagonal matrices, a simple but essential observation which allows one to estimate the convergence rate of both classes by studying associated eigenvalue problems. The obtained estimates apply for a wider range of situations and are partially sharper than the known estimates in literature. A few numerical tests are given which confirm the sharpness of the estimates.
994.
注水油田年综合含水率预测的数学模型 总被引:1,自引:0,他引:1
本文将改进的灰色GM(1,1)模型用于某油田年综合含水率的近期发展趋势研究。在平均相对误差达到最小准则下,研究了模型中的背景值参数A和边值修正项£对模型预测精度的影响。在此基础上,采用线性规划方法估计模型中的参数,基于遗传算法求解最佳背景值参数A和最佳边值修正项ε,以确保在相应的模型检验准则下预测的误差达到最小。结果表明,用改进的灰色GM(1,1)模型预测近期注水油田的综合含水率,预测值与实际值相对误差很小,预测精度很高,可以得到非常满意的结果。进一步的研究发现,改进的灰色GM(1,1)模型虽然近期预测精度很高,但研究长期的发展趋势是行不通的,为此又研究探讨了长期发展趋势模型。 相似文献
995.
996.
An asymptotic process for evaluating the frequencies of free axisymmetric vibrations of transversely isotropic hollow cylinders is proposed. This process is developed in detail for a cylinder with hinge-supported ends and free lateral surfaces. The approaches which make it possible to construct algorithms for identifying their natural frequencies within the given interval are tested on model problems. The results from the Kirchhoff-Love and Ambartsumyan theories are compared with those from the 3D elasticity theory. In the first term of an asymptotic expansion, two frequencies coinciding with those obtained using the applied shell theory are found and a countable set of frequencies absent in this theory is determined. 相似文献
997.
In this paper, we propose a Quasi-Orthogonal Matching Pursuit (QOMP) algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials. For the two kinds of sampled data, data with noises and without noises, we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct $s$-sparse Legendre polynomials, Chebyshev polynomials and trigonometric polynomials in $s$ step iterations. The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials. Finally, numerical experiments will be presented to verify the effectiveness of the QOMP method. 相似文献
998.
This paper concerns the convex optimal control problem governed by multiscale elliptic equations with arbitrarily rough $L^\infty$ coefficients, which has not only complex coupling between nonseparable scales and nonlinearity, but also important applications in composite materials and geophysics. We use one of the recently developed numerical homogenization techniques, the so-called Rough Polyharmonic Splines (RPS) and its generalization (GRPS) for the efficient resolution of the elliptic operator on the coarse scale. Those methods have optimal convergence rate which do not rely on the regularity of the coefficients nor the concepts of scale-separation or periodicity. As the iterative solution of the nonlinearly coupled OCP-OPT formulation for the optimal control problem requires solving the corresponding (state and co-state) multiscale elliptic equations many times with different right hand sides, numerical homogenization approach only requires one-time pre-computation on the fine scale and the following iterations can be done with computational cost proportional to coarse degrees of freedom. Numerical experiments are presented to validate the theoretical analysis. 相似文献
999.
Reconfigurable intelligent surface (RIS), a planar metasurface consisting of a large number of low-cost reflecting elements, has received much attention due to its ability to improve both the spectrum and energy efficiency (EE) by reconfiguring the wireless propagation environment. In this paper, we propose a base station (BS) beamforming and RIS phase shift optimization technique that maximizes the EE of a RIS-aided multiple-input–single-output system. In particular, considering the system circuits’ energy consumption, an EE maximization problem is formulated by jointly optimizing the active beamforming at the BS and the passive beamforming at the RIS, under the constraints of each user’ rate requirement, the BS’s maximal transmit power budget and unit-modulus constraint of the RIS phase shifts. Due to the coupling of optimization variables, this problem is a complex non-convex optimization problem, and it is challenging to solve it directly. To overcome this obstacle, we divide the problem into active and passive beamforming optimization subproblems. For the first subproblem, the active beamforming is given by the maximum ratio transmission optimal strategy. For the second subproblem, the optimal phase shift matrix at the RIS is obtained by exploiting sine cosine algorithm (SCA). Moreover, for this case where each reflection element’s working state is controlled by a circuit switch, each reflection element’s switch value is optimized with the aid of particle swarm optimization algorithm. Finally, numerical results verify the effectiveness of our proposed algorithm compared to other algorithms. 相似文献
1000.
Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput. 相似文献