Готові списки джерел за темами / Parallel sets

Добірка наукової літератури з теми "Parallel sets"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Parallel sets".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Parallel sets"

Arvind, V., and Jacobo Torán. "Sparse sets, approximable sets, and parallel queries to NP." Information Processing Letters 69, no. 4 (February 1999): 181–88. http://dx.doi.org/10.1016/s0020-0190(99)00008-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Crombez, G. "Parallel methods in image recovery by projections onto convex sets." Czechoslovak Mathematical Journal 42, no. 3 (1992): 445–50. http://dx.doi.org/10.21136/cmj.1992.128355.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Schröder, Bernd S. W. "The Automorphism Conjecture for Small Sets and Series Parallel Sets." Order 22, no. 4 (November 2005): 371–87. http://dx.doi.org/10.1007/s11083-005-9024-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Creţu, Eugen. "Parallel processing for fuzzy sets operations." Fuzzy Sets and Systems 130, no. 3 (September 2002): 305–20. http://dx.doi.org/10.1016/s0165-0114(01)00177-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mantharam, M., and P. J. Eberlein. "New Jacobi-sets for parallel computations." Parallel Computing 19, no. 4 (April 1993): 437–54. http://dx.doi.org/10.1016/0167-8191(93)90056-q.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

-Z. Chen, Z., and X. He. "Parallel Algorithms for Maximal Acyclic Sets." Algorithmica 19, no. 3 (November 1997): 354–68. http://dx.doi.org/10.1007/pl00009178.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dennig, Frederik L., Maximilian T. Fischer, Michael Blumenschein, Johannes Fuchs, Daniel A. Keim, and Evanthia Dimara. "ParSetgnostics: Quality Metrics for Parallel Sets." Computer Graphics Forum 40, no. 3 (June 2021): 375–86. http://dx.doi.org/10.1111/cgf.14314.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

HARALAMBIDES, JAMES, and SPYROS TRAGOUDAS. "BIPARTITIONING INTO OVERLAPPING SETS." International Journal of Foundations of Computer Science 06, no. 01 (March 1995): 67–88. http://dx.doi.org/10.1142/s0129054195000068.

Повний текст джерела

Анотація:

We consider a generalization of the min-cut partitioning problem where we partition a graph G=(V,E) into two sets V1 and V2 such that |V1∩V2|≤d, d<|V|, and such that |{(u, v)|u∈V1−V2, v∈V2−V1}| is minimized. The problem is trivially solvable using flow techniques for any fixed d, but we show that it is NP-hard for integer values of d. It remains NP-hard if we impose restrictions on the size of V1, i.e., |V1|=k, k∈Z+. The latter problem variation may apply in VLSI layout and hypertext partitioning. We present polynomial time algorithms for the special cases of solid grids and series-parallel graphs. Series-parallel graphs find applications in hypertext partitioning whereas grid graphs model the mapping of a class of Partial Differential Equation computations into parallel machines.

Стилі APA, Harvard, Vancouver, ISO та ін.

Balasubramanian, Hari, John Fowler, Ahmet Keha, and Michele Pfund. "Scheduling interfering job sets on parallel machines." European Journal of Operational Research 199, no. 1 (November 2009): 55–67. http://dx.doi.org/10.1016/j.ejor.2008.10.038.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Stephensen, Hans J. T., Anne Marie Svane, Carlos B. Villanueva, Steven A. Goldman, and Jon Sporring. "Measuring Shape Relations Using r-Parallel Sets." Journal of Mathematical Imaging and Vision 63, no. 8 (June 26, 2021): 1069–83. http://dx.doi.org/10.1007/s10851-021-01041-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Parallel sets"

Beck, John. "Interactive Visualization of Categorical Data Sets." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/950.

Повний текст джерела

Анотація:

Many people in widely varied fields are exposed to categorical data describing myriad observations. The breadth of applications in which categorical data are used means that many of the people tasked to apply these data have not been trained in data analysis. Visualization of data is often used to alleviate this problem since visualization can convey relevant information in a non-mathematical manner. However, visualizations are frequently static and the tools to create them are largely geared towards quantitative data. It is the purpose of this thesis to demonstrate a method which expands on the parallel coordinates method of visualization and uses a 'Google Maps' style of interaction and view dependent data presentation for visualizing and exploring categorical data that is accessible by non-experts and promotes the use of domain specific knowledge. The parallel coordinates method has enjoyed increasing popularity in recent times, but has several shortcomings. This thesis seeks to address some of these problems in a manner which involves not just addressing the final static image which is generated, but the paradigm of interaction as well.

Стилі APA, Harvard, Vancouver, ISO та ін.

Neumann, Christoph [Verfasser], and O. [Akademischer Betreuer] Stein. "Inner Parallel Sets in Mixed-Integer Optimization / Christoph Neumann ; Betreuer: O. Stein." Karlsruhe : KIT-Bibliothek, 2021. http://d-nb.info/1238147720/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rawald, Tobias. "Scalable and Efficient Analysis of Large High-Dimensional Data Sets in the Context of Recurrence Analysis." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/18797.

Повний текст джерела

Анотація:

Die Recurrence Quantification Analysis (RQA) ist eine Methode aus der nicht-linearen Zeitreihenanalyse. Im Mittelpunkt dieser Methode steht die Auswertung des Inhalts sogenannter Rekurrenzmatrizen. Bestehende Berechnungsansätze zur Durchführung der RQA können entweder nur Zeitreihen bis zu einer bestimmten Länge verarbeiten oder benötigen viel Zeit zur Analyse von sehr langen Zeitreihen. Diese Dissertation stellt die sogenannte skalierbare Rekurrenzanalyse (SRA) vor. Sie ist ein neuartiger Berechnungsansatz, der eine gegebene Rekurrenzmatrix in mehrere Submatrizen unterteilt. Jede Submatrix wird von einem Berechnungsgerät in massiv-paralleler Art und Weise untersucht. Dieser Ansatz wird unter Verwendung der OpenCL-Schnittstelle umgesetzt. Anhand mehrerer Experimente wird demonstriert, dass SRA massive Leistungssteigerungen im Vergleich zu existierenden Berechnungsansätzen insbesondere durch den Einsatz von Grafikkarten ermöglicht. Die Dissertation enthält eine ausführliche Evaluation, die den Einfluss der Anwendung mehrerer Datenbankkonzepte, wie z.B. die Repräsentation der Eingangsdaten, auf die RQA-Verarbeitungskette analysiert. Es wird untersucht, inwiefern unterschiedliche Ausprägungen dieser Konzepte Einfluss auf die Effizienz der Analyse auf verschiedenen Berechnungsgeräten haben. Abschließend wird ein automatischer Optimierungsansatz vorgestellt, der performante RQA-Implementierungen für ein gegebenes Analyseszenario in Kombination mit einer Hardware-Plattform dynamisch bestimmt. Neben anderen Aspekten werden drastische Effizienzgewinne durch den Einsatz des Optimierungsansatzes aufgezeigt.
Recurrence quantification analysis (RQA) is a method from nonlinear time series analysis. It relies on the identification of line structures within so-called recurrence matrices and comprises a set of scalar measures. Existing computing approaches to RQA are either not capable of processing recurrence matrices exceeding a certain size or suffer from long runtimes considering time series that contain hundreds of thousands of data points. This thesis introduces scalable recurrence analysis (SRA), which is an alternative computing approach that subdivides a recurrence matrix into multiple sub matrices. Each sub matrix is processed individually in a massively parallel manner by a single compute device. This is implemented exemplarily using the OpenCL framework. It is shown that this approach delivers considerable performance improvements in comparison to state-of-the-art RQA software by exploiting the computing capabilities of many-core hardware architectures, in particular graphics cards. The usage of OpenCL allows to execute identical SRA implementations on a variety of hardware platforms having different architectural properties. An extensive evaluation analyses the impact of applying concepts from database technology, such memory storage layouts, to the RQA processing pipeline. It is investigated how different realisations of these concepts affect the performance of the computations on different types of compute devices. Finally, an approach based on automatic performance tuning is introduced that automatically selects well-performing RQA implementations for a given analytical scenario on specific computing hardware. Among others, it is demonstrated that the customised auto-tuning approach allows to considerably increase the efficiency of the processing by adapting the implementation selection.

Стилі APA, Harvard, Vancouver, ISO та ін.

Longoni, Gianluca. "Advanced quadrature sets, acceleration and preconditioning techniques for the discrete ordinates method in parallel computing environments." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0007560.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hammond, Gregory Alan. "The instrumentation of a parallel, distributed database operation, retrieve-common, for merging two large sets of records." Thesis, Monterey, Calif. : Naval Postgraduate School, 1992. http://handle.dtic.mil/100.2/ADA247486.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shariati, Saeed. "A solver for sets of linear systems for neural network simuations in CUDA." reponame:Repositório Institucional da UFABC, 2014.

Знайти повний текст джерела

Анотація:

Orientador: Prof. Raphael Yokoingawa de Camargo
Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Neurociência e Cognição, 2014.
Nowadays, utilizing co-processors, accelerators and specially GPGPU computation are widely accepted as a new paradigm of High Performance Computing (HPC). However, developing softwares that can utilize available resources still remains a challenging task. In other side, scientist have used legacy CPU-based simulators for decades and many of them are still the main tools in different fields of science. In fact, any activity that can combine the legacy simulators with powerful co-processors devices is in the main interest. In this project, we design and develop a simulation engine, Parallel Neural Network Simulator (PN2S), to communicate with MOOSE simulator (A well-known tools by Neuroscientists) and provide CUDA based execution for simulating realistic neural network models. The simulation engine maps the voltage distribution in neuron¿s body to sets of linear systems and solve them on GPU. To provide usable functionality, we also developed solver for active channels which support Hodgkin-Huxley model of ionic channels. We compared the engine with CPU version for both homogeneous simple models and randomly generated heterogeneous network. The evaluation focused on performance and also covered the accuracy of the simulation. The experimental results, showed that by facilitating PN2S engine, we can significantly increase the performance of a simulation engine, since its execution is quite transparent to the users and major parts of the host simulator.

Стилі APA, Harvard, Vancouver, ISO та ін.

Powell, S. Jacob. "ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion." BYU ScholarsArchive, 2020. https://scholarsarchive.byu.edu/etd/8659.

Повний текст джерела

Анотація:

Data race in parallel programs can be difficult to precisely detect, and doing so manually can often prove unsuccessful. Task parallel programming models can help reduce defects introduced by the programmer by restricting concurrent functionalities to fork-join operations. Typical data race detection algorithms compute the happens-before relation either by tracking the order that shared accesses happen via a vector clock counter, or by grouping events into sets that help classify which heap locations are accessed sequentially or in parallel. Access sets are simple and efficient to compute, and have been shown to have the potential to outperform vector clock approaches in certain use cases. However, they do not support arbitrary thread synchronization, are limited to fork-join or similar structures, and do not support mutual exclusion. Vector clock approaches do not scale as well to many threads with many shared interactions, rendering them inefficient in many cases. This work combines the simplicity of access sets with the generality of vector clocks by grouping heap accesses into access sets, and attaching the vector clock counter to those groupings. By combining these two approaches, access sets can be utilized more generally to support programs that contain mutual exclusion. Additionally, entire blocks can be ordered with each other rather than single accesses, producing a much more efficient algorithm for data race detection. This novel algorithm, ZipperOTF, is compared to the Computation Graph algorithm (an access set algorithm) as well as FastTrack (a vector clock algorithm) to show comparisons in empirical results and in both time and space complexity.

Стилі APA, Harvard, Vancouver, ISO та ін.

Castro, Jose R. "MODIFICATIONS TO THE FUZZY-ARTMAP ALGORITHM FOR DISTRIBUTED LEARNING IN LARGE DATA SETS." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4449.

Повний текст джерела

Анотація:

The Fuzzy-ARTMAP (FAM) algorithm is one of the premier neural network architectures for classification problems. FAM can learn on line and is usually faster than other neural network approaches. Nevertheless the learning time of FAM can slow down considerably when the size of the training set increases into the hundreds of thousands. In this dissertation we apply data partitioning and network partitioning to the FAM algorithm in a sequential and parallel setting to achieve better convergence time and to efficiently train with large databases (hundreds of thousands of patterns). We implement our parallelization on a Beowulf clusters of workstations. This choice of platform requires that the process of parallelization be coarse grained. Extensive testing of all the approaches is done on three large datasets (half a million data points). One of them is the Forest Covertype database from Blackard and the other two are artificially generated Gaussian data with different percentages of overlap between classes. Speedups in the data partitioning approach reached the order of the hundreds without having to invest in parallel computation. Speedups on the network partitioning approach are close to linear on a cluster of workstations. Both methods allowed us to reduce the computation time of training the neural network in large databases from days to minutes. We prove formally that the workload balance of our network partitioning approaches will never be worse than an acceptable bound, and also demonstrate the correctness of these parallelization variants of FAM.
Ph.D.
School of Electrical and Computer Engineering
Engineering and Computer Science
Electrical and Computer Engineering

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Chaoli. "A multiresolutional approach for large data visualization." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164730737.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Varduhn, Vasco [Verfasser], Ernst [Akademischer Betreuer] Rank, and Hans-Joachim [Akademischer Betreuer] Bungartz. "A Parallel, Multi-Resolution Framework for Handling Large Sets of Complex Data, from Exploration and Visualisation to Simulation / Vasco Varduhn. Gutachter: Hans-Joachim Bungartz ; Ernst Rank. Betreuer: Ernst Rank." München : Universitätsbibliothek der TU München, 2014. http://d-nb.info/1052307833/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Parallel sets"

Hanrahan, Rotan B. W. The setcube calculus of value sets: A new paradigm of parallel test generation for combinational circuits. Dublin: University College Dublin, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shaharuddin, Salleh. Scheduling in parallel computing systems: Fuzzy and annealing techniques. Boston: Kluwer Academic, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vasilʹev, V. V. Seti Petri, parallelʹnye algoritmy i modeli mulʹtiprot͡s︡essornykh sistem. Kiev: Nauk. dumka, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Parallel Sets. 1 Oliver’s Yard, 55 City Road, London EC1Y 1SP United Kingdom: SAGE Publications, Ltd., 2021. http://dx.doi.org/10.4135/9781529776263.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

National Aeronautics and Space Administration NASA. Generating local addresses and communication sets for data-parallel programs. Independently published, 2018.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Generating local addresses and communication sets for data-parallel programs. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Siddhartha, Chatterjee, and Research Institute for Advanced Computer Science (U.S.), eds. Generating local addresses and communication sets for data-parallel programs. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Capussela, Andrea Lorenzo. Continuity and Instability: The Spiral Sets In. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198796992.003.0008.

Повний текст джерела

Анотація:

This chapter reviews the 1964–79 period, during which the social tensions accumulated over the previous decades erupted, a wave of political violence without parallel in Europe shook the country, and the steep rise of labour’s bargaining power caused a persistent wage shock. Political consensus was sustained by spending policies aimed at particularistic inclusion, leading to both a fragmented welfare system and growing budget deficits, which were largely monetized. Driven also by a challenging international environment, macroeconomic disequilibria accumulated. Although the country’s institutions were increasingly inappropriate, TFP growth and Italy’s convergence to the productivity frontier nonetheless continued, sustained also by the rise of industrial districts. Several mutually reinforcing vicious circles set in, however: the collusion between political and economic elites intensified, clientelism and corruption rose, organized crime strengthened, and after two decades of convergence the South resumed its decline relative to the rest of the country.

Стилі APA, Harvard, Vancouver, ISO та ін.

J, Drago Raymond, United States. National Aeronautics and Space Administration., and U.S. Army Research Laboratory., eds. The relative noise levels of parallel axis gear sets with various contact ratios and gear tooth forms. [Washington, DC]: National Aeronautics and Space Administration, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques (The International Series in Engineering and Computer Science). Springer, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Parallel sets"

Knudsen, Svend Erik. "Statement-sets." In Parallel Computation, 161–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61695-0_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Muraszkiewicz, Mieczyslaw, and Henryk Rybinski. "Towards a Parallel Rough Sets Computer." In Rough Sets, Fuzzy Sets and Knowledge Discovery, 434–43. London: Springer London, 1994. http://dx.doi.org/10.1007/978-1-4471-3238-7_51.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cao, Qian, Chuan Luo, Tianrui Li, and Hongmei Chen. "Spark Accelerated Implementation of Parallel Attribute Reduction from Incomplete Data." In Rough Sets, 203–17. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87334-9_17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Arvind, Vikraman, and Jacobo Torán. "Sparse Sets, Approximable Sets, and Parallel Queries to NP." In STACS 99, 281–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49116-3_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pei, Minghua, Dayong Deng, and Houkuan Huang. "Parallel Reducts: A Hashing Approach." In Rough Sets and Knowledge Technology, 229–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41299-8_22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Joisha, Pramod G., and Prithviraj Banerjee]. "Exploiting Ownership Sets in HPF." In Languages and Compilers for Parallel Computing, 259–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45574-4_17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Susmaga, Robert. "Parallel Computation of Reducts." In Rough Sets and Current Trends in Computing, 450–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69115-4_62.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Henry, Christopher J., and Sheela Ramanna. "Parallel Computation in Finding Near Neighbourhoods." In Rough Sets and Knowledge Technology, 523–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24425-4_67.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xi, Dachao, Guoyin Wang, Xuerui Zhang, and Fan Zhang. "Parallel Attribute Reduction Based on MapReduce." In Rough Sets and Knowledge Technology, 631–41. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11740-9_58.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Matoušek, Jiří. "Low-Discrepancy Sets for Axis-Parallel Boxes." In Geometric Discrepancy, 37–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-03942-3_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Parallel sets"

Fineman, Jeremy T., Calvin Newport, Micah Sherr, and Tonghe Wang. "Fair Maximal Independent Sets." In 2014 IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2014. http://dx.doi.org/10.1109/ipdps.2014.79.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rosenberg, Robert O., Marco O. Lanzagorta, Almadena Chtchelkanova, and Alexei Khokhlov. "Parallel visualization of large data sets." In Electronic Imaging, edited by Robert F. Erbacher, Philip C. Chen, Jonathan C. Roberts, and Craig M. Wittenbrink. SPIE, 2000. http://dx.doi.org/10.1117/12.378889.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Blelloch, Guy E., Daniel Ferizovic, and Yihan Sun. "Just Join for Parallel Ordered Sets." In SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2935764.2935768.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yin, Xianjun, Chao Cai, Houjun Wang, and Dongwu Li. "Route constraints model based on polychromatic sets." In Parallel Processing of Images and Optimization Techniques, edited by Hong Sun, Henri Maître, and Bruce Hirsch. SPIE, 2018. http://dx.doi.org/10.1117/12.2288325.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shachnai, Hadas, and Aravind Srinivasan. "Finding large independent sets of hypergraphs in parallel." In the thirteenth annual ACM symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/378580.378622.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Camp, David, Hank Childs, Christoph Garth, David Pugmire, and Kenneth I. Joy. "Parallel stream surface computation for large data sets." In 2012 IEEE Symposium on Large Data Analysis and Visualization (LDAV). IEEE, 2012. http://dx.doi.org/10.1109/ldav.2012.6378974.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

AJWA, IYAD A., PAUL S. WANG, and DONGDAI LIN. "ANOTHER ATTEMPT FOR PARALLEL COMPUTATION OF CHARACTERISTIC SETS." In Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Franklin, W. Randolph, and Salles V. G. Magalhães. "Parallel intersection detection in massive sets of cubes." In SIGSPATIAL'17: 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3150919.3150921.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kovacs, Levente. "Parallel multi-tree indexing for evaluating large descriptor sets." In 2013 11th International Workshop on Content-Based Multimedia Indexing (CBMI). IEEE, 2013. http://dx.doi.org/10.1109/cbmi.2013.6576581.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ehrhardt, Matthias J., Kris Thielemans, Luis Pizarro, Pawel Markiewicz, David Atkinson, Sebastien Ourselin, Brian F. Hutton, and Simon R. Arridge. "Joint reconstruction of PET-MRI by parallel level sets." In 2014 IEEE Nuclear Science Symposium and Medical Imaging Conference (NSS/MIC). IEEE, 2014. http://dx.doi.org/10.1109/nssmic.2014.7430895.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Parallel sets"

Paulen, R. C., J. M. Rice, and M. Ross. Surficial geology, Lac aux Goélands, Quebec, NTS 23-P southeast. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/328291.

Повний текст джерела

Анотація:

The Lac aux Goélands area is of moderate relief characterized by till blankets in the lowlands and till veneers with large expanses of bedrock outcrops in the western and eastern margins. Bedrock was variably eroded by the Laurentide Ice Sheet, east of the Ancestral Labrador ice divide. Phases of ice flow imparted multiple sets of glacially streamlined landforms and erosional paleo-flow indicators on the landscape. However, the dominant eastward-trending, elongated streamlined landforms were formed by ice streaming during deglaciation. Multiple sets of discordant meltwater channels were formed from both an early phase of deglaciation, which fed into an eastward-trending esker network, and a subsequent late-phase ablation of the ice sheet, with north-south trending channels parallel to the retreating ice margin. Glaciolacustrine strandlines and littoral sediments within the upper George River basin mark the former northeastern extent of inundation of the earliest phase of glacial Lake Naskaupi.

Стилі APA, Harvard, Vancouver, ISO та ін.

Griffin, Joshua D., and Tamara Gibson Kolda. Nonlinearly-constrained optimization using asynchronous parallel generating set search. Office of Scientific and Technical Information (OSTI), May 2007. http://dx.doi.org/10.2172/909393.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lewis, Robert Michael, ), Joshua D. Griffin, and Tamara Gibson Kolda. Asynchronous parallel generating set search for linearly-constrained optimization. Office of Scientific and Technical Information (OSTI), August 2006. http://dx.doi.org/10.2172/891372.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kolda, Tamara G., Joshua Griffin, and Robert Michael Lewis. Asynchronous parallel generating set search for linearly-constrained optimization. Office of Scientific and Technical Information (OSTI), April 2007. http://dx.doi.org/10.2172/1139970.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Levine, D. A parallel genetic algorithm for the set partitioning problem. Office of Scientific and Technical Information (OSTI), December 1996. http://dx.doi.org/10.2172/435291.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Levine, D. A parallel genetic algorithm for the set partitioning problem. Office of Scientific and Technical Information (OSTI), May 1994. http://dx.doi.org/10.2172/10161119.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Middleton, Don, and Mary Haley. Parallel analysis tools and new visualization techniques for ultra-large climate data set. Office of Scientific and Technical Information (OSTI), December 2014. http://dx.doi.org/10.2172/1165225.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Heifetz, Yael, and Michael Bender. Success and failure in insect fertilization and reproduction - the role of the female accessory glands. United States Department of Agriculture, December 2006. http://dx.doi.org/10.32747/2006.7695586.bard.

Повний текст джерела

Анотація:

The research problem. Understanding of insect reproduction has been critical to the design of insect pest control strategies including disruptions of mate-finding, courtship and sperm transfer by male insects. It is well known that males transfer proteins to females during mating that profoundly affect female reproductive physiology, but little is known about the molecular basis of female mating response and no attempts have yet been made to interfere with female post-mating responses that directly bear on the efficacy of fertilization. The female reproductive tract provides a crucial environment for the events of fertilization yet thus far those events and the role of the female tract in influencing them are poorly understood. For this project, we have chosen to focus on the lower reproductive tract because it is the site of two processes critical to reproduction: sperm management (storage, maintenance, and release from storage) and fertilization. E,fforts during this project period centered on the elucidation of mating responses in the female lower reproductive tract The central goals of this project were: 1. To identify mating-responsive genes in the female lower reproductive tract using DNA microarray technology. 2. In parallel, to identify mating-responsive genes in these tissues using proteomic assays (2D gels and LC-MS/MS techniques). 3. To integrate proteomic and genomic analyses of reproductive tract gene expression to identify significant genes for functional analysis. Our main achievements were: 1. Identification of mating-responsive genes in the female lower reproductive tract. We identified 539 mating-responsive genes using genomic and proteomic approaches. This analysis revealed a shift from gene silencing to gene activation soon after mating and a peak in differential gene expression at 6 hours post-mating. In addition, comparison of the two datasets revealed an expression pattern consistent with the model that important reproductive proteins are pre-programmed for synthesis prior to mating. This work was published in Mack et al. (2006). Validation experiments using real-time PCR techniques suggest that microarray assays provide a conservativestimate of the true transcriptional activity in reproductive tissues. 2.lntegration of proteomics and genomics data sets. We compared the expression profiles from DNA microarray data with the proteins identified in our proteomic experiments. Although comparing the two data sets poses analyical challenges, it provides a more complete view of gene expression as well as insights into how specific genes may be regulated. This work was published in Mack et al. (2006). 3. Development of primary reproductive tract cell cultures. We developed primary cell cultures of dispersed reproductive tract cell types and determined conditions for organ culture of the entire reproductive tract. This work will allow us to rapidly screen mating-responsive genes for a variety of reproductive-tract specifi c functions. Scientific and agricultural significance. Together, these studies have defined the genetic response to mating in a part of the female reproductive tract that is critical for successful fertllization and have identified alarge set of mating-responsive genes. This work is the first to combine both genomic and proteomic approaches in determining female mating response in these tissues and has provided important insights into insect reproductive behavior.

Стилі APA, Harvard, Vancouver, ISO та ін.

McDonald, John F. F-RISC- A 1.0 GOPS Fast Reduced Instruction Set Computer for Super Workstation and Teraops Parallel Processor Applications. Fort Belvoir, VA: Defense Technical Information Center, April 2001. http://dx.doi.org/10.21236/ada394207.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Amela, R., R. Badia, S. Böhm, R. Tosi, C. Soriano, and R. Rossi. D4.2 Profiling report of the partner’s tools, complete with performance suggestions. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.023.

Повний текст джерела

Анотація:

This deliverable focuses on the proling activities developed in the project with the partner's applications. To perform this proling activities, a couple of benchmarks were dened in collaboration with WP5. The rst benchmark is an embarrassingly parallel benchmark that performs a read and then multiple writes of the same object, with the objective of stressing the memory and storage systems and evaluate the overhead when these reads and writes are performed in parallel. A second benchmark is dened based on the Continuation Multi Level Monte Carlo (C-MLMC) algorithm. While this algorithm is normally executed using multiple levels, for the proling and performance analysis objectives, the execution of a single level was enough since the forthcoming levels have similar performance characteristics. Additionally, while the simulation tasks can be executed as parallel (multi-threaded tasks), in the benchmark, single threaded tasks were executed to increase the number of simulations to be scheduled and stress the scheduling engines. A set of experiments based on these two benchmarks have been executed in the MareNostrum 4 supercomputer and using PyCOMPSs as underlying programming model and dynamic scheduler of the tasks involved in the executions. While the rst benchmark was executed several times in a single iteration, the second benchmark was executed in an iterative manner, with cycles of 1) Execution and trace generation; 2) Performance analysis; 3) Improvements. This had enabled to perform several improvements in the benchmark and in the scheduler of PyCOMPSs. The initial iterations focused on the C-MLMC structure itself, performing re-factors of the code to remove ne grain and sequential tasks and merging them in larger granularity tasks. The next iterations focused on improving the PyCOMPSs scheduler, removing existent bottlenecks and increasing its performance by making the scheduler a multithreaded engine. While the results can still be improved, we are satised with the results since the granularity of the simulations run in this evaluation step are much ner than the one that will be used for the real scenarios. The deliverable nishes with some recommendations that should be followed along the project in order to obtain good performance in the execution of the project codes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!