无线通信的FPGA实现及Matlab程序

Visual Basic程序设计教程.rar VB老师上课用的所有PPT-Visual Basic Programming Guide. Rar VB teacher in the class with all the PPT

冼镜光老师的《C语言名题精选百则》书籍源码，这本书我很喜欢，正在学算法的同学一定要看地哦。。不看会后悔-code about the book "C YuYanMingTiJingXuanBaiZe", written by Xian Jingguang.

描述了vb与excel之间的相互操作，使用vb控制excel的方法-vb excel

Linux源码完全注释，一本很好的书，希望大家喜欢-Notes for the Linux source entirely, a very good book, hope you like

通过系统把几乎所有与人力资源相关的数据统一管理，形成了集成的信息源；使得人力资源管理人员得以摆脱繁重的日常工作，集中精力从战略的角度来考虑企业人力资源规划和政策。将系统的原程序拷贝到本地计算机后，去掉文件夹的只读属性，按照《安装配置说明书》内容附加完系统数据库、配置完成服务器后，便可在本地计算机上运行网站了。 人力资源管理系统的登录界面如图1.1所示，输入用户名：admin 密码：admin 单击【提交】按钮，进入如图1.2所示的人资源管理系统。 -through almost all systems and human resources related to the unified management of data, forming an integrated source of information; making human resource managers get rid of the heavy day-to-day work, concentrate on from the strategic point of view to consider human resources planning and policy. The system will process the original copy to your computer, remove the read-only folder attributes, according to the "installation configuration specification" Additional content End System database server configuration completed, the computer can run on the local site. Human resources management system login screen shown in Figure 1.1, user name : admin Password : admin [click submit button-- entered, as shown in figure 1.2 people resources management s

MIT算法导论英文版，喜欢的朋友可以下载看看，该文档来自互联网-MIT ALGORITHM

VisualSourceSafe讲义,学习管理程序代码-VisualSourceSafe lectures, learning management code

NIosII软处理器快速入门 让初学者快速熟悉nios ii 的软核处理-NIosII soft processors Quick Start for beginners quickly familiar with nios ii soft-core processing

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.

本手册页内容摘自GNU C编译器的完整文档,仅限于解释选项的含义-This manual page is an excerpt from the complete GNU C compiler, documentation is limited to explain the meaning of the options.