The subroutines glkern.f and lokern.f use an efficient and fast algorithm for automatically adaptive nonparametric regression estimation with a kernel method. Roughly speaking, the method performs a local averaging of the observations when estimating the regression function. Analogously, one can estimate derivatives of small order of the regression function.
标签： automatically subroutines and algorithm
上传时间： 2015-11-25
上传用户：luke5347
Make and answer phone calls Detect tone and pulse digit from the phone line Capture Caller ID Support blind transfer, single-step transfer/conference, consultation transfer/conference, hold, unhold. Control of the local phone handset, microphone and speaker of the modem Send and receive faxes Play and record on the phone line or sound card Play music in background mode Silence detection VU Meter Wave sound editor that allows your end-users to edit their own sound files. Voice recognition and voice synthesis. Full control over the serial port device ZModem file transfer utility File compression and encryption utility
上传时间： 2013-11-30
上传用户：水中浮云
UC Library Extensions UnderC comes with a pocket implementation of the standard C++ libraries, which is a reasonably faithful subset. This documentation describes those UnderC functions and classes which are not part of the C++ standard. UC Library Builtin functions: Most of these are standard C functions, but there are a few unique to the UnderC system which give you runtime access to the compiler. You may evaluate expressions, execute commands, compile code, etc. * Expands the text in expr using the UnderC preprocessor, putting the result into buff. void uc_macro_subst(const char* expr, char* buff, int buffsize) * Executes a UC #-command, like #l or #help. uc_cmd() expects the name of the command, _without_ the hash, e.g. uc_cmd("l fred.cpp") or uc_cmd("help"). void uc_cmd(const char* cmd) * Evaluates any C++ expression or statement will return non-zero if unsuccessful.
标签： implementation Extensions libraries standard
上传时间： 2013-12-14
上传用户：leehom61
We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.
标签： frequency-offset estimation quadrature amplitude
上传时间： 2014-01-22
上传用户：牛布牛
In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework is developed that unifies many of the methods which have been proposed over the last few decades in several different scientific disciplines. Novel extensions to the existing methods are also proposed.We showin particular how to incorporate local linearisation methods similar to those which have previously been employed in the deterministic filtering literature these lead to very effective importance distributions. Furthermore we describe a method which uses Rao-Blackwellisation in order to take advantage of the analytic structure present in some important classes of state-space models. In a final section we develop algorithms for prediction, smoothing and evaluation of the likelihood in dynamic models.
标签： sequential simulation posterior overview
上传时间： 2015-12-31
上传用户：225588
％ A 2D homogeneous convection-diffusion case (u=exp(-ex*deta*x-ex*deta*y) with a square with ％ all Dirichlet boundary, note that reaction coefficient is not zero ％ by indirect BKM
标签： convection-diffusion deta with homogeneous
上传时间： 2016-01-03
上传用户：CHINA526
This library provides a C++ interface to XML files. It uses libxml 2 to access the XML files, and in order to configure libxml++ you must have both libxml and pkg-config installed.
标签： files interface XML provides
上传时间： 2016-01-05
上传用户：firstbyte
radius协议源码÷The Radius Stack will connect to a Radius Server. This stack implementation is built upon the UdpStack which is available in the radius{version}/util directory. A minimal set of VSAs (Vendor Specific Attributes are supported by this stack). The Radius Stack should be used as a base class. In order to implement a larger set of VSAs, one will need to subclass from the Radius Stack and implement the functionality within the virtual function processVsa(). The Radius Stack supports mostly accounting messages. The authentcation messages will be supported in a future release. A test program has been provided in the radius directory. This program shows how to subclass from the RadiusStack and how to use the api.
标签： Radius implementation connect radius
上传时间： 2013-12-12
上传用户：坏天使kk
This gives examples of Session Description Protocol (SDP) offer/answer exchanges. Examples include codec negotiation and selection, hold and resume, and addition and deletion of media streams. The examples show multiple media types, bidirectional, unidirectional, inactive streams, and dynamic payload types. Common Third Party Call Control (3pcc) examples are also given.
标签： Description exchanges Protocol Examples
上传时间： 2014-01-02
上传用户：450976175
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.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
