全文获取类型
收费全文 | 11299篇 |
免费 | 347篇 |
国内免费 | 95篇 |
专业分类
化学 | 510篇 |
晶体学 | 16篇 |
力学 | 184篇 |
综合类 | 12篇 |
数学 | 10321篇 |
物理学 | 698篇 |
出版年
2023年 | 12篇 |
2022年 | 22篇 |
2021年 | 18篇 |
2020年 | 42篇 |
2019年 | 370篇 |
2018年 | 438篇 |
2017年 | 225篇 |
2016年 | 146篇 |
2015年 | 155篇 |
2014年 | 411篇 |
2013年 | 662篇 |
2012年 | 385篇 |
2011年 | 694篇 |
2010年 | 642篇 |
2009年 | 861篇 |
2008年 | 906篇 |
2007年 | 884篇 |
2006年 | 673篇 |
2005年 | 428篇 |
2004年 | 385篇 |
2003年 | 352篇 |
2002年 | 249篇 |
2001年 | 234篇 |
2000年 | 206篇 |
1999年 | 250篇 |
1998年 | 209篇 |
1997年 | 168篇 |
1996年 | 247篇 |
1995年 | 257篇 |
1994年 | 236篇 |
1993年 | 169篇 |
1992年 | 120篇 |
1991年 | 80篇 |
1990年 | 58篇 |
1989年 | 66篇 |
1988年 | 46篇 |
1987年 | 33篇 |
1986年 | 37篇 |
1985年 | 52篇 |
1984年 | 49篇 |
1983年 | 36篇 |
1982年 | 62篇 |
1981年 | 41篇 |
1980年 | 30篇 |
1979年 | 16篇 |
1978年 | 20篇 |
1977年 | 17篇 |
1976年 | 23篇 |
1974年 | 8篇 |
1973年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
51.
The microstructure evolution of decagonal quasicrystals in Al72Ni12Co16 alloy was investigated by the electromagnetic melting and cyclic superheating method. Single-phase decagonal quasicrystals have been obtained when the undercoolings were larger than 60 K. The decagonal quasicrystals formed at various undercoolings show different microstructural morphologies. Furthermore, grain refinement was found near the undercooling of 120 K. Based on current thermodynamic and dendrite growth theories, a dimensionless superheating parameter was adopted to explain the effect of processing conditions on the microstructure of Al72Ni12Co16 alloy. The result indicate that the fine equiaxied microstructure of decagonal quasicrystal (D-phase) formed near on undercooling of 120 K originates from the break-up of dendrites. 相似文献
52.
Marilyn Breen 《Journal of Geometry》1989,36(1-2):8-16
LetS be a compact, simply connected set inR
2. If every boundary point ofS is clearly visible viaS from at least one of the three pointsa, b, c, thenS is a union of three starshaped sets whose kernels containa, b, c, respectively. The result fails when the number three is replaced by four.As a partial converse, ifS is a union of three starshaped sets whose kernels containa, b, c, respectively, then the set of points in the boundary ofS clearly visible from at least one ofa, b, orc is dense in the boundary ofS.Supported in part by NSF grant DMS-8705336. 相似文献
53.
Valery Agoshkov Paola Gervasio Alfio Quarteroni 《Mediterranean Journal of Mathematics》2006,3(2):147-176
New domain decomposition methods (DDM) based on optimal control approach are introduced for the coupling of first and second
order equations on overlapping subdomains. Several cost functionals and control functions are proposed. Uniqueness and existence
results are proved for the coupled problem, and the convergence of iterative processes is analyzed.
The work was supported by the Russian Foundation for Basic Research (04-01-00615) and it was partly carried out while the
first author was visiting the IACS at EPFL. 相似文献
54.
Igor Chueshov 《Journal of Differential Equations》2007,233(1):42-86
We study von Karman evolution equations with non-linear dissipation and with partially clamped and partially free boundary conditions. Two distinctive mechanisms of dissipation are considered: (i) internal dissipation generated by non-linear operator, and (ii) boundary dissipation generated by shear forces friction acting on a free part of the boundary. The main emphasis is given to the effects of boundary dissipation. Under suitable hypotheses we prove existence of a compact global attractor and finiteness of its fractal dimension. We also show that any solution is stabilized to an equilibrium and estimate the rate of the convergence which, in turn, depends on the behaviour at the origin of the functions describing the dissipation. 相似文献
55.
The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω<λ?κ, no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (DI(λ)) is λ-resolvable. 相似文献
56.
We consider the Dirichlet problem for a class of anisotropic degenerate elliptic equations. New a priori estimates for solutions and for the gradient of solutions are established. Based on these estimates sufficient conditions guaranteeing the solvability of the problem are formulated. The results are new even in the semilinear case when the principal part is the Laplace operator. 相似文献
57.
We study the domain of existence of a solution to a Riemann problem for the pressure gradient equation in two space dimensions. The Riemann problem is the expansion of a quadrant of gas of constant state into the other three vacuum quadrants. The global existence of a smooth solution was established in Dai and Zhang [Z. Dai, T. Zhang, Existence of a global smooth solution for a degenerate Goursat problem of gas dynamics, Arch. Ration. Mech. Anal. 155 (2000) 277-298] up to the free boundary of vacuum. We prove that the vacuum boundary is the coordinate axes. 相似文献
58.
Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably. 相似文献
59.
We study the multiplicity of critical points for functionals which are only differentiable along some directions. We extend to this class of functionals the three critical point theorem of Pucci and Serrin and we apply it to a one-parameter family of functionals Jλ, λ∈I⊂R. Under suitable assumptions, we locate an open subinterval of values λ in I for which Jλ possesses at least three critical points. Applications to quasilinear boundary value problems are also given. 相似文献
60.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献