This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following Structure: [min|max] C x s.t. Ax ["="|"<="|">="] b {x <= UB} {x >= LB} The calling syntax is: [XMIN,FMIN,STATUS,EXTRA]=glpkmex(SENSE,C,A,B,CTYPE,LB,UB,... VARTYPE,PARAM,LPSOLVER,SAVE)
标签： problem following routine library
上传时间： 2014-12-01
上传用户：changeboy
In 揚erformance of multi-carrier DS CDMA Systems?we apply a multi-carrier signaling technique to a direct-sequence CDMA system, where a data sequence multiplied by a spreading sequence modulates multiple carriers, rather than a single carrier. The receiver provides a correlator for each carrier, and the outputs of the correlators are combined with a maximal-ratio combiner. This type of signaling has the desirable properties of exhibiting a narrowband interference suppression effect, along with robustness to fading, without requiring the use of either an explicit RAKE Structure or an interference suppression filter.
标签： multi-carrier erformance signaling technique
上传时间： 2017-07-31
上传用户：宋桃子
sba, a C/C++ package for generic sparse bundle adjustment is almost invariably used as the last step of every feature-based multiple view reconstruction vision algorithm to obtain optimal 3D Structure and motion (i.e. camera matrix) parameter estimates. Provided with initial estimates, BA simultaneously refines motion and Structure by minimizing the reprojection error between the observed and predicted image points.
标签： adjustment invariably package generic
上传时间： 2013-12-18
上传用户：xsnjzljj
to study the example of creation of tables, formative DB, and filling with their information. Using this example to create DB, satisfying a logical Structure, to developed in previous laboratory work and to fill with its information. To study a command SQL SELECT.
标签： information formative creation example
上传时间： 2017-09-15
上传用户：dengzb84
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data Structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
标签： implement algorithm Dijkstra Shortest
上传时间： 2014-01-01
上传用户：BIBI
C++ 的经典算法书, pdf版, 十分清晰, Goodrich等人著.
标签： C++
上传时间： 2015-06-03
上传用户：m009988
设初始序列为a1,a2,……,an，以序列中的某个元素ai为基准(轴)，经调整后，使得ai左边的元素均小于ai，右边的均大于等于ai，而后对这两个子区再分别使用快速排序。 [具体要求] (1) 需要用一维数组a来存储等待排序的序列； (2) 设置两个工作指针i和j； (3) 每次快速排序都以排序区域的首元素为基准(轴)； (4) 程序用递归函数来实现。
标签： c++
上传时间： 2015-12-28
上传用户：markhu53
read_segy_file_legacy Function reads a SEG-Y file and outputs a seismic Structure Last updated: April 6, 2007: fix bug in reading of user-specified header
上传时间： 2019-04-04
上传用户：wc12
Function reads a SEG-Y file and outputs a seismic Structure; the function
标签： read_segy_file
上传时间： 2019-04-04
上传用户：wc12
The rapid growth of the Web in the past two decades has made it the larg- est publicly accessible data source in the world. Web mining aims to dis- cover useful information or knowledge from Web hyperlinks, page con- tents, and usage logs. Based on the primary kinds of data used in the mining process, Web mining tasks can be categorized into three main types: Web Structure mining, Web content mining and Web usage mining.
上传时间： 2020-05-26
上传用户：shancjb
