Technical-manager

大发发发算法库激发发发发发付发发发发发发(dfafaffff fafa faff afaf adfa faf)

MATLAB模拟激光器内谐振腔的各种激光模式的光场分布(laser MATLAB simulation of the laser field distribution in the laser cavity)

流水灯51单片机用蜂鸣器放音乐的程序，音乐编码有月亮代表我的心，两只蝴蝶等 (51 SCM with buzzer or music program, music encoding the moon represents my heart, two butterflies)((51 SCM with buzzer or music program, music encoding the moon represents my heart, two butterflies))

一个基于纯C++的简单的成绩管理系统，包括按照学号、姓名、成绩的查找，平均分，最低、最高分，及格和不及格人数等基本功能。使用的是双向循环链表结点模板

文件为牛顿插值法的matlab求解程序，有注解说明每一步意义(The matlab solution program of Newton interpolation method.)

说明：  用于各种大量离散型数据预测，帮助技术人员建模分析规划(It is used to predict a large number of discrete data and help technicians to model, analyze and plan)

一款基于jQuery+CSS3+HTML5实现的折叠卡片式下拉菜单特效代码，有一种3D立体效果的下拉菜单代码。(A jQuery+CSS3+HTML5 based folding card drop-down menu special effect code, has a 3D stereoscopic effect of the drop-down menu code.)

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

可用于COBie标准下设施信息的交换，需要在Revit软件上运行(Can be used for the exchange of facility information under the COBie standard)

C#实现带百分比的进度条功能; C#实现带百分比的进度条功能(C# to achieve the percentage of progress bar function)