-
c8051f020产生的函数发生器
c8051f020产生的函数发生器-----产生sin函数通过查表的方法-C8051f020 the function generator----- produce sin function through the look-up table
- 2022-07-11 08:33:46下载
- 积分：1
-
色度2329简介本系统用于产生各种输出…
色度2329简介本系统是用来产生各种输出信号的显示器（CRT）
- 2022-03-09 20:16:03下载
- 积分：1
-
他计划使用INI文件确定菜单程序。程序动态…
his program uses an ini file to determine a menu routine. The program dynamically adds menus that run programs and has the ability to pass arguements to those programs if needed. The program can go 5 submenu s deep and can start from no menus to basically an unlimited amount of menus. Have also written in C++ builder but haven t made the Cbuilder one go 5 subs deep yet.-his program uses an ini file to determine a menu routine. The program dynamically adds menus that run programs and has the ability to pass arguements to those programs if needed. The program can go 5 submenu s deep and can start from no menus to basically an unlimited amount of menus. Have also written in C++ builder but haven t made the Cbuilder one go 5 subs deep yet.
- 2022-06-17 04:57:32下载
- 积分：1
-
一个C++实现的简单的学生管理系统，课程设计用的
一个C++实现的简单的学生管理系统，课程设计用的-A C++ Students to achieve a simple management system, curriculum design used
- 2022-03-23 01:42:02下载
- 积分：1
-
好的源资源管理器，可以很容易地实现浏览器的所有功能
很好的资源管理器源码，可以方便的实现资源管理器的所有功能-Good source resource manager, you can easily realize Explorer all the features
- 2023-01-19 14:25:04下载
- 积分：1
-
BER for BPSK in ISI channel with Zero Forcing equalization
BER for BPSK in ISI channel with Zero Forcing equalization
- 2022-01-25 16:13:54下载
- 积分：1
-
1背包问题是NP难题。0
0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right
- 2022-03-25 00:00:51下载
- 积分：1
-
本文提出了一种在获取图像低层视觉特征的基础上，利用语义网络对
图像进行语义自动分类，并在此基础上引入相关反馈技术，使图像的低级
物理特征和高级语义特征联...
本文提出了一种在获取图像低层视觉特征的基础上，利用语义网络对
图像进行语义自动分类，并在此基础上引入相关反馈技术，使图像的低级
物理特征和高级语义特征联系起来的算法，通过人一机协同工作，来弥补
计算机理解能力的不足，不断提高检索效果。
-In this paper, a low-level access to images based on visual characteristics, the use of semantic networks semantic image automatic classification, and on this basis the introduction of relevance feedback techniques, so that low-level image features and physical characteristics of high-level semantic link algorithm, through a machine to work together to make up for the lack of computer ability, continuously improve the search results.
- 2023-03-27 19:50:04下载
- 积分：1
-
小弟从网上掘一代码，奉献出来，希望对大家有帮助
小弟从网上掘一代码，奉献出来，希望对大家有帮助-Boy dug one code from the Internet, and dedication out to be helpful for all of us
- 2022-06-30 00:40:39下载
- 积分：1
-
内存修改
#ifndef _SEARCH_THREAD_H_
#define _SEARCH_THREAD_H_
#define PROCESS_SIZE 1000 // 进程条的最大值
#define THREAD_NUM 1 // 搜索内存线程个数
#define WM_FIND_MEMORY (WM_USER + 1) // 找到搜索数值
#define WM_FIND_PROGRESS (WM_USER + 2) // 搜索进度
#define WM_SEARCH_FINISH (WM_USER + 3) // 搜索线程完成
#define SEARCH_STRING_MAX_LENGTH 255 // 搜索字符串的最大长度
class CModifyMemoryDlg;
// 搜索线程函数
DWORD WINAPI SearchMemory(LPVOID lpParameter);
// 精确搜索
void EquSearch(CModifyMemoryDlg *pDlg, BYTE *lpBuf, MEMORY_BASIC_INFORMATION &mbi);
// 大于搜索
void GreaterSearch(CModifyMemoryDlg *pDlg, BYTE *lpBuf, MEMORY_BASIC_INFORMATION &mbi);
// 小于搜索
void
- 2022-06-18 16:10:54下载
- 积分：1
|
联系客服（QQ：3324461878）
