Relevant bibliographies by topics / PRAM

Academic literature on the topic 'PRAM'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'PRAM.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "PRAM"

1

Kasai, Daisuke, Toshihiro Fujinami, Tomokuni Abe, Kohei Mase, Yoshihiro Katayama, Masao Fukuda, and Eiji Masai. "Uncovering the Protocatechuate 2,3-Cleavage Pathway Genes." Journal of Bacteriology 191, no. 21 (August 28, 2009): 6758–68. http://dx.doi.org/10.1128/jb.00840-09.

Full text
Abstract:
ABSTRACT Paenibacillus sp. (formerly Bacillus macerans) strain JJ-1b is able to grow on 4-hydroxybenzoate (4HB) as a sole source of carbon and energy and is known to degrade 4HB via the protocatechuate (PCA) 2,3-cleavage pathway. However, none of the genes involved in this pathway have been identified. In this study, we identified and characterized the JJ-1b genes for the 4HB catabolic pathway via the PCA 2,3-cleavage pathway, which consisted of praR and praABEGFDCHI. Based on the enzyme activities of cell extracts of Escherichia coli carrying praI, praA, praH, praB, praC, and praD, these genes were found to code for 4HB 3-hydroxylase, PCA 2,3-dioxygenase, 5-carboxy-2-hydroxymuconate-6-semialdehyde decarboxylase, 2-hydroxymuconate-6-semialdehyde dehydrogenase, 4-oxalocrotonate (OCA) tautomerase, and OCA decarboxylase, respectively, which are involved in the conversion of 4HB into 2-hydroxypenta-2,4-dienoate (HPD). The praE, praF, and praG gene products exhibited 45 to 61% amino acid sequence identity to the corresponding enzymes responsible for the catabolism of HPD to pyruvate and acetyl coenzyme A. The deduced amino acid sequence of praR showed similarity with those of IclR-type transcriptional regulators. Reverse transcription-PCR analysis revealed that praABEGFDCHI constitute an operon, and these genes were expressed during the growth of JJ-1b on 4HB and PCA. praR-praABEGFDCHI conferred the ability to grow on 4HB to E. coli, suggesting that praEGF were functional for the conversion of HPD to pyruvate and acetyl coenzyme A. A promoter analysis suggested that praR encodes a repressor of the pra operon.
APA, Harvard, Vancouver, ISO, and other styles
2

Mansouri, Fatima Z., Cleveland A. Gibbon, and Colin A. Higgins. "PRAM." ACM SIGCSE Bulletin 30, no. 3 (September 1998): 166–70. http://dx.doi.org/10.1145/290320.283108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

TRAHAN, JERRY L., and SUNDARARAJAN VEDANTHAM. "ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE." International Journal of Foundations of Computer Science 05, no. 03n04 (December 1994): 231–46. http://dx.doi.org/10.1142/s0129054194000128.

Full text
Abstract:
The log cost measure has been viewed as a more reasonable method of measuring the time complexity of an algorithm than the unit cost measure. The more widely used unit cost measure becomes unrealistic if the algorithm handles extremely large integers. Parallel machines have not been examined under the log cost measure. In this paper, we investigate the Parallel Random Access Machine under the log cost measure. Let the instruction set of a basic PRAM include addition, subtraction, and Boolean operations. We relate resource-bounded complexity classes of log cost PRAMs to complexity classes of Turing machines and circuits. We also relate log cost PRAMs with different instruction sets by simulations that are much more efficient than possible in the unit cost case. Let LCRCWk(CRCWk) denote the class of languages accepted by a log cost (unit cost) basic CRCW PRAM in O( log k n) time with the polynomial in n number of processors. We position the log cost PRAM in the hierarchy of parallel complexity classes as: ACk=CRCWk⊆(NCk+1, LCRCWk+1)⊆ACk+1=CRCWk+1.
APA, Harvard, Vancouver, ISO, and other styles
4

Rorgemoen, Kjersti. "Stakkars pram." Samtiden 119, no. 01 (March 28, 2010): 60–67. http://dx.doi.org/10.18261/issn1890-0690-2010-01-06.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Czech, Zbigniew J., and Wojciech Mikanik. "Randomized PRAM Simulation." Fundamenta Informaticae 36, no. 4 (1998): 317–36. http://dx.doi.org/10.3233/fi-1998-3642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bahig, Hazem M., and Hatem M. Bahig. "Merging on Pram." International Journal of Computers and Applications 30, no. 1 (January 2008): 51–55. http://dx.doi.org/10.1080/1206212x.2008.11441877.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Apolloni, Bruno, Diego de Falco, and John G. Taylor. "pRAM layout optimisation." Neural Networks 10, no. 9 (December 1997): 1709–16. http://dx.doi.org/10.1016/s0893-6080(97)00030-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

GEORGIOU, CHRYSSIS, ALEXANDER RUSSELL, and ALEXANDER A. SHVARTSMAN. "FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY." Parallel Processing Letters 17, no. 02 (June 2007): 153–68. http://dx.doi.org/10.1142/s0129626407002946.

Full text
Abstract:
The abstract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iteratively to construct efficient simulations of PRAM algorithms on failure-prone PRAMS. Such use of Write-All in simulations is abstracted in terms of the iterative Write-All problem. The efficiency of the algorithmic solutions for Write-All and iterative Write-All is measured in terms of work complexity where all processing steps taken by the processors are counted. This paper considers determinitic solutions for the Write-All and iterative Write-All problems in the fail-stop synchronous CRCW PRAM model where memory access concurrency needs to be controlled. A deterministic algorithm of Kanellakis, Michailidis, and Shvartsman [16] efficiently solves the Write-All problem in this model, while controlling read and write memory access concurrency. However it was not shown how the number of processor failures f affects the work efficiency of the algorithm. The results herein give a new analysis of the algorithm [16] that obtain failure-sensitive work bounds, while retaining the known memory access concurrency bounds. Specifically, the new result expresses the work bound as a function of N, Pandf. Another contribution in this paper is the new failure-sensitive analysis for iterative Write-All with controlled memory access concurrency. This result yields tighter bounds on work (vs. [16]) for simulations of PRAM algorithms on fail-stop PRAMS.
APA, Harvard, Vancouver, ISO, and other styles
9

TRAHAN, JERRY L., and HOSANGADI BHANUKUMAR. "PARALLEL RANDOM ACCESS MACHINES WITHOUT BOOLEAN OPERATIONS." Parallel Processing Letters 04, no. 01n02 (June 1994): 117–24. http://dx.doi.org/10.1142/s0129626494000132.

Full text
Abstract:
The class of problems solved within given time and processor bounds on a Parallel Random Access Machine (PRAM) varies with the instruction set. Previous research has classified the contributions of various instructions, such as multiplication, shifts, and string manipulation operations, to the PRAM. This paper examines the significant contribution of Boolean operations, which play essential roles in many PRAM algorithms and in simulations by the PRAM of other models of computation.
APA, Harvard, Vancouver, ISO, and other styles
10

Wibowo, Philipus Nugroho Hari. "NOVEL GADIS PANTAI KARYA PRAMOEDYA ANANTA TOER SEBAGAI DASAR PENCIPTAAN SKENARIO." REKAM: Jurnal Fotografi, Televisi, dan Animasi 11, no. 1 (March 16, 2016): 53. http://dx.doi.org/10.24821/rekam.v11i1.1291.

Full text
Abstract:
Penciptaan ini mengadaptasi novel Gadis Pantai karya Pramoedya Ananta Toer (Pram) menjadi skenario. Kepiawaian Pram dalam menulis novel tidak diragukan lagi. Banyak karya Pram yang menjadi best seller, dari tangannya lahir karya-karya yang hebat, berbagai penghargaan pernah ia dapatkan, hingga nominasi nobel. Karya Pram sampai saat ini belum ada yang berhasil difilmkan, mungkin masa lalu Pram yang dekat dengan Lekra yang membuat seperti ini. Ide menjadi hal yang paling penting dalam sebuah skenario (film), Ide mengadaptasi novel menjadi pilihan yang jitu. Mengingat banyak film yang memenangkan penghargaan merupakan film adaptasi dari novel-novel best seler.Gadis Pantai Pramoedya Ananta Toer’s Novel as a Basic Scenario Creation. The creation is adapting the novel Gadis Pantai by Pramoedya Ananta Toer into a scenario. There is no doubt about Pram expertise in writing novels, many works of Pram considered as best seller, many great works were born from his hands, he has received the various awards, moreover, he was nominated as a nobel nominee. To this moment, there is no such works of Pram which is successfully filmed,it is probably because in his past time, Pram has been considered as a person who is “near” to LEKRA. An idea becomes the most important thing in making a screenplay (movie), The idea of adapting the novel becomes a workable option. As there have been many films that are also adaptated from the best seller novels.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "PRAM"

1

Ravindran, Somasundaram. "Aspects of practical implementations of PRAM algorithms." Thesis, University of Warwick, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386838.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

López, Martínez Andrés. "Parallel Minimum Cuts : An improved CREW PRAM algorithm." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287962.

Full text
Abstract:
This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. It has near-linear work O(m log2 n + n log6 n) and low depth O(log3 n), and returns the correct result with high probability. This is the first improvement to the best previous O(m log4 n) work and O(log3 n) depth CREW PRAM min-cut algorithm by Geissmann and Gianinazzi [SPAA’18]. For his randomized near-linear min-cut algorithm, Karger used a connection between minimum cuts and maximum packings of spanning trees to reduce the min-cut problem into two subproblems: (i) compute an approximate maximum tree packing S, and (ii) find the minimum cut of the graph G that cuts at most two edges from some tree in S—this is referred to as the 2-respecting min-cut problem. To achieve our main result, we give parallel algorithms for both subproblems. More precisely, we present the following.  An O(m log n + n log5 n) work and O(log2 n) depth CREW PRAM algorithm for the 2-respecting min-cut problem. This is obtained from parallelizing a recent sequential algorithm by Mukhopadhay and Nanongkai [STOC’20] that improves on Karger’s original result.  An O(m log2 n + n log4 n) work and O(log3 n) depth EREW PRAM algorithm to find an approximate maximum tree packing. This improves in a log n factor the work of the previously best known bound claimed by Karger [STOC’96] and used by Geissmann and Gianinazzi [SPAA’18].  In addition, we develop the following independent results:  A parallel implementation of the range tree data structure in two dimensions: given a set of n weighted points in the plane, it can be constructed using O(n log n) work and O(log2 n) depth on an EREW PRAM. In the CREW PRAM model, it supports the range counting, range reporting, and range sum queries work-optimally with O(log n) depth.  An O(log2 n+t log n)-time sequential algorithm to answer a 2-dimensional weighted range sampling query in a range tree on n weighted points. The query is defined as follows: given an integer t, sample t points independently from a query range, where each point is selected with probability proportional to its weight. In the CREW PRAM model, we show how to support this query work-optimally with O(log n) depth.
Denna avhandling behandlar minsta-snittproblemet i oriktade, viktade grafer. För att hitta det minsta snittet i en graf G med n noder och m kanter presenterar vi en enkel slumpbaserad CREW PRAM algoritm som är baserad på Kargers berömda, slumpbaserade, minsta-snittalgoritm med nära-linjär körtid [STOC’96]. Vår algoritm kräver nära-linjärt arbete O(m log2 n + n log6 n) och lågt djup O(log3 n), och är korrekt med hög sannolikhet. Detta är den första förbättringen till den tidigare bästa CREW PRAM minsta-snittalgoritmen av Geissmann och Gianinazzi [SPAA’18] som kräver O(m log4 n) arbete och har O(log3 n) djup. I sin slumpbaserade och nära-linjära minsta-snittalgoritm använder sig Karger av ett samband mellan minsta snitt och maximala packningar av uppspännande träd vilket förminskar problemet till två delproblem: (i) beräkna en approximativ maximal packning av uppspännande träd S, och (ii) hitta minsta snittet av grafen G som har som mest två kanter i något träd i S—känt som det 2- respekterande minsta-snittproblemet. För att åstadkomma vårt huvudresultat ger vi parallella algoritmer för båda delproblemen. Mer specifikt så presenterar vi följande. En CREW PRAM algoritm för det 2-respekterande minsta-snittproblemet som kräver O (m log n+n log5 n) arbete och vars djup är O(log2 n). Vi erhåller detta från att parallellisera en ny sekventiell algoritm av Mukhopadhay och Nanongkai [STOC’20] vilken i sig förbättrar Kargers ursprungliga resultat. En EREW PRAM algoritm för att beräkna en approximtiv maximal packning av uppspännande träd som kräver O (m log2 n + n log4 n) arbete och vars djup är O (log3 n). Detta förbättrar den tidigare bästa gränsen för minsta arbete med en faktor log n, hävdad av Karger [STOC 96], och som används av Geissmann och Gianinazzi [SPAA 18]. Utöver detta utvecklar vi följande självständiga resultat: En parallell implementation av ett värdemängdsträd i två dimensioner: givet en mängd av n viktade punkter i planet så kan den konstrueras genom O(n log n) arbete och med O(log2 n) djup genom en EREW PRAM algoritm. I CREW PRAM modellen så stödjer den värdemängdsräkning, värdemängdsrapportering, och förfrågor om värdemängdssummationer optimalt med avseende på arbetet och med O(log n) djup. En sekventiell algoritm med O(log2 n + t log n) körtid för att besvara en förfrågan av ett 2-dimensionellt viktat värdemängdsstickprov i ett värdemängdsträd på n viktade punkter. Förfrågan definieras som följande: givet ett heltal t, välj slumpmässigt oberoende t punkter ur en värdetalsmängd. Varje punkt väljs med sannolikhet proportionell till sin vikt. I CREW PRAM modellen visar vi hur man kan stödja förfrågan optimalt med avseende på arbetet och med O(log n) djup.
APA, Harvard, Vancouver, ISO, and other styles
3

Gross, Jürgen. "Eine Implementierung von Lubys Algorithmus für die Cray T3E." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8385928.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

We̜growicz, Paulina. "Linear programming on the reconfigurable mesh and the CREW PRAM." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59985.

Full text
Abstract:
This thesis presents a new parallel algorithm for solving the linear programming problem in $R sp{d}$ for the reconfigurable mesh architecture and for the CREW PRAM model. The algorithm is based on the sequential technique discovered independently by Megiddo (Meg83, Meg84) and by Dyer (Dye84, Dye86), which gives a linear time algorithm, in n, the number of constraints, to solve the linear programming problem in d variables, when d is fixed. The parallel algorithm runs in O(log$ sp3$n) time in $R sp2$, $O(n sp{1/3}$log$ sp3$n) time in $R sp{3}$ and in $O(n sp{1/2}$) time in $R sp{d}$ on the reconfigurable mesh of size n. A simplified version of the same algorithm runs in O(log$ sp{d}$n) time on the CREW PRAM. The o($n sp{1/2}$) running times achieved by the parallel linear programming algorithm in $R sp{2}$ and $R sp{3}$ are due to a novel selection algorithm, which is also presented in this thesis. The selection algorithm runs in O(log$ sp3$n) time on the reconfigurable mesh. As is the case with the sequential technique, it will be shown that the parallel technique can be applied towards solving other problems such as linear separability, circular separability, digital disk and the Euclidean one-center problem, and can be extended to solve quadratic programming problems, in particular finding the smallest circle separating two sets of points.
APA, Harvard, Vancouver, ISO, and other styles
5

Snášel, Martin. "Design dětského kočárku." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2008. http://www.nusl.cz/ntk/nusl-227906.

Full text
Abstract:
Pram is more complicated product, than you may think. Regular first opinion puts pram into some sort of toy but it is exactly contrary. This product contains user’s demands from two point of view - parents and baby. These users have different needs and - as we are get used today - we want to have not just working stuffs but modern, nice and make it naturally like part of our lifes. We can’t prefer design and leave functionality behind or make it really complicated to produce just with efford create something new. In this project I tried find compromise and come out with design with new features, ideas and experimental look but with same function ability. Main point of designing the pram was create universal pram with easy use during whole first 3 baby periods (from 0 to 2 years old baby) and decrease the final number of needed parts. I focused on original design and carriage parts which can be formed according to baby needs. Create universall pram but also easy to transport and fold. There are two main features designed completelly from scratch: modifiable carriage part and design attractive no center axis wheels.
APA, Harvard, Vancouver, ISO, and other styles
6

Tiskin, Alexandre. "The design and analysis of bulk-synchronous parallel algorithms." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302334.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Denis, Frédéric. "Caractérisation fonctionnelle de PRAM-1 : un nouvel adaptateur des cellules myéloïdes." Paris 11, 2005. http://www.theses.fr/2005PA11T057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Armstrong, Kylie Jan. "Effectiveness of a pram walking intervention for women experiencing postnatal depression." Thesis, Queensland University of Technology, 2004. https://eprints.qut.edu.au/15837/1/Kylie_Armstrong_Thesis.pdf.

Full text
Abstract:
The purpose of the research project was to examine the effects of exercise and social support for postnatal women who reported experiencing Postnatal Depression (PND). PND is a serious condition that affects up to 10%-15% of women (O'Hara & Swain, 1996). Many previous studies have reported an improvement of depressive symptomatology following a pram walking intervention. However, no published research exists which assesses postnatal women who report experiencing PND. A randomised controlled trial was used, where pre-test data were compared to post-test effects. Two studies were conducted. In study 1 (n= 20) a multi-intervention group (exercise and social support) was compared to a control group who received no intervention. Study 2 (n= 19) was conducted 20 months later on a different group of women and involved a pram walking intervention group and a comparison social support group. Structured questionnaires assessing depressive symptomatology, general health and levels of social support were administered at pre-test phase, week 6 and 12. A sub-maximal fitness test was conducted the week before the program started and at week 12. The chief investigator was present at all sessions to guide the participants. Study 1 (S1): The multi-intervention group attended 3 pram walking sessions per week. After the exercise session the group met for refreshments in a local hall. The control group was only required to perform the fitness tests and answer the questionnaires. A 6-week alternative program of exercise and social support was offered to all the women at the completion of the intervention period. Study 2 (S2): The pram walking group met for 2 exercise sessions and were required to make up the third session independently. The comparison social support group met once per week for morning tea with the children. The samples for both studies were drawn from the Gold Coast region in Australia. Women of childbearing age who were experiencing depressive symptoms were recruited. For S1 their child had to be less than or equal to 12 months and for S2 the age cut off was increased to less than or equal to 18 months. The participants were screened to ensure that they did not have a medical condition that would prevent regular aerobic exercise and they were also excluded if they had a previous history of mental illness or could not speak English. Demographic data were obtained from each participant and details such as height, weight and age were collected for use in analysing fitness levels. The data for each study were collected across three time points (pre, week 6 and week 12) using widely tested instruments. Some additional questions relating to the participants experiences were collected at the completion of the study from the women allocated to the intervention groups. Data were also collected on fitness levels (pre and week 12) and the instrument was tested for its reliability. Both pram walking intervention groups were required to complete a weekly exercise diary. For each study, to test for the effect of the intervention over time, a two-way analysis of variance was conducted on the major outcome variables. Group (intervention versus control) was the between subject factor and time (pre-test, week 6, week 12) was the within subject factor or repeated measures factor. Due to the small sample size, further tests were conducted to check the assumptions of the statistical test to be used. The results showed that using Mauchly's Test, the Sphericity assumptions of repeated measures for ANOVA were met. Further, tests of homogeneity of variance assumptions also confirmed that this assumption was met. Data analysis was conducted using the software package SPSS for Windows Release 10.0. (Norusis, 2000). Overall, the findings from both S1 and S2 showed that the groups who received the pram walking intervention improved their depressive symptomatology and fitness levels when compared to those of the control (S1) and social support group (S2). Social support levels did not alter for either group from both studies. These results are encouraging and suggest that a pram walking program is an effective form of intervention for postnatal women experiencing depressive symptomatology.
APA, Harvard, Vancouver, ISO, and other styles
9

Armstrong, Kylie Jan. "Effectiveness of a Pram Walking Intervention for Women Experiencing Postnatal Depression." Queensland University of Technology, 2004. http://eprints.qut.edu.au/15837/.

Full text
Abstract:
The purpose of the research project was to examine the effects of exercise and social support for postnatal women who reported experiencing Postnatal Depression (PND). PND is a serious condition that affects up to 10%-15% of women (O'Hara & Swain, 1996). Many previous studies have reported an improvement of depressive symptomatology following a pram walking intervention. However, no published research exists which assesses postnatal women who report experiencing PND. A randomised controlled trial was used, where pre-test data were compared to post-test effects. Two studies were conducted. In study 1 (n= 20) a multi-intervention group (exercise and social support) was compared to a control group who received no intervention. Study 2 (n= 19) was conducted 20 months later on a different group of women and involved a pram walking intervention group and a comparison social support group. Structured questionnaires assessing depressive symptomatology, general health and levels of social support were administered at pre-test phase, week 6 and 12. A sub-maximal fitness test was conducted the week before the program started and at week 12. The chief investigator was present at all sessions to guide the participants. Study 1 (S1): The multi-intervention group attended 3 pram walking sessions per week. After the exercise session the group met for refreshments in a local hall. The control group was only required to perform the fitness tests and answer the questionnaires. A 6-week alternative program of exercise and social support was offered to all the women at the completion of the intervention period. Study 2 (S2): The pram walking group met for 2 exercise sessions and were required to make up the third session independently. The comparison social support group met once per week for morning tea with the children. The samples for both studies were drawn from the Gold Coast region in Australia. Women of childbearing age who were experiencing depressive symptoms were recruited. For S1 their child had to be less than or equal to 12 months and for S2 the age cut off was increased to less than or equal to 18 months. The participants were screened to ensure that they did not have a medical condition that would prevent regular aerobic exercise and they were also excluded if they had a previous history of mental illness or could not speak English. Demographic data were obtained from each participant and details such as height, weight and age were collected for use in analysing fitness levels. The data for each study were collected across three time points (pre, week 6 and week 12) using widely tested instruments. Some additional questions relating to the participants experiences were collected at the completion of the study from the women allocated to the intervention groups. Data were also collected on fitness levels (pre and week 12) and the instrument was tested for its reliability. Both pram walking intervention groups were required to complete a weekly exercise diary. For each study, to test for the effect of the intervention over time, a two-way analysis of variance was conducted on the major outcome variables. Group (intervention versus control) was the between subject factor and time (pre-test, week 6, week 12) was the within subject factor or repeated measures factor. Due to the small sample size, further tests were conducted to check the assumptions of the statistical test to be used. The results showed that using Mauchly's Test, the Sphericity assumptions of repeated measures for ANOVA were met. Further, tests of homogeneity of variance assumptions also confirmed that this assumption was met. Data analysis was conducted using the software package SPSS for Windows Release 10.0. (Norusis, 2000). Overall, the findings from both S1 and S2 showed that the groups who received the pram walking intervention improved their depressive symptomatology and fitness levels when compared to those of the control (S1) and social support group (S2). Social support levels did not alter for either group from both studies. These results are encouraging and suggest that a pram walking program is an effective form of intervention for postnatal women experiencing depressive symptomatology.
APA, Harvard, Vancouver, ISO, and other styles
10

Alnervik, Erik. "Evaluation of the Configurable Architecture REPLICA with Emulated Shared Memory." Thesis, Linköpings universitet, Programvara och system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-104313.

Full text
Abstract:
REPLICA is a family of novel scalable chip multiprocessors with configurable emulated shared memory architecture, whose computation model is based on the PRAM (Parallel Random Access Machine) model. The purpose of this thesis is to, by benchmarking different types of computation problems on REPLICA, similar parallel architectures (SB-PRAM and XMT) and more diverse ones (Xeon X5660 and Tesla M2050), evaluate how REPLICA is positioned among other existing architectures, both in performance and programming effort. But it should also examine if REPLICA is more suited for any special kinds of computational problems. By using some of the well known Berkeley dwarfs, and input from unbiased sources, such as The University of Florida Sparse Matrix Collection and Rodinia benchmark suite, we have made sure that the benchmarks measure relevant computation problems. We show that today’s parallel architectures have some performance issues for applications with irregular memory access patterns, which the REPLICA architecture can solve. For example, REPLICA only need to be clocked with a few MHz to match both Xeon X5660 and Tesla M2050 for the irregular memory access benchmark breadth first search. By comparing the efficiency of REPLICA to a CPU (Xeon X5660), we show that it is easier to program REPLICA efficiently than today’s multiprocessors.
REPLICA är en grupp av konfigurerbara multiprocessorer som med hjälp utav ett emulerat delat minne realiserar PRAM modellen. Syftet med denna avhandling är att genom benchmarking av olika beräkningsproblem på REPLICA, liknande (SB-PRAM och XMT) och mindre lika (Xeon X5660 och Tesla M2050) parallella arkitekturer, utvärdera hur REPLICA står sig mot andra befintliga arkitekturer. Både prestandamässigt och hur enkel arkitekturen är att programmera effektiv, men även försöka ta reda på om REPLICA är speciellt lämpad för några särskilda typer av beräkningsproblem. Genom att använda välkända Berkeley dwarfs applikationer och opartisk indata från bland annat The University of Florida Sparse Matrix Collection och Rodinia benchmark suite, säkerställer vi att det är relevanta beräkningsproblem som utförs och mäts. Vi visar att dagens parallella arkitekturer har problem med prestandan för applikationer med oregelbundna minnesaccessmönster, vilken REPLICA arkitekturen kan vara en lösning på. Till exempel, så behöver REPLICA endast vara klockad med några få MHz för att matcha både Xeon X5660 och Tesla M2050 för algoritmen breadth first search, vilken lider av just oregelbunden minnesåtkomst. Genom att jämföra effektiviteten för REPLICA gentemot en CPU (Xeon X5660), visar vi att det är lättare att programmera REPLICA effektivt än dagens multiprocessorer.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "PRAM"

1

Toer, Pramoedya Ananta. Pram melawan! Jakarta: Nalar, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Scriven, Gill. Fred's pram. Oxford: Oxford University Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Allan, Ahlberg, ed. Blue pram. London: Viking, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hong, Liu. Pram dan Cina. Depok: Komunitas Bambu, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Toer, Soesilo. Pram dari dalam. [Blora]: Gigih Pustaka Mandiri, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1937-, Bray Anne, ed. Building the nutshell pram. Brooklin, Me: WoodenBoat Books, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nettum, Rolf Nyboe. Christen Pram: Norges første romanforfatter. Oslo: Aschehoug, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Neto, David Michael. PRAM computation on fractured domains. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

A man and a pram. Clacton on Sea: Apex Publishing, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gubb, Jennifer. Wayne Hoskins and the pram lady. Cambridge: Meridor, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "PRAM"

1

Domingo-Ferrer, Josep. "PRAM." In Encyclopedia of Database Systems, 1. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4899-7993-3_1499-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Domingo-Ferrer, Josep. "PRAM." In Encyclopedia of Database Systems, 2126. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Domingo-Ferrer, Josep. "PRAM." In Encyclopedia of Database Systems, 2778. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_1499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Paul, Wolfgang J., Peter Bach, Michael Bosch, Jörg Fischer, Cédric Lichtenau, and Jochen Röhrig. "Real PRAM Programming." In Euro-Par 2002 Parallel Processing, 522–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45706-2_71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

de Wolf, Peter-Paul. "Risk, Utility and PRAM." In Privacy in Statistical Databases, 189–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11930242_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Willenborg, Leon. "Optimality models for PRAM." In COMPSTAT, 505–10. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-642-57678-2_71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Formella, Arno, Jörg Keller, and Thomas Walle. "HPP: A high performance PRAM." In Lecture Notes in Computer Science, 423–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Martin, Bruno. "A uniform universal CREW PRAM." In Lecture Notes in Computer Science, 557–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57182-5_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vishkin, Uzi. "PRAM Algorithms: Teach and Preach." In Opportunities and Constraints of Parallel Computing, 161–63. New York, NY: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-9668-0_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lefebvre, Cedric W., Jay P. Babich, James H. Grendell, James H. Grendell, John E. Heffner, Ronan Thibault, Claude Pichard, et al. "PRAM (Pressure Recording Analytical Method)." In Encyclopedia of Intensive Care Medicine, 1803. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-00418-6_2076.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "PRAM"

1

Xiong, Jinbo, Zhiqiang Yao, Jianfeng Ma, Ximeng Liu, Qi Li, and Tao Zhang. "PRAM." In the 2013 international workshop. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2484402.2484412.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mansouri, Fatima Z., Cleveland A. Gibbon, and Colin A. Higgins. "PRAM." In the 6th annual conference on the teaching of computing and the 3rd annual conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/282991.283108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meng, Zili, Jun Bi, Chen Sun, Anmin Xu, and Hongxin Hu. "PRAM." In SOSR '17: Symposium on SDN Research. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3050220.3060602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wen, Xingzhi, and Uzi Vishkin. "PRAM-on-chip." In the nineteenth annual ACM symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1248377.1248427.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hagerup, Torben, and T. Radzik. "Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM." In the second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/97444.97677.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Clarkson, T. G., D. Gorse, Y. Guan, and J. G. Taylor. "Applications of the pRAM." In 1991 IEEE International Joint Conference on Neural Networks. IEEE, 1991. http://dx.doi.org/10.1109/ijcnn.1991.170348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kim, Y. T., Y. N. Hwang, K. H. Lee, S. H. Lee, C. W. Jeong, S. J. Ahn, F. Yeung, et al. "Programming Characteristics of PRAM." In 2004 International Conference on Solid State Devices and Materials. The Japan Society of Applied Physics, 2004. http://dx.doi.org/10.7567/ssdm.2004.d-3-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gibbons, P. B. "A more practical PRAM model." In the first annual ACM symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/72935.72953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aggarwal, A., A. K. Chandra, and M. Snir. "On communication latency in PRAM computations." In the first annual ACM symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/72935.72937.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hamdi, M. "Efficient CRCW PRAM Emulation on Practical Networks." In 1994 International Conference on Parallel Processing Vol. 3. IEEE, 1994. http://dx.doi.org/10.1109/icpp.1994.100.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "PRAM"

1

Gafni, Eli, Joseph Naor, and Prabhakar Ragde. On Separating the EREW and CREW PRAM Models,. Fort Belvoir, VA: Defense Technical Information Center, December 1988. http://dx.doi.org/10.21236/ada324003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brown, Jonathan Leighton, and Zhaofang Wen. PRAM C:a new programming environment for fine-grain and coarse-grain parallelism. Office of Scientific and Technical Information (OSTI), November 2004. http://dx.doi.org/10.2172/877738.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kharel, Arjun, Sudhir Shrestha, Sadikshya Bhattarai, Pauline Oosterhoff, and Karen Snyder. Assessment of Outreach and Engagement with Prospective Migrants by the Agencies Recruiting Labourers for Foreign Employment. Institute of Development Studies, May 2022. http://dx.doi.org/10.19088/ids.2022.037.

Full text
Abstract:
This study was conducted to identify the gaps in policies and practices of labour recruitment in Nepal and assess the outreach and engagement of major formal labour intermediaries, private recruitment agencies (PRAs) and pre-departure orientation training (PDOT) centres, with migrant workers for providing information on human trafficking prior to departure. The study used data from interviews with the management of 15 PRAs and 10 PDOT centres, along with a review of online materials published by the sampled PRAs and PDOT centres and existing publications on labour migration from Nepal.
APA, Harvard, Vancouver, ISO, and other styles
4

Marr-Lyon, Mark. 2011 pRad ER-489 Experiments. Office of Scientific and Technical Information (OSTI), August 2017. http://dx.doi.org/10.2172/1374293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Esquibel, David, and Lynn Veeser. Modeling for pRad Explosive Experiments. Office of Scientific and Technical Information (OSTI), June 2020. http://dx.doi.org/10.2172/1724069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sjue, Sky. "The Princess and the pRad" [Slides]. Office of Scientific and Technical Information (OSTI), May 2021. http://dx.doi.org/10.2172/1782614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ma, Yoon Jin, and Helen Koo. Potential of Extending Lifespan of Prom Dresses. Ames: Iowa State University, Digital Repository, November 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morris, Christopher. Copy of the unclassified Prad logbook for Prad 555, 556, 632, 634, 635, 659, 660, and Stat 173. Office of Scientific and Technical Information (OSTI), April 2017. http://dx.doi.org/10.2172/1352348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Evett, Matthew, James Hendler, Ambuj Mahanti, and Dana Nau. PRA: Massively Parallel Heuristic Search. Fort Belvoir, VA: Defense Technical Information Center, January 1991. http://dx.doi.org/10.21236/ada454848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Stephen, Gord. Probabilistic Resource Adequacy Suite (PRAS) v0.6 Model Documentation. Office of Scientific and Technical Information (OSTI), May 2021. http://dx.doi.org/10.2172/1785462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'PRAM' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography