期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
《计算机应用数学》课程资源的开发与利用 被引量:3
1
作者 冯天祥 《职业教育研究》 2012年第6期157-159,共3页
课程资源的开发与利用是课程建设的重要组成部分,直接影响课程建设水平。在探究高职院校《计算机应用数学》课程资源开发的基础上,探讨利用《计算机应用数学》课程资源进行课程建设。
关键词 计算机应用数学 课程资源 开发 利用
下载PDF
高职高专《计算机应用数学》课程改革探讨
2
作者 毛圆洁 《西昌学院学报(自然科学版)》 2012年第4期145-147,共3页
本文分析了目前高职高专《计算机应用数学》课程的现状和存在的问题,介绍了学院课程改革的具体措施,创新地提出了"菜单式动态模块"课程设计方略。
关键词 计算机应用数学 课程改革 菜单式 动态模块
下载PDF
Research on Distribution of Electric Dipole Field based on Applied Mathematics and Computer
3
作者 Lingzhi YANG Rumin LIU Haiming LIU 《International Journal of Technology Management》 2015年第4期107-109,共3页
The paper analyze the polarization of study dielectric that produced field by dipole, medium field plays an important role in electromagnetic wave radiation. The electric field expression for electric dipole electric ... The paper analyze the polarization of study dielectric that produced field by dipole, medium field plays an important role in electromagnetic wave radiation. The electric field expression for electric dipole electric field distribution in ordinary textbooks only give a special direction, This paper introduces in detail the formula of the electric dipole in the space of an arbitrary point excitation electric field, and use computer sottware to simulate the distribution pattern of electric dipole, and gives some typical figures for reference. 展开更多
关键词 Conducting spheres Dipole moment Image dipole method Interaction force
下载PDF
Application of an Analytical Method to Locate a Mixing Plane in a Supersonic Compressor
4
作者 Emmanuel Benichou Isabelle Trebinjac 《Journal of Energy and Power Engineering》 2015年第1期91-101,共11页
In order to achieve greater pressure ratios, compressor designers have the opportunity to use transonic configurations. In the supersonic part of the incoming flow, shock waves appear in the front part of the blades a... In order to achieve greater pressure ratios, compressor designers have the opportunity to use transonic configurations. In the supersonic part of the incoming flow, shock waves appear in the front part of the blades and propagate in the upstream direction. In case of multiple blade rows, steady simulations have to impose an azimuthal averaging (mixing plane) which prevents these shock waves to extend upstream. In the present paper, several mixing plane locations are numerically tested and compared in a supersonic configuration. An analytical method is used to describe the shock pattern. It enables to take a critical look at the CFD (computational fluid dynamics) steady results. Based on this method, the shock losses are also evaluated. The good agreement between analytical and numerical values shows that this method can be useful to wisely forecast the mixing plane location and to evaluate the shift in performances due to the presence of the mixing plane. 展开更多
关键词 Supersonic compressor shock wave pressure loss RANS mixing plane
下载PDF
Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
5
作者 Zhaocai Wang Zuwen Ji +2 位作者 Ziyi Su Xiaoming Wang Kai Zhao 《International Journal of Biomathematics》 2016年第2期43-54,共12页
The maximal matching problem (MMP) is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and ap... The maximal matching problem (MMP) is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid (DNA) molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O(n^3) time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation. 展开更多
关键词 DNA computation the maximal matching problem Adleman-Lipton model NP-complete problem.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部