全文获取类型
收费全文 | 1487篇 |
免费 | 86篇 |
国内免费 | 32篇 |
专业分类
化学 | 66篇 |
晶体学 | 1篇 |
力学 | 137篇 |
综合类 | 11篇 |
数学 | 1229篇 |
物理学 | 161篇 |
出版年
2023年 | 16篇 |
2022年 | 19篇 |
2021年 | 24篇 |
2020年 | 23篇 |
2019年 | 23篇 |
2018年 | 21篇 |
2017年 | 31篇 |
2016年 | 30篇 |
2015年 | 36篇 |
2014年 | 62篇 |
2013年 | 99篇 |
2012年 | 82篇 |
2011年 | 51篇 |
2010年 | 50篇 |
2009年 | 76篇 |
2008年 | 83篇 |
2007年 | 98篇 |
2006年 | 87篇 |
2005年 | 58篇 |
2004年 | 57篇 |
2003年 | 52篇 |
2002年 | 52篇 |
2001年 | 46篇 |
2000年 | 34篇 |
1999年 | 47篇 |
1998年 | 34篇 |
1997年 | 35篇 |
1996年 | 25篇 |
1995年 | 26篇 |
1994年 | 26篇 |
1993年 | 19篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 19篇 |
1985年 | 15篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 13篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1974年 | 5篇 |
1973年 | 1篇 |
排序方式: 共有1605条查询结果,搜索用时 93 毫秒
21.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
22.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
23.
The asymptotic null distribution of the likelihood ratio test for two cases of ordered hypotheses in a particular genetic model is considered. A simple iterative process is proposed in order to get the restricted estimates. It is shown that both tests have asymptotically a chi-bar squared distribution and the same size. A simulation study is also conducted in order to compare the usual unrestricted test with the corresponding one of ordered hypotheses. Finally, the results are extended to some special cases. 相似文献
24.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献
25.
Thomas Aronsson 《Natural Resource Modeling》1992,6(1):51-70
This paper deals with the theory and estimation of the short-run supply of roundwood under nonlinear (progressive) income taxation. The theoretical part of the paper uses the two-period consumption harvesting model to introduce nonlinear income taxes into the forest management problem and presents a simple method to determine the optimal supply of roundwood in this case. In the empirical part of the paper, the model is specified in a way suitable for econometric analysis. The estimation method is the maximum likelihood method, and the estimation results seem to support the theoretical model. Finally, some results from model simulation imply that income taxation may have a nonnegligible impact on the supply of roundwood. 相似文献
26.
Wilfried B. Kr tzig Jian-Wu Zhang 《Journal of Computational and Applied Mathematics》1994,50(1-3):361-373
A simple and accurate four-node quadrilateral finite element based on the Mindlin plate theory and Kirchhoff constraints is presented for general thin plate bending applications. The derivation of the element stiffness properties is straightforward, starting with a specified eight-node interpolation; usual discrete Kirchhoff (DK) constraints are employed to constrain out the four midside nodes of the element. The present resulting DK element passes patch tests with elements of arbitrary and even highly distorted mesh types. Numerical studies of the element convergence behaviours are undertaken for various plate bending problems so far investigated. It is indicated from comparative examples that fairly good convergence characteristics have been achieved. 相似文献
27.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
28.
转动系统的相对论性分析力学理论 总被引:20,自引:3,他引:17
本文讨论了转动相对论力学理论,主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Tr=∑ni=1I0iΓi2(1-1-θ·2i/Γi2)和广义加速度能量函数Sr=12∑ni=1Ii(θ·i·θ¨i)2Γi2-θ·2i+θ¨2i,给出其Hamilton原理和三种不同形式的D′Alembert原理;对于完整约束系统,建立了转动系统的相对论性Lagrange方程、Nielsen方程、Appel方程和Hamilton正则方程;对于非完整约束系统,建立了转动系统的相对论性Routh方程、Чаплыгин方程、Nielsen方程和Appel方程;并给出转动系统的相对论性Noether守恒律 相似文献
29.
The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem. 相似文献
30.
B. Rustem 《Journal of Optimization Theory and Applications》1993,76(3):429-453
In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker. 相似文献