【Neural signal processing and analysis zero to hero】- 1

news2024/12/26 20:40:39

The basics of neural signal processing

course from youtube: 传送地址

Possible preprocessing steps

在这里插入图片描述

Signal artifacts (not) to worry about

doing visual based artifact rejection so that means that before you start analyzing, you can identify those data epics and simply remove them or make a decision about whether you think that it might be possible to isolate and separate out that artifact.
here you see these 64 channels EEG data.
In the middle, there are some big deflections appear in many channels, so these turn out to be this is each time the subject blinked their eye.
在这里插入图片描述

Topographical mapping

this shows a layout withe 64 electrodes, the electrodes are positioned on the scalp and you can see that there are colors all everywhere.
we actually didn’t measure any data at this point there was no data measured except for exactly where these black dots. and so how can we draw the colors here if we didn’t actually measure any data well this is done based on something called interpolation.
what was happening at this time point in the experiment(the left topographical map) , the answer is that at this time point in the experiment there was a visual stimulus that was shown on a computer screen so here you can see activity in posterior regions corresponding to the activation of visual cortex.
that’s
what we see here here the subject made a response they pressed a button with the right hand (the right topographical map) and we see activation of this kind of central lateral sensory motor area here.
so we can already determine a lot about what’s happening in the experiment just based on looking at the topographical maps.
在这里插入图片描述
here you see another advantage of looking at topographical maps and that is to identify potentially bad electrodes so what I’ve done here this is actually a clean dataset this is showing the top of ethical maps at different time points of the number in this box corresponds to time points in milliseconds after a stimulus onset so that’s already interesting you can see how activity is unfolding over time and what I’ve done here in this otherwise clean dataset is replace one electrode with pure noise.
在这里插入图片描述
Electrode labeling conventions
every electrode gets first a letter or sometimes two letters and then it gets a number so we have a combination of letters and numbers and the letters indicate the topographical region.
sometimes you get these extra letters so in this case this would be frontal pole you can see here is the the frontal pole so this is even more anterior than the F channel so that’s called FP.
the odd numbers are in the left hemisphere.
the even numbers are in the right hemisphere.
在这里插入图片描述
在这里插入图片描述

overview of time-domain analyses(ERPs)

what do you notice about the relationship between the event related potential and the single trial voltage fluctuations which you’ve probably noticed is that it’s quite a bit smaller it’s around an order of magnitude
smaller the ERP tends to be around an order of magnitude smaller than the single trial variability.
在这里插入图片描述
this called phase-locked or non-phased signals
在这里插入图片描述

Motications for rhythm-based analyses

b is the time frequency from trail 1 to 3, and then the right here you see that these narrowband frequency rhythms here are present in the time frequency plot here and then what you see here is the average of these there individual over all of those three individual plots. then you see both the phase-locked response and the non phase-locked response in the same signal so by applying these time frequency analysis we are extracting **more information from the signal ** than what we get from just from ERP.
在这里插入图片描述
when something is phase-locked and time locked then you will see it in the time frequency analysis and you’ll see it in the event related potential.
if something is time locked if the activity is time locked but non phase locked then you get this situation that the event related potential goes to zero.
在这里插入图片描述

Studying the brain in the lab

Two methods : Imaging and Electrophysiolog
在这里插入图片描述

Interpreting time-frequency plots

the left is a signal in the time domain. and the right we have a graph that’s going to be in the frequency domain this is going to be a power spectrum that we are going to build.
build a power spectrum from this time domain signal that’s done through an operation called the Fourier transform.
在这里插入图片描述
the general idea of how the Fourier transform works is that you start with your signal and then you take a sine wave this is a pure sine wave at some frequency and you just line them up on top of each other and then you ask the question how similar does this signal look like the sine wave.
then you calculate how similar is the signal and the sine wave and generate a plot so a bar at this particular frequency corresponding to the frequency of the sine wave.
在这里插入图片描述
end of this signal and when you repeat this procedure for many different frequencies so different sine waves with different frequencies you are going to end up building up a spectrum that looks like this so here you see the frequency of the sine wave .
this y-axis here corresponds to like the amount of similarity or the energy between the signal and the sine wave at these different frequencies now this particular graph is shown in a relative.
but those temporal dynamics are not visible in the spectrum and that’s why I call this a static spectrum.
在这里插入图片描述
so what we want to do is basically take this representation and split it up over different parts of the time window.
this is
called well here I call it a dynamic spectrum but it’s called a time frequency plot and it’s called a time frequency plot because it shows how information changes over time.
the static spectrum plot just from one time window, so you can imagine that you would color these positive values red and these negative values blue and then you could like spin this or rotate this line so that it’s one column in this matrix so here you can see at lower frequencies it’s red that means its positive here and at higher frequencies it gets blue its negative.
在这里插入图片描述

How to inspect time-frequency results like a pro

在这里插入图片描述
this is an example: five step plan
step one: we can see the title is db-convert TF power plot, so it’s a db convert time frequency power graph
step two: we see that it is a symmetric color scale, the negative side and the positive side are the same magnitude and that also tell us that zero which is relative so no relative changes in power correspinds to this green color. the time axes go from looks like minus 300 milliseconds up to one second so in total we have around a second and a quarter or a second and a third of time. the frequency axes we can see the lowest frequency maybe one or two hertz and it goes up to hertz.
step three: distributed or localized? you see this blue patch is kind of fairly distributed over time it seems to last for 800 or maybe 900 milliseconds so it’s almost a second but it’s fairly limited in frequency so it’s most of this goes from 20 to 25 hertz and this little burst that goes up to 390 hertz. and we can also see a couple of other features(red) here that all tend to be a little bit band-limited so they are existing in a narrow frequency band so narrow on the y axis is relevant for interpreting time frequency features because to interpret something as an oscillation as a narrowband activity. whether there are features in a time frequency plot that cut off by the axes. (consider about axes)
step four: link the results to the experiment design.
step five: but we can’t determine whether the results is meaningful or not.
在这里插入图片描述

Where to get more EEG data?

在这里插入图片描述

Simulating noise for analysis evaluation

to crate white noise we can draw numbers from two different distributions a normal distribution of course is also a Gaussian distribution or a bell-curve distribution where the probability is highest for numbers that are close to zero. and we have a uniform distribution of noise where all the values between 0 & 1 are equally likely to be selected and there’s no possibility of getting number less than 0 or greater than 1.
在这里插入图片描述
在这里插入图片描述
we actually focus on ongoing signals one of that is through a sine wave and the we can else change this formula around a little bite or add some modification to this basic sine formula to generate more interesting and non stationary patterns.
the formula for the sine wave, a is an amplitude parameter so it defines basically the height of this curve. f is frequency which defines the speed of the oscillation. t is time typically in seconds and theta is a parameter that defines the speed shift on the x axis so kind of taking this whole function and sliding it back and forth so left and right on the x axis.
it’s a stationary signal because its properties are not changing over time so it has one parameter for amplitude and that is constant over time .
在这里插入图片描述
we can modify this to have a non stationary ongoing signal, just like the below graph, the frequency is changing over time, the sine wave is faster and then slower and then faster…
the xt formulate that governs this time series and so what you do is you start with a vector f that is the istaneous frequency that you want, the delta is data sampling rate, t is the time, k would be the individual time point and this generates some other vector called X and then X goes into sine function. it’s sine 2pi times the quantity xt plus tt. tt is the TF time point in the vector of time points and that generates each each time point in the output vector y.
why we create data in a way that looks like this is that this is actually a closer approximation to the kinds of signals that actually measured in real brain signals.
在这里插入图片描述
here we are primarily going to talk a little bit about generating transient activity.
This is a Time domain Gaussian equation y, a=1.5 c=0.5 h=1.1
在这里插入图片描述
This is a frequency domain gaussian. the idea of creating a guassian frequency domain is take the inverse Fourier transform of this shape
在这里插入图片描述

Time and frequency domains

the way from time domain to frequency domain is count the number of rhythms the number of pulses or repetitions cycles that we see in the period of one second , we see int the first time graph, there is three cycle, so get a bar here at 3 Hertz then the height of this bar is 1 here.
the third graph is first graph plus second graph, it has two components one at three Hertz with an amplitude of one and one at five Hertz with amplitude of two.
at five here highlights one of the frequency-domain compared to the time domain and that is that if the signal contains rhythmic narrow compañero band components which is the case here it’s not the case for all signals but if the signal is made up of narrowband spectral features then you can understand the signal much better and much faster when looking at the signal in the frequency domain compared to the time domain again.
在这里插入图片描述
here you can count five this is gonna be much harder you’re not really going to be able to guess that this is a three Hertz sine wave plus a five-foot sine. but when you look at it in the frequency domain it is totally trivial you see immediately that we have a three Hertz sine wave component with an amplitude of 1 plus broadband noise with low amplitude and the same story here and same story here.
when you add up all of these little and contributions of small power for a lots and lots of frequencies in the time domain that ends up being a large amount of noise even though for any individual frequency it’s quite small so therefore looking at a signal in the frequency domain can also improve the signal to noise characteristics of interpreting the signal and that is the second advantage of the frequency domain.
在这里插入图片描述

Computational foundations of the Fourier transform

simulating ongoing sine waves
在这里插入图片描述
在这里插入图片描述
在这里插入图片描述

How the DTFT works(loop algorithm)

we want compute the dot product between the sine wive and the signal(dot product is valid only when both vectors in this case the signal and the sine wave have the same number of numbers). now you can imagine that the dot product between this sine wave and the signal is going to be large because they look really similar.
the magnitude of that product gets plotted on the y-axis at the x-axis location corresponding to the frequency of this sine wave.
在这里插入图片描述
the dot product the real value dot product between the sine wave and a signal is very much dependent on the phase of signal , the signal of the sine wave.
then we move on to some other frequency, so if we use this yellow sine wave, the dot product is not going to be as large and that is why we need to use a complex valued sine wave and not just a real valued sine wave. complex valued sine wave accounts for any possible phase relationship between the signal and the complex valued sine wave and that phase offset is handled because the signal is going to look something like the cosine.
so the procedure gets repeated for lots of sine waves.
在这里插入图片描述
think about a high dimensional space where each dimension each axis is defined by a signal time point, if you have a signal that has 700 time points, then is space is going to be a 700 dimensional space. each axis correspond to the millivolt or microvolt.
so the signal plot to this space is a vector, the sine wave is just some other waves, the signal is a real-valued signal and this is a real-valued space. we can compute the dot product of the signal and csw, we all the dot product “Fourier coefficient”, m is amplitude and theta is phase.
在这里插入图片描述
在这里插入图片描述

The formula to convert indices to Hz

N is the number of time points, so the time points int the signal defines the number of frequency or frequency resolution that we can extract from that signal.
first we create a complex valued sine wave, the fourierTime is a normalized time vector goes from 0 to 1 in n steps where n is the number of time points in the signal. this sine wave here the units are not in Hertz, these are frequencies in indices. (so the fouriersin is a sine wave, have the same time points with signal, and the vector of sine wave from 0-1.) this is a very important feature of the Fourier transform because you want the Fourier transform to be a general operation that always works so you don’t want to have a different Fourier transform for when you sample your data in milliseconds and a different Fourier transform if you sample your data in days.
second part to compute fourier coefficient. so if we finished this loop we have all these Fourier coefficients for each frequency
在这里插入图片描述
but what we want to do for spectral analysis and subsequent time frequency analysis is to interpret these Fourier coefficients in terms of their frequency in Hertz right that’s what we care about we care about physical units of Hertz.
so how do we convert from these indices these looping indices into units of Hertz well this is the formula we say that the vector of Hertz is linearly spaced numbers from zero to the sampling rate divided by two in n divided by 2 plus 1 steps so this sampling rate divided by 2 is called the Nyquist frequency. n is the time point in signal. every element in this vector represent a frequency.
在这里插入图片描述
Now we discuss how lower and higher bound on frequency
lower bound on frequencies
we can have a frequency of 0, that’s just a flat line, this is often called DC where DC stand s for direct current that comes from engineering. we can back to the code of the fourier transform, in the first iteration of the loop, fi equals 1, fi minus 1 is 0, then you have basically all of this turns to 0 because we’re multiplying by 0 so that gives us e to the 0 and any number to the power of 0 any number raised to 0 is 1 so this here for the first iteration of this loop this quote-unquote complex sine wave is actually just a vector of all ones and then what do we do here we are computing the dot product of the signal and a vector of all ones which really just means that we’re adding all of the signal values all the values in the signal get added up together and then later we divide by n we divide by the number of numbers and then that literally gives us the average value of the signal.
在这里插入图片描述
Upper bound to frequencies
theory two samples per cycle is the absolute minimum number of samples that you need to accurately reconstruct a fluctuating signal like this. so that means our upper bound is two points per cycle which means one half of the sampling rate and that is called the Nyquist frequency在这里插入图片描述
so the formula for converting frequencies from arbitrary indices into units of Hertz.在这里插入图片描述

Positive and negative frequencies

to complex signal, the Fourier transform contains real-value signals and complex signals because complex signals contain phase information.
在这里插入图片描述
The Fourier transforms we are using complex sine waves Euler’s formula complex sine waves to represent all of the information in a real-valued signal. so how can we get a real-valued signal from complex valued numbers complex valued sine waves the answer is we have to follow this formula.
在这里插入图片描述
how can we get this formula? why there is a 1/2? for example:
在这里插入图片描述
so now we can understand why the formula for converting frequencies from arbitrary indices into units of Hertz, the step is N/2+1. the for n over two plus one we have n over two because half of the spectrum is to the left of Nyquist so the positive frequencies and then the plus one because the zero Hertz we keep that on the left side of the spectrum.
why we need exactly n frequencies in the fourier transform, why we need negative frequencies is that we need to make sure that the Fourier transform is perfect invertible transform without any loss. we do not want approximate a signal we want to quantify it exactly.
but we need to know, these frequencies are going to be correct only up until the Nyquist frequency, above the Nyquist frequency is no longer be valid. so the formula is just a coding trick, if you sampling rate is 1000Hz, and 990Hz it’s actually minus 10.
在这里插入图片描述

Accurate scaling of Fourier coefficients

the output of the FFT function has units that are basically uninterpretable and that will lead to a discussion of two scaling factors two normalization factors that you can apply to the Fourier coefficients in order to interpret or put the Fourier coefficients back into the units of the original data.
here is a few lines of Matlab code essentially just taking the sine of some numbers, the amplitude of this sine wave is 1, the take the FFT functions, the output of FFT function is the series of Fourier coefficients which the use abs function. the function will extract the magnitude which is the distance from the origin of each Fourier coefficient.
在这里插入图片描述
so we will get this bar, the amplitude is almost 150, because the amplitude of sin wave is 1, in the loop over frequencies, if fi = 1, the fouriersin = exp(0) = 1, so the fouriersin . * signal = signal, then the sum will to get larger and larger because we just summing together more and more numbers.
if we want to get the average value of the signal we have to divide by the number of data points in the signal that gives us the average. understand to internalize when thinking about the zero Hertz frequency so this is one of the two normalization factors for a for the Fourier coefficients.
you’re computing a lot of sums here so then we want to divide by n and that is like an average that’s basically taking the average of the relationship between the complex sine wave and the signal now let’s go back here and look at this so the number of points in this time series here is 300 so if we were to divide this by 300 that would bring this from 150 down to 0.5 it would bring us down to 1/2 and now that is still not exactly the right answer the right answer should be 1 because the amplitude of sin(x) is 1.
在这里插入图片描述
在这里插入图片描述
so what is the second normalization factor is to multiply by two. because the amplitude gets split between the positive frequencies and the negative frequencies so we can double the positive frequencies and then ignore the negative frequencies now just to be clear the doubling is valid.
that these two scaling factors are linear multiplicative factors they change the y-axis values but they do not change the shape of the spectrum so the spectrum is not going to look any different if you have if you apply or don’t apply these two normalization factors and therefore scaling is not always necessary scaling the so applying these two normalization factors is necessary only if you want the results of the Fourier transform to have the same units as the original signal.
在这里插入图片描述
zero also the Nyquist but we are particularly concerned with the zero Hertz frequency is not doubled it’s not doubled because zero has no corresponding negative frequency.
在这里插入图片描述

The perfection of the Fourier transform

the goal of the Fourier transform is to get a time domain signal into the frequency domain that transformation from the time domain into the frequency domain is absolutely perfect it is lossless. the Fourier transform is not an approximation of the signal it is an exact representation of the signal so no information is loss.

The Inverse Fourier transform

similar operation to get back from the frequency domain into the time domain that operation is called the inverse Fourier transform so the inverse Fourier transform.
we start off with the Fourier coefficients so we already have all of the complex valued Fourier coefficients and what we want to do is reconstruct a signal in the time domain so here’s how it works you start off with one Fourier coefficient like this so here you see the complex plane and this would be for frequency equals one。 so what you do is you take this Fourier coefficient and you multiply it by a template complex sine wave. because it doesn’t have its own unique amplitude or phase parameter so the amplitude is 1 and the phase is set to zero.
在这里插入图片描述
next step is to take another Fourier coefficient at a different frequency and multiply taht by another complex sine wave and of course the frequency of this complex sine wave corresponds to the frequency from which you took this Fourier coefficient. from 1 to n
在这里插入图片描述then you simply sum all of the modulated complex sine waves together so you sum all of these things
在这里插入图片描述
why we need forward/ inverse FT?
在这里插入图片描述

Frequency resolution and zero-padding

the number of frequencies the number of sine waves that we construct in the Fourier transform is a product of N or is determined by n where n is the length of the signal this is the number of time points you have in your signal.
so here we have a short signal with only a few time points and that means we have pretty sparse frequency sampling here.
在这里插入图片描述
now imagine what happens if we take more time points from that same signal so we just take a longer data segment well M is now higher so zero hasn’t changed the Nyquist frequency hasn’t changed because we still have the same sampling rate but we have more points between zero and Nyquist so the frequency resolution is higher.
we have this is a technical term here buckets of time points. so is the frequency resolution is determined by the number of time points.
在这里插入图片描述
longer segments what you can do is a procedure called zero padding so as you might guess from the name what we do in zero padding is pad the signal with zeros so that looks like this here is our original signal it’s just a little hill but this is the original signal and what I’ve done here is zero pad so I’ve added a bunch of zeros to the end of the signal so here the signal is 20 points long here the signal is 40 points long so now it has twice as many points and that means that when we take the Fourier transform of this this signal it’s going to have twice the frequency resolution as original signal.
在这里插入图片描述
zero padding your signal in practical data analysis there are in fact three motivations for zero padding.
在这里插入图片描述

Estimation errors and Fourier coefficients

you saw that we can have a sine wave with an amplitude parameter that is independent of the phase so the phase here is of course as you know this angle relative to the positive real axis of the line that connects the origin to the complex Fourier coefficient.
在这里插入图片描述
made what is the one case where the phase is not independent of amplitude where you change the amplitude of this coefficient is when the amplitude is exactly zero so when there is zero amplitude or zero power then this Fourier coefficient lies exactly at the origin of this plane and what is the phase for a vector that has no length well I mean it’s undefined.
course in the context of the Fourier transform an amplitude of zero for some Fourier coefficient means that the signal has no energy.
在这里插入图片描述
let’s say hundred times so you repeat the the data a hundred times you get a hundred different Fourier coefficients one for each stimulus ret presentation and then you can plot all of those Fourier coefficients and estimate their uncertainty and maybe that cloud of uncertainty looks something like this and this point here is the average of all of those hundred repetitions so essentially what that means is that the true underlying Fourier coefficient.
when amplitude is large we confident that the value we estimate for phase in the real signal is is pretty accurate and when the amplitude is small then we can be less confident we don’t have a lot of confidence in our estimate of phase.在这里插入图片描述

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.coloradmin.cn/o/1930865.html

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈,一经查实,立即删除!

相关文章

《学会 SpringBoot · 定制 SpringMVC》

📢 大家好,我是 【战神刘玉栋】,有10多年的研发经验,致力于前后端技术栈的知识沉淀和传播。 💗 🌻 近期刚转战 CSDN,会严格把控文章质量,绝不滥竽充数,如需交流&#xff…

Pytorch学习笔记day1—— 安装教程

这里写自定义目录标题 Pytorch安装方式 工作需要,最近开始搞一点AI的事情。但是这个国产的AI框架,实话说对初学者不太友好 https://www.mindspore.cn/ 比如说它不支持win下的CUDA,可是我手里只有3070Ti和4060也不太可能自己去买昇腾就有点绷不…

C语言 | Leetcode C语言题解之第239题滑动窗口最大值

题目&#xff1a; 题解&#xff1a; int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize) {int prefixMax[numsSize], suffixMax[numsSize];for (int i 0; i < numsSize; i) {if (i % k 0) {prefixMax[i] nums[i];} else {prefixMax[i] fmax(pref…

C++深度解析教程笔记9-静态成员变量,静态成员函数,二阶构造,友元,函数重载,操作符重载

C深度解析教程笔记9 第25课 - 类的静态成员变量实验-数对象个数&#xff08;失败&#xff09;实验-静态变量小结 第26课 - 类的静态成员函数实验-修改对象的静态变量数值实验-利用静态成员函数实验-静态变量静态函数实现统计对象个数小结 第27课 - 二阶构造模式实验-初始化是否…

【JavaEE】HTTP(2)

&#x1f921;&#x1f921;&#x1f921;个人主页&#x1f921;&#x1f921;&#x1f921; &#x1f921;&#x1f921;&#x1f921;JavaEE专栏&#x1f921;&#x1f921;&#x1f921; &#x1f921;&#x1f921;&#x1f921;下一篇文章&#xff1a;【JavaEE】HTTP协议(…

C++——类和对象(下)

文章目录 一、再探构造函数——初始化列表二、 类型转换三、static成员静态成员变量静态成员函数 四、 友元友元函数友元类 五、内部类六、匿名对象 一、再探构造函数——初始化列表 之前我们实现构造函数时&#xff0c;初始化成员变量主要使⽤函数体内赋值&#xff0c;构造函…

【读点论文】ASAM: Boosting Segment Anything Model with Adversarial Tuning,对抗学习提升性能

ASAM: Boosting Segment Anything Model with Adversarial Tuning Abstract 在不断发展的计算机视觉领域&#xff0c;基础模型已成为关键工具&#xff0c;对各种任务表现出卓越的适应性。其中&#xff0c;Meta AI 的 Segment Anything Model (SAM) 在图像分割方面表现突出。然…

第十一届MathorCup高校数学建模挑战赛-C题:海底数据中心的散热优化设计(续)(附MATLAB代码实现)

目录 5.3 问题三的求解 5.3.1 数据分析 5.3.2 数据处理 5.3.4 得出结论 5.4 问题四的求解 5.4.1 数据分析 5.4.2 算法分析 5.5 问题五的求解 六、模型评价与推广 6.1 模型的优点 6.2 模型的缺点 6.3 模型的推广 七、参考文献 代码实现 8.1 图 4 的代码 8.2 图 5 的代码 8.3 图…

旗晟巡检机器人的应用场景有哪些?

巡检机器人作为现代科技的杰出成果&#xff0c;已广泛应用于各个关键场景。从危险的工业现场到至关重要的基础设施&#xff0c;它们的身影无处不在。它们以精准、高效、不知疲倦的特性&#xff0c;担当起保障生产、守护安全的重任&#xff0c;为行业发展注入新的活力。那么&…

VMware安装CentOS 7

在虚拟机中安装无论是Windows还是Linux其实都差不多&#xff0c;主要还是需要熟悉VMware的使用&#xff0c;多新增几次就熟悉了&#xff0c;可以反复删除再新增去练习… 如下是安装CentOS 7 安装过程&#xff1a; VMare Workstation 16 PRO 中安装CentOS 7 CentOS 7 下载推荐…

PTA - 嵌套列表求和

使用递归函数对嵌套列表求和 函数接口定义&#xff1a; def sumtree(L) L是输入的嵌套列表。 裁判测试程序样例&#xff1a; /* 请在这里填写答案 */L eval(input()) print(sumtree(L)) # 调用函数 输入样例&#xff1a; 在这里给出一组输入。例如&#xff1a; [1,[2…

数据结构-C语言-排序(1)

代码位置&#xff1a;test-c-2024: 对C语言习题代码的练习 (gitee.com) 一、前言&#xff1a; 1.1-排序定义&#xff1a; 排序就是将一组杂乱无章的数据按照一定的规律&#xff08;升序或降序&#xff09;组织起来。 1.2-排序分类&#xff1a; 常见的排序算法&#xff1a; 插…

业务终端动态分配IP-DHCP技术、DHCP中继技术

一、为什么需要DHCP? 1、许多设备(主机、无线WiFi终端等)需要动态地址的分配; 2、人工手工配置任务繁琐、容易出错,比如:IP地址冲突; 3、网络规模扩大、复杂度提高,网络配置越来越复杂,计算机的位置变化和数量超过可分配IP地址的数量,造成IP地址变法频繁以及IP地址…

【精品资料】大数据可视化平台数据治理方案(626页WORD)

引言&#xff1a;大数据可视化平台的数据治理方案是一个综合性的策略&#xff0c;旨在确保大数据的质量、安全性、可访问性和合规性&#xff0c;从而支持高效的数据分析和可视化过程。 方案介绍&#xff1a; 大数据可视化平台的数据治理方案是一个综合性的策略&#xff0c;旨在…

SimMIM:一个类BERT的计算机视觉的预训练框架

1、前言 呃…好久没有写博客了&#xff0c;主要是最近时间比较少。今天来做一期视频博客的内容。本文主要讲SimMIM&#xff0c;它是一个将计算机视觉&#xff08;图像&#xff09;进行自监督训练的框架。 原论文&#xff1a;SimMIM&#xff1a;用于掩码图像建模的简单框架 (a…

设计模式-UML类图

1.UML概述 UML-统一建模语言&#xff0c;用来设计软件的可视化建模语言&#xff1b; 1.1 UML分类 静态结构图&#xff1a;类图、对象图、组件图、部署图动态行为图&#xff1a;状态图、活动图、时序图、协作图、构件图等 类图&#xff1a;反应类与类结构之间的关系&#xff0…

【46 Pandas+Pyecharts | 当当网畅销图书榜单数据分析可视化】

文章目录 &#x1f3f3;️‍&#x1f308; 1. 导入模块&#x1f3f3;️‍&#x1f308; 2. Pandas数据处理2.1 读取数据2.2 查看数据信息2.3 去除重复数据2.4 书名处理2.5 提取年份 &#x1f3f3;️‍&#x1f308; 3. Pyecharts数据可视化3.1 作者图书数量分布3.2 图书出版年份…

2-36 基于matlab的流行学习算法程序

基于matlab的流行学习算法程序。通过GUI的形式将MDS、PCA、ISOMAP、LLE、Hessian LLE、Laplacian、Dissusion MAP、LTSA八种算法。程序以可视化界面进行展示&#xff0c;可直接调用进行分析。多种案例举例说明八种方法优劣&#xff0c;并且可设置自己数据进行分析。程序已调通&…

podman 替代 docker ? centos Stream 10 已经弃用docker,开始用podman了!

&#x1f468;‍&#x1f393;博主简介 &#x1f3c5;CSDN博客专家   &#x1f3c5;云计算领域优质创作者   &#x1f3c5;华为云开发者社区专家博主   &#x1f3c5;阿里云开发者社区专家博主 &#x1f48a;交流社区&#xff1a;运维交流社区 欢迎大家的加入&#xff01…

前端vue项目打镜像并拉取镜像包

前端vue项目打镜像并拉取镜像包 如图需要准备三部分的内容 1.前置要求 linux 环境 docker环境2.vue打包后的静态文件&#xff0c;需要自行打包 npm run build 打包后上传到服务器3.nginx配置&#xff08;default.conf文件配置&#xff09; server {listen 80;serve…