Location:
Search - COLS
Search list
Description: 矩阵运算的算法
用Type类数组创建矩阵对象
matrix(int rows,int cols) //创建矩阵,值为0
matrix(int n) //创建单位阵
matrix(const matrix &) //拷贝构造函数
BOOL Ismatrixf(){ return (rows==cols) } //判断矩阵是否为方阵
modifyrowscols(int rows,int cols) //修改矩阵的行列数
~matrix() {delete []elems } //析构函数
-matrix algorithm with Type category created matrix array object matrix (int rows, int cols) / / create matrix, value of 0 matrix (int n) / / create units matrix array (const matrix
Platform: |
Size: 51583 |
Author: 跑过的云 |
Hits:
Description: This file include the DCT and IDCT transform of an image.
void show_DCT( void )
void DCT_8x8( float* data )
void IDCT_8x8( float* data )
void BDCT( float* input,int rows,int cols )
void BIDCT( float* input,int rows,int cols )
void get_8x8DCT( float* output, int pos_y, int pos_x, float* image, int rows, int cols )
void set_identity( float* data, int size, bool flag )
float* mult_8x8( float*data1,float*data2 )
float* sm_mult_8x8( float *C1, float *A, float *C2 )
float* add_8x8( float*data1,float*data2 )
void initial_fast()
void close_fast()
void get_fast_8x8DCT_sparse( float* output, int pos_y, int pos_x, float* input, int rows, int cols )
void get_fast_8x8DCT( float* output, int pos_y, int pos_x, float* input, int rows, int cols, bool sparse )
Platform: |
Size: 5049 |
Author: wan_xianglin |
Hits:
Description: （1） 设计和编写代表矩阵的Matrix类。该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造方法Matrix()、Matrix(int rows,int cols)、Matrix(int rows,int cols,double data[][])，获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData(int row,int col,double value)，计算两个矩阵的乘积的方法multiply(Matrix m)以及toString()等内容。
Platform: |
Size: 7814 |
Author: fangfei |
Hits:
Description: 矩阵运算的算法
用Type类数组创建矩阵对象
matrix(int rows,int cols) //创建矩阵,值为0
matrix(int n) //创建单位阵
matrix(const matrix &) //拷贝构造函数
BOOL Ismatrixf(){ return (rows==cols) } //判断矩阵是否为方阵
modifyrowscols(int rows,int cols) //修改矩阵的行列数
~matrix() {delete []elems } //析构函数
-matrix algorithm with Type category created matrix array object matrix (int rows, int cols)// create matrix, value of 0 matrix (int n)// create units matrix array (const matrix
Platform: |
Size: 1565696 |
Author: 跑过的云 |
Hits:
Description: This file include the DCT and IDCT transform of an image.
void show_DCT( void )
void DCT_8x8( float* data )
void IDCT_8x8( float* data )
void BDCT( float* input,int rows,int cols )
void BIDCT( float* input,int rows,int cols )
void get_8x8DCT( float* output, int pos_y, int pos_x, float* image, int rows, int cols )
void set_identity( float* data, int size, bool flag )
float* mult_8x8( float*data1,float*data2 )
float* sm_mult_8x8( float *C1, float *A, float *C2 )
float* add_8x8( float*data1,float*data2 )
void initial_fast()
void close_fast()
void get_fast_8x8DCT_sparse( float* output, int pos_y, int pos_x, float* input, int rows, int cols )
void get_fast_8x8DCT( float* output, int pos_y, int pos_x, float* input, int rows, int cols, bool sparse )
-This file include the DCT and IDCT transform of an image.
void show_DCT( void )
void DCT_8x8( float* data )
void IDCT_8x8( float* data )
void BDCT( float* input,int rows,int cols )
void BIDCT( float* input,int rows,int cols )
void get_8x8DCT( float* output, int pos_y, int pos_x, float* image, int rows, int cols )
void set_identity( float* data, int size, bool flag )
float* mult_8x8( float*data1,float*data2 )
float* sm_mult_8x8( float*C1, float*A, float*C2 )
float* add_8x8( float*data1,float*data2 )
void initial_fast()
void close_fast()
void get_fast_8x8DCT_sparse( float* output, int pos_y, int pos_x, float* input, int rows, int cols )
void get_fast_8x8DCT( float* output, int pos_y, int pos_x, float* input, int rows, int cols, bool sparse )
Platform: |
Size: 5120 |
Author: wan_xianglin |
Hits:
Description: （1） 设计和编写代表矩阵的Matrix类。该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造方法Matrix()、Matrix(int rows,int cols)、Matrix(int rows,int cols,double data[][])，获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData(int row,int col,double value)，计算两个矩阵的乘积的方法multiply(Matrix m)以及toString()等内容。-(1) design and preparation on behalf of Matrix Class Matrix. Including the ranks of such matrices int rows and the number of variables int cols, matrix data array double data [][], constructor Matrix (), Matrix (int rows, int cols), Matrix (int rows, int cols, double data [] []), to obtain the value of a certain element method getData (int row, int col), set the value of a certain element method setData (int row, int col, double value), the product of two matrices calculation method multiply (Matrix m) as well as the toString () and so on.
Platform: |
Size: 7168 |
Author: fangfei |
Hits:
Description: 键盘控制器VHDL代码
该控制器实时扫描矩阵键盘的行列，当用户有按键按下时，可以定位到对应的按键并产生一个中断信号-Keyboard controller entity
--
-- The controller scans the columns, cols, by making a different column logic-0
-- therefor the inputs have to be pull-up high. It processes the input, rows, and
-- the pressed key to a corresponding scancode and giving an interrupt
--
Platform: |
Size: 7168 |
Author: 郑佛少 |
Hits:
Description: Matrix类。该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造方法Matrix()、Matrix(int rows,int cols)、Matrix(int rows,int cols,double data[][])，获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData(int row,int col,double value)，计算两个矩阵的乘积的方法multiply(Matrix m)以及toString()等内容。-Matrix class. This class includes matrix, int rows, and the ranks of the number of variables int cols, matrix data array double data [][], constructor Matrix (), Matrix (int rows, int cols), Matrix (int rows, int cols, double data [] []), to obtain the value of an element methods getData (int row, int col), set the value of an element methods setData (int row, int col, double value), the calculation method of the product of two matrices multiply (Matrix m) as well as the toString () and so on.
Platform: |
Size: 1024 |
Author: 艾枫 |
Hits:
Description: create random ecoc matrix, trying to maximize HD between rows and cols.
Platform: |
Size: 1024 |
Author: cemrezor |
Hits:
Description: 是 COLSYS 的更新版。国外有名的解常微分BVP的求解器，对奇异问题有很好的适应性。-C this package solves boundary value problems for
C ordinary differential equations, as described below.
C
C COLNEW is a modification of the package COLSYS by ascher,
C christiansen and russell [1]. It incorporates a new basis
C representation replacing b-splines, and improvements for
C the linear and nonlinear algebraic equation solvers.
C the package can be referenced as either COLNEW or COLSYS.
Platform: |
Size: 30720 |
Author: 刘项 |
Hits:
Description: 假设 Form1 窗体有 MSFlexGrid1 控件，在 Form1 代码窗口贴下面代码，MSFlexGrid1 和其中单元格就会跟着窗体大小变化而变化：- gridTopRatio = .Top/Me.Height
gridWidthRatio = .Width/Me.Width
gridHeightRatio = .Height/Me.Height
ReDim colWidthRatio(.Cols- 1)
ReDim rowHeightRatio(.Rows- 1)
For i = 0 To .Cols- 1
colWidthRatio(i) = .ColWidth(i)/Me.Width
Next i
For i = 0 To .Rows- 1
rowHeightRatio(i) = .RowHeight(i)/Me.Height
Next i
End With
End Sub
Platform: |
Size: 2048 |
Author: midefeng |
Hits:
Description: （1） 设计和编写代表矩阵的Matrix类。该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造方法Matrix()、Matrix(int rows,int cols)、Matrix(int rows,int cols,double data[][])，获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData(int row,int col,double value)，计算两个矩阵的乘积的方法multiply(Matrix m)以及toString()等内容。-(1) design matrix and write on behalf of the Matrix class. This category includes the number of variables int rows matrix ranks and int cols, matrix array of data double data [][], constructor Matrix (), Matrix (int rows, int cols), Matrix (int rows, int cols, double data [] []) method to obtain the value of an element getData (int row, int col), set the value of an element of the method setData (int row, int col, double value), the calculation of two matrices method multiply (Matrix m) and toString () and so on.
Platform: |
Size: 54272 |
Author: 王晓菲 |
Hits:
Description: （1） 设计和编写代表矩阵的Matrix类。该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造方法Matrix()、Matrix(int rows,int cols)、Matrix(int rows,int cols,double data[][])，获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData(int row,int col,double value)，计算两个矩阵的乘积的方法multiply(Matrix m)以及toString()等内容。
（2） 编写测试类MatrixTest，并在该类中创建两个矩阵对象，计算其乘积。
（3） 程序调试通过后填写实验报告。
-( 1) the design and preparation of matrix representing a class Matrix. This category includes matrix ranks number variable int rows and int cols, double data matrix data array [ ] [ ], tectonic method Matrix ( ), Matrix ( int rows, int cols ), Matrix ( int rows, int cols, double data [ ] [ ] ), to obtain an element value method of the getData ( int row, int Col ), set a certain element value method of the setData ( int row, int col, double value ), calculate the product of two matrices method for multiply ( Matrix m ) and toString ( ) etc..( 2 ) preparation of class MatrixTest, and in this class to create a two matrix object, computing the product.( 3) through debugging procedures after completing the experiment report.
Platform: |
Size: 1024 |
Author: 刘凯 |
Hits:
Description: Mobile Ad hoc NETwork (MANET) comprises of nodes,
which are free to move randomly, yet cooperate to forward
packets between source and destination over a multi-hop
wireless network. Due to absence of any fi xed node, each
node acts as a router, providing routing capability for the
MANET. Various protocols for discovery of routes be-
tween any two MANET nodes have been designed. These
protocols are broadly categorized as on-demand proto-
cols and table driven protocols. Dynamic Source Routing
(DSR) and Ad-hoc On-Demand Distance Vector (AODV)
are the two most matured on-demand routing protocols,
while Optimized Link State Routing Protocol (OLSR)
and Topology Dissemination Based on Reverse-Path For-
warding (TBRPF) are the two most matured table driven
routing protocols. This paper proposes enhancements in
DSR to provide secured route discovery and improved
Platform: |
Size: 176128 |
Author: payal |
Hits:
Description: Otsu算法步骤如下：
设图象包含L个灰度级(0,1…,L-1)，灰度值为i的的象素点数为Ni ，图象总的象素点数为N=N0+N1+...+N(L-1)。灰度值为i的点的概率为：
P(i) = N(i)/N.
门限t将整幅图象分为暗区c1和亮区c2两类，则类间方差σ是t的函数：
σ=a1*a2(u1-u2)^2 (2)
式中，aj 为类cj的面积与图象总面积之比，a1 = sum(P(i)) i->t, a2 = 1-a1 uj为类cj的均值，u1 = sum(i*P(i))/a1 0->t,
u2 = sum(i*P(i))/a2, t+1->L-1
该法选择最佳门限t^ 使类间方差最大，即：
令Δu=u1-u2，σb = max{a1(t)*a2(t)Δu^2}-int otsu (IplImage*image, int rows, int cols, int x0, int y0, int dx, int dy, int vvv)
{
unsigned char*np // 图像指针
int thresholdValue=1 // 阈值
int ihist[256] // 图像直方图，256个点
int i, j, k // various counters
int n, n1, n2, gmin, gmax
double m1, m2, sum, csum, fmax, sb
·····
Platform: |
Size: 1549312 |
Author: 燕子一舞 |
Hits:
Description: // 求多元回归方程：Y = B0 + B1X1 + B2X2 + ...BnXn
// data[rows*cols]二维数组；X1i,X2i,...Xni,Yi (i=0 to rows-1)
// rows：数据行数；cols数据列数；Answer[cols]：返回回归系数数组(B0,B1...Bn)-generalized least squares
Platform: |
Size: 703488 |
Author: hongzhiyi |
Hits:
Description: 该类包括矩阵行列数变量int rows和int cols，矩阵数据数组double data[][]，构造c++语言实现任意维数matrix类，方法Matrix()、获取某元素值的方法getData(int row,int col)，设置某元素值的方法setData，计算两个矩阵的乘积的方法multiply(Matrix m)等-Class including the the matrix ranks number variable int rows int cols, matrix data array double data [] [], constructor Matrix () to get the value of an element methods getData (int row, int col) to set the value of an element setData, calculation method multiply (Matrix m) of the product of two matrices
Platform: |
Size: 7168 |
Author: suncoke |
Hits:
Description: jqpuzzle让您轻松地创建您的网页，滑动拼图。选择一个图像，把它放在你的页面，并添加一些神奇的–jqpuzzle会自动把它变成一个彻头彻尾的滑动拼图。
如果你想，你可以高度自定义（行/列数，孔的位置，初始状态，控制，动画速度）和滑动拼图风格你根据你的需要。几种语言的接口是可用的，并且你可以添加你自己的文本在飞。
jqpuzzle可以用三种方式：最简单的一种是简单地添加一个类的名字你的形象。此外，一个CSS微格式（这不过是一个二类名称）允许你控制难题的基本性质。最后，你可以使用jqpuzzle()方法克服了所有的设置完全控制。-jqPuzzle lets you easily create sliding puzzles for your web page. Select an image, put it in your page, and add some magic – jqPuzzle will automatically turn it into a full-blown sliding puzzle.
If you want, you can highly customize (number of rows/cols, hole position, initial appearance, controls, animation speeds) and style your sliding puzzle according to your needs. The interface is available in several languages, and you can add your own texts on the fly.
jqPuzzle can be used in three ways: The easiest one is to simply add a class name to your image. Additionally, a CSS micro format (which is nothing but a second class name) allows you to control the basic properties of your puzzle. Finally, you can use the jqPuzzle()-method to get full control over all settings.
Platform: |
Size: 19456 |
Author: asdgio |
Hits:
Description: Given a matrix with m rows and n cols (m points in R^n), use resampling and the Kolmogorov Smirnov test to score [0,1] all points (as potential outliers) in linear time.
This is an original algorithm that can be used for anomaly detection and general signal processing.
Platform: |
Size: 65536 |
Author: markosovs |
Hits:
Description: In this dissertation, there are four main aspects included: energy reservation on
MAC layer, secure improvement for DoS attacks on MAC layer, query processing with
uncertainty for sensor systems, and throughput maximization on MAC layer
for ultra wideband communication systems.
In energy reservation, we proposed asynchronous MAC (A-MAC) protocol and
asynchronous schedule-based MAC (ASMAC) protocol. A-MAC and ASMAC proto-
cols are attractive due to their suitabilities for multihop networks and capabilities of
removing accumulative clock-drifts without any network synchronization. Moreover, we
build a traffic-strength- and network-density-based model to adjust essential algorithm
parameters adaptively-In this dissertation, there are four main aspects included: energy reservation on
MAC layer, secure improvement for DoS attacks on MAC layer, query processing with
uncertainty for sensor systems, and throughput maximization on MAC layer
for ultra wideband communication systems.
In energy reservation, we proposed asynchronous MAC (A-MAC) protocol and
asynchronous schedule-based MAC (ASMAC) protocol. A-MAC and ASMAC proto-
cols are attractive due to their suitabilities for multihop networks and capabilities of
removing accumulative clock-drifts without any network synchronization. Moreover, we
build a traffic-strength- and network-density-based model to adjust essential algorithm
parameters adaptively
Platform: |
Size: 692224 |
Author: amir |
Hits: