全文获取类型
收费全文 | 3357篇 |
免费 | 470篇 |
国内免费 | 220篇 |
专业分类
化学 | 491篇 |
晶体学 | 29篇 |
力学 | 374篇 |
综合类 | 100篇 |
数学 | 1990篇 |
物理学 | 1063篇 |
出版年
2024年 | 7篇 |
2023年 | 47篇 |
2022年 | 74篇 |
2021年 | 82篇 |
2020年 | 95篇 |
2019年 | 92篇 |
2018年 | 82篇 |
2017年 | 138篇 |
2016年 | 159篇 |
2015年 | 125篇 |
2014年 | 216篇 |
2013年 | 261篇 |
2012年 | 157篇 |
2011年 | 183篇 |
2010年 | 148篇 |
2009年 | 198篇 |
2008年 | 213篇 |
2007年 | 228篇 |
2006年 | 215篇 |
2005年 | 197篇 |
2004年 | 146篇 |
2003年 | 119篇 |
2002年 | 119篇 |
2001年 | 116篇 |
2000年 | 114篇 |
1999年 | 91篇 |
1998年 | 67篇 |
1997年 | 73篇 |
1996年 | 62篇 |
1995年 | 36篇 |
1994年 | 23篇 |
1993年 | 26篇 |
1992年 | 19篇 |
1991年 | 12篇 |
1990年 | 17篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 13篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 14篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有4047条查询结果,搜索用时 31 毫秒
1.
2.
Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L9(34) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded. 相似文献
3.
4.
〈I〉型三角剖分下非张量积连续小波基的构造 总被引:1,自引:0,他引:1
多维非张量积小波是近年小波研究领域中的热点问题之一 ,它们与多维张量积小波相比具有更多的优势 .关于高维张量积、非张量积小波 ,目前已有一些很好的工作 (见文[2 ] [3 ] [4 ] ) ,但关于样条小波 ,还有许多问题有待于研究 .本文针对〈I〉型三角剖分下的二维线性元空间 ,讨论其具有紧支集和对称性的半正交样条小波基 .给定 x1 x2 平面上的〈I〉型三角剖分 (图 1 ( a)所示 ) ,记 j=( j1 ,j2 ) ,| j| =j1 + j2 ,πm= { 0≤ |j|≤ mCj1j2 xj11 xj22 ,Cj1,j2 是任意实数 }为次数不超过 m的代数多项式全体 .引入剖分尺度为 1的线性元空间 V0… 相似文献
5.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
6.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
7.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009 相似文献
8.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
9.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
10.
A group representation of radiation propagation in an anisotropic medium is developed. The system of wave equations for electromagnetic potentials, obtained from the Maxwell equations with account for the constitutive equations, has been factorized. It is shown that the linear differential operator of the factorized system is orthogonal in transparent crystals and unitary in gyrotropic ones and is represented through the momentum operator. On the basis of the commutation relations for the components of this operator, the eigenvalue problem has been solved and the expression for the change in the radiant energy in the crystal in the form of spherical waves has been obtained. The dependences of the ray and phase velocities and the polarization vectors of waves on the birefringence anisotropy and gyrotropy as well as on the angular momentum, displacement current, and bound charge determining them have been analyzed. It has been established that in the general case of gyrotropic crystals where the nonreciprocity phenomenon takes place and in magnetoelectrics Maxwell equations are represented in a form similar to the Dirac equations and the electromagnetic radiation is correctly described by means of bispinors and is quantized as fermions. 相似文献