全文获取类型
收费全文 | 976篇 |
免费 | 56篇 |
国内免费 | 39篇 |
专业分类
化学 | 108篇 |
晶体学 | 3篇 |
力学 | 45篇 |
综合类 | 20篇 |
数学 | 817篇 |
物理学 | 78篇 |
出版年
2023年 | 7篇 |
2022年 | 13篇 |
2021年 | 19篇 |
2020年 | 15篇 |
2019年 | 24篇 |
2018年 | 23篇 |
2017年 | 25篇 |
2016年 | 27篇 |
2015年 | 14篇 |
2014年 | 36篇 |
2013年 | 58篇 |
2012年 | 56篇 |
2011年 | 41篇 |
2010年 | 31篇 |
2009年 | 49篇 |
2008年 | 54篇 |
2007年 | 51篇 |
2006年 | 53篇 |
2005年 | 39篇 |
2004年 | 38篇 |
2003年 | 34篇 |
2002年 | 29篇 |
2001年 | 27篇 |
2000年 | 31篇 |
1999年 | 31篇 |
1998年 | 30篇 |
1997年 | 23篇 |
1996年 | 15篇 |
1995年 | 11篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 13篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 6篇 |
1988年 | 16篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 13篇 |
1976年 | 6篇 |
1974年 | 4篇 |
1957年 | 1篇 |
排序方式: 共有1071条查询结果,搜索用时 15 毫秒
1.
We analyse a model for equilibrium configurations of composite systems of nematic liquid crystal with polymer inclusions, in the presence of an external magnetic field. We assume that the system has a periodic structure, and consider the relaxed problem on the unit length constraint of the nematic director field. The relaxation of the Oseen–Frank energy functional is carried out by including bulk as well as surface energy penalty terms, rendering the problem fully non‐linear. We employ two‐scale convergence methods to obtain effective configurations of the system, as the size of the polymeric inclusions tends to zero. We discuss the minimizers of the effective energies for, both, the constrained as well as the unconstrained models. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
2.
New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values 总被引:1,自引:1,他引:0
N. A. Sokolov 《Computational Mathematics and Mathematical Physics》2007,47(12):1952-1969
New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately. 相似文献
3.
Empirical minimization 总被引:3,自引:0,他引:3
We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing
the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large
numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the
empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp.
The method of proof we use is based on Talagrand's concentration inequality for empirical processes.
Research partially supported by NSF under award DMS-0434393.
Research partially supported by the Australian Research Council Discovery Porject DP0343616. 相似文献
4.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
5.
A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two adjustable parameters. We will discuss the properties of the proposed filled function. Conditions on this function and on the values of parameters are given so that the constructed function has the desired properties of traditional filled function. 相似文献
6.
Hiroshi Konno 《Mathematical Programming》1988,41(1-3):185-193
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n
4
m) algorithm for this class of problems. 相似文献
7.
B. T. Sutcliffe 《Theoretical chemistry accounts》1974,33(3):201-214
It is shown that in the LCAO-MO-SCF problem, if the molecular orbital orthonormality constraints are introduced in the manner first suggested by Fletcher, then the Hessian of the problem is singular. It is suggested that this singularity may well account for the slow convergence observed using direct energy minimization methods to solve the SCF problem. Ways of avoiding the consequences of this singularity are discussed. 相似文献
8.
《Operations Research Letters》2022,50(1):50-56
We address a novel truck scheduling problem arising in crossdocking logistics, in which inbound trucks carry items (pallets) which must be sorted and loaded onto outbound trucks. We minimize the utilisation of the warehouse by focusing on the synchronisation between the different related trucks. The problem is to assign the trucks to the doors of the warehouse and sequence them, in order to minimize the total time spent in the system by the pallets. We discuss the complexity of the problem, showing that even with a single door the problem is NP-hard in general, and discuss some special cases. 相似文献
9.
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible. 相似文献
10.
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds 总被引:11,自引:0,他引:11
We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of many variables, subject to upper and/or lower bounds on some of the variables. This approach generatesstrictly feasible iterates by using a new affine scaling transformation and following piecewise linear paths (reflection paths). The interior-reflective approach does not require identification of an activity set. In this paper we establish that the interior-reflective Newton approach is globally and quadratically convergent. Moreover, we develop a specific example of interior-reflective Newton methods which can be used for large-scale and sparse problems.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under grant DE-FG02-86ER25013.A000, and in part by NSF, AFOSR, and ONR through grant DMS-8920550, and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center which receives major funding from the National Science Foundation and IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.Corresponding author. 相似文献