1,720,957 research outputs found
IMPLEMENTATION OF GAME AND AGENT USING MINIMAX ALGORITHM
No full textTema ovog rada je implementacija igre šah i agenta koji igra šah korištenjem minimax algoritma. Cilj rada je prikazati teoretske i praktične korake kreiranja šahovskog motora (engl.chess engine). Rad obuhvaća sve ključne korake implementacije samog motora potkrijepljene teoretskim osnovama same problematike. Kako se tema klasificira kao algoritamski problem, bilo je potrebno proučiti osnovne principe rada sljedećih algoritama: osnovni algoritmi pretrage, binarna pretraga, minimax algoritam te alfa-beta podrezivanje. Također, bilo je potrebno proučiti praktičnu upotrebu navedenih algoritama te njihovu adaptaciju unutar šahovske problematike, uzevši u obzir da su spomenuti algoritmi generički. Rad je u cijelosti pisan u C++ jeziku, te je zbog iznimne algoritamske složenosti problema bilo potrebno napredno poznavanje samog programskog jezika.The topic of this paper is the implementation of the chess game and the chessplaying agent using the minimax algorithm. The aim of the work is to show the theoretical and practical steps of creating a chess engine. The paper covers all the key steps of implementing the engine itself, supported by the theoretical foundations of the problem itself. As the topic is classified as an algorithmic problem, it was necessary to study the basic working principles of the following algorithms: basic search algorithms, binary search, minimax algorithm, and alpha-beta pruning. It was also necessary to study the practical use of the mentioned algorithms and their adaptation within chess problems, given that the mentioned algorithms are generic. The work was written entirely in C++ language, and due to the exceptional algorithmic complexity of the problem, an advanced knowledge of the used technology was required
DEVELOPMENT OF A DHCP CLIENT APPLICATION FOR THE IPv6 NETWORK PROTOCOL
No full textOvaj rad bavi se implementacijom jednostavnog DHCPv6 klijenta u programskom jeziku C++. Problem automatske mrežne konfiguracije u IPv6 mrežama rješava se slanjem i primanjem DHCPv6 poruka putem Linux sučelja, s ciljem dohvaćanja i obnavljanja mrežnih parametara. U radu su korišteni alati za testiranje (Google Test), mockiranje (Google Mock) i logiranje (spdlog), čime se osigurava ispravnost i robusnost rješenja.This thesis presents the implementation of a simple DHCPv6 client in C++. It addresses the problem of automatic network configuration in IPv6 networks by sending and receiving DHCPv6 messages via the Linux interface, with the goal of retrieving and renewing network parameters. Tools such as Google Test, Google Mock, and spdlog were used to ensure the correctness and robustness of the solution
IMPLEMENTATION OF GAME AND AGENT USING MINIMAX ALGORITHM
No full textTema ovog rada je implementacija igre šah i agenta koji igra šah korištenjem minimax algoritma. Cilj rada je prikazati teoretske i praktične korake kreiranja šahovskog motora (engl.chess engine). Rad obuhvaća sve ključne korake implementacije samog motora potkrijepljene teoretskim osnovama same problematike. Kako se tema klasificira kao algoritamski problem, bilo je potrebno proučiti osnovne principe rada sljedećih algoritama: osnovni algoritmi pretrage, binarna pretraga, minimax algoritam te alfa-beta podrezivanje. Također, bilo je potrebno proučiti praktičnu upotrebu navedenih algoritama te njihovu adaptaciju unutar šahovske problematike, uzevši u obzir da su spomenuti algoritmi generički. Rad je u cijelosti pisan u C++ jeziku, te je zbog iznimne algoritamske složenosti problema bilo potrebno napredno poznavanje samog programskog jezika.The topic of this paper is the implementation of the chess game and the chessplaying agent using the minimax algorithm. The aim of the work is to show the theoretical and practical steps of creating a chess engine. The paper covers all the key steps of implementing the engine itself, supported by the theoretical foundations of the problem itself. As the topic is classified as an algorithmic problem, it was necessary to study the basic working principles of the following algorithms: basic search algorithms, binary search, minimax algorithm, and alpha-beta pruning. It was also necessary to study the practical use of the mentioned algorithms and their adaptation within chess problems, given that the mentioned algorithms are generic. The work was written entirely in C++ language, and due to the exceptional algorithmic complexity of the problem, an advanced knowledge of the used technology was required
DEVELOPMENT OF A DHCP CLIENT APPLICATION FOR THE IPv6 NETWORK PROTOCOL
No full textOvaj rad bavi se implementacijom jednostavnog DHCPv6 klijenta u programskom jeziku C++. Problem automatske mrežne konfiguracije u IPv6 mrežama rješava se slanjem i primanjem DHCPv6 poruka putem Linux sučelja, s ciljem dohvaćanja i obnavljanja mrežnih parametara. U radu su korišteni alati za testiranje (Google Test), mockiranje (Google Mock) i logiranje (spdlog), čime se osigurava ispravnost i robusnost rješenja.This thesis presents the implementation of a simple DHCPv6 client in C++. It addresses the problem of automatic network configuration in IPv6 networks by sending and receiving DHCPv6 messages via the Linux interface, with the goal of retrieving and renewing network parameters. Tools such as Google Test, Google Mock, and spdlog were used to ensure the correctness and robustness of the solution
DEVELOPMENT OF A DHCP CLIENT APPLICATION FOR THE IPv6 NETWORK PROTOCOL
No full textOvaj rad bavi se implementacijom jednostavnog DHCPv6 klijenta u programskom jeziku C++. Problem automatske mrežne konfiguracije u IPv6 mrežama rješava se slanjem i primanjem DHCPv6 poruka putem Linux sučelja, s ciljem dohvaćanja i obnavljanja mrežnih parametara. U radu su korišteni alati za testiranje (Google Test), mockiranje (Google Mock) i logiranje (spdlog), čime se osigurava ispravnost i robusnost rješenja.This thesis presents the implementation of a simple DHCPv6 client in C++. It addresses the problem of automatic network configuration in IPv6 networks by sending and receiving DHCPv6 messages via the Linux interface, with the goal of retrieving and renewing network parameters. Tools such as Google Test, Google Mock, and spdlog were used to ensure the correctness and robustness of the solution
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
