Filters
total: 1015
filtered: 20
-
Catalog
- Publications 643 available results
- Journals 153 available results
- Conferences 160 available results
- Publishing Houses 1 available results
- People 23 available results
- Projects 3 available results
- e-Learning Courses 11 available results
- Events 1 available results
- Open Research Data 20 available results
Chosen catalog filters
Search results for: ENERGY-AWARE COMPUTING, HIGH PERFORMANCE COMPUTING, GREEN COMPUTING, NAS PARALLEL BENCHMARK
-
Computing dynamical curlicues
Open Research DataA curlicue is a piece-wise linear curve in the complex plane which can be generated by an arbitrary sequence of real numbers u_n. It can be interpreted as a trajectory of a particle in the plane which starts in the origin at time t=0 and moves with a constant velocity, changing its direction at instances t=0,1,2,3,..., where the new direction is given...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, computing λ only
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Data obtained by computation for X-ray imaging of grating without magnification using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 2 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 4 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 8 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by numerical simulation for X-ray focusing using a finite difference method
Open Research DataThe propagation of X-ray waves through an optical system consisting of many X-ray refractive lenses is considered. For solving the problem for an electromagnetic wave, a finite-difference method is applied.
-
The luminescence study ofNaK2Li[Li3SiO4]4:Eu coumpounds.
Open Research DataNarrowband green phosphors with high quantum efficiency are required for backlighting white light-emitting diode (WLED) devices. Materials from the A[Li3SiO4]4:Eu2+ family have recently been proposed as having superior properties to industry-standard β-SiAlON green phosphors. Here, we show that a cheap, easily synthesized host NaK2Li[Li3SiO4]4 (NKLLSO)...
-
Database of the estimations of the numbers of simplices of triangulation of some classical Lie groups
Open Research DataIt is know that any smooth manifold can be triangulated. The number of simplices of triangulation of a given manifold depends on its topological and combinatorial structure. The data consists of the lower bounds for the numbers of simplices of each dimension of any triangulation of classical Lie groups U(n), SU(n), Sp(n), and SO(n) for n up to 25. Each...
-
Vident-lab: a dataset for multi-task video processing of phantom dental scenes
Open Research DataWe introduce a new, asymmetrically annotated dataset of natural teeth in phantom scenes for multi-task video processing: restoration, teeth segmentation, and inter-frame homography estimation. Pairs of frames were acquired with a beam splitter. The dataset constitutes a low-quality frame, its high-quality counterpart, a teeth segmentation mask, and...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes.
Open Research DataMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that were carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of considered...
-
Data obtained by computation for X-ray focusing using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of several X-ray refractive lenses is considered. Gaussian beams are exact solutions of the paraxial equation. The Helmholtz equation describes the propagation of a monochromatic electromagnetic wave. Since the widths of the beams are much larger than the wavelength of X-rays, Gaussian...
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Minimal number of periodic points for smooth self-maps of simply-connected manifolds
Open Research DataThe problem of finding the minimal number of periodic points in a given class of self-maps of a space is one of the central questions in periodic point theory. We consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant D_r[f] is equal to the minimal number of r-periodic points...
-
Stochastic intervals for the family of quadratic maps
Open Research DataNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 4 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 4 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 6 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 6 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 5 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 5 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 8 and homology groups with the sum of ranks less or equal to 10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 8 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 7 and homology groups with the sum of ranks less or equal to10
Open Research DataAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 7 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...