Search results for "Parallel"

Chimney and Periscope Grafts Observed Over 2 Years After Their Use to Revascularize 169 Renovisceral Branches in 77 Patients With Complex Aortic Aneu…

2013

Purpose: To evaluate the performance of periscope and/or chimney grafts (CPGs) in the endovascular treatment of pararenal or thoracoabdominal aneurysms using off-the-shelf devices. Methods: Between February 2002 and August 2012, 77 consecutive patients (62 men; mean age 7369 years) suffering from pararenal aortic (n¼55), thoracoabdominal (n¼16), or arch to visceral artery aneurysms (n¼6) were treated with aortic stent-graft implantation requiring chimney and/or periscope grafts to maintain side branch perfusion. CPGs were planned in advance and were not used as bailout. A standardized follow-up protocol including computed tomographic angiography, laboratory testing, and clinical examination…

Władysław Stanisław Reymont i Maksym Gorki w perspektywie biograficznej

2016

This paper is an attempt to present the numerous analogies in Władysław Stanisław Reymont‘s and Maxim Gorky‘s outlook on life. It seems that the affinity is partially determined by the coincident biographies of both writers. In literary studies thematic parallels in the writers‘ prose works are frequently mentioned. The paper constitutes a continuation thereof, presenting the problems from a biographical perspective. The paper dedicated to the Polish-Russian literary relations at the turn of the nineteenth and twentieth centuries belongs to the area of comparative studies.

On GPU-accelerated fast direct solvers and their applications in image denoising

2015

Parallel distance transforms on pyramid machines: Theory and implementation

1990

Abstract A distance transform of a binary image is an array each of whose elements gives the distance from the corresponding pixel to the closest ‘1’ in the binary image. Distance transforms have uses in image matching and shape analysis, among other applications. We present a parallel algorithm for weighted distance transforms that runs particularly efficiently on hierarchical cellular-logic machines, a subclass of the architectures known as pyramid machines. The algorithm computes the 3–4 distance transform; however it can be readily adapted to the city-block (‘Manhattan’) and chessboard distance measures. The algorithm runs in O(M) time, for an M × M image. Since it avoids using arithmet…

Anomaly‐based intrusion detection systems: The requirements, methods, measurements, and datasets

2021

International audience; With the Internet's unprecedented growth and nations' reliance on computer networks, new cyber‐attacks are created every day as means for achieving financial gain, imposing political agendas, and developing cyberwarfare arsenals. Network security is thus acquiring increasing attention among researchers, practitioners, network architects, policy makers, and others. To defend organizations' networks from existing, foreseen, and future threats, intrusion detection systems (IDSs) are becoming a must. Existing surveys on anomaly‐based IDS (AIDS) focus on specific components such as detection mechanisms and lack many others. In contrast to existing surveys, this article co…

Multi-Authored Manuscripts and Speedup in Academic Publishing

2014

It is unfair to count a n-authored paper as one paper for each coauthor, i.e., as n papers: this is “feeding the multitude”. Sharing the credit among coauthors by percentages or by simply dividing by n is fairer but somewhat harsh. So, we propose to take into account the productivity gains of parallelization by introducing a team bonus function that multiplies the allocation thereby increasing the credit allocated to each coauthor.The degree of parallelization cannot be determined exogenously discipline by discipline. So, one may propose that each team of coauthors indicates how the labor was organized to produce the paper. Unfortunately, the coauthors may systematically bias their answers …

Efficient mesoscale hydrodynamics: Multiparticle collision dynamics with massively parallel GPU acceleration

2018

Abstract We present an efficient open-source implementation of the multiparticle collision dynamics (MPCD) algorithm that scales to run on hundreds of graphics processing units (GPUs). We especially focus on optimizations for modern GPU architectures and communication patterns between multiple GPUs. We show that a mixed-precision computing model can improve performance compared to a fully double-precision model while still providing good numerical accuracy. We report weak and strong scaling benchmarks of a reference MPCD solvent and a benchmark of a polymer solution with research-relevant interactions and system size. Our MPCD software enables simulations of mesoscale hydrodynamics at lengt…

Improving big-data automotive applications performance through adaptive resource allocation

2019

In automotive applications, connected vehicles (CVs) can collect various information (external temperature, speed, location, etc.) and send them to a central infrastructure for exploitation in a wide range of applications: Eco-Driving, fleet management, environmental monitoring, etc. Such applications are known to generate a massive volume of data that is processed in real or near real time (i.e., data streams) depending on the target application requirements. To handle this data volume, big data architectures, based on stream computing paradigm, are usually adopted. Within this paradigm, data are continuously processed by a set of operators (elementary operations) instances. Further, a str…

A PROGRAM FOR THE AUTOMATIC COMPUTING OF SOLAR GAIN OF A PARALLELEPIPED VOLUME CONSIDERING THE SHADOWS CAST ON IT BY ANY SYSTEM OF SURROUNDING PARALL…

1985

A program is given, that computes solar gain on a parallelepiped volume taking in to consideration the shadows cast by any system of surrounding parallelepiped. It contains an algorithm for the quick discarding of non shadowing volumes, for the construction of the union polygon, without repetition of overlapping shadows, and for the intersection polygon of formerly found union polygon with the shadowed faces.

Insights into the determinants of ��-sheet stability: 1H and 13C���NMR conformational investigation of three-stranded antiparallel ��-sheet-forming p…

2008

In a previous study we designed a 20-residue peptide able to adopt a significant population of a three-stranded antiparallel beta-sheet in aqueous solution (de Alba et al. [1999]Protein Sci.8, 854-865). In order to better understand the factors contributing to beta-sheet folding and stability we designed and prepared nine variants of the parent peptide by substituting residues at selected positions in its strands. The ability of these peptides to form the target motif was assessed on the basis of NMR parameters, in particular NOE data and 13Calpha conformational shifts. The populations of the target beta-sheet motif were lower in the variants than in the parent peptide. Comparative analysis…