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


Wyświetlanie 1-13 z 13
Tytuł:
The Spectral Test of the Boolean Function Linearity
Autorzy:
Porwik, P.
Powiązania:
https://bibliotekanauki.pl/articles/908085.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
Walsh coefficients
coefficient distribution
Boolean function
bent functions
linearity measure of a Boolean function
Opis:
The paper discusses the problem of recognizing the Boolean function linearity. A spectral method of the analysis of Boolean functions using the Walsh transform is described. Linearity and nonlinearity play important roles in the design of digital circuits. The analysis of the distribution of spectral coefficients allows us to determine various combinatorial properties of Boolean functions, such as redundancy, monotonicity, self-duality, correcting capability, etc., which seems more difficult be performed by means of other methods. In particular, the basic synthesis method described in the paper allows us to compute the spectral coefficients in an iterative manner. The method can be easily used in investigations of large Boolean functions (of many variables), which seems very attractive for modern digital technologies. Experimental results demonstrate the efficiency of the approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 567-575
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Terminal control problem for processes represented by nonlinear multi parameter binary dynamic system
Autorzy:
Haci, Y. H.
Ozen, K.
Powiązania:
https://bibliotekanauki.pl/articles/969692.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Boolean function
difference equation
piecewise curve
Opis:
In this paper, nonlinear multi parameter binary difference equation system (MPBDS) and optimal piecewise process are analyzed. Since such difference equation system is over-determined, a theorem similar to Frobenius's theorem is proved on Galois field. An illustrative example, which can be solved by applying terminal control problem is given. Then, terminal control problem is examined and it is shown that the principle of optimality is satisfied.
Źródło:
Control and Cybernetics; 2009, 38, 3; 625-633
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinearity of incomplete Boolean functions: prioritizing spectra calculation
Autorzy:
Porwik, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/2175117.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Boolean function
numerical methods
Walsh transform
Opis:
In this paper, a class of linear Boolean functions is analyzed. The Boolean function can be represented as disjoint cubes or in the form of a truth vector. The primary purpose of this analysis is to decide whether an incompletely defined function can be extended to a complete linear form. A simple algorithm for generating all states of this function has been proposed if the Boolean function can have a full representation. The algorithm is beneficial for large functions. The proposed approach can be applied to completely and incompletely defined Boolean functions.
Źródło:
Archives of Control Sciences; 2022, 32, 4; 663--676
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Yet Another Pseudorandom Number Generator
Autorzy:
Stoyanov, B.
Szczypiorski, K.
Kordov, K.
Powiązania:
https://bibliotekanauki.pl/articles/226968.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Rossler attractor
bent Boolean function
pseudorandom number generator
Opis:
Rossler attractor bent Boolean function pseudorandom number generator
Źródło:
International Journal of Electronics and Telecommunications; 2017, 63, 2; 195-199
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
www-Based Boolean Function Minimization
Autorzy:
Tomaszewski, S. P.
Celik, I. U.
Antoniou, G. E.
Powiązania:
https://bibliotekanauki.pl/articles/908086.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
digital logic
logic design
Boolean function
Boolean minimization
Quine-McCluskey metod
Opis:
In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful aid for students and professors in the fields of electrical and computer engineering and computer science as well as a valuable tool for digital designers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 577-583
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Function classes and relational constraints stable under compositions with clones
Autorzy:
Couceiro, Miguel
Foldes, Stephan
Powiązania:
https://bibliotekanauki.pl/articles/728758.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
function classes
right (left) composition
Boolean function
invariant relations
relational constraints
Opis:
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2009, 29, 2; 109-121
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Calculation of the Reed-Muller Form by Means of the Walsh Transform
Autorzy:
Porwik, P.
Powiązania:
https://bibliotekanauki.pl/articles/908505.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
Reed-Muller coefficients
Walsh coefficients
coefficient distribution
Boolean function
synthesis of Boolean functions
Opis:
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the Reed-Muller form based on the analysis of Walsh-Hadamard coefficients. The presented method has much less complexity than the procedures which have been applied until now. Both the transforms and the presented Walsh-Hadamard spectral characterization of the Reed-Muller expansion are compared. An analysis of the properties of the spectra obtained from these transforms is made.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 4; 571-579
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Iterative method of neural elements synthesis with generalized threshold activation function
Autorzy:
Geche, F.
Batyuk, A.
Melnyk, O.
Spenyk, T.
Powiązania:
https://bibliotekanauki.pl/articles/410722.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
neural element
Boolean function
system of characters
structure vector
algorithm of synthesis
Opis:
Present work considers the neural elements (NE) with generalized threshold activation function and represents iterative method of their synthesis. Algorithm of vectors finding for structures of the neural elements with generalized threshold activation function was developed, and the sufficient condition of Boolean function unreliazability on such neural elements was discovered.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2015, 4, 4; 37-42
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor
Autorzy:
Todorova, M.
Stoyanov, B.
Szczypiorski, K.
Graniszewski, W.
Kordov, K.
Powiązania:
https://bibliotekanauki.pl/articles/202221.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hash algorithm
chaotic attractor
Bent Boolean function
pseudorandom bit generation scheme
chaotyczny atraktor
funkcja Bent Boolean
pseudolosowy schemat generowania bitów
Opis:
In this study, we propose a novel keyed hash algorithm based on a Boolean function and chaotic attractor. The hash algorithm called BentSign is based on two Signature attractors and XOR function and a bent Boolean function. The provided theoretical and experimental results confirm that the novel scheme can generate output hashes with a good level of security, collision resistance, and protection against most common attacks.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 3; 557-569
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Deutsch-Jozsa Algorithm for Three Fermions System
Autorzy:
Saleh, Mezher B.
George, Loay E.
Kadhum, Kadhum J.
Powiązania:
https://bibliotekanauki.pl/articles/1193013.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Boolean function
Deutsch’s problem
Dutsch-Jozsa algorithm
Hadamard transform
Quantum Bits (Fermions)
Quantum Gates
Opis:
One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2n/2 + 1 = 5) evaluations.
Źródło:
World Scientific News; 2016, 28; 41-56
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dedicated spectral method of Boolean function decomposition
Autorzy:
Porwik, P.
Stanković, R. S.
Powiązania:
https://bibliotekanauki.pl/articles/908408.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
funkcja boolowska
dekompozycja rozłączna
spektrum Walsha
współczynnik autokorelacji
Boolean function
Walsh spectrum
autocorrelation coefficients
disjoint decomposition
Opis:
Spectral methods constitute a useful tool in the analysis and synthesis of Boolean functions, especially in cases when other methods reduce to brute-force search procedures. There is renewed interest in the application of spectral methods in this area, which extends also to the closely connected concept of the autocorrelation function, for which spectral methods provide fast calculation algorithms. This paper discusses the problem of spectral decomposition of Boolean functions using the Walsh transform and autocorrelation characteristics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 271-278
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient spectral method of identification of linear Boolean function
Autorzy:
Porwik, P.
Powiązania:
https://bibliotekanauki.pl/articles/970438.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear Boolean function
Walsh coefficients
coefficients distribution
incompletely defined Boolean functions
współczynnik Walsha
rozkład współczynników
niekompletnie zdefiniowana funkcja Boole'a
liniowa funkcja Boole'a
Opis:
This paper discusses a problem of recognition of the Boolean function's linearity. The article describes the spectral method of analysis of incompletely specified Boolean functions using the Walsh Transform. The linearity and nonlinearity play an important role in design of digital circuits. The analysis of the spectral coefficients' distribution allows to determine the various combinatorial properties of the Boolean functions: redundancy, monotonicity, self-duality, correcting capability, etc. which seems to be more difficult to obtain by means of other methods. In particular, the distribution of spectral coefficients allows us to determine whether Boolean function is linear. The method described in the paper can be easily used in investigations of large Boolean functions (of many variables), what seems to be very attractive for modern digital technologies. Experimental results demonstrate the efficiency of the approach.
Źródło:
Control and Cybernetics; 2004, 33, 4; 663-678
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An incomplete Voronoi tessellation
Autorzy:
Muche, Lutz
Powiązania:
https://bibliotekanauki.pl/articles/1340678.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
specific surface area
contact distribution function
Boolean model
mean chord length
Poisson-Voronoi tessellation
Opis:
This paper presents distributional properties of a random cell structure which results from a growth process. It starts at the points of a Poisson point process. The growth is spherical with identical speed for all points; it stops whenever the boundaries of different cells have contact. The whole process finally stops after time t. So the space is not completely filled with cells, and the cells have both planar and spherical boundaries. Expressions are given for contact distribution functions, the specific boundary length, the specific surface area, and the mean chord length of this cell structure in $ℝ^2$ and $ℝ^3$.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 1; 45-53
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-13 z 13

    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