搜索资源列表
desk
- 一篇文章,关于硬盘结构及其分区简介,供初学者学习使用-an article on the hard drive and its branch structure briefings for beginners learning to use
hwb12pdf
- 硬盘以及分区结构简介。 硬盘分区表和文件分配表 硬盘只有经过物理格式化,分区,逻辑格式化后才能使用,在进行分区时,FDISK 会在硬盘的0柱面0磁头1扇区建一个64字节的分区表,在分表的前面是主引导记录 (MRB),后面是两个字节的有效标志55H,AAH,(H表示16进制)。此扇区被称为主 引导扇区,也是病毒最爱侵袭的地方,它由主引导记录+分区表+有效标志组成。 分区表对于系统自举十分重要,它规定着系统有几个分区;每个分区的起始及终止 扇区,大小以及是否为活动分区等重要信息。
KMeanIntroduction
- 聚类分析是将集合中的数据按其相似性大小分成不同类别的一种方法,它是模式 识别中多变量无监督学习的一个分支,己成功地用于医学,地质,财务,工程,图像 处理和文档等的数据分类中;含有实现此算法的源码 -cluster analysis is to pool the data according to similar size into a different category, It is pattern recognition multivariable Unsupervised Le
chenzhengfang
- 计算机局域网简称局域网(LAN,Local Area Network),是计算机通信中发展最快的一个分支.它始于20世纪70年代,经过技术开发阶段和商品化阶段,促使彼此独立的众多个计算机(如微机、工作站)进入网络环境.局域网技术的研究一直是计算机通信与网络领域中的一个主要内容.-called Computer LAN local area network (LAN, Local Area Network) Computer Communication is the fastest growing
(2004.04.12)二期网络布线图
- 华中科技大学武昌分校的二期网络布线图 不可多得的好东西-Huazhong University of Science and Technology Wuchang branch of the network layout two very good things
业务管理系统,分店的管理pb
- sql server 数据备份文件 ,目录下data.dat 开发平台pb8.0 数据库 sql server 7.0 这是在外国自己为公司开发的业务管理系统,分店的管理,功能挺全,算法一般, 大家看看就好,本人水平一般,别笑话-sql server data backup files, directories under data.dat development platform pb8.0 7.0 sql server database This is the foreign compani
Cpracticereport.rar
- C++实习报告:包括源代码、需求分析、解题说明、调试报告等,主要内容是:循环和分支,数组和函数,指针、引用和异常处理,结构体和类,派生、继承和多态,文件和模板及综合等7大类型。 ,C++ internship report: including source code, needs analysis, problem-solving that debug report, the main contents are: circulation and branch, array and funct
Traffic-light-controller
- 交通灯控制器在A、B方向各有红、黄、绿三盏灯,其控制顺序按表的设计进行循环,表中1表示灯亮、0表示灯灭。交通灯控制器按照主干道数码管显示50S,支干道数码管显示30S, 主干道变为红灯,支干道变为绿灯,继续进行倒计时;支干道倒计时结束后再经行5秒倒计时,交通灯变为黄灯;支干道倒计时结束后再回到初始状态。-Traffic light controller in A, B direction of each red, yellow, and green light, the control sequ
bpred.rar
- Simplescalar中分支预测的分析, the analysis the branch prediction in Simplescalar
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。 ,Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is
背包问题用lc分支限界方法
- 01背包问题,用lc分支限界方法,做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
PrefixSpan-algorithm
- 序列模式挖掘是数据挖掘的一个重要分支,在序列事务及;有关信息处理中有着广泛的应用,如顾客购物习惯、web访问模式、科学实验过程分析、自然灾害预测、疾病治疗、药物检验以及{ sizej pos; DNA等。序列模式挖掘算法有AprioriAll、GsP、F’reeSpan、本文将设计与实现针对string数据类型的算法,来对序列模式挖掘有更深入的剖析。-Sequence pattern mining is an important branch of data mining, and in t
TheResearchofALosslessCompressionMethodofHalftoneI
- 分形理论是现代非线性科学中的一个重要分支, 是科学研究中一种重要的数学工具和手段。介绍了 分形理论的基本概念, 给出了分形理论的重要参数分形维数的常见定义和计算方法。重点介绍了分形理论在图 像处理领域的应用情况。最后, 展望了分形理论的应用前景及其发展方向。-Fractal theory of modern nonlinear science is an important branch of scientific research is an important mathematica
branchandbound
- 分支限界这一章的课件,经典空间,大家交流呀-Branch and bound this chapter courseware, classic space, we exchange it
Branch-and-Price
- Branch—and—Price,一种广义分枝定界或分枝定界的扩展算法,它允许列生成过程应用于整个分枝定界树-The philosophy of branch-and-price is similar to that of branch-and-cut except that the procedure focuses on col- umn generation rather than row generation.
Single-branch-stub
- 用ADS实现微带单枝短截线匹配电路,包括工程及相关论文-Using ADS to achieve a single branch of microstrip stub matching circuit, including engineering and related papers
Fast-Path-based-Neural-Branch-Prediction
- fast path-based neural branch prediction, the differences and the improvements..what have to expect from t he near future-fast path-based neural branch prediction, the differences and the improvements..what have to expect from t he near future..
branch-and-bound
- 分支定界法求解TSp问题的分析研究以及matlab实现-Branch and bound method to solve the problem described TSp
branch-bound.ppt
- Design and Analysis Algorithm Branch Bound
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
- In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propo