-
基于QT实现的基础图形绘图系统.7z
输入椭圆中心和长短轴径;
2. 计算得到中心在原点的椭圆上的第一个点=;
3. 根据公式(1.1.3-2)计算区域1中决策参数的初值为;
4. 在区域1中每个位置处，从开始，反复按照公式(1.1.3-3)更新决策参数，若决策参数小于0则不变，反之加1，一直循环到为止，记第一个满足此条件的点为();
5. 在区域2的每个位置处，从开始，反复按照公式(1.1.3-6)更新决策参数，若决策参数小于0则不变，反之加1，一直循环到()为止;(Input ellipse center and long and short axis diameter;
2. The first point of the center on the ellipse at the origin is calculated.
3. According to formula (1.1.3-2), the initial value of decision-making parameters in region 1 is calculated.
4. At each location in region 1, the decision-making parameters are updated repeatedly according to formula (1.1.3-3). If the decision-making parameters are less than 0, they will remain unchanged. If the decision-making parameters are less than 0, then add 1 and cycle until the first point satisfying this condition is ();
5. At each location of region 2, the decision parameters are updated repeatedly according to the formula (1.1.3-6). If the decision parameters are less than 0, they will remain unchanged. If the decision parameters are less than 0, then add 1 and cycle until ().)
- 2020-11-13 16:49:42下载
- 积分：1
-
chirp FP
啁啾FBG的FP干涉反射谱线MATLAB仿真chirp FBG-FP(MATLAB Simulation of Chiral Fiber Bragg gratings based FP Interferometric Reflectance Spectra)
- 2021-04-08 10:49:01下载
- 积分：1
-
中景园文字取模说明
OLED显示屏文字取模说明及软件,包含PCtoLCD2002软件(PCtoLCD2002 for oled driver)
- 2018-09-29 09:40:34下载
- 积分：1
-
CAODV 代码
认知无线电网络在 NS2 上 caodv （认知 adhoc 的点播矢量） 路由协议的执行情况
- 2022-05-06 13:26:55下载
- 积分：1
-
window
搭建简单的界面，并调用深度学习植物叶片识别模型，实现一些植物叶片的分类。(Build a simple interface, and call in-depth learning plant leaf recognition model to achieve some plant leaf classification.)
- 2018-11-29 18:56:14下载
- 积分：1
-
Desktop
n=eval(input())
def x(n):
if n<=3 and n>=0:
return n
else:
return x(n-1)+x(n-2)+x(n-3)
print(x(n))
- 2018-10-23 11:07:30下载
- 积分：1
-
一个自己开发的学生成绩管理系统，希望大家喜欢！
一个自己开发的学生成绩管理系统，希望大家喜欢！-A self-developed student achievement management system, I hope everyone likes!
- 2022-02-03 00:23:03下载
- 积分：1
-
NLBCPE
建立水声信道的射线模型在工程应用上有重要的意义。射线声学是把声波的
传播看作是一束无数条垂直于等相位面的射线的传播，每一条射线与等相位面相
垂直，称为声线。声线途经的距离代表波传播的路程，声线经历的时问为波传播
的时间。声线束所携带的能量即为波传播的声能量。与几何光学相似，射线声学
的描述方法给人直观的感觉，在一定的条件下，射线声学的数学运算也比较简捷，
由射线理论给出的声线图可以给声场以直观、形象的理解。
本模型可以准确的衡量声波在海洋中传播路径(Establishing ray model of underwater acoustic channel is of great significance in engineering application. X-ray acoustics refers to sound waves.
Propagation is regarded as the propagation of a bunch of innumerable rays perpendicular to the isophase plane, each ray being in phase with the isophase plane.
Vertical, called sound line. The distance through which the sound line Travels represents the distance of the wave propagation, and the time that the sound line experiences is the wave propagation.
The time. The energy carried by the sound beam is the sound energy of wave propagation. Like geometric optics, ray acoustics
The descriptive method gives people an intuitive feeling. Under certain conditions, the mathematical operation of ray acoustics is relatively simple.
The sonogram given by ray theory can give an intuitive and visual understanding of the sound field.Accurate measurement of sound wave propagation in the ocean)
- 2020-10-09 22:07:40下载
- 积分：1
-
ofdm系统基于matlab的papr仿真程序
ofdm系统基于matlab的papr仿真程序
- 2022-07-20 22:06:38下载
- 积分：1
-
平衡二叉树操作的演示
一、 需求分析
（1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。
（2） 初始，平衡二叉树为空树，操作...
平衡二叉树操作的演示
一、 需求分析
（1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。
（2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。
（3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。
-balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins
- 2022-03-05 06:54:53下载
- 积分：1
