搜索资源列表
EULERDemo
- /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA I
endpoints
- 不错的图像处理源代码，将其放入MATLAB下的toolbox
ALG021
- 解方程，具体见英文描述，给一个连续方程，解出f(x) = 0 在一定范围的解- To find a solution to f(x) = 0 given the continuous function f on the interval [a,b], where f(a) and f(b) have opposite signs: INPUT: endpoints a,b tolerance TOL maximum
ALG025
- 解方程，给出一个连续函数接f(x)=0的值，前提是给两个附近的值，且符号相反 - METHOD OF FALSE POSITION ALGORITHM 2.5 To find a solution to f(x) = 0 given the continuous function f on the interval [p0,p1], where f(p0) and f(p1) have opposite signs: INPUT
Jack_Straws
- ACM94国际大学生编程竞赛东中心区试题-Descr iption n the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. Here, we are only concerned with if vario
E
- A problem consists of multiple lines of input. The first line will be an integer n (1 < n < 13) giving the number of straws on the table. Each of the next n lines contain 4 positive integers, x1 , y1 , x2 and y2 , giving the coordinates, (x1 y1
k-th
- 在Bialas與Karwan的第 解演算法 [13] 則是搜尋限制式解域中的端點，並且歸類為已搜尋端點集合、未搜尋端點集合、可行解端點集合、非可行解端點集合，再從可行解端點集合中找出使高階目標值最佳的端點。-Bialas and Karwan in the first solution algorithm [13] is the search for solutions in the domain of endpoint constraints, and the endpoints are cl
Colored-Sticks
- 北京大学ACM/ICPC竞赛队 2009 PKU ACM/ICPC Trainning 14 Colored Sticks F:Colored Sticks 时间限制: 5000ms 内存限制: 65536kB 描述 You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to ali
erfen
- 二分法 插值 通过每次把f(x)的零点所在小区间收缩一半的方法，使区间的两个端点逐步迫近函数的零点，以求得零点的近似值-Each time the interpolation dichotomy by f (x) between zero shrinkage area where half of the ways in which the two endpoints interval function gradually approaching zero, in order to achi
PYprogram
- 寫一程式，讓使用者可以輸入四組數對，分別代表四個點座標，且其輸入順序依 序為順時鐘方向之四個端點，程式則依據輸入的四個座標判斷其形狀，可能的形 狀為square(正方形)、rectangle(長方形)、diamond(菱形)、parallelogram(平行四邊 形)及others(其他)，且輸出結果必須為最適合之答案。-Write a program that allows users to enter the number on the four groups, represen
Kruskal
- 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。 （随机生成n个点，且随机生成k条边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected com
Prim
- 编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for
two-find
- 通过每次把f(x)的零点所在小区间收缩一半的方法，使区间的两个端点逐步迫近函数的零点，以求得零点的近似值，这种方法叫做二分法-By the time f (x) between the zero shrinkage area where half of the ways in which the two endpoints of interval functions gradually approaching zero, in order to achieve zero approximati
QMIN
- 功能: 精确线搜索之抛物线法 输入: phi 是目标函数, a和b是搜索区间的端点-Features: accurate line search of the parabola method input: phi is the objective function, a and b are the endpoints of the search range
2037
- 假设一个存储结构实现双向堆栈顺序,也就是说,一维数组的储存空间,有两个堆栈,他们位于底部的堆阵列的两个端点。尝试着去写实现双向堆Tws三种操作:最初的inistack(Tws),到堆栈推(Tws,我、x)和堆栈流行(Tws,我)算法,该算法可以我0或1,所以分别在一个数组或指示两端的两个堆栈。-Suppose a storage structure order implement a two-way stack, that is, the one dimensional array of sto
a4
- Write a program that reads as its inputs four pairs of (x, y) coordinates of the endpoints of two line segments P1P2 and P3P4. Your program should decide whether the two line segments have a common point. For this problem you may use matlab in order
Ex6_13
- 【例6.13】梯形法求积分的函数integer()是通用函数，可求任一函数的定积分。不同的函数有不同的解析式， //该解析式决定了自变量在每一个小积分区间端点处的函数值。函数 integer()以一个指向函数的指针为参数， //由该参数调用欲求定积分的函数，另两个参数是积分上下限。-[Example 6.13] the trapezoidal method to seek the integral function integer () is a universal function,
gt
- 根据运动合成原理建立了轻质杆在斜抛(包括竖直上抛)运动中质心和端点的运动方程，用动画演示了质心的斜抛运动和两个端点的运动轨迹，并显示了杆在一定时刻的位置。-Established in accordance with the composite theory of the movement in oblique light pole throw (cast on the vertical) movement of the centroid and the equation of motion
MST
- prime算法的基本思想 1.清空生成树，任取一个顶点加入生成树 2.在那些一个端点在生成树里，另一个端点不在生成树里的边中，选取一条权最小的边，将它和另一个端点加进生成树 3.重复步骤2，直到所有的顶点都进入了生成树为止，此时的生成树就是最小生成树-The basic idea of the prime algorithm. Empty spanning tree, take any a vertex joined spanning
small-world-networks
- 1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始：考虑一个含有N个点的最近邻耦合网络，它们围成一个环，其中每个节点都与它左右相邻的各K/2节点相连，K是偶数。 2、随机化重连：以概率p随机地从新连接网络中的每个边，即将边的一个端点保持不变，而另一个端点取为网络中随机选择的一个节点。其中规定，任意两个不同的