全文获取类型
收费全文 | 67208篇 |
免费 | 10479篇 |
国内免费 | 2561篇 |
学科分类
数理化 | 80248篇 |
出版年
2024年 | 11篇 |
2023年 | 67篇 |
2022年 | 104篇 |
2021年 | 301篇 |
2020年 | 720篇 |
2019年 | 2501篇 |
2018年 | 2398篇 |
2017年 | 2872篇 |
2016年 | 3123篇 |
2015年 | 5423篇 |
2014年 | 5283篇 |
2013年 | 7293篇 |
2012年 | 5705篇 |
2011年 | 5536篇 |
2010年 | 4498篇 |
2009年 | 4323篇 |
2008年 | 4721篇 |
2007年 | 3995篇 |
2006年 | 3715篇 |
2005年 | 3539篇 |
2004年 | 2899篇 |
2003年 | 2671篇 |
2002年 | 3296篇 |
2001年 | 1718篇 |
2000年 | 1558篇 |
1999年 | 766篇 |
1998年 | 232篇 |
1997年 | 191篇 |
1996年 | 126篇 |
1995年 | 99篇 |
1994年 | 96篇 |
1993年 | 65篇 |
1992年 | 54篇 |
1991年 | 33篇 |
1990年 | 40篇 |
1989年 | 25篇 |
1988年 | 28篇 |
1987年 | 27篇 |
1986年 | 22篇 |
1985年 | 17篇 |
1984年 | 29篇 |
1983年 | 11篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 14篇 |
1979年 | 7篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
5.
6.
Volker Elling. 《Mathematics of Computation》2006,75(256):1721-1733
A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.
7.
5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities. 相似文献
8.
P.A. Ramachandran 《Numerical Methods for Partial Differential Equations》2006,22(4):831-846
Time‐dependent differential equations can be solved using the concept of method of lines (MOL) together with the boundary element (BE) representation for the spatial linear part of the equation. The BE method alleviates the need for spatial discretization and casts the problem in an integral format. Hence errors associated with the numerical approximation of the spatial derivatives are totally eliminated. An element level local cubic approximation is used for the variable at each time step to facilitate the time marching and the nonlinear terms are represented in a semi‐implicit manner by a local linearization at each time step. The accuracy of the method has been illustrated on a number of test problems of engineering significance. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
9.
Olaf Hansen 《Mathematical Methods in the Applied Sciences》2002,25(12):1075-1090
In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
10.
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 相似文献