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ę "representation," wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 18
Tytuł:
On Gelfand pairs associated to transitive groupoids
Autorzy:
Toure, I.
Kangni, K.
Powiązania:
https://bibliotekanauki.pl/articles/952843.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
transitive groupoids
groupoid representation
Gelfand pairs
Opis:
Let G be a topological locally compact, Hausdorff and second countable groupoid with a Haar system and K a compact subgroupoid of G with a Haar system too. (G,K) is a Gelfand pair if the algebra of bi-K-invariant functions is commutative under convolution. In this paper, we give a characterization of Gelfand pairs associated to transitive groupoids which generalize a well-known result in the groups case. Using this result, we prove that the study of Gelfand pairs associated to transitive groupoids is equivalent to that of Gelfand pairs associated to its isotropy groups.
Źródło:
Opuscula Mathematica; 2013, 33, 4; 751-762
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spectral representations for a class of banded Jacobi-type matrices
Autorzy:
Zalot, E.
Majdak, W.
Powiązania:
https://bibliotekanauki.pl/articles/254759.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
spectral representation
Laurent operators
Jacobi matrices
Opis:
We describe some spectral representations for a class of non-self-adjoint banded Jacobi-type matrices. Our results extend those obtained by P.B. Naïman for (two-sided infinite) periodic tridiagonal Jacobi matrices.
Źródło:
Opuscula Mathematica; 2014, 34, 4; 871-887
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Set representation for rule-generation algorithms
Autorzy:
Kharkongor, Carynthia
Nath, Bhabesh
Powiązania:
https://bibliotekanauki.pl/articles/27312912.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
item set
item set representation
apriori algorithm
rule-generation algorithm
data set
set representation
bitmap
memory
time
Opis:
The task of mining association rules has become one of the most widely used discovery pattern methods in knowledge discovery in databases (KDD). One such task is to represent an item set in the memory. The representation of the item set largely depends on the type of data structure that is used for storing them. Computing the process of mining an association rule impacts the memory and time requirements of the item set. With the constant increase of the dimensionality of data and data sets, mining such a large volume of data sets will be difficult since all of these item sets cannot be placed in the main memory. As the representation of an item set greatly affects the efficiency of the rule-mining association, a compact and compressed representation of the item set is needed. In this paper, a set representation is introduced that is more memory- and cost-efficient. Bitmap representation takes 1 byte for an element, but a set representation uses 1 bit. The set representation is being incorporated in the Apriori algorithm. Set representation is also being tested for different rule-generation algorithms. The complexities of these different rule-generation algorithms that use set representation are being compared in terms of memory and time of execution.
Źródło:
Computer Science; 2022, 23 (2); 205--225
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The role of neighborhood density in the random cellular automata model of grain growth
Autorzy:
Czarnecki, Michał
Sitko, Mateusz
Madej, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/29520228.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
random cellular automata
grain growth
digital material representation
Opis:
The paper focuses on adapting the random cellular automata (RCA) method concept for the unconstrained grain growth simulation providing digital microstructure morphologies for subsequent multi-scale simulations. First, algorithms for the generation of initial RCA cells alignment are developed, and then the influence of cells density in the computational domain on grain growth is discussed. Three different approaches are proposed based on the regular, hexagonal, and random cells’ alignment in the former case. The importance of cellular automata (CA) cell neighborhood definition on grain growth model predictions is also highlighted. As a research outcome, random cellular automata model parameters that can replicate grain growth without artifacts are presented. It is identified that the acceptable microstructure morphology of the solid material is obtained when a mean number of RCA cells in the investigated neighborhood is higher than ten.
Źródło:
Computer Methods in Materials Science; 2021, 21, 3; 129-137
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementing graph representation model for parallel and distributed systems using Erlang
Autorzy:
Petrov, I.
Powiązania:
https://bibliotekanauki.pl/articles/305754.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graphs representation
parallel systems
distributed systems
clusters
Erlang
Opis:
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.
Źródło:
Computer Science; 2016, 17 (1); 99-120
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Knowledge graphs effectiveness in Neural Machine Translation improvement
Autorzy:
Ahmadnia, Benyamin
Dorr, Bonnie J.
Kordjamshidi, Parisa
Powiązania:
https://bibliotekanauki.pl/articles/1839251.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
natural language processing
neural machine translation
knowledge graph representation
Opis:
Maintaining semantic relations between words during the translation process yields more accurate target-language output from Neural Machine Translation (NMT). Although difficult to achieve from training data alone, it is possible to leverage Knowledge Graphs (KGs) to retain source-language semantic relations in the corresponding target-language translation. The core idea is to use KG entity relations as embedding constraints to improve the mapping from source to target. This paper describes two embedding constraints, both of which employ Entity Linking (EL)—assigning a unique identity to entities—to associate words in training sentences with those in the KG: (1) a monolingual embedding constraint that supports an enhanced semantic representation of the source words through access to relations between entities in a KG; and (2) a bilingual embedding constraint that forces entity relations in the source-language to be carried over to the corresponding entities in the target-language translation. The method is evaluated for English-Spanish translation exploiting Freebase as a source of knowledge. Our experimental results demonstrate that exploiting KG information not only decreases the number of unknown words in the translation but also improves translation quality
Źródło:
Computer Science; 2020, 21 (3); 299-318
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two-dimensional hp-adaptive algorithm for continuous approximations of material data using space projection
Autorzy:
Gurgul, P.
Sieniek, M.
Paszyński, M.
Madej, Ł.
Collier, N.
Powiązania:
https://bibliotekanauki.pl/articles/305268.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
adaptive finite element method
projection operator
digital material representation
Opis:
In this paper we utilize the concept of the L 2 and H 1 projections used to adaptively generate a continuous approximation of an input material data in the finie element (FE) base.This approximation, along with a corresponding FE mesh, can be used as material data for FE solvers. We begin with abrief theoretical background, followed by description of the hp -adaptive algorithm adopted here to improve gradually quality of the projections. We investigate also a few distinct sample problems, apply the aforementioned algorithms and conclude with numerical results evaluation.
Źródło:
Computer Science; 2013, 14 (1); 97-112
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exploring convolutional auto-encoders for representation learning on networks
Autorzy:
Nerurkar, Pranav Ajeet
Chandane, Madhav
Bhirud, Sunil
Powiązania:
https://bibliotekanauki.pl/articles/305489.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
network representation learning
deep learning
graph convolutional neural networks
Opis:
A multitude of important real-world or synthetic systems possess network structures. Extending learning techniques such as neural networks to process such non-Euclidean data is therefore an important direction for machine learning re- search. However, this domain has received comparatively low levels of attention until very recently. There is no straight-forward application of machine learning to network data, as machine learning tools are designed for i:i:d data, simple Euclidean data, or grids. To address this challenge, the technical focus of this dissertation is on the use of graph neural networks for network representation learning (NRL); i.e., learning the vector representations of nodes in networks. Learning the vector embeddings of graph-structured data is similar to embedding complex data into low-dimensional geometries. After the embedding process is completed, the drawbacks associated with graph-structured data are overcome. The current inquiry proposes two deep-learning auto-encoder-based approaches for generating node embeddings. The drawbacks in such existing auto-encoder approaches as shallow architectures and excessive parameters are tackled in the proposed architectures by using fully convolutional layers. Extensive experiments are performed on publicly available benchmark network datasets to highlight the validity of this approach.
Źródło:
Computer Science; 2019, 20 (3); 273-288
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Operator representations of function algebras and functional calculus
Autorzy:
Juratoni, A.
Suciu, N.
Powiązania:
https://bibliotekanauki.pl/articles/254987.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
weak*-Dirichlet algebra
Hardy space
operator representation
semispectral measure
Opis:
This paper deals with some operator representations φ of a weak*-Dirichlet algebra A, which can be extended to the Hardy spaces Hp(m), associated to A and to a representing measure m of A, for 1 ≤ p ≤ ∞. A characterization for the existence of an extension φp of φ to Lp(m) is given in the terms of a semispectral measure Fφ of φ. For the case when the closure in Lp(m) of the kernel in A of m is a simply invariant subspace, it is proved that the map φp/Hp(m) can be reduced to a functional calculus, which is induced by an operator of class Cρ in the Nagy-Foias sense. A description of the Radon-Nikodym derivative of Fφ is obtained, and the log-integrability of this derivative is proved. An application to the scalar case, shows that the homomorphisms of A which are bounded in Lp(m) norm, form the range of an embedding of the open unit disc into a Gleason part of A.
Źródło:
Opuscula Mathematica; 2011, 31, 2; 237-255
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monodromy invariant Hermitian forms for second order Fuchsian differential equations with four singularities
Autorzy:
Adachi, Shunya
Powiązania:
https://bibliotekanauki.pl/articles/2216189.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Fuchsian differential equations
monodromy representation
monodromy invariant Hermitian form
Opis:
We study the monodromy invariant Hermitian forms for second order Fuchsian differential equations with four singularities. The moduli space of our monodromy representations can be realized by certain affine cubic surface. In this paper we characterize the irreducible monodromies having the non-degenerate invariant Hermitian forms in terms of that cubic surface. The explicit forms of invariant Hermitian forms are also given. Our result may bring a new insight into the study of the Painlevé differential equations.
Źródło:
Opuscula Mathematica; 2022, 42, 3; 361-391
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Projection-based interpolation algorithm over two-dimensional grids with triangular elements
Algorytm interpolacji bazującej na projekcji dla dwu-wymiarowych siatek obliczeniowych z elementami trójkątnymi
Autorzy:
Ryzner, Jakub
Paszyńska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/29520327.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
projection-based interpolation
material science simulations
continuous material data representation
Opis:
In this paper, we employ the projection-based interpolation algorithm for approximation of two-dimensional bitmaps resulting from photographs of multi-phase material samples. The algorithm uses h-adaptive two-dimensional finite element grid with triangular elements. It results in a continuous approximation of material data with Lagrange polynomial, which makes them more suitable for finite element method computations.
Artykuł przedstawia zastosowanie algorytmu interpolacji bazującej na projekcji do aproksymacji dwuwymiarowych bitmap reprezentujących zdjęcia struktury wielo-fazowych materiałów. Algorytm ten używa h-adaptacyjnej dwuwymiarowej metody elementów skończonych z elementami trójkątnymi. W wyniku jego zastosowania dostajemy ciągłą aproksymację materiału z wykorzystaniem wielomianów Lagrange'a rozpiętych na siatce obliczeniowej, na której można następnie przeprowadzić obliczenia metodą elementów skończonych.
Źródło:
Computer Methods in Materials Science; 2019, 19, 1; 29-39
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
μ -Hankel operators on Hilbert spaces
Autorzy:
Mirotin, Adolf
Kuzmenkova, Ekaterina
Powiązania:
https://bibliotekanauki.pl/articles/2048958.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Hankel operator
Hardy space
integral representation
nuclear operator
integral operator
Opis:
A class of operators is introduced (μ -Hankel operators, μ is a complex parameter), which generalizes the class of Hankel operators. Criteria for boundedness, compactness, nuclearity, and finite dimensionality are obtained for operators of this class, and for the case |μ| = 1 their description in the Hardy space is given. Integral representations of $\text{}^{-}$Hankel operators on the unit disk and on the Semi-Axis are also considered.
Źródło:
Opuscula Mathematica; 2021, 41, 6; 881-898
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The effect of model size and boundary conditions on the representativeness of digital material representation simulations of ferritic-pearlitic sample compression
Autorzy:
Perzyński, Konrad
Powiązania:
https://bibliotekanauki.pl/articles/29520075.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
representativeness
digital material representation
finite element method
periodic boundary conditions
Opis:
The main objective of this work is to investigate the representativeness of the digital material representation (DMR) models of ferritic-pearlitic steel generated by the hybrid cellular automata (CA) / Monte Carlo (MC) algorithm. Particular attention is focused on determining the effect of the size of the digital representation model on its representativeness under deformation conditions simulated with the finite element (FE) framework. In addition, the effect of periodic and non-periodic boundary conditions on the deformation behaviour of DMR models is analysed. A dedicated buffer zone approach applied the periodic boundary conditions on non-periodic finite element models. The results of equivalent stresses and strains and their average values are used to evaluate the differences between the models’ predictions.
Źródło:
Computer Methods in Materials Science; 2022, 22, 2; 59-66
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the geometric structure of characteristic vector fields related with nonlinear equations of the Hamilton-Jacobi type
Autorzy:
Prykarpatska, N. K.
Wachnicki, E.
Powiązania:
https://bibliotekanauki.pl/articles/255568.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Hamilton-Jacobi equations
Cartan-Monge geometric approach
Hopf-Lax type representation
Opis:
The Cartan-Monge geometric approach to the characteristics method for Hamilton-Jacobi type equations and nonlinear partial differential equations of higher orders is analyzed. The Hamiltonian structure of characteristic vector fields related with nonlinear partial differential equations of first order is analyzed, the tensor fields of special structure are constructed for defining characteristic vector fields naturally related with nonlinear partial differential equations of higher orders. The generalized characteristics method is developed in the framework of the symplectic theory within geometric Monge and Cartan pictures. The related characteristic vector fields are constructed making use of specially introduced tensor fields, carrying the symplectic structure. Based on their inherited geometric properties, the related functional-analytic Hopf-Lax type solutions to a wide class of boundary and Cauchy problems for nonlinear partial differential equations of Hamilton-Jacobi type are studied. For the non-canonical Hamilton-Jacobi equations there is stated a relationship between their solutions and a good specified functional-analytic fixed point problem, related with Hopf-Lax type solutions to specially constructed dual canonical Hamilton-Jacobi equations.
Źródło:
Opuscula Mathematica; 2007, 27, 1; 89-111
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A vertex operator representation of solutions to the Gurevich-Zybin hydrodynamical equation
Autorzy:
Prykarpatsky, Y. A.
Blackmore, D.
Golenia, J.
Prykarpatsky, A. K.
Powiązania:
https://bibliotekanauki.pl/articles/254692.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Lax type integrability
vertex operator representation
Lax integrability
Lie-algebraic approach
Opis:
An approach based on the spectral and Lie - algebraic techniques for constructing vertex operator representation for solutions to a Riemann type hydrodynamical hierarchy is devised. A functional representation generating an infinite hierarchy of dispersive Lax type integrable flows is obtained.
Źródło:
Opuscula Mathematica; 2013, 33, 1; 139-149
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 18

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