Location:
Search - Max sum
Search list
Description: 1 MATLAB 2 2 Starting Up 2 2.1 Windows Systems . . . . . . . . . . 2 2.2 Unix Systems . . . . . . . . . . . . . 2 2.3 Command Line Help . . . . . . . . . 2 2.4 Demos . . . . . . . . . . . . . . . . . 3 3 Matlab as a Calculator 3 4 Numbers & Formats 3 5 Variables 3 5.1 Variable Names . . . . . . . . . . . . 3 6 Suppressing output 4 7 Built{In Functions 4 7.1 Trigonometric Functions . . . . . . . 4 7.2 Other Elementary Functions . . . . . 4 8 Vectors 4 8.1 The Colon Notation . . . . . . . . . 5 8.2 Extracting Bits of a Vector . . . . . 5 8.3 Column Vectors . . . . . . . . . . . . 5 8.4 Transposing . . . . . . . . . . . . . . 5 9 Keeping a record 6 10 Plotting Elementary Functions 6 10.1 Plotting|Titles & Labels . . . . . . 7 10.2 Grids . . . . . . . . . . . . . . . . . . 7 10.3 Line Styles & Colours . . . . . . . . 7 10.4 Multi{plots . . . . . . . . . . . . . . 7 10.5 Hold . . . . . . . . . . . . . . . . . . 7 10.6 Hard Copy . . . . . . . . . . . . . . 8 10.7 Subplot . . . . . . . . . . . . . . . . 8 10.8 Zooming . . . . . . . . . . . . . . . . 8 10.9 Formatted text on Plots . . . . . . . 8 10.10Controlling Axes . . . . . . . . . . . 9 11 Keyboard Accelerators 9 12 Copying to and from Word and other applications 10 12.1 Window Systems . . . . . . . . . . . 10 12.2 Unix Systems . . . . . . . . . . . . . 10 13 Script Files 10 14 Products, Division & Powers of Vectors 11 14.1 Scalar Product (*) . . . . . . . . . . 11 14.2 Dot Product (.*) . . . . . . . . . . . 11 14.3 Dot Division of Arrays (./) . . . . . 12 14.4 Dot Power of Arrays (.^) . . . . . . 12 15 Examples in Plotting 13 16 Matrices|Two{Dimensional Arrays 13 16.1 Size of a matrix . . . . . . . . . . . . 14 16.2 Transpose of a matrix . . . . . . . . 14 16.3 Special Matrices . . . . . . . . . . . 14 16.4 The Identity Matrix . . . . . . . . . 14 16.5 Diagonal Matrices . . . . . . . . . . 15 16.6 Building Matrices . . . . . . . . . . . 15 16.7 Tabulating Functions . . . . . . . . . 15 16.8 Extracting Bits of Matrices . . . . . 16 16.9 Dot product of matrices (.*) . . . . 16 16.10Matrix{vector products . . . . . . . 16 16.11Matrix{Matrix Products . . . . . . . 17 16.12Sparse Matrices . . . . . . . . . . . . 17 17 Systems of Linear Equations 18 17.1 Overdetermined system of linear equations . . . . . . . . . . . . . . . . . . 18 18 Characters, Strings and Text 20 19 Loops 20 20 Logicals 21 20.1 While Loops . . . . . . . . . . . . . . 22 20.2 if...then...else...end . . . . . . 23 21 Function m{ les 23 21.1 Examples of functions . . . . . . . . 24 22 Further Built{in Functions 25 22.1 Rounding Numbers . . . . . . . . . . 25 22.2 The sum Function . . . . . . . . . . . 25 22.3 max & min . . . . . . . . . . . . . . . 26 22.4 Random Numbers . . . . . . . . . . 26 22.5 find for vectors . . . . . . . . . . . . 27 22.6 find for matrices . . . . . . . . . . . 27 23 Plotting Surfaces 27 24 Timing 28 25 On{line Documentation 29 26 Reading and Writing Data Files 29 26.1 Formatted Files . . . . . . . . . . . . 30 26.2 Unformatted Files . . . . . . . . . . 30 27 Graphic User Interfaces 31 28 Command Summary 32
Platform: |
Size: 877346 |
Author: taffy320 |
Hits:
Description: 求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic
Platform: |
Size: 12288 |
Author: 王菲 |
Hits:
Description: function [U,center,result,w,obj_fcn]= fenlei(data)
[data_n,in_n] = size(data)
m= 2 ％ Exponent for U
max_iter = 100 ％ Max. iteration
min_impro =1e-5 ％ Min. improvement
c=3
[center, U, obj_fcn] = fcm(data, c)
for i=1:max_iter
if F(U)>0.98
break
else
w_new=eye(in_n,in_n)
center1=sum(center)/c
a=center1(1)./center1
deta=center-center1(ones(c,1),:)
w=sqrt(sum(deta.^2)).*a
for j=1:in_n
w_new(j,j)=w(j)
end
data1=data*w_new
[center, U, obj_fcn] = fcm(data1, c)
center=center./w(ones(c,1),:)
obj_fcn=obj_fcn/sum(w.^2)
end
end
display(i)
result=zeros(1,data_n) U_=max(U)
for i=1:data_n
for j=1:c
if U(j,i)==U_(i)
result(i)=j continue
end
end
end -function [U, center, result, w, obj_fcn] = fenlei (data) [data_n, in_n] = size (data) m = 2 Exponent for U max_iter = 100 Max. iteration min_impro = 1e-5 Min. improvement c = 3 [center, U, obj_fcn] = fcm (data, c) for i = 1: max_iter if F (U)> 0.98 break else w_new = eye (in_n, in_n) center1 = sum (center)/ca = center1 (1) ./center1 deta = center-center1 (ones (c, 1),:) w = sqrt (sum (deta. ^ 2)) .* a for j = 1: in_n w_new (j, j) = w (j) end data1 = data* w_new [center, U, obj_fcn] = fcm (data1, c) center = center./w (ones (c, 1),:) obj_fcn = obj_fcn/sum (w. ^ 2) end end display (i) result = zeros (1, data_n) U_ = max (U) for i = 1: data_n for j = 1: c if U (j, i) == U_ (i) result (i) = j continue end end end
Platform: |
Size: 3072 |
Author: download99 |
Hits:
Description: 给定任务序列J1J2 ...Jn，假定只有一台处理机为这批作业服务。每件任务Ji给定一个时限di和对应利润Pi。只有在规定时限之内完成作业，才会得到利润Pi。通过设计合适的算法选择和安排任务子集Ji，使得J中的每个作业都能在各自的时限内完工，且使获得的利润∑Pi总和最大。
令d=max{di} 1≤i≤n，b=min{n,d}
任何最大利润的可完工子序列中的作业个数必不大于b。
-Given task sequence J1J2 ... Jn, the assumption that only one service processor for these operations. Ji each task given a time limit and the corresponding di profits Pi. Only the stipulated time-frame to complete operations, profit would have been Pi. By designing a suitable algorithm for the selection and arrangement task subset Ji, makes J each operation can be in their respective time-frame for completion, and so was the largest sum of profits ΣPi. Order d = max (di) 1 ≤ i ≤ n, b = min (n, d) the highest profits of any sequence can be completed in the number of operations will not be greater than b.
Platform: |
Size: 1024 |
Author: 林培文 |
Hits:
Description: SQL 合计函数
使用 SQL 合计函数 你可以确定数据组的各种统计。你可以把这些函数用于查询和合计表达式，条件是在具备 SQL特性的 QueryDef对象中或在创建基于SQL查询的 Recordset对象时。
Avg 函数
Count 函数
First, Last 函数
Min, Max 函数
StDev, StDevP 函数
Sum 函数
Var 和 VarP 函数
-SQL aggregate function using the SQL aggregate functions you can be sure of the various statistical data sets. You can put these functions together for query and expression, on the condition that the availability of SQL characteristics QueryDef object or create a SQL query based on the Recordset object. Avg Function Count Function First, Last function Min, Max function StDev, StDevP function Sum function Var and VARP function
Platform: |
Size: 206848 |
Author: 397728431 |
Hits:
Description: Description
Scientific calculator. Allows to perform caclulation with high precicion and implements most populatr mathematical functions: sin, cos, tan, asin, acon, atan, exp, log, sqr, floor and ceil. Also it make it possible to define your own function, store results in variables and use variable sin expressions. Calculator store al formuls you have entered. Plot function can be used to draw graph of function with single argument.
More detailed description of calculator is here.
-
Notes
* Write formula using normal infix notation, for example (x^2+ y^2)/1.5. To execute statement use Evaluate command.
* Use variable to write generic formulas, by changing values assigned to the variables you wil be able to repeat calculation for all input data with minimal typing. Define your own functions which also can speedup your work and reduce probability of making an error.
* It is possible to write small functional programs using conditional ?: operator. For example sum of arithmetic progression can be calculated by the following function
sum(x)=x>0?x+sum(x-1):0
Calculator has only < and > comparison operators (because comparing floating point number for equality is any case bad idea). But it is also to check that value belongs to specified range using min<x>max operator.
* All statement you have entered and stored in database. You can select proper statement using List command. Statements are marked with three differen
Platform: |
Size: 245760 |
Author: tang |
Hits:
Description: 找出数组中的最大元素和最小元素，元素的和，以及各个元素的平均值。并对数组进行排序。-find Max,Min elemens form a array,caculate the sum and average of elements in array,and the sort the array
Platform: |
Size: 1024 |
Author: fengsushi |
Hits:
Description: Title: Fuzzy logic Engine
Description: This dll written in C implements a fuzzy logic engine with 3 different inferencing methods - min-max, dot-sum and Yager. This engine implements also a LALR(1) parser allowing users to define fuzzy sets and rules using a definition language of mine (FSDL fuzzy system definition language - see files with .in extension).
For the parser lex and yacc famous tools were used. The project is 100 portable in any system (I developed the original version on SunOS).-Title: Fuzzy logic Engine
Description: This dll written in C implements a fuzzy logic engine with 3 different inferencing methods - min-max, dot-sum and Yager. This engine implements also a LALR(1) parser allowing users to define fuzzy sets and rules using a definition language of mine (FSDL fuzzy system definition language - see files with .in extension).
For the parser lex and yacc famous tools were used. The project is 100 portable in any system (I developed the original version on SunOS).
Platform: |
Size: 48128 |
Author: SC |
Hits:
Description: 数塔问题，求从塔顶到塔底的路径，且该路径上的节点值的和最大-tower constituted by number，the program will find a path which is the max sum from points in the path.
Platform: |
Size: 199680 |
Author: 王崛飞 |
Hits:
Description: 用于MIMO检测的sphere decoder程序- This function implements a soft output sphere decoder.
Based on the paper: C. Studer, M. Wenk, A. Burg, and H. Blocskei: "Soft-Output Sphere
Decoding: Performance and Implementation Aspects", Asilomar 2006
R ... is an upper triangular matrix obtained from the QR decomposition of the MIMO channel H
s ... received symbol (column) vector, s=Q^H*y
dist_ZF ... Distance for the zero forcing solution
symbols_ZF ... ZF solution
M ... number of bits encoded in every layer [1 x nTA]
symbol_alphabet ... for the demapping [nTA x 2^max(M)], filled with zeros for smaller symbol alphabets
bittable ... matrix containing the bits according to the symbol_alphabet [sum(M) x 2^max(M)]
Platform: |
Size: 3072 |
Author: bennytang |
Hits:
Description: Avetis Ioannisyan
avetis@60ateight.com
Last Updated: 11/30/05
LMS Channel Adaptation
reset randomizers
randn( state ,sum(100*clock))
rand( state ,sum(100*clock))
numPoints = 5000
numTaps = 10 channel order
Mu = 0.001:0.001:0.01 iteration step size
input is guassian
x = randn(numPoints,1) + j*randn(numPoints,1)
choose channel to be random uniform
h = rand(numTaps, 1) + i*rand(numTaps, 1)
h = [1 0 0 0 1] testing only
h = h/max(h) normalize channel
convolve channel with the input
d = filter(h, 1, x)
initialize variables
w = []
y = []
in = []
e = [] error, f- Avetis Ioannisyan
avetis@60ateight.com
Last Updated: 11/30/05
LMS Channel Adaptation
reset randomizers
randn( state ,sum(100*clock))
rand( state ,sum(100*clock))
numPoints = 5000
numTaps = 10 channel order
Mu = 0.001:0.001:0.01 iteration step size
input is guassian
x = randn(numPoints,1) + j*randn(numPoints,1)
choose channel to be random uniform
h = rand(numTaps, 1) + i*rand(numTaps, 1)
h = [1 0 0 0 1] testing only
h = h/max(h) normalize channel
convolve channel with the input
d = filter(h, 1, x)
initialize variables
w = []
y = []
in = []
e = [] error, f
Platform: |
Size: 1024 |
Author: josh |
Hits:
Description: An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for students. -An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for students.
Platform: |
Size: 30720 |
Author: cavalier |
Hits:
Description: 一串数字序列比如1，3，4，5，7，6……得到其中的最带不连续子序列（要求序列是严格递增的如1，3，4，5，7可以，5，7，6就不可以）
本代码即，最大不连续子序列问题，属于经典的动态规划问题适合初学者-A string of number sequences such as 1,3,4,5,7,6 ... ... be one of the best sequence with discontinuous (which requires a strictly increasing sequence, such as 1,3,4,5,7 can, 5,7, 6 not be able to) the code that is the biggest problem is not a continuous sequence, belonging to the classic dynamic programming for beginners
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 本源码是用Verilog编写的12位移位相加乘法器的设计源码，开发软件为MAX+PLUS，已经测试通过。-The Verilog source code is written in the sum of 12-bit shift multiplier design source code, developing software for the MAX+ PLUS, has been tested.
Platform: |
Size: 305152 |
Author: Aaran |
Hits:
Description: 一本将基于AP传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-The Uncapacitated Facility Location Prob-
lem (UFLP) is one of the most widely stud-
ied discrete location problems, whose appli-
cations arise in a variety of settings. We
tackle the UFLP using probabilistic infer-
ence in a graphical model- an approach that
has received little attention in the past. We
show that the fi xed points of max-product
linear programming (MPLP), a convexifi ed
version of the max-product algorithm, can
be used to construct a solution with a 3-
approximation guarantee for metric UFLP
instances. In addition, we characterize some
scenarios under which the MPLP solution is
guaranteed to be globally optimal. We eval-
uate the performance of both max-sum and
MPLP empirically on metric and non-metric
problems, demonstrating the advantages of
the 3-approximation construction and algo-
rithm applicability to non-metric instances.
Platform: |
Size: 250880 |
Author: fanhaixiong |
Hits:
Description: 求和最大的子数组
在一个一维数组中，找到和最大的子数组（连续的任意个元素）-find the sub array that have max sum
Platform: |
Size: 958464 |
Author: dfew |
Hits:
Description: 利用动态规划的思想，求一个数组中的连续最大和-For an array of continuous maximum sum
Platform: |
Size: 1024 |
Author: 王三 |
Hits:
Description: 数据结构，依次输入链表中的之，输出相邻两个数之和最大的第一个数。-Input the list of data in proper order,then output the first number of two adjacent numbers ，the sum of which is the maximum.
Platform: |
Size: 223232 |
Author: taiyangyu |
Hits:
Description: 求解最大连续子串，和最大的串成为最大连续子串-search the string of max sum
Platform: |
Size: 5120 |
Author: 于文峰 |
Hits:
Description: les codes for calcul e max of array with assembleur langage
Platform: |
Size: 1024 |
Author: khalid2000 |
Hits: