代码搜索：mapping
找到约 10,000 项符合「mapping」的源代码
代码结果 10,000
www.eeworm.com/read/425882/10311795
m mapping.m
function A = mapping(n)
% To create a Morton Scan order matrix
if n == 2
A = [1 2; 3 4];
else
B = mapping(n/2);
A = [B B+(n/2)^2; B+(n/2)^2*2 B+(n/2)^2*3];
end
www.eeworm.com/read/425875/10312632
m mapping.m
function A = mapping(n)
% To create a Morton Scan order matrix
if n == 2
A = [1 2; 3 4];
else
B = mapping(n/2);
A = [B B+(n/2)^2; B+(n/2)^2*2 B+(n/2)^2*3];
end
www.eeworm.com/read/162122/10334958
m mapping.m
function out_m=mapping(in,pn,modu_mode)
switch modu_mode
case 1
for i=1:48
switch in(i)
case 0
out1(i)=-1;
out2(i
www.eeworm.com/read/160517/10522530
m mapping.m
%MAPPING Mapping class constructor
%
% W = MAPPING(MAPPING_FILE, MAPPING_TYPE, DATA, LABELS, SIZE_IN, SIZE_OUT)
%
% A map/classifier object is constructed. It may be used to map a dataset A
% on anoth
www.eeworm.com/read/160517/10522769
p mapping.p
www.eeworm.com/read/160489/10527077
m mapping.m
function out= mapping(signal_to_modu,pn,dight)
% pn=[1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,...
% 1,1,-1,1,1,-1,-1,1,1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,1,-1
www.eeworm.com/read/421883/10682748
h mapping.h
/* Minimal - the simplest thing that could possibly work
* Copyright (C) 2007 Jay Freeman (saurik)
*/
/*
* Redistribution and use in source and binary
* forms, with or without modifi
www.eeworm.com/read/418695/10935508
m mapping.m
%MAPPING Mapping class constructor
%
% w = mapping(map,d,lablist,k,c,v,par)
%
% A map/classifier object is constructed from:
% d size (any), a set of weights defining the mapping
% lablist size
www.eeworm.com/read/470683/6905772
mapping test.mapping
*A* 0
- 4
a1 1
a2 2
a3 3
*A* 1
- 3
b1 1
b3 2
*A* 2
- 4
c1 1
c2 2
c3 3
www.eeworm.com/read/470683/6905835
mapping test.mapping
*A* 0
- 4
a1 1
a2 2
a3 3
*A* 1
- 3
b1 1
b3 2
*A* 2
- 4
c1 1
c2 2
c3 3