全文获取类型
收费全文 | 2827篇 |
免费 | 420篇 |
国内免费 | 126篇 |
专业分类
化学 | 345篇 |
力学 | 308篇 |
综合类 | 58篇 |
数学 | 1218篇 |
物理学 | 1444篇 |
出版年
2024年 | 9篇 |
2023年 | 49篇 |
2022年 | 82篇 |
2021年 | 67篇 |
2020年 | 71篇 |
2019年 | 83篇 |
2018年 | 82篇 |
2017年 | 134篇 |
2016年 | 123篇 |
2015年 | 101篇 |
2014年 | 182篇 |
2013年 | 191篇 |
2012年 | 161篇 |
2011年 | 152篇 |
2010年 | 152篇 |
2009年 | 165篇 |
2008年 | 179篇 |
2007年 | 174篇 |
2006年 | 172篇 |
2005年 | 140篇 |
2004年 | 122篇 |
2003年 | 110篇 |
2002年 | 93篇 |
2001年 | 83篇 |
2000年 | 71篇 |
1999年 | 60篇 |
1998年 | 40篇 |
1997年 | 57篇 |
1996年 | 32篇 |
1995年 | 35篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 25篇 |
1991年 | 16篇 |
1990年 | 12篇 |
1989年 | 17篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 16篇 |
1985年 | 14篇 |
1984年 | 7篇 |
1982年 | 9篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1957年 | 2篇 |
排序方式: 共有3373条查询结果,搜索用时 15 毫秒
1.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic -edge-connected if every two distinct vertices of are connected by at least edge-disjoint monochromatic paths, and is said to be uniformly monochromatic -edge-connected if every two distinct vertices are connected by at least edge-disjoint monochromatic paths such that all edges of these paths are colored with a same color. We use and to denote the maximum number of colors that ensures to be monochromatic -edge-connected and, respectively, to be uniformly monochromatic -edge-connected. In this paper, we first conjecture that for any -edge-connected graph , , where is a minimum -edge-connected spanning subgraph of . We verify the conjecture for . We also prove the conjecture for and with . When is a minimal -edge-connected graph, we give an upper bound of , i.e., . For the uniformly monochromatic -edge-connectivity, we prove that for all , , where is a minimum -edge-connected spanning subgraph of . 相似文献
2.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献
3.
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta. 相似文献
4.
5.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
6.
7.
Hong-Nian Li Xiao-Xiong WangWang-Feng Ding 《Journal of Electron Spectroscopy and Related Phenomena》2006
Using X-ray photoemission measurements, we have determined the attenuation length of C 1s photoelectrons in C60 film to be 21.5 Å with the incident photon energy of Mg Kα radiation. The inelastic mean free path calculated with the TPP-2M algorithm coincides fairly well with the experimentally determined attenuation length, indicating the validity of the algorithm to fullerene and fullerides. The inelastic mean free paths for some fullerides, i.e. K3C60, K6C60, Ba4C60, Sm2.75C60 and Sm6C60 are calculated to help the quantitative analyses of the photoemission spectra for these compounds. 相似文献
8.
We review the Lorentz-covariant approach to loop quantum gravity. This approach solves the Immirzi parameter problem occurring in the standard loop approach based on the SU(2) gauge group. We show that there exists a unique loop quantization preserving all the classical symmetries at the quantum level and that the results obtained with it, such as the area operator spectrum, are independent of the Immirzi parameter. The standard SU(2) approach violates the diffeomorphism invariance and is therefore an incorrect quantization of gravity. 相似文献
9.
10.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献