991 resultados para Inf-convolution
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
Resumen basado en el de la publicaci??n
Resumo:
The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks. In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees. Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay. Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations. To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios. Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of traffic (CLRj), an expression for the CLRj evaluation is also presented. We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.
Resumo:
In this paper we study Dirichlet convolution with a given arithmetical function f as a linear mapping 'f that sends a sequence (an) to (bn) where bn = Pdjn f(d)an=d.
We investigate when this is a bounded operator on l2 and ¯nd the operator norm. Of particular interest is the case f(n) = n¡® for its connection to the Riemann zeta
function on the line 1, 'f is bounded with k'f k = ³(®). For the unbounded case, we show that 'f : M2 ! M2 where M2 is the subset of l2 of multiplicative sequences, for many f 2 M2. Consequently, we study the `quasi'-norm sup kak = T a 2M2 k'fak kak
for large T, which measures the `size' of 'f on M2. For the f(n) = n¡® case, we show this quasi-norm has a striking resemblance to the conjectured maximal order of
j³(® + iT )j for ® > 12 .
Resumo:
Hepatitis C virus (HCV) infection frequently persists despite substantial virus-specific immune responses and the combination of pegylated interferon (INF)-alpha and ribavirin therapy. Major histocompatibility complex class I restricted CD8+ T cells are responsible for the control of viraemia in HCV infection, and several studies suggest protection against viral infection associated with specific HLAs. The reason for low rates of sustained viral response (SVR) in HCV patients remains unknown. Escape mutations in response to cytotoxic T lymphocyte are widely described; however, its influence in the treatment outcome is ill understood. Here, we investigate the differences in CD8 epitopes frequencies from the Los Alamos database between groups of patients that showed distinct response to pegylated alpha-INF with ribavirin therapy and test evidence of natural selection on the virus in those who failed treatment, using five maximum likelihood evolutionary models from PAML package. The group of sustained virological responders showed three epitopes with frequencies higher than Non-responders group, all had statistical support, and we observed evidence of selection pressure in the last group. No escape mutation was observed. Interestingly, the epitope VLSDFKTWL was 100% conserved in SVR group. These results suggest that the response to treatment can be explained by the increase in immune pressure, induced by interferon therapy, and the presence of those epitopes may represent an important factor in determining the outcome of therapy.