全文获取类型
收费全文 | 2757篇 |
免费 | 213篇 |
国内免费 | 150篇 |
专业分类
化学 | 414篇 |
晶体学 | 4篇 |
力学 | 762篇 |
综合类 | 26篇 |
数学 | 1282篇 |
物理学 | 632篇 |
出版年
2023年 | 20篇 |
2022年 | 26篇 |
2021年 | 44篇 |
2020年 | 51篇 |
2019年 | 45篇 |
2018年 | 40篇 |
2017年 | 67篇 |
2016年 | 71篇 |
2015年 | 97篇 |
2014年 | 124篇 |
2013年 | 176篇 |
2012年 | 160篇 |
2011年 | 119篇 |
2010年 | 99篇 |
2009年 | 135篇 |
2008年 | 131篇 |
2007年 | 172篇 |
2006年 | 159篇 |
2005年 | 133篇 |
2004年 | 125篇 |
2003年 | 99篇 |
2002年 | 106篇 |
2001年 | 94篇 |
2000年 | 80篇 |
1999年 | 90篇 |
1998年 | 74篇 |
1997年 | 73篇 |
1996年 | 54篇 |
1995年 | 62篇 |
1994年 | 58篇 |
1993年 | 46篇 |
1992年 | 31篇 |
1991年 | 34篇 |
1990年 | 33篇 |
1989年 | 26篇 |
1988年 | 28篇 |
1987年 | 12篇 |
1986年 | 23篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 12篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 2篇 |
1974年 | 5篇 |
排序方式: 共有3120条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
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. 相似文献
33.
34.
转动系统的相对论性分析力学理论 总被引: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守恒律 相似文献
35.
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. 相似文献
36.
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. 相似文献
37.
I.IntroductionDuetospatia1andtemporalvariabilityoftheocean-acousticenvironment,especially,theeffectsofboundaryaswel1asmediumonpropagationofacousticwavesinshal1owwater,theacousticpropagationisextrcmelycomp1icatcd.Multipathtransmissionisthebasiccharacteris-hcsofunderwatersoundchannels.Undctcrminedmultipathstructurescangreatlylimittheperformanceofunderwateracousticdetcction.However,ifthemultipathcharacteristicsofacousticpropagationinunderwatcrsoundchanne1sareknown,spaee-timeresolutionandpro-cess… 相似文献
38.
Ar—Kr溶液扩散系数的分子动力学模拟及其与温度的关系 总被引:2,自引:1,他引:2
用分子动力学模拟方法研究确定Ar-Kr溶液的自扩散系数D1、D2和互扩散系数D12以及它们随温度变化的规律。结果表明,分别用Green-Kubo法和Einstein法得到的扩散系数在数值上一致;该溶液的3种扩散系数均满足D=D0e^E/RT关系。 相似文献
39.
Convex programs with an additional reverse convex constraint 总被引:2,自引:0,他引:2
H. Tuy 《Journal of Optimization Theory and Applications》1987,52(3):463-486
A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR
n
andf,g are convex finite functionsR
n
. Under suitable stability hypotheses, it is shown that a feasible point
is optimal if and only if 0=max{g(x):xD,f(x)f(
)}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ
k
,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS
k
. The method is similar to the outer approximation method for maximizing a convex function over a compact convex set. 相似文献
40.
I. M. Krukovskii M. S. Molchanova A. V. Evtushenko V. A. Shlyapochnikov 《Russian Chemical Bulletin》1998,47(7):1266-1273
The ratio between the numbers of structural formulas of C,H,N,O-containing energetic compounds belonging to the classes of
fuels (low values of the oxygen coefficientA), explosives (mediumA), and oxidants (highA values) was studied by a computer generation procedure. The number of the theoretically possible structural formulas was
found to decrease rapidly on going from fuels to explosives and then to oxidants; this observation agrees with the data on
the numbers of various energetic compounds currently used and proposed. The strategy of the search for new compounds with
the specified properties is described in brief, and its applicability to the search for explosives and oxidants with a small
(up to 12) number of atoms in a molecule is evaluated.
Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 7, pp. 1304–1310, July, 1998. 相似文献