Filters








102,978 Hits in 6.8 sec

Comparative analysis of routing techniques in chord overlay network

Omoruyi Osemwegie, Samuel John, Adewale Adeyinka, Etinosa Noma-Osaghae, Kennedy Okokpujie
2021 International Journal of Power Electronics and Drive Systems (IJPEDS)  
This study highlights the two widely known methods of routing information employed in one of such overlay networks called chord.  ...  The results obtained show that semi recursive routing gives a better routing performance under churn scenarios.  ...  ACKNOWLEDGEMENTS The authors acknowledge the help of Covenant University in covering the costs of this publication.  ... 
doi:10.11591/ijece.v11i5.pp4361-4372 fatcat:xdbd5fugfjdstbmqiwcimlah4m

A method for validating Rent's rule for technological and biological networks

Fernando Alcalde Cuesta, Pablo González Sequeiros, Álvaro Lozano Rojo
2017 Scientific Reports  
Rent's rule is empirical power law introduced in an effort to describe and optimize the wiring complexity of computer logic graphs.  ...  We also analyzed the effect of different types of random alterations on the Rentian scaling in order to test the influence of the degree distribution.  ...  Acknowledgements This work was supported by the Spanish Statal Research Agency (Grant MTM2016-77642-C2-2-P), the Government of Galicia (Grant GPC2015/006) and the European Regional Development Fund.  ... 
doi:10.1038/s41598-017-05670-w pmid:28710373 pmcid:PMC5511203 fatcat:likavcxyabdndiyarfkhgzrhoa

Nodal domains of a non-separable problem—the right-angled isosceles triangle

Amit Aronovitch, Ram Band, David Fajman, Sven Gnutzmann
2012 Journal of Physics A: Mathematical and Theoretical  
In addition, an exact recursive formula for the number of nodal domains is found to reproduce all existing data.  ...  Eventually we use the recursion formula to analyse a large sequence of nodal counts statistically.  ...  Acknowledgements We are grateful to Uzy Smilansky for presenting the problem to us and for the continuous support of the work. We thank Amit Godel for fruitful discussions.  ... 
doi:10.1088/1751-8113/45/8/085209 fatcat:jm4j62rzpfbp3mojvderqfd5t4

Some observations on the connection between counting and recursion

Klaus W. Wagner
1986 Theoretical Computer Science  
Based on Valiant's class ~'P of all functions counting the number of accepting computations of nondeterministic polynomial-time Turing machines, the polynomial-time hierarchy of counting functions is introduced  ...  The class PHCF of all functions of this hierarchy and some of its subclasses are characterized by recursion-theoretic means.  ...  Acknowledgment I am grateful to Uwe Sch/fning, Koblenz, for some helpful hints.  ... 
doi:10.1016/0304-3975(86)90141-6 fatcat:zcgojve77zeojmt3pzbqij5imm

The Pósa method with ATD lenses: Praxeological analysis on math problems in Hungarian talent care education with 'recursion' in their logos blocksLa méthode Pósa avec des lentilles TAD: analyse praxéologique des problèmes mathématiques dans l'enseignement hongrois de soins aux talents avec «récursion» dans leurs blocs de logos

Dániel Katona
2020 Educação Matemática Pesquisa Revista do Programa de Estudos Pós-Graduados em Educação Matemática  
Abstract.The praxeological analysis of selected questions used in the Hungarian Pósa method is presented, focusing on a common element in their logos blocks, called recursive thinking.  ...  Based on these results gained by using tools of the Anthropological Theory of the Didactic, the paper offers a partial description of the didactic strategy of the Pósa method for inquiry-based learning  ...  They discuss students' solutions, implications, the relationships between the solved problems, and -as an important part -may pose new problems they are interested on the basis of the solved ones, some  ... 
doi:10.23925/1983-3156.2020v22i4p259-281 fatcat:e2aphsjpirdtnh6ovuyb2wkwcq

On Some Techniques for Streaming Data: A Case Study of Internet Packet Headers

Edward J Wegman, David J Marchette
2003 Journal of Computational And Graphical Statistics  
We begin our discussion with a discussion of Internet traffic in order to give the reader some sense of the time and data scale and visual resolution needed for such problems.  ...  Because it is essentially impossible to store streaming data, we consider recursive algorithms, algorithms which are adaptive and discount the past and also algorithms that create finite pseudo-samples  ...  In the next sections, we will describe our project including some background on TCP/IP traffic, indicate some recursive methods capable of handling streaming data, and give some suggestions for visualization  ... 
doi:10.1198/1061860032625 fatcat:6uu3qxje75hyrbrptvika4rtgq

Counting Triangulations and other Crossing-Free Structures Approximately [article]

Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
2014 arXiv   pre-print
In this paper we address the question of whether one can approximately count triangulations in sub-exponential time.  ...  Our algorithm can be adapted to approximately count other crossing-free structures on P, keeping the quality of approximation and running time intact.  ...  Now observe that there is a one-to-one correspondence between matchings of P and legal annotated triangulations.  ... 
arXiv:1404.0261v1 fatcat:yhpmuzxhhnhstngcxfo3bjils4

Counting triangulations and other crossing-free structures approximately

Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
2015 Computational geometry  
In this paper we address the question of whether one can approximately count triangulations in sub-exponential time.  ...  Our algorithm can be adapted to approximately count other crossing-free structures on P , keeping the quality of approximation and running time intact.  ...  Now observe that there is a one-to-one correspondence between matchings of P and legal annotated triangulations.  ... 
doi:10.1016/j.comgeo.2014.12.006 fatcat:bovgoagpjrajhi5tyhhoh7umea

Title

Robert Ganian, Thekla Hamm, Topi Talvitie
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We consider the problem of counting the number of DAGs which are Markov-equivalent, i.e., which encode the same conditional independencies between random variables.  ...  On the theoretical side, we show that our algorithm is guaranteed to run in polynomial time on a broad class of chordal graphs, including interval graphs.  ...  Robert Ganian and Thekla Hamm acknowledge support from the Austrian Science Fund (FWF, Project P31336: NFPC). Thekla Hamm is co-funded by FWF project W1255-N23.  ... 
doi:10.1609/aaai.v34i06.6573 fatcat:dfl37m3ugndxze5tavlxrpdtsq

Mining Temporal Evolution of Knowledge Graph and Genealogical Features for Literature-based Discovery Prediction [article]

Nazim Choudhury, Fahim Faisal, Matloob Khushi
2019 arXiv   pre-print
Both node and edge-level features were input into an LSTM network to forecast the feature values for positive and negatively labeled non-connected keyword pairs and classify them accurately.  ...  Framing the problem as a dynamic supervised link prediction task, the proposed framework integrates some novel node and edge-level features.  ...  The computation is an iterative procedure that starts at an author, a0. The first iteration counts the number of authors that used a keyword which is also used by a0.  ... 
arXiv:1907.09395v2 fatcat:klqxoao7gvf2jgodph5cebpkbi

An analysis of the influence of question design on learners' approaches to number pattern generalisation tasks

Duncan Samson, Marc Schäfer
2007 Pythagoras  
An understanding of the importance of appropriate question design has direct pedagogical application within the context of the mathematics classroom.  ...  In addition, a meta-analysis focused on the formula derived for the nth term in conjunction with its justification.  ...  The counting strategy (recursive approach) was used in one of two different modes, either (a) on its own as sole strategy, or (b) in combination with an explicit strategy.  ... 
doi:10.4102/pythagoras.v0i66.79 fatcat:zmtt3seghzhytayzokl25t7t7a

Algebraic generalisation strategies: Factors influencing student strategy selection

John Lannin, David Barker, Brian Townsend
2006 Mathematics Education Research Journal  
This study reports on the algebraic generalisation strategies used by two fifth grade students along with the factors that appeared to influence these strategies.  ...  of the situation, and (e) social interactions with the teacher and other student.  ...  Instead, Stacey and MacGregor encouraged the use of tasks that diminish the emphasis on the recursive relationship, focusing students on the connection between the input and output values so that students  ... 
doi:10.1007/bf03217440 fatcat:ryarqcmmvvclxipxzr6mq6ykte

Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs

Ming-Yang Kao, Philip N. Klein
1993 Journal of computer and system sciences (Print)  
Currently, there is a significant gap between the best sequential and parallel complexities of many fundamental problems related to digraph reachability.  ...  Furthermore, for planar digraphs, we give polylog-time algorithms for the following problems: (1) directed ear decomposition, (2) topological ordering, (3) digraph reachability, (4) descendent counting  ...  The research of the first author was supported in part by NSF Grant CCR-8909323. The research of the second author was supported in part by ONR Grant N00014-88-K-0243 and DARPA Grant N00039-88-C0113.  ... 
doi:10.1016/0022-0000(93)90042-u fatcat:4jb5tnrxobdldlrbnzbzqa2wfy

Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

M.-Y. Kao, P. N. Klein
1990 Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90  
Currently, there is a significant gap between the best sequential and parallel complexities of many fundamental problems related to digraph reachability.  ...  Furthermore, for planar digraphs, we give polylog-time algorithms for the following problems: (1) directed ear decomposition, (2) topological ordering, (3) digraph reachability, (4) descendent counting  ...  The research of the first author was supported in part by NSF Grant CCR-8909323. The research of the second author was supported in part by ONR Grant N00014-88-K-0243 and DARPA Grant N00039-88-C0113.  ... 
doi:10.1145/100216.100237 dblp:conf/stoc/KaoK90 fatcat:fvdrufhpvfgxdmm6yuu7dezemy

Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language

Pyeong Whan Cho, Emily Szkudlarek, Whitney Tabor
2016 Frontiers in Psychology  
the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were  ...  In particular, we focus on a variant of the simplest recursive language, a n b n , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the  ...  ACKNOWLEDGMENTS SUPPLEMENTARY MATERIAL The Supplementary Material for this article can be found online at: http://journal.frontiersin.org/article/10.3389/fpsyg. 2016.00867  ... 
doi:10.3389/fpsyg.2016.00867 pmid:27375543 pmcid:PMC4897795 fatcat:c4k3fvcsuzfltbwfqg7pfy2d2m
« Previous Showing results 1 — 15 out of 102,978 results