虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

v<b>Is</b>ualize

  • 光学设计软件zemax源码: This DLL models an nular aspheric surface as described in: "Annular surfaces in

    光学设计软件zemax源码: This DLL models an nular aspheric surface as described in: "Annular surfaces in annular field systems" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 December 1997 This surface is essentially an odd aspheric surface with an offset in the aspheric terms. The sag is given by: Z = (c*r*r) / (1+(1-((1+k)*c*c*r*r))^ 1/2 ) + a*(r-q)^2 + b*(r-q)^3 + c*(r-q)^4 + ... Note the terms a, b, c, ... have units of length to the -1, -2, -3, ... power.

    标签: described aspheric surfaces Annular

    上传时间: 2014-01-08

    上传用户:yyyyyyyyyy

  • 1、 了解系统调用fork()、execl()、exit()、getpid()和waitpid()的功能和实现过程 2、 编写一段程序实现以下功能: a) 使用系统调用fork()创建两个子进程

    1、 了解系统调用fork()、execl()、exit()、getpid()和waitpid()的功能和实现过程 2、 编写一段程序实现以下功能: a) 使用系统调用fork()创建两个子进程 b) 父进程重复显示字符串”parent:”,并使用函数getpid()显示自己的进程ID。 c) 两个子进程分别重复显示字符串”child:”,并使用函数getpid()显示自己的进程ID 3、 编写一段程序实现以下功能: a) 使用系统调用fork()创建一个子进程 b) 子进程显示自己的进程ID和字符串": The child is calling an exec.\n",然后通过execl()调用系统命令ps显示当前运行的进程情况,从而更换自己的执行代码,最后调用exit()结束。 c) 父进程显示自己的进程ID和字符串” ": The parent is waiting for child to exit.\n ",然后调用waitpid()等待子进程结束,并在子进程结束后显示”The parent exit.\n

    标签: fork waitpid getpid execl

    上传时间: 2013-12-18

    上传用户:叶山豪

  • BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [

    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 %

    标签: constrained variables function possibly

    上传时间: 2014-01-13

    上传用户:youth25

  • 代入法的启发示搜索 我的代码实现是:按照自然语言各字母出现频率的大小从高到低(已经有人作国统计分析了)先生成一张字母出现频率统计表(A)--------(e),(t,a,o,i,n,s,h,r),(

    代入法的启发示搜索 我的代码实现是:按照自然语言各字母出现频率的大小从高到低(已经有人作国统计分析了)先生成一张字母出现频率统计表(A)--------(e),(t,a,o,i,n,s,h,r),(d,l),(c,u,m,w,f,g,y,p,b),(v,k,j,x,q,z) ,再对密文字母计算频率,并按频率从高到低生成一张输入密文字母的统计表(B),通过两张表的对应关系,不断用A中的字母去替换B中的字母,搜索不成功时就回退,在这里回朔是一个关键。

    标签: 字母 频率 搜索 代码

    上传时间: 2015-10-24

    上传用户:wanqunsheng

  • %DEFINEV Scaling vector and derivative % % [v,dv]= DEFINEV(g,x,l,u) returns v, distances to the %

    %DEFINEV Scaling vector and derivative % % [v,dv]= DEFINEV(g,x,l,u) returns v, distances to the % bounds corresponding to the sign of the gradient g, where % l is the vector of lower bounds, u is the vector of upper % bounds. Vector dv is 0-1 sign vector (See ?? for more detail.) % % Copyright (c) 1990-98 by The MathWorks, Inc. % $Revision: 1.2 $ $Date: 1998/03/21 16:29:10 $

    标签: DEFINEV derivative distances Scaling

    上传时间: 2013-12-24

    上传用户:sz_hjbf

  • [输入] 图的顶点个数N

    [输入] 图的顶点个数N,图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径,则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法,从顶点A开始,依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B,则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M,再访问与VA2邻接顶点...,如此下去,直至找到B,最先到达B点的路径,一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点,然后将队头顶点从队列中删去。若队空,则说明到不存在通路。在访问顶点过程中,每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来,以便输出时回溯。 #include<stdio.h> int number //队列类型 typedef struct{ int q[20]

    标签: 输入

    上传时间: 2015-11-16

    上传用户:ma1301115706

  • This is a collection of m-files I created to complete a research project into the DC components of v

    This is a collection of m-files I created to complete a research project into the DC components of various encoding techniques. Eight of the files create random bit sequences that conform to their coding requirements. The others were files I found useful in the scope of the project and supplement the generating m-files.

    标签: collection components complete research

    上传时间: 2015-12-24

    上传用户:lnnn30

  • the calculator s usage! after you have inputed 2 operators,choose + - * / function! But the only

    the calculator s usage! after you have inputed 2 operators,choose + - * / function! But the only situation I did t deal with is that when you choos + fuction ,and the operaters signs is like this -A+B,just turn it to B-A!

    标签: calculator the operators function

    上传时间: 2016-02-12

    上传用户:lili123

  • 关于bf531的好程序

    关于bf531的好程序,抵抗力计划活动房HAOOBO B V

    标签: 531 bf 程序

    上传时间: 2013-12-19

    上传用户:凌云御清风

  • Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assum

    Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve. The computation uses a quasi-analytic (QA) technique that relies on the estimation (approximate one) of the information-bits Weight Enumerating Function (WEF) using A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.

    标签: convolutional Computes encoding decision

    上传时间: 2013-12-24

    上传用户:咔乐坞