Skip to content

Instantly share code, notes, and snippets.

View qiaoxu123's full-sized avatar
:shipit:
Hard working

xqiao qiaoxu123

:shipit:
Hard working
120 followers · 14 following
  • China
View GitHub Profile
@qiaoxu123
qiaoxu123 / v2i-channel-model-demo.py
Created February 8, 2026 08:09
V2I 信道模型教学演示 - 3GPP TR 38.901 路径损耗 + Nakagami-m 衰落 + Doppler + 链路持续 (独立脚本，无工程依赖)
#!/usr/bin/env python3
"""
V2I 信道模型教学演示脚本
========================
本脚本完整实现了 V2I (Vehicle-to-Infrastructure) 通信系统的信道模型，
适合新人理解和学习 5G V2X 无线通信基础。
信道模型基于:
- 3GPP TR 38.901 v16.1.0 (路径损耗)
@qiaoxu123
qiaoxu123 / Advanced.py
Last active June 15, 2025 12:07
手写数字识别
import os
import torch
import torch.nn as nn
import torch.nn.functional as F
from torchvision import datasets, transforms
from torchvision.transforms import functional as TF
import matplotlib.pyplot as plt
import tkinter as tk
from PIL import Image, ImageDraw, ImageOps
import warnings
@qiaoxu123
qiaoxu123 / shared_ptr.cpp
Created July 30, 2022 08:17
参考 [官方链接](https://en.cppreference.com/w/cpp/memory/shared_ptr) 使用多线程来统计计数，等待所有线程结束后自动释放资源。
#include <iostream>
#include <memory>
#include <thread>
#include <chrono>
#include <mutex>
struct Base
{
Base() { std::cout << " Base::Base()\n"; }
// Note: non-virtual destructor is OK here
@qiaoxu123
qiaoxu123 / unique_ptr.cpp
Last active July 30, 2022 06:01
很清楚地说明了 unique_ptr 的几个应用场合，并举了几个很典型的例子来说明。
#include <cassert>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <memory>
#include <stdexcept>
// helper class for runtime polymorphism demo below
struct B
{
@qiaoxu123
qiaoxu123 / Makefile
Last active January 6, 2020 14:41
OOQP的官方示例代码，程序运行和具体分析具体请参考[Ubuntu下OOQP库的安装](https://qiaoxu.coding.me/post/ubuntu-ooqp-install), [Ubuntu环境下OOQP优化库的基本使用](https://qiaoxu.coding.me/post/ubuntu-ooqp-useguide) [//]: # (Uploading ma27-1.0.0.tar.gz)
SHELL = /bin/sh
OOQP=../../..
OOQPINCLUDEDIR=$(OOQP)/include
OOQPLIBDIR=$(OOQP)/lib
CXX = c++
CXXFLAGS =-O
@qiaoxu123
qiaoxu123 / main.cpp
Created August 2, 2019 08:25
[参考链接](https://www.geeksforgeeks.org/a-search-algorithm/)
// A C++ Program to implement A* Search Algorithm
#include<bits/stdc++.h>
using namespace std;
#define ROW 9
#define COL 10
// Creating a shortcut for int, int pair type
typedef pair<int, int> Pair;
@qiaoxu123
qiaoxu123 / a_star.py
Created August 2, 2019 03:38
"""
A* grid planning
author: Atsushi Sakai(@Atsushi_twi)
Nikos Kanargias (nkana@tee.gr)
See Wikipedia article (https://en.wikipedia.org/wiki/A*_search_algorithm)
"""
@qiaoxu123
qiaoxu123 / a_star.cpp
Last active August 2, 2019 01:55
- [参考链接2](https://blog.csdn.net/yuxuan20062007/article/details/86767355)
#include "stdafx.h"
#include "Astar.h"
int map[101][101] =
{
{0,0,0,1,0,1,0,0,0},
{0,0,0,1,0,1,0,0,0},
{0,0,0,0,0,1,0,0,0},
{0,0,0,1,0,1,0,1,0},
{0,0,0,1,0,1,0,1,0},
{0,0,0,1,0,0,0,1,0},
@qiaoxu123
qiaoxu123 / a_star.py
Last active August 2, 2019 03:35
- [参考链接1](https://paul.pub/a-star-algorithm/#id-%E5%8F%82%E8%80%83%E8%B5%84%E6%96%99%E4%B8%8E%E6%8E%A8%E8%8D%90%E8%AF%BB%E7%89%A9)
import sys
import time
import numpy as np
from matplotlib.patches import Rectangle
import point
import random_map
@qiaoxu123
qiaoxu123 / adjacency_list.cpp
Last active August 1, 2019 07:38
- [邻接矩阵](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/) - [邻接表](https://www.geeksforgeeks.org/dijkstras-algorithm-for-adjacency-list-representation-greedy-algo-8/)
// C / C++ program for Dijkstra's shortest path algorithm for adjacency
// list representation of graph
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
// A structure to represent a node in adjacency list
struct AdjListNode
{