Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is different from the so-called minimum path. The latter is a path with minimum cost.
标签： binary-state reliability probability network
上传时间： 2015-12-04
上传用户：xcy122677
SharpZipLib之前叫做NZipLib，完全由 C# 开发的压缩库，支持Zip, GZip, Tar and BZip2 ，为2007年8月最新0852release版的源文件和文档说明！ Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels
标签： SharpZipLib NZipLib
上传时间： 2015-12-11
上传用户：84425894
SharpZipLib之前叫做NZipLib，完全由 C# 开发的压缩库，支持Zip, GZip, Tar and BZip2 ，为2007年8月最新0852release版的代码实例！ Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels
标签： SharpZipLib NZipLib
上传时间： 2015-12-11
上传用户：love_stanford
This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method and a performance bound is provided at the same time.
标签： optimization employs optical network
上传时间： 2015-12-27
上传用户：dongbaobao
#if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_) #define AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_ #if _MSC_VER > 1000 #pragma once #endif // _MSC_VER > 1000 class CGAQueen { public: CGAQueen(int nPopulation,int nIteration,float Mutation,int mChBoard) virtual ~CGAQueen() void Clear() // to clear chess board with 0 value void InitialPopulation() // to create the first and initial randompopulation void FillArea(int index) // to fill chess board with desired chromosome int CostFunc(int index) // determine the cost of matrix[index][index] void PopulationSort() // to sort population from the best to the worst void GenerateCrossOverMatrix() // a way to create children from parent is CcrossOver void Mating() // to create children from parents void Ap
标签： AFX_GAQUEEN_H INCLUDED defined define
上传时间： 2015-12-27
上传用户：wuyuying
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
上传用户：牛布牛
We propose a novel approach for head tracking, which combines particle filters with Isomap. The particle filter works on the low-dimensional embedding of training images. It indexes into the Isomap with its state variables to find the closest template for each particle. The most weighted particle approximates the location of head. We develop a synthetic video sequence to test our technique. The results we get show that the tracker tracks the head which changes position, poses and lighting conditions.
标签： approach combines particle tracking
上传时间： 2016-01-02
上传用户：yy541071797
An unsatisfactory property of particle filters is that they may become inefficient when the observation noise is low. In this paper we consider a simple-to-implement particle filter, called ‘LIS-based particle filter’, whose aim is to overcome the above mentioned weakness. LIS-based particle filters sample the particles in a two-stage process that uses information of the most recent observation, too. Experiments with the standard bearings-only tracking problem indicate that the proposed new particle filter method is indeed a viable alternative to other methods.
标签： unsatisfactory inefficient property particle
上传时间： 2014-01-11
上传用户：大三三
ARMask.The ARM has six operating modes: • User (unprivileged mode under which most tasks run) • FIQ (entered when a high priority (fast) interrupt is raised) • IRQ (entered when a low priority (normal) interrupt is raised) • Supervisor (entered on reset and when a Software Interrupt instruction is executed) • Abort (used to handle memory access violations) • Undef (used to handle undefined instructions) * ARM Architecture Version 4 adds a seventh mode: • System (privileged mode using the same registers as user mode)
标签： unprivileged operating ARMask modes
上传时间： 2013-12-24
上传用户：bcjtao
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
