Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - expression we

Search list

[Other resource] 表达式求值(大程序)

Description: ＶＣ实现的用堆栈实现表达式求值！！ 数据结构的一个小作业！！ 大家可以参考一下-VC stack with the expression evaluates to achieve! ! Data structure of a small operation! ! We can take a look
Platform: | Size: 43358 | Author: 冰扉 | Hits:

[CSharp] cccp

Description: des-soft.com/download/soft/3894.htm - 12k - 网页快照 - 类似网页 - 以Verilog 描述DES 加密算法(电子书)[ 繁体 ] ... CISCO 的fireware, router , SONY 的PS2 的都一再的证明了这个事实. 现在, 我们 就以著名的网络安全加密算法DES 为例子, 来看看如何用Verilog 来表达... ... Re: 以Verilog 描述DES 加密算法(电子书) 由Anonymous 发表于2002/08/29,Thu @15:46:38 ... www.icdiy.org/article.php3?sid=18 - 19k - 网页快照 - 类似网页 -des-soft.com/download/soft/3894.htm - 12k-web snapshot-like web-to Verilog description DES encryption algorithm (e-books) [traditional] ... the fireware CISCO, router, Sony's PS2 has repeatedly proved the this fact. now, we have a well-known network security DES encryption algorithm for example, to see how to use Verilog expression ... ... Re : Verilog description DES encryption algorithm (e-books) from Anonymous on 2002/08/29, Thu @ 15 : 46-38 ... www.icdiy.org/article.php3 sid = 18-19k-web snapshot-like web
Platform: | Size: 8390 | Author: le | Hits:

[Other resource] 重言式

Description: 用二叉树实现逻辑表达式的基本运算,包括逻辑与,或,非,还可以判别表达式是重言式,还是矛盾式.-binary tree using logical expressions of basic operations, including logic and, or, not, we can judge expression is tautology, or contradiction.
Platform: | Size: 2781 | Author: 罗明会 | Hits:

[Other] 计算表达式

Description: 这个是一个小型计算器，你可以输入一个表达式，就可以得到答案，支持优先级运算，-This is a small calculator, you can enter a regular expression, we can get an answer in support of Operation priority,
Platform: | Size: 5900 | Author: 赵泽东 | Hits:

[Other] 计算表达式

Description: 这个是一个小型计算器，你可以输入一个表达式，就可以得到答案，支持优先级运算，-This is a small calculator, you can enter a regular expression, we can get an answer in support of Operation priority,
Platform: | Size: 169984 | Author: 赵泽东 | Hits:

[JSP/Java] reg2nfa

Description: 程序用JAVA语言编写, 综合利用图结构和堆栈结构进行数据组织和处理. 可以进行正则表达式到NFA的转化, 并能用图形直观的表示. 对正则表达式有一些约定, 就是可以用单个字符表示输入, 也可以用 ‘ ‘ 连接起来的一串字符进行输入. 有基本的表达式以及由基本表达式构成的并置, 选择和重复的操作. 例: A|b*c ‘letter’*’digit’ 等都是合法输入. 还带有括号功能, 优先级 -procedures using Java language. Comprehensive Utilization graph structure and stack structure and data processing. it is a regular expression for NFA to the transformation and can use the intuitive graphical said. Regular expressions are to some agreement and it is expressed with a single character input, we could also use '' linking the string of characters for importation. a basic expressions and by the basic form of expression and Home and choose and repeat the operation. cases : A | b* c 'letter'* 'digit' are all legally imported. also bracketed with functionality, prioritized
Platform: | Size: 12288 | Author: onlyerlee | Hits:

[Data structs] suanshubiaodashi

Description: 数据结构课程设计_算术表达式得原代码 大家可以看下-Data Structure Course Design _ arithmetic expression we can get the original code facie
Platform: | Size: 3072 | Author: 陈小平 | Hits:

[Data structs] expression

Description: 需求分析 (1) 任何一个表达式都是由操作数、运算符和界限符组成的,我们称之为单词. (2) 表达式求值首先要符合四则运算规则: ① 先乘除,后加减 ② 从左到右进行运算 ③ 先括号内,后括号外 (3) 功能实现: ① 若当前单词为数字串,则压入数值栈 ② 若当前单词为运算符并大于运算栈的栈顶符号,则进栈 ③ 若当前单词为运算符并等于运算栈的栈顶符号,去括号,输出 ④ 若当前单词为运算符并小于运算栈的栈顶符号,则进行运算 -Needs analysis (1) an expression by any operand, operator, and at the composition of the boundaries, we call words. (2) the expression for the value of the first four operations to comply with the rules: ① first multiplication and division, after From left to right to conduct operations by ② ③ first brackets, the brackets after the outside (3) functions: ① If the current word number string, then pressed into numerical stack ② If the current word is greater than for the operator and operator of Top-stack symbols, then into the stack word ③ If the current operator and is equivalent to computing the Top-stack symbols, to brackets, output ④ If the current word for the operator and less than computing the Top-stack symbols, were carried out in computing
Platform: | Size: 108544 | Author: 马巧英 | Hits:

[Special Effects] FeaturePointsEditingTool

Description: 为了实现实时的低带宽和基于手机平台的情感通信，传输的数据量必须足够小，鉴于人脸视频图像的表情信息和纹理信息量很大，我们采用了基于特征点的人脸表情再现和视频传输。因此特征点序列的预处理对人脸表情卡通话显得尤为重要.-In order to realize low-bandwidth and real-time mobile phone platform based on emotional communication, the amount of data transmission must be small enough, in view of facial expression video image information and a great texture information, we have adopted a feature points based on the Facial Expression and video reproduction transmission. Therefore feature point sequences preconditioning on Facial Expression, then a cartoon seems particularly important.
Platform: | Size: 4384768 | Author: fjwang | Hits:

[Other] Real-Time_Facial_Feature_Point_Extraction

Description: Real-Time Facial Feature Point Extraction-Localization of facial feature points is an important step for many subsequent facial image analysis tasks. In this paper, we proposed a new coarse-to-fine method for extracting 20 facial feature points from image sequences. In particular, the Viola-Jones face detection method is extended to detect small-scale facial components with wide shape variations, and linear Kalman filters are used to smoothly track the feature points by handling detection errors and head rotations. The proposed method achieved higher than 90 detection rate when tested on the BioID face database and the FG-NET facial expression database. Moreover, our method shows robust performance against the variation of face resolutions and facial expressions.
Platform: | Size: 871424 | Author: Ng Jack | Hits:

[Other] SLDL_DLL.CrackFiles

Description: 微软的expression web3的破解补丁,只要将里面的dll文件解压到各个目录,替换其中文件即可-expression web3
Platform: | Size: 58368 | Author: Zheng | Hits:

[Other] pcaexpressprot

Description: We propose an algorithm for facial expression recognition which can classify the given image into one of the seven basic facial expression categories (happiness, sadness, fear, surprise, anger, disgust and neutral). PCA is used for dimensionality reduction in input data while retaining those characteristics of the data set that contribute most to its variance, by keeping lower-order principal components and ignoring higher-order ones. Such low-order components contain the "most important" aspects of the data. The extracted feature vectors in the reduced space are used to train the supervised Neural Network classifier. This approach results extremely powerful because it does not require the detection of any reference point or node grid. The proposed method is fast and can be used for real-time applications.
Platform: | Size: 21504 | Author: mhm | Hits:

[Software Engineering] MATLAB

Description: 一、 牛顿－拉夫逊法概要 首先对一般的牛顿－拉夫逊法作一简单说明。已知一个变量X的函数 （4－6） 解此方程式时，由适当的近似值X（0）出发，根据 （4－7） 反复进行计算，当X（n）满足适当的收敛判定条件时就是（4－6）式的根。这样的方法就是所谓的牛顿－拉夫逊法。 式（4－7）就是取第n次近似解X（n）在曲线 上的点 处的切线与X轴的交点作下一次X（n+1）值的方法。参考图4－2（a）。在这一方法中为了能收敛于真解，初值X（0）的选取及函数f（X）必须满足适当的条件，如图4－2（b）所示的那种情况就不能收敛或收敛到别的根上去。 这一方法还可以做下面的解释，设第n次迭代得到的解与真值之差，即 的误差为 时，则 （4-8） 把 在 附近对 用泰勒级数展开 （4-9） 上式略去 以下的项 （4-10） 的误差可近似由上式计算出来 图4-2 （4-11） 比较式（4-7）和（4-11），可以看出牛顿-拉夫逊法的修正量和 的误差的一次项相等。 用同样的方法考虑，给出对n个变量 -:Because of the importance and complexity of power system, better algorithm and programme language is very important . An interior point method based on the perturbed Karush2Kuhn2Tucker (KKT) condition is pre2 sented in this paper , where the method and process for the optimal power flow is treated through the Matlab’s symbolic math toolbox and Mfunction is also presented. Using the symbolic code , it can improve the adaptability of the programme dramatically. The advantage is that , what we need to do is change the model expression. We can make use of the symbolic programme to check our programme while we write the Mfunctions. Using the Mat2 lab , we find the optimal solutions and calculate quickly and efficiently. It has proposed the powerful and unique functions of Matlab in the optimization and calculation for power system. Key words :power system symbolic calculation optimal power flow interior point method
Platform: | Size: 9216 | Author: 范凯 | Hits:

[matlab] Face_and_Face_exsipression_Recognition

Description: One of Biometrics fields is face recognition & face expression recognition ... 1- In face recognition .. we need to design authentication program by training a neural network ,there are two source codes..one of them is based on Discrete Wavelet Transform with Perceptron Neural Network.. and the other based on Discrete Cosine Transform with Perceptron Neural Network ... 2- In face expression recognition .. we defined the condition of the person (nature,happiness,disgust or anger) this source code is based on Principle component analysis(PCA) .. * we need to now about digital image processing ,neural network and PCA-One of Biometrics fields is face recognition & face expression recognition ... 1- In face recognition .. we need to design authentication program by training a neural network ,there are two source codes..one of them is based on Discrete Wavelet Transform with Perceptron Neural Network.. and the other based on Discrete Cosine Transform with Perceptron Neural Network ... 2- In face expression recognition .. we defined the condition of the person (nature,happiness,disgust or anger) this source code is based on Principle component analysis(PCA) .. * we need to now about digital image processing ,neural network and PCA...
Platform: | Size: 11905024 | Author: mahmoud | Hits:

[Other] Lexer

Description: 该任务需要你为数学表达式构建一个单纯的语法分析程序lexer，它将一段输入的字符串转变为token(值)，token(值)里每个字符都属于数学表达式的组成部分。我们想将token(值)定义为如下几种(1)计算符号,+,-.(2)字母和下划线 (3)数字，这三者先不需要仔细区分。-In this assignment, you will build a simple lexer for arithmetic expressions. A lexer breaks an put str g to tokens, each of which is a unit of the expression. We consider the follow g as tokens: (1) the symbols,+,--‐, ( and ), (2) variable name consist g of alpha--‐ umeric characters and underscore, and (3) teger numeric constants. You do not have to dist guish between the three k ds of tokens for now.
Platform: | Size: 3072 | Author: faasewq | Hits:

[Data structs] calculation

Description: 数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式-Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression
Platform: | Size: 1024 | Author: 吴偲 | Hits:

[Other] main

Description: 问题描述 　　中缀表达式就是我们通常所书写的数学表达式，后缀表达式也称为逆波兰表达式，在编译程序对我们书写的程序中的表达式进行语法检查时，往往就可以通过逆波兰表达式进行。我们所要设计并实现的程序就是将中缀表示的算术表达式转换成后缀表示，例如，将中缀表达式 (A 一 (B*C 十 D)*E) ／ (F 十 G ) 转换为后缀表示为： ABC*D十E*—FG十／ 注意：为了简化编程实现，假定变量名均为单个字母，运算符只有＋，－，＊，／ 和＾（指数运算），可以处理圆括号（），并假定输入的算术表达式正确。 要求：使用栈数据结构实现 ，输入的中缀表达式以＃号结束 输入 整数N。表示下面有N个中缀表达式 N个由单个字母和运算符构成的表达式 输出 N个后缀表达式。 -Problem Description infix expression is what we usually write mathematical expressions, the suffix expressions are also called Reverse Polish Notation in compiler writing program for our expression syntax checking, often it can be reverse Polish expression. We want to design and implement programs that will infix arithmetic expression into a suffix, for example, the infix expression (A a (B* C ten D)* E)/(F ten G) is converted to the suffix expressed as: ABC* D ten E*-FG ten/Note: To simplify programming, assuming the variable names are a single letter, operators only+,-,*, /, and ^ (exponentiation), can handle parentheses ( ), and assumes that the input of the arithmetic expression is correct. Requirements: Using the stack data structure, the input infix expression input integer ending with# N. Here there are N represents infix expression of N by a single letter and operators constitute an expression output N suffix expressions.
Platform: | Size: 1024 | Author: yyz | Hits:

[Linux-Unix] OpenSLES_IID

Description: Test that when a constructor throws in a new-expression, we pass the right pointer to operator delete.
Platform: | Size: 2048 | Author: vrpnml | Hits:

[Other] Convert-infix

Description: 问题描述 　　中缀表达式就是我们通常所书写的数学表达式，后缀表达式也称为逆波兰表达式，在编译程序对我们书写的程序中的表达式进行语法检查时，往往就可以通过逆波兰表达式进行。我们所要设计并实现的程序就是将中缀表示的算术表达式转换成后缀表示，例如，将中缀表达式 (A 一 (B*C 十 D)*E) ／ (F 十 G ) 转换为后缀表示为： ABC*D十E* FG十／ 注意：为了简化编程实现，假定变量名均为单个字母，运算符只有＋，－，＊，／ 和＾（指数运算），可以处理圆括号（），并假定输入的算术表达式正确。 要求：使用栈数据结构实现 ，输入的中缀表达式以＃号结束 输入 整数N。表示下面有N个中缀表达式 N个由单个字母和运算符构成的表达式 输出 N个后缀表达式。 -Problem description Is the infix expression we usually write mathematical expressions, postfix expression also known as anti Poland formula, the compiler checks the syntax of expressions we write in the program, often can be carried out by the anti Poland formula. We need to design and implement a program that will convert infix arithmetic expressions representing suffixes for example, infix expression (A 1 (B*C ten D) *E () / (F ten G) Convert to suffix: ABC*D ten E* FG ten Note: in order to simplify the programming, assume that the variables are single letters, only the operator +, -, *, / and ^ (exponentiation), can handle the parentheses (), and assume that the input arithmetic expression right. Requirements: to achieve the use of stack data structure, to the end of the input infix expression directly. input Integer N. Express the following N infix expression N expressions that consist of a single letter and operator output N suffix expression.
Platform: | Size: 1024 | Author: 王乐 | Hits:

[Windows Develop] Qiudao

Description: 函数表达式求导，希望对大家有用，VS2015调试通过。(Derivation function expression, we want to be useful, VS2015 debugging through.)
Platform: | Size: 903168 | Author: 木子佳人 | Hits:
« 12 3 4 5 6 7 8 9 10 »

CodeBus www.codebus.net