全文获取类型
收费全文 | 14068篇 |
免费 | 876篇 |
国内免费 | 471篇 |
专业分类
化学 | 2023篇 |
晶体学 | 30篇 |
力学 | 1330篇 |
综合类 | 157篇 |
数学 | 9758篇 |
物理学 | 2117篇 |
出版年
2024年 | 18篇 |
2023年 | 153篇 |
2022年 | 294篇 |
2021年 | 400篇 |
2020年 | 260篇 |
2019年 | 303篇 |
2018年 | 302篇 |
2017年 | 406篇 |
2016年 | 380篇 |
2015年 | 304篇 |
2014年 | 609篇 |
2013年 | 906篇 |
2012年 | 833篇 |
2011年 | 717篇 |
2010年 | 668篇 |
2009年 | 875篇 |
2008年 | 882篇 |
2007年 | 916篇 |
2006年 | 700篇 |
2005年 | 585篇 |
2004年 | 494篇 |
2003年 | 446篇 |
2002年 | 415篇 |
2001年 | 347篇 |
2000年 | 337篇 |
1999年 | 260篇 |
1998年 | 294篇 |
1997年 | 268篇 |
1996年 | 235篇 |
1995年 | 227篇 |
1994年 | 218篇 |
1993年 | 176篇 |
1992年 | 163篇 |
1991年 | 117篇 |
1990年 | 112篇 |
1989年 | 86篇 |
1988年 | 67篇 |
1987年 | 58篇 |
1986年 | 67篇 |
1985年 | 85篇 |
1984年 | 80篇 |
1983年 | 25篇 |
1982年 | 64篇 |
1981年 | 41篇 |
1980年 | 38篇 |
1979年 | 56篇 |
1978年 | 36篇 |
1977年 | 40篇 |
1976年 | 26篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 328 毫秒
41.
The natural modes of a discrete linear system are orthogonal with respect to the mass and stiffness matrices in a generalized sense. However, these modes are usually not orthogonal to each other in the ordinary sense. The purpose of this paper is to document a number of conditions under which the modes are also orthogonal in an ordinary fashion. 相似文献
42.
43.
44.
Grigor'ev S. A. Kalinnikov A. A. Porembskii V. I. Baranov I. E. Borisova E. V. Fateev V. N. 《Russian Journal of Electrochemistry》2004,40(11):1188-1192
A two-dimensional mathematical model for the transport of reactants in a fuel cell with a solid polymer electrolyte is developed. The model is used for analyzing spatial distributions of the concentration of reactants and current density over the cell. The effect of the catalytic-layer activity, reactant speed, bipolar-plate geometry, thickness and porosity of current collector and/or gas-diffusion sublayer, and the reaction mixture composition on the fuel cell efficiency is estimated theoretically and experimentally. 相似文献
45.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
46.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
47.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
48.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
49.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
50.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献