首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   15篇
  免费   2篇
  国内免费   2篇
化学   3篇
综合类   1篇
数学   6篇
物理学   9篇
  2022年   2篇
  2021年   2篇
  2014年   1篇
  2012年   1篇
  2008年   6篇
  2007年   1篇
  2005年   2篇
  2004年   1篇
  1999年   1篇
  1996年   1篇
  1988年   1篇
排序方式: 共有19条查询结果,搜索用时 31 毫秒
1.
论中国海洋砂矿床类型   总被引:1,自引:0,他引:1  
本文总结了作者二十多年砂矿工作的经验,搜集了国内近三百处海洋砂矿床(点)五十余种矿床类型划分的资料,比照国外同类型矿床,结合我国矿床特征,提出了新的海洋砂矿分类原则,矿床工业类型、成因-形态类型、成矿时代类型和保存类型等的划分系统,以及今后的找矿方向。  相似文献   
2.
分子构象的聚类是搜索分子动力学模拟轨迹中代表构象的主要方法。 它是分析复杂构象改变或分子间相互作用机制的关键步骤. 作为一种基于密度的聚类算法,密度峰值搜索算法因其聚类的准确度而被应用于分子聚类过程中. 但随着模拟时长的增长,密度峰值搜索算法较低的计算效率限制了其应用的可能. 本文提出K-means密度峰值搜索算法的聚类算法,它是密度峰值搜索算法在计算效率方面的一个扩展版本,用于解决密度峰值搜索算法中巨大的资源消耗问题. 在K-means密度峰值搜索算法中,首先,通过高效的聚类算法(例如K-means)进行初始聚类,得到的聚类中心被定义为具有权重的典型点. 然后,对加权的典型点通过密度峰值搜索算法实现二次聚类,并细化点为核心点、边界点、加细光晕点. 在与密度峰值搜索算法具有相似的精度的同时,计算复杂度由O(n2)降至O(n). 通过二面角,二级结构,关联图描述的分子构象,将KFDP用于多个模拟轨迹的聚类过程中. 并通过与K-means聚类算法,DBSCAN聚类算法的比较结果,验证了K-means密度峰值搜索算法的优势.  相似文献   
3.
New data for the diffractive reaction p+N→ [Σ0 K +] +N at E p= 70 GeV were obtained with partially upgraded SPHINX setup. The data are in a good agreement with the results of our previous study of this reaction. In the mass spectrum M0 K +) a structure at the threshold region with a mass ∼1810 MeV and a distinct X(2000) peak with M= 1989 ± 6 MeV and γ= 91 ± 20 MeV are observed. Unusual features of the massive X(2000) state (narrow decay width, anomalously large branching ratio for the decay channel with strange particle emission) make it a serious candidate for cryptoexotic pentaquark baryon with hidden strangeness |qqqsˉs>. We also present new results on the narrow threshold structure X(1810) with M= 1807 ± 7 MeV and γ= 62 ± 19 MeV which is produced in the region of very small P 2 T < 0.01 GeV2. The possibility of the Coulomb production mechanism for X(1810) is discussed. Received: 28 April 1999  相似文献   
4.
The installation of the BESⅢ RPC system has been completed.Cosmic ray test results show that they perform very well in streamer mode and meet the BESⅢ requirements.We have tested several RPCs in the avalanche mode with the addition of extra SF6 in the gas mixture.We find an efficiency plateau that reaches~95%.and a time resolution of 1.8 ns.This demonstrates that the BESⅢ-type RPC can work in the avalanche mode as well.  相似文献   
5.
Using the isospin- and momentum-dependent hadronic transport model IBUU04, we have in-vestigated the influence of the entrance-channel isospin asymmetry on the sensitivity of the pre-equilibrium neutron/proton ratio to symmetry energy in central heavy-ion collisions induced by high-energy radioactive beams. Our analysis and discussion are based on the dynamical simulations of the three isotopic reaction systems 132Sn+124Sn, 124Sn+112Sn and 112Sn+112Sn which are of the same total proton number but different isospin asymmetry. We find that the kinetic-energy distributions of the pre-equilibrium neutron/proton ratio are quite sensitive to the density-dependence of symmetry energy at incident beam energy E/A = 400 MeV,and the sensitivity increases as the isospin asymmetry of the reaction system increases.  相似文献   
6.
7.
Performing cluster analysis on molecular conformation is an important way to find the representative conformation in the molecular dynamics trajectories. Usually, it is a critical step for interpreting complex conformational changes or interaction mechanisms. As one of the density-based clustering algorithms, find density peaks (FDP) is an accurate and reasonable candidate for the molecular conformation clustering. However, facing the rapidly increasing simulation length due to the increase in computing power, the low computing efficiency of FDP limits its application potential. Here we propose a marginal extension to FDP named K-means find density peaks (KFDP) to solve the mass source consuming problem. In KFDP, the points are initially clustered by a high efficiency clustering algorithm, such as K-means. Cluster centers are defined as typical points with a weight which represents the cluster size. Then, the weighted typical points are clustered again by FDP, and then are refined as core, boundary, and redefined halo points. In this way, KFDP has comparable accuracy as FDP but its computational complexity is reduced from O\begin{document}$(n^2)$\end{document} to O\begin{document}$(n)$\end{document}. We apply and test our KFDP method to the trajectory data of multiple small proteins in terms of torsion angle, secondary structure or contact map. The comparing results with K-means and density-based spatial clustering of applications with noise show the validation of the proposed KFDP.  相似文献   
8.
In the present paper, we find that the Bemstein-Durrmeyer operators, besides their better applications in approximation theory and some other fields, are good tools in constructing translation network. With the help of the de la Vallee properties of the Bernstein-Durrmeyer operators a sequence of translation network operators is constructed and its degree of approximation is dealt.  相似文献   
9.
We give the formulas of two-pion Hanbury-Brown-Twiss (HBT) correlation function for a partially coherent evolution pion-emitting source,using quantum probability amplitudes in a path-integral formalism.The multiple scattering of the particles in the source is taken into consideration based on Glauber scattering theory.Two-pion interferometry with effects of the multiple scattering and source collective expansion is examined for a partially coherent source of hadronic gas with a finite baryon density and evolving hydrodynamically.We do not find observable effect of either the multiple scattering or the source collective expansion on HBT chaotic parameter.  相似文献   
10.
粗粒化模型通过简化原子性质以及原子间的相互作用实现生物大分子长时间尺度的分子动力学模拟. 深度学习通过模拟人类的认知过程实现海量数据的准确分类和回归过程. 本论文将这两种技术进行融合,利用基于深度学习的粗粒化分子动力学模拟技术研究分子在不同状态之间的变化过程,并提出基于TorchMD的分子动力学模拟的分析框架. 在本工作中,MFDP聚类算法被用于在三维的CV变量空间中进行聚类,并确定分子的若干主要状态,在完成聚类的同时,给出各类中的代表分子构象,并给出类之间的分子构象. 这为后续利用String算法分析分子在不同状态间的转换路径打下基础. 通过String算法,迭代搜索得到分子在不同状态之间的变化路径以及对应的势能变化曲线. 通过与已有文献的结果进行对比,验证了基于TorchMD的粗粒化分子动力学模拟的理论框架可以在相对较短的时间尺度里研究分子的变化过程.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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