186,471 research outputs found
De Eo Qvod Ivstvm Est Circa Festvm S. Archangeli Michaelis : Programma Sollemni Die Anniversario S. Michaelis A. R. S. MDCCLXII In Academia Ivlia Carolina P. P
No full textHelmstedt, Universität, Universitätsprogramm, 1762[Academiae Ivliae Carolinae Prorector D. Iohannes Iacobvs Hoefler ...]Teilw. in griech. Schr.Fingerprint nach Ex. der HAB Wolfenbüttel und der ULB Sachsen-AnhaltVorlageform des Erscheinungsvermerks: HelmstadI Litteris Vidvae B. Schnorrii Acad. Typogr. - Erscheinungsjahr nach der Datierung im Titel bestimm
Układ do zabezpieczenia napędu dźwignicowego opis patentowy nr 128466 /
No full textTyt. z ekranu tyt.Zgłoszono 17 października 1979 r.Zgłoszenie ogłoszono 24 kwietnia 1981 r.Opublikowano 30 listopada 1985 r.Pozostali twórcy wynalazku: Jerzy Cholewka, Zbigniew Kulski, Norbert Hoefler, Janusz Grzegorski, Wacław Paściak.Nr zgłoszenia P. 219046.Dostępny także w wersji drukowanej.Tryb dostępu: Internet
Indirection Stream Semantic Register Architecture for Efficient Sparse-Dense Linear Algebra
No full textSparse-dense linear algebra is crucial in many domains, but challenging to handle efficiently on CPUs, GPUs, and accelerators alike; multiplications with sparse formats like CSR and CSF require indirect memory lookups. In this work, we enhance a memory-streaming RISC-V ISA extension to accelerate sparse-dense products through streaming indirection. We present efficient dot, matrix-vector, and matrix-matrix product kernels using our hardware, enabling single-core FPU utilizations of up to 80% and speedups of up to 7.2x over an optimized baseline without extensions. A matrix-vector implementation on a multicore cluster is up to 5.8x faster and 2.7x more energy-efficient with our kernels than an optimized baseline. We propose further uses for our indirection hardware, such as scatter-gather operations and codebook decoding, and compare our work to state-of-the-art CPU, GPU, and accelerator approaches, measuring a 2.8x higher peak FP64 utilization in CSR matrix-vector multiplication than a GTX 1080 Ti GPU running a cuSPARSE kernel
Mitigating Network Noise on Dragonfly Networks through Application-Aware Routing (code, data and scripts to reproduce paper results)
No full text<p>This repository contains the data, code, and scripts required to reproduce the results of the paper "Mitigating Network Noise on Dragonfly Networks through Application-Aware Routing" by Daniele De Sensi, Salvatore Di Girolamo and Torsten Hoefler, presented at the 2019 International Conference for High Performance Computing, Networking, Storage, and Analysis. </p>
<p>This repository does not contains the code of the library used to automatically tune the routing algorithm, which can be found at http://doi.org/10.5281/zenodo.3372785</p>
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
No full textBetweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths
leading through it. We propose Maximal Frontier Betweenness Centrality (MFBC): a succinct BC algorithm based on novel sparse matrix multiplication routines that performs a factor of p 1/3 less communication on p processors than the best known alternatives, for
graphs withn vertices and average degree k = n/p 2/3. We formulate, implement, and prove the correctness of MFBC for weighted graphs by leveraging monoids instead of semirings, which enables a surprisingly succinct formulation. MFBC scales well for both extremely sparse and relatively dense graphs. It automatically searches a space of distributed data decompositions and sparse matrix multiplication algorithms for the most advantageous configuration. The MFBC implementation outperforms the well-known CombBLAS library by up to 8x and shows more robust performance. Our design methodology is readily extensible to other graph problems
Sposób sterowania napędu dźwignicowego z przemiennikiem częstotliwości oraz układ sterowania napędu dźwignicowego z przemiennikiem częstotliwości opis patentowy nr 127625 /
No full textZgłoszono 30 listopada 1979 r.Zgłoszenie ogłoszono 5 czerwca 1981 r.Opublikowano 30 listopada 1985 r.Nr zgłosz. P 220071.Tyt. z ekranu tyt.Pozostali współtwórcy wynalazku: Henryk Zygmunt, Jerzy Cholewka, Zbigniew Kulski, Norbert Hoefler, Marian Rohde, Janusz Grzegorski.Dostępny także w wersji drukowanej.Tryb dostępu: Internet
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
