1,944 research outputs found
Aerodynamic investigation of an air-cooled axial-flow turbine. Part 2: Rotor blade tip-clearance effects on overall turbine performance and internal gas flow conditions: Experimental results and prediction methods
Total turbine blade performance was investigated while changing the blade tip clearance in three ways. The internal flow at the moving blade outlet point was measured. Experimental results were compared with various theoretical methods. Increased blade clearance leads to decreased turbine efficiency
Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
A lossy compression algorithm for binary redundant memoryless sources is
presented. The proposed scheme is based on sparse graph codes. By introducing a
nonlinear function, redundant memoryless sequences can be compressed. We
propose a linear complexity compressor based on the extended belief
propagation, into which an inertia term is heuristically introduced, and show
that it has near-optimal performance for moderate block lengths.Comment: 4 pages, 1 figur
Error correcting code using tree-like multilayer perceptron
An error correcting code using a tree-like multilayer perceptron is proposed.
An original message \mbi{s}^0 is encoded into a codeword \boldmath{y}_0
using a tree-like committee machine (committee tree) or a tree-like parity
machine (parity tree). Based on these architectures, several schemes featuring
monotonic or non-monotonic units are introduced. The codeword \mbi{y}_0 is
then transmitted via a Binary Asymmetric Channel (BAC) where it is corrupted by
noise. The analytical performance of these schemes is investigated using the
replica method of statistical mechanics. Under some specific conditions, some
of the proposed schemes are shown to saturate the Shannon bound at the infinite
codeword length limit. The influence of the monotonicity of the units on the
performance is also discussed.Comment: 23 pages, 3 figures, Content has been extended and revise
Synapse efficiency diverges due to synaptic pruning following over-growth
In the development of the brain, it is known that synapses are pruned
following over-growth. This pruning following over-growth seems to be a
universal phenomenon that occurs in almost all areas -- visual cortex, motor
area, association area, and so on. It has been shown numerically that the
synapse efficiency is increased by systematic deletion. We discuss the synapse
efficiency to evaluate the effect of pruning following over-growth, and
analytically show that the synapse efficiency diverges as O(log c) at the limit
where connecting rate c is extremely small. Under a fixed synapse number
criterion, the optimal connecting rate, which maximize memory performance,
exists.Comment: 15 pages, 16 figure
Parallel dynamics of continuous Hopfield model revisited
We have applied the generating functional analysis (GFA) to the continuous
Hopfield model. We have also confirmed that the GFA predictions in some typical
cases exhibit good consistency with computer simulation results. When a
retarded self-interaction term is omitted, the GFA result becomes identical to
that obtained using the statistical neurodynamics as well as the case of the
sequential binary Hopfield model.Comment: 4 pages, 2 figure
- …