全文获取类型
收费全文 | 3943篇 |
免费 | 612篇 |
国内免费 | 324篇 |
专业分类
化学 | 1115篇 |
晶体学 | 21篇 |
力学 | 437篇 |
综合类 | 59篇 |
数学 | 2314篇 |
物理学 | 933篇 |
出版年
2024年 | 8篇 |
2023年 | 40篇 |
2022年 | 84篇 |
2021年 | 97篇 |
2020年 | 114篇 |
2019年 | 120篇 |
2018年 | 136篇 |
2017年 | 185篇 |
2016年 | 167篇 |
2015年 | 143篇 |
2014年 | 225篇 |
2013年 | 398篇 |
2012年 | 193篇 |
2011年 | 186篇 |
2010年 | 203篇 |
2009年 | 229篇 |
2008年 | 231篇 |
2007年 | 240篇 |
2006年 | 231篇 |
2005年 | 217篇 |
2004年 | 171篇 |
2003年 | 146篇 |
2002年 | 169篇 |
2001年 | 145篇 |
2000年 | 129篇 |
1999年 | 106篇 |
1998年 | 99篇 |
1997年 | 91篇 |
1996年 | 63篇 |
1995年 | 47篇 |
1994年 | 48篇 |
1993年 | 25篇 |
1992年 | 25篇 |
1991年 | 24篇 |
1990年 | 17篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1971年 | 4篇 |
1959年 | 2篇 |
1936年 | 2篇 |
排序方式: 共有4879条查询结果,搜索用时 15 毫秒
271.
272.
Simon J. Holder Geraldine G. Durand Chert‐Tsun Yeoh Elodie Illi Nicholas J. Hardy Tim H. Richardson 《Journal of polymer science. Part A, Polymer chemistry》2008,46(23):7739-7756
A series of ABA amphiphilic triblock copolymers possessing polystyrene (PS) central hydrophobic blocks, one group with “short” PS blocks (DP = 54–86) and one with “long” PS blocks (DP = 183–204) were synthesized by atom transfer radical polymerization. The outer hydrophilic blocks were various lengths of poly(oligoethylene glycol methyl ether) methacrylate, a comb‐like polymer. The critical aggregation concentrations were recorded for certain block copolymer samples and were found to be in the range circa 10−9 mol L−1 for short PS blocks and circa 10−12 mol L−1 for long PS blocks. Dilute aqueous solutions were analyzed by transmission electron microscopy (TEM) and demonstrated that the short PS block copolymers formed spherical micelles and the long PS block copolymers formed predominantly spherical micelles with smaller proportions of cylindrical and Y‐branched cylindrical micelles. Dynamic light scattering analysis results agreed with the TEM observations demonstrating variations in micelle size with PS and POEGMA chain length: the hydrodynamic diameters (DH) of the shorter PS block copolymer micelles increased with increasing POEGMA block lengths while maintaining similar PS micellar core diameters (DC); in contrast the values of DH and DC for the longer PS block copolymer micelles decreased. Surface‐pressure isotherms were recorded for two of the samples and these indicated close packing of a short PS block copolymer at the air–water interface. The aggregate solutions were demonstrated to be stable over a 38‐day period with no change in aggregate size or noticeable precipitation. The cloud point temperatures of certain block copolymer aggregate solutions were measured and found to be in the range 76–93 °C; significantly these were ∼11 °C higher in temperature than those of POEGMA homopolymer samples with similar chain lengths. © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 7739–7756, 2008 相似文献
273.
In this paper, the locally conservative Galerkin (LCG) method (Numer. Heat Transfer B Fundam. 2004; 46 :357–370; Int. J. Numer. Methods Eng. 2007) has been extended to solve the incompressible Navier–Stokes equations. A new correction term is also incorporated to make the formulation to give identical results to that of the continuous Galerkin (CG) method. In addition to ensuring element‐by‐element conservation, the method also allows solution of the governing equations over individual elements, independent of the neighbouring elements. This is achieved within the CG framework by breaking the domain into elemental sub‐domains. Although this allows discontinuous trial function field, we have carried out the formulation using the continuous trial function space as the basis. Thus, the changes in the existing CFD codes are kept to a minimum. The edge fluxes, establishing the continuity between neighbouring elements, are calculated via a post‐processing step during the time‐stepping operation. Therefore, the employed formulation needs to be carried out using either a time‐stepping or an equivalent iterative scheme that allows post‐processing of fluxes. The time‐stepping algorithm employed in this paper is based on the characteristic‐based split (CBS) scheme. Both steady‐ and unsteady‐state examples presented show that the element‐by‐element formulation employed is accurate and robust. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
274.
Hua QIU Wei Yi SU 《数学学报(英文版)》2008,24(1):147-158
The distributional dimension of fractal sets in R^n has been systematically studied by Triebel by virtue of the theory of function spaces. In this paper, we first discuss some important properties about the B-type spaces and the F-type spaces on local fields, then we give the definition of the distributional dimension dimD in local fields and study the relations between distributional dimension and Hausdorff dimension. Moreover, the analysis expression of the Hausdorff dimension is given. Lastly, we define the Fourier dimension in local fields, and obtain the relations among all the three dimensions. Keywords local field, B-type space, F-type space, distributional dimension, Hausdorff dimension Fourier dimension 相似文献
275.
ZHANG Lixin 《中国科学A辑(英文版)》2001,44(5)
This paper is to prove that, if a one-dimensional random wa lkcan be approximated by a Brownian motion, then the related random walk in a g eneral independent scenery can be approximated by a Brownian motion in Brownian scenery. 相似文献
276.
本文研究了求解奇异非线性方程组的Levenberg-Marquardt方法的收敛性.利用选取新的迭代参数求解非线性方程组的L-M方法,获得点列的超线性收敛性和二阶收敛性,并把试验结果与文献[19,20]的结果进行了比较. 相似文献
277.
Marc Chardin Kamran Divaani-Aazar 《Proceedings of the American Mathematical Society》2008,136(8):2749-2754
We prove a duality theorem for graded algebras over a field that implies several known duality results: graded local duality, versions of Serre duality for local cohomology and of Suzuki duality for generalized local cohomology, and Herzog-Rahimi bigraded duality.
278.
We investigate the uniform convergence of the density of the empirical measure of an ergodic diffusion. It is known that under
certain conditions on the drift and diffusion coefficients of the diffusion, the empirical density f
t converges in probability to the invariant density f, uniformly on the entire real line. We show that under the same conditions, uniform convergence of f
t to f on compact intervals takes place almost surely. Moreover, we prove that under much milder conditions (the usual linear growth
condition on the drift and diffusion coefficients and a finite second moment of the invariant measure suffice), we have the
uniform convergence of f
t to f on compacta in probability.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
279.
The paper provides a combinatorial method to decide when the space of local systems with nonvanishing first cohomology on the complement to an arrangement of lines in a complex projective plane has as an irreducible component a subgroup of positive dimension. Partial classification of arrangements having such a component of positive dimension and a comparison theorem for cohomology of Orlik–Solomon algebra and cohomology of local systems are given. The methods are based on Vinberg–Kac classification of generalized Cartan matrices and study of pencils of algebraic curves defined by mentioned positive dimensional components. 相似文献
280.
Project Scheduling with Multiple Modes: A Genetic Algorithm 总被引:10,自引:0,他引:10
Sönke Hartmann 《Annals of Operations Research》2001,102(1-4):111-135
In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and makespan minimization as objective. We present a new genetic algorithm approach to solve this problem. The genetic encoding is based on a precedence feasible list of activities and a mode assignment. After defining the related crossover, mutation, and selection operators, we describe a local search extension which is employed to improve the schedules found by the basic genetic algorithm. Finally, we present the results of our thorough computational study. We determine the best among several different variants of our genetic algorithm and compare it to four other heuristics that have recently been proposed in the literature. The results that have been obtained using a standard set of instances show that the new genetic algorithm outperforms the other heuristic procedures with regard to a lower average deviation from the optimal makespan. 相似文献