全文获取类型
收费全文 | 2374篇 |
免费 | 164篇 |
国内免费 | 148篇 |
专业分类
化学 | 45篇 |
晶体学 | 4篇 |
力学 | 129篇 |
综合类 | 34篇 |
数学 | 2273篇 |
物理学 | 201篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 23篇 |
2021年 | 46篇 |
2020年 | 44篇 |
2019年 | 57篇 |
2018年 | 51篇 |
2017年 | 53篇 |
2016年 | 64篇 |
2015年 | 46篇 |
2014年 | 90篇 |
2013年 | 200篇 |
2012年 | 106篇 |
2011年 | 84篇 |
2010年 | 80篇 |
2009年 | 121篇 |
2008年 | 106篇 |
2007年 | 136篇 |
2006年 | 110篇 |
2005年 | 110篇 |
2004年 | 103篇 |
2003年 | 101篇 |
2002年 | 121篇 |
2001年 | 71篇 |
2000年 | 92篇 |
1999年 | 81篇 |
1998年 | 70篇 |
1997年 | 61篇 |
1996年 | 45篇 |
1995年 | 42篇 |
1994年 | 42篇 |
1993年 | 40篇 |
1992年 | 36篇 |
1991年 | 31篇 |
1990年 | 29篇 |
1989年 | 22篇 |
1988年 | 15篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 22篇 |
1983年 | 11篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有2686条查询结果,搜索用时 125 毫秒
61.
In order to study the density of the set of positive integers for which the negative Pell equation is solvable in integers, we compute the norm of the fundamental unit in certain well-chosen families of real quadratic orders. A fast algorithm that computes 2-class groups rather than units is used. It is random polynomial-time in as the factorization of is a natural part of the input for the values of we encounter. The data obtained provide convincing numerical evidence for the density heuristics for the negative Pell equation proposed by the second author. In particular, an irrational proportion of the real quadratic fields without discriminantal prime divisors congruent to 3 mod 4 should have a fundamental unit of norm .
62.
Detlev W. Hoffmann 《Transactions of the American Mathematical Society》1996,348(8):3267-3281
Let and be anisotropic quadratic forms over a field of characteristic not . Their function fields and are said to be equivalent (over ) if and are isotropic. We consider the case where and is divisible by an -fold Pfister form. We determine those forms for which becomes isotropic over if , and provide partial results for . These results imply that if and are equivalent and , then is similar to over . This together with already known results yields that if is of height and degree or , and if , then and are equivalent iff and are isomorphic over .
63.
Y. Zhang 《Journal of Optimization Theory and Applications》1993,77(2):323-341
This paper concerns solving an overdetermined linear systemA
T
x=b in the leastl
1-norm orl
-norm sense, whereA
m×n
,m<n. We show that the primal-dual interior point approach for linear programming can be applied, in an effective manner, to linear programming versions of thel
1 andl
-problems. The resulting algorithms are simple to implement and can attain quadratic or superlinear convergence rate. At each iteration, the algorithms must solve a linear system with anm×m positive-definite coefficient matrix of the formADA
T
, whereD is a positive diagonal matrix. The preliminary numerical results indicate that the proposed algorithms offer considerable promise.This research was supported in part by Grants NSF DMS-91-02761 and DOE DE-FG05-91-ER25100. 相似文献
64.
In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most
steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints. 相似文献
65.
Choquet expected utility which uses capacities (i.e. nonadditive probability measures) in place of-additive probability measures has been introduced to decision making under uncertainty to cope with observed effects of ambiguity aversion like the Ellsberg paradox. In this paper we present necessary and sufficient conditions for stochastic dominance between capacities (i.e. the expected utility with respect to one capacity exceeds that with respect to the other one for a given class of utility functions). One wide class of conditions refers to probability inequalities on certain families of sets. To yield another general class of conditions we present sufficient conditions for the existence of a probability measureP with f dC= f dP for all increasing functionsf whenC is a given capacity. Examples includen-th degree stochastic dominance on the reals and many cases of so-called set dominance. Finally, applications to decision making are given including anticipated utility with unknown distortion function. 相似文献
66.
Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O(
L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100. 相似文献
67.
Using the Chern classes defined by Grothendieck, we map aK-theoretic invariant of invertible symmetric matrices defined by Giffen to the Clifford invariant.According to Herrmann Graßman'sWörterbuch zum Rig-veda, Ketu may not be connected with K2 but es bezeichnet das, was sich sichtbar oder kenntlich macht ... 相似文献
68.
Emanuele Galligani 《Numerical Algorithms》1993,5(11):549-555
Givenn pairwise distinct and arbitrarily spaced pointsP
i in a domainD of thex–y plane andn real numbersf
i, consider the problem of computing a bivariate functionf(x, y) of classC
1 inD whose values inP
i are exactlyf
i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ
l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy. 相似文献
69.
R. J. Williams 《Journal of Optimization Theory and Applications》1980,30(4):569-582
Mixed strategy -equilibrium points are given forN-person games with cost functions consisting of quadratic, bilinear, and linear terms and strategy spaces consisting of closed balls in Hilbert spaces. The results are applied to linear-quadratic differential games with no information and quadratic integral constraints on the control functions.This work was supported by a Commonwealth of Australia, Postgraduate Research Award. 相似文献
70.
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rn1 and Y R
n2 are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010. 相似文献