Informacja

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

Wyszukujesz frazę "Szmidt, Janusz." wg kryterium: Autor


Wyświetlanie 1-11 z 11
Tytuł:
Cryptographically Strong Elliptic Curves of Prime Order
Autorzy:
Barański, Marcin
Gliwa, Rafał
Szmidt, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/1844627.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Mersenne primes
elliptic curves
security requirements
search algorithm
Magma
Opis:
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
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ł:
A novel approach to type-reduction and design of interval type-2 fuzzy logic systems
Autorzy:
Starczewski, Janusz T.
Przybyszewski, Krzysztof
Byrski, Aleksander
Szmidt, Eulalia
Napoli, Christian
Powiązania:
https://bibliotekanauki.pl/articles/2147137.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
smooth type-reduction
interval type-2 fuzzy logic systems
Opis:
Fuzzy logic systems, unlike black-box models, are known as transparent artificial intelligence systems that have explainable rules of reasoning. Type 2 fuzzy systems extend the field of application to tasks that require the introduction of uncertainty in the rules, e.g. for handling corrupted data. Most practical implementations use interval type-2 sets and process interval membership grades. The key role in the design of type-2 interval fuzzy logic systems is played by the type-2 inference defuzzification method. In type-2 systems this generally takes place in two steps: type-reduction first, then standard defuzzification. The only precise type-reduction method is the iterative method known as Karnik-Mendel (KM) algorithm with its enhancement modifications. The known non-iterative methods deliver only an approximation of the boundaries of a type-reduced set and, in special cases, they diminish the profits that result from the use of type-2 fuzzy logic systems. In this paper, we propose a novel type-reduction method based on a smooth approximation of maximum/minimum, and we call this method a smooth type-reduction. Replacing the iterative KM algorithm by the smooth type-reduction, we obtain a structure of an adaptive interval type-2 fuzzy logic which is non-iterative and as close to an approximation of the KM algorithm as we like.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 3; 197--206
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-11 z 11

    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