Wyniki wyszukiwania - BazTech

1

Określenie prawdopodobieństwa pracy układów technologicznych kruszyw zależnie od sposobu połączeń ich elementów

Stryszewski M.

Kruszywa : produkcja - transport - zastosowanie

|

2016

|

Nr 4

25--27

PL

Artykuł jest propozycją metodyczną ilościowej oceny ciągów technologicznych kruszyw zależnie od sposobu połączeń jego elementów. Przedstawiono algorytm obliczeń prawdopodobieństwa pracy całego układu zależnie od sposobu połączeń w funkcji prawdopodobieństwa pracy każdego z elementów. Praca może mieć zastosowanie przy porównywaniu układów między sobą, a także przy ocenie pracy układów w kolejnych latach eksploatacji.

EN

The article is a methodical proposal of the quantitative assessment of aggregate technological lines depending on the methods of connecting their elements. Aggregate technological systems vary considerably depending on the purpose of aggregates and customers’ requirements. The systems range from the simplest to more complex systems of serial, parallel and mixed connections. The operational reliability of systems is one of the basic factors determining the effects of operating a mine. One of the essential measures of the operation of systems is their operational probability which is their preparedness to operate. The paper presents an algorithm for the calculation of the probability of an entire system depending on the methods of connecting its elements in a function of the operational probability of each element. The paper may be also applied when comparing systems with one another, as well as evaluating the operations of systems in subsequent years of their functioning.

2

Implementing graph representation model for parallel and distributed systems using Erlang

Petrov I.

Computer Science

|

2016

|

Vol. 17 (1)

99--120

EN

This paper describes a new model of graph representation using the Erlang actor model. Benefits of using lightweight processes instead of traditional passive data structures are given. Examples of using this model are shown. The experimental part gives two examples of using early implementations of the offered model. As a conclusion, an analysis of applicability for tasks from different branches of science is given.

3

PSF - A Retrospective

Veltin G.J.

Fundamenta Informaticae

|

2010

|

Vol. 100, nr 1/4

181-227

EN

Modern day computer architectures offer ever-increasing support for parallel processing, still it turns out to be quite difficult for programmers and therefore programs to tap into these parallel resources. To benefit from real general-purpose parallel computing we claim that it is likely that a paradigm shift is needed in the way we think about programming. This change of thought in turn will need to be reflected in future programming languages as well. We think that the field of process algebra provides thorough insight in how to reason about the construction of software for concurrent systems and will be one of the enabling technologies supporting this transition. The wish to connect process algebra, a mathematical theory, to the world of computer-readable and executable specifications led to the development of PSF (Process Specification Formalism). PSF is an implementation of the process algebra ACP (Algebra of Communicating Processes) integrating ASF (Algebraic Specification Formalism) to specify algebraic data types. One of the first publications on PSF appeared in Fundamenta Informaticae in 1990. Here we stated as the first sentence of the abstract: "Traditional methods for programming sequential machines are inadequate for specifying parallel systems". Unfortunately, though some advancements have been made since 1990, we can still uphold this statement 20 years later. This current report documents the developments that lead to the construction of PSF and the 1990 publication and moreover it also documents how PSF and its tools have evolved since 1990 taking the conclusion and the outlook for future work from the original article as a reference point. Using the knowledge gained both in constructing tools for PSF and in using PSF to specify concurrent systems, we will judge, discuss and criticise the design decisions taken and show paths for future developments.

4

The model of non-renewal reliability systems with dependent time lengths of components

Grabski F., Załęska-Fornal A.

Journal of Polish Safety and Reliability Association

|

2007

|

Vol. 1

151--156

EN

The models of the non-renewal reliability systems with dependent times to failure of components are presented. The dependence arises from some common environmental stresses and shocks. It is assumed that the failure occurs only because of two independent sources common for two neighbour components. The reliability function of series and parallel systems with components depending on common sources are computed. The reliability functions of the systems with dependent and independent life lengths of components are compared.

5

Podstawy przetwarzania równoległego informacji

Chaładyniak D.

Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki

|

2006

|

nr 1

105--114

PL

W artykule poruszono wybrane podstawowe zagadnienia związane z przetwarzaniem równoległym. Przedstawiono główne obszary zastosowania przetwarzania równoległego oraz dokonano podziału systemów równoległych za pomocą klasyfikacji zaproponowanej przez M. Flynna. Scharakteryzowano cztery rodzaje przetwarzania: SISD (Single Instruction Stream – Single Data Stream), SIMD (Single Instruction Stream – Multiple Data Stream), MISD (Multiple Instruction Stream – Single Data Stream) oraz MIMD (Multiple Instruction Stream – Multiple Data Stream). Opisano również trzy architektury pamięciowe: MIMD-SM (Shared Memory), MIMD-DM (Distributed Memory) oraz MIMD-HDSM (Hybrid Distributed-Shared Memory). W poniższym opracowaniu przedstawiono ponadto ogólny podział architektury komputerów równoległych. Artykuł kończą informacje na temat rodzajów równoległości przetwarzania danych na przykładzie równoległości homogenicznej i heterogenicznej.

EN

The paper considers selected basic issues related with parallel computing. Main areas of parallel computing application and parallel systems classification according to M. Flynn are presented. Four types of processing are characterized: SISD (Single Instruction Stream – Single Data Stream), SIMD (Single Instruction Stream – Multiple Data Stream), MISD (Multiple Instruction Stream – Single Data Stream) and MIMD (Multiple Instruction Stream – Multiple Data Stream). Three memory architectures are described: MIMD-SM (Shared Memory), MIMD-DM (Distributed Memory) and MIMD-HDSM (Hybrid Distributed-Shared Memory). A general classification of parallel computers architecture is additionally presented. The paper is completed by information concerning types of parallelism of data processing with the example of homogenic and heterogenic parallelism.

6

The models of non-renewal reliability systems with dependent lengths of components

Grabski F., Załęska-Fornal A.

Journal of KONBiN

|

2006

|

No. 2

391--398

EN

In that paper there are presented the models of the non-renewal reliability systems with dependent times to failure of components. Their dependence follows from some common sources of shocks existing in the environment. It is assumed that the failure occurs only because of two independent sources common for two neighbour components. The series and parallel system with such dependent components are considered in that paper.