Methods: The study included 62 patients with peripheral vestibulopathy (unilateral n:41, bilateral n:21) and 45 healthy controls. Neurological and neurotological examinations including tonal audiometry, caloric tests and static posturography [mean center of gravity (COG) sway velocity, shift in COG alignment, tandem walk (step width, walking speed, and end sway velocity)] were performed in all ...

A Gaussian/square function computation circuit suitable for analog neural networks is proposed. It can realize Gaussian and square functions when operating in weak and strong inversion region, respectively. It is shown that the center, width, and peak amplitude of the dc transfer curve can be controlled separably. Measurement results on 3m CMOS fabricated chips confirm theoretical and simulatio...

RF breakdown is one of the major factors determining performance of high power rf components and rf sources. RF breakdown limits working power and produces irreversible surface damage. The breakdown limit depends on the rf circuit, structure geometry, and rf frequency. It is also a function of the input power, pulse width, and surface electric and magnetic fields. In this paper we discuss multi...

abstract the oak leafroller moth , tortrix viridana l. is a destructive pest within it’s spreading area which invades the oak species, especially in west and northwest forests of iran, in recent years. some parts of west azarbayjan’s forests which are located in piranshahr and sardasht region have been affected by this pest since 1989 that oak trees vigor and survival have been gone down result...

We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus.

Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tract...

Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...

PETR HLINĚNÝ1,2,*, SANG-IL OUM3,7, DETLEF SEESE4 AND GEORG GOTTLOB5,6 Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic VŠB, Technical University of Ostrava, Ostrava, Czech Republic School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA Institute AIFB, University Karlsruhe (TH), D-76128 Karlsruhe, Germany Oxford University Comput...