搜索资源列表
Graph-Drawing-by-Force-directed
- 这是关于force-direct算法的可视化方向的论文，主要为了使得画布中的各点分布均匀，弹簧与戒指模型说得很不错。-This is about the force-direct visualization of the algorithm the direction of the paper, the main canvas in order to make the points evenly distributed spring model very well with the ring.
DFA
- 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成） -Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first
delphi-chart
- 利用Delphi里的chart组件绘制Access数据库里的数据曲线图-Using Delphi in the chart component drawing Access database in the data graph
KeyLCD
- 用于4x8液晶显示和键盘控制，已经对二维曲线图的绘制，动态存储数据至E2PROM-4X8 for the LCD and keyboard control, has two-dimensional graph drawing, dynamic store data to E2PROM
Display_IO_Programming
- 制作一个图形元素表graphic element menu,表中将所需的各种字符图形编上号码，并用存储器映射法将其显示在屏幕的左上部分，将光标定位在屏幕的右半部分画图区。 上、下、左、右光标控制键控制光标在四个方向上移动，不显示其轨迹，同时要控制光标位置不超过画图区的边界。 当按动谋一个数字键时，在光标位置处显示出响应编号的字符图形，然后移动光标，再显示一个字符图形，最后绘制出一幅由字符组成的图形。 按动ESCape键，退出程序，返回DOS。-Table graphic elemen
asd
- 图表绘制系统，可选择任意地图，在上面标徽，互相学习。-Graph drawing system, can choose any map, in the above emblems, symbols, learn from each other.
Least-squares-Curve-Fit-unit
- 最小二乘是由方程式近似的数据点的一组的方式，让你预测中间值，或计算的数据的一些措施。您可能已经通过绘制通过数目的数据点图上绘制的直线近似的趋势线。最小二乘这不只是“装修”，但在数学的方式，最大限度地减少错误，从而导致。我的单元延伸最小二乘从仅仅是一种直线拟合到高阶多项式为更复杂的数据（其中可能有一平方律拟合的物理原因，例如），或更好的匹配的数据。-Least-squares is a way of approximating a set of data points by an equation
simplegraph
- TSimpleGraph is a visual component, which provides a simple user interface for drawing simple graphs/digraphs. User can draw nodes (vertices) on the control s client area and link them together (graph s edges or arcs) by either keyboard or mouse. Cur
opengl
- OPENGL is a visual component, which provides a simple user interface for drawing simple OPENGL. User can draw nodes (vertices) on the control s client area and link them together (graph s edges or arcs) by either keyboard or mouse. Currently the comp
8
- 使用波形图绘制正弦和余弦曲线+ 用XY图描绘同心圆-Using the waveform drawing sine and cosine curve+ XY graph depicting concentric circles with
3D-Graph
- 编程实现一个高斯噪声的三维表现图，投影方式可以选择XY,YZ,XZ或无投影，绘图方式有线图、面图、点线图及点面图供选择，并可以设置图像的透明度。-Programming to achieve a three-dimensional performance of gaussian noise figure, the projection method can select the XY, YZ, XZ or no projection, drawing methods have a map, th
yuyinxuebo
- 利用三电平中心削波自相关法实现清、浊音判定，并提取一段话音的基频参数，绘制基频曲线，并将该参数曲线合并到前面提取的短时过零率和短时能量参数曲线图中-Using a three-level center clipping from the relevant law to achieve clear, voiced determination, and extract some of the fundamental parameters of the voice, drawing the funda
fibonacci-number-sequence
- 产生指定数目的斐波那契数列。输入想产生的数字个数，则会输出相应的斐波那契数列，同时绘制数列曲线图。-Fibonacci generating a specified number of sequence. Enter the number of digits to produce, it will output the corresponding Fibonacci series, at the same time sequence graph drawing.
UnitWave
- Delphi:波形图的绘制Delphi源码实例，点击即可看到波形图的绘制效果。 -Delphi: Delphi source code examples to draw a waveform graph, click to see the effect of drawing the waveform graph.
UnitWave
- Delphi:波形图的绘制Delphi源码实例，点击即可看到波形图的绘制效果。 -Delphi: Delphi source code examples to draw a waveform graph, click to see the effect of drawing the waveform graph.
ios-plot
- ios 下画图的脚本程序，可以画折线图，饼图等等，使用时可以参考target。-scr ipt drawing under IOS, you can draw a line graph, pie and so on, can be used to reference the target.
jiyinzhouqi
- 利用短时自相关分析的方法先求得基音周期，同时画出此时的基音周期走势图；然后对超出基音周期均值的1/5的基音周期点进行去除，再利用中值平滑方法剔除野点，同时对剔除野点后的基音周期点进行绘图，同时求得平均的基音周期。文件中附带实验语音，可验证。-By using the method of short time autocorrelation analysis first pitch is obtained, at the same time draw the pitch at this time
draw-graph
- 能实现绘图功能，用VB编写，是学习绘图的基础参考程序-Can realize the drawing function, using VB to write, is the foundation of learning drawing reference program
Drawing-of-some-special-graphs
- 三维曲线图、图形的隐藏属性、PEAKS函数曲线-The hidden attribute of 3D graph and graph, the curve of PEAKS function
myMatlab-code
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the