全文获取类型
收费全文 | 19378篇 |
免费 | 2623篇 |
国内免费 | 543篇 |
专业分类
化学 | 754篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5486篇 |
物理学 | 2808篇 |
无线电 | 12126篇 |
出版年
2024年 | 74篇 |
2023年 | 253篇 |
2022年 | 441篇 |
2021年 | 520篇 |
2020年 | 517篇 |
2019年 | 446篇 |
2018年 | 460篇 |
2017年 | 657篇 |
2016年 | 871篇 |
2015年 | 886篇 |
2014年 | 1422篇 |
2013年 | 1331篇 |
2012年 | 1363篇 |
2011年 | 1489篇 |
2010年 | 1032篇 |
2009年 | 1175篇 |
2008年 | 1305篇 |
2007年 | 1358篇 |
2006年 | 1140篇 |
2005年 | 947篇 |
2004年 | 798篇 |
2003年 | 696篇 |
2002年 | 601篇 |
2001年 | 465篇 |
2000年 | 419篇 |
1999年 | 310篇 |
1998年 | 294篇 |
1997年 | 243篇 |
1996年 | 216篇 |
1995年 | 149篇 |
1994年 | 103篇 |
1993年 | 113篇 |
1992年 | 98篇 |
1991年 | 43篇 |
1990年 | 55篇 |
1989年 | 34篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
92.
Nonlinear two-point boundary-value problems (TPBVP) can be reduced to the iterative solution of a sequence of linear problems by means of quasilinearization techniques. Therefore, the efficient solution of linear problems is the key to the efficient solution of nonlinear problems.Among the techniques available for solving linear two-point boundary-value problems, the method of particular solutions (MPS) is particularly attractive in that it employs only one differential system, the original nonhomogeneous system, albeit with different initial conditions. This feature of MPS makes it ideally suitable for implementation on parallel computers in that the following requirements are met: the computational effort is subdivided into separate tasks (particular solutions) assigned to the different processors; the tasks have nearly the same size; there is little intercommunication between the tasks.For the TPBVP, the speedup achievable is ofO(n), wheren is the dimension of the state vector, hence relatively modest for the differential systems of interest in trajectory optimization and guidance. This being the case, we transform the TPBVP into a multi-point boundary-value problem (MPBVP) involvingm time subintervals, withm–1 continuity conditions imposed at the interface of contiguous subintervals. For the MPBVP, the speedup achievable is ofO(mn), hence substantially higher than that achievable for the TPBVP. It reduces toO(m) if the parallelism is implemented only in the time domain and not in the state domain.A drawback of the multi-point approach is that it requires the solution of a large linear algebraic system for the constants of the particular solutions. This drawback can be offset by exploiting the particular nature of the interface conditions: if the vector of constants for the first subinterval is known, the vector of constants for the subsequent subintervals can be obtained with linear transformations. Using decomposition techniques together with the discrete version of MPS, the size of the linear algebraic system for the multi-point case becomes the same as that for the two-point case.Numerical tests on the Intel iPSC/860 computer show that substantial speedup can be achieved via parallel algorithms vis-a-vis sequential algorithms. Therefore, the present technique has considerable interest for real-time trajectory optimization and guidance.Dedicated to the Memory of Professor Jan M. SkowronskiThis paper, based on Refs. 1–3, is a much condensed version of the material contained in these references.The technical assistance of the Research Center on Parallel Computation of Rice University, Houston, Texas is gratefully acknowledged. 相似文献
93.
The condition of detailed balance has long been used as a proxy for the more difficult-to-prove condition of total balance, which along with ergodicity is required to guarantee convergence of a Markov Chain Monte Carlo (MCMC) simulation to the correct probability distribution. However, some simple-to-program update schemes such as the sequential and checkerboard Metropolis algorithms are known not to satisfy detailed balance for such common systems as the Ising model. 相似文献
94.
Florian A. Potra 《Mathematical Programming》2001,91(1):99-115
Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by primal-dual interior-point methods
for linear complementarity problems. It is shown that those conditions are satisfied by several well known interior-point
methods. In particular it is shown that the iteration sequences produced by the simplified predictor–corrector method of Gonzaga
and Tapia, the simplified largest step method of Gonzaga and Bonnans, the LPF+ algorithm of Wright, the higher order methods
of Wright and Zhang, Potra and Sheng, and Stoer, Wechs and Mizuno are Q-superlinearly convergent.
Received: February 9, 2000 / Accepted: February 20, 2001?Published online May 3, 2001 相似文献
95.
Hufenbach W. Gude M. Kroll L. Sokolowski A. Werdermann B. 《Mechanics of Composite Materials》2001,37(1):71-78
During the manufacturing process of multilayered fiber-reinforced composites with variable fiber orientations, residual stresses build up in these composites due to the directional expansion of single unidirectionally reinforced layers. Depending on the laminate lay-up, the inhomogeneous residual stresses, which are caused by thermal effects, moisture absorption, and chemical shrinkage, can lead to large multistable out-of-plane deformations. Instead of avoiding these curvatures, they can be advantageously used for technical applications following the near-net-shape technology. In order to adjust the deformations to the technical requirements, genetic algorithms in combination with a nonlinear calculation method have been developed, which can purposefully adapt the laminate lay-up depending on the loading and process parameters. 相似文献
96.
Yu Chen 《Advances in Computational Mathematics》2002,16(2-3):175-190
The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m
3 log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m
3), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m
2 log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m
3 log(m)) flops. 相似文献
97.
针对红外焦平面对辐射强度较大的目标输出动态范围不足的问题,提出了一种场景自适应的红外焦平面成像动态范围调整技术。包括3个方面的内容:从图像中提取目标灰度特征,获取动态范围自适应依据;结合最小均方自适应滤波算法,对调整依据进行滤波预测后给出调节值;把灰度调节值转换成电平值,利用电平值设置红外焦平面偏置电压完成焦平面成像动态范围自适应。最后,对整体方案进行了实验验证。通过在红外焦平面成像系统中实验证明了基于场景成像动态范围自适应方法的可行性,并获得了很好的效果,成像质量有明显提高。 相似文献
98.
本文利用二分演化思想和矩阵分解技术 ,重点讨论逆Walsh序三值Walsh变换的演化生成和快速算法 ,并将之推广至p值情形 . 相似文献
99.
Nguyen V. Thoai 《Journal of Global Optimization》2000,18(4):321-336
The problem of optimizing some contiuous function over the efficient set of a multiple objective programming problem can be formulated as a nonconvex global optimization problem with special structure. Based on the conical branch and bound algorithm in global optimization, we establish an algorithm for optimizing over efficient sets and discuss about the implementation of this algorithm for some interesting special cases including the case of biobjective programming problems. 相似文献
100.
In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construct delivery routes from the selected depot or depots to the remaining sites at least system cost. The objective function is the sum of depot operating costs, vehicle acquisition costs and routing costs. This paper considers one such problem in which a weight is assigned to each site and where sites are to be visited by vehicles having a given capacity. The solution must be such that the sum of the weights of sites visited on any given route does not exceed the capacity of the visiting vehicle. The formulation of an integer linear program for this problem involves degree constraints, generalized subtour elimination constraints, and chain barring constraints. An exact algorithm, using initial relaxation of most of the problem constraints, is presented which is capable of solving problems with up to twenty sites within a reasonable number of iterations. 相似文献