-
ansys5
利用ansys计算的应力结果,求出截面内力,再利用材料力学公式求等效应力(此例是求坝基面的等效应力)(ANSYS calculated using the stress results, obtained cross-section of internal forces, and then use the formula for the mechanical equivalent stress (in this case is to strive for the dam foundation surface equivalent stress))
- 2007-12-12 20:00:10下载
- 积分:1
-
3
说明: 经典无网格教程的随书算法的例程,属于第三章例程(Classical meshless algorithm tutorial routines with books, belonging to the third chapter routines)
- 2009-12-12 18:45:59下载
- 积分:1
-
sgs
说明: 随机过程在三国杀中的数学建模及matlab仿真报告(Three killed in Stochastic Process in Mathematical Modeling and Simulation Report matlab)
- 2011-04-08 14:32:12下载
- 积分:1
-
WiMax_Matlab_Sim
WiMax Matlab Simulation
- 2012-04-12 18:27:32下载
- 积分:1
-
the-algorithm-of-clustering
几种聚类算法的比较论文,希望对大家的论文有所帮助(Comparison of several clustering algorithms paper, we want to help the paper)
- 2011-10-28 16:12:52下载
- 积分:1
-
embed-watermark--based-one-line
在一段文字中嵌入4bit水印,方法是基于系数类嵌入的,经过打印扫描攻击后能正确提取水印(4bit watermark embedded in a piece of text, the method is based on the coefficient of class embedded, after the print scan attack correctly extract the watermark)
- 2014-11-19 17:43:52下载
- 积分:1
-
nntest6
function nntest6(action,flag)
NNTEST6 View and Control Neural network.
See also SIMUFF.
Koos j. den Oudsten, 1-20-99
koos@phil.uu.nl
Copyright (c) 1998-99 by KoosSoft vof
$Revision: 0.4 $ $Date: 1999/01/27 22:29:28 $
global Xx w1 b1 w2 b2 hidden mlp
if nargin < 1
action = start
end
On recursive calls get all necessary handles and data.
if ~strcmp(action, start )
childList = allchild(0)
nn_fig = childList(find(childList == gcf))
ud = gco
popupvalue = get(ud.popup, Value )
- 2010-03-04 17:12:54下载
- 积分:1
-
10153597dsb
通信原理方面的一些基础matlab程序,包含数字基带传输系统中升余弦滚降系统,最佳基带系统,基带信号眼图,OOK,2PSK,2FS,MPSk,DSB,SSB,VSB(Some basic matlab programs of communication principle, including up-cosine roll-down system in digital baseband transmission system, optimal baseband system, baseband signal eye diagram, OOK, 2PSK, 2FS, MPSk, DSB, SSB, VSB)
- 2018-12-29 20:14:57下载
- 积分:1
-
myACO
Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithms
for combinatorial optimization problems. The first algorithm which can be
classified within this framework was presented in 1991 [21, 13] and, since then,
many diverse variants of the basic principle have been reported in the literature.
The essential trait of ACO algorithms is the combination of a priori information
about the structure of a promising solution with a posteriori information about the
structure of previously obtained good solutions.
- 2017-12-25 17:22:19下载
- 积分:1
-
PAPR(SLM)
PAPR SLM(PAPR SLM)
- 2011-05-06 13:50:53下载
- 积分:1