Analytical constant-modulus algorithm, to separate linear combinations of CM sourcesThe algorithm is robust in the presence of noise, and is tested on measured data, collected from an experimental set-up.
标签： algorithm constant-modulus combinations Analytical
上传时间： 2016-02-17
上传用户：ayfeixiao
Permits to negotiate of simple form (without code) some of the most utilized combinations of keys in the forms. It suffices with freeing the component on the form and to activate the properties desired segun the behavior that want. * ENTER to change of field. * ESC to close the form * to Advance al following control * to Delay al previous control * function Keys *.. .
标签： combinations negotiate of utilized
上传时间： 2014-01-15
上传用户：linlin
OFELI is an object oriented library of C++ classes for development of finite element codes. Its main features are : * Various storage schemes of matrices (dense, sparse, skyline). * Direct methods of solution of linear systems of equations as well as various combinations of iterative solvers and preconditioners. * Shape functions of most "popular" finite elements * Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, ...).
标签： development oriented classes element
上传时间： 2015-03-03
上传用户：kbnswdifs
Ajax, the popular term for Asynchronous JavaScript and XML, is one of the most important combinations of technologies for web developers to know these days. With its rich grouping of technologies, Ajax developers can create interactive web applications with XML-based web services, using JavaScript in the browser to process the web server response.
标签： Asynchronous combination JavaScript the
上传时间： 2015-11-20
上传用户：qazxsw
Collection of key-value pairs. TDictionary represents a generic collection of key-value pairs. This class provides a mapping from a collection of keys to a collection of values. When you create a TDictionary object, you can specify various combinations of initial capacity, equality operation, and initial content. You can add a key that is associated with a corresponding value with the Add or AddOrSetValue methods. You can remove entries with Remove or Clear, which removes all key-value pairs. Adding or removing a key-value pair and looking up a key are efficient, close to O(1), because keys are hashed. A key must not be nil (though a value may be nil) and there must be an equality comparison operation for keys. You can test for the presence or keys and values with the TryGetValue, ContainsKey and ContainsValue methods. The Items property lists all Count dictionary entries. You can also set and get values by indexing the Items property. Setting the value this way overwrites any existing value. The class TObjectDictionary inherits from TDictionary and provides an automatic mechanism for freeing objects removed from dictionary entries.
标签： Delphi 泛型
上传时间： 2015-07-01
上传用户：mirage
