Results 51 to 60 of about 490,284 (147)
Numerical Evolution of Black Holes with a Hyperbolic Formulation of General Relativity [PDF]
We describe a numerical code that solves Einstein's equations for a Schwarzschild black hole in spherical symmetry, using a hyperbolic formulation introduced by Choquet-Bruhat and York.
A. Abrahams +28 more
core +2 more sources
Explicit construction of girth-eight QC-LDPC codes and its application in CRT method
For arbitrary code lengths of the form PL(P≥3L<sup>2</sup>/4+L-1),a new family of (4,L)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes was proposed explicitly with girth ight.Employing the new code as a component code in the ...
Guo-hua ZHANG, Rong SUN, Xin-mei WANG
doaj +2 more sources
With the growing demand, wireless sensor networks (WSNs) play an increasingly important role in many fields. The focus has been on deploying Luby transform (LT) codes in WSNs because of their inherent advantages in erasure channels.
Chuang Wang +4 more
doaj +1 more source
Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel
In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set.
Chilappagari, Shashi Kiran +3 more
core +1 more source
Iterated reflection principles over full disquotational truth [PDF]
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth.
Fischer, Martin +2 more
core +3 more sources
Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes
LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT ...
Rahnavard, Nazanin +2 more
core +1 more source
Parallelisation technique for serial 3D seismic codes: SMS approach
<p style="margin: 0.0px 0.0px 0.0px 0.0px; font: 9.0px Times;">We investigate a fast and easy way to parallelise seismological serial codes mainly oriented for simulating the</p> <p style="margin: 0.0px 0.0px 0.0px 0.0px; font: 9.0px Times;
Vittorio Ruggiero +3 more
doaj +1 more source
An Average Case NP-Complete Graph Coloring Problem
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring
Levin, Leonid A. +1 more
core +1 more source
Precisazioni sul nome scientifico del muflone e della capra di Montecristo
<strong>Abstract</strong> <strong>Statements on the scientific name of the European mouflon and the wild goat.</strong> Because of the lasting uncertainty on the correct scientific name of the European mouflon and of the wild
Folco Giusti
doaj +1 more source
Enhancing speed and scalability of the ParFlow simulation code
Regional hydrology studies are often supported by high resolution simulations of subsurface flow that require expensive and extensive computations. Efficient usage of the latest high performance parallel computing systems becomes a necessity.
Burstedde, Carsten +2 more
core +1 more source

