全文获取类型
收费全文 | 359篇 |
免费 | 73篇 |
国内免费 | 7篇 |
专业分类
化学 | 102篇 |
力学 | 69篇 |
综合类 | 14篇 |
数学 | 102篇 |
物理学 | 152篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 42篇 |
2021年 | 26篇 |
2020年 | 14篇 |
2019年 | 12篇 |
2018年 | 5篇 |
2017年 | 13篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 36篇 |
2013年 | 26篇 |
2012年 | 25篇 |
2011年 | 19篇 |
2010年 | 13篇 |
2009年 | 25篇 |
2008年 | 13篇 |
2007年 | 11篇 |
2006年 | 9篇 |
2005年 | 13篇 |
2004年 | 7篇 |
2003年 | 11篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 11篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 9篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有439条查询结果,搜索用时 15 毫秒
61.
氮气加热器用于石化工业丙烯精制工程,给再生氮气加热.针对新疆独山子石化厂氮气加热器.利用LonWorks现场总线控制技术构成网络,采用前馈控制PID算法.通过周波调整法对电加热管的加热功率进行控制,在保证的规定时间内连续输出合乎温度要求的高温氮气.本控制网络的核心技术是神经元芯片(Neuron Chips)、智能网络节点和Lon Talk通信协议.本文介绍了LonWorks技术以及氮气加热控制系统总体方案与网络结构设计,节点模块设计与配置,控制电路设计,控制算法设计与软件编程. 相似文献
62.
63.
GLOBALSTRUCTURESOFTHEPLANECUBICSYSTEMWITHTHESTELLARNODEYangDianwu(杨殿武)(JinanUniversity,济南大学,邮编:250002)YaoWeihong(姚蔚红)(JinanEd... 相似文献
64.
In this paper we study the convergence of adaptive finite element methods for the gen- eral non-attine equivalent quadrilateral and hexahedral elements on 1-irregular meshes with hanging nodes. Based on several basic ingredients, such as quasi-orthogonality, estimator reduction and D6fler marking strategy, convergence of the adaptive finite element methods for the general second-order elliptic partial equations is proved. Our analysis is effective for all conforming Qm elements which covers both the two- and three-dimensional cases in a unified fashion. 相似文献
65.
在机场网络中单个机场节点的失效往往会对其他的节点产生影响,特别是关键节点的失效会波及整个网络.准确客观的识别重要节点机场关乎整个机场网络的安全运营.本文分析了机场网络拓扑特性中的度、集聚系数和接近度指标,考虑了机场旅客吞吐量和所在城市人口等交通经济特性指标,使用熵权法确定权重的基础上,应用TOPSIS法构建综合评价体系模型,最后以华东地区机场网络为例进行节点重要度排序.结果表明与单一指标的评估结果相比,该方法更加全面客观的确定不同属性指标的权重,避免了不同指标取值的差异性,使评价更加全面,更符合机场网络实际运营情况. 相似文献
66.
High‐order ADER‐WENO ALE schemes on unstructured triangular meshes—application of several node solvers to hydrodynamics and magnetohydrodynamics
下载免费PDF全文
![点击此处可从《国际流体数值方法杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper, we present a class of high‐order accurate cell‐centered arbitrary Lagrangian–Eulerian (ALE) one‐step ADER weighted essentially non‐oscillatory (WENO) finite volume schemes for the solution of nonlinear hyperbolic conservation laws on two‐dimensional unstructured triangular meshes. High order of accuracy in space is achieved by a WENO reconstruction algorithm, while a local space–time Galerkin predictor allows the schemes to be high order accurate also in time by using an element‐local weak formulation of the governing PDE on moving meshes. The mesh motion can be computed by choosing among three different node solvers, which are for the first time compared with each other in this article: the node velocity may be obtained either (i) as an arithmetic average among the states surrounding the node, as suggested by Cheng and Shu, or (ii) as a solution of multiple one‐dimensional half‐Riemann problems around a vertex, as suggested by Maire, or (iii) by solving approximately a multidimensional Riemann problem around each vertex of the mesh using the genuinely multidimensional Harten–Lax–van Leer Riemann solver recently proposed by Balsara et al. Once the vertex velocity and thus the new node location have been determined by the node solver, the local mesh motion is then constructed by straight edges connecting the vertex positions at the old time level tn with the new ones at the next time level tn + 1. If necessary, a rezoning step can be introduced here to overcome mesh tangling or highly deformed elements. The final ALE finite volume scheme is based directly on a space–time conservation formulation of the governing PDE system, which therefore makes an additional remapping stage unnecessary, as the ALE fluxes already properly take into account the rezoned geometry. In this sense, our scheme falls into the category of direct ALE methods. Furthermore, the geometric conservation law is satisfied by the scheme by construction. We apply the high‐order algorithm presented in this paper to the Euler equations of compressible gas dynamics as well as to the ideal classical and relativistic magnetohydrodynamic equations. We show numerical convergence results up to fifth order of accuracy in space and time together with some classical numerical test problems for each hyperbolic system under consideration. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
67.
68.
针对基于移动预测定位的SLMP算法在定位中没有参考其他节点的移动预测信息,提出了基于洋流态势的移动预测CMP算法,算法在移动定位的过程中,考虑水流影响,结合了前驱节点的移动预测信息及其他信息来完成预测.大量的仿真结果表明,CMP算法在定位覆盖度及平均通信代价方面有良好的性能,也表明了CMP算法能够更好的适应于大规模水下移动环境. 相似文献
69.
Svenivind Wille 《国际流体数值方法杂志》1997,24(2):155-168
The tri-tree algorithm for refinements and recoarsements of finite element grids is explored. The refinement–recoarsement algorithm not only provides an accurate solution in certain parts of the grid but also has a major influence on the finite element equation system itself. The refinements of the grid lead to a more symmetric and linear equation matrix. The recoarsements will ensure that the grid is not finer than is necessary for preventing divergence in an iterative solution procedure. The refinement–recoarsement algorithm is a dynamic procedure and the grid is adapted to the instant solution. In the tri-tree multigrid algorithm the solution from a coarser grid is scaled relatively to the increase in velocity boundary condition for the finer grid. In order to have a good start vector for the solution of the finer grid, the global Reynolds number or velocity boundary condition should not be subject to large changes. For each grid and velocity solution the element Reynolds number is computed and used as the grid adaption indicator during the refinement–recoarsement procedure. The iterative tri-tree multigrid method includes iterations with respect to the grid. At each Reynolds number the same boundary condition s are applied and the grid is adapted to the solution iteratively until the number of unknowns and elements in the grid becomes constant. In the present paper the following properties of the tri-tree algorithm are explored: the influence of the increase in boundary velocities and the size of the grid adaption indicator on the amount of work for solving the equations, the number of linear iterations and the solution error estimate between grid levels. The present work indicates that in addition to the linear and non-linear iterations, attention should also be given to grid adaption iterations. © 1997 by John Wiley & Sons, Ltd. 相似文献
70.