This toolbox was designed as a teaching aid, which matlab is particularly good for since source code is relatively legible and simple to modify. However, it is still reasonably fast if used with the supplied optimiser. However, if you really want to speed things up you should consider compiling the matrix composition routine for H into a mex function. Then again if you really want to speed things up you probably shouldn t be using matlab anyway... Get hold of a dedicated C program once you understand the algorithm.
标签： particularly designed teaching toolbox
上传时间： 2016-11-25
上传用户：hustfanenze
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
isual Chat 1.91 Developer Edition - Customize the Visual Chat code regarding your own requirements - Use customchatdev.html for developing / testing - Create .jar and .cab-files containing client-specific .class-files and the images-folder (use zip and cabarc compressing tools) - Adapt the customchat.html file - Upload all the files to your webserver - Start the ChatServer by invoking java at.ac.uni_linz.tk.vchat.ChatServer [port [server-key]] from your commandline - I kindly ask you to leave copyright and credit information in the InfoPanel.class as it is - but you are invited to add your own text. In case of violations I will consider excluding this class from the source in the future.
标签： Chat requirement Developer Customize
上传时间： 2017-01-27
上传用户：iswlkje
Description: Microsoft?Windows?HTTP Services (WinHTTP) provides developers with a server-supported, high-level interface to the HTTP/1.1 Internet protocol. WinHTTP is designed to be used primarily in server-based scenarios by server applications that communicate with HTTP servers. WinHTTP is also designed for use in system services and HTTP-based client applications. WinHTTP is more secure and robust than WinInet. However, single-user applications that need FTP or gopher functionality, cookie persistence, caching, automatic credential dialog handling, Internet Explorer compatibility, or downlevel platform support should still consider using WinInet.
标签： server-supported Description developers Microsoft
上传时间： 2017-02-07
上传用户：refent
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
标签： the subsequence determine Instead
上传时间： 2013-12-17
上传用户：evil
We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.
标签： effectiveness analytically numerically cloaking
上传时间： 2017-03-30
上传用户：zxc23456789
Behavioral models are used in games and computer graphics for realistic simulation of massive crowds. In this paper, we present a GPU based implementation of Reynolds [1987] algorithm for simulating flocks of birds and propose an extension to consider environment self occlusion. We performed several experiments and the results showed that the proposed approach runs up to three times faster than the original algorithm when simulating high density crowds, without compromising significantly the original crowd behavior.
标签： Behavioral simulation realistic computer
上传时间： 2017-09-08
上传用户：hanli8870
to become acquainted with a concept « cursor» language of SQL, by the types of cursors, to study the process of creation and application of cursors. To consider the examples of the use of cursors at creation of SQL of queries.
标签： acquainted language concept cursors
上传时间： 2013-12-24
上传用户：libenshu01
We consider the problem of target localization by a network of passive sensors. When an unknown target emits an acoustic or a radio signal, its position can be localized with multiple sensors using the time difference of arrival (TDOA) information. In this paper, we consider the maximum likelihood formulation of this target localization problem and provide efficient convex relaxations for this nonconvex optimization problem.We also propose a formulation for robust target localization in the presence of sensor location errors. Two Cramer-Rao bounds are derived corresponding to situations with and without sensor node location errors. Simulation results confirm the efficiency and superior performance of the convex relaxation approach as compared to the existing least squares based approach when large sensor node location errors are present.
标签： 传感器网络
上传时间： 2016-11-27
上传用户：xxmluo
In this paper, we consider the channel estimation problem in Millimeter wave (mmWave) wireless systems with large antenna arrays. By exploiting the inherent sparse nature of the mmWave channel, we develop a novel rate-adaptive channel estimation (RACE) algorithm, which can adaptively adjust the number of required channel measurements based on an expected probability of estimation error (PEE).
标签： Estimation Millimeter Adaptive Approach Channel Systems Rate MIMO Wave for
上传时间： 2020-05-26
上传用户：shancjb
