全文获取类型
收费全文 | 9970篇 |
免费 | 730篇 |
国内免费 | 284篇 |
专业分类
化学 | 1318篇 |
晶体学 | 31篇 |
力学 | 1096篇 |
综合类 | 147篇 |
数学 | 6871篇 |
物理学 | 1521篇 |
出版年
2024年 | 22篇 |
2023年 | 102篇 |
2022年 | 335篇 |
2021年 | 337篇 |
2020年 | 208篇 |
2019年 | 224篇 |
2018年 | 250篇 |
2017年 | 334篇 |
2016年 | 317篇 |
2015年 | 229篇 |
2014年 | 464篇 |
2013年 | 568篇 |
2012年 | 628篇 |
2011年 | 475篇 |
2010年 | 446篇 |
2009年 | 554篇 |
2008年 | 555篇 |
2007年 | 606篇 |
2006年 | 492篇 |
2005年 | 431篇 |
2004年 | 341篇 |
2003年 | 322篇 |
2002年 | 300篇 |
2001年 | 270篇 |
2000年 | 269篇 |
1999年 | 202篇 |
1998年 | 215篇 |
1997年 | 197篇 |
1996年 | 141篇 |
1995年 | 161篇 |
1994年 | 133篇 |
1993年 | 111篇 |
1992年 | 101篇 |
1991年 | 85篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 40篇 |
1986年 | 39篇 |
1985年 | 53篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 21篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 7 毫秒
121.
The considered mathematical model of the decomposition of valerate presents three unknown kinetic parameters, two unknown
stoichiometric coefficients, and three unknown initial concentrations for biomass. Applying a structural identifiability study,
we concluded that it is necessary to perform simultaneous batch experiments with differenitial conditions for estimating these
parameters. Four simultaneous batch experiments were conducted at 55°C, characterized by four different initial acetate concentrations.
Product inhibition of valerate degradation by acetate was considered. Practical identification was done optimizing the sum
of the multiple determination coefficients for all measured state viariables and for all experiments simultaneously. The estimated
values of kinetic parameters and stoichiometric coefficients were characterized by the parameter correlation matrix, the confidence
interval, and the student's t-test at 9% significance level with positive results except for the saturation constant, for which more eperiments for improving
its identifiability should be conducted. In this article, we discussekinetic parameter estimation methods. 相似文献
122.
《Journal of Pure and Applied Algebra》2022,226(12):107144
We consider parametric optimization problems from an algebraic viewpoint. The idea is to find all of the critical points of an objective function thereby determining a global optimum. For generic parameters (data) in the objective function the number of critical points remains constant. This number is known as the algebraic degree of an optimization problem. In this article, we go further by considering the inverse problem of finding parameters of the objective function so it gives rise to critical points exhibiting a special structure. For example if the critical point is in the singular locus, has some symmetry, or satisfies some other algebraic property. Our main result is a theorem describing such parameters. 相似文献
123.
《Operations Research Letters》2022,50(6):655-659
In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of problems where a greedy approach discovers a MaxST while a MinST may be unreachable. Our algorithm is a natural extension of Prim's to infinite graphs with summable and strictly positive edge weights, producing a sequence of finite trees that converge to a MaxST. 相似文献
124.
K. C. Kiwiel 《Applied Mathematics and Optimization》1995,32(3):235-254
Letf: n (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min
x
¦x¦2/2+t
f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)}
t
0, minimizingf over an ellipsoid, and choosing penalty parameters inL
1QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206. 相似文献
125.
Frédéric Semet 《Annals of Operations Research》1995,61(1):45-65
In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems. 相似文献
126.
The local optimality conditions to polynomial optimization problems are a set of polynomial equations (plus some inequality conditions). With the recent techniques of Gröbner bases one can find all solutions to such systems, and hence also find global optima. We give a short survey of these methods. We also apply them to a set of problems termed with exact solutions unknown in the problem sets of Hock and Schittkowski. To these problems we give exact solutions. 相似文献
127.
Necessary conditions for a given pointx
0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f
1,...,f
m
),F:XR
m,XR
m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df
1(x
0)|i=1,...,m}T
*(X, x
0) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper. 相似文献
128.
In this paper we consider a class of systems described by singular integrodifferential equations. This type of systems appear, for example, in the modeling of certain aeroelastic control problems. We study these systems in frequency domain framework and show the existence of finite-dimensional stabilizing controllers. An algorithmic procedure is outlined for the construction of such controllers. In order to illustrate the numerical aspects of this algorithm, we present an example involving the classical Theodorsen model of an airfoil, which fits in the class of systems considered here.This work was supported in part by the National Science Foundation under Grants DMS-8907019 and MSS-9203418. 相似文献
129.
The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized. 相似文献
130.
We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ?2+logGK) logGM log (G? ?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ?3) times faster than the algorithm developed in the latter paper. 相似文献