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ę "représentation" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 16
Tytuł:
Motion representations for the Lafferriere-Sussmann algorithm for nilpotent control systems
Autorzy:
Dulęba, I.
Jagodziński, J.
Powiązania:
https://bibliotekanauki.pl/articles/907494.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system sterowania
system nilpotentny
algorytm
control
nilpotent system
algorithm
motion representation
Opis:
In this paper, an extension of the Lafferriere-Sussmann algorithm of motion planning for driftless nilpotent control systems is analyzed. It is aimed at making more numerous admissible representations of motion in the algorithm. The representations allow designing a shape of trajectories joining the initial and final configuration of the motion planning task. This feature is especially important in motion planning in a cluttered environment. Some natural functions are introduced to measure the shape of a trajectory in the configuration space and to evaluate trajectories corresponding to different representations of motion.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 525-534
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rough Relation Properties
Autorzy:
Nicoletti, M. C.
Uchoa, J. Q.
Baptistini, M. T. Z.
Powiązania:
https://bibliotekanauki.pl/articles/908367.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
teoria mnogości
przedstawienie wiedzy
rough set theory
rough relation
knowledge representation
Opis:
Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be considered an extension of the classical set theory. It has been used in many different research areas, including those related to inductive machine learning and reduction of knowledge in knowledge-based systems. One important concept related to RST is that of a rough relation. This paper rewrites some properties of rough relations found in the literature, proving their validity.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 621-635
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms for job-shop scheduling
Autorzy:
Mesghouni, K.
Hammadi, S.
Borne, P.
Powiązania:
https://bibliotekanauki.pl/articles/907245.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
harmonogramowanie produkcji
algorytm ewolucyjny
reprezentacja równoległa
job-shop scheduling
evolutionary algorithms
parallel representation
Opis:
This paper explains how to use Evolutionary Algorithms (EA) to deal with a flexible job shop scheduling problem, especially minimizing the makespan. The Job-shop Scheduling Problem (JSP) is one of the most difficult problems, as it is classified as an NP-complete one (Carlier and Chretienne, 1988; Garey and Johnson, 1979). In many cases, the combination of goals and resources exponentially increases the search space, and thus the generation of consistently good scheduling is particularly difficult because we have a very large combinatorial search space and precedence constraints between operations. Exact methods such as the branch and bound method and dynamic programming take considerable computing time if an optimum solution exists. In order to overcome this difficulty, it is more sensible to obtain a good solution near the optimal one. Stochastic search techniques such as evolutionary algorithms can be used to find a good solution. They have been successfully used in combinatorial optimization, e.g. in wire routing, transportation problems, scheduling problems, etc. (Banzhaf et al., 1998; Dasgupta and Michalewicz, 1997). Our objective is to establish a practical relationship between the development in the EA area and the reality of a production JSP by developing, on the one hand, two effective genetic encodings, such as parallel job and parallel machine representations of the chromosome, and on the other, genetic operators associated with these representations. In this article we deal with the problem of flexible job-shop scheduling which presents two difficulties: the first is the assignment of each operation to a machine, and the other is the scheduling of this set of operations in order to minimize our criterion (e.g. the makespan).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 91-103
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bag of words and embedding text representation methods for medical article classification
Autorzy:
Cichosz, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/24403007.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
text representation
text classification
bag of words
word embedding
reprezentacja tekstu
klasyfikacja tekstu
osadzanie słów
Opis:
Text classification has become a standard component of automated systematic literature review (SLR) solutions, where articles are classified as relevant or irrelevant to a particular literature study topic. Conventional machine learning algorithms for tabular data which can learn quickly from not necessarily large and usually imbalanced data with low computational demands are well suited to this application, but they require that the text data be transformed to a vector representation. This work investigates the utility of different types of text representations for this purpose. Experiments are presented using the bag of words representation and selected representations based on word or text embeddings: word2vec, doc2vec, GloVe, fastText, Flair, and BioBERT. Four classification algorithms are used with these representations: a naive Bayes classifier, logistic regression, support vector machines, and random forest. They are applied to datasets consisting of scientific article abstracts from systematic literature review studies in the medical domain and compared with the pre-trained BioBERT model fine-tuned for classification. The obtained results confirm that the choice of text representation is essential for successful text classification. It turns out that, while the standard bag of words representation is hard to beat, fastText word embeddings make it possible to achieve roughly the same level of classification quality with the added benefit of much lower dimensionality and capability of handling out-of-vocabulary words. More refined embeddings methods based on deep neural networks, while much more demanding computationally, do not appear to offer substantial advantages for the classification task. The fine-tuned BioBERT classification model performs on par with conventional algorithms when they are coupled with their best text representation methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 4; 603--621
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A modified convolution and product theorem for the linear canonical transform derived by representation transformation in quantum mechanics
Autorzy:
Goel, N.
Singh, K.
Powiązania:
https://bibliotekanauki.pl/articles/329746.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
linear canonical transform
convolution theorem
product theorem
quantum mechanical representation
liniowe przekształcenie kanoniczne
twierdzenie o splocie
Opis:
The Linear Canonical Transform (LCT) is a four parameter class of integral transform which plays an important role in many fields of signal processing. Well-known transforms such as the Fourier Transform (FT), the FRactional Fourier Transform (FRFT), and the FreSnel Transform (FST) can be seen as special cases of the linear canonical transform. Many properties of the LCT are currently known but the extension of FRFTs and FTs still needs more attention. This paper presents a modified convolution and product theorem in the LCT domain derived by a representation transformation in quantum mechanics, which seems a convenient and concise method. It is compared with the existing convolution theorem for the LCT and is found to be a better and befitting proposition. Further, an application of filtering is presented by using the derived results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 3; 685-695
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Image retrieval based on hierarchical Gabor filters
Autorzy:
Andrysiak, T.
Choraś, M.
Powiązania:
https://bibliotekanauki.pl/articles/908448.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
filtr Gabora
pobieranie obrazu
ekstrakcja cech
reprezentacja hierarchiczna
Gabor filters
image retrieval
texture feature extraction
hierarchical representation
Opis:
Content Based Image Retrieval (CBIR) is now a widely investigated issue that aims at allowing users of multimedia information systems to automatically retrieve images coherent with a sample image. A way to achieve this goal is the computation of image features such as the color, texture, shape, and position of objects within images, and the use of those features as query terms. We propose to use Gabor filtration properties in order to find such appropriate features. The article presents multichannel Gabor filtering and a hierarchical image representation. Then a salient (characteristic) point detection algorithm is presented so that texture parameters are computed only in a neighborhood of salient points. We use Gabor texture features as image content descriptors and efficiently emply them to retrieve images.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 4; 471-480
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A case study in text mining of discussion forum posts: Classification with bag of words and global vectors
Autorzy:
Cichosz, P.
Powiązania:
https://bibliotekanauki.pl/articles/330299.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
text mining
discussion forum
text representation
document classification
word embedding
eksploracja tekstu
forum dyskusyjne
reprezentacja tekstu
klasyfikacja dokumentów
Opis:
Despite the rapid growth of other types of social media, Internet discussion forums remain a highly popular communication channel and a useful source of text data for analyzing user interests and sentiments. Being suited to richer, deeper, and longer discussions than microblogging services, they particularly well reflect topics of long-term, persisting involvement and areas of specialized knowledge or experience. Discovering and characterizing such topics and areas by text mining algorithms is therefore an interesting and useful research direction. This work presents a case study in which selected classification algorithms are applied to posts from a Polish discussion forum devoted to psychoactive substances received from home-grown plants, such as hashish or marijuana. The utility of two different vector text representations is examined: the simple bag of words representation and the more refined embedded global vectors one. While the former is found to work well for the multinomial naive Bayes algorithm, the latter turns out more useful for other classification algorithms: logistic regression, SVMs, and random forests. The obtained results suggest that post-classification can be applied for measuring publication intensity of particular topics and, in the case of forums related to psychoactive substances, for monitoring the risk of drug-related crime.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 787-801
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neural Networks in the Framework of Granular Computing
Autorzy:
Pedrycz, W.
Powiązania:
https://bibliotekanauki.pl/articles/911146.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
kodowanie
dekoder
sieć neuronowa
przedstawienie wiedzy
information granulation
pyramid architectures
encoding and decoding
neural networks
learning
knowledge representation
Opis:
The study is concerned with the fundamentals of granular computing and its application to neural networks. Granular computing, as the name itself stipulates, deals with representing information in the form of some aggregates (embracing a number of individual entitites) and their ensuing processing. We elaborate on the rationale behind granular computing. Next, a number of formal frameworks of information granulation are discussed including several alternatives such as fuzzy sets, interval analysis, rough sets, and probability. The notion of granularity itself is defined and quantified. A design agenda of granular computing is formulated and the key design problems are raised. A number of granular architectures are also discussed with an objective of dealineating the fundamental algorithmic and conceptual challenges. It is shown that the use of information granules of different size (granularity) lends itself to general pyramid architectures of information processing. The role of encoding and decoding mechanisms visible in this setting is also discussed in detail along with some particular solutions. Neural networks are primarily involved at the level of numeric optimization. Granularity of information introduces another dimension to the neurocomputing. We discuss the role of granular constructs in the design of neural networks and knowledge representation therein. The intent of this paper is to elaborate on the fundamentals and put the entire area in a certain perspective while not moving into specific algorithmic details.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 723-745
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exponential estimates of a class of time-delay nonlinear systems with convex representations
Autorzy:
Ramírez, M.
Villafuerte, R.
González, T.
Bernal, M.
Powiązania:
https://bibliotekanauki.pl/articles/330293.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
exponential estimate
time delay system
TS model
guaranteed cost
convex representation
funkcja wykładnicza
układ z opóźnieniem
koszt gwarantowany
Opis:
This work introduces a novel approach to stability and stabilization of nonlinear systems with delayed multivariable inputs; it provides exponential estimates as well as a guaranteed cost of the system solutions. The result is based on an exact convex representation of the nonlinear system which allows a Lyapunov–Krasovskii functional to be applied in order to obtain sufficient conditions in the form of linear matrix inequalities. These are efficiently solved via convex optimization techniques. A real-time implementation of the developed approach on the twin rotor MIMO system is included.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 815-826
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ASA-graphs for efficient data representation and processing
Autorzy:
Horzyk, Adrian
Bulanda, Daniel
Starzyk, Janusz A.
Powiązania:
https://bibliotekanauki.pl/articles/1838165.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
self balancing trees
self sorting trees
self aggregating data structures
associative structures
data access efficiency
representation of relationships
Opis:
Fast discovering of various relationships in data is an important feature of modern data mining, cognitive, knowledge-based, and explainable AI systems, including deep neural networks. The ability to represent a rich set of relationships between stored data and objects is essential for fast inferences, finding associations, representing knowledge, and extracting useful patterns or other pieces of information. This paper introduces self-balancing, aggregating, and sorting ASA-graphs for efficient data representation in various data structures, databases, and data mining systems. These graphs are smaller and use more efficient algorithms for searching, inserting, and removing data than the most commonly used self-balancing trees. ASA-graphs also automatically aggregate and count all duplicates of values and represent them by the same nodes, connecting them in order, and simultaneously providing very fast data access based on a binary search tree approach. The proposed ASA-graph structure combines the advantages of sorted lists, binary search trees, B-trees, and B+trees, eliminating their weaknesses. Our experiments proved that the ASA-graphs outperform many commonly used self-balancing trees.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 4; 717-731
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fitting traffic traces with discrete canonical phase type distributions and Markov arrival processes
Autorzy:
Mészáros, A.
Papp, J.
Telek, M.
Powiązania:
https://bibliotekanauki.pl/articles/329820.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fitting traffic traces
discrete phase type distribution
discrete Markov arrival process
canonical representation
rozkład fazowy
proces Markowa
przedstawienie kanoniczne
Opis:
Recent developments of matrix analytic methods make phase type distributions (PHs) and Markov Arrival Processes (MAPs) promising stochastic model candidates for capturing traffic trace behaviour and for efficient usage in queueing analysis. After introducing basics of these sets of stochastic models, the paper discusses the following subjects in detail: (i) PHs and MAPs have different representations. For efficient use of these models, sparse (defined by a minimal number of parameters) and unique representations of discrete time PHs and MAPs are needed, which are commonly referred to as canonical representations. The paper presents new results on the canonical representation of discrete PHs and MAPs. (ii) The canonical representation allows a direct mapping between experimental moments and the stochastic models, referred to as moment matching. Explicit procedures are provided for this mapping. (iii) Moment matching is not always the best way to model the behavior of traffic traces. Model fitting based on appropriately chosen distance measures might result in better performing stochastic models. We also demonstrate the efficiency of fitting procedures with experimental results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 453-470
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Relative Sets and Rough Sets
Autorzy:
Mousavi, A.
Jabedar-Maralani, P.
Powiązania:
https://bibliotekanauki.pl/articles/908368.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
teoria mnogości
analiza danych
przedstawienie wiedzy
rough sets
set theory
data analysis
multi-valued logic
interval sets
knowledge representation
Opis:
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable sets, an integrated approach to relative sets and rough sets is obtained. With this definition, we are able to define an approximation of a rough set in an approximation space, and so we can obtain sequential approximations of a set, which is a good model of communication among agents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 637-653
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Network Models and the Symbolic Solution of Network Equations
Autorzy:
Reinschke, K. J.
Powiązania:
https://bibliotekanauki.pl/articles/908328.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć wielowymiarowa
teoria grafów
history of network theory
network graphs
network equations
modified nodal analysis
admittance representation of multi-ports
multidimensional networks
Opis:
This paper gives an overview of the formulation and solution of network equations, with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If necessary, the network graph is modified so as to obtain an admittance representation for all kinds of multi-ports. N-dimensional networks are defined as graphs with the algebraic structure of N-dimensional vectors. In civil engineering, framed structures in two and three spatial dimensions can be modeled as 3-dimensional or 6-dimensional networks. The separation of geometry from topology is a characteristic feature of such networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 1; 237-269
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comprehensive study of clustering a class of 2D shapes
Autorzy:
Kaliszewska, Agnieszka
Syga, Monika
Powiązania:
https://bibliotekanauki.pl/articles/2055154.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
shape representation
Procrustes distance
shape similarity
dynamic time warping
DTW
morphometrics
clustering
Kendall shape theory
archaeological pottery
reprezentacja kształtu
podobieństwo kształtu
ceramika archeologiczna
Opis:
The paper is concerned with clustering with respect to the shape and size of 2D contours that are boundaries of cross-sections of 3D objects of revolution. We propose a number of similarity measures based on combined disparate Procrustes analysis (PA) and dynamic time warping (DTW) distances. A motivation and the main application for this study comes from archaeology. The computational experiments performed refer to the clustering of archaeological pottery.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 1; 95--109
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FSM encoding for BDD representations
Autorzy:
Gosti, W.
Villa, T.
Saldanha, A.
Sangiovanni-Vincentelli, A. L.
Powiązania:
https://bibliotekanauki.pl/articles/911255.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
binarny diagram decyzyjny
kodowanie
automat skończony
synteza logiczna
weryfikacja formalna
binary decision diagram
encoding
finite state machine
logic synthesis
formal verification
logic representation
Opis:
We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 1; 113-128
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 16

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