全文获取类型
收费全文 | 990篇 |
免费 | 84篇 |
国内免费 | 134篇 |
专业分类
化学 | 34篇 |
晶体学 | 1篇 |
力学 | 81篇 |
综合类 | 30篇 |
数学 | 939篇 |
物理学 | 123篇 |
出版年
2024年 | 1篇 |
2023年 | 14篇 |
2022年 | 11篇 |
2021年 | 13篇 |
2020年 | 18篇 |
2019年 | 27篇 |
2018年 | 24篇 |
2017年 | 21篇 |
2016年 | 34篇 |
2015年 | 25篇 |
2014年 | 32篇 |
2013年 | 49篇 |
2012年 | 28篇 |
2011年 | 39篇 |
2010年 | 37篇 |
2009年 | 54篇 |
2008年 | 67篇 |
2007年 | 86篇 |
2006年 | 62篇 |
2005年 | 61篇 |
2004年 | 60篇 |
2003年 | 71篇 |
2002年 | 54篇 |
2001年 | 40篇 |
2000年 | 43篇 |
1999年 | 52篇 |
1998年 | 29篇 |
1997年 | 29篇 |
1996年 | 25篇 |
1995年 | 15篇 |
1994年 | 23篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1975年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1208条查询结果,搜索用时 0 毫秒
1.
In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class
of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve
model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given
for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively.
Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature
for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions
for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there
exist UMRE estimators of parameters in the variance components model are obtained for the first time. 相似文献
2.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
3.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
4.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
5.
Liang-gen Hu 《应用数学学报(英文版)》2007,23(2):281-288
In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic. 相似文献
6.
7.
Hirofumi Tsumura. 《Mathematics of Computation》2004,73(245):251-258
In this paper, we give some evaluation formulas for Tornheim's type of alternating series by an elementary and combinatorial calculation of the uniformly convergent series. Indeed, we list several formulas for them by means of Riemann's zeta values at positive integers.
8.
Yen-Shung TSAI 《中国科学A辑(英文版)》2007,50(7):1026-1034
By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper. 相似文献
9.
王军秀 《纯粹数学与应用数学》2007,23(3):406-408
利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论. 相似文献
10.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献