亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

Half-maximum

  • zemax源碼: This DLL models a standard ZEMAX surface type, either plane, sphere, or conic The surfac

    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.

    標簽: standard surface models either

    上傳時間: 2013-12-05

    上傳用戶:003030

  • * CONSTRAINTS * This module does not handle data which is considered out of range by the * appli

    * CONSTRAINTS * This module does not handle data which is considered out of range by the * application(i.e. fixed constants which represent error condition) * * Maximum weight value must be limited to 128 to prevent an overflow * condition during the calculation. * * The internal data type must be large enough to handle the calculations. * The maximum possible internal value * = Max Input Value * (weight - 1) + Max Input Value * If a maximum weight of 128 is used, the internal data type should be 2 * times the size of the input data type.

    標簽: CONSTRAINTS considered module handle

    上傳時間: 2015-09-07

    上傳用戶:qunquan

  • function y_cum = cum2x (x,y, maxlag, nsamp, overlap, flag) %CUM2X Cross-covariance % y_cum = cum2x

    function y_cum = cum2x (x,y, maxlag, nsamp, overlap, flag) %CUM2X Cross-covariance % y_cum = cum2x (x,y,maxlag, samp_seg, overlap, flag) % x,y - data vectors/matrices with identical dimensions % if x,y are matrices, rather than vectors, columns are % assumed to correspond to independent realizations, % overlap is set to 0, and samp_seg to the row dimension. % maxlag - maximum lag to be computed [default = 0] % samp_seg - samples per segment [default = data_length] % overlap - percentage overlap of segments [default = 0] % overlap is clipped to the allowed range of [0,99].

    標簽: cum2x y_cum Cross-covariance function

    上傳時間: 2015-09-08

    上傳用戶:xieguodong1234

  • Input The input consists of two lines. The first line contains two integers n and k which are the l

    Input The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line. Output There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values. Sample Input 8 3 1 3 -1 -3 5 3 6 7 Sample Output -1 -3 -3 -3 3 3 3 3 5 5 6 7

    標簽: The two consists contains

    上傳時間: 2014-12-21

    上傳用戶:hongmo

  • A one-dimensional calibration object consists of three or more collinear points with known relative

    A one-dimensional calibration object consists of three or more collinear points with known relative positions. It is generally believed that a camera can be calibrated only when a 1D calibration object is in planar motion or rotates around a ¯ xed point. In this paper, it is proved that when a multi-camera is observing a 1D object undergoing general rigid motions synchronously, the camera set can be linearly calibrated. A linear algorithm for the camera set calibration is proposed,and then the linear estimation is further re¯ ned using the maximum likelihood criteria. The simulated and real image experiments show that the proposed algorithm is valid and robust.

    標簽: one-dimensional calibration collinear consists

    上傳時間: 2014-01-12

    上傳用戶:璇珠官人

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標簽: capacities stochastic addresses network

    上傳時間: 2015-12-03

    上傳用戶:xfbs821

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標簽: capacities stochastic addresses network

    上傳時間: 2013-12-25

    上傳用戶:ggwz258

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標簽: capacities stochastic addresses network

    上傳時間: 2014-01-09

    上傳用戶:二驅蚊器

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標簽: capacities stochastic addresses network

    上傳時間: 2013-12-28

    上傳用戶:獨孤求源

  • This directory builds the Tape class driver for Microsoft® Windows® Server 2003. The class dri

    This directory builds the Tape class driver for Microsoft® Windows® Server 2003. The class driver implements device-independent support, and exports support routines for device-specific tape miniclass drivers. It handles device-independent tape requests and calls the tape minidriver routines to process device-specific functions. Class driver splits transfer requests, when necessary, to fit the maximum transfer size for the underlying host bus adapter. It also provides device-independent, tape-specific error handling, and calls the tape miniclass driver s device-specific error handling routines.

    標簽: class Microsoft directory reg

    上傳時間: 2013-12-09

    上傳用戶:huangld

主站蜘蛛池模板: 石嘴山市| 眉山市| 昌平区| 庆安县| 嵊泗县| 思南县| 巩留县| 应城市| 永宁县| 渑池县| 景德镇市| 新巴尔虎右旗| 漳州市| 女性| 尼勒克县| 荔浦县| 加查县| 台东市| 滨海县| 浪卡子县| 江门市| 简阳市| 兴国县| 玉树县| 郁南县| 图木舒克市| 广元市| 龙游县| 平遥县| 潢川县| 新和县| 施甸县| 泾源县| 龙江县| 安达市| 象山县| 壶关县| 寻乌县| 阳东县| 大渡口区| 营山县|