全文获取类型
收费全文 | 13237篇 |
免费 | 273篇 |
国内免费 | 4篇 |
专业分类
化学 | 55篇 |
晶体学 | 4篇 |
力学 | 120篇 |
综合类 | 1篇 |
数学 | 12656篇 |
物理学 | 678篇 |
出版年
2022年 | 23篇 |
2021年 | 13篇 |
2020年 | 23篇 |
2019年 | 256篇 |
2018年 | 305篇 |
2017年 | 136篇 |
2016年 | 115篇 |
2015年 | 123篇 |
2014年 | 296篇 |
2013年 | 799篇 |
2012年 | 349篇 |
2011年 | 805篇 |
2010年 | 640篇 |
2009年 | 867篇 |
2008年 | 1009篇 |
2007年 | 1019篇 |
2006年 | 709篇 |
2005年 | 500篇 |
2004年 | 396篇 |
2003年 | 313篇 |
2002年 | 244篇 |
2001年 | 219篇 |
2000年 | 224篇 |
1999年 | 330篇 |
1998年 | 297篇 |
1997年 | 237篇 |
1996年 | 300篇 |
1995年 | 304篇 |
1994年 | 294篇 |
1993年 | 258篇 |
1992年 | 237篇 |
1991年 | 171篇 |
1990年 | 145篇 |
1989年 | 159篇 |
1988年 | 98篇 |
1987年 | 115篇 |
1986年 | 103篇 |
1985年 | 165篇 |
1984年 | 158篇 |
1983年 | 86篇 |
1982年 | 144篇 |
1981年 | 139篇 |
1980年 | 84篇 |
1979年 | 61篇 |
1978年 | 87篇 |
1977年 | 63篇 |
1976年 | 47篇 |
1975年 | 15篇 |
1974年 | 11篇 |
1973年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
Nanosized Fe0.2Ni0.8 particles were prepared by reducing their salts with sodium borohydride (NaBH4) in cationic water-in-oil (w/o) microemulsions of water/cetyl-trimethyl-amonium bromide (CTAB) and n-butanol/isooctane at 25 °C. According to the TEM and X-ray diffraction analyses, the synthesized particles were around 4–12 nm in size. Due to their nanodimensions, the particles had a primitive cubic (pc) structure rather than the body-centered cubic (BCC) structure of the bulk material. An examination of the synthesis from the reverse micelle reveals that the morphology of the iron–nickel alloy nanoparticles depends mainly on the microemulsion's composition. The magnetization of the nanoparticles was much lower than that of the bulk material, reflecting the influence of the nanodimensions on the particles’ magnetizations. 相似文献
72.
Abdo Y. Alfakih 《Discrete Applied Mathematics》2007,155(10):1244-1253
Let V={1,2,…,n}. A mapping p:V→Rr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj∥2=∥pi-pj∥2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated. 相似文献
73.
Eliza P. de Jager 《Topology and its Applications》2007,154(10):2117-2126
We show that the infimum of any family of proximally symmetric quasi-uniformities is proximally symmetric, while the supremum of two proximally symmetric quasi-uniformities need not be proximally symmetric. On the other hand, the supremum of any family of transitive quasi-uniformities is transitive, while there are transitive quasi-uniformities whose infimum with their conjugate quasi-uniformity is not transitive. Moreover we present two examples that show that neither the supremum topology nor the infimum topology of two transitive topologies need be transitive. Finally, we prove that several operations one can perform on and between quasi-uniformities preserve the property of having a complement. 相似文献
74.
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results. 相似文献
75.
76.
On the third largest Laplacian eigenvalue of a graph 总被引:1,自引:0,他引:1
Ji-Ming Guo 《Linear and Multilinear Algebra》2007,55(1):93-102
In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph. 相似文献
77.
Biao Zhang 《Journal of multivariate analysis》2006,97(1):211-230
In logistic case-control studies, Prentice and Pyke (Biometrika 66 (1979) 403-411) showed that valid point estimators of the odds-ratio parameters and their standard errors may be obtained by fitting the prospective logistic regression model to case-control data. Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) generalized Prentice and Pyke's (Biometrika 66 (1979) 403-411) results to robust logistic case-control studies. In this paper, we extend the results of Prentice and Pyke (Biometrika 66 (1979) 403-411) and Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) to a class of statistics and a class of unbiased estimating equations. We present some results on simulation and on the analysis of two real datasets. 相似文献
78.
Teruhisa Tsuda 《Letters in Mathematical Physics》2006,77(1):21-30
Starting from certain point sets in the projective plane, we construct a tropical (or subtraction-free birational) representation of Weyl groups over the field of τ-functions. In particular, our construction includes E
8
(1)
, E
7
(1)
, E
6
(1)
and D
5
(1)
as affine cases; each of them gives rise to the q-difference Painlevé equation. 相似文献
79.
The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q = 1, to the Catalan numbers: 1, 1, 2, 5, 14,…, a log-convex sequence. We use a combinatorial interpretation of these polynomials
to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted.
Received January 2, 2007 相似文献
80.
We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators. 相似文献