全文获取类型
收费全文 | 114358篇 |
免费 | 6915篇 |
国内免费 | 4846篇 |
专业分类
化学 | 49894篇 |
晶体学 | 1298篇 |
力学 | 9004篇 |
综合类 | 299篇 |
数学 | 36076篇 |
物理学 | 29548篇 |
出版年
2024年 | 95篇 |
2023年 | 773篇 |
2022年 | 1063篇 |
2021年 | 1266篇 |
2020年 | 1542篇 |
2019年 | 1454篇 |
2018年 | 11383篇 |
2017年 | 11127篇 |
2016年 | 7684篇 |
2015年 | 2590篇 |
2014年 | 2417篇 |
2013年 | 3002篇 |
2012年 | 6960篇 |
2011年 | 13808篇 |
2010年 | 7906篇 |
2009年 | 8235篇 |
2008年 | 8999篇 |
2007年 | 10826篇 |
2006年 | 2378篇 |
2005年 | 2978篇 |
2004年 | 2841篇 |
2003年 | 3057篇 |
2002年 | 2036篇 |
2001年 | 1093篇 |
2000年 | 1167篇 |
1999年 | 997篇 |
1998年 | 939篇 |
1997年 | 833篇 |
1996年 | 895篇 |
1995年 | 737篇 |
1994年 | 619篇 |
1993年 | 524篇 |
1992年 | 480篇 |
1991年 | 394篇 |
1990年 | 355篇 |
1989年 | 297篇 |
1988年 | 262篇 |
1987年 | 230篇 |
1986年 | 210篇 |
1985年 | 198篇 |
1984年 | 147篇 |
1983年 | 107篇 |
1982年 | 102篇 |
1981年 | 74篇 |
1980年 | 62篇 |
1979年 | 54篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
Li Chen Ling Hsiao Gerald Warnecke 《应用数学学报(英文版)》2007,23(1):9-28
This paper considers a kind of strongly coupled cross diffusion parabolic system,which can be usedas the multi-dimensional Lyumkis energy transport model in semiconductor science.The global existence andlarge time behavior are obtained for smooth solution to the initial boundary value problem.When the initialdata are a small perturbation of an isothermal stationary solution,the smooth solution of the problem under theinsulating boundary condition,converges to that stationary solution exponentially fast as time goes to infinity. 相似文献
912.
多阶游程存储是一种不改变光学系统而显著提高光存储容量和数据传输率的新方法.介绍了光致变色多阶游程存储原理和实验系统.提出了基于光致变色原理的多阶游程存储数学模型,该模型反映了记录符反射率与曝光功率、曝光时间之间的非线性关系,并在此基础上确定了光致变色多阶游程存储的写策略.基于650nm光致变色材料进行了4阶游程存储的动态实验.结果表明,实验中采用的650nm光致变色材料可用于多阶游程存储,采用的写策略能够有效地使记录信道线性化,利于采用适合线性系统的信号处理方法.
关键词:
多阶游程
光致变色
光存储
写策略 相似文献
913.
Na SUN 《数学学报(英文版)》2007,23(10):1909-1914
In this paper, we introduce an operator Hμ(z) on L^∞(△) and obtain some of its properties. Some applications of this operator to the extremal problem of quasiconformal mappings are given. In particular, a sufficient condition for a point r in the universal Teichmfiller space T(△) to be a Strebel point is obtained. 相似文献
914.
Let (Ω, Σ) be a measurable space, X a Banach space whose characteristic of noncompact convexity is less than 1, C a bounded closed convex subset of X, KC(C) the family of all compact convex subsets of C. We prove that a set-valued nonexpansive mapping T: C → KC(C) has a fixed point. Furthermore, if X is separable then we also prove that a set-valued nonexpansive operator T: Ω × C → KC(C) has a random fixed point. 相似文献
915.
This article concerns the existence of global smooth solution for scalar conservation laws with degenerate viscosity in 2-dimensional space. The analysis is based on successive approximation and maximum principle. 相似文献
916.
Multiply-connected monolayered cyclofusene (MMC) is a fused hexacyclic system with an exterior region and at least two interior empty regions called holes, as in figure 1. Each hexacyle has either: (a) two edges belonging to an exterior boundary and at least one hole, or (b)
two edges belonging to boundaries of at least two holes. Let G be the graph of a given MMC. We show that G is equitable if and only if the set of vertices belonging to three hexacycles is equitable. 相似文献
917.
Dan Archdeacon C. Paul Bonnington Joanna A. Ellis-Monaghan 《Discrete and Computational Geometry》2007,38(3):573-594
Steinitz's theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and
planar. The polyhedron is called a geometric realization of the embedded graph. Its faces are bounded by convex polygons whose
points are coplanar. A map on the torus does not necessarily have such a geometric realization. In this paper we relax the
condition that faces are the convex hull of coplanar points. We require instead that the convex hull of
the points on a face can be projected onto a plane so that the boundary of the convex hull of the projected points is the
image of the boundary of the face. We also require that the interiors of the convex hulls of different faces do not intersect.
Call this an exhibition of the map. A map is polyhedral if the intersection of any two closed faces is simply connected. Our
main result is that every polyhedral toroidal map can be exhibited. As a corollary, every toroidal triangulation has a geometric
realization. 相似文献
918.
Let R be a local ring and let (x
1, …, x
r) be part of a system of parameters of a finitely generated R-module M, where r < dimR
M. We will show that if (y
1, …, y
r) is part of a reducing system of parameters of M with (y
1, …, y
r) M = (x
1, …, x
r) M then (x
1, …, x
r) is already reducing. Moreover, there is such a part of a reducing system of parameters of M iff for all primes P ε Supp M ∩ V
R(x
1, …, x
r) with dimR
R/P = dimR
M − r the localization M
P of M at P is an r-dimensional Cohen-Macaulay module over R
P.
Furthermore, we will show that M is a Cohen-Macaulay module iff y
d is a non zero divisor on M/(y
1, …, y
d−1) M, where (y
1, …, y
d) is a reducing system of parameters of M (d:= dimR
M). 相似文献
919.
Iddo Eliazar 《Queueing Systems》2007,55(1):71-82
We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated.
We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied
to various examples, including ones with infinite queues and non-summable workloads.
AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10 相似文献
920.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively
studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path
which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject
to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity
of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous
spaces and network facility location. We will show that the problems presented here have a close connection with continuous
dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional
facilities location in the continuous case. 相似文献