-
IIR Filter Coefficient Quantization Example
％ written by DRB on 6-Dec-2004 for ECE3703
％
％ Looks at unquantized filter (ideal), direct form, and cascaded second
％ order section (SOS).
標(biāo)簽：
Quantization
Coefficient
Example
written
上傳時間：
2015-07-23
上傳用戶：zyt
-
zemax源碼：
This DLL models a standard ZEMAX surface type, either plane, sphere, or conic
The surface also demonstrates a user-defined apodization filter
The filter is defined as part of the real ray trace, case 5
The filter can be used at the stop to produce x-y Gaussian apodization similar to the Gaussian pupil apodization in ZEMAX but separate in x and y.
The amplitude apodization is of the form EXP[-(Gx(x/R)^2 + Gy(y/R)^2)]
The transmission is of the form EXP[-2(Gx(x/R)^2 + Gy(y/R)^2)]
where
x^2 + y^2 = r^2
R = semi-diameter
The tranmitted intensity is maximum in the center.
T is set to 0 if semi-diameter < 1e-10 to avoid division by zero.
標(biāo)簽：
standard
surface
models
either
上傳時間：
2013-12-05
上傳用戶：003030
-
Information in this document is subject to change without notice. Companies, names, and data used in examples herein are fictitious unless otherwise noted. No part of this document may be reproduced or transmitted in any form or by any means, electronic or mechanical, for any purpose, without the express written permission of Microsoft Corporation.
標(biāo)簽：
Information
Companies
document
subject
上傳時間：
2014-06-18
上傳用戶：cuiyashuo
-
OLE Programmer s Reference
Information in this online help system is subject to change without notice and does not represent a commitment on the part of Microsoft Corporation. The software and/or files described in this online help system are furnished under a license agreement or nondisclosure agreement. The software and/or files may be used or copied only in accordance with the terms of the agreement. The purchaser may make one copy of the software for backup purposes. No part of this online help system may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or information and retrieval systems, for any purpose other than the purchaser s personal use, without the written permission of Microsoft Corporation.
標(biāo)簽：
Information
Programmer
Reference
subject
上傳時間：
2015-08-04
上傳用戶：hxy200501
-
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標(biāo)簽：
introduction
the
contains
intended
上傳時間：
2013-12-23
上傳用戶：liansi
-
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標(biāo)簽：
project
implement
developed
Database
上傳時間：
2013-12-25
上傳用戶：semi1981
-
Procedure TSPSA:
begin
init-of-T { T為初始溫度}
S={1，……，n} {S為初始值}
termination=false
while termination=false
begin
for i=1 to L do
begin
generate(S′form S) { 從當(dāng)前回路S產(chǎn)生新回路S′}
Δt:=f(S′))-f(S) {f(S)為路徑總長}
IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])
S=S′
IF the-halt-condition-is-TRUE THEN
termination=true
End
T_lower
End
End
標(biāo)簽：
Procedure
init-of-T
TSPSA
begin
上傳時間：
2013-12-20
上傳用戶：shinesyh
-
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽：
Implemented
following
compile
command
上傳時間：
2014-01-01
上傳用戶：lhc9102
-
BNB20 Finds the constrained minimum of a function of several possibly integer variables.
％ Usage: [errmsg,Z,X,t,c,fail] =
％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...)
％
％ BNB solves problems of the form:
％ Minimize F(x) subject to: xlb <= x0 <=xub
％ A*x <= B Aeq*x=Beq
％ C(x)<=0 Ceq(x)=0
％ x(i) is continuous for xstatus(i)=0
％ x(i) integer for xstatus(i)= 1
％ x(i) fixed for xstatus(i)=2
％
標(biāo)簽：
constrained
variables
function
possibly
上傳時間：
2014-01-13
上傳用戶：youth25
-
This lab exercise will introduce you to the AccelWare IP generators. AccelWare is a library of over fifty IP generators, available in the form of three toolkits that produce synthesizable MATLAB for common MATLAB built in and toolbox functions. Each generator offers macro and micro-architecture selections that allow full customization of the generated model to the target application requirements.
標(biāo)簽：
AccelWare
generators
introduce
exercise
上傳時間：
2013-12-16
上傳用戶：2467478207
