全文获取类型
收费全文 | 1123篇 |
免费 | 28篇 |
国内免费 | 6篇 |
专业分类
化学 | 744篇 |
晶体学 | 5篇 |
力学 | 21篇 |
数学 | 226篇 |
物理学 | 161篇 |
出版年
2023年 | 12篇 |
2022年 | 30篇 |
2021年 | 32篇 |
2020年 | 13篇 |
2019年 | 37篇 |
2018年 | 24篇 |
2017年 | 25篇 |
2016年 | 38篇 |
2015年 | 44篇 |
2014年 | 43篇 |
2013年 | 86篇 |
2012年 | 61篇 |
2011年 | 68篇 |
2010年 | 50篇 |
2009年 | 53篇 |
2008年 | 63篇 |
2007年 | 74篇 |
2006年 | 41篇 |
2005年 | 31篇 |
2004年 | 36篇 |
2003年 | 30篇 |
2002年 | 36篇 |
2001年 | 14篇 |
2000年 | 14篇 |
1999年 | 16篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 18篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1978年 | 3篇 |
1975年 | 4篇 |
1974年 | 2篇 |
1973年 | 10篇 |
1955年 | 2篇 |
1931年 | 2篇 |
排序方式: 共有1157条查询结果,搜索用时 0 毫秒
121.
We propose a three-field formulation for efficiently solving a two-dimensional Stokes problem in the case of nonstandard boundary conditions. More specifically, we consider the case where the pressure and either normal or tangential components of the velocity are prescribed at some given parts of the boundary. The proposed computational methodology consists in reformulating the considered boundary value problem via a mixed-type formulation where the pressure and the vorticity are the principal unknowns while the velocity is the Lagrange multiplier. The obtained formulation is then discretized and a convergence analysis is performed. A priori error estimates are established, and some numerical results are presented to highlight the perfomance of the proposed computational methodology.
122.
123.
We give the complete classification of all binary, self-dual, doubly-even (32, 16) codes. There are 85 non-equivalent, self-dual, doubly-even (32, 16) codes. Five of these have minimum weight 8, namely, a quadratic residue code and a Reed-Muller code, and three new codes. A set of generators is given for a code in each equivalence class together with its entire weight distribution and the order of its entire group with other information facilitating the computation of permutation generators. From this list it is possible to identify all self-dual codes of length less than 32 and the numbers of these are included. 相似文献
124.
In this work we study nonnegativity and positivity of a discrete quadratic functional with separately varying endpoints. We introduce a notion of an interval coupled with 0, and hence, extend the notion of conjugate interval to 0 from the case of fixed to variable endpoint(s). We show that the nonnegativity of the discrete quadratic functional is equivalent to each of the following conditions: The nonexistence of intervals coupled with 0, the existence of a solution to Riccati matrix equation and its boundary conditions. Natural strengthening of each of these conditions yields a characterization of the positivity of the discrete quadratic functional. Since the quadratic functional under consideration could be a second variation of a discrete calculus of variations problem with varying endpoints, we apply our results to obtain necessary and sufficient optimality conditions for such problems. This paper generalizes our recent work in [R. Hilscher, V. Zeidan, Comput. Math. Appl., to appear], where the right endpoint is fixed. 相似文献
125.
Jorge R. Vera 《Mathematical Programming》1998,80(1):91-123
In this paper we study the complexity of solving linear programs in finite precision arithmetic. This is the normal setup in scientific computation, as digital computers work in finite precision. We analyze two aspects of the complexity: one is the number of arithmetic operations required to solve the problem approximately, and the other is the working precision required to carry out some critical computations safely. We show how the conditioning of the problem instance affects the working precision required and the computational requirements of a classical logarithmic barrier algorithm to approximate the optimal value of the problem within a given tolerance. Our results show that these complexity measures depend linearly on the logarithm of a certain condition measure. We carry out the analysis by looking at how well Newton's Method can follow the central trajectory of the feasible set, and computing error bounds in terms of the condition measure. These results can be interpreted as a theoretical indication of good numerical behavior of the logarithmic barrier method, in the sense that a problem instance twice as hard as the other from the numerical point of view, requires only at most twice as much precision to be solved. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.This research has been supported through grants from Fundación Andes, under agreement C12021/7, and FONDECYT (project number 1930948). 相似文献
126.
Mathematical Programming - We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the... 相似文献
127.
128.
129.
130.
Mathematical theory of optimization has found many applications in the area of medicine over the last few decades. Several
data analysis and decision making problems in medicine can be formulated using optimization and data mining techniques. The
significance of the mathematical models is greatly realized in the recent years owing to the growing technological capabilities
and the large amounts of data available. In this paper, we attempt to give a brief overview of some of the most interesting
applications of mathematical programming and data mining in medicine. In the overview, we include applications like radiation
therapy treatment, microarray data analysis, and computational neuroscience. 相似文献