Functional and radiological analysis of posterior lumbar interbody fusion in spondylolisthesis

Background:Spondylolisthesis is present in 5% of the adult population with clinical evidence of low back pain. These patients are treated initially by conservative measures, failing of which surgical intervention is mandatory. Majority of patients with varying degree of slip and disability ultimately require surgical intervention. In this study we are trying to analyse the functional outcome following posterior lumbar interbody fusion in spondylolisthesis.Methods: Posterior lumbar interbody fusion using pedicle screw and rods with cage was performed on 25 patients. 6 months follow-up was completed in 25 patients who were then reviewed at regular intervals. Out of the 25 patients, 17(68%) were females and 8(32%) were males. The mean age of the patients was 40.64 years. Out of 25 patients, 14 patients had listhesis at L4 – L5 level and another 11 at L5 – S1 level. 21(84%) were Isthmic variant and 4 (16%) were Degenerative spondylolisthesis.Results:The mean follow up period in this study of 25 patients is 19 months. Out of 25 patients, there was mean improvement of 18.96 in the Oswestry scoring index. The Visual analogue scale score showed a mean improvement of 6.48. Radiologically, the percentage of slip was decreased by a mean of 8.40%. One patient had a cage extrusion with no neurological deficit.Conclusions:The pedicle screw with rod and cage system is easy to use and provides the anatomic restoration of the isthmus in isthmic spondylolisthesis or restoring the stability after laminectomy/discectomy in degenerative spondylolisthesis. From our study, we strongly believe that this technique is very useful in low grade degenerative and isthmic spondylolisthesis

Metavinculin modulates force transduction in cell adhesion sites

Vinculin is a ubiquitously expressed protein, crucial for the regulation of force transduction in cells. Muscle cells express a vinculin splice-isoform called metavinculin, which has been associated with cardiomyopathies. However, the molecular function of metavinculin has remained unclear and its role for heart muscle disorders undefined. Here, we have employed a set of piconewton-sensitive tension sensors to probe metavinculin mechanics in cells. Our experiments reveal that metavinculin bears higher molecular forces but is less frequently engaged as compared to vinculin, leading to altered force propagation in cell adhesions. In addition, we have generated knockout mice to investigate the consequences of metavinculin loss in vivo. Unexpectedly, these animals display an unaltered tissue response in a cardiac hypertrophy model. Together, the data reveal that the transduction of cell adhesion forces is modulated by expression of metavinculin, yet its role for heart muscle function seems more subtle than previously thought. Muscle cells express an adhesion molecule called metavinculin, which has been associated with cardiomyopathies. Here, the authors employed molecular tension sensors to reveal that metavinculin expression modulates cell adhesion mechanics and they develop a mouse model to demonstrate that the presence of metavinculin is not as critical for heart muscle function as previously thought

Imitation in Large Games

In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation types: that of players who imitate choice of other (optimizing) types. Game theorists typically study the evolution of such games in dynamical systems with imitation rules. In the setting of games of infinite duration on finite graphs with preference orderings on outcomes for player types, we explore the possibility of imitation as a viable strategy. In our setup, the optimising players play bounded memory strategies and the imitators play according to specifications given by automata. We present algorithmic results on the eventual survival of types

Affine modifications and affine hypersurfaces with a very transitive automorphism group

We study a kind of modification of an affine domain which produces another affine domain. First appeared in passing in the basic paper of O. Zariski (1942), it was further considered by E.D. Davis (1967). The first named author applied its geometric counterpart to construct contractible smooth affine varieties non-isomorphic to Euclidean spaces. Here we provide certain conditions which guarantee preservation of the topology under a modification. As an application, we show that the group of biregular automorphisms of the affine hypersurface $X \subset C^{k+2}$ given by the equation $uv=p(x_1,...,x_k)$ where $p \in C[x_1,...,x_k],$ acts $m-$transitively on the smooth part reg$X$ of $X$ for any $m \in N.$ We present examples of such hypersurfaces diffeomorphic to Euclidean spaces.Comment: 39 Pages, LaTeX; a revised version with minor changes and correction

Selective APRIL Blockade Delays Systemic Lupus Erythematosus in Mouse

SLE pathogenesis is complex, but it is now widely accepted that autoantibodies play a key role in the process by forming excessive immune complexes; their deposits within tissues leading to inflammation and functional damages. A proliferation inducing ligand (APRIL) is a member of the tumor necrosis factor (TNF) superfamily mediating antibody-producing plasma cell (PC)-survival that may be involved in the duration of pathogenic autoantibodies in lupus. We found significant increases of APRIL at the mRNA and protein levels in bone marrow but not spleen cells from NZB/W lupus mice, as compared to control mice. Selective antibody-mediated APRIL blockade delays disease development in this model by preventing proteinuria, kidney lesions, and mortality. Notably, this was achieved by decreasing anti-DNA and anti-chromatin autoantibody levels, without any perturbation of B- and T- cell homeostasis. Thus, anti-APRIL treatment may constitute an alternative therapy in SLE highly specific to PCs compared to other B-cell targeting therapies tested in this disease, and likely to be associated with less adverse effects than any anti-inflammatory and immunosuppressant agents previously used

Probabilistic Algorithmic Knowledge

The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for randomized knowledge algorithms. We then characterize the information provided by a randomized knowledge algorithm when its answers have some probability of being incorrect. We formalize this information in terms of evidence; a randomized knowledge algorithm returning ``Yes'' to a query about a fact \phi provides evidence for \phi being true. Finally, we discuss the extent to which this evidence can be used as a basis for decisions.Comment: 26 pages. A preliminary version appeared in Proc. 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'03

Propositional Dynamic Logic for Message-Passing Systems

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problem for CFMs and HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with intersection, the semantics of a formula cannot be captured by a CFM anymore

Analytic curves in algebraic varieties over number fields

We establish algebraicity criteria for formal germs of curves in algebraic varieties over number fields and apply them to derive a rationality criterion for formal germs of functions, which extends the classical rationality theorems of Borel-Dwork and P\'olya-Bertrandias valid over the projective line to arbitrary algebraic curves over a number field. The formulation and the proof of these criteria involve some basic notions in Arakelov geometry, combined with complex and rigid analytic geometry (notably, potential theory over complex and $p$-adic curves). We also discuss geometric analogues, pertaining to the algebraic geometry of projective surfaces, of these arithmetic criteria.Comment: 55 pages. To appear in "Algebra, Arithmetic, and Geometry: In Honor of Y.i. Manin", Y. Tschinkel & Yu. Manin editors, Birkh\"auser, 200

Solving the Parquet Equations for the Hubbard Model beyond Weak Coupling

We find that imposing the crossing symmetry in the iteration process considerably extends the range of convergence for solutions of the parquet equations for the Hubbard model. When the crossing symmetry is not imposed, the convergence of both simple iteration and more complicated continuous loading (homotopy) methods are limited to high temperatures and weak interactions. We modify the algorithm to impose the crossing symmetry without increasing the computational complexity. We also imposed time reversal and a subset of the point group symmetries, but they did not further improve the convergence. We elaborate the details of the latency hiding scheme which can significantly improve the performance in the computational implementation. With these modifications, stable solutions for the parquet equations can be obtained by iteration more quickly even for values of the interaction that are a significant fraction of the bandwidth and for temperatures that are much smaller than the bandwidth. This may represent a crucial step towards the solution of two-particle field theories for correlated electron models.Comment: 15 pages, 12 figure

Burden of typhoid and paratyphoid fever in India.

BACKGROUND: In 2017, more than half the cases of typhoid fever worldwide were projected to have occurred in India. In the absence of contemporary population-based data, it is unclear whether declining trends of hospitalization for typhoid in India reflect increased antibiotic treatment or a true reduction in infection. METHODS: From 2017 through 2020, we conducted weekly surveillance for acute febrile illness and measured the incidence of typhoid fever (as confirmed on blood culture) in a prospective cohort of children between the ages of 6 months and 14 years at three urban sites and one rural site in India. At an additional urban site and five rural sites, we combined blood-culture testing of hospitalized patients who had a fever with survey data regarding health care use to estimate incidence in the community. RESULTS: A total of 24,062 children who were enrolled in four cohorts contributed 46,959 child-years of observation. Among these children, 299 culture-confirmed typhoid cases were recorded, with an incidence per 100,000 child-years of 576 to 1173 cases in urban sites and 35 in rural Pune. The estimated incidence of typhoid fever from hospital surveillance ranged from 12 to 1622 cases per 100,000 child-years among children between the ages of 6 months and 14 years and from 108 to 970 cases per 100,000 person-years among those who were 15 years of age or older. Salmonella enterica serovar Paratyphi was isolated from 33 children, for an overall incidence of 68 cases per 100,000 child-years after adjustment for age. CONCLUSIONS: The incidence of typhoid fever in urban India remains high, with generally lower estimates of incidence in most rural areas. (Funded by the Bill and Melinda Gates Foundation; NSSEFI Clinical Trials Registry of India number, CTRI/2017/09/009719; ISRCTN registry number, ISRCTN72938224.)