Filters








45,840 Hits in 4.9 sec

Efficient linear systolic array for the knapsack problem [chapter]

Rumen Andonov, Patrice Quinton
1992 Lecture Notes in Computer Science  
The algorithm is implemented on a linear systolic array where the number of the cells q, the cell memory storage cr and the input/output requirements are design parameters.  ...  A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack problem is presented in this paper.  ...  Our work is related to the design of systolic arrays for dynamic programming problems.  ... 
doi:10.1007/3-540-55895-0_419 fatcat:aq4sqkbi5vh7noca7h6frgls64

Clinical complexity and the effectiveness of an intervention for depressed diabetes patients

John D Piette, Marcia Valenstein, Joseph Himle, Sonia Duffy, Trissa Torres, Mark Vogel, Caroline Richardson
2011 Chronic Illness  
Effects on Beck Depression Inventory (BDI) scores were greater in the low-complexity group (-8.8) than in the medium-(-3.2) or high-complexity groups (-2.7).  ...  Physical activity effects also were greatest in the low-complexity group (increase of 1,498 steps/ day).  ...  Acknowledgments This NIH-funded trial (1R18DK066166-01A1) is registered with ClinicalTrials.gov and the registration number is NCT01106885.  ... 
doi:10.1177/1742395311409259 pmid:21840915 pmcid:PMC3983967 fatcat:lq2l34idajdjvepzxvxjb5e2jq

Cardiorehabilitation of Patients with Acute Coronary Syndrome Who Were Performed Coronary Arteries Revascularization

Mykola Shved, Lesja Tsuglevych, Iryna Kyrychok, Tetiana Boiko, Larysa Levutska
2017 Galician medical journal  
The aim of our work was to optimize the cardiac rehabilitation of such patients by individualization of physical activity depending on the state of systolic and diastolic left ventricular dysfunction and  ...  During the first month of training, the original accelerated cardiac rehabilitation program leads to the decrease of systolic and diastolic signs of cardiac dysfunction and improves heart rate variability  ...  Today, evidence database on the effectiveness of cardiac rehabilitation is quite big and shows that the complex cardiac rehabilitation programs significantly reduce the mortality, risk of development and  ... 
doi:10.21802/gmj.2017.4.9 fatcat:ats5bp4rqrfijn2fdu3tf3xrvq

Parallel algorithms and architectures [chapter]

W. F. McColl
1989 Lecture Notes in Computer Science  
We also describe some systolic algorithms for matrix computations, sequence comparison and molecular modelling, and briefly discuss their implementation on arrays of transputers.  ...  in this paper we consider some of the central issues involved in the design of parallel algorithms.  ...  The systolic matrix multiplication Mgorithm is based on the following simple program.  ... 
doi:10.1007/3-540-51604-2_1 fatcat:czq7v7qxfnc25nqnonfelem2si

Slipstream Transcomputation of the Fast Fourier Transform

Stephen Leach, James A. D. W. Anderson
2019 Transmathematica  
In this paper, we report on the simulation of a slip-streamed implementation of the fast Fourier transformation, its properties and compilation challenges.  ...  The algorithm is extended to include dynamically computing a match against a fixed profile of weights.  ...  He implemented a molecular dynamics program with the property that many hundreds of instantiations of the program can be executed in a simulation of one of our boards.  ... 
doi:10.36285/tm.29 fatcat:n7dbpcr5averpm6o5xminenmiu

Page 8126 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
If n <n’ < P(n), for some polynomial P, the average complexity of L(x) L(9') is bounded by a constant (depending on P).  ...  The class of systolic tree w-languages is characterized in terms of a (suitable) concatenation of (finitary) systolic tree languages.  ... 

Page 2404 of Mathematical Reviews Vol. , Issue 90D [page]

1990 Mathematical Reviews  
(H-EOTVO-C) On the d-complexity of words.  ...  The d-complexity K,(w) of a word w is defined as the number of its d-subwords. The author gives several bounds on the d-complexity of words.  ... 

Page 1171 of Mathematical Reviews Vol. , Issue 84c [page]

1984 Mathematical Reviews  
We note that by an unpublished result of Z. Esik the kernel languages of arbitrary URM programs are context-sensitive. P. Démési (Debrecen) Ehrenfeucht, A. [Ehrenfeucht, Andrzej); Rozenberg, G.  ...  {For the entire collection see MR 83h:03004. } Dérnyei, Agnes 84c:68064 On the structure of kernel languages of simple counting-loop programs. (Hungarian. English summary) Alkalmaz. Mat.  ... 

Assessment of LV Systolic Dyssynchrony in Heart Failure Beyond a Snapshot⁎⁎Editorials published in JACC: Cardiovascular Imaging reflect the views of the authors and do not necessarily represent the views of JACC: Cardiovascular Imaging or the American College of Cardiology

Cheuk-Man Yu, Qing Zhang
2011 JACC Cardiovascular Imaging  
Of note, the previously published RETHINQ (Resynchronization Therapy in Narrow QRS) study did not support the role of CRT in systolic heart failure patients with a narrow complex and coexisting LV systolic  ...  One potential concern in the interpretation of the study is related to the use of 2 different software programs for offline analysis of the 2-dimensional (2D) speckle tracking images from multiple vendors  ... 
doi:10.1016/j.jcmg.2011.04.001 pmid:21565731 fatcat:yt4u425herfyrmofcutwge6jtu

Cardiac resynchronisation improves survival in mild heart failure!

E. E. van der Wall
2011 Netherlands Heart Journal  
The mean nonpaced QRS complex was 158 ms, and the mean paced QRS complex was 208 ms. A left bundle branch block (LBBB) pattern was noted in 72% of the patients.  ...  This corresponded to a number needed to treat of 14 patients for 5 years to prevent one  ...  The mean nonpaced QRS complex was 158 ms, and the mean paced QRS complex was 208 ms. A left bundle branch block (LBBB) pattern was noted in 72% of the patients.  ... 
doi:10.1007/s12471-011-0080-x pmid:21475402 pmcid:PMC3047693 fatcat:cvepocpnajfcxfv3cpno6n73w4

Page 2841 of Mathematical Reviews Vol. , Issue 89E [page]

1989 Mathematical Reviews  
the complexity of the limit lan- guages of these CAs accords with the classification.  ...  The results are generalized for a large class of problems which can be formulated as “nonserial dynamic programming” problems on trees.  ... 

Hyper-systolic parallel computing

T. Lippert, A. Seyfried, A. Bode, K. Schilling
1998 IEEE Transactions on Parallel and Distributed Systems  
Choosing the base of the h-range problem suitably, one can recover the classical systolic realization of the computational problem.  ...  The case p < n is discussed in section 4.7. 2 1, . . . , n. • The parallel organization of the evaluation in form of a systolic array computation [1, 9, 10, 11] proceeds with one moving and one fixed array  ...  Part of our numerical results has been achieved on the 1024-node connection machine CM5 of the Advanced Computing Laboaratory at Los Alamos National Laboratory, USA.  ... 
doi:10.1109/71.663861 fatcat:jshlqyog4barzmipc2lcpkwoau

The SDEF programming system

Bradley R. Engstrom, Peter R. Cappello
1989 Journal of Parallel and Distributed Computing  
The programming system treats a special class of systolic computations, called atomic systolic computations, any one of which can be specified as a set of properties: the computation's ( 1) index set (  ...  The design issues associated with such a programming system are identified. A spacetime representation of systolic computations is described briefly in order to motivate SDEF's program notation.  ...  The complexity of parallel programming increases the importance of some of these issues, such as program reusability.  ... 
doi:10.1016/0743-7315(89)90018-x fatcat:ap542ogpb5cipngui4bq5oboey

Page 1598 of Mathematical Reviews Vol. , Issue 92c [page]

1992 Mathematical Reviews  
If one wishes for a new lifeform’s program to be the same size as each of its parent programs, then one might take half of each parent program and patch the two halves together.  ...  Kai Salomaa (SF-TURK) 92c:68140 68Q80 68N05 68Q10 Rucker, Rudy (1-SJS) Symbiotic programming: crossbreeding cellular automaton rules on the CAM-6. Complex Systems 3 (1989), no. 1, 79-90.  ... 

Page 986 of Mathematical Reviews Vol. , Issue 87b [page]

1987 Mathematical Reviews  
Together with systolic tree automata, trellis automata now constitute the most widely studied class of systolic automata. “We describe a variety of programming techniques for trellis automata.  ...  “In the second part we discuss mainly various programming techniques for systolic automata.  ... 
« Previous Showing results 1 — 15 out of 45,840 results