全文获取类型
收费全文 | 19053篇 |
免费 | 1579篇 |
国内免费 | 1090篇 |
专业分类
化学 | 2033篇 |
晶体学 | 25篇 |
力学 | 1157篇 |
综合类 | 372篇 |
数学 | 14501篇 |
物理学 | 3634篇 |
出版年
2024年 | 26篇 |
2023年 | 117篇 |
2022年 | 244篇 |
2021年 | 334篇 |
2020年 | 302篇 |
2019年 | 367篇 |
2018年 | 362篇 |
2017年 | 505篇 |
2016年 | 583篇 |
2015年 | 418篇 |
2014年 | 895篇 |
2013年 | 1212篇 |
2012年 | 1054篇 |
2011年 | 935篇 |
2010年 | 874篇 |
2009年 | 1133篇 |
2008年 | 1226篇 |
2007年 | 1265篇 |
2006年 | 1063篇 |
2005年 | 934篇 |
2004年 | 763篇 |
2003年 | 694篇 |
2002年 | 727篇 |
2001年 | 649篇 |
2000年 | 625篇 |
1999年 | 530篇 |
1998年 | 456篇 |
1997年 | 410篇 |
1996年 | 389篇 |
1995年 | 328篇 |
1994年 | 259篇 |
1993年 | 225篇 |
1992年 | 225篇 |
1991年 | 200篇 |
1990年 | 149篇 |
1989年 | 127篇 |
1988年 | 122篇 |
1987年 | 99篇 |
1986年 | 117篇 |
1985年 | 153篇 |
1984年 | 119篇 |
1983年 | 36篇 |
1982年 | 75篇 |
1981年 | 61篇 |
1980年 | 56篇 |
1979年 | 49篇 |
1978年 | 60篇 |
1977年 | 64篇 |
1976年 | 41篇 |
1975年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Fillmore在[1]中得到一个定理:设A,T是Banach空间X上的线性变换,A有界,若Lat(A) Lat(T)且AT=TA,则T是A的多项式.在本文里,以此作为引理,讨论了Banach空间上可逆线性变换A在什么情况下,A-1可表示为A的多项式.本文最主要的结论是定理3.4:设X是Banach空间,A是X上的有界线性变换,且可逆,则A-1是A的多项式当且仅当A-1是A的局部多项式. 相似文献
2.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
3.
在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能. 相似文献
4.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
5.
Kangseok Lee Sang Eun Shim Byung H. Lee Seong Uk Hong Soonja Choe 《Journal of Polymer Science.Polymer Physics》2004,42(6):1114-1126
The desorption behavior of a surfactant in a linear low‐density polyethylene (LLDPE) blend at elevated temperatures of 50, 70, and 80 °C was studied with Fourier transform infrared spectroscopy. The composition of the LLDPE blend was 70:30 LLDPE/low‐density polyethylene. Three different specimens (II, III, and IV) were prepared with various compositions of a small molecular penetrant, sorbitan palmitate (SPAN‐40), and a migration controller, poly(ethylene acrylic acid) (EAA), in the LLDPE blend. The calculated diffusion coefficient (D) of SPAN‐40 in specimens II, III, and IV, between 50 and 80 °C, varied from 1.74 × 10?11 to 6.79 × 10?11 cm2/s, from 1.10 × 10?11 to 5.75 × 10?11 cm2/s, and from 0.58 × 10?11 to 4.75 × 10?11 cm2/s, respectively. In addition, the calculated activation energies (ED) of specimens II, III, and IV, from the plotting of ln D versus 1/T between 50 and 80 °C, were 42.9, 52.7, and 65.6 kJ/mol, respectively. These values were different from those obtained between 25 and 50 °C and were believed to have been influenced by the interference of Tinuvin (a UV stabilizer) at elevated temperatures higher than 50 °C. Although the desorption rate of SPAN‐40 increased with the temperature and decreased with the EAA content, the observed spectral behavior did not depend on the temperature and time. For all specimens stored over 50 °C, the peak at 1739 cm?1 decreased in a few days and subsequently increased with a peak shift toward 1730 cm?1. This arose from the carbonyl stretching vibration of Tinuvin, possibly because of oxidation or degradation at elevated temperatures. In addition, the incorporation of EAA into the LLDPE blend suppressed the desorption rate of SPAN‐40 and retarded the appearance of the 1730 cm?1 peak. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 1114–1126, 2004 相似文献
6.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
7.
Let Cld
AW
(X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld
AW
(X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld
AW
(X) is homeomorphic to a Hilbert space with weight 2
w(X). 相似文献
8.
This paper presents an analysis of a portfolio model which can be used to assist a property-liability insurance company in determining the optimal composition of the insurance and investment portfolios. By introducing insurer's threshold risk and relaxing some non-realistic assumptions made in traditional chance constraint insurance and investment portfolio models, we propose a method for an insurer to maximize his return threshold for a given threshold risk level. This proposed model can be used to optimize the composition of underwriting and investment portfolios regarding the insurer's threshold risk level, as well as to generate the efficient frontier by adjusting insurer's threshold risk levels. A numerical example is given based on the industry's aggregated data for a sixteen year period. 相似文献
9.
Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
10.
Howard Jacobowitz Gerardo Mendoza 《Transactions of the American Mathematical Society》2003,355(10):4201-4222
We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.