Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "matrices" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 140
Tytuł:
Spectral resolutions for non-self-adjoint block convolution operators
Autorzy:
Zalot, Ewelina
Powiązania:
https://bibliotekanauki.pl/articles/2216178.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
spectral operators
chains
triangular decomposition
Laurent operators
Jacobi matrices
Opis:
The paper concerns the spectral theory for a class of non-self-adjoint block convolution operators. We mainly discuss the spectral representations of such operators. It is considered the general case of operators defined on Banach spaces. The main results are applied to periodic Jacobi matrices.
Źródło:
Opuscula Mathematica; 2022, 42, 3; 459-487
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Perturbation theory, M-essential Spectra of 2 x 2 operator matrices and application to transport operators
Autorzy:
Jeribi, Aref
Moalla, Nedra
Yengui, Sonia
Powiązania:
https://bibliotekanauki.pl/articles/2052375.pdf
Data publikacji:
2021
Wydawca:
Politechnika Rzeszowska im. Ignacego Łukasiewicza. Oficyna Wydawnicza
Tematy:
operator matrices
essential spectrum
Fredholm perturbation
transport equation
macierz operatora
widma
perturbacja Fredholma
równanie transportu
Opis:
In this article we give some results on perturbation theory of 2 x 2 block operator matrices on the product of Banach spaces. Furthermore, we investigate their M-essential spectra. Finally, we apply the obtained results to determine the M-essential spectra of two group transport operators with general boundary conditions in the Banach space $L_{p}([-a, a] \times [-1, 1]) \times L_{p}([-a, a] x [-1, 1]), p \geq 1 and a > 0$.
Źródło:
Journal of Mathematics and Applications; 2021, 44; 35-55
1733-6775
2300-9926
Pojawia się w:
Journal of Mathematics and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Residual stress profile determination by the hole-drilling method with calibration coefficients obtained using FEM
Autorzy:
Corrêa, Fábio Junkes
Jahnert, Frederico Alves
Tomás, Jucélio Pereira
Powiązania:
https://bibliotekanauki.pl/articles/2055064.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
semi-destructive methods
linear elasticity theory
finite element method
matrices of calibration coefficients
Opis:
Residual Stresses (RS) in mechanical components can be undesirable, and their accurate identification can prevent component damage. There are many semi-destructive methods for determination of RS. The hole-drilling method offers many advantages when compared to other methods due to its practicality, applicability to different materials, and low-cost execution. According to the American Society for Testing and Materials (ASTM) E837- -13a Standard, the RS are assumed to be constant at each depth level when employing the hole-drilling method. Thus, calibration coefficients are necessary to calculate stress values at each level using the relaxed strains measured on the component surface, as incremental drillings are performed. However, the coefficients provided by the Standard were obtained using a coarsely-discretized 2D finite element model. This work aims to find new calibration coefficients based on the linear elasticity theory and using the Finite Element Method (FEM) with a refined mesh. A numerical model consisting of linear tetrahedral finite elements was constructed to simulate the resulting strains, as unitary stresses are applied at each depth level of the component inner surface. Using this method, two matrices of calibration coefficients are obtained, one related to normal stresses, and another related to shear stresses. The results show that the RS obtained using the new coefficients presented a 3.9% relative average error compared to analytical values in the four experiments conducted, while the ASTM Standard coefficients resulted in a 9.7% relative average error.
Źródło:
Journal of Theoretical and Applied Mechanics; 2021, 59, 4; 661--673
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zur Entwicklung der kodematischen Theorie des Fremdsprachenunterrichts
On the development of the codematic theory of foreign-language learning
Autorzy:
Szczodrowski, Marian
Powiązania:
https://bibliotekanauki.pl/articles/2043611.pdf
Data publikacji:
2021-12-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
Sprachkode
fremdsprachliche Kode-Prozesse
Primärsender und Sekundärsender
Primärempfänger und Sekundärempfänger
Verkoppelung der Strukturmatrizen
Sprech-Schreib-Sprach-Strukturmatrizen und ihre Einkodierungsprozesse
linguistic code
foreign-language code processes
primary and secondary sender
primary and secondary receiver
merging structural matrices
spoken and written linguistic structural matrices and their processes of encoding
Opis:
The discussion addresses the linguistic code and its contribution to the development of the codematic theory of foreign-language teaching. This theory deals with the essence and properties of the course of processes of coding and decoding foreign-language structures. Teachers and learners participate in these processes as primary and secondary senders and receivers of transmitted lexical-grammatical structures with the aim of learners’ mastering them. The process of learning and mastering foreign-language structures takes place in two stages, that is, during their decoding and construction in the form of structural matrices in the receiver’s appropriate memory. In this way, in the receiver (learner) there forms a warehousing mechanism with regard to the foreign language. This mechanism is equipped with a receptive and (re)productive functioning force, that is a force that activates the structural matrices. Structural matrices in long-term memory attain the appropriate force of activation, and therefore demand constantly being brought up to date in various syntagmatic-syntactic constructions, that is in the process of their encoding.
Źródło:
Glottodidactica. An International Journal of Applied Linguistics; 2021, 48, 2; 95-109
0072-4769
Pojawia się w:
Glottodidactica. An International Journal of Applied Linguistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of Seamless Learning to Facilitate Formal and Informal Learning in Elementary Education
Autorzy:
Setyosari, Punaji
Kuswandi, Dedi
Ulfa, Saida
Powiązania:
https://bibliotekanauki.pl/articles/1963637.pdf
Data publikacji:
2020-09-30
Wydawca:
Wydawnictwo Adam Marszałek
Tematy:
instructional design
learning planning matrices
learning activity
mobile technology
Opis:
Environmental education in primary schools has not built sufficient awareness in formal-informal learning experience. The development of seamless learning is an alternative innovation in building students’ learning experiences. However, there is limited research on its implementation in the learning process in elementary schools with limited mobile technology. Therefore, the purpose of this research was to develop instructional design and learning planning matrices for seamless learning on teachers’ and students’ activities to facilitate formal and informal learning with limited use of mobile technology in elementary schools. Based on the instructional design and learning planning matrices developed, the context reconstruction in a seamless learning design was successfully used in guiding the teachers’ and students’ activities. The limitations of mobile technology in the schools could be replaced with the use of learning laboratories, as well as parents’ support at home. Furthermore, the instructional design and learning matrix developed were feasible, valid, and practical in application in elementary schools. Therefore, the community has a vital role to play in improving students’ learning experiences aside from schools.
Źródło:
The New Educational Review; 2020, 61; 51-62
1732-6729
Pojawia się w:
The New Educational Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Financial liability stress tests: an approach based on the use of a rating migration matrix
Autorzy:
Kleszcz, Klaudia
Nehrebecka, Natalia
Powiązania:
https://bibliotekanauki.pl/articles/1356463.pdf
Data publikacji:
2020-09-09
Wydawca:
Uniwersytet Warszawski. Wydział Nauk Ekonomicznych
Tematy:
stress tests
bankruptcy risk
rating migration matrices
stress scenario
Opis:
The article addresses the issue of stress testing based on the probability of bankruptcy and a rating migration matrix. The analysis is conducted on a sample of listed companies in Poland in the years 1998–2016, and the forecasts are made for the years 2016–2018. Particular attention is paid to how the variable on which rating migration matrices are developed is defined. Stress tests are carried out on variables derived from rating migration matrices and economic indicators. The study provides information on the methodology for stress testing.
Źródło:
Central European Economic Journal; 2020, 7, 54; 12 - 32
2543-6821
Pojawia się w:
Central European Economic Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications
Autorzy:
Cardoso, Domingos M.
Pastén, Germain
Rojo, Oscar
Powiązania:
https://bibliotekanauki.pl/articles/31546556.pdf
Data publikacji:
2020-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cluster
convex combination of matrices
corona product of graphs
Aα-spectrum
Opis:
Given a graph G, its adjacency matrix A(G) and its diagonal matrix of vertex degrees D(G), consider the matrix Aα(G) = αD(G) + (1 − α)A(G), where α ∈ [0, 1). The Aα -spectrum of G is the multiset of eigenvalues of Aα(G) and these eigenvalues are the α-eigenvalues of G. A cluster in G is a pair of vertex subsets (C, S), where C is a set of cardinality |C| ≥ 2 of pairwise co-neighbor vertices sharing the same set S of |S| neighbors. Assuming that G is connected and it has a cluster (C, S), G(H) is obtained from G and an r-regular graph H of order |C| by identifying its vertices with the vertices in C, eigenvalues of Aα(G) and Aα(G(H)) are deduced and if Aα(H) is positive semidefinite, then the i-th eigenvalue of Aα(G(H)) is greater than or equal to i-th eigenvalue of Aα(G). These results are extended to graphs with several pairwise disjoint clusters (C1, S1), . . ., (Ck, Sk). As an application, the effect on the energy, α-Estrada index and α-index of a graph G with clusters when the edges of regular graphs are added to G are analyzed. Finally, the Aα-spectrum of the corona product G ◦ H of a connected graph G and a regular graph H is determined.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 2; 451-466
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integer Matrix Keys for Secure Data Aggregation in Clustered Wireless Sensor Networks
Autorzy:
Chethana, G.
Padmaja, K.V.
Powiązania:
https://bibliotekanauki.pl/articles/1844481.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
loss-less data aggregation
integer matrices as keys
finite field Zp
homomorphic aggregation
Opis:
Providing Privacy and security for aggregated data in wireless sensor networks has drawn the attention of practicing engineers and researchers globally. Several cryptographic methods have been already proposed to solve security and data integrity problems for aggregated data. Matrix cryptography is a better option for creating secure encryption/decryption algorithms to counter quantum attack. However, these algorithms have higher computational cost and increased communication overhead. Hence, a new technique of loss-less secure data aggregation in Clustered Wireless Sensor Networks is presented. The proposed method uses integer matrices as keys for data security and data integrity. Matrix operations are carried out in finite field Zp. Loss-less secure data aggregation is extended for homomorphic summation while the cipher text expansion ratio is kept substantially low. The proposed algorithm has inbuilt fast and efficient signature verification facility. The execution time of our signature verification mechanism is found to be approximately 50 percent less compared to a couple of standard existing signature verification schemes.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 4; 637-645
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ośrodek Pism Drukarskich w Warszawie (1968-1979)
Typefaces Centre in Warsaw (1968-1979)
Autorzy:
Tomaszewski, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/128555.pdf
Data publikacji:
2020
Wydawca:
Centralny Ośrodek Badawczo-Rozwojowy Przemysłu Poligraficznego
Tematy:
typografia
pisma drukarskie
czcionka
matryce
fonty komputerowe
projektowanie graficzne
XX wiek
typography
font
matrices
computer fonts
graphic design
20th century
Opis:
The author presented the history and the most important project achievements of the Printing Typefaces Center (OPD), which for over a decade was a part of the Research & Development Centre for the Graphic Arts (COBRPP), celebrating its anniversary this year. The facility was managed by Roman Tomaszewski, a well-known publisher and graphic arts specialists. Dozens of typefaces were designed in OPD for page layout techniques that have forever been forgotten. Despite technological changes in printing, the OPD typographic resource is today a reservoir of lettering ready for digitization and making computer fonts.
Źródło:
Acta Poligraphica; 2020, 15; 49-67
2299-9981
Pojawia się w:
Acta Poligraphica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scattering of Sound Waves in Two Stepped Non-uniformly Lined Duct
Autorzy:
Tiryakioglu, Ayse
Demir, Ahmet
Powiązania:
https://bibliotekanauki.pl/articles/177113.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
Wiener-Hopf
scattering matrices
step discontinuity
impedance discontinuity
duct
Opis:
Scattering of sound waves in two stepped cylindrical duct which walls are coated with different acoustically absorbent materials is investigated by using Wiener-Hopf technique directly and by determining scattering matrices. First, by using Fourier transform technique we obtain a couple of modified Wiener-Hopf equations whose solutions involve four sets of infinitely many unknown expansion coefficients providing systems of linear algebraic equations. Then we determine scattering matrices of the problem and we state the total transmitted field by using generalized scattering matrix method. Numerical results are compared for different parameters.
Źródło:
Archives of Acoustics; 2020, 45, 3; 511-520
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem
Autorzy:
Du, Zhibin
da Fonseca, Carlos M.
Powiązania:
https://bibliotekanauki.pl/articles/31804164.pdf
Data publikacji:
2020-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
trees
acyclic matrices
singular
multiplicity of eigenvalues
P-set
P-vertices
Opis:
Let A be a real symmetric matrix. If after we delete a row and a column of the same index, the nullity increases by one, we call that index a P-vertex of A. When A is an n × n singular acyclic matrix, it is known that the maximum number of P-vertices is n − 2. If T is the underlying tree of A, we will show that for any integer number k ∈ {0, 1, . . ., n − 2}, there is a (singular) matrix whose graph is T and with k P-vertices. We will provide illustrative examples.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 2; 525-532
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of superconducting magnetic separation to an artificial mixture of chalcopyrite and molybdenite
Autorzy:
Li, Daokui
Kou, Jue
Sun, Chunbao
Yu, Baoqiang
Wang, Chao
Powiązania:
https://bibliotekanauki.pl/articles/110786.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
magnetic matrices
superconducting magnetic separation
buildup behavior
chalcopyrite and molybdenite separation
Opis:
Superconducting magnetic separation of chalcopyrite and molybdenite was studied, along with the effects of the magnetic flux density, slurry concentration, and pulsation amplitude on the separation. According to the force equilibrium model of magnetic particles that accumulated on magnetic matrices during the superconducting magnetic separation, the saturated buildup of magnetic particles was calculated. The saturated buildup of magnetic particles was an approximate fan ring and had a positive correlation with the background magnetic flux density. Superconducting magnetic separation tests results showed that a Mo concentrate with a Mo grade of 31.86% and recovery of 87.24% and a Cu concentrate with a Cu grade of 30.57% and recovery of 94.76% could be obtained. This verified the feasibility of separating mixed Cu and Mo minerals via superconducting magnetic separation.
Źródło:
Physicochemical Problems of Mineral Processing; 2019, 55, 3; 597-604
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computation of positive realizations for descriptor linear discrete-time systems
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/116668.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithm
computation
computation of positive realizations
descriptor lnear discrete-time systems
linear discrete-time systems
Discrete-time Systems
transfer matrices
method for determination of positive realizations
Opis:
A new method for computation of positive realizations of given transfer matrices of descriptor linear discrete‐time linear systems is proposed. Necessary and sufficient conditions for the existence of positive realizations of transfer matrices are given. A procedure for computation of the positive realizations for descriptor discrete‐time linear systems is proposed and illustrated by examples.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 545-551
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel Algorithms for Forward and Back Substitution in Linear Algebraic Equations of Finite Element Method
Autorzy:
Fialko, Sergiy
Powiązania:
https://bibliotekanauki.pl/articles/308616.pdf
Data publikacji:
2019
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
finite element method
multithreaded parallelization
sparse symmetric matrices
triangular solution
Opis:
This paper considers several algorithms for parallelizing the procedure of forward and back substitution for high-order symmetric sparse matrices on multi-core computers with shared memory. It compares the proposed approaches for various finite-element problems of structural mechanics which generate sparse matrices of different structures.
Źródło:
Journal of Telecommunications and Information Technology; 2019, 4; 20-29
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Study on the application of elliptic cross-section matrices for axial high gradient magnetic separation: key considerations for optimization
Autorzy:
Zheng, Xiayu
Wang, Yuhua
Lu, Dongfang
Li, Xudong
Powiązania:
https://bibliotekanauki.pl/articles/110325.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
elliptic matrices
expanded capture models
capture cross section
overlapping
Opis:
To reveal the key optimization considerations for the application of elliptic cross-section matrices in axial high gradient magnetic separation (HGMS), the performance of circular and elliptic matrices was investigated experimentally and theoretically, providing that the short axis of elliptic matrix was equal to the diameter of circular matrix. Three schemes were adopted to investigate the performance matrices with ratio of long axis to short axis λ of 1 (circular matrix), 1.6 and 2. Under the same matrix unit number, hematite recovery of elliptic matrices could be 5~20% higher than that of circular matrices. For the case that the separation space was fully filled under the same matrix unit spacing, elliptic matrices showed higher and lower hematite recovery in low and relatively high magnetic field. The particle capture cross section area of elliptic matrix could be 1.4~1.8 times larger than that of circular matrix. Analyses with particle capture models showed that higher hematite recovery was ascribed to the larger particle capture cross section of the elliptic matrices and overlapping of the capture cross section was responsible for the lower hematite recovery of elliptic matrices in relatively high magnetic field. For substitution of circular matrices with elliptic matrices in axial HGMS, overlapping of capture cross section of target particles should be taken into consideration.
Źródło:
Physicochemical Problems of Mineral Processing; 2019, 55, 3; 655-666
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 140

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies