全文获取类型
收费全文 | 4570篇 |
免费 | 315篇 |
国内免费 | 277篇 |
专业分类
化学 | 302篇 |
晶体学 | 9篇 |
力学 | 129篇 |
综合类 | 58篇 |
数学 | 1296篇 |
物理学 | 737篇 |
综合类 | 2631篇 |
出版年
2024年 | 16篇 |
2023年 | 65篇 |
2022年 | 85篇 |
2021年 | 99篇 |
2020年 | 104篇 |
2019年 | 99篇 |
2018年 | 119篇 |
2017年 | 126篇 |
2016年 | 156篇 |
2015年 | 141篇 |
2014年 | 278篇 |
2013年 | 241篇 |
2012年 | 249篇 |
2011年 | 241篇 |
2010年 | 213篇 |
2009年 | 259篇 |
2008年 | 267篇 |
2007年 | 265篇 |
2006年 | 258篇 |
2005年 | 239篇 |
2004年 | 241篇 |
2003年 | 191篇 |
2002年 | 167篇 |
2001年 | 154篇 |
2000年 | 139篇 |
1999年 | 127篇 |
1998年 | 109篇 |
1997年 | 75篇 |
1996年 | 56篇 |
1995年 | 52篇 |
1994年 | 51篇 |
1993年 | 46篇 |
1992年 | 36篇 |
1991年 | 47篇 |
1990年 | 28篇 |
1989年 | 17篇 |
1988年 | 26篇 |
1987年 | 19篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 11篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1955年 | 3篇 |
1936年 | 1篇 |
排序方式: 共有5162条查询结果,搜索用时 28 毫秒
11.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
12.
借助基团体积的贡献值和分子中各原子的支化度,写出分子的距离矩阵Di,由Di构建新拓扑指数五zi=ln(λmax λmid);同时,引进分子的结构描述符Qc、有机性无机性比值OI,用多元线性回归关联脂肪醇的-lgS。-lgKow,RI,复相关系数均在0.99以上。 相似文献
13.
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. 相似文献
14.
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. 相似文献
15.
本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力.利用该算法在对模型的参数进行重估计时.涉及到复杂的目标函数的梯度运算.击运用矩阵运算使得梯度运算变得简单明了,因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明. 相似文献
16.
17.
1 工作原理及电路组成图给出电路原理框图.以工作发射频率为时钟脉冲,调制脉冲作为闸门开启时间,将调制脉冲予以延迟作为接收信号的选通脉冲来关闭闸门,这个时间就是声脉冲从换能器发射到采样点,再回到接收换能器所经过的时间,用这个时间来控制时钟脉冲予以汁数、寄存、译码,以数字形 相似文献
18.
19.
Hui Ping Zhang 《数学学报(英文版)》2006,22(3):945-950
In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard
Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces.
Supported by NSFC 10501052 相似文献
20.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献