1,720,997 research outputs found
SMARANDACHE FUNCTION JOURNAL, 6
Get PDFThis journal is yearly published (in the Spring or Fall) in a 300-400 pages volume, and 800-1000 copies. SNJ is a referred journal: reviewed, indexed, cited, concerning any of Smarandache type functions, numbers, sequences, integer algorithms, paradoxes, Non-Euclidean geometries, etc
ERDOS-SMARANDACHE MOMENTS NUMBERS
Get PDFThe starting point of this article is represented by a recent work of Finch [2000]. Based on two asymptotic results concerning the Erdos function, he proposed some interesting equation concerning the moments of the Smarandache function. The aim of this note is give a bit modified proof and to show some computation results for one of the Finch equation. We will call the numbers obtained from computation 'Erdos-Smarandache Moments Number'. The ErdosSmarandache moment number of order 1 is obtained to be the Golomb-Dickman constant
About Smarandache-Multiplicative Functions
Get PDFThe main objective of this note is to introduce the notion of the S-multiplicative function and to give some simple properties concerning it. The name of S-multiplicative is short for Smarandache-multiplicative and reflects the main equation of the Smarandache function
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
A Generalisation of Euler's function
Get PDFThe aim of this article is to propose a generalisation for Euler's function
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
THE A VERAGE OF THE ERDOS FUNCTION
Get PDFThe aim of this article is to establish the complexity order of the Erdos function average. This will be studied based on some recent results about the Smarandache function
SMARANDACHE FUNCTION JOURNAL, 11
No full textThis journal is yearly published (in the Spring or Fall) in a 300-400 pages volume, and 800-1000 copies. SNJ is a referred journal: reviewed, indexed, cited, concerning any of Smarandache type functions, numbers, sequences, integer algorithms, paradoxes, Non-Euclidean geometries, etc
The Flag-based Algorithm - A Novel Greedy Method that Optimizes Protein Communities Detection
Get PDFProteins and the networks they determine, called interactome networks, have received attention at an important degree during the last years, because they have been discovered to have an influence on some complex biological phenomena, such as problematic disorders like cancer. This paper presents a contribution that aims to optimize the detection of protein communities through a greedy algorithm that is implemented in the C programming language. The optimization involves a double improvement in relation to protein communities detection, which is accomplished both at the algorithmic and programming level. The resulting implementation’s performance was carefully tested on real biological data and the results acknowledge the relevant speedup that the optimization determines. Moreover, the results are in line with the previous findings that our current research produced, as it reveals and confirms the existence of some important properties of those proteins that participate in the carcinogenesis process. Apart from being particularly useful for research purposes, the novel community detection algorithm also dramatically speeds up the proteomic databases analysis process, as compared to some other sequential community detection approaches, and also to the sequential algorithm of Newman and Girvan
- …
