全文获取类型
收费全文 | 14676篇 |
免费 | 1239篇 |
国内免费 | 461篇 |
专业分类
化学 | 2986篇 |
晶体学 | 66篇 |
力学 | 6722篇 |
综合类 | 88篇 |
数学 | 2504篇 |
物理学 | 4010篇 |
出版年
2024年 | 16篇 |
2023年 | 144篇 |
2022年 | 272篇 |
2021年 | 306篇 |
2020年 | 387篇 |
2019年 | 297篇 |
2018年 | 338篇 |
2017年 | 372篇 |
2016年 | 402篇 |
2015年 | 442篇 |
2014年 | 556篇 |
2013年 | 1056篇 |
2012年 | 725篇 |
2011年 | 919篇 |
2010年 | 636篇 |
2009年 | 832篇 |
2008年 | 808篇 |
2007年 | 814篇 |
2006年 | 728篇 |
2005年 | 624篇 |
2004年 | 659篇 |
2003年 | 561篇 |
2002年 | 501篇 |
2001年 | 379篇 |
2000年 | 384篇 |
1999年 | 330篇 |
1998年 | 336篇 |
1997年 | 323篇 |
1996年 | 308篇 |
1995年 | 262篇 |
1994年 | 237篇 |
1993年 | 212篇 |
1992年 | 212篇 |
1991年 | 159篇 |
1990年 | 142篇 |
1989年 | 115篇 |
1988年 | 107篇 |
1987年 | 68篇 |
1986年 | 70篇 |
1985年 | 80篇 |
1984年 | 70篇 |
1983年 | 39篇 |
1982年 | 77篇 |
1981年 | 22篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1976年 | 5篇 |
1971年 | 6篇 |
1957年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
L.E. Payne 《Journal of Mathematical Analysis and Applications》2007,335(1):371-376
In this paper we consider two different initial-boundary value problems in temperature dependent viscous flow when the temperature equation has a nonlinear heat source term. When blow-up occurs we derive lower bounds for the blow-up time in each case. 相似文献
82.
This paper deals with a model of time-dependent double diffusive convection in Darcy flow. In particular it is concerned with the spatial decay of solutions when the flow is confined to a semi-infinite cylinder. Decay bounds for an energy expression are derived. 相似文献
83.
小长径比垂直管气液两相流动特性分析 总被引:1,自引:0,他引:1
实验观察了小长径比垂直上流管内流型及特点,并对管入口处的压力波动特性和系统的压差波动特性进行了试验研究.结果表明:小长径比(L/D)垂直管内流型表现为泡状流、塞状流、乳沫状流、环状流和液束环状流;分别增加管线中的气量、液量,或者同时增加气液流量,均会造成垂直管入口处压力波动的均值和最大压力的增加;压力信号的概率密度(PDF)大部分呈双峰分布,也存在单峰和多峰分布;差压信号的概率密度符合正态分布,其功率谱密度同压力信号相比具有频率波动范围宽、幅值小的特点. 相似文献
84.
Tatsien LI 《数学年刊B辑(英文版)》2007,28(3):265-282
In this paper, the authors consider the inverse piston problem for the system of one-dimensional isentropic flow and obtain that, under suitable conditions, the piston velocity can be uniquely determined by the initial state of the gas on the right side of the piston and the position of the forward shock. 相似文献
85.
Based on the matrix-analytic approach to fluid flows initiated by Ramaswami, we develop an efficient time dependent analysis
for a general Markov modulated fluid flow model with a finite buffer and an arbitrary initial fluid level at time 0. We also
apply this to an insurance risk model with a dividend barrier and a general Markovian arrival process of claims with possible
dependencies in successive inter-claim intervals and in claim sizes. We demonstrate the implementability and accuracy of our
algorithms through a set of numerical examples that could also serve as test cases for comparing other solution approaches.
相似文献
86.
Mark A. S. Aarons 《Calculus of Variations and Partial Differential Equations》2006,25(2):205-246
We study the forced mean curvature flow of graphs in Minkowski space and prove longtime existence of solutions. When the forcing
term is a constant, we prove convergence to either a constant mean curvature hypersurface or a translating soliton – depending
on the boundary conditions at infinity.
It is a pleasure to thank my PhD advisors Klaus Ecker and Gerhard Huisken for their assistance and encouragement. I also thank
Maria Athanassenas, Oliver Schnürrer and Marty Ross for their interest and useful comments, and the Max Planck Gesellschaft
for financial support. 相似文献
87.
本文使用详细的化学反应机理模拟了C2H6/O2/N2/AR层流对冲扩散火焰中多环芳烃的生成动力学过程。反应机理包括96种组分的502个基元反应。通过数值计算分析了层流对冲火焰的结构和主要反应物、中间物质和反应产物的浓度变化,并与相关文献的实验结果进行了比较。结果表明,数值模拟在燃烧过程和PAH生成规律上与实验结果是一致的,但在某些组分的定量预报上存在一定的差别。 相似文献
88.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
89.
A control volume type numerical methodology for the analysis of steady three‐dimensional rotating flows with heat transfer, in both laminar and turbulent conditions, is implemented and experimentally tested. Non‐axisymmetric momentum and heat transfer phenomena are allowed for. Turbulent transport is alternatively represented through three existing versions of the k–ε model that were adjusted to take into account the turbulence anisotropy promoted by rotation, streamline curvature and thermal buoyancy. Their relative performance is evaluated by comparison of calculated local and global heat balances with those obtained through measurements in a laboratory device. A modified version of the Lam and Bremhorst, low Reynolds number model is seen to give the best results. A preliminary analysis focused on the flow structure and the transfer of heat is reported. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
90.
Online weighted flow time and deadline scheduling 总被引:1,自引:0,他引:1
Luca Becchetti Stefano Leonardi Alberto Marchetti-Spaccamela Kirk Pruhs 《Journal of Discrete Algorithms》2006,4(3):339
In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|ri,pmtn|∑wiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling. 相似文献