全文获取类型
收费全文 | 152篇 |
免费 | 23篇 |
国内免费 | 10篇 |
专业分类
化学 | 11篇 |
力学 | 19篇 |
综合类 | 8篇 |
数学 | 49篇 |
物理学 | 98篇 |
出版年
2023年 | 1篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 10篇 |
2013年 | 8篇 |
2012年 | 6篇 |
2011年 | 12篇 |
2010年 | 11篇 |
2009年 | 12篇 |
2008年 | 14篇 |
2007年 | 15篇 |
2006年 | 12篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 1篇 |
2000年 | 8篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有185条查询结果,搜索用时 671 毫秒
1.
2.
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. 相似文献
3.
Tobias P. Kunzler Christoph M. Sprecher Nicholas D. Spencer 《Applied Surface Science》2006,253(4):2148-2153
Gradient surfaces allow rapid, high-throughput investigations and systematic studies in many disparate fields, including biology, tribology and adhesion. We describe a novel method for the fabrication of material-independent morphology gradients, involving a two-step process of particle erosion followed by a chemical polishing procedure that preferentially removes features with a small radius of curvature as a function of time. Gradients are fabricated on aluminium surfaces, but they may be readily transferred to other materials via a replication technique, which allows for the production of identical roughness gradient samples with any chosen surface chemistry. The gradients have been characterized by means of scanning electron microscopy and optical profilometry. Standard roughness parameters (Ra, Rq, Rz, Sm and Sk) were calculated from optical profilometry data. The roughness has also been assessed over different wavelength windows by means of a fast Fourier transformation approach. 相似文献
4.
5.
6.
Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequence-independent generation of protein dimer orientations by protein docking for use as scaffolds in protein sequence design algorithms. To dock monomers into sequence-independent dimer conformations, we use a reduced representation in which the side chains are approximated by spheres with atomic radii derived from known C2 symmetry-related homodimers. The interfaces of C2-related homodimers are usually more hydrophobic and protein core-like than the interfaces of heterodimers; we parameterize the radii for docking against this feature to capture and recreate the spatial characteristics of a hydrophobic interface. A fast Fourier transform-based geometric recognition algorithm is used for docking the reduced representation protein models. The resulting docking algorithm successfully predicted the wild-type homodimer orientations in 65 out of 121 dimer test cases. The success rate increases to approximately 70% for the subset of molecules with large surface area burial in the interface relative to their chain length. Forty-five of the predictions exhibited less than 1 A C(alpha) RMSD compared to the native X-ray structures. The reduced protein representation therefore appears to be a reasonable approximation and can be used to position protein backbones in plausible orientations for homodimer design. 相似文献
7.
陈宇龙 《数学的实践与认识》2014,(20)
为了更加精确的计算期权价格,将结合随机波动和跳扩散模型(以下简称SVJ模型)以更好的描述期权标的资产价格过程,然而这样的价格过程无法得到概率密度函数的封闭形式,而只能得到包含特殊函数和无限求和的复杂的表达式.不过它们的特征函数都是封闭且是唯一的,因而可以通过它们的特征函数,并运用两种傅立叶变换的方法来求出期权价格.其中FFT算法计算的结果将与Monte Carlo模拟得出的结果进行比较,然后再将SVJ模型的计算结果和Black-Scholes模型进行比较. 相似文献
8.
9.
基于傅里叶变换的高精度条纹细分方法 总被引:2,自引:1,他引:2
针对传统傅里叶变换法在提取条纹图相位中存在的能量泄漏问题,提出了条纹图整周期裁剪的方法,可有效抑制能量泄漏对检相精度的影响,提高傅里叶变换法相位计算的精度。在此基础上,提出了一种基于傅里叶变换时移特性的叠栅条纹细分新方法。与传统傅里叶变换法相比,该方法求取相邻两帧条纹图间的相移,只需经过两次傅里叶变换,不需要截取条纹图的基频再逆变换回空域,因此计算量至少减少了一倍,计算速度大大提高。数值计算结果表明,对两束单色平面波形成的条纹,理想条件下细分精度高达10-12量级;对高斯包络调制的条纹,细分精度至少可达10-3量级。 相似文献
10.
研究了基于InP基的In0.65Ga0.35As/In0.52Al0.48As赝型高迁移率晶体管材料中纵向磁电阻的Shubnikov-deHaas(SdH)振荡效应和霍耳效应,通过对纵向磁电阻SdH振荡的快速傅里叶变换分析,获得了各子带电子的浓度,并因此求得了各子带能级相对于费米能级的位置.联立求解Schrdinger方程和Poisson方程,自洽计算了样品的导带形状、载流子浓度分布以及各子带能级和费米能级位置.理论计算和实验结果很好符合.实验和理论计算均表明,势垒层的掺杂电子几乎全部转移到了量子阱中,转移率在95%以上. 相似文献