Results 51 to 60 of about 3,049,343 (222)
On a Kelvin-Voigt Viscoelastic Wave Equation with Strong Delay [PDF]
, 2018 An initial-boundary value problem for a viscoelastic wave equation subject to a strong time-localized delay in a Kelvin & Voigt-type material law is considered. Transforming the equation to an abstract Cauchy problem on the extended phase space, a global
Andrii Anikushyn +8 more
core +3 more sources
, 2012 We present a new numerical code to compute non-axisymmetric eigenmodes of rapidly rotating relativistic stars by adopting spatially conformally flat approximation of general relativity.
E. Gourgoulhon +5 more
core +1 more source
, 2001 While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the ...
Gacs, Peter, Tromp, John, Vitanyi, Paul
core +3 more sources
, 2023 This case study is based on a research project that analyzed how expert evaluators combine different modes of thinking when screening ideas for innovation. The findings of this research project are detailed in the journal article, “How experts screen ideas: the complex interplay of intuition, analysis and sensemaking” by Sukhov et al.
Alexandre Sukhov, Antti Sihvonen
openaire +3 more sources
SENTENCING SCOPES (RANGES) IN THE CRIMINAL CODE OF MONTENEGRO AND THE SENTENCING POLICY
Revija za kriminologiju i krivično pravo, 2021 The fixing of sentence is one of the most important issues in both criminal law theory and practice. In a certain sense, all provisions of the criminal legislation are embodied precisely in the fixing of sentence.
Darko Radulović
doaj +1 more source
An Algorithmic Reduction Theory for Binary Codes: LLL and More
IEEE Transactions on Information Theory, 2022 In this article, we propose an adaptation of the algorithmic reduction theory of lattices to binary codes. This includes the celebrated LLL algorithm (Lenstra, Lenstra, Lovasz, 1982), as well as adaptations of associated algorithms such as the Nearest ...
Thomas Debris-Alazard +2 more
semanticscholar +1 more source
Randomized Fast Design of Short DNA Words
, 2005 We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivations including DNA computing and DNA self-assembly.
Kao, Ming-Yang +2 more
core +2 more sources
Journal of High Energy Physics, 2023 Recently introduced connections between quantum codes and Narain CFTs provide a simple ansatz to express a modular-invariant function Z τ τ ¯ $$ Z\left(\tau, \overline{\tau}\right) $$ in terms of a multivariate polynomial satisfying certain additional ...
Anatoly Dymarsky, Rohit R. Kalloor
doaj +1 more source
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words [PDF]
, 2012 Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional ...
Kao, Ming-Yang +3 more
core +2 more sources
Nuclear Engineering and Technology, 2013 MAAP4 is a computer code that can simulate the response of a light water reactor power plant during severe accident sequences, including actions taken as part of accident management.
KEVIN ROBERTS, ROBERT SANDERS
doaj +1 more source