Search results for "LIC"
showing 10 items of 51177 documents
Economic Support during the COVID Crisis. Quantitative Easing and Lending Support Schemes in the UK
2021
Abstract We investigate how UK bank business lending responded to the simultaneous use of quantitative easing, leverage ratio capital requirements, and government COVID lending support schemes. We find no evidence that the Brexit wave increased lending to nonfinancial businesses, compared to the previous waves, except for QE-banks subject to the UK leverage ratio, suggesting that the ratio incentivised QE-banks to lend to businesses. The government schemes helped expand lending especially to SMEs post the COVID wave, indicating that complementing QE with other credit easing programmes can reinforce its impact on lending to the real economy. During COVID-stress, changes to the UK leverage ra…
NightShift: NMR shift inference by general hybrid model training - a framework for NMR chemical shift prediction
2013
F-contractions of Hardy–Rogers-type and application to multistage decision
2016
We prove fixed point theorems for F-contractions of Hardy–Rogers type involving self-mappings defined on metric spaces and ordered metric spaces. An example and an application to multistage decision processes are given to show the usability of the obtained theorems.
Codimension growth of central polynomials of Lie algebras
2019
Abstract Let L be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic zero and let I be the T-ideal of polynomial identities of the adjoint representation of L. We prove that the number of multilinear central polynomials in n variables, linearly independent modulo I, grows exponentially like ( dim L ) n {(\dim L)^{n}} .
Efficient generation of restricted growth words
2013
A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.
Multiple Solutions for Fractional Boundary Value Problems
2018
Variational methods and critical point theorems are used to discuss existence and multiplicity of solutions for fractional boundary value problem where Riemann–Liouville fractional derivatives and Caputo fractional derivatives are used. Some conditions to determinate nonnegative solutions are presented. An example is given to illustrate our results.
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Angular dependence of the domain wall depinning field in the sensors with segmented corners
2017
Rotating domain wall based sensors that have recently been developed are based on a segmented looping geometry. In order to determine the crucial pinning of domain walls in this special geometry, we investigate the depinning under different angles of an applied magnetic field and obtain the angular dependence of the depinning field of the domain walls. Due to the geometry, the depinning field not only exhibits a 180$^\circ$-periodicity but a more complex dependence on the angle. The depinning field depends on two different angles associated with the initial state and the segmented geometry of the corner. We find that depending on the angle of the applied field two different switching proces…
Batch-to-Melt Conversion Kinetics in Sodium Aluminosilicate Batches Using Different Alumina Raw Materials
2016
The batch-to-melt conversion in batches of sand, soda ash and corundum (C), alumina spinel (A), boehmite (B), or gibbsite (G) as Al2O3 carrier are studied using thermal analysis, X-ray diffraction, and 27Al nuclear magnetic resonance spectroscopy. Laboratory-scaled batches are either heated continuously or quenched from 1600°C in a series of increasing dwell times. The results show that the conversion from the raw materials to the fresh melt proceeds in two kinetic stages. During the first stage (3–5 min), fast conversion of nearly 95% by mass occurs and the conversion coefficient increases in the order G < C ≈ A < B. The second stage is controlled by the slow dissolution of intermediate cr…