motaifenxi_1

基于HIFU高强度聚焦超声区域的超声引导治疗。(hifu indcued hyperechoic regions for the ultrasound guidance of hifu therapy)

说明：  自己一看就明白，我也是瞎上传的，必须要注册真的烦人(I can understand it at a glance)

This is a test upload thingo.

桌面录象软件!拥有着宽软件,你就可以轻松的记录下年一在桌面上所做的一切-desktop video software! The software has a wide, you can easily record, one on the table, everything done

说明：  基于retinex理论，利用双边滤波器对低照度彩色图像进行增强(Based on Retinex theory, low illumination color image enhancement using bilateral filters)

说明：  实现了数字波束形成算法，可以实现静态扫描。(The digital beamforming algorithm is realized, and the static scanning can be realized.)

鼠标点击动画效果的插件。该按钮插件有7中不同的css3动画效果(Mouse click on the animation effect plug-in. The button plug-in has 7 different CSS3 animation effects)

说明：  IDL（Interactive Data Language）交互式数据语言是进行数据分析、可视化表达和应用开发的第四代可视化。 本书包含详细的基础教程，新手适用。(This book is the basic course of IDL. It is comprehensive and suitable for novices.)

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

yiutityiutuiutyitiiuyitit(tyiyuitituiutyitiyutuituitui)