全文获取类型
收费全文 | 3870篇 |
免费 | 99篇 |
国内免费 | 13篇 |
专业分类
化学 | 2535篇 |
晶体学 | 31篇 |
力学 | 133篇 |
数学 | 532篇 |
物理学 | 751篇 |
出版年
2023年 | 31篇 |
2022年 | 115篇 |
2021年 | 111篇 |
2020年 | 83篇 |
2019年 | 101篇 |
2018年 | 80篇 |
2017年 | 85篇 |
2016年 | 148篇 |
2015年 | 119篇 |
2014年 | 134篇 |
2013年 | 269篇 |
2012年 | 261篇 |
2011年 | 306篇 |
2010年 | 216篇 |
2009年 | 216篇 |
2008年 | 268篇 |
2007年 | 226篇 |
2006年 | 171篇 |
2005年 | 155篇 |
2004年 | 125篇 |
2003年 | 101篇 |
2002年 | 105篇 |
2001年 | 55篇 |
2000年 | 52篇 |
1999年 | 49篇 |
1998年 | 34篇 |
1997年 | 35篇 |
1996年 | 34篇 |
1995年 | 18篇 |
1994年 | 22篇 |
1993年 | 16篇 |
1992年 | 23篇 |
1991年 | 17篇 |
1990年 | 29篇 |
1989年 | 15篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 19篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1976年 | 6篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 6篇 |
1971年 | 5篇 |
排序方式: 共有3982条查询结果,搜索用时 15 毫秒
1.
2.
3.
Application of TiO2-nanotubes/PbO2 as an anode for the electrochemical elimination of Acid Red 1 dye
Santos José Eudes L. de Moura Dayanne Chianca da Silva Djalma Ribeiro Panizza Marco Martínez-Huitle Carlos A. 《Journal of Solid State Electrochemistry》2019,23(2):351-360
Journal of Solid State Electrochemistry - In this study, galvanostatic electrolysis, through the use of the platinum supported on Ti (Ti/Pt) and Ti/TiO2-nanotubes/PbO2 anodes, was conducted in an... 相似文献
4.
5.
Tatiana Monaretto Andre Souza Tiago Bueno Moraes Victor Bertucci-Neto Corinne Rondeau-Mouro Luiz Alberto Colnago 《Magnetic resonance in chemistry : MRC》2019,57(9):616-625
The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T1) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T1 signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T1, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T1 method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples. 相似文献
6.
The interferometric intensity patterns from a 2D shearing interferometer are shown and discussed. The intensity patterns can be obtained in two different approaches incorporating differential and extended wavefront controlled displacements. The reliable directional sensitivity of this interferometer allows the optimization of the measurement parameters to estimate the wavefront of the intensity patterns by regularization techniques. 相似文献
7.
Marcelo Queiroz Joaquim Jú dice Carlos Humes Jr.. 《Mathematics of Computation》2004,73(248):1849-1863
In this paper the Eigenvalue Complementarity Problem (EiCP) with real symmetric matrices is addressed. It is shown that the symmetric (EiCP) is equivalent to finding an equilibrium solution of a differentiable optimization problem in a compact set. A necessary and sufficient condition for solvability is obtained which, when verified, gives a convenient starting point for any gradient-ascent local optimization method to converge to a solution of the (EiCP). It is further shown that similar results apply to the Symmetric Generalized Eigenvalue Complementarity Problem (GEiCP). Computational tests show that these reformulations improve the speed and robustness of the solution methods.
8.
Affine Arithmetic: Concepts and Applications 总被引:2,自引:0,他引:2
Affine arithmetic is a model for self-validated numerical computation that keeps track of first-order correlations between computed and input quantities. We explain the main concepts in affine arithmetic and how it handles the dependency problem in standard interval arithmetic. We also describe some of its applications. 相似文献
9.
Marcelo Do Amaral Steven Van Es Jos M. Asua 《Journal of polymer science. Part A, Polymer chemistry》2004,42(16):3936-3946
The production of high‐solid‐content, low‐viscosity latexes is an active field in both industry and academia. The viscosity of polymer dispersions has a clear dependence on the particle size distribution (PSD). An example is the rule of thumb that a bimodal PSD enables the reduction of the viscosity with respect to monomodal systems. Despite important progress in theoretical work, not much has been done to quantitatively predict the low shear viscosity of aqueous polymer dispersions as a function of the complex PSD. In this work, the capability of a low‐shear‐viscosity equation to quantitatively account for the influence of both the PSD and the physicochemical characteristics of the dispersions is experimentally assessed. An analysis, consistent with theoretical concepts, of the data with semiempirical correlations is proposed. Next, with values of the parameters of the viscosity equation obtained experimentally, the effect of a latex with a 70% solid content on the low shear viscosity is examined. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 3936–3946, 2004 相似文献
10.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献