1,720,974 research outputs found
Strategy for Five in a Row on small boards (Logics, Algebras and Languages in Computer Science)
Get PDFA Study of Constraints on Eulerian Circuits (Logic, Algebraic system, Language and Related Areas in Computer Science)
Get PDFThe author calls the maximum of the length of a shortest subcycle of an Eulerian circuit of an Eulerian graph the Eulerian recurrence length and pursues the determination of the Eulerian recurrence length e(Kn) of a complete graph Kn with an odd size of the vertex set. So far, the value of e(Kn) has been found for all n < 15, and it has been proved that the inequality n-4 ≦ e(Kn) ≦ n-3 holds for all n ≧ 15. The author conjectures that e(Kn) = n-4 holds for all n ≧ 15 and attempts to prove this conjecture by mathematical induction with e(K₁₅) = 11 as the basis. However, running a simple search algorithm in the computing environment available to the author, it turns out that the search space is too large to prove e(K₁₅) = 11.In this paper, the author proposes to introduce two types of constraints on the edges of the trails to be searched in order to reduce the search space
Partition of an Eulerian circuit search problem for the complete graph of order 15 (Group, Ring, Language and Related Areas in Computer Science)
No full textFor odd integers greater than or equal to 15, it is known how to construct an Eulerian circuit of the complete graph of order whose shortest subcycle length is -4. Furthermore, the author and others have proved that there is no Eulerian circuit of the complete graph of order whose shortest subcycle length is greater than -2. The author and others conjecture that, for every odd integer greater than or equal to 15, there is no Eulerian circuit of the complete graph of order whose shortest subcycle length is -3. As part of the proof of the conjecture, the author and others aim to prove that there is no Eulerian circuit of a complete graph of order 15 whose shortest subcycle length is 12. Currently, we expect that the conjecture above for = 15 can be proved through large-scale distributed processing. For distributed processing to be effective, the size of each divided subproblem must be small enough to fit into the main memory. In this report, we describe the methods used to achieve this goal and discuss the possibility of applying these methods to complete the proof
Learning finite functions by neural networks : Evaluation of Pentago positions by convolutional neural networks (Algebras, logics, languages and related areas)
Get PDFA convolution neural network (CNN) is a useful tool that approximates a finite function. It is used as a solver for various problems in the real world. In this paper, results of experiments on training variations of a small CNN used for image recognition for evaluating Pentago positions are mainly reported. The author hopes that the results are used in discussion of applicability of deep neural networks to researches in theoretical computer science
Search for Eulerian Recurrent Lengths by Using Constraint Solvers (Developments of Language, Logic, Algebraic system and Computer Science)
Get PDFThe Eulerian recurrent length of a graph G, e(G), is the maximum of the shortest subcycle length of Eulerian circuits of G. Upper and lower bounds on the Eulerian recurrent length of complete graphs was provided by the author as n-4leqq e(K_{n})leqq n-3 for odd integers ngeqq 15. In this article, the method of proving the inequality is improved
Optimum Solution Search for FreeCell by Applying the Strongly Connected Component Decomposition Algorithm for Directed Graphs (Group, Algebra, Language and Related Areas in Computer Science)
No full textThe author is developing a computer-aided proof to demonstrate that there exists no Eulerian circuit of the 15-vertex complete graph that satisfies specified conditions. Depth-first search serves as the underlying principle for this proof. However, due to the limitations of the author's computational resources, a brute-force approach is deemed impractical. The primary goal of this research is to explore the effectiveness of depth-first search (DFS) algorithms in the context of the singleplayer card game FreeCell. The ultimate objective is to develop a program that can determine any shortest solution sequence to any given FreeCell problem. The research will focus on developing fundamental implementation techniques for DFS, along with advanced search strategies informed by domain knowledge of FreeCell mechanics and heuristics. In particular, application of the number of strongly connected components in a directed graph constructed from the card arrangement in the FreeCell tableau presents a promising approach to reducing the search space. Currently in the initial phases of development, this report primarily delves into the program's development strategy
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe 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
Get PDF“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
Get PDFWe 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
- …
