首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2068篇
  免费   178篇
  国内免费   42篇
化学   247篇
晶体学   10篇
力学   198篇
综合类   54篇
数学   564篇
物理学   1215篇
  2024年   26篇
  2023年   52篇
  2022年   101篇
  2021年   70篇
  2020年   74篇
  2019年   52篇
  2018年   61篇
  2017年   82篇
  2016年   80篇
  2015年   75篇
  2014年   139篇
  2013年   155篇
  2012年   87篇
  2011年   132篇
  2010年   130篇
  2009年   107篇
  2008年   123篇
  2007年   104篇
  2006年   79篇
  2005年   77篇
  2004年   48篇
  2003年   60篇
  2002年   49篇
  2001年   51篇
  2000年   24篇
  1999年   32篇
  1998年   30篇
  1997年   20篇
  1996年   16篇
  1995年   18篇
  1994年   20篇
  1993年   16篇
  1992年   14篇
  1991年   14篇
  1990年   5篇
  1989年   7篇
  1988年   6篇
  1987年   3篇
  1986年   7篇
  1985年   3篇
  1984年   4篇
  1982年   4篇
  1981年   3篇
  1980年   2篇
  1979年   4篇
  1978年   3篇
  1977年   4篇
  1976年   6篇
  1975年   2篇
  1974年   3篇
排序方式: 共有2288条查询结果,搜索用时 15 毫秒
91.
92.
    
Both compressible and incompressible Navier-Stokes solvers can be used and are used to solve incompressible turbulent flow problems. In the compressible case, the Mach number is then considered as a solver parameter that is set to a small value, M ≈0.1, in order to mimic incompressible flows. This strategy is widely used for high-order discontinuous Galerkin (DG) discretizations of the compressible Navier-Stokes equations. The present work raises the question regarding the computational efficiency of compressible DG solvers as compared to an incompressible formulation. Our contributions to the state of the art are twofold: Firstly, we present a high-performance DG solver for the compressible Navier-Stokes equations based on a highly efficient matrix-free implementation that targets modern cache-based multicore architectures with Flop/Byte ratios significantly larger than 1. The performance results presented in this work focus on the node-level performance, and our results suggest that there is great potential for further performance improvements for current state-of-the-art DG implementations of the compressible Navier-Stokes equations. Secondly, this compressible Navier-Stokes solver is put into perspective by comparing it to an incompressible DG solver that uses the same matrix-free implementation. We discuss algorithmic differences between both solution strategies and present an in-depth numerical investigation of the performance. The considered benchmark test cases are the three-dimensional Taylor-Green vortex problem as a representative of transitional flows and the turbulent channel flow problem as a representative of wall-bounded turbulent flows. The results indicate a clear performance advantage of the incompressible formulation over the compressible one.  相似文献   
93.
    
The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high-throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.  相似文献   
94.
95.
理论研究了在蝴蝶型纳米结构下运用多周期极化门方案驱动He原子输出高次谐波以及阿秒脉冲的特点.结果表明,由于纳米结构表面的等离子共振增强现象,谐波截止能量得到延伸.同时,由于激光场呈现空间非均匀性,长量子路径对谐波的贡献被减弱.并且,在极化门控制下,谐波平台区的贡献只来源于单一的谐波辐射能量峰,进而形成一个147 eV的超长平台区.最后,通过叠加平台区的谐波,可获得一个持续时间在30 as的超短脉冲.  相似文献   
96.
    
Recent advance in high performance computing (HPC) resources has opened the possibility to expand the scope of density functional theory (DFT) simulations toward large and complex molecular systems. This work proposes a numerically robust method that enables scalable diagonalizations of large DFT Hamiltonian matrices, particularly with thousands of computing CPUs (cores) that are usual these days in terms of sizes of HPC resources. The well‐known Lanczos method is extensively refactorized to overcome its weakness for evaluation of multiple degenerate eigenpairs that is the substance of DFT simulations, where a multilevel parallelization is adopted for scalable simulations in as many cores as possible. With solid benchmark tests for realistic molecular systems, the fidelity of our method are validated against the locally optimal block preconditioned conjugated gradient (LOBPCG) method that is widely used to simulate electronic structures. Our method may waste computing resources for simulations of molecules whose degeneracy cannot be reasonably estimated. But, compared to LOBPCG method, it is fairly excellent in perspectives of both speed and scalability, and particularly has remarkably less (< 10%) sensitivity of performance to the random nature of initial basis vectors. As a promising candidate for solving electronic structures of highly degenerate systems, the proposed method can make a meaningful contribution to migrating DFT simulations toward extremely large computing environments that normally have more than several tens of thousands of computing cores.  相似文献   
97.
    
《Electroanalysis》2018,30(3):426-435
Biocatalytic cascades involving more than one or two enzyme‐catalyzed step are inefficient inside alginate hydrogel prepared on an electrode surface. The problem originates from slow diffusion of intermediate products through the hydrogel from one enzyme to another. However, enzyme activity can be improved by surface immobilization. We demonstrate that a complex cascade of four consecutive biocatalytic reactions can be designed, with the enzymes immobilized in an LBL‐assembled polymeric layer at the alginate‐modified electrode surface. The product, hydrogen peroxide, then induces dissolution of iron‐cross‐linked alginate, which results in release process of entrapped biomolecular species, here fluorescently marked oligonucleotides, denoted F‐DNA. The enzymatic cascade can be viewed as a biocomputing network of concatenated AND gates, activated by combinations of four chemical input signals, which trigger the release of F‐DNA. The reactions, and diffusion/release processes were investigated by means of theoretical modeling. A bottleneck reaction step associated with one of the enzymes was observed. The developed system provides a model for biochemical actuation triggered by a biocomputing network of reactions.  相似文献   
98.
    
We evaluated the effects of three instructional interventions designed to support young children’s understanding of area measurement as a structuring process. Replicating microgenetic procedures we used in previous research with older children to ascertain whether we can build these competencies earlier, we also extended the previous focus on correctness to include analyses of children’s use of procedural and conceptual knowledge and examined individual differences in strategy shifts before and after transitions, enabling a more detailed examination of the hypothesized necessity of development through each level of a learning trajectory. The two experimental interventions focused on a dynamic conception of area measurement while also emphasizing unit concepts, such as unit identification, iteration, and composition. The findings confirm and extend earlier results that seeing a complete record of the structure of the 2D array—in the form of a drawing of organized rows and columns—supported children’s spatial structuring and performance.  相似文献   
99.
采用空间谱加权稀疏约束的稳健Capon波束形成方法   总被引:1,自引:0,他引:1       下载免费PDF全文
针对标准Capon波束形成器旁瓣级高以及期望信号方向存在误差时,性能会严重下降的问题,提出一种基于噪声及干扰空间谱加权的稀疏约束Capon波束形成方法。该方法利用波束响应本身具有的稀疏特性,以及在稀疏重构算法中l1范数具有抑制较大值保护较小值的特性,使用噪声及干扰的空间谱对不同角度的波束响应进行加权,然后施以稀疏约束。仿真、水池试验与湖上试验中,与其它几种方法比较表明该方法可以降低波束形成器的旁瓣级,获得较深的零陷,提高了阵列输出信干噪比与抗导向向量误差的能力。  相似文献   
100.
彭浩  单鸣雷  朱昌平  姚澄 《计算物理》2018,35(5):554-562
格子Boltzmann方法伪势模型算法中的格点间计算未完全局部化,因此在并行计算时需要更多次的全局内存读写、使用更多数量的寄存器和线程同步操作,从而导致GPU并行计算效率下降.本文针对伪势模型并行计算的局限性,基于三维十五速格子结构的多松弛时间伪势模型,以气液相分离为算例,通过合并访问的方式提高全局内存的读写效率;并提出一种\"定向转移\"算法,提高格子边界格点获取邻居格点数据的效率;最后探索不同资源分配中各种因素对计算效率的影响,总结最优资源分配的方法.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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