全文获取类型
收费全文 | 13683篇 |
免费 | 1459篇 |
国内免费 | 389篇 |
专业分类
化学 | 1321篇 |
晶体学 | 31篇 |
力学 | 1099篇 |
综合类 | 145篇 |
数学 | 6717篇 |
物理学 | 1521篇 |
无线电 | 4697篇 |
出版年
2024年 | 61篇 |
2023年 | 233篇 |
2022年 | 429篇 |
2021年 | 480篇 |
2020年 | 401篇 |
2019年 | 391篇 |
2018年 | 387篇 |
2017年 | 514篇 |
2016年 | 556篇 |
2015年 | 488篇 |
2014年 | 837篇 |
2013年 | 842篇 |
2012年 | 971篇 |
2011年 | 819篇 |
2010年 | 638篇 |
2009年 | 754篇 |
2008年 | 775篇 |
2007年 | 808篇 |
2006年 | 659篇 |
2005年 | 586篇 |
2004年 | 436篇 |
2003年 | 411篇 |
2002年 | 370篇 |
2001年 | 331篇 |
2000年 | 301篇 |
1999年 | 227篇 |
1998年 | 251篇 |
1997年 | 209篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 143篇 |
1993年 | 127篇 |
1992年 | 107篇 |
1991年 | 90篇 |
1990年 | 76篇 |
1989年 | 64篇 |
1988年 | 50篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 56篇 |
1984年 | 50篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
On Finite Element Approximations to a Shape Gradient Flow in Shape Optimization of Elliptic Problems
Chunxiao Liu & Shengfeng Zhu 《计算数学(英文版)》2023,41(5):957-980
Shape gradient flows are widely used in numerical shape optimization algorithms. We investigate the accuracy and effectiveness of approximate shape gradients flows for shape optimization of elliptic problems. We present convergence analysis with a priori error estimates for finite element approximations of shape gradient flows associated with a distributed or boundary expression of Eulerian derivative. Numerical examples are presented to verify theory and show that using the volume expression is effective for shape optimization with Dirichlet and Neumann boundary conditions. 相似文献
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.
Zvi Drezner 《Mathematical Programming》1987,38(2):219-222
We present an exchange algorithm for the solution of minimax optimization problems involving convex functions. For a certain
class of functions, the complexity of this algorithm is shown to be either linear in the number of functions, or at least
squared in that number. 相似文献
94.
A. Y. Lee 《Journal of Optimization Theory and Applications》1987,52(1):151-162
Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via the Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector . Three example problems with bounded terminal conditions are solved to verify this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC 2-106. 相似文献
95.
A problem very often arising in applications is presented: finding the minimal root of an equation with the objective function being multiextremal and nondifferentiable. Applications from the field of electronic measurements are given. Three methods based on global optimization ideas are introduced for solving this problem. The first one uses an a priori estimate of the global Lipschitz constant. The second method adaptively estimates the global Lipschitz constant. The third algorithm adaptively estimates local Lipschitz constants during the search. All the methods either find the minimal root or determine the global minimizers (in the case when the equation under consideration has no roots). Sufficient convergence conditions of the new methods to the desired solution are established. Numerical results including wide experiments with test functions, stability study, and a real-life applied problem are also presented. 相似文献
96.
A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization. 相似文献
97.
A stochastic global optimization method is applied to the challenging problem of finding the minimum energy conformation of a cluster of identical atoms interacting through the Lennard-Jones potential. The method proposed incorporates within an already existing and quite successful method, monotonic basin hopping, a two-phase local search procedure which is capable of significantly enlarging the basin of attraction of the global optimum. The experiments reported confirm the considerable advantages of this approach, in particular for all those cases which are considered in the literature as the most challenging ones, namely 75, 98, 102 atoms. While being capable of discovering all putative global optima in the range considered, the method proposed improves by more than two orders of magnitude the speed and the percentage of success in finding the global optima of clusters of 75, 98, 102 atoms. 相似文献
98.
钢管定购和运输的策略优化 总被引:2,自引:0,他引:2
安冉 《数学的实践与认识》2001,31(6):646-653
本文为图 1主管道和图 2树形管道的定购和运输计划给出了一个最优化模型 .通过解这一个最优化模型得到钢管的定购和运输的最优策略 .同时 ,分析了哪个钢厂钢管销价的变化对图 1主管道购运计划和总费用影响最大 ,哪个钢厂钢管产量的上限的变化对购运计划和总费用影响最大 相似文献
99.
Recently, Li and Chang proposed an approximate model for assortment problems. Although their model is quite promising to find approximately global solution, too many 0–1 variables are required in their solution process. This paper proposes another way for solving the same problem. The proposed method uses iteratively a technique of piecewise linearization of the quadratic objective function. Numerical examples demonstrate that the proposed method is computationally more efficient than the Li and Chang method. 相似文献
100.
Algorithms based on statistical models compete favorably with other global optimization algorithms as shown by extensive testing results. A theoretical inadequacy of previously used statistical models for smooth objective functions was eliminated by the authors who, in a recent paper, have constructed a P-algorithm for a statistical model for smooth functions. In the present paper, a modification of that P-algorithm with an improved convergence rate is described. 相似文献