Results 41 to 50 of about 16,529,293 (335)
Generating random networks with given degree-degree correlations and degree-dependent clustering
, 2007 Random networks are widely used to model complex networks and research their properties. In order to get a good approximation of complex networks encountered in various disciplines of science, the ability to tune various statistical properties of random ...
Andreas Pusch +3 more
core +1 more source
On the Degree-Based Topological Indices of the Tickysim SpiNNaker Model
Axioms, 2018 Tickysim is a clock tick-based simulator for the inter-chip interconnection network of the SpiNNaker architecture. Network devices such as arbiters, routers, and packet generators store, read, and write forward data through fixed-length FIFO buffers.
Muhammad Imran +4 more
doaj +1 more source
Degree distributions of growing networks [PDF]
, 2001 The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree.
A. Broder +16 more
core +2 more sources
Optimization of the Municipal Waste Collection Route Based on the Method of the Minimum Pairing
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 2016 In the present article is shown the use of Maple program for processing of data describing the position of municipal waste sources and topology of collecting area.
Michal Petřík, Stanislav Bartoň
doaj +1 more source
Ve‐Degree, Ev‐Degree, and Degree‐Based Topological Indices of Fenofibrate
Journal of Mathematics, 2022 The molecular topology of a graph is described by topological indices, which are numerical measures. In theoretical chemistry, topological indices are numerical quantities that are used to represent the molecular topology of networks. These topological indices can be used to calculate several physical and chemical properties of chemical compounds, such
Sadık Delen +6 more
openaire +3 more sources
Degree bounds for separating invariants [PDF]
, 2010 If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f from S such that ...
Kohls, Martin, Kraft, Hanspeter
core +3 more sources
Faculty of Librarianship and Information science: Departments, fields, majors and proposed academic levels [PDF]
تحقیقات کتابداری و اطلاعرسانی دانشگاهی, 2011 Objective: Establishing the Library and Information Science Faculty of Tehran University requires proper plan for departments, disciplines, specialties, and degrees.
Gh Fadaie, Elham Barmar
doaj
Ethnicity and degree attainment [PDF]
, 2006 In this paper, we investigate the low degree attainment of ethnic minority students in higher education in England. Using a partial proportional odds model and data from the Higher Education Statistics Agency for qualifiers who started their course of ...
Broecke, Stijn, Nicholls, Tom
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric patients with extracranial solid tumors (ST) receiving chemotherapy are at an increased risk for Pneumocystis jirovecii pneumonia (PJP). However, evidence guiding prophylaxis practices in this population is limited. A PJP‐related fatality at our institution highlighted inconsistent prescribing approaches and concerns about
Kriti Kumar +8 more
wiley +1 more source
Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees [PDF]
Internet Mathematics, 2014 In network theory, Pearson's correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences.
van der Hoorn, W.L.F., Litvak, Nelly
openaire +3 more sources