全文获取类型
收费全文 | 1196篇 |
免费 | 156篇 |
国内免费 | 50篇 |
专业分类
化学 | 47篇 |
晶体学 | 2篇 |
力学 | 290篇 |
综合类 | 20篇 |
数学 | 776篇 |
物理学 | 267篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 22篇 |
2021年 | 24篇 |
2020年 | 24篇 |
2019年 | 30篇 |
2018年 | 32篇 |
2017年 | 41篇 |
2016年 | 44篇 |
2015年 | 33篇 |
2014年 | 60篇 |
2013年 | 78篇 |
2012年 | 87篇 |
2011年 | 63篇 |
2010年 | 59篇 |
2009年 | 51篇 |
2008年 | 53篇 |
2007年 | 82篇 |
2006年 | 62篇 |
2005年 | 57篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 66篇 |
2001年 | 41篇 |
2000年 | 45篇 |
1999年 | 42篇 |
1998年 | 29篇 |
1997年 | 19篇 |
1996年 | 17篇 |
1995年 | 17篇 |
1994年 | 23篇 |
1993年 | 24篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 8篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有1402条查询结果,搜索用时 62 毫秒
151.
The hierarchically constrained kinetic Ising model in one dimension is reviewed, and the results of several analytical approaches to the model are presented. Two standard approximation schemes, an effective-medium approximation and a mode-coupling approximation, are shown to fail. A new class of approximations, termed cluster approximations, is better suited for the model. It yields good results for the spin autocorrelation function, and also elucidates important general properties of the model—its connection with defect-diffusion models and the asymptotic long-time behavior of the autocorrelation function. 相似文献
152.
This article is concerned with second-order necessary and sufficient optimality conditions for optimal control problems governed by 3-dimensional Navier-Stokes equations. The periodic state constraint is considered. 相似文献
153.
In this paper, a deterministic inventory model for deteriorating items with two warehouses is developed. A rented warehouse is used when the ordering quantity exceeds the limited capacity of the owned warehouse, and it is assumed that deterioration rates of items in the two warehouses may be different. In addition, we allow for shortages in the owned warehouse and assume that the backlogging demand rate is dependent on the duration of the stockout. We obtain the condition when to rent the warehouse and provide simple solution procedures for finding the maximum total profit per unit time. Further, we use a numerical example to illustrate the model and conclude the paper with suggestions for possible future research. 相似文献
154.
Y. Y. Fan R. E. Kalaba H. H. Natsuyama F. E. Udwadia 《Journal of Optimization Theory and Applications》2005,127(3):475-484
The Gauss principle of least constraint is derived from a new point of view. Then, an extended principle of least constraint
is derived to cover the case of nonideal constraints. Finally, a version of the principle for general underdetermined systems
is adumbrated. Throughout, the notion of generalized inverses of matices plays a prominent role. 相似文献
155.
Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints 总被引:1,自引:0,他引:1
This paper addresses itself to a portfolio optimization problem under nonconvex transaction costs and minimal transaction unit constraints. Associated with portfolio construction is a fee for purchasing assets. Unit transaction fee is larger when the amount of transaction is smaller. Hence the transaction cost is usually a concave function up to certain point. When the amount of transaction increases, the unit price of assets increases due to illiquidity/market impact effects. Hence the transaction cost becomes convex beyond certain bound. Therefore, the net expected return becomes a general d.c. function (difference of two convex functions). We will propose a branch-and-bound algorithm for the resulting d.c. maximization problem subject to a constraint on the level of risk measured in terms of the absolute deviation of the rate of return of a portfolio. Also, we will show that the minimal transaction unit constraints can be incorporated without excessively increasing the amount of computation. 相似文献
156.
In this paper we consider a nonstationary periodic review dynamic production–inventory model with uncertain production capacity and uncertain demand. The maximum production capacity varies stochastically. It is known that order up-to (or base-stock, critical number) policies are optimal for both finite horizon problems and infinite horizon problems. We obtain upper and lower bounds of the optimal order up-to levels, and show that for an infinite horizon problem the upper and the lower bounds of the optimal order up-to levels for the finite horizon counterparts converge as the planning horizons considered get longer. Furthermore, under mild conditions the differences between the upper and the lower bounds converge exponentially to zero. 相似文献
157.
We study the perturbation property of best approximation to a set defined by an abstract nonlinear constraint system. We show that, at a normal point, the perturbation property of best approximation is equivalent to an equality expressed in terms of normal cones. This equality is related to the strong conical hull intersection property. Our results generalize many known results in the literature on perturbation property of best approximation established for a set defined by a finite system of linear/nonlinear inequalities. The connection to minimization problem is considered.The authors thank the referees for valuable suggestions.K.F. Ng - This author was partially supported by Grant A0324638 from the National Natural Science Foundation of China and Grants (2001) 01GY051-66 and SZD0406 from Sichuan Province.
Y.R. He -This author was supported by a Direct Grant (CUHK) and an Earmarked Grant from the Research Grant Council of Hong Kong. 相似文献
158.
ZHANG Zhenyue & DU Keqin Department of Mathematics Zhejiang University Hangzhou China. 《中国科学A辑(英文版)》2006,49(7):971-986
We present a successive projection method for solving the unbalanced Procrustes problem: given matrix A∈Rn×n and B∈Rn×k, n>k, minimize the residual‖AQ-B‖F with the orthonormal constraint QTQ = Ik on the variant Q∈Rn×k. The presented algorithm consists of solving k least squares problems with quadratic constraints and an expanded balance problem at each sweep. We give a detailed convergence analysis. Numerical experiments reported in this paper show that our new algorithm is superior to other existing methods. 相似文献
159.
Janne Martikainen Tuomo Rossi Jari Toivanen 《Numerical Linear Algebra with Applications》2002,9(8):629-652
A fast direct solution method for a discretized vector‐valued elliptic partial differential equation with a divergence constraint is considered. Such problems are typical in many disciplines such as fluid dynamics, elasticity and electromagnetics. The method requires the problem to be posed in a rectangle and boundary conditions to be either periodic boundary conditions or the so‐called slip boundary conditions in one co‐ordinate direction. The arising saddle‐point matrix has a separable form when bilinear finite elements are used in the discretization. Based on a result for so‐called p‐circulant matrices, the saddle‐point matrix can be transformed into a block‐diagonal form by fast Fourier transformations. Thus, the fast direct solver has the same structure as methods for scalar‐valued problems which are based on Fourier analysis and, therefore, it has the same computational cost ??(N log N). Numerical experiments demonstrate the good efficiency and accuracy of the proposed method. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
160.
Cristina Bazgan W. Fernandez de la Vega Marek Karpinski 《Random Structures and Algorithms》2003,23(1):73-91
It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN‐CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT ‐formulas, and linear equations mod 2, Ek‐LIN2, do have PTASs for any k. The MIN‐Ek‐LIN2 problems are equivalent to the k‐ary versions of the Nearest Codeword problem, the problem which is known to be exceedingly hard to approximate on general instances. The method of solution of the above problems depends on the development of a new density sampling technique for k‐uniform hypergraphs which could be of independent interest. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 73–91, 2003 相似文献