-
操作系统课程设计 题目和目的:
通过模拟文件系统的实现,深入理解操作系统中文件系统的理论知识。(完整报告,包括源码、流程、分析、心得和可执行程序。心血啊!)...
操作系统课程设计 题目和目的:
通过模拟文件系统的实现,深入理解操作系统中文件系统的理论知识。(完整报告,包括源码、流程、分析、心得和可执行程序。心血啊!)
- The operating system curriculum designs the topic and the goal:
Through the simulation filing system realization, thoroughly
understands in the operating system the filing system theory
knowledge. (The integrity reported, including the source code, the
flow, the analysis, the attainment and may the executive routine.
Painstaking care! )
- 2022-02-01 16:48:35下载
- 积分:1
-
Rosen
说明: RosenBrock函数(香蕉函数)的实现及海塞矩阵的构建(Realization of Rosenbrock function (banana function) and construction of Hessian matrix)
- 2020-07-13 10:23:26下载
- 积分:1
-
JSP毕业论文:教学管理系统文档+源代码
JSP毕业论文:教学管理系统文档+源代码,福建师范大学学生作品,这个课程设计主要是使用J2EE的相关技术,比如Servlet,JSP,Struts,Hibernate等,完成一个基于Web的教学管理系统。系统所附带的论文原理深彻,介绍了所用到的技术点的详细说明,包括了流程图的设计,功能模块的实现等,一方面可作为毕业论文的设计参考,另一方面也可学习到很多JSp编写教学管理系统的技巧。
- 2022-03-18 19:06:05下载
- 积分:1
-
c8051f320W25X80
c8051f320之W25X80读写测试实验(keil-c),使用keil-c编写,具有较好的工程移植性(the c8051f320 W25X80 reading and writing test experiment (keil-c), written in keil-c, and with good engineering portability)
- 2012-07-05 11:03:01下载
- 积分:1
-
CLPSO(FES)
CLPSO CODE 可直接使用,无需修改 嗯嗯嗯嗯(CLPSO CODE Can be used directly without modification)
- 2018-03-19 11:01:05下载
- 积分:1
-
风力发电机组机侧控制
说明: 使用永磁同步电机在风力发电机组中的机侧控制(PID control of permanent magnet synchronous motor in wind turbine)
- 2020-04-25 18:09:43下载
- 积分: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
-
IGB
IGB assosiaction Rule
- 2010-08-03 21:45:16下载
- 积分:1
-
CANOPEN91
Document CANopen - CiA
The CANopen specifications cover of the aplication layer and communication profile (Document CANopen- CiA
The CANopen specifications cover of the aplication layer and communication profile )
- 2009-03-27 17:54:38下载
- 积分:1
-
viterbi
说明: viterbi decode by verilog
- 2019-06-18 00:55:40下载
- 积分:1