نتایج جستجو برای: left exact preradical

تعداد نتایج: 411313  

Journal: :iranian journal of science and technology (sciences) 2005
f. ayatollah zadeh shirazi

this text carries out some ideas about exact and p− exact sequences of transformationsemigroups. some theorems like the short five lemma (lemma 1.3 and lemma 2.3) are valid here as inexact sequences of r − modules.

Journal: :journal of research in medical sciences 0
hasan shemirani hypertension research center, isfahan cardiovascular research institute, isfahan university of medical sciences, isfahan, iran rohola hemmati school of medicine, ilam university of medical sciences, ilam, iran alireza khosravi isfahan cardiovascular research center, cardiovascular research institute, isfahan university of medical sciences, isfahan, iran mojgan gharipour cardiac rehabilitation research center, cardiovascular research institute, isfahan cardiovascular research institute, isfahan university of medical sciences, isfahan, iran mahnaz jozan hypertension research center, isfahan cardiovascular research institute, isfahan university of medical sciences, isfahan, iran

background: early diagnosis of left ventricular mass (lvm) inappropriateness and left ventricular hypertrophy   (lvh) can result in preventing diastolic left ventricular dysfunction and its related morbidity and mortality. this study was performed to determine if diastolic dysfunction   is associated with lvh and inappropriate lvm. methods: one hundred   and twenty five uncomplicated hypertensi...

Journal: :Science China-mathematics 2021

Let T be a right exact functor from an abelian category ℬ into another $${\mathscr A}$$ . Then there exists p the product A} \times {\mathscr B}$$ to comma ( $$\left( {T \downarrow A}} \right)$$ ). In this paper, we study property of extension closure some classes objects in ), exactness and detailed description orthogonal given class $${\rm{P}}\left( {{\cal X},{\cal Y}} Moreover, characterize ...

Journal: :Soft Computing 2021

A labeling of edges and vertices a simple graph \(G(V,E)\) by mapping \(\Lambda :V\left( G \right) \cup E\left( \to \left\{ { 1,2,3, \ldots ,\Psi } \right\}\) provided that any two pair have distinct weights is called an edge irregular total \(\Psi\)-labeling. If \(\Psi\) minimum \(G\) admits -labelling, then the irregularity strength (TEIS) denoted \(\mathrm{tes}\left(G\right).\) In this paper...

Journal: :Physics Letters B 2023

Klein-Gordon (KG) particles in cosmic string rainbow gravity spacetime and a uniform magnetic field are studied the context of so called, metaphorically speaking, position-dependent mass (PDM) settings. We show that corresponding KG-equation collapses into two-dimensional radial Schr\"{o}dinger-Coulomb like model. The exact textbook solution which is used to find energies wave functions KG-Coul...

2007
Purushottam W. Laud Stephen G. Walker Paul Damien

SUMMARY Nonparametric Bayesian inference using bathtub hazard rates in survival analysis is developed. A new simulation method, Auxiliary Random Functions, is introduced. When used within a Gibbs sampler, this method enables a uniied treatment of exact, right-censored, left-censored, left-trucated and interval censored data, with and without covariates. The models and methods are exempliied via...

2015
Akira Fujiki Ryozo Yoshioka Masao Sakabe Eriko Kikuchi

Introduction Most cases of verapamil-sensitive idiopathic left ventricular tachycardia (ILVT) with right bundle branch block and superior axis pattern have been reported as a reentrant circuit with slow conduction to the left posterior fascicle through the septal Purkinje fiber. However, the exact anatomic structure of the reentrant circuit, particularly upper turnaround, has not been fully elu...

Journal: :Theor. Comput. Sci. 2009
Fedor V. Fomin Daniel Lokshtanov Saket Saurabh

Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.

1999
Rolf Drechsler Wolfgang Günther

Realization of efficient Universal Logic Modules (ULMs) is a challenging topic in circuit design. The goal is to find a representation that allows to realize as many Boolean functions as possible by permutation of inputs or phase assignment. In this paper an exact algorithm for finding a minimal circuit for a ULM is presented. The approach is parametrisized in several ways, e.g. the user can de...

Journal: :Networks 2014
Claudia Archetti Nicola Bianchessi Maria Grazia Speranza Alain Hertz

In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید