736 research outputs found
In memory of Bruce McEwen: a gentle giant of neuroscience
No full textOn 2 January 2020, the neuroscience community lost not only a pioneering figure, but also a generous and influential thought leader. Bruce Sherman McEwen, head of the Harold and Margaret Milliken Hatch Laboratory of Neuroendocrinology at the Rockefeller University, passed away at age 81, following a short illness. A member of the National Academy of Sciences, National Academy of Medicine and American Academy of Arts & Sciences, and former president of the Society for Neuroscience, Bruce will be remembered for his profound scientific impact, measured not only by output of papers, but also by the large family of neuroscientists he trained over a career spanning nearly six decades. Above all, Bruce will be remembered for his generosity, kindness, gentleness of soul, and for being an extraordinary mentor.Metabolic health: pathophysiological trajectories and therap
On some research guidelines initiated by articles of Academician I.N. Kovalenko
No full textНаведено огляд деяких напрямків досліджень, які були ініційовані І.М. Коваленком та знайшли відображення у сумісних роботах з автором даної статті. До них відносяться: метод «штучних» моментів регенерації, асимптотична нечутливість, метод Монте-Карло та методи зменшення дисперсії оцінок, принцип монотонних відмов.A review of some research guidelines which were initiated by I.N. Kovalenko and used in joint articles with the author is given. These are: method of «artificial» regeneration moments, asymptotic insensitivity, Monte Carlo method and variance reduction methods, principle of monotone failures
Bank capital adequacy : perspectives and prospects
No full textAn abstract for this article is not availableBanks and banking
Bank capital adequacy : perspectives and prospects
No full textAn abstract for this article is not availableBanks and banking
Counting sequences, Gray codes and lexicodes
No full textA counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n). The number of bit positions where two codewords differ is called the Hamming distance of these two codewords. The average Hamming distance of a counting sequence of length n is defined as the average Hamming distance between the 2^n pairs of successive codewords, including the pair of the last and the first codeword. A counting sequence of length n which has average Hamming distance equal to n-1/2 is called a maximum counting sequence. The number of bit changes in bit position i, in a counting sequence of length n is called the transition count of bit position i. If a counting sequence of length n has the property that the difference between any two bit positions is at most 2, the sequence is called balanced. We introduce a construction for balanced maximum counting sequences for every codeword length n>0, n not equal 4, which implies a proof of a longstanding conjecture of Robinson and Cohn in [IEEE Trans. Computers, vol. C-30, pp. 17-23, 1981]. A counting sequence of length n which has the property that any two successive codewords in the list have the same Hamming distance is called uniform. We introduce a heuristic construction how to construct uniform sequences. This construction occasionally produces balanced sequences, and so gives a partial answer to another conjecture of Robinson and Cohn dealing with the existence of balanced uniform counting sequences [IEEE Trans. Computers, vol. C-30, pp. 17-23, 1981]. A cyclic Gray code of length n is a uniform sequence of length n with Hamming distance exactly one between any two successive codewords. We introduce a construction of Gray codes satisfying the property that either all transition counts are equal to the same power of two, or are all equal to two consecutive powers of two, which proves the conjecture of Wagner and West in [Congressus Numerantium, vol. 80, pp. 217-223, 1991]. Furthermore, we also introduce a construction of Gray codes of length n>0, n not equal 3, inducing the complete graph K_n, thus providing the complete answer for an open problem suggested by Wilmer and Ernst in [Discrete Mathematics, vol. 257, pp. 585-598, 2002]. Moreover, we derive the separability function of the reflected N-ary Gray codes. We also introduce a simple method for the construction of cyclic N-ary Gray codes, and for the construction of constant weight N-ary Gray codes. The separability functions of these codes are derived as well. In the remaining part of the thesis we present a greedy algorithm for the construction of a large class of linear q-ary lexicodes which generalizes the algorithms in several other papers. By applying this method, one can produce linear lexicodes which cannot be constructed by previous algorithms. Especially, we discuss some interesting properties of self-orthogonal ternary lexicodes.Electrical Engineering, Mathematics and Computer Scienc
Phagocytes, free radicals and endothelial injury in systemic vasculitis
No full textSIGLEAvailable from British Library Document Supply Centre-DSC:DXN004071 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Coset construction of a D-brane gauge field
No full textAbstractD-branes have a world-volume U(1) gauge field A whose field strength F=dA gives rise to a Born–Infeld term in the D-brane action. Supersymmetry and kappa symmetry transformations of A are traditionally inferred by the requirement that the Born–Infeld term is consistent with both supersymmetry and kappa symmetry of the D-brane action. In this paper, we show that integrability of the assigned supersymmetry transformations leads to an extension of the standard supersymmetry algebra that includes a fermionic central charge. We construct a superspace one-form on an enlarged superspace related by a coset construction to this centrally extended algebra whose supersymmetry and kappa symmetry transformations are derived, rather than inferred. It is shown that under pullback, these transformations are of the form expected for the D-brane U(1) gauge field. We relate these results to manifestly supersymmetric approaches to construction of D-brane actions
Extended nodal analysis
No full textThis paper presents an extension to the popular nodal and modified nodal formulation methods that allows elements whose characteristic functions include controlling variables, in addition to voltages and currents, other variables, such as charge, flux, and other physical parameters, to be included in the circuit equation formulation in a straightforward manner. Stamps, similar to nodal and modified nodal circuit element stamps, are developed to include these elements in the circuit matrix equation without the need of deriving equivalent circuit models consisting of interconnections of elements characterized only by currents and voltages, as in the current practice. The method is applied to derive circuit stamps of memristive, memcapacitive, meminductive, and other complex device models. The method reduces the size of the overall circuit matrix and allows easy model evaluation and linearization during the circuit iterative solution process. © 2011 IEEE.Biolek D, 2009, 2009 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1 AND 2, P249, DOI 10.1109-ECCTD.2009.5274934; Biolek D, 2011, ANALOG INTEGR CIRC S, V66, P129, DOI 10.1007-s10470-010-9505-5; Biolek D, 2010, ELECTRON LETT, V46, P520, DOI 10.1049-el.2010.0358; Biolek D, 2010, ELECTRON LETT, V46, P1428, DOI 10.1049-el.2010.2309; Biolek D, 2010, PROCEEDINGS OF THE 2010 IEEE ASIA PACIFIC CONFERENCE ON CIRCUIT AND SYSTEM (APCCAS), P800, DOI 10.1109-APCCAS.2010.5774993; CHUA LO, 1971, IEEE T CIRCUITS SYST, VCT18, P507, DOI 10.1109-TCT.1971.1083337; CHUA LO, 1976, P IEEE, V64, P209, DOI 10.1109-PROC.1976.10092; Desoer Charies A., 1969, BASIC CIRCUIT THEORY; Di Ventra M, 2009, P IEEE, V97, P1717, DOI 10.1109-JPROC.2009.2021077; Gear CW, 1971, NUMERICAL INITIAL VA; HACHTEL GD, 1971, IEEE T CIRCUITS SYST, VCT18, P101, DOI 10.1109-TCT.1971.1083223; HAJJ I, 1985, COMPUTATIONAL METHOD; HO CW, 1975, IEEE T CIRCUITS SYST, VCA22, P504; Joglekar YN, 2009, EUR J PHYS, V30, P661, DOI 10.1088-0143-0807-30-4-001; Kavehei O, 2010, P ROY SOC A-MATH PHY, V466, P2175, DOI 10.1098-rspa.2009.0553; Lambert J.D., 1991, NUMERICAL METHODS OR; Najm F. N., 2010, CIRCUIT SIMULATION; Pillage L., 1995, ELECT CIRCUIT SYSTEM; Rak A, 2010, IEEE T COMPUT AID D, V29, P632, DOI 10.1109-TCAD.2010.2042900; Shin S, 2010, IEEE T COMPUT AID D, V29, P590, DOI 10.1109-TCAD.2010.2042891; Strukov DB, 2008, NATURE, V453, P80, DOI 10.1038-nature06932; VLACH J, 1994, METHODS CIRCUIT ANAL0
Israelitische Festpredigten und Casualreden
No full texthrsg. von J. Maier, I. N. Mannheimer, G. SalomonAus der Sammlung des Leo Baeck Institute, digitalisiert in Kooperation mit dem Center for Jewish History, NYA note in the first "Heft" claims the writings of I.N. Mannheimer will appear in later volumes. Although I.N. Mannheimer's name appears on the title page, the table of contents does not list him as an author of any of the essays. [Notice of Center for Jewish History, NY
- …
