Universality of Sea Wave Growth and Its Physical Roots

Modern day studies of wind-driven sea waves are usually focused on wind forcing rather than on the effect of resonant nonlinear wave interactions. The authors assume that these effects are dominating and propose a simple relationship between instant wave steepness and time or fetch of wave development expressed in wave periods or lengths. This law does not contain wind speed explicitly and relies upon this asymptotic theory. The validity of this law is illustrated by results of numerical simulations, in situ measurements of growing wind seas and wind wave tank experiments. The impact of the new vision of sea wave physics is discussed in the context of conventional approaches to wave modeling and forecasting.Comment: submitted to Journal of Fluid Mechanics 24-Sep-2014, 34 pages, 10 figure

Boundary values as Hamiltonian variables. I. New Poisson brackets

The ordinary Poisson brackets in field theory do not fulfil the Jacobi identity if boundary values are not reasonably fixed by special boundary conditions. We show that these brackets can be modified by adding some surface terms to lift this restriction. The new brackets generalize a canonical bracket considered by Lewis, Marsden, Montgomery and Ratiu for the free boundary problem in hydrodynamics. Our definition of Poisson brackets permits to treat boundary values of a field on equal footing with its internal values and directly estimate the brackets between both surface and volume integrals. This construction is applied to any local form of Poisson brackets. A prescription for delta-function on closed domains and a definition of the {\it full} variational derivative are proposed.Comment: 26 pages, LaTex, IHEP 93-4

Эффективные алгоритмы проверки эквивалентности для некоторых классов автоматов

Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode. The computations of these three types of automata show many common features, and it is surprising that the methods for analyzing the behavior of automata developed for one of these models do not find suitable utilization in other models. The goal of this paper is to develop a uniform technique for building polynomial-time equivalence checking algorithms for some classes of automata (finite transducers, two-tape automata, biautomata, single-state pushdown automata) which exhibit certain features of the deterministic or unambiguous behavior. This new technique reduces the equivalence checking of automata to solvability checking of certain systems of equations over the semirings of languages or transductions. It turns out that such a checking can be performed by the variable elimination technique which relies on some combinatorial and algebraic properties of prefix-free regular languages. The main results obtained in this paper are as follows:1.            Using the algebraic approach a new algorithm for checking the equivalence of states of deterministic finite automata is constructed; time complexity of this algorithm is O(n log n).2.            A new class of prefix-free finite transducers is distinguished and it is shown that the developed algebraic approach provides the equivalence checking of transducers from this class in quadratic time (for real-time prefix-free transducers) and cubic (for prefix-free transducers with ɛ-transitions) relative to the sizes of analysed machines.3.            It is shown that the equivalence problem for deterministic two-tape finite automata can be reduced to the same problem for prefix-free finite transducers and solved in cubic time relative to the size of the analysed machines.4.            In the same way it is proved that the equivalence problem for deterministic finite biautomata can be solved in cubic time relative to the sizes of analysed machines.5.            By means of the developed approach an efficient equivalence checking algorithm for the class of simple grammars corresponding to deterministic single-state pushdown automata is constructed.Конечные преобразователи, двухленточные автоматы и биавтоматы — взаимосвязанные вычислительные модели, ведущие свое происхождение от концепции конечного автомата. В вычислениях этих машин проявляется много общих черт, и удивительно, что методы анализа, разработанные для одной из указанных моделей, не находят подходящего применения в других моделях. Целью данной статьи является разработка единой методики построения быстрых алгоритмов проверки эквивалентности для некоторых классов автоматов (конечных преобразователей, двухленточных автоматов, биавтоматов, магазинных автоматов), которые демонстрируют определенные черты детерминированного или однозначное поведение. Этот новый метод сводит проверку эквивалентности автоматов к проверке разрешимости систем уравнений над полукольцами языков или бинарных отношений. Как оказалось, такую проверку достаточно просто провести методом исключения переменных, используя некоторые комбинаторные и алгебраические свойства регулярных префиксных языков. Основные результаты, полученные в этой статье, таковы.1.            При помощи алгебраического метода построен новый алгоритм проверки эквивалентности детерминированных конечных автоматов, имеющий сложность по времени O(n log n).2.            Выделен новый класс префиксных конечных трансдьюсеров и показано, что проверка эквивалентности трансдьюсеров из этого класса может быть осуществлена новым методом за время, квадратичное (для префиксных трансдьюсеров реального времени) и кубическое (для префиксных трансдьюсеров с ɛ-переходами) относительно размеров анализируемых автоматов.3.            Показано, что проблема эквивалентности для детерминированных двухленточных конечных автоматов сводится к задаче проверки эквивалентности префиксных конечных трансдьюсеров и может быть решена за время, кубическое относительно их размеров.4.            Аналогичным образом установлена разрешимость проблемы эквивалентности для детерминированных конечных биавтоматов за время, кубическое относительно их размеров.5.            При помощи нового метода построен алгоритм проверки эквивалентности для простых грамматик, соответствующих детерминированным магазинным автоматам с одним состоянием

Cognitive impairments in patients with brain injury

The paper gives the data of Russian and foreign authors and the results of this paper authors’ investigation of higher cerebral functions in patients who have sustained brain injury (BI). It shows their high prevalence, the predominance of cognitive impairments (CI) over neurological disorders in patients with mild and moderate injury, presents their quantitative and qualitative features (a preponderance of focal symptoms in severe injury and neurodynamic disorders in mild injury), describes the predictors of their course and prognosis (the degree of injury is one of the most important predictors), and discusses current trends in the medical correction of detected abnormalities

Label-free shotgun proteomics and metabolite analysis reveal a significant metabolic shift during citrus fruit development.

Label-free LC-MS/MS-based shot-gun proteomics was used to quantify the differential protein synthesis and metabolite profiling in order to assess metabolic changes during the development of citrus fruits. Our results suggested the occurrence of a metabolic change during citrus fruit maturation, where the organic acid and amino acid accumulation seen during the early stages of development shifted into sugar synthesis during the later stage of citrus fruit development. The expression of invertases remained unchanged, while an invertase inhibitor was up-regulated towards maturation. The increased expression of sucrose-phosphate synthase and sucrose-6-phosphate phosphatase and the rapid sugar accumulation suggest that sucrose is also being synthesized in citrus juice sac cells during the later stage of fruit development

Selective ethylene trimerization by titanium complexes bearing phenoxy-imine ligands: NMR and EPR Spectroscopic studies of the reaction intermediates

The catalyst systems (FI)TiCl₃/MAO (FI = phenoxyimine ligand with an additional aryl–O–CH₃ donor) display exceptionally high activity in selective ethylene trimerization. By means of NMR and EPR spectroscopy, the nature of the Ti species formed in the catalyst systems (FI)TiCl₃/MAO, (FI)TiCl₃/MMAO, and (FI)TiCl₃/AlR₃/[Ph₃C]⁺[B(C₆F₅)₄]⁻ (R = Me, Et, ⁱBu) has been studied. It was shown that outer-sphere ion pairs of the type [(FI)TiIVMe₂]⁺[A]⁻ ([A]− = [MeMAO]⁻, [MeMMAO]⁻, [B(C₆F₅)₄]⁻) are formed at the initial stage of the reaction of (FI)TiCl₃ with MAO, MMAO, and AlMe₃/[Ph₃C]⁺[B(C₆F₅)₄]⁻. These ion pairs further partially convert into TiIII and TiII species. In the systems (FI)TiCl₃/MAO and (FI)TiCl₃/AlMe₃/[Ph₃C]⁺[B(C₆F5)₄]⁻, complexes with the proposed structures (FI)TiIIIMe₂, (FI)TiIICl, and [(FI)TiII(S)]⁺[A]⁻ ([A]− = [MeMAO]⁻, [B(C₆F₅)4)]⁻, S = solvent, vacancy) were observed (concentrations of TiIII species was lower than those of the TiII congeners). In contrast, in the system (FI)TiCl₃/MMAO, the concentrations of TiIII species (ion pairs of the type [(FI)TiIII(μ-H)(μ-Cl)AlⁱBu₂]⁺[MeMMAO]⁻) were higher than those of the TiII counterparts (ion pairs [(FI)TiII(S)]⁺[MeMMAO]⁻). The system (FI)TiCl₃/MMAO displays lower activity and selectivity in 1-hexene formation, in comparison to (FI)TiCl₃/MAO, due to undesirable PE generation. Probably, TiII and TiIV ion pairs are those participating in ethylene trimerization