نتایج جستجو برای: symmetric channel section

تعداد نتایج: 453387  

Journal: :Journal of Machine Learning Research 2010
Fabian H. Sinz Matthias Bethge

A important part in statistical analysis of data is to find a class of models that is flexible and rich enough to model the regularities in the data, but at the same time exhibits enough symmetry and structure itself to still be computationally and analytically tractable. One special way of introducing such a symmetry is to fix the general form of the isodensity contour lines. This approach was...

Journal: :IEEE Trans. Information Theory 1996
Alexander V. Kuznetsov Francis Swarts A. J. Han Vinck Hendrik C. Ferreira

In the first part of the correspondence we derive an upper bound on the undetected error probability of binary ( n , k ) block codes used on channels with memory described by Markov distributions. This bound is a generalization of the bound presented by Kasami et al. for the binary symmetric channel, and is given as an average value of some function of the composition of the state sequence of t...

Journal: :CoRR 2008
Johannes B. Huber Thorsten Hehn

We consider coded transmission over a memoryless channel with some fixed capacity C and derive properties of channel coding schemes leading to the lowest bit error rate and frame error rate, respectively. The resulting overall optimum channels (including encoder, underlying channel, and decoder) behave like a binary symmetric channel and a fully bursty channel (block binary erasure channel), re...

1994
Igor Frenkel

Recently I.Macdonald defined a family of systems of orthogonal symmetric polynomials depending of two parameters q, k which interpolate between Schur’s symmetric functions and certain spherical functions on SL(n) over the real and p-adic fields [M]. These polynomials are labeled by dominant integral weights of SL(n), and (as was shown by I.Macdonald) are uniquely defined by two conditions: 1) t...

1998
Jongtae Lim David L. Neuhoff Troy C. Nolan

Given an available number of arithmetic operations per data sample, the tandem connection of a transform source code and a Reed-Solomon channel code is optimized to minimize meansquared error when transmitting Gauss-Markov data across a binary symmetric channel. The goal is to learn how well-designed systems allocate complexity, i.e. arithmetic operations, between source and channel coding. The...

Journal: :PROCEEDINGS OF HYDRAULIC ENGINEERING 1995

2004
Xue Shao Zhiping Yu

In this paper, we have carried out a numerical simulation of FinFETs. The model is based on 1D non-equilibrium Green’s function (NEGF) along the channel and 2-D Schrödinger equation in the confined cross section and provides insights into the performance of FinFETs with ultra small channel cross section. The simulation results of FinFETs show normal I-V characteristics with great potential in s...

Journal: :Asymptotic Analysis 2021

In this paper, we present a new non-linear dispersive model for open channel and river flows. These equations are the second-order shallow water approximation of section-averaged (three-dimensional) incompressible irrotational Euler system. This asymptotic generalises well-known one-dimensional Serre–Green–Naghdi (SGN) rectangular section on uneven bottom to arbitrary channel/river section.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید