BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
標(biāo)簽： constrained variables function possibly
上傳時(shí)間： 2014-01-13
上傳用戶(hù)：youth25
This document contains a general overview in the first few sections as well as a more detailed reference in later sections for SVMpython. If you re already familiar with SVMpython, it s possible to get a pretty good idea of how to use the package merely by browsing through svmstruct.py and multiclass.py. This document provides a more in depth view of how to use the package. Note that this is not a conversion of SVMstruct to Python. It is merely an embedding of Python in existing C code. All code other than the user implemented API functions is still in C, including optimization.
標(biāo)簽： document contains detailed overview
上傳時(shí)間： 2013-12-14
上傳用戶(hù)：希醬大魔王
Carrier-phase synchronization can be approached in a general manner by estimating the multiplicative distortion (MD) to which a baseband received signal in an RF or coherent optical transmission system is subjected. This paper presents a unified modeling and estimation of the MD in finite-alphabet digital communication systems. A simple form of MD is the camer phase exp GO) which has to be estimated and compensated for in a coherent receiver. A more general case with fading must, however, allow for amplitude as well as phase variations of the MD. We assume a state-variable model for the MD and generally obtain a nonlinear estimation problem with additional randomly-varying system parameters such as received signal power, frequency offset, and Doppler spread. An extended Kalman filter is then applied as a near-optimal solution to the adaptive MD and channel parameter estimation problem. Examples are given to show the use and some advantages of this scheme.
標(biāo)簽： synchronization Carrier-phase multiplicativ approached
上傳時(shí)間： 2013-11-28
上傳用戶(hù)：windwolf2000
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶(hù)：jeffery
單純形法算法,int K,M,N,Q=100,Type,Get,Let,Et,Code[50],XB[50],IA,IAA[50],Indexg,Indexl,Indexe float Sum,A[50][50],B[50],C[50]
標(biāo)簽： 50 Indexg Indexe Indexl
上傳時(shí)間： 2013-12-22
上傳用戶(hù)：頂?shù)弥?/p>
A .zip file contains a series of scripts that were used in the MathWorks webinar "Using MATLAB to Develop Portfolio Optimization Models." The scripts generate 3D efficient frontiers for a universe of 44 stocks with time as the third axis. Additional scripts perform various ex-ante and ex-post analyses. Results are generated with and without market adjustments in the data. A readme.txt. file in the .zip folder describes each script and how to use it
標(biāo)簽： MathWorks contains scripts webinar
上傳時(shí)間： 2014-01-04
上傳用戶(hù)：trepb001
a Java program that reads in the following values from the standard input device (i.e. Keyboard) and writes its result on the standard output device (i.e. Console/Monitor): Inputs: A: the loan amount in dollars and cents (e.g. 150000.00). r: the net annual interest rate, expressed as an integer (e.g. 10 which means 10％) Y: the number of whole remaining years (for repayment) M: the number of remaining months Output: The program should calculate and output the amount of monthly repayments in dollars and cents as single value (e.g. $840.55)
標(biāo)簽： i.e. following the Keyboard
上傳時(shí)間： 2013-12-15
上傳用戶(hù)：米卡
made by: kangkai data:2008.11.23 this one is used to test arm7 str71x. use a led to test GPIO. a---------P0.0 b---------P0.1 c---------P0.2 d---------P0.3 e---------P0.4 f---------P0.5 g---------P0.6 just run it and you will see the led to show 0-9 all the time.
標(biāo)簽： test kangkai made 2008
上傳時(shí)間： 2016-12-16
上傳用戶(hù)：moerwang
A "code-what"? Unless you have spent some time working in the area of reverse engineering, chances are you have not heard of the term "codecave" before. If you have heard of it, you might not have read a clear definition of it or quite understand what it is or why it is useful. I have even asked seasoned assembly programmers about the term before and most of them had not heard of it. If it is new to you, do not worry, you are not the only one. It is a term that is scarcely used and is only useful in a reverse engineering context. Furthermore, is it "codecave" or "code cave"? I am not quite sure, but I will try my best to refer to it consistently as a "codecave". A space may sneak in there from time to time
標(biāo)簽： engineering code-what chances reverse
上傳時(shí)間： 2014-01-17
上傳用戶(hù)：hn891122
Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
標(biāo)簽： monoalphabetic Playfair provides security
上傳時(shí)間： 2017-05-25
上傳用戶(hù)：變形金剛
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
