Search - a-w - CodeBus

Search - a-w - List

[Algorithm] FUP2算法---解决数据库更新后的关联规则挖掘 DL : 0: 香港大学的David W.Cheung写的“A General Incremental Technique for Maintaining Discovered Association Rules”中提到的FUP2算法，用来解决数据库更新后的关联规则挖掘-University of Hong Kong, David W. Cheung wrote "A General Incremental Technique for Maintaining Discovered Association Rules" FUP2 mentioned in the algorithm used to solve the database updated Mining Association Rules
Date : 2025-12-29 Size : 196kb User : 徐高波
[Algorithm] 带通fir设计及图形显示比较 DL : 2: 数字带通滤波器的设计过程。共3个源程序。其中，dos.cpp为带通FIR的源程序，其中的滤波器阶数n，滤波器的低频fln，滤波器的高频fhn，窗函数w，可以按照自己的要求改变。这里采用的是汉宁窗。主函数main.cpp实现输入与fir的h(n)的卷积，输出结果Y(n)，并将其存储在y.txt中。最后，graphics.cpp从y.txt读取数据，再由语句画出波形，可以清楚地看出计算结果是否正确，并进行比较。-digital band-pass filter design process. A total of three sources. Among them, dos.cpp FIR bandpass to the source, the filter order n, the low-frequency filter FLN, the high-frequency filter fhn, window function w, in accordance with the requirements change. Here is the Hanning window. The main function main.cpp achieve the input and fir h (n) convolution, the output Y (n), and store them in y.txt China. Finally, graphics.cpp y.txt read data from and then draw waveform statement, we can clearly see whether calculations are correct, and comparisons.
Date : 2025-12-29 Size : 2kb User : feide
[Algorithm] EULERDemo DL : 0: /* * 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 INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */-/ EULER* S* 5.1** ALGORITHM TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM :* Y = F (T, Y), A
Date : 2025-12-29 Size : 413kb User : JackHou
[Algorithm] mathvalue DL : 0: 编写一个用SOR法解方程组Ax=b的计算机程序，其中要求程序中不存系数A，分别对不同的阶数（例如n=15，80）取w=1.7,1.8,1.9，进行迭代，记录近似解达到时所用迭代次数k，观察松弛因子对收敛速度的影响。 -SOR method used to prepare a solution of equations Ax = b of the computer program, which calls for the procedure does not keep coefficient A, respectively, for different order (for example, n = 15,80) check w = 1.7,1.8,1.9, iteration , recording the approximate solution used to achieve iterations k, observe the relaxation factor on the impact of the convergence rate.
Date : 2025-12-29 Size : 3kb User : 桦华
[Algorithm] JZXcalc DL : 0: 集装箱的装箱问题给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？本程序要求用贪心算法解决: 贪心算法总是作出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，它所做出的仅是在某种意义上的局部最优解。-Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root radius of timber ri. Asked how the packing, making maximum utilization of container space? This procedure requires greedy algorithm solution: greedy algorithm is always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, it made sense only in a local optimal solution.
Date : 2025-12-29 Size : 172kb User : daiyiyin
[Algorithm] lab_1 DL : 0: 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？里面附有详细报告-Given a width W of the rectangular plate, rectangular plate of height restrictions. Is the need to cut out from the board, respectively, n-height hi, a width of the rectangular parts wi. Parts of the rules of cutting height direction and the direction of rectangular plates with a high degree of consistency. Asked how to make the use of cutting rectangular plate height h the smallest? Inside with a detailed report
Date : 2025-12-29 Size : 42kb User : gillli
[Algorithm] tanxinsuanfadeyinyong DL : 0: 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？-Given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root timber radius ri. Asked how the packing, making maximum utilization of container space?
Date : 2025-12-29 Size : 304kb User : hehe
[Algorithm] heibaidian DL : 0: 设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。-Plane based distributed white n black point and n points, each point with a pair of coordinates (x, y) express. A black point b = (xb, yb) domination of a white point w = (xw, yw) if and only if xb
Date : 2025-12-29 Size : 237kb User : kineapple
[Algorithm] mid-point DL : 0: W.B.Gragg改进的解微分方程组的解法，为改进中点法，并给出解一个方程组得例子。-WBGragg solution to improve the solution of differential equations, in order to improve the mid-point of law, and gives a solution of an equation example.
Date : 2025-12-29 Size : 15kb User : 姜梦
[Algorithm] shortpaths DL : 0: Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex-Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex
Date : 2025-12-29 Size : 13kb User : Minh
[Algorithm] gsl_win[1] DL : 0: 一个相当不错的C++数学库.该库涵盖了现代工程运算中的绝大部分：复数运算、线性代数、排列组合、数值微分、最小二乘拟和、统计分析、FFT、随机数等等，总共有 1000 多个函数接口。-A pretty good C++ Math Library
Date : 2025-12-29 Size : 7.57mb User : tina
[Algorithm] maze DL : 0: A turtle is moving in a maze. You can manipulate it, using buttons a,d,w,s,R and q. Pretty simple algorithm but it shows some skills of student.
Date : 2025-12-29 Size : 1kb User : Andrey
[Algorithm] genesis_source_2.0_080416.tar DL : 0: 处理海洋中传播路径的源代码非常好用方便-This report is adapted from the master’s thesis of the same title by James A. Hawkins. Soon after enrolling in the Department of Physics in 1984, Mr. Hawkins began work on the wind turbine noise propagation project. The date of his M.S. degree is December 1987. Professor C. W. Horton, Sr., was the second reader of the thesis.
Date : 2025-12-29 Size : 73kb User : 成虎
[Algorithm] beibao DL : 0: 给定物品n件，他们的重量分别是w[0]，w[1]，……w[n-1]，物品的价值分别为v[0]，v[1]，……v[n-1]，另有一个背包，它可以容纳的总重量为w。设计一种物品挑选方案，要求从这n件物品中所选取的物品的总重量不超过背包的容量w，使选中物品的价值之和最大。 -N pieces of a given item, the weight they were w [0], w [1], ... ... w [n-1], the value of goods, respectively v [0], v [1], ... ... v [n-1], while a backpack, which can accommodate a total weight w. Design an item selecting program, requested items from n items selected in the total weight does not exceed the capacity of backpack w, to select the items and the maximum value.
Date : 2025-12-29 Size : 1kb User : sophia
[Algorithm] minrobot_huisu DL : 0: 问题描述：设某一机器由n个部件组成，每一种部件都可以从m个不同的供应商处购得。设wij是从供应商j处购得的部件i的重量，cij是相应的价格。试设计一个算法，给出总价格不超过c的最小重量机器设计。数据输入：由文件1.txt给出输入数据。第一行有3个正整数n,m,d。接下来的2n行，每行n个数。前n行是c，后n行是w. 结果输出：将计算的最小重量及每个部件的供应商输出到文件2.txt. -Problem Description: Let a machine composed by the n-components, each component can be different from m suppliers purchased. Set wij is purchased from suppliers of parts i j Department of weight, cij is the corresponding price. Trial design an algorithm, given the total price no more than c of the minimum weight design of the machine. Data input: the input data given by the file 1.txt. The first line has three positive integers n, m, d. The next 2n rows, n the number of each line. Before the line is n c, n, after the output line is w. The results: the calculation of the minimum weight and supplier of each component output to a file 2.txt.
Date : 2025-12-29 Size : 930kb User : li
[Algorithm] applied-numerical-linear-algebra.J.W.Demmel DL : 0: 应用数值线性代数，此书更集中于最近的发展和计算机总体结构的考虑，在数学基础方面略有欠缺。-Numerical linear algebra, this book is more focused on recent developments and consider the overall structure of the computer, in a slight lack of mathematical foundation.
Date : 2025-12-29 Size : 4.74mb User : LiFeiteng
[Algorithm] Oppenheim--A.--Discrete-Time-Signal-Processing--P DL : 0: Alan W Oppenheimer & co: Signals and Systems Book is designed as a text for undergraduate course in signals and systems.
Date : 2025-12-29 Size : 20.97mb User : Brane
[Algorithm] deltas DL : 0: Calculate the deltas (derivatives) of a sequence Use a W-point window (W odd, default 9) to calculate deltas using a simple linear slope
Date : 2025-12-29 Size : 1kb User : alollos
[Algorithm] program DL : 0: FFT A计权倍频程分析三分之一倍频程分析-F F T A w eight o c tave a n al o n e t hird o ctave
Date : 2025-12-29 Size : 3kb User : shiqingbo
[Algorithm] w DL : 0: 利用matlab实现下面的问题：其中u(k)和z(k)分别为模型的输入和输出变量；v(k)为零均值、方差为1、服从正态分布的白噪声；为噪声的标准差；利用得到的u(k)和z(k)来辨识模型的阶次和参数。-Using matlab to achieve the following questions: where u (k) and z (k) respectively, the input and output variables of the model v (k) with zero mean and variance 1, follow a normal white noise noise standards Poor utilization u (k) and z (k) to identify the order and parameters of the model.
Date : 2025-12-29 Size : 2kb User :

« 12 »