-
SP3222E详细描述
SP3222E detailed description
- 2022-02-02 15:30:53下载
- 积分：1
-
几篇应用于雷达设计的Kalman滤波相关论文
几篇应用于雷达设计的Kalman滤波相关论文-Applies to the design of several radar Kalman filter papers
- 2022-11-28 17:00:04下载
- 积分：1
-
Information fusion is a holistic concept. Therefore, the application of the huma...
信息融合是整体性概念。因此，应用人脑信息整体协调控制的概念，体现视觉、思维、决策的整体功能，是解决智能信息融合整体性的关键之一。-Information fusion is a holistic concept. Therefore, the application of the human brain the concept of coordination and control of information as a whole reflects the vision, thinking, decision-making the overall function is to solve the overall intelligent information fusion one of the keys.
- 2023-01-29 15:30:04下载
- 积分：1
-
学生信息管理系统设计
学生信息包括：学号，姓名，年龄，性别，出生年月，地址，电话，E...
学生信息管理系统设计
学生信息包括：学号，姓名，年龄，性别，出生年月，地址，电话，E-mail等。提供以下功能：
1、系统以菜单方式工作
2、学生信息录入功能（学生信息用文件保存）－－输入
3、学生信息浏览功能－－输出
4、学生信息查询功能－－算法，按学号、姓名等查询
5、学生信息的删除与修改
-Student Information Management System Design
Student Information includes: Student ID, name, age, gender, date of birth, address, telephone, E-mail and so on. Provides the following features:
1, the system in order to work the way the menu
2, student information input function (Student Information used to save the file)- Input
3, student information browsing- Output
4, student information query functions- algorithms, according to study number, name, etc. Search
5, deletion and modifications Student Information
- 2022-01-26 03:23:01下载
- 积分：1
-
GRUB三步通，详细讲解其工作过程原理分析
GRUB三步通，详细讲解其工作过程原理分析-GRUB pass three-step detail the course of their work on the principle of analysis
- 2022-03-25 04:24:38下载
- 积分：1
-
PCI9054 full version of data on the local bus models are described in detail.
PCI9054数据资料完整版，对本地总线的各种模式有详细叙述。-PCI9054 full version of data on the local bus models are described in detail.
- 2022-05-27 16:43:49下载
- 积分：1
-
树是由n(n≥0)个结点组成的有限集合T。n=0的树称为空树；对n>0的树，有:(1)仅有一个特殊的结点称为根结点，根结点没有前驱结点；(2)当n>...
树是由n(n≥0)个结点组成的有限集合T。n=0的树称为空树；对n>0的树，有:(1)仅有一个特殊的结点称为根结点，根结点没有前驱结点；(2)当n>1时，除根结点外其余的结点分为m(m>0)个互不相交的有限集合T1,T2，…，Tm，其中每个集合Ti本身又是一棵结构和树类似的子树。
-Tree is n (n ≥ 0) consisting of nodes finite set T. n = 0 of the tree known as the empty tree for n> 0 of the tree, there is: (1) has only one special node called the root node, root node there is no precursor node (2) when n> 1 when, with the exception of root node except the node is divided into m (m> 0) a finite set of mutually exclusive cross-T1, T2, ..., Tm, one of each set Ti is itself a structure and are similar subtree tree .
- 2022-03-19 02:47:57下载
- 积分：1
-
wegsrjhyteokuy hi ryuwrylkvqaetkethlh,ueyletlyakkwyr
wegsrjhyteokuy hi ryuwrylkvqaetkethlh,ueyletlyakkwyr-wegsrjhyteokuy hi ryuwrylkvqaetkethlh,ueyletlyakkwyr
- 2022-03-02 15:42:07下载
- 积分：1
-
无线网络站点的设计，根据无线网络的传输规律，讨论了多种站点设计方案，最后找到最经济，最可靠的站点设计方法。...
无线网络站点的设计，根据无线网络的传输规律，讨论了多种站点设计方案，最后找到最经济，最可靠的站点设计方法。-Wireless network site design, wireless network in accordance with the laws of the transmission to discuss a wide range of site design options, and finally to find the most economical and most reliable methods of site design.
- 2022-12-28 20:00:09下载
- 积分：1
-
基于FPGA的GFP（通用成帧协议）封装数据成帧的实现。
基于FPGA的GFP（通用成帧协议）封装数据成帧的实现。-FPGA-based GFP (Generic Framing Protocol) encapsulated data Framing realized.
- 2022-01-30 21:48:56下载
- 积分：1
