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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-10 z 18
Tytuł:
Using BOINC desktop grid to solve large scale SAT problems
Autorzy:
Posypkin, M.
Semenov, A.
Zaikin, O.
Powiązania:
https://bibliotekanauki.pl/articles/305605.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
desktop grid
Boolean satisfiability problem (SAT)
SAT
volunteer computing
BOINC
Opis:
Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.
Źródło:
Computer Science; 2012, 13 (1); 25-34
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza niezawodności systemu łączności alarmowo-rozgłoszeniowej na przykładzie systemu SAT
The reliability analysis of an alarm and communication system based on the SAT system
Autorzy:
Miśkiewicz, K.
Wojaczek, A.
Wojtas, P.
Powiązania:
https://bibliotekanauki.pl/articles/186346.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Technik Innowacyjnych EMAG
Tematy:
bezpieczeństwo
system łączności alarmowo-rozgłoszeniowej
system SAT
alarm and communication system
safety
SAT system
Opis:
System łączności alarmowo-rozłoszeniowej jest ważny z punktu widzenia bezpiecznego funkcjonowania podziemnych zakładów górniczych i z tego względu istotna jest znajomość jego niezawodności. Referat jest próbą oceny niezawodności systemu łączności alarmowo-rozgłoszeniowej na podstawie rejestracji zdarzeń w komputerach będących składnikiem takiego systemu. W referacie przedstawiono strukturę niezawodnościową systemu SAT oraz wybrane parametry niezawodnościowe takie jak intensywność uszkodzeń [lambda], intensywność odnowy [mi], współczynnik gotowości poszczególnych elementów systemu SAT, obliczone w dwóch różnych kopalniach i w różnych okresach eksploatacji systemu.
An alarm and communication system is important for the safety of underground mines and that is why it is necessary to get familiar with its reliability. The article is an attempt to assess the reliability of an alarm and communication system based on the registration of events in the computers which are part of such a system. The article features the reliability structure of the SAT system along with selected reliability parameters, such as the intensity of damages [lambda], intensity of recovery [mi], readiness coefficient of particular elements of the SAT system - calculated in two separate mines and in two different periods of the system exploitation.
Źródło:
Mechanizacja i Automatyzacja Górnictwa; 2010, R. 48, nr 11, 11; 25-30
0208-7448
Pojawia się w:
Mechanizacja i Automatyzacja Górnictwa
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Solution of SAT Problems Using Ternary Vectors and Parallel Processing
Autorzy:
Posthoff, C.
Steinbach, B.
Powiązania:
https://bibliotekanauki.pl/articles/226241.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
SAT solver
ternary vector
parallel processing
XBOOLE
Opis:
This paper will show a new approach to the solution of SAT-problems. It has been based on the isomorphism between the Boolean algebras of finite sets and the Boolean algebras of logic functions depending on a finite number of binary variables. Ternary vectors are the main data structure representing sets of Boolean vectors. The respective set operations (mainly the complement and the intersection) can be executed in a bit-parallel way (64 bits at present), but additionally also on different processors working in parallel. Even a hierarchy of processors, a small set of processor cores of a single CPU, and the huge number of cores of the GPU has been taken into consideration. There is no need for any search algorithms. The approach always finds all solutions of the problem without consideration of special cases (such us no solution, one solution, all solutions). It also allows to include problem-relevant knowledge into the problem-solving process at an early point of time. Very often it is possible to use ternary vectors directly for the modeling of a problem. Some examples are used to illustrate the efficiency of this approach (Sudoku, Queen's problems on the chessboard, node bases in graphs, graph-coloring problems, Hamiltonian and Eulerian paths etc.).
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 233-249
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparing sat-based bounded model checking rtectl and ectl properties
Autorzy:
Zbrzezny, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/297995.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
SAT
bounded model checking
ECTL
RTECTL
translation
Opis:
We compare two SAT-based bounded model checking algorithms for the properties expressed in the existential fragment of a soft real-time computation tree logic (RTECTL) and in the existential fragment of computation tree logic (ECTL). To this end, we use the generic pipeline paradigm (GPP) and the train controller system (TC), the classic concurrency problems, which we formalise by means of a finite transition system. We consider several properties of the problems that can be expressed in both RTECTL and ECTL, and we present the performance evaluation of the mentioned bounded model checking methods by means of the running time and the memory used.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2017, 20(2); 131-147
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unbounded Model Checking for ATL
Autorzy:
Kański, Michał
Niewiadomski, Artur
Kacprzak, Magdalena
Penczek, Wojciech
Nabiałek, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/2175150.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
ATL
temporal logics
model checking
SAT
SMT
QBF
Opis:
In this paper, we deal with verification of multi-agent systems represented as concurrent game structures. To express properties to be verified, we use Alternating-Time Temporal Logic (ATL) formulas. We provide an implementation of symbolic model checking for ATL and preliminary, but encouraging experimental results.
Źródło:
Studia Informatica : systems and information technology; 2021, 1-2(25); 5--22
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From arithmetic expressions to propositional formulae
Autorzy:
Stępień, L.
Stępień, M. R.
Powiązania:
https://bibliotekanauki.pl/articles/121623.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
algebra liniowa
programowanie deklaratywne
SAT solver
linear algebra
declarative programming
Opis:
In papers [3], [4], [5] Authors presented a new method of solving some kinds of computational tasks in the area of linear algebra by applying SAT-solver as the highly optimized algorithms for solving the problem of propositional satisfiability. On input SAT-solver (cf. [1], [2]) takes a propositional formula in the clause form. In this paper we show in detail how any arithmetical expression can be translated into propositional formula in the CNF form skipping out its traditional form. For this, we define the notion of consistency of arithmetic and boolean valuations.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2016, 21; 135-143
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selection of search strategies for solving 3-SAT problems
Autorzy:
Pułka, A.
Powiązania:
https://bibliotekanauki.pl/articles/330562.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
SAT solving
formal verification
CNF
Boolean satisfiability
badanie spełnialności logicznej
weryfikacja formalna
Opis:
The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the most important issues in the field of modern digital electronic system verification and design. The paper analyzes different strategies and scenarios of the proving process, and presents a modified and extended version of the author’s FUDASAT algorithm. The original FUDASAT methodology is an intuitive approach that employs a commonsense reasoning methodology. The main objective of the work is to investigate the SAT-solving process and try to formulate a set of rules controlling the reasoning process of the FUDASAT inference engine. In comparison with the author’s previous works, the paper introduces new mechanisms: hypergraph analysis, multiple variable assignments and search space pruning algorithms. The approach considers only 3-SAT class functions, although a generalization of the method is discussed as well. The presented approach has been tested on various benchmarks and compared with the original pure FUDASAT algorithm as well as with other algorithms known from the literature. Finally, the benefits of the proposed SAT solving technique are summarized.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 283-297
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SAT-based cryptanalysis of modified versions of Feistel Network
Autorzy:
Dudek, P.
Kurkowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/121634.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
Feistel network
sat-based cryptanalysis
cryptographic functions
sieć Feistela
satelitarna kryptoanaliza
funkcje kryptograficzne
Opis:
It is well known that Feistel Network (FN) is the foundation of many symmetric ciphers used in practice. In this paper we present some remarks and experimental results on SAT based cryptanalysis of several modified versions of FN. We investigate different cryptographic functions used in FN schema for better understanding their properties from a security point of view. In our work we study the notions widely used in many ciphers: the xor function, bits rotations, permutations and S-boxes.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 103-110
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number
Autorzy:
Poureidi, Abolfazl
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/32312036.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independent 2-rainbow dominating function
independent Roman {2}-dominating function
algorithm
3-SAT
Opis:
A 2-rainbow dominating function (2RDF) of a graph $G$ is a function $g$ from the vertex set $V (G)$ to the family of all subsets of $ \{1, 2\}$ such that for each vertex $v$ with $g(v) =\emptyset $ we have \( \bigcup_{u∈N(v)} g(u) = \{ 1, 2 \} \). The minimum of $ g(V (G)) = \Sigma_{v \in V (G)} |g(v)| $ over all such functions is called the 2-rainbow domination number. A 2RDF $g$ of a graph $G$ is independent if no two vertices assigned non empty sets are adjacent. The independent 2-rainbow domination number is the minimum weight of an independent 2RDF of $G$. A Roman {2}-dominating function (R2DF) $ f : V \rightarrow \{ 0, 1, 2 \} $ of a graph $G = (V, E)$ has the property that for every vertex $ v \in V$ with $f(v) = 0$ either there is $ u \in N(v)$ with $f(u) = 2$ or there are $x, y \in N(v)$ with $f(x) = f(y) = 1$. The weight of $f$ is the sum $f(V) = \Sigma_{v \in V} f(v) $. An R2DF $f$ is called independent if no two vertices assigned non-zero values are adjacent. The independent Roman {2}-domination number is the minimum weight of an independent R2DF on $G$. We first show that the decision problem for computing the independent 2-rainbow (respectively, independent Roman {2}-domination) number is NP-complete even when restricted to planar graphs. Then, we give a linear algorithm that computes the independent 2-rainbow domination number as well as the independent Roman {2}-domination number of a given tree, answering problems posed in [M. Chellali and N. Jafari Rad, Independent 2-rainbow domination in graphs, J. Combin. Math. Combin. Comput. 94 (2015) 133–148] and [A. Rahmouni and M. Chellali, Independent Roman {2}-domination in graphs, Discrete Appl. Math. 236 (2018) 408–414]. Then, we give a linear algorithm that computes the independent 2-rainbow domination number of a given unicyclic graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 709-726
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zakłócenia radiowe powodowane przez stacje radarowe Woroneż-DM (Воронеж-ДМ, 77Я6ДМ)
Radio interference caused by Voronezh-DM radar
Autorzy:
Marsz, Jędrzej
Skrzypkowski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/41534957.pdf
Data publikacji:
2024
Wydawca:
Fundacja PSC
Tematy:
cubesat
Voronezh-DM
UHF, 437MHz
PW-Sat3
zakłócenia radiowe
radio interferences
Opis:
As a part of preparations for setting the ground station for the planned PW-Sat3 student satellite, analysis of the spectrum in the 70cm band was made in Gdynia region by members of the science club. It was found out that very strong radio interference is present in this band. Interference was pinpointed to Voronezh-DM radar installed in about 2013 by the Russian military in the Kaliningrad Oblast. Measurements were made to determine the strength and characteristics of the signals emitted by this radar. The signal level in Gdynia region somewhat depends on propagation, but is always present, making receiving weak satellite signals difficult or impossible. Additionally, the potential effects of radar on signals received by satellite was analyzed. Evidence of problems in communications, which might originate from Voronezh-DM radar, in this frequency range in previous satellite missions was found and presented. Other Voronezh-DM radars in other parts of the globe are present, and although operating on slightly different frequencies might also influence satellite communication in the 70cm band.
Źródło:
Alcumena. Pismo Interdyscyplinarne; 2024, 1(17); 71-85
2719-9851
Pojawia się w:
Alcumena. Pismo Interdyscyplinarne
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 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