全文获取类型
收费全文 | 3962篇 |
免费 | 180篇 |
国内免费 | 296篇 |
专业分类
化学 | 114篇 |
晶体学 | 10篇 |
力学 | 83篇 |
综合类 | 47篇 |
数学 | 3928篇 |
物理学 | 256篇 |
出版年
2023年 | 29篇 |
2022年 | 26篇 |
2021年 | 44篇 |
2020年 | 56篇 |
2019年 | 70篇 |
2018年 | 77篇 |
2017年 | 87篇 |
2016年 | 94篇 |
2015年 | 80篇 |
2014年 | 132篇 |
2013年 | 206篇 |
2012年 | 174篇 |
2011年 | 180篇 |
2010年 | 151篇 |
2009年 | 223篇 |
2008年 | 219篇 |
2007年 | 245篇 |
2006年 | 219篇 |
2005年 | 202篇 |
2004年 | 179篇 |
2003年 | 174篇 |
2002年 | 155篇 |
2001年 | 147篇 |
2000年 | 181篇 |
1999年 | 123篇 |
1998年 | 137篇 |
1997年 | 122篇 |
1996年 | 71篇 |
1995年 | 63篇 |
1994年 | 63篇 |
1993年 | 49篇 |
1992年 | 45篇 |
1991年 | 40篇 |
1990年 | 38篇 |
1989年 | 22篇 |
1988年 | 31篇 |
1987年 | 26篇 |
1986年 | 22篇 |
1985年 | 33篇 |
1984年 | 27篇 |
1983年 | 7篇 |
1982年 | 24篇 |
1981年 | 25篇 |
1980年 | 23篇 |
1979年 | 24篇 |
1978年 | 16篇 |
1977年 | 16篇 |
1976年 | 20篇 |
1975年 | 3篇 |
1974年 | 11篇 |
排序方式: 共有4438条查询结果,搜索用时 78 毫秒
31.
Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered. 相似文献
32.
In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order
is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the
classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize
two simple cost allocation rules for uncertainty sequencing situations with equal processing times. 相似文献
33.
The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions,
which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered
are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right
scalar multiplication (including the case where λ=0+) and pointwise addition.
相似文献
34.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
35.
Using an infinite-horizon two-player differential game, we derive and compare Bertrand and Cournot equilibria for a differentiated duopoly engaging in the process of R&D competition. The main findings of this study are as follows. First, Bertrand competition is more efficient if either R&D productivity is low or products are very different. Second, Cournot competition is more efficient provided that R&D productivity is high, products are close substitutes, and spillovers are not close to zero. This last result is different from what has been obtained in the literature. Hence, this shows that considering a dynamic model and more general investment costs does have an impact on the efficiency results. 相似文献
36.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
37.
38.
§ 1. Introduction Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa… 相似文献
39.
几何凸函数与琴生型不等式 总被引:20,自引:3,他引:17
吴善和 《数学的实践与认识》2004,34(2):155-163
给出几何凸函数的定义以及判定几何凸函数的方法 ,建立关于几何凸函数的琴生型不等式 ,最后给出它的应用 ,包括改进一些已知不等式和建立一些新不等式 . 相似文献
40.
Joe Warren Scott Schaefer Anil N. Hirani Mathieu Desbrun 《Advances in Computational Mathematics》2007,27(3):319-338
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates
over convex 2D polygons have found numerous applications in various fields as they allow smooth interpolation of data located
on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to extend this interpolation
in higher dimensions. Moreover, there has been no attempt to extend these functions into the continuous domain, where barycentric
coordinates are related to Green’s functions and construct functions that satisfy a boundary value problem. First, we review
the properties and construction of barycentric coordinates in the discrete domain for convex polytopes. Next, we show how
these concepts extend into the continuous domain to yield barycentric coordinates for continuous functions. We then provide
a proof that our functions satisfy all the desirable properties of barycentric coordinates in arbitrary dimensions. Finally,
we provide an example of constructing such barycentric functions over regions bounded by parametric curves and show how they
can be used to perform freeform deformations.
相似文献