代码搜索:Multiple

找到约 9,501 项符合「Multiple」的源代码

代码结果 9,501
www.eeworm.com/read/259112/11820228

m zak.m

function dzt=zak(sig,N,M) %ZAK Zak transform. % DZT=ZAK(SIG,N,M) computes the Zak transform of signal SIG. % % SIG : Signal to be analysed (length(X)=N1). % N : number of Zak coefficients in time (
www.eeworm.com/read/154209/11983380

m diric.m

function y=diric(x,N) %DIRIC Dirichlet, or periodic sinc function % Y = DIRIC(X,N) returns a matrix the same size as X whose elements % are the Dirichlet function of the elements of X. Positiv
www.eeworm.com/read/340486/12153770

notes

DEMO06 - Ray Plot - Multiples Here we have switched to general shooting mode (Record 7 = g), specified 2 source locations in file sources (Record 9), turned off the source well plot
www.eeworm.com/read/337328/12376366

m zerohold.m

function Y=zerohold(X,N) %ZEROHOLD Oversample the input X, by N times, using zero order hold. % Y=zerohold(X,N) % If X is a matrix then each row is over sampled % % See : SUBSAMP % Copyr
www.eeworm.com/read/250723/12387310

m zerohold.m

function Y=zerohold(X,N) %ZEROHOLD Oversample the input X, by N times, using zero order hold. % Y=zerohold(X,N) % If X is a matrix then each row is over sampled % % See : SUBSAMP % Copyr
www.eeworm.com/read/130965/14165249

c cmdtab.c

/* * Copyright (c) 1985, 1989, 1993, 1994 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modificatio
www.eeworm.com/read/233017/14172940

m zak.m

function dzt=zak(sig,N,M) %ZAK Zak transform. % DZT=ZAK(SIG,N,M) computes the Zak transform of signal SIG. % % SIG : Signal to be analysed (length(X)=N1). % N : number of Zak coefficients in time (
www.eeworm.com/read/129991/14213345

txt move n 16-bit elements from one memory location to another..txt

TEXAS INSTRUMENTS, INC. * * BLOCK MOVE * * Revision Date: 04/24/97 * * USAGE This routine is C Callable and can be called as: * * void blk_move(short *bl, short *zl, int n) * * bl --
www.eeworm.com/read/127767/14336268

txt e342. implementing a queue.txt

LinkedList queue = new LinkedList(); // Add to end of queue queue.add(object); // Get head of queue Object o = queue.removeFirst(); // If the queue is to be
www.eeworm.com/read/127767/14337776

txt e1041. preventing concurrent requests to a servlet.txt

By default, a servlet container will use a servlet instance to concurrently process multiple requests. Although, this behavior burdens the servlet developer to properly synchronize shared state, this