代码搜索：基本运算
找到约 10,000 项符合「基本运算」的源代码
代码结果 10,000
www.eeworm.com/read/188543/8529518
m 12-6.m
I = imread('cameraman.tif');
J = uint8(filter2(fspecial('gaussian'), I));
K = imlincomb(1,I,-1,J,128);
% 运算关系式K(r,c) = I(r,c) - J(r,c) + 128
imshow(K)
www.eeworm.com/read/188543/8529539
m 12-3.m
I = imread('moon.tif');
I16 = uint16(I);
J = immultiply(I16,I16);
%类似矩阵点乘运算，但注意类型的处理
subplot(121),imshow(I)
subplot(122),imshow(J)
www.eeworm.com/read/185294/9044538
htm s03_07.htm
赋值运算符
var a=3,b=2;
document.writeln("a=3,b=2");
document.writeln
www.eeworm.com/read/185227/9049257
java arithop.java
//ArithOp.java
//Java中算术运算符的使用
public class ArithOp
{
public static void main(String args[])
{
int a=7+2; //a=9
int b=a*2; //b=18
int c=b/9; //c=2
int d=-a;
www.eeworm.com/read/184333/9109053
c cal_direct.c
#include "math.h"
#include "stdlib.h"
#include "stdio.h"
#define DYNUM 12
#define PI 3.1415926535897932384626433832795
#define WIE 7.292115E-5
#define Re 6.378137e6 //为了减小模拟的运算时间，把地
www.eeworm.com/read/182923/9184728
asm fft.asm
;-------------------------------------------------------------------------------------------------
;重庆大学DSP实验室
;函数名：void fft(void)
;功能：实现32、64或128采样点的快速傅立叶变换
;入口条件：Q15
; _sintab 存放FFT运算中用到的sin
www.eeworm.com/read/378041/9253199
m 12-6.m
I = imread('cameraman.tif');
J = uint8(filter2(fspecial('gaussian'), I));
K = imlincomb(1,I,-1,J,128);
% 运算关系式K(r,c) = I(r,c) - J(r,c) + 128
imshow(K)
www.eeworm.com/read/378041/9253214
m 12-3.m
I = imread('moon.tif');
I16 = uint16(I);
J = immultiply(I16,I16);
%类似矩阵点乘运算，但注意类型的处理
subplot(121),imshow(I)
subplot(122),imshow(J)