首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1611篇
  免费   353篇
  国内免费   92篇
数理化   2056篇
  2024年   2篇
  2023年   11篇
  2022年   40篇
  2021年   45篇
  2020年   57篇
  2019年   55篇
  2018年   52篇
  2017年   86篇
  2016年   85篇
  2015年   70篇
  2014年   122篇
  2013年   111篇
  2012年   88篇
  2011年   113篇
  2010年   109篇
  2009年   137篇
  2008年   115篇
  2007年   123篇
  2006年   126篇
  2005年   73篇
  2004年   58篇
  2003年   53篇
  2002年   51篇
  2001年   44篇
  2000年   35篇
  1999年   34篇
  1998年   29篇
  1997年   27篇
  1996年   32篇
  1995年   23篇
  1994年   8篇
  1993年   4篇
  1992年   3篇
  1991年   7篇
  1990年   3篇
  1989年   2篇
  1988年   4篇
  1987年   1篇
  1986年   1篇
  1985年   1篇
  1984年   3篇
  1983年   1篇
  1982年   4篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1957年   2篇
排序方式: 共有2056条查询结果,搜索用时 15 毫秒
1.
低维硅锗材料是制备纳米电子器件的重要候选材料,是研发高效率、低能耗和超高速新一代纳米电子器件的基础材料之一,有着潜在的应用价值。采用密度泛函紧束缚方法分别对厚度相同、宽度在0.272 nm~0.554 nm之间的硅纳米线和宽度在0.283 nm~0.567 nm之间的锗纳米线的原子排布和电荷分布进行了计算研究。硅、锗纳米线宽度的改变使原子排布,纳米线的原子间键长和键角发生明显改变。纳米线表层结构的改变对各层内的电荷分布产生重要影响。纳米线中各原子的电荷转移量与该原子在表层内的位置相关。纳米线的尺寸和表层内原子排列结构对体系的稳定性产生重要影响。  相似文献   
2.
正交匹配追踪(Orthogonal Matching Pursuit, OMP)算法是一种重要的压缩感知重构算法. OMP算法在每次迭代中选择与当前残差最相关的原子. 针对每次迭代需要重新计算残差的问题, 本文考虑偶数次迭代下残差未知的情况. 首先, 研究了奇数次迭代的残差与下一次迭代的残差之间的关系, 得到了一种偶数次迭代时选择原子的标准. 然后, 引入一种回溯机制来处理前面所得的迭代结果, 这种机制通过剔除其中多余的原子来实现精确重建. 据此, 提出了可减少计算残差的改进型正交匹配追踪算法.  相似文献   
3.
Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls.  相似文献   
4.
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.  相似文献   
5.
In this article, a new framework to design high-order approximations in the context of node-centered finite volumes on simplicial meshes is proposed. The major novelty of this method is that it relies on very simple and compact differential operators, which is a critical point to achieve good performances in the High-performance computing context. This method is based on deconvolution between nodal and volume-average values, which can be conducted to any order. The interest of the new method is illustrated through three different applications: mesh-to-mesh interpolation, levelset curvature computation, and numerical scheme for convection. Higher order can also be achieved within the present framework by introducing high-rank tensors. Although these tensors feature much symmetries, their manipulation can quickly become an overwhelming task. For this reason and without loss of generality, the present articles are limited to third-order expansion. This method, although tightly connected to the k-exact schemes theory, does not rely on successive corrections: the high-order property is obtained in a single operation, which makes them more attractive in terms of performances.  相似文献   
6.
This article presents an improved fifth-order finite difference weighted essentially nonoscillatory (WENO) scheme to solve Hamilton-Jacobi equations. A new type of nonlinear weights is introduced with the construction of local smoothness indicators on each local stencil that are measured with the help of generalized undivided differences in L1-norm. A novel global smoothness measurement is also constructed with the help of local measurements from its linear combination. Numerical experiments are conducted in one- and two-dimensions to demonstrate the performance enhancement, resolution power, numerical accuracy for the proposed scheme, and compared it with the classical WENO scheme.  相似文献   
7.
A discontinuous Galerkin method by patch reconstruction is proposed for Stokes flows. A locally divergence-free reconstruction space is employed as the approximation space, and the interior penalty method is adopted which imposes the normal component penalty terms to cancel out the pressure term. Consequently, the Stokes equation can be solved as an elliptic system instead of a saddle-point problem due to such weak form. The number of degree of freedoms of our method is the same as the number of elements in the mesh for different order of accuracy. The error estimations of the proposed method are given in a classical style, which are then verified by some numerical examples.  相似文献   
8.
为了提高三阶WENO-Z格式在极值点处的计算精度,通过理论推导给出三阶WENO格式满足收敛精度的充分条件。采用泰勒级数展开的方式,推导给出所构造格式非线性权重的计算公式,并综合权衡计算精度和计算稳定性确定所构造格式的参数。通过两个典型的精度测试,验证了改进格式在光滑流场极值点区域逼近三阶精度。进一步选用激波与熵波相互作用和Richtmyer-Meshkov不稳定性等经典算例,证实了本文提出的改进格式WENO-PZ3相较其他格式(WENO-JS3和WENO-Z3)不仅具有较高的精度,而且降低了格式的耗散,提高了对流场结构的分辨率。  相似文献   
9.
The recovery of 3D left ventricle(LV) shape using 2D echocardiography is very attractable topic in the field of ultrasound imaging. In this paper, we propose a mathematical model to determine the 3D position of LV contours extracted from multiple 2D echocardiography images. We formulate the proposed model as a non-convex constrained minimization problem. To solve it, we propose a proximal alternating minimization algorithm with a solver OPTI for quadratically constrained quadratic program. For validating the proposed model, numerical experiments are performed with real ultrasound data. The experimental results show that the proposed model is promising and available for real echocardiography data.  相似文献   
10.
选择绕圆柱预混燃烧算例,验证CH4/空气三种简化动力学机理(16s41r、15s19r和53s325r).考虑均匀来流,忽略湍流和湍流与燃烧相互作用以及燃料扩散效应,假设层流有限反应速率,采用保自由流5阶WENO格式求解多组分Euler方程组,得到CH4/空气预混燃烧流场温度等值线、沿驻点线压力和温度及其CH4、CO和CO2质量百分数分布.结果表明:三种简化动力学机理给出的流场均出现弓形激波和火焰面,弓形激波和火焰驻点距离及其形状、诱导区宽度和简化动力学机理相关.当圆柱直径增大,弓形激波和火焰向圆柱上游移动,对应的驻点距离均增大,诱导区宽度变短,点火延时变小,但火焰和弓形激波位置次序未变化.53s325r模型要比16s41r模型和15s19r模型精度要高,点火延时覆盖的压力和温度范围也较宽,所有简化机理均未完全反应,在较大圆柱直径下游达到化学平衡.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号