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

Generat<b>In</b>g

  • 图形学的一些概念说明

    图形学的一些概念说明,对R,G,B,alphy通道,灰度等概念都有一些说明

    标签: 图形

    上传时间: 2017-02-09

    上传用户:tonyshao

  • tensor   向量的推广。在一个坐标系下

    tensor   向量的推广。在一个坐标系下,由若干个数(称为分量)来表示,而在不同坐标系下的分量之间应满足一定的变换规则,如矩阵、多变量线性形式等。一些物理量如弹性体的应力、应变以及运动物体的能量动量等都需用张量来表示。在微分几何的发展中,C.F.高斯、B.黎曼、E.B.克里斯托费尔等人在19世纪就导入了张量的概念,随后由G.里奇及其学生T.列维齐维塔发展成张量分析,A.爱因斯坦在其广义相对论中广泛地利用了张量。

    标签: tensor 向量 坐标系

    上传时间: 2014-01-20

    上传用户:silenthink

  • Instead of finding the longest common subsequence, let us try to determine the length of the LCS.

    Instead of finding the longest common subsequence, let us try to determine the length of the LCS. 􀂄 Then tracking back to find the LCS. 􀂄 Consider a1a2…am and b1b2…bn. 􀂄 Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. 􀂄 Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn 􀂄 Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. 􀂄 Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.

    标签: the subsequence determine Instead

    上传时间: 2013-12-17

    上传用户:evil

  • 复接入

    复接入,B/W双用户使用直接扩频序列 % >>>multiple access b/w 2 users using DS CDMA % >>>format is : cdmamodem(user1,user2,snr_in_dbs) % >>>user1 and user2 are vectors and they should be of equal length % >>>e.g. user1=[1 0 1 0 1 0 1] , user2=[1 1 0 0 0 1 1],snr_in_dbs=-50 % >>>or snr_in_dbs=50 just any number wud do % Waqas Mansoor % NUST , Pakistan

    标签:

    上传时间: 2014-11-22

    上传用户:zl5712176

  • This article presents GISCoordinate.java - a class that allows you to represent a GIS coordinate in

    This article presents GISCoordinate.java - a class that allows you to represent a GIS coordinate in your JAVA code in decimal degrees (38.4443, e.g. 122.33433) , minute degrees (33 44 22E, 122 33 44N), or radian degrees. Also, you can use this class to manipulate the coordinate, moving it around the globe by giving it distances in feet and direction of travel. You can then extract the new coordinate that is calculated after the travel.

    标签: GISCoordinate coordinate represent presents

    上传时间: 2013-12-02

    上传用户:wangchong

  • 【问题描述】 设计一个利用哈夫曼算法的编码和译码系统

    【问题描述】 设计一个利用哈夫曼算法的编码和译码系统,重复地显示并处理以下项目,直到选择退出为止。 【基本要求】 (1)初始化:键盘输入字符集大小n、n个字符和n个权值,建立哈夫曼树; (2)编码:利用建好的哈夫曼树生成哈夫曼编码; (3)输出编码; (4)设字符集及频度如下表: 字符:A B C D E F 频度:4 9 23 2 17 15 字符:G H I J K 频度:1 2 3 3 4

    标签: 哈夫曼算法 编码 译码

    上传时间: 2017-03-07

    上传用户:qwe1234

  • We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder f

    We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.

    标签: effectiveness analytically numerically cloaking

    上传时间: 2017-03-30

    上传用户:zxc23456789

  • Program Description: The program asks the user to choice from the menu an option

    Program Description: The program asks the user to choice from the menu an option A. Check to see if a number is prime. B. Count the number of vowels in a line. X. Exit the program.

    标签: Description the Program program

    上传时间: 2017-04-08

    上传用户:磊子226

  • Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a

    Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.

    标签: Multiplicative undirected Shortest measured

    上传时间: 2017-04-08

    上传用户:邶刖

  • MATLAB implementation of time series prediction Based on the VQTAM method described in the following

    MATLAB implementation of time series prediction Based on the VQTAM method described in the following papers: G. A. Barreto & A. F. R. Araujo (2004) "Identification and Control of Dynamical Systems Using the Self-Organizing Map" IEEE Transactions on Neural Networks, vol. 15, no. 5.

    标签: implementation prediction described following

    上传时间: 2013-12-22

    上传用户:windwolf2000