untitled1

说明：  tarjan算法求解有向图中的简单环，非常好用(Tarjan algorithm is very useful for solving simple rings in directed graphs.)

说明：  MATLAB OFDM仿真代码，采用QPSK调制(MATLAB OFDM simulation code, using QPSK modulation)

说明：  这是基于蚁群算法的无人机uav巡检实例程序，平台为matlab。(This is an example program of UAV path planning based on ant colony algorithm, which contains all the source code and the platform is matlab)

基于bpa的IEEE39节点算例，包含暂态数据和稳态数据(Example of IEEE39 node based on BPA)

说明：  ARIMA整合移动平均自回归模型，时间序列预测分析方法之一，可用于股价预测。(ARIMA integrates moving average autoregressive model and time series forecasting analysis method, which can be used for stock price forecasting.)

基于SAR-ADC的DAC模块的电容切换，所做的动态功耗仿真，比较了不同切换模式的功耗。(Capacitance switching of DAC module based on SAR-ADC is simulated and power consumption of different switching modes is compared.)

利用S参数，即S11和S21反演介质的有效介电常数和有效磁导率(Inversion of effective permittivity and permeability of dielectrics using S parameters, i.e. S11 and S21)

说明：  卫星姿态是指卫星星体在轨道上运行所处的空间指向状态。将直角坐标系的原点置于星体上，指向地面的Z轴反映偏航方向，Y轴反映俯仰方向，X轴反映滚动方向。星体在高空中沿局部地球铅垂方向和轨道矢量方向运行，不时地产生对三轴的偏移。姿态控制是通过姿态控制分系统（ACS）来实现，使用地平扫描仪可感应俯仰和滚动轴的姿态误差，使用速度陀螺仪和罗盘可感应偏航轴的姿态误差。(Satellite attitude refers to the spatial orientation of a satellite in orbit. The origin of the Cartesian coordinate system is placed on the star, the Z axis pointing to the ground reflects the yaw direction, the Y axis reflects the pitching direction, and the X axis reflects the rolling direction. The stars move along the direction of the earth's vertical direction and the orbit vector in the high altitude, resulting in the deviation of the three axis from time to time. Attitude control is realized by attitude control subsystem (ACS). The attitude error of pitch and rolling axis can be induced by using horizon scanner, and the attitude error of yaw axis can be induced by using speed gyroscope and compass.)

Intelligent Microgrid

节点度是指和该节点相关联的边的条数，又称关联度。 特别地，对于有向图， 节点的入度 是指进入该节点的边的条数; 节点的出度是指从该节点出发的边的条数。(Node degree refers to the number of edges associated with the node, also known as the degree of association. In particular, for a directed graph, The ingress of a node is the number of edges entering the node; The out-degree of a node is the number of edges that start from that node.)