Wyniki wyszukiwania - Biblioteka Nauki

1

Development and verification of a high-precision laser measurement system for straightness and parallelism measurement

100%

Xu P. , Li R. J. , Zhao W. K. , Chang Z. X. , Ma S. H. , Fan K. C.

Metrology and Measurement Systems

|

2021

|

tom Vol. 28, nr 3

479--495

EN

A laser measurement system for measuring straightness and parallelism error using a semiconductor laser was proposed. The designing principle of the developed system was analyzed. Addressing at the question of the divergence angle of the semiconductor laser being quite large and the reduction of measurement accuracy caused by the diffraction effect of the light spot at the long working distance, the optical structure of the system was optimized through a series of simulations and experiments. A plano-convex lens was used to collimate the laser beam and concentrate the energy distribution of the diffraction effect. The working distance of the system was increased from 2.6 m to 4.6 m after the optical optimization, and the repeatability of the displacement measurement is kept within 2.2 m in the total measurement range. The performance of the developed system was verified by measuring the straightness of a machine tool through the comparison tests with two commercial multi-degree-of-freedom measurement systems. Two different measurement methods were used to verify the measurement accuracy. The comparison results show that during the straightness measurement of the machine tool, the laser head should be fixed in front of the moving axis, and the sensing part should move with the moving table of the machine tool. Results also show that the measurement error of the straightness measurement is less than 3 m compared with the commercial systems. The developed laser measurement system has the advantages of high precision, long working distance, low cost, and suitability for straightness and parallelism error measurement.

2

Hermite spline interpolation on patches for parallelly solving the Vlasov-Poisson equation

100%

Crouseilles N. , Latu G. , Sonnendrücker E.

International Journal of Applied Mathematics and Computer Science

|

2007

|

tom 17

|

nr 3

335-349

EN

This work is devoted to the numerical simulation of the Vlasov equation using a phase space grid. In contrast to Particle-In-Cell (PIC) methods, which are known to be noisy, we propose a semi-Lagrangian-type method to discretize the Vlasov equation in the two-dimensional phase space. As this kind of method requires a huge computational effort, one has to carry out the simulations on parallel machines. For this purpose, we present a method using patches decomposing the phase domain, each patch being devoted to a processor. Some Hermite boundary conditions allow for the reconstruction of a good approximation of the global solution. Several numerical results demonstrate the accuracy and the good scalability of the method with up to 64 processors. This work is a part of the CALVI project.

3

EASEA : a generic optimization tool for GPU machines in asynchronous island model

88%

Baumes L. A. , Kruger F. , Collet P.

Computer Methods in Materials Science

|

2011

|

tom Vol. 11, No. 3

489-499

EN

Very recently, we presented an efficient implementation of Evolutionary Algorithms (EAs) using Graphics Processing Units (GPU) for solving microporous crystal structures. Because of both the inherent complexity of zeolitic materials and the constant pressure to accelerate R&D solutions, an asynchronous island model running on clusters of machines equipped with GPU cards, i.e. the current trend for super-computers and cloud computing, is presented. This last improvement of the EASEA platform allows an effortless exploitation of hierarchical massively parallel systems. It is demonstrated that supra-linear speedup over one machine and linear speedup considering clusters of different sizes are obtained. Such an island implementation over several potentially heterogeneous machines opens new horizon for various domains of application where computation time for optimization remains the principal bottleneck.

PL

W swojej poprzedniej pracy Autorzy przedstawili wydajną implementację Algorytmów Ewolucyjnych (ang. Evolutionary Algorithms - EA) z zastosowaniem procesorów graficznych (Graphics Processing Units GPU) do rozwiązywania struktur krystalicznych z mikroporami. Ze względu na skomplikowanie materiałów zeolitycznych oraz ciągłą presję na poprawę efektywności symulacji, w niniejszej pracy zaproponowano asyn-chroniczny model wyspowy na klastrach maszyn wyposażonych w karty GPU. Jest to najnowszy trend w zakresie superkomputerów oraz obliczeń w chmurze (ang. cloud computing). To ostatnie usprawnienie platformy EASEA (ang. EAsy Specification of Evolutionary Algorithms) łatwa specyfikacja algorytmów ewolucyjnych) pozwala na łatwą eksploatację rozbudowanych systemów (komputerów) masowo równoległych. Pokazano, że można osiągnąć ponadliniowe przyspieszenie w stosunku do jednej maszyny oraz liniowe przyspieszenie stosując klastery o różnych rozmiarach. Takie implementacje wyspowe dla kilku potencjalnie heterogenicznych maszyn otwiera nowe perspektywy dla różnych obszarów zastosowań, w których czasy obliczeń odgrywają kluczową rolę.

4

The Associative and Semantic Model of Folklore Thinking of Ukrainians: Forms of Parallelism in Calendar and Ritual Text

88%

Коваль Г.

Slavia Orientalis

|

2021

|

tom LXX

|

nr 3

5

Development and verification of a high-precision laser measurement system for straightness and parallelism measurement

88%

Xu P. , Li R. J. , Zhao W. K. , Chang Z. X. , Ma S. H. , Fan K. C. , Xu P. , Li R. J. , Zhao W. K. , Chang Z. X. , Ma S. H. , Fan K. C.

|

6

Modular fem framework “ModFEM” for generic scientific parallel simulations

88%

Michalik K. , Banaś K. , Płaszewski P. , Cybułka P.

Computer Science

|

2013

|

tom Vol. 14 (3)

513--528

EN

We present the design for, and implementation of, aflexible and robust parallel modular finite element (FEM) framework called ModFEM. The designis based on reusable modules which use narrow and well-defined interfaces to cooperate. At the top of the architecture, there are problem - dependent modules. Problem - - dependent modules can be additionally grouped together by“super-modules”. The structure allows for reusing the sequential code for parallel environments, and also supports solving multi-physics and multi-scale problems.

7

Adding parallelism to sequential programs : a combined method

88%

Daszczuk W. B. , Czejdo D. B. , Grześkowiak W.

International Journal of Electronics and Telecommunications

|

2024

|

tom Vol. 70, No. 1

135--144

EN

The article outlines a contemporary method for creating software for multi-processor computers. It describes the identification of parallelizable sequential code structures. Three structures were found and then carefully examined. The algorithms used to determine whether or not certain parts of code may be parallelized result from static analysis. The techniques demonstrate how, if possible, existing sequential structures might be transformed into parallel-running programs. A dynamic evaluation is also a part of our process, and it can be used to assess the efficiency of the parallel programs that are developed. As a tool for sequential programs, the algorithms have been implemented in C#. All proposed methods were discussed using a common benchmark.

8

ModFem : a computational framework for parallel adaptive finite element simulations

88%

Michalik K. , Banaś K. , Płaszewski P. , Cybułka P.

Computer Methods in Materials Science

|

2013

|

tom Vol. 13, No. 1

3--8

EN

We present the design and its' implementation for a flexible and robust modular finite element framework, called ModFem. The design is based on reusable modules which use narrow and well-defined interfaces to cooperate. At the top of the architecture there are problem dependent modules, with the main module being an incompressible flow solver. Problem dependent modules can be additionally grouped together by "super-modules", e.g. for the purpose of applying created codes for multi-physics and multi-scale problems. Additionally, the framework tries to provide suitable infrastructure for parallel computations, at the level of shared memory, as well as distributed memory systems.

PL

Autorzy prezentują koncepcję i implementację szkieletu obliczeniowego do równoległych adaptacyjnych symulacji, metodą elementów skończonych (MES), o nazwie ModFem. Głównym założeniem projektowym był podział całego szkieletu na moduły, połączone poprzez precyzyjnie zdefiniowane wąskie interfejsy. Na szczycie architektury modularnej znajduję się moduły odpowiedzialne za modelowanie konkretnych zjawisk fizycznych, w szeczególności przepływów nieściśliwych. Ponadto moduły być łączone z innymi modułami problemowymi w super-moduły, min.: w celu użycia istniejących rozwiązań podczas modelowania problemów ze sprzężeniem wielu różnych zjawisk fizycznych oraz modelowania wieloskalowego. Dodatkowo, szkielet wspiera wykorzystywanie równoległości zarówno na poziomie pamięci współdzielonej jak i rozproszonej.

9

Substructural Meta-Theory of a Type-Safe Language forWeb Programming

88%

Cervesato I. , Sans T.

Fundamenta Informaticae

|

2014

|

tom Vol. 130, nr 1

67--97

EN

This paper introduces an abstract web programming language, QWeSST, and a methodology for proving properties of formalisms, such are QWeSST, that are parallel, distributed and concurrent. At its core, QWeSST is a small functional programming language extended with primitives for mobile code and remote procedure calls, two distinguishing features of web programming. It supports a localized view of typechecking and of evaluation, which reflects the way we program web applications and web services. We have developed a prototype implementation for QWeSST and used it to elegantly write simple web applications that are however not easily expressed using current web technology. We give two semantics for QWeSST, one is standard and models a naive form of single-threaded evaluation, the other is maximally parallel and exploits a presentation of its typing and execution behaviors based on an extended form of substructural operational semantics. It augments standard inference rules with a construction that realizes parametric multiset comprehension, which makes it convenient to capture ensemble-level behaviors. We prove that both semantics are type safe, the former using traditional methods, the latter by developing a proof methodology that parallels the multiset-oriented presentation of the semantics.

10

Algorytmy i pomiary odchyłek równoległości i prostopadłości płaszczyzn i prostych w przestrzeni R3 na współrzędnościowej maszynie pomiarowej

75%

Filipowski R. , Lechniak Z. , Zawora J.

Obróbka Metalu

|

2018

|

tom nr 1

32--41

PL

Przedstawiono algorytmy obliczania odchyłek w mm/m równoległości i prostopadłości płaszczyzn i prostych na współrzędnościowej maszynie pomiarowej (WMP). Obliczane odchyłki muszą mieścić się w polu tolerancji równoległości lub prostopadłości zadawanych przez konstruktora na powierzchniach części maszyn. Tolerancje równoległości i prostopadłości oznaczone są na rysunkach w ramce prostokątnej i zawierają symbol równoległości lub prostopadłości oraz graniczną wartość odchyłki w mm względem jednej bazy lub dwóch baz. W artykule zamieszczono wartości odchyłek równoległości i prostopadłości płaszczyzn i prostych w mm/m mierzonych na maszynie współrzędnościowej WMP sztywną głowicą pomiarową.

EN

Algorithms and measurements of deviations of parallelism and perpendicularity planes and straight lines in r3 space on a coordinate measuring machine The algorithms for calculating deviations in mm/m of parallelism and perpendicularity of planes and straight lines on a coordinate measuring machine (CMM) are presented. Calculated deviations must be within the tolerance of parallelism or rectangularity given by the constructor on the surfaces of machine parts. Tolerances of parallelism and rectangularness are marked on the drawings in a rectangular frame and contain the symbol of parallelism or perpendicularity and the limit value of deviation in mm relative to one base or two bases. In the paper, deviations of parallelism and perpendicularity of planes and straight lines in mm/m measured on the CMM coordinate machine with rigid measuring head were placed.

11

Extracting representative loop statement instances of synchronization-free slices

75%

Bielecki W. , Palkowski M. , Beletska A.

Pomiary Automatyka Kontrola

|

2009

|

tom R. 55, nr 10

807-810

EN

Extracting synchronization-free parallelism by means of the Iteration Space Slicing Framework consists of two steps. First, representative loop statement instances of slices are extracted. Next, slices are reconstructed from their representatives and parallel code scanning slices and elements of each slice is generated. In this paper, we present how to benefit from this technique in practice. We explain how to extract representative loop statement instances of slices by means of the Omega Library enlarged by four new functions allowing us to simplify the process of extracting slice representatives. Results of experiments with the NAS and UTDSP benchmarks are presented.

PL

Rozwój architektur wielordzeniowych wymusza poszukiwanie algorytmów automatycznego zrównoleglenia aplikacji. W artykule opisano zrównoleglenie pętli programowych za pomocą ekstrakcji niezależnych fragmentów kodu. Ekstrakcja równoległości w pętlach programowych pozbawionych synchronizacji za pomocą podziału przestrzeni iteracji składa się z dwóch kroków. Najpierw znajdowane są instancje instrukcji będące początkami fragmentów kodu. Następnie fragmenty kodu uzupełniane są o wszystkie instrukcje i generowany jest kod równoległy. W artykule przedstawiono korzyści wynikające z takiego podejścia. Wyjaśniono sposób poszukiwania instancji instrukcji fragmentów kodu za pomocą biblioteki Omega rozszerzonej o nowe funkcje upraszczające poszukiwanie instrukcji należących do fragmentów kodu. Opis proponowanego podejścia uzupełniono o zbiór eksperymentów na pętlach testowych NAS i UTDSP.

12

Repetition and not Parallelism as the Determinant of Poetry in the Hebrew Bible. A Case Study of Biblical Story of Creation (Gen 1)

75%

Majewski M.

The Person and the Challenges. The Journal of Theology, Education, Canon Law and Social Studies Inspired by Pope John Paul II

|

2020

|

tom 11

|

nr 2

199-218

EN

The article points to new research on the subject of poetics in the Bible and argues against the thesis that the basic indicator of poetry and poetic texts in the Bible is parallelism.According to the author, repetition is such an indicator. An analysis of the biblical story of creation of the world was used as the case study (Gen 1).

13

Odpuścić grzechy, zachować wiernych (J 20,23)

75%

Wojciechowska K.

Gdański Rocznik Ewangelicki

|

2013

|

tom 7

195-206

EN

This article presents an exegesis of John 20:23: If you forgive people’s sins, their sins are forgiven; if you hold them they are held fast. Traditionally them refers to sins, and exegetical basis for this interpretation was reading John 20:23 (with the eliptical antithetical parallelism) as parallel of Matt 16:19 and 18:18. However the grammatical and lexical structure of John 20:23 suggests that v. 23a and 23b is a synthetic (progressive) parallel. In the Johannine com¬munities and in first three centuries of Christianity John 20:23 was not understood as the scriptural account of the institution of the sacrament of Penance that can only be administered by the ordained ministers. This text may be an allusion to baptism First of all, John 20:23 is a missionary command to the disciples. They have the power (v. 22: Receive the Holy Spirit) and right to preach the forgiveness of sins and entry into the community of believers (cf. Matt 28:19; Mark 16:16; Luke 24:47).

14

Hermite spline interpolation on patches for parallelly solving the Vlasov-Poisson equation

75%

Crouseilles N. , Latu G. , Sonnendrücker E.

International Journal of Applied Mathematics and Computer Science

|

2007

|

tom Vol. 17, no 3

335-349

EN

This work is devoted to the numerical simulation of the Vlasov equation using a phase space grid. In contrast to Particle- In-Cell (PIC) methods, which are known to be noisy, we propose a semi-Lagrangian-type method to discretize the Vlasov equation in the two-dimensional phase space. As this kind of method requires a huge computational effort, one has to carry out the simulations on parallel machines. For this purpose, we present a method using patches decomposing the phase domain, each patch being devoted to a processor. Some Hermite boundary conditions allow for the reconstruction of a good approximation of the global solution. Several numerical results demonstrate the accuracy and the good scalability of the method with up to 64 processors. This work is a part of the CALVI project.

15

DIE LITERARISCHE ÜBERSETZUNG MÖGLICHKEITEN UND GRENZEN IM WISSENSCHAFTLICHEN DISKURS

75%

Berger E.

Concordia Discors vs Discordia Concors: Researches into Comparative Literature, Contrastive Linguistics, Cross-Cultural and Translation Strategies

|

2009

|

tom 1

113-139

EN

The history of translation is as ancient as the theories concerning translation. Within the progress of this item the discussion focuses on two conflicting positions, based on the concepts of semantic equivalence and one-to-one correspondence respectively. The question which has always been significant is, whether to move the text to its reader or to move the reader, that is to say how to deal with the text`s overdetermination. An individual word may relate to one word through assonance, to another through syntactical equivalence or morphological parallelism. Signs participate in several different paradigmatic and syntagmatic patterns which, in their complexity, cannot be transferred completely into another language. The article deals with the question “how to translate?”, which means to substitute one sign for another and not to lose too much of its significance. Is authenticity possible or just a Utopian dream?

16

On the maximal dimensionality of tiles in tiled code generated by means of Affine Transformations

75%

Bielecki W. , Pałkowski M.

Przegląd Elektrotechniczny

|

2015

|

tom R. 91, nr 11

158-161

EN

Tiling(blocking) is a very important iteration reordering transformation for both improving data locality and extracting loop nest parallelism. Affine transformations are one of the most power approach to generate tiled code. Tile dimensionality has a strong impact on tiled code performance. This paper presents a way allowing one to discover before tiling what is the maximal dimensionality of tiles in code generated by means of affine transformations.

XX

Blokowanie jest bardzo ważną transformacja reorganizacji iteracji zarówno dla poprawy lokalności pętli jak i dla ekstrakcji równoległości w gniezdzie pętli programowej. Przekształcenia afiniczne są jednym z najbardziej mocnych podejść do implementacji techniki blokowania. W artykule przedstawiono sposób, za pomocą którego można odkryć przed zastosowaniem blokowania jaki jest maksymalny wymiar bloków w kodzie generowanym za pomocą przekształceń afinicznych, który ma silny wpływ na wydajność kodu.

17

Wyznaczenie punktów reprezentatywnych niezależnych fragmentów kodu w grafie zależności pętli programowych

63%

Bielecki W. , Pałkowski M. , Klimek T.

Metody Informatyki Stosowanej

|

2010

|

tom nr 1 (22)

13-20

PL

W artykule przedstawiono nowy algorytm wyznaczania punktów reprezentatywnych cechujacy się mniejszą złożonością obliczeń w porównaniu do rozwiazania [6-7]. Powodzenie wyznaczania punktów jest zależne tylko od obliczenia dokładnego tranzytywnego domknięcia unii relacji zależności pętli. Oprócz tego należy wykonać szereg podstawowych operacji, jak: część wspólna, iloczyn skalarny, unia, aplikacja relacji na zbiorze, inwersja, projekcja. Relacja RUSC budowana jest wieloetapowo dzięki czemu można dokonywać pośrednich uproszczeń jej postaci. Opisane podejście zostało zaimplementowane i przetestowane pod kątem skuteczności na zbiorze pętli testowych NAS. W dalszych badaniach planowane jest zbadanie proponowanego algorytmu z innymi zbiorami pętli testowych oraz dalsze udoskonalanie algorytmów do wyznaczania fragmentów dla dowolnej topologii zależności pod kątem generowania wydajnego kodu równoległego.

EN

An algorithm of finding representatives of synchronization-free slices available in program loops is presented. It based on the transitive closure of a union of dependence relations describing all the dependences in program loops. An algorithm to calculate transitive closure is studied. Both the algorithms are implemented by means of the Omega library. The results of experiments with the NAS Parallel Benchmark are discussed.

18

On Driving Forces behind Lyrical Discourse

63%

Zeldowicz G.

Slavia Orientalis

|

2021

|

tom LXX

|

nr 1

19

Рэалізацыя сэнсавых апазіцый у паэтычным дыскурсе Eўдакіі Лось

63%

Старасценка Т.

Acta Universitatis Lodziensis. Folia Linguistica Rossica

|

2022

|

nr 21

121-129

EN

The purpose of this study is to analyse the lexical and grammatical means employed in the semantic oppositions of Jeŭdakija Loś’s poetry as the basis of parallelism with relations of comparison and opposition. The article deals with the linguistic representation of the semantic oppositions life – death, light – darkness, heat – cold as basic universal categories in the discourse of the Belarusian poetess Jeŭdakija Loś. When exploring the research material, the scientific approaches of Roman Yakobson and Yuri Lotman were taken into account, who studied the role of various grammatical categories in the formation of meaning. The relevance of the study lies in deepening the understanding of the communicative aspect of the poetic text as a dialogue between the author and the reader. The article shows the feature of decoding of meaning on the basis of not only lexical but also grammatical representatives. This makes it possible to expand the possibility of analysing poetry as an original language system in which words, interacting with each other, show combinatorial increments of meaning. As a result of this approach, the reader’s role in co-creation along with the poet becomes evident. The functional-stylistic and structural-descriptive methods of analysis used in the study make it possible to characterize the role of linguistic means in modelling the poet’s style. The conclusions of the article confirm the explication of the reader’s meaning through philosophical oppositions and their linguistic expression. The results of the study show the importance of further study of communicative style in creating a dialogue between the poet and the reader.

RU

Мэтай дадзенага даследавання з’яўляецца аналіз лексіка-граматычных сродкаў сэнсавых апазіцый паэзіі Еўдакіі Лось як асновы паралелізму з адносінамі супастаўлення і супрацьпастаўлення. У артыкуле разглядаецца моўная рэпрэзентацыя сэнсавых апазіцый жыццё – смерць, святло – цемра, цяпло – холад як базавых універсальных катэгорый у дыскурсе беларускай паэткі Еўдакіі Лось. Пры характарыстыцы фактычнага матэрыялу ўлічваліся навуковыя падыходы Рамана Якабсона і Юрыя Лотмана, якія разглядалі ролю розных граматычных катэгорый у фарміраванні сэнсу. Актуальнасць даследавання заключаецца ў паглыбленні разумення камунікатыўнага аспекту паэтычнага тэксту як дыялогу паміж аўтарам і чытачом. У артыкуле паказана асаблівасць дэкадавання сэнсу на аснове не толькі лексічных, але і граматычных рэпрэзентантаў. Гэта дазваляе пашырыць магчымасць аналізу паэзіі як арыгінальнай моўнай сістэмы, у якой словы, узаемадзейнічаючы адзін з адным, праяўляюць камбінаторныя прырашчэнні сэнсу. У выніку такога падыходу становіцца відавочнай роля чытача ў сутворчасці з паэтам. Выкарыстаныя ў даследаванні функцыянальна-стылістычны і структурна-апісальны метады аналізу дазваляюць ахарактарызаваць ролю моўных сродкаў у мадэляванні стылю паэта. Вывады артыкула пацвярджаюць эксплікацыю чытацкага сэнсу праз філасофскія апазіцыі і іх моўнае выражэнне. Вынікі праведзенага даследавання сведчаць аб важнасці далейшага вывучэння камунікатыўнай стылістыкі ў стварэнні дыялогу паміж паэтам і чытачом.

20

Zatrzymać czas. O językowych i tekstowych sposobach kształtowania czasu w utworach poetyckich

63%

DOBRZYŃSKA T.

Stylistyka

|

2007

|

tom 16

125-146

PL

The concept of time reveals its complex naturę. It has been encoded in the structure of language in many different ways and it is also permanently present in the discourse. Due to its anthropological character, it is strongly related to the domain of human feelings and imagination. So the time is not simply measured, but it is experienced and lived by as well. As a factor of many different acts, the time undergoes various mental operations. In several types of utterances the concept of time happens to be transformed in some charac- teristic ways: it might be reduced or stopped and one may experience an illusion of time- lessness. Modifications of this kind are being introduced in some special sentence and text structures. Though such constructs might be used in every day speech and in some other kinds of discourse, i.e. in advertisements, they are specific for three types of poetry: poetic meditations, reflective considerations, and lyrical descriptions. The time can also be apparently stopped in the narrative poems, with their specific temporal structures con- nected to the plot. It happens when they are constructed in a particular way undergoing the rule of semantic loop.In this paper some examples of such apparent time flow arrests are discussed as well as their specific functions in poetry.