Search - col - CodeBus

Search - col - List

[Other] GetColor(Win32) DL : 0: 使用Windows SDK编写的颜色取色器，方便实用。-Prepared using the Windows SDK color color check device, convenient and practical.
Date : 2025-12-27 Size : 21kb User : 罗海桃
[Other] col DL : 0: 计算器，实现Windows计算器的基本功能-Calculators, the realization of the basic functions of Windows calculator
Date : 2025-12-27 Size : 1.91mb User : southbear
[Other] Pubblicazioni-Recognition DL : 0: col of publications related to the recognition of emotions
Date : 2025-12-27 Size : 26.62mb User : darko
[Other] exce_read DL : 0: perl代码，读取excel单元内容，函数使用需要输入行列编号。-perl code，read data from excel file，user use the function must input row number and col number。
Date : 2025-12-27 Size : 3kb User : wangwang
[Other] CMatrix DL : 0: 该类包括矩阵行列数变量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
Date : 2025-12-27 Size : 7kb User : suncoke
[Other] color-parabola- DL : 0: 绘制彩色抛物线 c语言源代码 /*画抛物线的子函数spara()*/ /*row,col代表抛物线顶点的坐标，x1,y1是抛物线起点相对顶点的坐标*/ /*t为抛物线绕顶点旋转的角度*/-To draw color parabola c language source code
Date : 2025-12-27 Size : 1kb User : fei
[Other] migong-(2) DL : 0: .迷宫是一个m行n列的矩阵，其中0表示无障碍，1表示有障碍。设入口为（1，1），出口为（m,n），即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直到出口为止。 2.迷宫的功能要求随机生成一个m行n列的矩阵，为了操作方便可以在矩阵外围生成一圏障碍，设置东南西北四个方向，采用链栈进行操作。最后迷宫如不是通路给出“此迷宫元解”，如是通路要求输出所走过的路径。 3．结点结构类型描述如下 typedef struct node { int row int col struct node *next } -The maze is an m-by-n matrix, where 0 indicated that accessibility, 1 indicates that there is an obstacle. Let entrance (1,1), export (m, n), from the entry, along a direction forward discover, if we go through, then continue to move forward otherwise returned along the same route, from a different direction continue to explore until export. 2 the functional requirements of the maze randomly generates a matrix of m rows n columns, Juan obstacles for convenience of operation can be generated in the periphery of the matrix, set the direction of the four cardinal points, chain stack operation. The last maze if not given path " maze element solution, if path requires the path traversed by the output. 3. The node structure type description as follows typedef struct node {int row int col struct node* next }
Date : 2025-12-27 Size : 1kb User : 飞
[Other] 3x3-neighbor-pixel DL : 0: Description All the filters have needed neighbor data the current pixel in the image,here this function(res_window=cover_window(how many neighbor value for row ,how many neighbor value for column ,input image) produce the result( res_window(row,col,total size)) input inp_img=2d data(row * col) w=cover size w=[3 3] = 3x3 cover pixel generation output o_img=result 3d o_img(w(1),w(2),r*col) if inp_img=[1 2 3 4 5 6 ] w=[3 3] Soloution it will construct new image new_img=[0 0 0 0 0 0 1 2 3 0 0 4 5 6 0 0 0 0 0 0] result o_img(:,:,1)=[0 0 0 0 1 2 0 4 5] o_img(:,:,2)=[0 0 0 1 2 3 4 5 6] finally o_img(1:3,1:3,6) example a=imread( pears.png ) b=rgb2gray(a) c=cover_window( b,[3 3]) 3x3 window construction -Description All the filters have needed neighbor data the current pixel in the image,here this function(res_window=cover_window(how many neighbor value for row ,how many neighbor value for column ,input image) produce the result( res_window(row,col,total size)) input inp_img=2d data(row * col) w=cover size w=[3 3] = 3x3 cover pixel generation output o_img=result 3d o_img(w(1),w(2),r*col) if inp_img=[1 2 3 4 5 6 ] w=[3 3] Soloution it will construct new image new_img=[0 0 0 0 0 0 1 2 3 0 0 4 5 6 0 0 0 0 0 0] result o_img(:,:,1)=[0 0 0 0 1 2 0 4 5] o_img(:,:,2)=[0 0 0 1 2 3 4 5 6] finally o_img(1:3,1:3,6) example a=imread( pears.png ) b=rgb2gray(a) c=cover_window( b,[3 3]) 3x3 window construction
Date : 2025-12-27 Size : 175kb User : anandg
[Other] Algoritmo Col?nia de Abelhas2 DL : 0: Optimization algorithm proposed by Karaboga in 2005; Works with population; The candidate solutions represent the positions of the food sources; There is only one artificial bee employed for each food source; Recruitment in the colony represents how quickly you can find good solutions to the problem.
Date : 2025-12-27 Size : 603kb User : anapsc
[Other] Algoritmo Col?nia de Formigas DL : 0: They start from the anthill by random paths in search of food; They deposit pheromones wherever they pass; In the presence of pheromones they tend to follow that path; They find the smallest path between the anthill and the food; The pheromone evaporates with the passage of time;
Date : 2025-12-27 Size : 998kb User : anapsc