Planar Antennas for Wireless Communications 这也是一本关于PIFA天线的经典图书。欢迎大家下载

英文版的自制中文版（两自由度平面并联机械手的最佳运动学设计

吴恩达深度学习编程作业（1-3）- Planar data classification with one hidden layer testCases_v2和planar_utils包

Ti平面变压器设计研讨会

The problem of minimum number of choosability of graphs was first introduced.by Vizing. It appears in some practical problems when concerning frequency.assignment. In this paper, we study two important list coloring, list edge coloring and.list total coloring. We prove that χl (G) = Δ and χl (G) = Δ

Let G be a planar graph with maximum degree Δ ≥ 8 and without chordal.5-cycles. Then χ l (G) = Δ and χ l (G) = Δ + 1.

Total coloring of planar graphs without adjacent short cycles

Simulating planar reflection using two-pass rendering and texture mapping 1. There ‘s a table with flat rectangular semi-reflective table-top in the 3D scene 2. On/Around the table are some 3D objects. All of these objects are texture-mapped (mipmapping). 3. There is a point light and a single directional light in the scene. 4. There is one rotating triangle floating in the air, casting a shadow on the table, walls and other objects. 5. The program allows the user to move the viewpoint and view direction.

第一课第三周浅层神经网络编程作业，两个文件，亲测可用！

deeplearning.ai课程作业中部分使用的dnn_utils_v2,lr_utils,planar_utils,testCases,testCases_v2的代码，后续还会接着上传其他所需要使用的。