Academic literature on the topic 'PrAMP'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'PrAMP.'
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 "PrAMP"
1
Krizsan, Andor, Daniel Knappe, and Ralf Hoffmann. "Influence of theyjiL-mdtMGene Cluster on the Antibacterial Activity of Proline-Rich Antimicrobial Peptides Overcoming Escherichia coli Resistance Induced by the Missing SbmA Transporter System." Antimicrobial Agents and Chemotherapy 59, no. 10 (July 13, 2015): 5992–98. http://dx.doi.org/10.1128/aac.01307-15.
Full textAbstract:
ABSTRACTIn view of increasing health threats from multiresistant pathogens, antimicrobial peptides (AMPs) and, specifically, proline-rich AMPs (PrAMPs) have been investigated in animal models. PrAMPs enter bacteria via the ABC transporter SbmA and inhibit intracellular targets. We used phage transduction (Tn10insertion) to screen by random mutagenesis for alternative uptake mechanisms for analogs of apidaecin 1b, a honeybee-derived PrAMP. All 24 apidaecin-resistant mutants had the Tn10insertion in thesbmAgene. ThesesbmA::Tn10insertion mutants and theEscherichia coliBW25113 ΔsbmA(JW0368) strain were still susceptible to the bactenecin PrAMP Bac7(1-35) and oncocin PrAMPs Onc18 and Onc112, as well as to Chex1-Arg20, despite significantly reduced internalizations. In a second round of random mutagenesis, the remaining susceptibility was linked to theyjiL-mdtMgene cluster.E. coliBW25113 and its ΔyjiLnull mutant (JW5785) were equally susceptible to all PrAMPs tested, whereas the BW25113 ΔmdtMmutant was less susceptible to oncocins. The JW0368yjiL::Tn10transposon mutant (BS2) was resistant to all short PrAMPs and susceptible only to full-length Bac7 and A3-APO. Interestingly, PrAMPs appear to enter bacteria via MdtM, a multidrug resistance transporter (drug/H+antiporter) of the major facilitator superfamily (MFS) that can efflux antibiotics, biocides, and bile salts. In conclusion, PrAMPs enter bacteria via ABC and MFS transporters that efflux antibiotics and cytotoxic compounds from the cytoplasm to the periplasm.
2
Hansen, Anne, Ingo Schäfer, Daniel Knappe, Peter Seibel, and Ralf Hoffmann. "Intracellular Toxicity of Proline-Rich Antimicrobial Peptides Shuttled into Mammalian Cells by the Cell-Penetrating Peptide Penetratin." Antimicrobial Agents and Chemotherapy 56, no. 10 (July 30, 2012): 5194–201. http://dx.doi.org/10.1128/aac.00585-12.
Full textAbstract:
ABSTRACTThe health threat caused by multiresistant bacteria has continuously increased and recently peaked with pathogens resistant to all current drugs. This has triggered intense research efforts to develop novel compounds to overcome the resistance mechanisms. Thus, antimicrobial peptides (AMPs) have been intensively studied, especially the family of proline-rich AMPs (PrAMPs) that was successfully tested very recently in murine infection models. PrAMPs enter bacteria and inhibit chaperone DnaK. Here, we studied the toxicity of intracellular PrAMPs in HeLa and SH-SY5Y cells. As PrAMPs cannot enter most mammalian cells, we coupled the PrAMPs with penetratin (residues 43 to 58 in the antennapedia homeodomain) via a C-terminally added cysteine utilizing a thioether bridge. The resulting construct could transport the covalently linked PrAMP into mammalian cells. Penetratin ligation reduced the MIC for Gram-negativeEscherichia colionly slightly (1 to 8 μmol/liter) but increased the activity against the Gram-positiveMicrococcus luteusup to 32-fold (MIC ≈ 1 μmol/liter), most likely due to more effective penetration through the bacterial membrane. In contrast to native PrAMPs, the penetratin-PrAMP constructs entered the mammalian cells, aligned around the nucleus, and associated with the Golgi apparatus. At higher concentrations, the constructs reduced the cell viability (50% inhibitory concentration [IC50] ≈ 40 μmol/liter) and changed the morphology of the cells. No toxic effects or morphological changes were observed at concentrations of 10 μmol/liter or below. Thus, the IC50values were around 5 to 40 times higher than the MIC values. In conclusion, PrAMPs are in general not toxic to mammalian cells, as they do not pass through the membrane. When shuttled into mammalian cells, however, PrAMPs are only slightly cross-reactive to mammalian chaperones or other intracellular mammalian proteins, providing a second layer of safety forin vivoapplications, even if they can enter some human cells.
3
Sola, Riccardo, Mario Mardirossian, Bertrand Beckert, Laura Sanghez De Luna, Dennis Prickett, Alessandro Tossi, Daniel N. Wilson, and Marco Scocchi. "Characterization of Cetacean Proline-Rich Antimicrobial Peptides Displaying Activity against ESKAPE Pathogens." International Journal of Molecular Sciences 21, no. 19 (October 6, 2020): 7367. http://dx.doi.org/10.3390/ijms21197367.
Full textAbstract:
Proline-rich antimicrobial peptides (PrAMPs) may be a valuable weapon against multi-drug resistant pathogens, combining potent antimicrobial activity with low cytotoxicity. We have identified novel PrAMPs from five cetacean species (cePrAMPs), and characterized their potency, mechanism of action and in vitro cytotoxicity. Despite the homology between the N-terminal of cePrAMPs and the bovine PrAMP Bac7, some differences emerged in their sequence, activity spectrum and mode of action. CePrAMPs with the highest similarity with the Bac7(1-35) fragment inhibited bacterial protein synthesis without membrane permeabilization, while a second subgroup of cePrAMPs was more membrane-active but less efficient at inhibiting bacterial translation. Such differences may be ascribable to differences in presence and positioning of Trp residues and of a conserved motif seemingly required for translation inhibition. Unlike Bac7(1-35), which requires the peptide transporter SbmA for its uptake, the activity of cePrAMPs was mostly independent of SbmA, regardless of their mechanism of action. Two peptides displayed a promisingly broad spectrum of activity, with minimal inhibiting concentration MIC ≤ 4 µM against several bacteria of the ESKAPE group, including Pseudomonas aeruginosa and Enterococcus faecium. Our approach has led us to discover several new peptides; correlating their sequences and mechanism of action will provide useful insights for designing optimized future peptide-based antibiotics.
4
Zhu, Yanyu, James C. Weisshaar, and Mainak Mustafi. "Long-term effects of the proline-rich antimicrobial peptide Oncocin112 on the Escherichia coli translation machinery." Journal of Biological Chemistry 295, no. 38 (July 28, 2020): 13314–25. http://dx.doi.org/10.1074/jbc.ra120.013587.
Full textAbstract:
Proline-rich antimicrobial peptides (PrAMPs) are cationic antimicrobial peptides unusual for their ability to penetrate bacterial membranes and kill cells without causing membrane permeabilization. Structural studies show that many such PrAMPs bind deep in the peptide exit channel of the ribosome, near the peptidyl transfer center. Biochemical studies of the particular synthetic PrAMP oncocin112 (Onc112) suggest that on reaching the cytoplasm, the peptide occupies its binding site prior to the transition from initiation to the elongation phase of translation, thus blocking further initiation events. We present a superresolution fluorescence microscopy study of the long-term effects of Onc112 on ribosome, elongation factor-Tu (EF-Tu), and DNA spatial distributions and diffusive properties in intact Escherichia coli cells. The new data corroborate earlier mechanistic inferences from studies in vitro. Comparisons with the diffusive behavior induced by the ribosome-binding antibiotics chloramphenicol and kasugamycin show how the specific location of each agent's ribosomal binding site affects the long-term distribution of ribosomal species between 30S and 50S subunits versus 70S polysomes. Analysis of the single-step displacements from ribosome and EF-Tu diffusive trajectories before and after Onc112 treatment suggests that the act of codon testing of noncognate ternary complexes (TCs) at the ribosomal A-site enhances the dissociation rate of such TCs from their L7/L12 tethers. Testing and rejection of noncognate TCs on a sub-ms timescale is essential to enable incorporation of the rare cognate amino acids into the growing peptide chain at a rate of ∼20 aa/s.
5
Brakel, Alexandra, Andor Krizsan, Renke Itzenga, Carl N. Kraus, Laszlo Otvos, and Ralf Hoffmann. "Influence of Substitutions in the Binding Motif of Proline-Rich Antimicrobial Peptide ARV-1502 on 70S Ribosome Binding and Antimicrobial Activity." International Journal of Molecular Sciences 23, no. 6 (March 15, 2022): 3150. http://dx.doi.org/10.3390/ijms23063150.
Full textAbstract:
Proline-rich antimicrobial peptides (PrAMPs) are promising candidates to treat bacterial infections. The designer peptide ARV-1502 exhibits strong antimicrobial effects against Enterobacteriaceae both in vitro and in vivo. Since the inhibitory effects of ARV-1502 reported for the 70 kDa heat-shock protein DnaK do not fully explain the antimicrobial activity of its 176 substituted analogs, we further studied their effect on the bacterial 70S ribosome of Escherichia coli, a known target of PrAMPs. ARV-1502 analogues, substituted in positions 3, 4, and 8 to 12 (underlined) of the binding motif D3KPRPYLPRP12 with aspartic acid, lysine, serine, phenylalanine or leucine, were tested in a competitive fluorescence polarization (FP) binding screening assay using 5(6)-carboxyfluorescein-labeled (Cf-) ARV-1502 and the 70S ribosome isolated from E. coli BW25113. While their effect on ribosomal protein expression was studied for green fluorescent protein (GFP) in a cell-free expression system (in vitro translation), the importance of known PrAMP transporters SbmA and MdtM was investigated using E. coli BW25113 and the corresponding knockout mutants. The dissociation constant (Kd) of 201 ± 16 nmol/L obtained for Cf-ARV-1502 suggests strong binding to the E. coli 70S ribosome. An inhibitory binding assay indicated that the binding site overlaps with those of other PrAMPs including Onc112 and pyrrhocoricin as well as the non-peptidic antibiotics erythromycin and chloramphenicol. All these drugs and drug candidates bind to the exit-tunnel of the 70S ribosome. Substitutions of the C-terminal fragment of the binding motif YLPRP reduced binding. At the same time, inhibition of GFP expression increased with net peptide charge. Interestingly, the MIC values of wild-type and ΔsbmA and ΔmdtM knockout mutants indicated that substitutions in the ribosomal binding motif altered also the bacterial uptake, which was generally improved by incorporation of hydrophobic residues. In conclusion, most substituted ARV-1502 analogs bound weaker to the 70S ribosome than ARV-1502 underlining the importance of the YLPRP binding motif. The weaker ribosomal binding correlated well with decreased antimicrobial activity in vitro. Substituted ARV-1502 analogs with a higher level of hydrophobicity or positive net charge improved the ribosome binding, inhibition of translation, and bacterial uptake.
6
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 textAbstract:
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.
7
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 textAbstract:
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.
8
BRUDA, STEFAN D., and YUANQIAO ZHANG. "COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS." International Journal of Foundations of Computer Science 21, no. 03 (June 2010): 441–57. http://dx.doi.org/10.1142/s0129054110007350.
Full textAbstract:
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature, we split these models into "heavyweight" (directed reconfigurable buses, the Combining PRAM, and the BSR) and "lightweight" (all the other PRAMs) and then find that the heavyweight class is strictly more powerful than the lightweight class, as expected. On the other hand, we contradict the long held belief that the heavyweight models form a hierarchy, showing that all of them are identical in computational power with each other. We start the process by showing that the Collision write conflict resolution rule is universal on models with reconfigurable buses (in the sense that complex conflict resolution rules such as Priority and Combining can be simulated with constant overhead by Collision).
9
Ulla, Bente. "Reconceptualising sleep: Relational principles inside and outside the pram." Contemporary Issues in Early Childhood 18, no. 4 (December 2017): 400–408. http://dx.doi.org/10.1177/1463949117742781.
Full textAbstract:
This article explores sleep among kindergarten infants and toddlers. Although the collective order of sleep in kindergarten makes it a relational issue, the search here is for relations that extend beyond human actors and beyond the idea of the pram as a sleep container used by a sleeping subject. Here, sleep is seen as entangled with bodies and prams; it has a rhythm and a tempo, as well as the power to challenge the capitalist call for productivity. The article addresses sleep in terms of spatial configurations and contextualises it within a web of political relations rather than as a leftover of life. Informed by Foucault’s notions of heterotopia, the article characterises sleep as a world within a world, drawing attention to relational principles and material-discursive spaces that are characterised as ‘different’, on the understanding that sleep is not an intermission from life or relationships. Moving beyond the conceptualisation of sleep as a health and medical issue, it is reframed as embodied and embedded, enabling exploration of sleep in kindergarten as relational.
10
Greiner, Jochen, Lars Bullinger, Krzysztof Giannopoulos, Anita Schmitt, Marlies Goetz, Lena Kienle, Hartmut Döhner, and Michael Schmitt. "The Leukemia-Associated Antigen PRAME Is Overexpressed in Myeloid Leukemias and Inhibits Cell Differentiation by Blocking the Receptor for Retinoic Acid (RAR)-Signaling in Vitro and Is Therefore a Interesting Candidate for Targeted Immunotherapies." Blood 112, no. 11 (November 16, 2008): 1524. http://dx.doi.org/10.1182/blood.v112.11.1524.1524.
Full textAbstract:
Abstract The leukemia-associated antigen PRAME (preferentially expressed antigen of melanoma) is frequently expressed in several solid tumors. Earlier, we reported (Greiner et al., Blood 2006) that co-expression of leukemia-associated antigens including PRAME constituted a favorable prognostic parameter for AML patients. By microassay analysis and conventional RT-PCR, we detected over-expression of PRAME in more than 60% of AML and of CML patients. In contrast, PRAME is expressed neither in normal CD34-positive hematopoietic stem cells nor in normal tissues (other than testis and placenta). Here, we describe for the first time that retinoic acid-induced cell proliferation and differentiation of several AML cell lines is dependent on PRAME expression: PRAME negative cell lines treated with all-trans retinoic acid (ATRA) in cell culture showed lower cell proliferation than PRAME positive cells as assessed by cell counts and FACS analysis for BrdU, but an increase of cell differentiation detected by FACS analysis for CD66b in contrast with PRAME positive leukemia cell lines. The leukemia-associated antigen PRAME seems to be responsible for the resistance of PRAME-positive AML to ATRA treatment. We detected no differences in induction of apoptosis in PRAME-positive or PRAME-negative cell lines treated with ATRA in FACS analysis for annexin. Over-expression of the antigen and this critical role of PRAME in cell differentiation might be the reason for specific T cell induction against PRAME-derived peptides. To detect specific T cell responses against PRAME-derived peptides we examined samples from healthy volunteers and AML patients. Positive results in ELISPOT assays for IFN-g and Granzyme B secretion were observed in 70% of AML cases analyzed for the peptide PRAME-P3. In chromium release assays, we found a PRAME-specific cell lysis of PRAME-positive AML blasts. Taken together, PRAME is involved in a crucial mechanism for cell growth of leukemic cells, induces specific T cell responses in a high frequency of AML patients, and this constitutes an appropriate target structure for specific immunotherapies or other targeted therapies in AML.
Dissertations / Theses on the topic "PrAMP"
1
Bluhm, Martina E. C., Viktoria A. F. Schneider, Ingo Schäfer, Stefania Piantavigna, Tina Goldbach, Daniel Knappe, Peter Seibel, Lisandra L. Martin, Edwin J. A. Veldhuizen, and Ralf Hoffmann. "N-Terminal Ile-Orn- and Trp-Orn-Motif repeats enhance membrane interaction and increase the antimicrobial activity of Apidaecins against Pseudomonas aeruginosa." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-205372.
Full textAbstract:
The Gram-negative bacterium Pseudomonas aeruginosa is a life-threatening nosocomial pathogen due to its generally low susceptibility toward antibiotics. Furthermore, many strains have acquired resistance mechanisms requiring new antimicrobials with novel mechanisms to enhance treatment options. Proline-rich antimicrobial peptides, such as the apidaecin analog Api137, are highly efficient against various Enterobacteriaceae infections in mice, but less active against P. aeruginosa in vitro. Here, we extended our recent work by optimizing lead peptides Api755 (gu-OIORPVYOPRPRPPHPRL-OH; gu = N,N,N′,N′-tetramethylguanidino, O = L-ornithine) and Api760 (gu-OWORPVYOPRPRPPHPRL-OH) by incorporation of Ile-Orn- and Trp-Orn-motifs, respectively. Api795 (gu-O(IO)2RPVYOPRPRPPHPRL-OH) and Api794 (gu-O(WO)3RPVYOPRPRPPHPRL-OH) were highly active against P. aeruginosa with minimal inhibitory concentrations of 8–16 and 8–32 μg/mL against Escherichia coli and Klebsiella pneumoniae. Assessed using a quartz crystal microbalance, these peptides inserted into a membrane layer and the surface activity increased gradually from Api137, over Api795, to Api794. This mode of action was confirmed by transmission electron microscopy indicating some membrane damage only at the high peptide concentrations. Api794 and Api795 were highly stable against serum proteases (half-life times >5 h) and non-hemolytic to human erythrocytes at peptide concentrations of 0.6 g/L. At this concentration, Api795 reduced the cell viability of HeLa cells only slightly, whereas the IC50 of Api794 was 0.23 ± 0.09 g/L. Confocal fluorescence microscopy revealed no colocalization of 5(6)-carboxyfluorescein-labeled Api794 or Api795 with the mitochondria, excluding interactions with the mitochondrial membrane. Interestingly, Api795 was localized in endosomes, whereas Api794 was present in endosomes and the cytosol. This was verified using flow cytometry showing a 50% higher uptake of Api794 in HeLa cells compared with Api795. The uptake was reduced for both peptides by 50 and 80%, respectively, after inhibiting endocytotic uptake with dynasore. In summary, Api794 and Api795 were highly active against P. aeruginosa in vitro. Both peptides passed across the bacterial membrane efficiently, most likely then disturbing the ribosome assembly, and resulting in further intracellular damage. Api795 with its IOIO-motif, which was particularly active and only slightly toxic in vitro, appears to represent a promising third generation lead compound for the development of novel antibiotics against P. aeruginosa.
2
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
3
Barcellos, Antonio Marinho Pilla. "PRMP : a scaleable polling-based reliable multicast protocol." Thesis, University of Newcastle Upon Tyne, 1998. http://hdl.handle.net/10443/1981.
Full textAbstract:
Traditional reliable unicast protocols (e.g., TCP), known as sender-initiated schemes, do not scale well for one-to-many reliable multicast due mainly to implosion losses caused by excessive rate of feedback packets arriving from receivers. So, recent multicast protocols have been devised following the receiver- initiated approach: scalability (in terms of control traffic, protocol state and end-systems processing requirements) is achieved by making the sender independent from receivers; the sender does not know the membership of the destination group. However, this comes with a cost: the lack of knowledge about and control of receivers at the sender has negative implications with respect to throughput, network cost (bandwidth required), and degree of reliability offered to applications. This thesis follows an alternative approach: instead of adopting the receiver-initiated scheme, it greatly enhances the scalability of the sender-initiated scheme, by means of polling-based feedback and hierarchy. The resulting protocol is named PRMP: polling-based Reliable Multicast protocol. Its unique implosion avoidance mechanism polls receivers at carefully planned timing instants achieving a low and uniformly distributed rate of feedback packets. The sender retains controls of receivers: the main PRMP mechanisms are based on a one-to-many sliding window mechanism, which efficiently and elegantly extends the abstraction from reliable unicasting to reliable multicasting. The error control mechanism of PRMP incorporates the use of NACKs and selective, cumulative acknowledgment of packets; additionally, it can wait and judiciously decide between multicast and selective unicast retransmissions. The flow control mechanism prevents unnecessary losses caused by the overrunning of receivers, despite variations in round-trip times and application speeds. The scalability provided by the polling mechanism is further extended by an hierarchic organization to exploit distributed processing and local recovery: receivers are organized according to a tree-structure. However, unlike other tree-based protocols, PRMP is "fully-hierarchic": each parent node forwards data via multicast to its children, and retains/explores the control of and knowledge about its children while autonomously applying error, flow, congestion and session controls in the communication with them. Two congestion control mechanisms, one window-based and another rate-based, have been incorporated to PRMP. As shown through simulation experiments, the resulting protocol q,chieves high though put with cost- effective reliable multicasting. They also show the scalability and effectiveness of PRMP mechanisms. PRMP can achieve reliable multicast with the same kind of reliability guarantees provided by TCP but without incurring prohibitive costs in terms of network cost or recovery latency found in other protocols.
4
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 textAbstract:
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.
5
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
6
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 textAbstract:
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.
7
Vulcani-Freitas, Tânia Maria [UNIFESP]. "Perfil de expressão dos genes MYC, MYCN, TERT, ASPM e PRAME em Meduloblastoma." Universidade Federal de São Paulo (UNIFESP), 2010. http://repositorio.unifesp.br/handle/11600/9928.
Full textAbstract:
Made available in DSpace on 2015-07-22T20:50:35Z (GMT). No. of bitstreams: 0
Previous issue date: 2010-04-28Meduloblastoma (MB) é o tumor maligno de sistema nervoso central (SNC) mais comum em criança, compreendendo 20% dos tumores primários de SNC e 40% dos tumores cerebelares da infância. Devido sua forte tendência metastática, o tratamento padrão pós-operatório inclui radio e quimioterapia, cujo impacto causa distúrbios endócrinos e de crescimento, e disfunção neurocognitiva a longo prazo. Frente a esses efeitos negativos, muitas pesquisas em meduloblastoma têm sido realizadas com intuito de obter conhecimento biológico desses tumores para tentar identificar fatores prognósticos moleculares que possam orientar os tratamentos, tornando-os mais específicos e menos agressivos. Alguns estudos em MB têm sugerido que a expressão do oncogene MYC está associada com diminuição da sobrevida e sua superexpressão com maior agressividade do tumor. Por isso, MYC pode ser um indicador importante de prognóstico, além de modulador do comportamento desta doença. Enquanto o gene MYC é expresso em uma variedade de tecidos, a expressão de MYCN, outro membro da família MYC, é restrita a estágios precoces do desenvolvimento embrionário de alguns tecidos apenas, entre eles, o sistema nervoso central e periférico, sendo um mediador importante dos efeitos de ativação na proliferação de células precursoras cerebelares. Dessa forma, quando a expressão de MYCN está desregulada, ela aumenta a tumorigenicidade dessas células podendo dar origem ao MB. Além disso, o gene MYC também é considerado importante regulador da transcrição TERT, gene que codifica uma subunidade catálica de da telomerase, enzima importante para carcinogênese e imortalização de células neoplásicas. A atividade anormal da telomerase está presente em 90% dos cânceres e o aumento de sua atividade está associado a eventos clínicos desfavoráveis. Outro gene importante é o ASPM (abnormal spindle-like microcephaly associated) que desempenha função fundamental na neurogênese e proliferação celular durante o desenvolvimento cerebral. Esse gene codifica uma proteína de centrossomo e fuso mitótico que permite a divisão celular simétrica em células neuroepiteliais durante o desenvolvimento e aumento do tamanho cerebral. Alterações em ASPM é a causa mais comum de microcefalia primária em humanos e de falha de segregação, induzindo a aneuploidias e instabilidade genética. Além desses genes, outro gene estudado recentemente, como alvo em xv imunoterapia, é o gene PRAME que codifica um antígeno tumoral que está presente em vários tumores, incluindo meduloblastoma. O gene PRAME possui baixa ou ausência de expressão em tecidos normais, por isso é pode ser um forte candidato como alvo em imunoterapia, que é um tratamento menos tóxico. OBJETIVOS: O objetivo desse estudo foi investigar a expressão dos genes MYC, MYCN, TERT, ASPM e PRAME em fragmentos tumorais de meduloblastoma de crianças e tentar correlacionar com os parâmetros clínicos e verificar se há correlação de MYC, MYCN, TERT entre si, uma vez que estão correlacionados. MÉTODOS: Análise de expressão gênica foi realizada através de PCR quantitativa em tempo real, utilizando sistema SYBR Green, em 37 amostras tumorais de crianças, com média de idade de 8 anos. Para comparação de perfil de expressão foi usada duas amostra de cérebro normal. A análise estatística foi realizada nos programas Graph Pad Prism 4 e VassarStats RESULTADOS: Todas nossas amostras superexpressaram o gene MYCN com valor de quantificação relativa (RQ) mediana igual a 31 com p=0.001; assim como, todas nossas amostras também superexpressaram o gene ASPM com mediana igual a 586, p<0.0001. Do total de amostras, 95%, 81% e 84% superexpressaram TERT, MYC e PRAME respectivamente, sendo os valores de RQ (mediana) iguais a 322, p=0.01; 9.2, p<0.0001; 33, p<0.0001. Apesar da elevada expressão dos genes estudados na maioria das amostras estudadas, houve apenas correlação estatística entre a superexpressão de MYCN (p=0.008) e os pacientes que foram a óbito, e de TERT e os pacientes que recidivaram (p=0.0431). Não encontramos outra correlação estatística entre a superexpressão dos genes e as características clínicas dos pacientes. CONCLUSÃO: Os genes MYC, MYCN e TERT estavam superexpressos nas amostras de meduloblastoma analisadas em uma freqüência muito superior ao demonstrado na literatura, o que sugere que esses três genes podem ajudar na identificação de tumores agressivos, uma vez que o pognóstico desses pacientes continua baseado apenas em parâmentros clínicos. A superexpressão de ASPM em todas as amostras estudadas sugere que este gene pode estar envolvido na origem de MB, como parte da neurogênse anormal durante o desenvolvimento embrionário, porém estudoas funcionais devem ser realizados para confirmar essa hipótese. Por fim, o gene PRAME pode ser candidato à marcador de célula tumoral em MB, podendo no futuro ser candidato como alvo em imunoterapias.
To investigate the expression of genes MYC, MYCN and TERT in tumor fragments of pediatric medulloblastoma and correlate gene expression profiles with clinical parameters. Analysis of gene expression was performed by quantitative PCR real time in 37 tumor samples and correlated with clinical and pathological data. All 37 samples overexpressed MYCN gene (p= 0.001), 95% and 84% of the samples overexpressed TERT and MYC, respectively (p<0.0001). Twenty nine (78%) of all samples had concomitant high expression of MYC, MYCN and TERT genes together. Seventeen (59%) were high-risk classification, 10 (34%) were metastatic (M+) stage, two (7%) were anaplastic or largecell/ anaplastic subtype, eight (28%) of patients relapsed, beyond thirteen (45%) suffered partial surgical resection. and fourteen (48%) died. We found correlation between MYC, MYCN and TERT expression (p<0.0001). The identification of a subgroup with concomitant overexpression of the three investigated genes suggests the possibility of using more than one aspect of molecular indicative of unfavorable prognosis that characterizes the group with poor outcome. However, in future this may be enhanced by targeted therapy for the product TERT as proposed in some neoplasms. The identification of molecular events in the medulloblastoma categorization aims to help at-risk groups moving towards individualized medicine.
TEDE
BV UNIFESP: Teses e dissertações
8
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
9
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 textAbstract:
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.
10
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 textAbstract:
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.
Books on the topic "PrAMP"
1
Weir, Susan. Dublin's working prams. [Dublin, Ireland]: Susan Weir, 2012.
Find full text
2
Toer, Pramoedya Ananta. Pram melawan! Jakarta: Nalar, 2011.
Find full text
3
Allan, Ahlberg, ed. Blue pram. London: Viking, 1998.
Find full text
4
Scriven, Gill. Fred's pram. Oxford: Oxford University Press, 2000.
Find full text
5
Indagini su Monte Prama. Ghilarza (OR): NOR, 2017.
Find full text
6
Phadungthiti, Thanachai. Dō̜kbīa, bīa prap. [Bangkok]: Samnakphim Nitirat, 2001.
Find full text
7
Hong, Liu. Pram dan Cina. Depok: Komunitas Bambu, 2008.
Find full text
8
Hiriyanna, Ambalike. Vlajimir Je. Prap. Beṅgaḷūru: Karnāṭaka Jānapada mattu Yakṣagāna Akāḍemi, 1995.
Find full text
9
Buxhovi, Jusuf. prap vdekja 3. Prishtine: 1995, 1995.
Find full text
10
Toer, Soesilo. Pram dari dalam. [Blora]: Gigih Pustaka Mandiri, 2013.
Find full textBook chapters on the topic "PrAMP"
1
Martens, Jan, Jan Friso Groote, Lars van den Haak, Pieter Hijma, and Anton Wijs. "A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions." In Formal Aspects of Component Software, 115–33. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90636-8_7.
Full textAbstract:
AbstractThe most efficient way to calculate strong bisimilarity is by finding the relational coarsest partition of a transition system. We provide the first linear-time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, with n states, m transitions and $$| Act |\le m$$ | A c t | ≤ m action labels, we provide an algorithm for $$\max (n,m)$$ max ( n , m ) processors that calculates strong bisimulation in time $$\mathcal {O}(n+| Act |)$$ O ( n + | A c t | ) and space $$\mathcal {O}(n+m)$$ O ( n + m ) . The best-known PRAM algorithm has time complexity $$\mathcal {O}(n\log n)$$ O ( n log n ) on a smaller number of processors making it less suitable for massive parallel devices such as GPUs. An implementation on a GPU shows that the linear time-bound is achievable on contemporary hardware.
2
Pandit, Shilpa Ashok. "Prama¯." In Decolonizing Consciousness, 79–105. London: Routledge India, 2023. http://dx.doi.org/10.4324/9781003336204-5.
Full text
3
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
4
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
5
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
6
Self, Douglas. "Preamp Architecture." In Electronics for Vinyl, 79–85. New York ; London : Routledge, 2017.: Routledge, 2017. http://dx.doi.org/10.4324/9781315202174-4.
Full text
7
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
8
Aggarwal, Alok, and Ashok K. Chandra. "Communication complexity of PRAMs." In Automata, Languages and Programming, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19488-6_103.
Full text
9
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
10
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 textConference papers on the topic "PrAMP"
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
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
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
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
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
6
Son, Sungkyu, Seungjoon Jeon, Jangwon Oh, Won Kim, Hojoung Kim, Jonghak Lee, Seungho Woo, et al. "In-situ Characterization of Switching Mechanism in Phase Change Random Access Memory (PRAM) Using Transmission Electron Microscopy (TEM)." In ISTFA 2013. ASM International, 2013. http://dx.doi.org/10.31399/asm.cp.istfa2013p0236.
Full textAbstract:
Abstract It is important to understand the switching mechanism of phase change material for failure analysis of PRAM device. In this study, the real time observations of phase transition and void formation mechanism of confined GST structure were investigated using in-situ TEM with multi-pulse AC biasing technique. In-situ SET switching behavior between amorphous state and crystalline state with continuous structural change was successfully observed. Volume shrink of GST, due to the phase transition, induced voids at grain boundary of crystalline phase. Excess Joule-heating after crystallization caused coalescence and migration of voids. These results may give us a crucial clue for endurance failure analysis of PRAM.
7
Nisan, N. "CREW PRAMS and decision trees." In the twenty-first annual ACM symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/73007.73038.
Full text
8
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
9
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
10
Cárceres, Edson Norberto, and Jayme Luiz Szwarcfiter. "Cliques Maximais em Grafos Círculo." In Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1993. http://dx.doi.org/10.5753/sbac-pad.1993.23047.
Full textAbstract:
Apresentamos uma implementação em uma CREW PRAM de um algoritmo paralelo para geração de todas as cliques maximais em um grafo círculo. O algoritmo é executado em tempo paralelo O(α log2 n) com n3 processadores, onde n,m e α são o número de vértices, arestas e cliques maximais do grafo, respectivamente. Vamos também apresentar um algoritmo paralelo para computar o número de cliques maximais αk de tamanho k, o número total de cliques maximais α e a clique máxima de um grafo círculo em tempo paralelo O(log2 n) com n3, nM(n) e n3 processadores, respectivamente, em uma CREW PRAM, onde M(n) é o número de processadores necessários para efetuar uma multiplicação de duas matrizes n x n.
Reports on the topic "PrAMP"
1
Kandasamy, A. Irradiation study on GEM IPC preamp/shaper. Office of Scientific and Technical Information (OSTI), January 1995. http://dx.doi.org/10.2172/28413.
Full text
2
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
3
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
4
Robles, Edgar A. Haiti Pension System: Recommendations to Improve the Regulation. Inter-American Development Bank, March 2018. http://dx.doi.org/10.18235/0003598.
Full textAbstract:
This tenth document of the PLAC Network Technical Assistance Document Series, entitled “Haiti pension system - Recommendations to improve the regulation”, provides general recommendations for the regulatory framework of the pension system in Haiti and tries to identify broad key policy options to improve the performance of the pension system. The policies are directed to strengthen and harmonize the rules of governance for the Office Nationale d'Assurance-Vieillesse (ONA), which covers private salaried workers, and the Plan de Retraite de l'Administration Publique (PRAP), to increase their capacity to manage risks, facilitate supervision of pension funds, improve sustainability, adequacy and equity, and establish guidelines for investments policies.