Description: 求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past. Platform: |
Size: 38938 |
Author:Tracy |
Hits:
Description: 本书并不是特意一本Linux 的内部手册相反它是对操作系统的介绍同时以Linux作为示例书中每一章遵循从共性到特性的原则它们将首先给出核心子系统的概叙然后进行尽可能的详细描叙 我不会用routine_X()调用routine_Y()来增加bar 数据结构中foo 域的值这种方式来描叙核心算法 你自己可以通过阅读代码发现它每当需要理解一段代码时我总是将其数据结构画出来这样我发现了许多相关的核心数据结构以及它们之间的关系 每一章都是非常独立的就象Linux 核心子系统一样当然有时它们还是有联系的比如说如果你没有理解虚拟内存工作原理就无法描叙进程 硬件基本概念一章对现代PC 做了简要介绍操作系统必须与硬件系统紧密结合在一起协同工作操作系统需要一些只能够由硬件提供的服务为了全面理解Linux 你必须了解有关硬件的基础知识 软件基本概念一章介绍了软件基本原理与C 程序语言讨论了建立Linux 这样的操作系统的工具并且给出了操作系统的目标与功能的概叙 内存管理这章描叙了Linux 如何处理物理内存以及虚拟存储技术 进程管理描叙了进程的概念以及Linux 核心是如何创建管理与删除系统中的进程 进程间及进程与核心间通讯以协调它们的活动Linux 支持大量进程间通讯IPC -the book is not specifically a Linux internal manual Rather, it was the introduction of the operating system Linux simultaneously in each chapter of the book as an example to follow from the common characteristics of the principles is that they will be the first core subsystems of Syria will then proceed to the detailed depicts as possible, I will not use routine_X () call routine _Y () to increase the bar data structure foo domain of values in this manner, depicts the core algorithm you can read the code when it was found necessary to understand some code, I will always data structure drawn so I found many of the core data structure and the relationship between them each chapter very independent, just like the Linux kernel subsystem of course sometimes they like or linked, for instance if Platform: |
Size: 1200471 |
Author:陈彬 |
Hits:
Description: 本书并不是特意一本Linux 的内部手册相反它是对操作系统的介绍同时以Linux作为示例书中每一章遵循从共性到特性的原则它们将首先给出核心子系统的概叙然后进行尽可能的详细描叙 我不会用routine_X()调用routine_Y()来增加bar 数据结构中foo 域的值这种方式来描叙核心算法 你自己可以通过阅读代码发现它每当需要理解一段代码时我总是将其数据结构画出来这样我发现了许多相关的核心数据结构以及它们之间的关系 每一章都是非常独立的就象Linux 核心子系统一样当然有时它们还是有联系的比如说如果你没有理解虚拟内存工作原理就无法描叙进程 硬件基本概念一章对现代PC 做了简要介绍操作系统必须与硬件系统紧密结合在一起协同工作操作系统需要一些只能够由硬件提供的服务为了全面理解Linux 你必须了解有关硬件的基础知识 软件基本概念一章介绍了软件基本原理与C 程序语言讨论了建立Linux 这样的操作系统的工具并且给出了操作系统的目标与功能的概叙 内存管理这章描叙了Linux 如何处理物理内存以及虚拟存储技术 进程管理描叙了进程的概念以及Linux 核心是如何创建管理与删除系统中的进程 进程间及进程与核心间通讯以协调它们的活动Linux 支持大量进程间通讯IPC -the book is not specifically a Linux internal manual Rather, it was the introduction of the operating system Linux simultaneously in each chapter of the book as an example to follow from the common characteristics of the principles is that they will be the first core subsystems of Syria will then proceed to the detailed depicts as possible, I will not use routine_X () call routine _Y () to increase the bar data structure foo domain of values in this manner, depicts the core algorithm you can read the code when it was found necessary to understand some code, I will always data structure drawn so I found many of the core data structure and the relationship between them each chapter very independent, just like the Linux kernel subsystem of course sometimes they like or linked, for instance if Platform: |
Size: 1200128 |
Author:陈彬 |
Hits:
Description: first和Follow分析相关算法
编译原理实验的一个内容,VC++编译-Analysis of first and Follow-correlation algorithm to compile an element of principle experiment, VC++ compiler Platform: |
Size: 1964032 |
Author:chuhaiyun |
Hits:
Description: 求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past. Platform: |
Size: 38912 |
Author:Tracy |
Hits:
Description: LL（1）文法判定算法,LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。
LL(1)文法的判别需要依次计算FIRST集、FOLLOW集和SELLECT集,然后判断是否为LL(1)文法,最后再进行句子分析。
-LL (1) grammar algorithm to determine, LL (1) grammar is used to determine the top-down analysis techniques. LL (1) the meaning is: the first L showed that top-down analysis is scanned from left to right input strings, the first two L analysis will show that the use of the most left-derived, 1 shows that only a symbol to the right to see it can decide how derived, namely, to choose which production (rule) for derivation. LL (1) determine the needs of grammar followed by calculating the FIRST set, FOLLOW sets and SELLECT set, and then determine whether to LL (1) grammar, sentence analysis of the final again. Platform: |
Size: 32768 |
Author:伟 |
Hits:
Description: 六、 限自动机的生成及化简过程模拟 10
七、 First集和Follow集生成算法模拟 10
八、 LL(1)分析过程模拟 11
九、 FirstVT集和LastVT集生成算法模拟 12
十、 算符优先分析表生成模拟 12
十一、 算符优先分析过程模拟-Sixth, limit the generation of automata and simplify the process of simulation of 10 Seven, First Set and Follow simulation algorithm to generate 10 sets of eight, LL (1) Analysis of Process Simulation 11 9, FirstVT sets and set LastVT simulation algorithm to generate 12 10, operator priority Simulation analysis table generated 12 11, operator priority analysis process simulation Platform: |
Size: 159744 |
Author:啊啊啊啊 |
Hits:
Description: 大学里First集和Follow集生成算法 希望对大家有点用-University First Set and Follow Set Generation Algorithm hope all of you a bit with Platform: |
Size: 55296 |
Author: |
Hits:
Description: 本 文 首先 介绍了语音识别的研究和发展状况，然后循着语音识别系统的
处理过程，介绍了语音识别的各个步骤，并对每个步骤可用的几种方法在实
验基础上进行了分析对比。研究了语音信号的预处理和特征参数提取，包括
语音信号的数字化、分帧加窗、预加重滤波、端点检测及时域特征向量和变
换域特征向量.其中端点检测采用双门限法.通过实验比对特征参数的选取，
采用12阶线性预测倒谱系数作为识别参数。详细分析了特定人孤立词识别算
法，选定动态时间弯折为识别算法，并重点介绍其设计实现。
在 Vi su alC++环境下，设计并实现一个特定人、孤立词语音识别系统，
系统可以识别数字0-9等简单指令。该系统还具备演示、学习功能，可以演
示语音处理的各个步骤，还可以根据需要添加新的指令。
最 后 ， 重点从端点检测算法和动态时间弯折识别算法对系统进行改进。
实验表明，改进后的系统识别率有很大提高，达到95 ，为进一步开发实用
性语音识别系统产品打下了基础。-This article introduced the first speech recognition research and development, and then follow the voice recognition system
Processing, speech recognition, introduced the various steps, each step of the methods available in the real
A post-mortem conducted on the basis of the analysis and comparison. Research on the speech signal pre-processing and feature extraction, including
Digitized voice signals, sub-frame window, pre-emphasis filtering, endpoint detection feature vector in time domain and variable
Eigenvector for the domain. One endpoint detection method using dual-threshold. Through experiments over the selection of characteristic parameters,
The use of 12-order linear prediction cepstral coefficients as recognition parameters. Detailed analysis of the specific operator who isolated word recognition
Law, selected Dynamic Time Warping Algorithm for identifying and focusing on the achievement of its design.
In Vi su alC++ environment, design and realization of a s Platform: |
Size: 2491392 |
Author:周文超 |
Hits:
Description: 问题描述
设计一个由正规文法生成First集和Follow集并进行简化的算法动态模拟。(算法参见教材)
【基本要求】
动态模拟算法的基本功能是：
（1） 输入一个文法G；
（2） 输出由文法G构造FIRST集的算法；
（3） 输出First集；
（4） 输出由文法G构造FOLLOW集的算法；
（5） 输出FOLLOW集。
-Description of the problem to design a grammar generated by the First Set and Follow sets and dynamic simulation of a simplified algorithm. (See materials algorithm) the basic requirements of】 【dynamic simulation algorithm for the basic functions are: (1) enter a grammar G (2) output by the grammar G constructed sets FIRST algorithm (3) First output set (4) output by the FOLLOW structure grammar G set algorithm (5) Set the output FOLLOW. Platform: |
Size: 513024 |
Author:穆鹏 |
Hits:
Description: 是用JAVA做得一个First和Follow胡算法程序，很实用，无错误！-JAVA done with a First and Follow procedures Hu algorithm, it is practical, error-free! Platform: |
Size: 7168 |
Author:郭娟 |
Hits:
Description: 这么个思路：首先通过提取系统时间和运行时间作为加密算式的动态参数进行文件加密，然后将这些参数以及密码和是否加密的标志加密加载到文件中（不然就解密不了文件了），最后在解密的话，就是通过一定得方法提取这些参数，将其解密。
由于这些参数是动态变化的，所以每次对同一个文件进行加密后的结果都是不一样的，这样的话对于破解者来说就没有规律可循了。
这种加密法就是一个对称密码，很难用穷举法破解（虽然我没有试过），但是跟金老师上课讲的那些对称密码像DES，是没的比的，那些事可以公开算法的，而这个算法最大的缺陷是只要对方知道我加密参数的方法，密码就很容易被破解，也就是我必须要保密算法和密钥。这个算法可以很好得对抗那些想利用穷举法来破解的人。我这个程序是用了32个字符密码加密的。
具体使用：
通过选择一个要加密的文件，输入密码，加密即可。解密，选择一个要解密的文件，输入密码即可。-Such a train of thought: First of all, through the extraction time and run-time system encryption algorithm as the dynamic parameters for file encryption, and then these parameters, as well as whether the encrypted password and encryption load signs to a file (or can not decrypt the files on), and finally in If decryption is extracted through a certain method of these parameters may be declassified.
As a result of these parameters are dynamic, so every time a file is encrypted with the results are different, so for those who break the law to follow the no.
This is a symmetric encryption password, it is difficult to break with exhaustive method (although I have not tried), but with the gold class teacher who said symmetric cipher like DES, the ratio is not that those things can be disclosed algorithm, The biggest flaw of this algorithm is as long as the parameters of the other party know that I am way encryption, the password can easily be cracked, that Platform: |
Size: 1906688 |
Author:Aaron |
Hits:
Description: 自动的编译原理算符优先算法（具有自动算FIRST集，FOLLOW集和算符优先表，）编译后为exe，可输入参数执行环境为vs2005 语言C#-Automatic Compilation Principle operator priority algorithm (with automatic calculation FIRST sets, FOLLOW sets, and operator priority table,) compiled for the exe, the implementation of the environment can enter parameter vs2005 language C# Platform: |
Size: 33792 |
Author:高飞 |
Hits:
Description: （1） 根据LL(1)分析法编写一个语法分析程序，可根据自己实际情况，选择以下一项作为分析算法的输入：
a. 直接输入根据已知文法构造的分析表M
b.输入文法的FIRST(α)和FOLLOW(U)集合，由程序自动生成文法的分析表M；
c.输入已知文法，由程序自动构造文法的分析表M。
（2） 程序具有通用性
所开发的程序可适用于不同的文法和任意输入串，且能判断该文法是否为LL(1)文法。
（3） 有运行实例
对于输入的文法和符号串，所编制的语法分析程序应能正确判断此串是否为文法的句子，并要求输出分析过程。
-(1) According to the LL (1) method to write a parser, according to their own situation, choose one of the following analysis of the algorithm as input:
a. directly into the basis of known structures of grammar table M
b. enter the grammar of FIRST (α) and FOLLOW (U) set automatically by the program analysis table statute of Health M
c. Enter known grammar, the program can automatically construct grammatical analysis table M.
(2) program has universal
The developed program used in various types of grammar and an arbitrary input string, and can determine whether the grammar LL (1) grammar.
(3) the running instance
Grammar and symbols for the input string, the parser should be compiled correctly determine whether this string of sentence grammar, and asked the output of the process. Platform: |
Size: 289792 |
Author:zmf |
Hits:
Description: 对于任意输入的一个LL(1)文法，构造预测分析程序，输出输入串的自动匹配过程。首先实现集合FIRST(X)构造算法和集合FOLLOW(A)构造算法，再实现预测分析表构造算法。再构造预测分析程序，输出字符串的自动匹配过程。-For any input of a LL (1) grammar, structure prediction analysis program, import and export series of automatic matching process. First of all, to achieve set FIRST (X) construction algorithm and the set FOLLOW (A) construction algorithm, and then to achieve forecast of the table construction algorithm. Prediction of re-construction process, the output string of automatic matching process. Platform: |
Size: 13312 |
Author:徐向阳 |
Hits:
Description: 下载说明
您下载的资源来自TI德州中文网(http://www.tichinese.com)
使用前请您先阅读以下条款：
1) 本站不保证所提供资源的完整性和安全性；
2) 请在使用前查毒 (这也是您使用其它网络资源所必须注意的) ；
3) 由本站提供的程序对您的网站或计算机造成严重后果的本站概不负责；
4) 转载本站提供的资源请勿删除本说明注释/文档；
5) 本站提供的一部分资源为网上搜集而来，如果该程序涉及或侵害到您的
版权请立即写信通知我们。
-Motion Tracking
===============
This tarball contains all code required to run the tracking algorithm
on a sequence of images.
Run the file run_tracker.m in Matlab and follow the instructions. You
will need to have a directory of sequentially numbered images
available. After entering the path and file types the tracker will
begin processing.
The code uses a solver for the linear assignment problem in lap.cpp
that must be mex-compiled before the tracker can function. My code is
set up to try to automatically compile the file src/lap/lap.cpp using
mex should it detect that it has not yet been compiled. This will
usually result in an informative message when you run the tracker for
the first time on your system, followed by Matlab exiting (this is
normal). Should automatic compilation of the file src/lap/lap.cpp fail
(i.e. upon restarting Matlab you get the same informative message as
before), then your system is probably not set up correctly and you
should invest Platform: |
Size: 1135616 |
Author:李岩 |
Hits:
Description: Simulation of CPU scheduling.
It will take on a group of 200 processes and execute them in an orderly fashion based on a particular algorithm the program will follow. The scheduling algorithms include, First Come First Serve, Shortest Job First and Priority. Statistics form included.-Simulation of CPU scheduling.
It will take on a group of 200 processes and execute them in an orderly fashion based on a particular algorithm the program will follow. The scheduling algorithms include, First Come First Serve, Shortest Job First and Priority. Statistics form included. Platform: |
Size: 737280 |
Author:ipali |
Hits:
Description: 预测分析表自动构造程序的实现
设计内容及要求：对于任意输入的一个LL(1)文法，构造其预测分析表。要求：首先实现集合FIRST(X)构造算法和集合FOLLOW(A)构造算法，再实现教材P.79给出的预测分析表构造算法。程序显示输出预测分析表或输出到指定文件中。
预测分析程序的实现
设计内容及要求：
对文法 G: E→E+T|T 按教材P.76表4.1构造出G的预测分析程序，
T→T*F|F 程序显示输出如P.78那样的匹配过程。
F→（E）|i
-Predictive analysis table automatically construct procedures to achieve design content and requirements: For any input an LL (1) grammar, construct its predictive analysis table. Requirements: First, to achieve set FIRST (X) construction algorithm and set FOLLOW (A) construction algorithm, and then realize textbooks P.79 predictive analysis given in the table construction algorithm. Predictive analysis program displays the output table or output to the specified file. Implementation of predictive analytics program design content and requirements: for grammar G: E → E+T | T P.76 Table 4.1 by textbooks construct predictive analysis program G, T → T* F | F program displays the output as such P.78 matching process. F → (E) | i Platform: |
Size: 20480 |
Author:郭彦斌 |
Hits:
Search - first and follow algorithm