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ę "Zbiór" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 35
Tytuł:
Neuro-rough-fuzzy approach for regression modelling from missing data
Autorzy:
Simiński, K.
Powiązania:
https://bibliotekanauki.pl/articles/331298.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system neuronowo-rozmyty
ANNBFIS
brakujące wartości
zbiór przybliżony
zbiór rozmyty
neuro-fuzzy
missing values
marginalisation
imputation
rough fuzzy set
clustering
Opis:
Real life data sets often suffer from missing data. The neuro-rough-fuzzy systems proposed hitherto often cannot handle such situations. The paper presents a neuro-fuzzy system for data sets with missing values. The proposed solution is a complete neuro-fuzzy system. The system creates a rough fuzzy model from presented data (both full and with missing values) and is able to elaborate the answer for full and missing data examples. The paper also describes the dedicated clustering algorithm. The paper is accompanied by results of numerical experiments.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 461-476
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets
Autorzy:
Colomo-Palacios, R.
González-Carrasco, I.
López-Cuadrado, J. L.
García-Crespo, Á.
Powiązania:
https://bibliotekanauki.pl/articles/331282.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
zbiór przybliżony
Scrum
pakiet roboczy
system polecenia
fuzzy set
rough set
work package
recommender system
Opis:
Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER, a hybrid recommender system based on fuzzy logic, rough set theory and semantic technologies, aimed at helping project leaders to manage software development projects. The proposed system provides a powerful tool for project managers supporting the development process in Scrum environments and helping to form the most suitable team for different work packages. The system has been evaluated in a real scenario of development with the Scrum framework obtaining promising results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 801-816
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant-based clustering for flow graph mining
Autorzy:
Lewicki, Arkadiusz
Pancerz, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/330782.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
possibly certain sequences
flow graph
rough set
fuzzy set
ant based clustering
graf przepływu danych
zbiór przybliżony
zbiór rozmyty
Opis:
The paper is devoted to the problem of mining graph data. The goal of this process is to discover possibly certain sequences appearing in data. Both rough set flow graphs and fuzzy flow graphs are used to represent sequences of items originally arranged in tables representing information systems. Information systems are considered in the Pawlak sense, as knowledge representation systems. In the paper, an approach involving ant based clustering is proposed. We show that ant based clustering can be used not only for building possible large groups of similar objects, but also to build larger structures (in our case, sequences) of objects to obtain or preserve the desired properties.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 561-572
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Definition of the Fuzzy Set
Autorzy:
Piegat, A.
Powiązania:
https://bibliotekanauki.pl/articles/908479.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
prawdopodobieństwo
arytmetyka rozmyta
fuzzy set theory
fuzzy arithmetic
possibility
Opis:
The present fuzzy arithmetic based on Zadeh's possibilistic extension principle and on the classic definition of a fuzzy set has many essential drawbacks. Therefore its application to the solution of practical tasks is limited. In the paper a new definition of the fuzzy set is presented. The definition allows for a considerable fuzziness decrease in the number of arithmetic operations in comparison with the results produced by the present fuzzy arithmetic.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 125-140
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy Versus Probabilistic Benefit/cost Ratio Analysis for Public Work Projects
Autorzy:
Kahraman, C.
Powiązania:
https://bibliotekanauki.pl/articles/908371.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
ryzyko
economic justification
risk
fuzzy set theory
B/C ratio
Opis:
The benefit/cost (B/C) ratio method is utilized in many government and public work projects to determine if the expected benefits provide an acceptable return on the estimated investment and costs. Many authors have studied probabilistic cash flows in recent years. They introduced some analytical methods which determine the probability distribution function of the net present value and internal rate of return of a series of random discrete cash flows. They considered serially correlated cash flows and the uncertainty of future capital investment and reinvestment rates and they presented some formulae for the B/C ratio for probabilistic cash flows. In the paper, the expected value and the variance of a probabilistic cash flow are obtained by means of moments. Then a probabilistic B/C ratio is given. Fuzzy set theory has the capability of representing vague knowledge and allows mathematical operators and programming to be applied to the fuzzy domain. The theory is primarily concerned with quantifying the vagueness in human thoughts and perceptions. The fuzzy B/C ratios are developed for a single investment project and for multiple projects having equal or different lives.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 705-718
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
DFIS: A novel data filling approach for an incomplete soft set
Autorzy:
Qin, H.
Ma, X.
Herawan, T.
Zain, J. M.
Powiązania:
https://bibliotekanauki.pl/articles/331284.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
napełnianie danych
soft sets
incomplete soft sets
data filling
association degree
Opis:
The research on incomplete soft sets is an integral part of the research on soft sets and has been initiated recently. However, the existing approach for dealing with incomplete soft sets is only applicable to decision making and has low forecasting accuracy. In order to solve these problems, in this paper we propose a novel data filling approach for incomplete soft sets. The missing data are filled in terms of the association degree between the parameters when a stronger association exists between the parameters or in terms of the distribution of other available objects when no stronger association exists between the parameters. Data filling converts an incomplete soft set into a complete soft set, which makes the soft set applicable not only to decision making but also to other areas. The comparison results elaborated between the two approaches through UCI benchmark datasets illustrate that our approach outperforms the existing one with respect to the forecasting accuracy.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 817-828
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Verified methods for computing Pareto sets: General algorithmic analysis
Autorzy:
G.-Tóth, B.
Kreinovich, V.
Powiązania:
https://bibliotekanauki.pl/articles/930124.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja wielocelowa
zbiór Pareto
multi-objective optimisation
Pareto set
verified computing
Opis:
In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which fj (x') fj (x) for all j and fj(x') > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to show that Pareto sets can also be computed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 369-380
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rough sets based on Galois connections
Autorzy:
Madrid, Nicolás
Medina, Jesús
Ramírez-Poussa, Eloísa
Powiązania:
https://bibliotekanauki.pl/articles/330499.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rough sets
Galois connection
approximation operator
zbiór przybliżony
połączenie Galois
operator aproksymacji
Opis:
Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one. Lately, different papers have motivated the possibility of considering arbitrary relations. Nevertheless, when those are taken into account, the original definitions given by Pawlak may lose fundamental properties. This paper proposes a possible solution to the arising problems by presenting an alternative definition of approximation operators based on the closure and interior operators obtained from an isotone Galois connection. We prove that the proposed definition satisfies interesting properties and that it also improves object classification tasks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 299-313
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Set membership estimation of parameters and variables in dynamic networks by recursive algorithms with a moving measurement window
Autorzy:
Duzinkiewicz, K.
Powiązania:
https://bibliotekanauki.pl/articles/908402.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór estymacyjny
niepewność
sieć komputerowa
sieć wodociągowa
set membership estimation
uncertainty
complexity
networks
water distribution
Opis:
The paper considers a set membership joint estimation of variables and parameters in complex dynamic networks based on parametric uncertain models and limited hard measurements. A recursive estimation algorithm with a moving measurement window is derived that is suitable for on-line network monitoring. The window allows stabilising the classic recursive estimation algorithm and significantly improves estimate tightness. The estimator is validated on a case study regarding a water distribution network. Tight set estimates of unmeasured pipe flows, nodal heads, tank level and pipe resistances are obtained.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 209-217
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recursive set membership estimation for output-error fractional models with unknown-but-bounded errors
Autorzy:
Amairi, M.
Powiązania:
https://bibliotekanauki.pl/articles/331145.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fractional calculus
set membership
estimation
unknown but bounded error
układ niecałkowitego rzędu
zbiór estymacyjny
błąd ograniczony
Opis:
This paper presents a new formulation for set-membership parameter estimation of fractional systems. In such a context, the error between the measured data and the output model is supposed to be unknown but bounded with a priori known bounds. The bounded error is specified over measurement noise, rather than over an equation error, which is mainly motivated by experimental considerations. The proposed approach is based on the optimal bounding ellipsoid algorithm for linear output-error fractional models. A numerical example is presented to show effectiveness and discuss results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 543-553
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hardware reduction for LUT-based mealy FSMs
Autorzy:
Barkalov, A.
Titarenko, L.
Mielcarek, K.
Powiązania:
https://bibliotekanauki.pl/articles/331362.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Mealy FSM
FPGA
LUT
partition
encoding collection
output variables
automat Mealy'ego
zbiór kodowany
zmienne wyjściowe
Opis:
A method is proposed targeting a decrease in the number of LUTs in circuits of FPGA-based Mealy FSMs. The method improves hardware consumption for Mealy FSMs with the encoding of collections of output variables. The approach is based on constructing a partition for the set of internal states. Each state has two codes. It diminishes the number of arguments in input memory functions. An example of synthesis is given, along with results of investigations. The method targets rather complex FSMs, having more than 15 states.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 595-607
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On classification with missing data using rough-neuro-fuzzy systems
Autorzy:
Nowicki, R. K.
Powiązania:
https://bibliotekanauki.pl/articles/907774.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
struktura neuronowo-rozmyta
klasyfikacja
brakujące dane
fuzzy sets
neuro-fuzzy architectures
classification
missing data
Opis:
The paper presents a new approach to fuzzy classification in the case of missing data. Rough-fuzzy sets are incorporated into logical type neuro-fuzzy structures and a rough-neuro-fuzzy classifier is derived. Theorems which allow determining the structure of the rough-neuro-fuzzy classifier are given. Several experiments illustrating the performance of the roughneuro-fuzzy classifier working in the case of missing features are described.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 55-67
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Knowledge, Vagueness and Logic
Autorzy:
Wybraniec-Skardowska, U.
Powiązania:
https://bibliotekanauki.pl/articles/908372.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
logika formalna
vague knowledge
fuzzy sets
rough sets
vague sets
formal logic
Opis:
The aim of the paper is to outline an idea of solving the problem of the vagueness of concepts. The starting point is a definition of the concept of vague knowledge. One of the primary goals is a formal justification of the classical viewpoint on the controversy about the truth and object reference of expressions including vague terms. It is proved that grasping the vagueness in the language aspect is possible through the extension of classical logic to the logic of sentences which may contain vague terms. The theoretical framework of the conception refers to the theory of Pawlak's rough sets and is connected with Zadeh's fuzzy set theory as well as bag (or multiset) theory. In the considerations formal logic means and the concept system of set theory have been used. The paper can be regarded as an outline of the logical theory of vague concepts.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 719-737
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Set-membership identifiability of nonlinear models and related parameter estimation properties
Autorzy:
Jauberthie, C.
Travé-Massuyès, L.
Verdière, N.
Powiązania:
https://bibliotekanauki.pl/articles/331411.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
identifiability
bounded uncertainty
set membership estimation
nonlinear dynamic model
identyfikowalność
niepewność ograniczona
zbiór estymacyjny
model dynamiczny nieliniowy
Opis:
Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter estimation problems. Soundness and ε-consistency are proposed to characterize these problems and the solution returned by the algorithm used to solve them. This paper also contributes by carefully motivating and comparing SM-identifiability, μ-SM-identifiability and ε-SM-identifiability with related properties found in the literature, and by providing a method based on differential algebra to check these properties.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 803-813
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New models and algorithms for RNA pseudoknot order assignment
Autorzy:
Zok, Tomasz
Badura, Jan
Swat, Sylwester
Figurski, Kacper
Popenda, Mariusz
Antczak, Maciej
Powiązania:
https://bibliotekanauki.pl/articles/911230.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA pseudoknot order
conflict graph
vertex coloring
maximum independent set
integer programming
kolorowanie grafu
zbiór niezależny
programowanie całkowitoliczbowe
Opis:
The pseudoknot is a specific motif of the RNA structure that highly influences the overall shape and stability of a molecule. It occurs when nucleotides of two disjoint single-stranded fragments of the same chain, separated by a helical fragment, interact with each other and form base pairs. Pseudoknots are characterized by great topological diversity, and their systematic description is still a challenge. In our previous work, we have introduced the pseudoknot order: a new coefficient representing the topological complexity of the pseudoknotted RNA structure. It is defined as the minimum number of base pair set decompositions, aimed to obtain the unknotted RNA structure. We have suggested how it can be useful in the interpretation and understanding of a hierarchy of RNA folding. However, it is not trivial to unambiguously identify pseudoknots and determine their orders in an RNA structure. Therefore, since the introduction of this coefficient, we have worked on the method to reliably assign pseudoknot orders in correspondence to the mechanisms that control the biological process leading to their formation in the molecule. Here, we introduce a novel graph coloring-based model for the problem of pseudoknot order assignment. We show a specialized heuristic operating on the proposed model and an alternative integer programming algorithm. The performance of both approaches is compared with that of state-of-the-art algorithms which so far have been most efficient in solving the problem in question. We summarize the results of computational experiments that evaluate our new methods in terms of classification quality on a representative data set originating from the non-redundant RNA 3D structure repository.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 315-324
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 35

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