-
Span_H_Alpha分类
参照论文《基于SPAN／H／alpha／A和复Wishart分割的全极化SAR数据的非监督分类算法研究》(Referenced research on unsupervised classification algorithm of fully polarimetric SAR data based on SPAN / H / alpha / A and complex Wishart segmentation)
- 2021-03-17 23:09:20下载
- 积分：1
-
music
MUSIC算法的仿真及性能分析：信源数N=3，分别来自于 =-10度， =0度， =10度；信源为相互独立幅度相同的信号；噪声为服从高斯分布的独立噪声；均匀等距直线阵，阵元数为8，波长 ；(MUSIC algorithm for the simulation and performance analysis)
- 2020-11-26 18:29:31下载
- 积分：1
-
SEIR-AD
说明： 病毒传播动力学模型，考虑无症状患者（A），并分析病毒传播率(Virus transmission dynamics model, consider asymptomatic patients (A), and analyze virus transmission rate)
- 2020-04-25 21:00:15下载
- 积分：1
-
2.0G频率计的制作全过程
是pdf格式的
2.0G频率计的制作全过程
是pdf格式的-2.0G frequency of the entire process of production is a pdf format
- 2023-03-05 14:55:03下载
- 积分：1
-
Java Performance.pdf
说明： java 性能权威指南 想深入研究的看看(java performance suit higher programmer)
- 2020-06-20 10:40:01下载
- 积分：1
-
A very classic game plane, aircraft, using C++ Prepared, development platforms:...
一个很经典的平面游戏，打飞机，是用C++编写的，开发平台：windows,visual studio-A very classic game plane, aircraft, using C++ Prepared, development platforms: windows, visual studio
- 2023-09-06 07:20:02下载
- 积分：1
-
局部搜索图着色
说明： 图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。
数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory.
Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
- 2021-04-01 16:49:10下载
- 积分：1
-
digital image processing
说明： 经典数字图像处理教科书，美国大学数字图像处理课程专用教材(The classic textbook for digital image processing)
- 2019-01-16 02:08:59下载
- 积分：1
-
数独是一种瑞士起源于第十八世纪后期的数学解释。
数独是一种源自18世纪末瑞士的数学智力拼图游戏。拼图是九宫格（即3格宽×3格高）的正方形状，每一格又细分为一个九宫格。在每一个小九宫格中，分别填上1至9的数字，让整个大九宫格每一列、每一行的数字都不重复。
数独的玩法逻辑简单，数字排列方式千变万化。不少教育者认为数独是锻炼脑筋的好方法。-Sudoku is a kind of Switzerland originated in late 18th century mathematical intelligence jigsaw puzzle. Puzzle is the squares (ie, 3 cells wide × 3 grid H) of square-shaped, each divided into a fine grid squares. Small squares in each of the respective fill in the figures 1-9, so that the whole big squares in each row, each row will not repeat the figures. The logic of playing Sudoku is simple, the arrangement of the ever-changing figures. Many educators think Sudoku is a good way to exercise their brains.
- 2022-07-26 14:08:27下载
- 积分：1
-
Notepad
说明： 简单应用实现记事本功能，应用java图形类(A simple notepad application implementation, application java graphics classes)
- 2011-03-03 14:53:04下载
- 积分：1
