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ę "sets" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 32
Tytuł:
A sufficient condition for Hurwitz stability of the convex combination of two matrices
Autorzy:
Białas, S.
Powiązania:
https://bibliotekanauki.pl/articles/970417.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stabilność Hurwitza
convex sets of matrices
stability of matrix sets
Hurwitz stability
Opis:
The paper provides a simple sufficient condition for Hurwitz stability of the convex combination of two real matrices.
Źródło:
Control and Cybernetics; 2004, 33, 1; 109-112
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Similarity measures for Atanassov’s intuitionistic fuzzy sets : some dilemmas and challenges
Autorzy:
Szmidt, Eulalia
Kacprzyk, Janusz
Bujnowski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2183493.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
similarity measures
Atanassov’s intuitionistic fuzzy sets
distances
complement
Opis:
We discuss some aspects of similarity measures in the context of Atanassov’s intuitionistic fuzzy sets (IFSs, for short). IFSs, proposed in 1983, are a relatively new tool for the modeling and simulation and, because of their construction, present us with new challenges as far the similarity measures are concerned. Specifically, we claim that the distances alone are not a proper measure of similarity for the IFSs. We stress the role of a lack of knowledge concerning elements (options, decisions, etc.) and point out the role of the opposing (complementing) elements. We also pay attention to the fact that it is not justified to talk about similarity when one has not enough knowledge about the compared objects/elements. Some novel measures of similarity are presented.
Źródło:
Control and Cybernetics; 2022, 51, 2; 249--266
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solution tubes to differential inclusions within a collection of sets
Autorzy:
Quincampoix, M.
Veliov, V.
Powiązania:
https://bibliotekanauki.pl/articles/206199.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
estymacja deterministyczna
system niepewny
system sterowania
control systems
deterministic estimation
differential inclusions
reachable sets
uncertain systems
Opis:
This paper develops the theory of solution tubes to differential inclusions (uncertain systems) within a prescribed collection of sets. The notion is defined as a minimal invariant tube with values in the collection. Under certain requirements for the collection we prove existence and Lipschitz-like stability of the solution tubes. The theory is relevant to problems of systems estimation in the context of control or differential games.
Źródło:
Control and Cybernetics; 2002, 31, 3; 847-862
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the evaluation of compatibility with gradual rules in information systems : a topological approach
Autorzy:
Kortelainen, J.
Powiązania:
https://bibliotekanauki.pl/articles/205981.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
analiza danych
topologia
zbiór rozmyty
data analysis
knowledge acquisition
L-fuzzy sets
modifier logic
rough sets
topology
Opis:
The paper presents an approach to detecting dependence of a decision-maker's actions (or decisions) on conditions with respect to a certain type of fuzzy rules, namely gradual rules. Gradual rules are of the form "the more c is C, the more d is D", where C and D are L-fuzzy sets on the domain of the attributes c and d with membership values possibly in different lattices, respectively. The decision-maker's actions and conditions for those are found in a data base-like system, called an information system. We use the information system to define relations corresponding to L-fuzzy sets, and we define weakening modifiers by these relations. These modifiers are closure operators in the corresponding topologies, and we can define fineness relation between L-fuzzy sets. This relation is useful when comparing different decision-maker's actions. We define strong degree and topological degree of depedence of the attributes (with respect to a gradual rule), and we study some properties of those. Finally, we present a small application.
Źródło:
Control and Cybernetics; 1999, 28, 1; 121-131
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reachable sets concept - a general abstract analysis
Autorzy:
Terlikowski, T.
Powiązania:
https://bibliotekanauki.pl/articles/970585.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
nieskończoność
okresowość
infinity
periodicity
reachable set
Opis:
A control problem over the infinite time horizon for periodical system is considered. Our aim is to analyze a special concept of solving problems of this type, based on the known idea of reachable sets. We try to consider this concept in a more general manner than it was done in earlier works and to find what is really essential in it. The algorithm corresponding to the proposed general description is presented.
Źródło:
Control and Cybernetics; 2003, 32, 4; 803-817
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy similarity measure based on fuzzy sets
Autorzy:
Hesamian, G.
Powiązania:
https://bibliotekanauki.pl/articles/206878.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
approximate reasoning system
fuzzy similarity measure
ranking method
pattern recognition
Opis:
This paper extends the notion of fuzzy similarity measure between fuzzy sets. A definite class of fuzzy similarity measures between fuzzy sets is also introduced. Using some theorems and examples, it is shown that the introduced extended similarity measures satisfy many common and desired properties, based on the common axiomatic definitions, introduced for fuzzy similarity measures. Some illustrative and practical examples from the areas of pattern recognition and approximate reasoning systems are provided in order to present the possible applications of the proposed fuzzy similarity measures.
Źródło:
Control and Cybernetics; 2017, 46, 1; 71-86
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A possibilistic view on set and multiset comparison
Autorzy:
Bronselaer, A.
Hallez, A.
Tre, G. de
Powiązania:
https://bibliotekanauki.pl/articles/970953.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
evaluator
co-reference
multisets
sets
Opis:
Comparative evaluation operators for sets and multisets are proposed from a possibilistic point of view. In general, an evaluator estimates the possibility of (non) co-reference of two arbitrary (sub)-objects. Such operators can be used in a hierarchical possibilistic framework for finding co-referent objects with a complex structure. This paper first discusses properties of evaluators in general and continues with studying operators for sets and multisets, thereby making a clear distinction between hard and soft evaluators. Hard evaluators are based on evaluation of derived (multi)sets, while soft evaluators use a low level evaluator to incorporate co-reference at element level. The two important parts of such a soft evaluator are an injective element mapping and an aggregation function. An algorithm to provide the injective mapping is presented and discussed. For the aggregation step, ordered weighted conjunction is studied by introducing parameterized fuzzy quantifiers to calculate weight vectors. An advanced learning strategy is introduced to train the optimal parameter matrix.
Źródło:
Control and Cybernetics; 2009, 38, 2; 341-366
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Conditions with aggregates evaluated using gradual numbers
Autorzy:
Lietard, L.
Rocacher, D.
Powiązania:
https://bibliotekanauki.pl/articles/970944.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
fuzzy sets
fuzzy condition
linguistic quantifier
quantified statement
aggregate
Opis:
This paper is devoted to the evaluation of conditions involving aggregates in the context of flexible querying of relational databases. An example of such a condition is "the maximum salary of young employees is high", where the aggregate max applies to a fuzzy set of salaries. At first, we consider the evaluation of quantified statements where the aggregate count (the cardinality) is implicitly used. We extend this result to conditions involving the aggregates average, maximum or minimum. The contribution of this paper is to propose a new theoretical background for their evaluations based on an arithmetic on gradual numbers (Nƒ,Zƒ,Qƒ).
Źródło:
Control and Cybernetics; 2009, 38, 2; 395-417
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On [sigma]-porous and [Phi]-angle-small sets in metric spaces
Autorzy:
Rolewicz, S.
Powiązania:
https://bibliotekanauki.pl/articles/970531.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
zbiór porowaty
porous set
k-monotone family of Lipschitz functions
Opis:
It is shown that in metric spaces each [alpha, phi)-meagre set A is uniformly very porous and its index of uniform v-porosity is not smaller than [k-alpha/3k+alpha] provided that [phi] is a strictly k-monotone family of Lipschitz functions and [alpha] < k. The paper contains also conditions implying that a k-monotone family of Lipschitz functions is strictly k-monotone.
Źródło:
Control and Cybernetics; 2003, 32, 3; 671-681
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Soft methods in statistical quality control
Autorzy:
Grzegorzewski, P.
Hryniewicz, O.
Powiązania:
https://bibliotekanauki.pl/articles/206289.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
statystyczna kontrola jakości
zbiór rozmyty
control charts
fuzzy sets
sampling plans
vague data
Opis:
The paper is devoted to soft methods in statistical quality control. A review of existing tools for dealing with vague data or fuzzy requirements is given. Some new procedures are also proposed.
Źródło:
Control and Cybernetics; 2000, 29, 1; 119-140
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Detecting epileptogenesis in power variant domains
Autorzy:
Lewis, R. A.
Parks, B.
Shmueli, D.
Capinst, S.
Powiązania:
https://bibliotekanauki.pl/articles/206373.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
intracortical electroencephalograms automata
epilepsy
Fourier transforms
rough sets
Opis:
This paper presents the merging of two sets of experiments in the continuing endeavor to mine epileptiform activity from Electroencephalograms (EEG). The goal is to develop robust classification rules for identifying epileptiform activity in the human brain. We present advancements using the author's proprietary developed spectral analysis software to link power spectra of rat EEGs experiencing epilepsy seizures with the authors DFA algorithm and their MATLAB spectral analysis. Our system links 1) power spectra of seizures, in sleep, spike and seizure states, with 2) Deterministic Finite Automata (DFA). Combining power spectra with DFA to correctly predict and identify epileptiform activity (spikes) and epileptic seizures opens the door to creating classifiers for seizures. We also present a DFA that separates the states between seizure and nonseizure using robust testing and additional algorithms to increase the rigor when the methodology analyses noisy signals. Our results show optimal identification of seizures even when significant artifact and noise is present in the polyphonic domain. Herein we present a dual methodology that increases epileptoid identification in a noisy domain that links time and frequency domain components from MATLAB and proprietary software to clinical epileptiform activity.
Źródło:
Control and Cybernetics; 2011, 40, 2; 293-314
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some results for the reflection problems in Hilbert spaces
Autorzy:
Barbu, V.
Da Prato, G.
Powiązania:
https://bibliotekanauki.pl/articles/970292.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stochastic variational inequality
Wiener processes in Hilbert spaces
convex sets
strong solutions
Opis:
This work is concerned with existence and uniqueness of a solution of a stochastic variational inequality on closed convex bounded subsets with nonempty interior and smooth boundary of a Hilbert space H (the reflection problem).
Źródło:
Control and Cybernetics; 2008, 37, 4; 797-810
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improved linear complexities of the frequency hopping sequences in two optimal sets
Autorzy:
Gao, J.
Li, X.
Wei, Y.
Powiązania:
https://bibliotekanauki.pl/articles/206234.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
frequency hopping sequence
linear complexity
permutation polynominal
optimal set
Opis:
For the anti-jamming purpose, high linear complexity is desired for each frequency hopping sequence in an optimal set. Using a proper power permutation, Wang has shown that an optimal set of frequency hopping sequences with small linear complexity can be transformed into a new optimal set of frequency hopping sequences with large linear complexity. This paper conains two results. First, we extend the result of Wang. A power permutation is only suitable for a special construction of optimal set of frequency hopping sequences, see Wang (2011). However, the power permutation chosen in this paper applies to the general construction of optimal set of frequency hopping sequences. Second, by using a binomial permutation polynomial P(x), which is different from those permutations used before, we obtain a novel optimal set of frequency hopping sequences with high linear complexity from an optimal set of frequency hopping sequences with small linear complexity. By counting the number of different roots in the sequence representation, we determine the linear complexities of the frequency hopping sequences in two optimal sets transformed by the power permutation or binomial permutation.
Źródło:
Control and Cybernetics; 2012, 41, 2; 317-334
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Digital signature with secretly embedded warning
Autorzy:
Durnoga, K.
Pomykała, J.
Trabszys, T.
Powiązania:
https://bibliotekanauki.pl/articles/205996.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
public key cryptography
digital signature
one-way permutation
subliminal channel
deniable encryption
blackmail
secretly embedded warning
translucent sets
Opis:
We present a digital signature scheme with secretly embedded warning. The embedded warning is a protection mechanism in case of restraint or blackmail. Extending ordinary digital signatures we propose schemes where a signer, approached by a powerful adversary that demands handing over a signing key, can disclose his private key. In our solution the signer is able to generate a feigned key indistinguishable from the genuine one. Then such a key can be used to embed a special warning message within a signature to indicate coercion. Such warnings can be transferred via subliminal channel to some trusted authority.
Źródło:
Control and Cybernetics; 2013, 42, 4; 805-824
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of approximating Pareto sets for assessments of implicit Pareto set elements
Autorzy:
Kaliszewski, I.
Powiązania:
https://bibliotekanauki.pl/articles/970402.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria decision making
bi-criteria problems
Pareto set
efficiency
convex function approximation
sandwich algorithms
Opis:
Deriving efficient variants in complex multiple criteria decision making problems requires optimization. This hampers greatly broad use of any multiple criteria decision making method. In multiple criteria decision making Pareto sets, i.e. sets of efficient vectors of criteria values corresponding to feasible decision alternatives, are of primal interest. Recently, methods have been proposed to calculate assessments for any implicit element of a Pareto set (i.e. element which has not been derived explicitly but has been designated in a form which allows its explicit derivation, if required) when a finite representation of the Pareto set is known. In that case calculating respective bounds involves only elementary operations on numbers and does not require optimization. In this paper the problem of approximating Pareto sets by finite representations which assure required tightness of bounds is considered for bicriteria decision making problems. Properties of a procedure to derive such representations and its numerical behavior are investigated.
Źródło:
Control and Cybernetics; 2007, 36, 2; 367-381
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 32

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