Filtry
wszystkich: 250
wybranych: 162
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: deterministic σ-algebra
-
Exsolution of Ni nanoparticles on the surface of cerium and nickel co-doped lanthanum strontium titanate as a new anodic layer for DIR-SOFC. Anti-coking potential and H2S poisoning resistance of the prepared material
PublikacjaThe aim of this study was to evaluate a new catalytic material for biogas fueled DIR-SOFC. This material was a perovskite-type SrTiO3 doped with La, Ce and Ni of a general formula La0.27Sr0.54Ce0.09Ni0.1Ti0.9O3-σ (LSCNT). Additional preparation steps were undertaken to promote a nickel exsolution process. Heat post-treatment of powders in a humidified H2 resulted in an intensive growth of nickel nanoparticles (NPs) while the temperature...
-
Kompleksy metali przejściowych zawierające ligand R2P-P
PublikacjaBadania obejmują kompleksy metali przejściowych zawierające ligandy fosfanylofosfinidenowe oraz fosfanylofosfidowe. Kompleksy te są pochodnymi kompleksów fosfinidenowych oraz fosfidowych, gdzie grupa alkilowa została zastąpiona grupą fosfanylową (R’2P). W pracy można wydzielić trzy główne obszary badań. Pierwszym było zbadanie reaktywności R2PP(SiMe3)Li względem diamidowych bądź β-diketiminowych kompleksów cyrkonu zawierających...
-
Bounds on the Cover Time of Parallel Rotor Walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
Randomness Amplification under Minimal Fundamental Assumptions on the Devices
PublikacjaRecently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components...
-
Implementation of Non-Probabilistic Methods for Stability Analysis of Nonlocal Beam with Structural Uncertainties
PublikacjaIn this study, a non-probabilistic approach based Navier’s Method (NM) and Galerkin Weighted Residual Method (GWRM) in term of double parametric form has been proposed to investigate the buckling behavior of Euler-Bernoulli nonlocal beam under the framework of the Eringen's nonlocal elasticity theory, considering the structural parameters as imprecise or uncertain. The uncertainties in Young’s modulus and diameter of the beam are...
-
Constrained multi-objective optimization of compact microwave circuits by design triangulation and pareto front interpolation
PublikacjaDevelopment of microwave components is an inherently multi-objective task. This is especially pertinent to the design closure stage, i.e., final adjustment of geometry and/or material parameters carried out to improve the electrical performance of the system. The design goals are often conflicting so that the improvement of one normally leads to a degradation of others. Compact microwave passives constitute a representative case:...
-
Automatic Regularization by Quantization in Reducible Representations of CCR: Point-Form Quantum Optics with Classical Sources
PublikacjaElectromagnetic fields are quantized in a manifestly covariant way by means ofa class of reducible "center-of-mass N-representations" of the algebra of canonical commutationrelations (CCR). The four-potential Aa(x) transforms in these representations as aHermitian four-vector field in Minkowski four-position space (without change of gauge), butin momentum space it splits into spin-1 massless photons and two massless scalars. Whatwe...
-
5-Thiocyanato-2′-deoxyuridine as a possible radiosensitizer: electron-induced formation of uracil-C5-thiyl radical and its dimerization
PublikacjaIn this work, we have synthesized 5-thiocyanato-2′-deoxyuridine (SCNdU) along with the C6-deuterated nucleobase 5-thiocyanatouracil (6-D-SCNU) and studied their reactions with radiation-produced electrons. ESR spectra in γ-irradiated nitrogen-saturated frozen homogeneous solutions (7.5 M LiCl in H2O or D2O) of these compounds show that electron-induced S–CN bond cleavage occurs to form a thiyl radical (dU-5-S˙ or 6-D-U-5-S˙) and...
-
Complex multidisciplinary optimization of turbine blading systems
PublikacjaThe paper describes the methods and results of direct optimization of turbine blading systems using a software package Opti_turb. The final shape of the blading is obtained from minimizing the objective function, which is the total energy loss of the stage, including the leaving energy. The current values of the objective function are found from 3D RANS computations (from a code FlowER) of geometries changed during the process...
-
Investigation of long-range dependencies in the stochastic part of daily GPS solutions
PublikacjaThe long-range dependence (LRD) of the stochastic part of GPS-derived topocentric coordinates change (North, East, Up) results with relatively high autocorrelation values with a focus on self-similarity. One of the reasons for such self-similarity in the GPS time series are noises that are commonly recognised to prevail in the form of the flicker noise model. To prove the self-similarity of the stochastic part of GPS time series...
-
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
PublikacjaWe describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...