Relevant bibliographies by topics / Maximum Number of Nodes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Maximum Number of Nodes'

Author: Grafiati
Published: 4 June 2025
Last updated: 23 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Maximum Number of Nodes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Maximum Number of Nodes"

1

Jiang, Xuejun, Wenbo Zhang, Lincong Zhang, and Xiaobo Tan. "Research on Wireless Sensor Actuator Distribution Algorithm Meeting Maximum Request Expectation." International Journal of Online Engineering (iJOE) 13, no. 04 (2017): 57. http://dx.doi.org/10.3991/ijoe.v13i04.6584.

Full text
Abstract:
<strong>In wireless sensor actuator networks, actuator nodes are very important to network coverage for wireless sensor. So according to the characteristics that wireless communication is easy to be affected by the environment, in this wireless sensor actuator network the actuator nodes are abstracted to be service providers and the sensor nodes are abstracted to be service consumers. Furthermore, the messages transferred from actuator nodes to sensor nodes are abstracted to be service requests and the coverage of sensor nodes by actuator nodes is service providing. Moreover, the service faulty ratio of actuator nodes is defined in this paper. Based on that, an actuator node coverage algorithm that satisfies the maximum request expectation is put forwarded. Its goal is to solve the mathematical expectation of maximizing the number of service requests with fixed number of sensor nodes and actuator nodes. So the optimal position of actuator nodes could be identified. The theoretic proof and simulation result show that this algorithm is more efficient compared with similar algorithms</strong>
APA, Harvard, Vancouver, ISO, and other styles
2

Romanuke, Vadim. "Building Minimum Spanning Trees under Maximum Edge Length Constraint." Information Technology and Management Science 26 (November 30, 2023): 17–26. http://dx.doi.org/10.7250/itms-2023-0003.

Full text
Abstract:
Given an initial set of planar nodes, the problem is to build a minimum spanning tree connecting the maximum possible number of nodes by not exceeding the maximum edge length. To obtain a set of edges, a Delaunay triangulation is performed over the initial set of nodes. Distances between every pair of the nodes in respective edges are calculated used as graph weights. The edges whose length exceeds the maximum edge length are removed. A minimum spanning tree is built over every disconnected graph. The minimum spanning trees covering a maximum of nodes are selected, among which the tree whose length is minimal is the solution. It is 1.17 % shorter on average for 10 to 80 nodes compared to a nonselected tree.
APA, Harvard, Vancouver, ISO, and other styles
3

Di, Ruo-Hai, Ye Li, Ting-Peng Li, Lian-Dong Wang, and Peng Wang. "Dynamic Programming Structure Learning Algorithm of Bayesian Network Integrating MWST and Improved MMPC." Mathematical Problems in Engineering 2021 (December 31, 2021): 1–17. http://dx.doi.org/10.1155/2021/9199951.

Full text
Abstract:
Dynamic programming is difficult to apply to large-scale Bayesian network structure learning. In view of this, this article proposes a BN structure learning algorithm based on dynamic programming, which integrates improved MMPC (maximum-minimum parents and children) and MWST (maximum weight spanning tree). First, we use the maximum weight spanning tree to obtain the maximum number of parent nodes of the network node. Second, the MMPC algorithm is improved by the symmetric relationship to reduce false-positive nodes and obtain the set of candidate parent-child nodes. Finally, with the maximum number of parent nodes and the set of candidate parent nodes as constraints, we prune the parent graph of dynamic programming to reduce the number of scoring calculations and the complexity of the algorithm. Experiments have proved that when an appropriate significance level α is selected, the MMPCDP algorithm can greatly reduce the number of scoring calculations and running time while ensuring its accuracy.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Letian. "Identifying Vital Nodes by Local g-Core on Symmetric Networks." Symmetry 17, no. 6 (2025): 925. https://doi.org/10.3390/sym17060925.

Full text
Abstract:
The H-index is a widely recognized centrality measure for nodes in symmetric networks, defined as the maximum number of neighbors with degrees equal to or greater than the node’s own degree. However, this metric underestimates the structural influence of “weak nodes”—low-degree nodes connected to high-degree hubs—that often serve as critical connectors in network topology. To address this limitation, we propose the Hα-index, which generalizes the H-index by considering the maximum number of neighbors with degrees at least α times the node’s degree, where α≥1. Based on this refinement, we introduce two novel centrality measures: the g-core and the local g-core, which were derived from iterative applications of the Hα-index to a node’s neighbors. Extensive experiments on sixteen real-world networks demonstrate the efficiency of our methods. Notably, the local g-core achieves 45–105% higher Kendall Tau correlation coefficients compared to the traditional H-index and coreness on three benchmark networks, highlighting its superior performance in capturing node influence.
APA, Harvard, Vancouver, ISO, and other styles
5

YI, CHIH-WEI, PENG-JUN WAN, CHAO-MIN SU, KUO-WEI LIN, and SCOTT C. H. HUANG. "ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS." Discrete Mathematics, Algorithms and Applications 02, no. 01 (2010): 107–24. http://dx.doi.org/10.1142/s1793830910000516.

Full text
Abstract:
In this paper, we study the connectivity of wireless ad hoc networks that are composed of unreliable nodes and links by investigating the distribution of the number of isolated nodes. We assume that a wireless ad hoc network consists of n nodes distributed independently and uniformly in a unit-area disk or square. All nodes have the same maximum transmission radius rn, and two nodes have a link if their distance is at most rn. Nodes are active independently with probability 0 < p1 ≤ 1, and links are up independently with probability 0 < p2 ≤ 1. Nodes are said isolated if they do not have any links to active nodes. We show that if [Formula: see text] for some constant ξ, then the total number of isolated nodes (or isolated active nodes, respectively) is asymptotically Poisson with mean e-ξ (or p1e-ξ, respectively). In addition, in the secure wireless networks that adopt m-composite key predistribution schemes, a node is said isolated if it does not have a secure link. Let p denote the probability of the event that two neighbor nodes have a secure link. If all nodes have the same maximum transmission radius [Formula: see text], the total number of isolated nodes is asymptotically Poisson with mean e-ξ.
APA, Harvard, Vancouver, ISO, and other styles
6

Jindal, Pawan, Amit Kumar, and Shishir Kumar. "Minimum and maximum ratio of number of red internal nodes to black internal nodes in Red Black tree." International Journal of Computer Applications 5, no. 9 (2010): 1–2. http://dx.doi.org/10.5120/965-1112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kowsalya, P., and D. Vijayalakshmi. "On Radio k – Chromatic Number for Mycielski of Some Graphs." Indian Journal Of Science And Technology 17, no. 39 (2024): 4129–37. http://dx.doi.org/10.17485/ijst/v17i39.2315.

Full text
Abstract:
Objectives: In radio networks, the main difficulty is managing the radio spectrum, assigning radio frequencies to transmitters optimally without any interferences. This study aims to find the smallest span of Mycielski of some graphs, the maximum color assigned to any node is called span. Methods : This study focused on the problem of reducing interference by modeling it with a radio k - coloring problem on graphs. Where transmitters are modeled as nodes in a graph, with edges connecting nodes that represent transmitters in close proximity to one another. For a graph , with node set , edge set and an integer , a radio k - coloring of is a function satisfying the condition for any two nodes and , where is the distance between and in . The radio k - coloring of , is the maximum color assigned to any node of and it is denoted by . The radio k -chromatic number of is the minimum value of taken over all radio k - coloring of and it is denoted by . Findings: This study obtained the radio k-chromatic number for Mycielski of some graphs for and 3 Novelty: To solve the channel assignment problem in radio transmitters, the interference graph is developed, and the channel assignment has been converted into a graph coloring. Reducing the interference by a radio k - coloring problem will motivate many researchers to find the radio k - coloring in various graphs. Keywords: Radio k – Coloring, Mycielski graph, Double Star graph, Triple Star graph, Sunlet graph, Helm graph and Closed Helm graph
APA, Harvard, Vancouver, ISO, and other styles
8

Jerbi, Wassim, Hafedh Trabelsi, and Abderrahmen Guermazi. "Equilibrate and Minimize the Energy Consumption in a Cluster for Routing Protocols in Wireless Sensor Network." International Journal of Wireless Networks and Broadband Technologies 5, no. 1 (2016): 46–58. http://dx.doi.org/10.4018/ijwnbt.2016010103.

Full text
Abstract:
The Cluster Head is selected on the basis of maximum number of nodes connected, thus several sensor nodes cannot reach any CH, even though they are in the transmission range. These nodes are called the isolated nodes. To solve this problem, the proposed a sub_cluster protocol, its role is to reduce the sensor nodes which do not belong the cluster. The major novel contribution of the proposed work is the sub_cluster protocol which provides coverage of the whole network with a minimum number of isolated nodes and has a very high connectivity rates. The sub_cluster protocol allows firstly with great cluster can be grouped many sub_cluster protocol connected to major CH, each sub_cluster protocol, can be connected of the maximum nodes non CH.
APA, Harvard, Vancouver, ISO, and other styles
9

Gabriel, Michael W., George Y. Matsui, Robert Friedman, and Charles R. Lovell. "Optimization of Multilocus Sequence Analysis for Identification of Species in the Genus Vibrio." Applied and Environmental Microbiology 80, no. 17 (2014): 5359–65. http://dx.doi.org/10.1128/aem.01206-14.

Full text
Abstract:
ABSTRACTMultilocus sequence analysis (MLSA) is an important method for identification of taxa that are not well differentiated by 16S rRNA gene sequences alone. In this procedure, concatenated sequences of selected genes are constructed and then analyzed. The effects that the number and the order of genes used in MLSA have on reconstruction of phylogenetic relationships were examined. TherecA,rpoA,gapA, 16S rRNA gene,gyrB, andftsZsequences from 56 species of the genusVibriowere used to construct molecular phylogenies, and these were evaluated individually and using various gene combinations. Phylogenies from two-gene sequences employingrecAandrpoAin both possible gene orders were different. The addition of thegapAgene sequence, producing all six possible concatenated sequences, reduced the differences in phylogenies to degrees of statistical (bootstrap) support for some nodes. The overall statistical support for the phylogenetic tree, assayed on the basis of a reliability score (calculated from the number of nodes having bootstrap values of ≥80 divided by the total number of nodes) increased with increasing numbers of genes used, up to a maximum of four. No further improvement was observed from addition of the fifth gene sequence (ftsZ), and addition of the sixth gene (gyrB) resulted in lower proportions of strongly supported nodes. Reductions in the numbers of strongly supported nodes were also observed when maximum parsimony was employed for tree construction. Use of a small number of gene sequences in MLSA resulted in accurate identification ofVibriospecies.
APA, Harvard, Vancouver, ISO, and other styles
10

Hayat, Fazal, and Daniele Ettore Otera. "Extremal k-Connected Graphs with Maximum Closeness." Axioms 13, no. 12 (2024): 810. http://dx.doi.org/10.3390/axioms13120810.

Full text
Abstract:
Closeness is a measure that quantifies how quickly information can spread from a given node to all other nodes in the network, reflecting the efficiency of communication within the network by indicating how close a node is to all other nodes. For a graph G, the subset S of vertices of V(G) is called vertex cut of G if the graph G−S becomes disconnected. The minimum cardinality of S for which G−S is either disconnected or contains precisely one vertex is called connectivity of G. A graph is called k-connected if it stays connected even when any set of fewer than k vertices is removed. In communication networks, a k-connected graph improves network reliability; even if up to k−1 nodes fail, the network remains operational, maintaining connectivity between devices. This paper aims to study the concept of closeness within n-vertex graphs with fixed connectivity. First, we identify the graphs that maximize the closeness among all graphs of order n with fixed connectivity k. Then, we determine the graphs that achieve the maximum closeness within all k-connected graphs of order n, given specific fixed parameters such as diameter, independence number, and minimum degree.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Maximum Number of Nodes"

1

Bekos, Michael A., Michael Kaufmann, Stephen G. Kobourov, Konstantinos Stavropoulos, and Sankar Veeramoni. "The maximum k-differential coloring problem." ELSEVIER SCIENCE BV, 2017. http://hdl.handle.net/10150/626126.

Full text
Abstract:
Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential coloring problem asks for a coloring of the vertices of G(if one exists) with distinct numbers from 1 to kn(treated as colors), such that the minimum difference between the two colors of any adjacent vertices is at least d. While it was known that the problem of determining whether a general graph is (2, n)-differential colorable is NP-complete, our main contribution is a complete characterization of bipartite, planar and outerplanar graphs that admit (2, n)-differential colorings. For practical reasons, we also consider color ranges larger than n, i.e., k > 1. We show that it is NP-complete to determine whether a graph admits a (3, 2n)-differential coloring. The same negative result holds for the (left perpendicular 2n/3 right pendicular, 2n)-differential coloring problem, even in the case where the input graph is planar.
APA, Harvard, Vancouver, ISO, and other styles
2

Nieuwoudt, Isabelle. "On the maximum degree chromatic number of a graph." Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/46214.

Full text
Abstract:
ENGLISH ABSTRACT: Determining the (classical) chromatic number of a graph (i.e. finding the smallest number of colours with which the vertices of a graph may be coloured so that no two adjacent vertices receive the same colour) is a well known combinatorial optimization problem and is widely encountered in scheduling problems. Since the late 1960s the notion of the chromatic number has been generalized in several ways by relaxing the restriction of independence of the colour classes.<br>AFRIKAANSE OPSOMMING: Die bepaling van die (klassieke) chromatiese getal van ’n grafiek (naamlik die kleinste aantal kleure waarmee die punte van ’n grafiek gekleur kan word sodat geen twee naasliggende punte dieselfde kleur ontvang nie) is ’n bekende kombinatoriese optimeringsprobleem wat wyd in skeduleringstoepassings te¨egekom word. Sedert die laat 1960s is die definisie van die chromatiese getal op verskeie maniere veralgemeen deur die vereiste van onafhanklikheid van die kleurklasse te verslap.<br>Thesis (DPhil)--Stellenbosch University, 2007.
APA, Harvard, Vancouver, ISO, and other styles
3

GALATI, CONCETTINA. "Number of moduli of families of plane curves with nodes and cusps." Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2006. http://hdl.handle.net/2108/210.

Full text
Abstract:
In my Ph.D.-thesis I computed the number of moduli of certain families of plane curves with nodes and cusps. Let Σn k,d ⊂ P(H0(P2,OP2(n))) := PN, with N = n(n+3)2 , be the closure, in the Zariski’s topology, of the locally closed set of reduced and irreducible plane curves of degree n with k cusps and d nodes. We recall that, if k = 0, the varieties Vn,g = Σn0,d are called the Severi varieties of irreducible plane curves of degree n and geometric genus g = n−1 2 − d. Let Σ⊂ Σn k,d be an irreducible component of Σn k,d and let g = n−1 2 −d−k be the geometric genus of the plane curve corresponding to the general point of Σ. It is naturally defined a rational map ΠΣ : Σ Mg, sending the general point [Γ] ∈ Σ to the isomorphism class of the normalization of the plane curve Γ corresponding to the point [Γ]. We set number of moduli of Σ := dim(ΠΣ(Σ)). If k < 3n, then (1) dim(ΠΣ(Σ)) ≤ min(dim(Mg), dim(Mg) + ρ − k), where ρ := ρ(2, g, n) = 3n − 2g − 6 is the Brill-Neother number of the linear series of degree n and dimension 2 on a smooth curve of genus g. We say that Σ has the expected number of moduli if the equality holds in (1). By classical Brill-Neother theory when ρ is positive and by a well know result of Sernesi when ρ ≤ 0, we have that Σn0,d, (which is irreducible), has the expected number of moduli for every d ≤ n−1 2 . Working out the main ideas and techniques that Sernesi uses in [1], under the hypothesis k > 0, in my Ph.D.-thesis I find sufficient conditions in order that an irreducible component Σ ⊂ Σn k,d has the expected number of moduli. If Σ verifies these properties, then ρ ≤ 0. By using induction on the degree n and on the genus g of the general curve of the family, I prove that, if ρ ≤ 0 and k ≤ 6, then there exists at least one irreducible component of Σn k,d with expected number of moduli equal to 3g−3+ρ−k. By using this result and a result of Eisembud and Harris, from which it follows that, if ρ is positive enough and k ≤ 3 then dim(ΠΣ(Σ)) = 3g − 3, I prove that Σn1,d (which is irreducible) has the expected number of moduli for every d ≤ n−1 2 , i.e. for every ρ. I am extending this result to the case k ≤ 3. Finally, I consider the case of irreducible sextics with six cusps. It is classically know that Σ66,0 contains at least two irreducible components Σ1 and Σ2. The general point of Σ1 parametrizes a sextic with six cusps on a conic, whereas the general element of Σ2 corresponds to a sextic with six cusps not on a conic. I prove that Σ1 and Σ2 have expected number of moduli. I don’t still know example of irreducible complete families of plane curves with nodes and cusps having number of moduli smaller that the expected. Finally, in the first sections of my thesis, following essentially Zariski’s papers, I introduce classical techniques used to study and describe the geometry of a family of plane curves with assigned singularities. Then, I briefly resume the more modern results by Wahl on families of plane curves with nodes and cusps. I also give some applications of Horikawa deformation theory to the study of deformations of plane curves. Finally, I devoted a section of my thesis to the versal deformation family of plane curve singularity. In particular, by using the results of [3] and [2] and a simple argument of projective geometry, I proved that in the equigeneric locus of the ´etale versal deformation space B of an ordinary plane curve singularity there are only points corresponding to a plane curve with only ordinary multiple points. I mean that this result is known, but I haven’t found in literature a proof of this. References [1] E. Sernesi:On the existence of certain families of curves, Invent. math. vol. 75, (1984). [2] A. Morelli:Un’osservazione sulle singolarita’ delle trasformate birazionali di una curva algebrica, Rend. Acc. Sci. Napoli, serie 4 vol. 29 (1962), p.59-64. [3] A. Franchetta: Osservazioni sui punti doppi delle superfici algebriche, Rend. Acc. dei Lincei, gennaio 1946.
APA, Harvard, Vancouver, ISO, and other styles
4

Farzad, Babak. "When the chromatic number is close to the maximum degree." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ58773.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Owens, Kayla Denise. "Properties of the Zero Forcing Number." BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/2216.

Full text
Abstract:
The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S(F,G) denote the set of all symmetric matrices A=[a_{ij}] with entries in F such that a_{ij} doess not equal 0 if and only if ij is an edge in G. Find the minimum possible rank of a matrix in S(F,G). It is known that the zero forcing number Z(G) provides an upper bound for the maximum nullity of a graph. I investigate properties of the zero forcing number, including its behavior under various graph operations.
APA, Harvard, Vancouver, ISO, and other styles
6

Katzenbeisser, Walter, and Wolfgang Panny. "On the Number of Times where a simple Random Walk reaches its Maximum." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 1990. http://epub.wu.ac.at/834/1/document.pdf.

Full text
Abstract:
Let Q, denote the number of times where a simple random walk reaches its maximum, where the random walk starts at the origin and returns to the origin after 2n steps. Such random walks play an important r6le in probability and statistics. In this paper the distribution and the moments of Q, are considered and their asymptotic behavior is studied. (author's abstract)<br>Series: Forschungsberichte / Institut für Statistik
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Jinhua. "A Wide Input Power Line Energy Harvesting Circuit For Wireless Sensor Nodes." Thesis, Virginia Tech, 2021. http://hdl.handle.net/10919/103426.

Full text
Abstract:
Massive deployment of wireless IoT (Internet of Things) devices makes replacement or recharge of batteries expensive and impractical for some applications. Energy harvesting is a promising solution, and various designs are proposed to harvest power from ambient resources including thermal, vibrational, solar, wind, and RF sources. Among these ambient resources, AC powerlines are a stable energy source in an urban environment. Many researchers investigated methods to exploit this stable source of energy to power wireless IoT devices. The proposed circuit aims to harvest energy from AC powerlines with a wide input range of from 10 to 50 A. The proposed system includes a wake-up circuit and is capable of cold-start. A buck-boost converter operating in DCM is adopted for impedance matching, where the impedance is rather independent of the operation conditions. So, the proposed system can be applied to various types of wireless sensor nodes with different internal impedances. Experimental results show that the proposed system achieves an efficiency of 80.99% under the powerline current of 50 A.<br>M.S.<br>Nowadays, with the magnificent growth of IoT devices, a reliable, and efficient energy supply system becomes more and more important, because, for some applications, battery replacement is very expensive and sometimes even impossible. At this time, a well-designed self-contained energy harvesting system is a good solution. The energy harvesting system can extend the service life of the IoT devices and reduce the frequency of charging or checking the device. In this work, the proposed circuit aims to harvest energy from the AC power lines, and the harvested power intends to power wireless sensor nodes (WSNs). By utilizing the efficient and self-contained EH system, WSNs can be used to monitor the temperature, pressure, noise level and humidity etc. The proposed energy harvesting circuit was implemented with discrete components on a printed circuit board (PCB). Under a power line current of 50 A @ 50 Hz, the proposed energy harvesting circuit can harvest 156.6 mW, with a peak efficiency of 80.99 %.
APA, Harvard, Vancouver, ISO, and other styles
8

Hernandez, Baez Diana Margarita. "Establishing the maximum carbon number for reliable quantitative gas chromatographic analysis of heavy ends hydrocarbons." Thesis, Heriot-Watt University, 2013. http://hdl.handle.net/10399/2674.

Full text
Abstract:
This Thesis investigates the two main limitations of high temperature gas chromatography (HTGC) in the analysis of heavy n-alkanes: pyrolysis inside the GC column and incomplete elution. The former is studied by developing and reducing a radical pyrolysis model (7055 reactions) into a molecular pyrolysis model (127 reactions) capable of predicting low conversions of (nC14H30-nC80H162) at temperatures up to 430°C. Validation of predicted conversion with literature data for nC14H30, nC16H34 and nC25H52 yielded an error lower than 5.4%. The latter is addressed by developing an analytical model which solves recursively the diffusion and convection phenomena separately. The model is capable of predicting the position and molar distribution of components, using as main input the analytes’ distribution factors and yielded an error lower than 4.4% in the prediction of retention times. This thesis provides an extension of the data set of distribution factors of (nC12H26– nC98H198) in a SGE HT5 GC capillary column, based on isothermal GC measurements at both constant inlet pressure and flow rate. Finally, the above two models were coupled, yielding a maximum mass lost of 1.3 % in the case of nC80H162 due to pyrolysis and complete elution up to nC70H142, in a 12 m HT5 column.
APA, Harvard, Vancouver, ISO, and other styles
9

Ozisik, Sevtap. "Fully Computable Convergence Analysis Of Discontinous Galerkin Finite Element Approximation With An Arbitrary Number Of Levels Of Hanging Nodes." Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614345/index.pdf.

Full text
Abstract:
In this thesis, we analyze an adaptive discontinuous finite element method for symmetric second order linear elliptic operators. Moreover, we obtain a fully computable convergence analysis on the broken energy seminorm in first order symmetric interior penalty discontin- uous Galerkin finite element approximations of this problem. The method is formulated on nonconforming meshes made of triangular elements with first order polynomial in two di- mension. We use an estimator which is completely free of unknown constants and provide a guaranteed numerical bound on the broken energy norm of the error. This estimator is also shown to provide a lower bound for the broken energy seminorm of the error up to a constant and higher order data oscillation terms. Consequently, the estimator yields fully reliable, quantitative error control along with efficiency. As a second problem, explicit expression for constants of the inverse inequality are given in 1D, 2D and 3D. Increasing mathematical analysis of finite element methods is motivating the inclusion of mesh dependent terms in new classes of methods for a variety of applications. Several inequalities of functional analysis are often employed in convergence proofs. Inverse estimates have been used extensively in the analysis of finite element methods. It is char- acterized as tools for the error analysis and practical design of finite element methods with terms that depend on the mesh parameter. Sharp estimates of the constants of this inequality is provided in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
10

Marrikie, Rami, and Waled Rached. "A comparative study on Tor’s client compromise rates when changing the number of guard nodes and their rotation time." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-302417.

Full text
Abstract:
The Tor Project is a non-profit organization with the belief that Internet users should have private access to an uncensored Web. Tor accomplishes this through onion routing, which uses multi-layered encryption. Tor’s design is not flawless and different attacks are being performed to deanonymize users. In this report, we studied one of the key strategies, that Tor implemented to reduce the number of such attacks. This strategy is about assigning a list containing three guard nodes to each client. To find a lower client compromise rate, a software called COGS was used for simulation purposes. In our simulations, we changed the time interval, in which guard nodes are assigned to a user, either by decreasing it to 15 - 30 days or increasing it to 60 - 90 days. Another parameter we changed was the number of guard nodes in the client’s guard node list, either by decreasing it to one guard node or increasing it to five guard nodes. After plotting the output data from our simulations, we conclude that decreasing the number of guard nodes in a client’s guard list while increasing the guard rotation time yields the lowest client compromise rate possible. This setup could harm the performance of the Tor network, since guard nodes would be accumulating clients over time and therefore, a bigger study that includes other factors like performance should be conducted to be able to find a better balance between anonymity and performance.<br>Tor-projektet är en ideell organisation med tron att internetanvändare har rätt till ett privat och ocensurerat nät. Tor åstadkommer detta genom så kallad Onion Routing, som använder kryptering i flera lager. Tors design är inte felfri och olika attacker utförs för att deanonymisera användare. I denna rapport studerade vi en av de viktigaste strategierna, som Tor implementerade, för att minska antalet av sådana attacker. Denna strategi handlar om att tilldela en lista som innehåller tre guard-noder till varje klient. För att hitta en lägre klientangreppsfrekvens användes en programvara som heter COGS för simuleringsändamål. I våra simuleringar ändrade vi tidsintervallet, under vilket guard-noder tilldelas en användare, antingen genom att minska det till 15 - 30 dagar eller öka det till 60 - 90 dagar. En annan parameter som vi ändrade var antalet guard-noder i klientens guard-nodslista, antingen genom att minska det till en guard-nod eller öka det till fem guard-noder. Efter att ha plottat utdata från våra simuleringar drar vi slutsatsen att en minskning av antalet guard-noder i en klients guard-nodslista samtidigt som dess rotationstid ökar ger lägsta möjliga kompromissnivå för klienten. Denna inställning kan skada Tor-nätverkets prestanda, eftersom guard-noder skulle samla klienter över tiden och därför bör en större studie, som inkluderar andra faktorer som prestanda, genomföras för att kunna hitta en bättre balans mellan anonymitet och prestanda.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Maximum Number of Nodes"

1

ENGLAND, HIGHER EDUCATION FUNDING COUNCIL FOR. Maximum aggregate student number allocation. HEFCE, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Farzad, Babak. When the chromatic number is close to the maximum degree. National Library of Canada, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Great Britain. Parliament. House of Commons. Second Standing Committee on Delegated Legislation. Draft Maximum Number of Judges Order 2003, Thursday 6 March 2003. Stationery Office, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Great Britain. Parliament. House of Commons. Third Standing Committee on Delegated Legislation. Draft maximum number of judges order 2002, Tuesday 29 October 2002. Stationery Office, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Great Britain. Parliament. House of Commons. Second Standing Committee on Delegated Legislation. Draft maximum number of stipeniary magistrates order 1999, Thursday 25 November 1999. Stationery Office, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Great Britain. Parliament. House of Commons. Sixth Standing Committee on Delegated Legislation. Draft Maximum Number of Judges (Northern Ireland) Order 2004, Thursday 24 June 2004. Stationery Office, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yoshinobu, Maeda, and Walmsley A. D, eds. Implant dentistry with new generation magnetic attachment: Maximum result with minimum number of implants. Quintessence Publishing, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Johnson, F. Monitoring 38 tonne goods vehicles: A report on the number and activity of maximum weight goods vehicles. Dept. of Transport, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Edelsbrunner, Herbert. The maximum number of ways to stab n convex non-intersecting objects in the plane 2n-2. Courant Institute of Mathematical Sciences, New York University, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Armstrong, Ronald D. A method for determining the maximum number of nonoverlapping linear test forms that can be assembled from an item pool. Law School Admission Council, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Maximum Number of Nodes"

1

Chimani, Markus, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, and Alexander Wolff. "On the Maximum Crossing Number." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78825-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chantasartrassmee, Avapa, and Narong Punnim. "Regular Graphs with Maximum Forest Number." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24983-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bald, Samuel, Matthew P. Johnson, and Ou Liu. "Approximating the Maximum Rectilinear Crossing Number." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42634-1_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kjos-Hanssen, Bjørn, and Lei Liu. "The Number of Languages with Maximum State Complexity." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14812-6_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Jun, Yu Lin, Vaibhav Rajan, William Hoskins, and Jijun Tang. "Maximum Parsimony Analysis of Gene Copy Number Changes." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48221-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fici, Gabriele, and Filippo Mignosi. "Words with the Maximum Number of Abelian Squares." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Palios, Leonidas. "Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments." In Algorithm Theory — SWAT '94. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58218-5_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Golovach, Petr A., Pinar Heggernes, and Dieter Kratsch. "Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29516-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Couturier, Jean-François, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger. "Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32241-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Wei, Xinyin Zhang, Tingting Pei, and Cong Ding. "A Fault Dictionary Diagnosis Method for Photovoltaic Array Based on Maximum Fuzzy Fault Number." In Lecture Notes in Electrical Engineering. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-0877-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Maximum Number of Nodes"

1

Goyal, Amulya, Ankit Kumar Sharma, Bhanu Pratap Soni, and Saurabh Ratra. "Maximum Loadability Estimation for Identifying Weak Nodes Using Voltage Stability Indices." In 2024 IEEE 11th Power India International Conference (PIICON). IEEE, 2024. https://doi.org/10.1109/piicon63519.2024.10995109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gao, Jieyu, Jie Li, Qihui Wu, Youbiao Wu, and Haikuo Xu. "Distributed Detection of Critical Nodes in Wireless Sensor Networks Using Maximum Independent Set." In 2025 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2025. https://doi.org/10.1109/wcnc61545.2025.10978779.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Lingang, and Lei Sun. "MVMNET: Graph Classification Pooling Method with Maximum Variance Mapping." In 12th International Conference on Advanced Information Technologies and Applications. Academy and Industry Research Collaboration Center (AIRCC), 2023. http://dx.doi.org/10.5121/csit.2023.130613.

Full text
Abstract:
Graph Neural Networks (GNNs) have been shown to effectively model graph-structured data for tasks such as graph node classification, link prediction, and graph classification. The graph pooling method is an indispensable structure in the graph neural network model. The traditional graph neural network pooling methods all employ downsampling or node aggregating to reduce graph nodes. However, these methods do not fully consider spatial distribution of nodes of different classes of graphs, and making it difficult to distinguish the class of graphs with spatial locations close to each other. To solve such problems, this article proposes a Maximum Variance graph feature Multistructure graph classification method (MVM), which extracts graph information from the perspective of graph nodes feature and graph topology. From the nodes feature perspective, we enlarge the variance between different classes while maintaining the variance between the same class of data. Then the hierarchical graph convolution and pooling are performed from a topological perspective and combined with a CNN readout mechanism to preserve more graph information to obtain a graph-level representation with strong discrimination. Experiments demonstrate that our method outperforms several number of state-of-the-art graph classification methods on multiple publicly available datasets.
APA, Harvard, Vancouver, ISO, and other styles
4

Rajotte, Kiriaki, Anson Wooding, Jianan Li, et al. "Power Consumption and Maximum Number of Supported Nodes for BLE Biosensor Applications." In 2023 IEEE 19th International Conference on Body Sensor Networks (BSN). IEEE, 2023. http://dx.doi.org/10.1109/bsn58485.2023.10331462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zheng, Wenbin, and Mary Ann Ingram. "Maximum multi-hop range using cooperative transmission with a fixed number of nodes." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655502.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Eady, Yasmin, Kofi Kyei, Aldrewvonte Jackson, et al. "Measuring How Appropriate Individuals Are for Specific Jobs in a Network of Collaborators." In 15th International Conference on Applied Human Factors and Ergonomics (AHFE 2024). AHFE International, 2024. http://dx.doi.org/10.54941/ahfe1004764.

Full text
Abstract:
We simulate social networks, where undirected edges are mutual friendships, to find the effect of their structure on the aptness of persons for performing a given job. A job J requires a given set of tasks, and each node (person) n can perform a given set of tasks. If the ego network EG of n cannot perform all tasks for J, then n fails on J. Otherwise, n’s score is computed as a weighted sum of measures of centrality, embeddedness (core number), attribute and degree assortativity of the nodes in EG, the degrees of these nodes, and the performance of these nodes on accuracy, speed, and reliability. Experiments were run on random networks from three models across values for an independent variable controlling the number of edges: Erdős-Renyi (ER), Barabasi-Albert (BA), and Watts-Strogatz (WS). Average values for maximum, average, and minimum node scores for each value of the variable for each model were plotted. For all models, the core-number measure largely accounts for the curves’ shapes. Our core-number measure averages over node n’s core number and the averages of n’s neighbors’ numbers and the smallest of these. For ER networks, scores increase with increasing number of edges as nodes become more embedded. For BA and WS networks, there is an initial decrease, conjectured to depend on a person collaborating with many little-embedded helpers, untested and perhaps not well trusted. Our approach for members’ aptness for jobs preserves the security of a secure community, keeping the calculations within the community.
APA, Harvard, Vancouver, ISO, and other styles
7

Fabbri, Francesco, Yanhao Wang, Francesco Bonchi, Carlos Castillo, and Michael Mathioudakis. "Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways (Extended Abstract)." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/715.

Full text
Abstract:
Recommender systems typically suggest to users content similar to what they consumed in the past. A user, if happening to be exposed to strongly polarized content, might be steered towards more and more radicalized content by subsequent recommendations, eventually being trapped in what we call a "radicalization pathway". In this paper, we investigate how to mitigate radicalization pathways using a graph-based approach. We model the set of recommendations in a what-to-watch-next (W2W) recommender as a directed graph, where nodes correspond to content items, links to recommendations, and paths to possible user sessions. We measure the segregation score of a node representing radicalized content as the expected length of a random walk from that node to any node representing non-radicalized content. A high segregation score thus implies a larger chance of getting users trapped in radicalization pathways. We aim to reduce the prevalence of radicalization pathways by selecting a small number of edges to rewire, so as to minimize the maximum of segregation scores among all radicalized nodes while maintaining the relevance of recommendations. We propose an efficient yet effective greedy heuristic based on the absorbing random walk theory for the rewiring problem. Our experiments on real-world datasets confirm the effectiveness of our proposal.
APA, Harvard, Vancouver, ISO, and other styles
8

Moreno, Carlos Luis. "Flow Analysis on Piping Networks Using the Finite Element Method." In ASME 2013 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/imece2013-63553.

Full text
Abstract:
The objective of this work is to apply the Finite Element Methodology (F.E.M.) to several piping systems, using an incompressible working fluid, in order to calculate the volumetric flow on each element and the piezometric load on each node of the network. To accomplish this goal a computational code was designed using Fortran Computational Language. Such a code consists of a main program and six subroutines. The input variables are general data of the network including the number of pipes, the number of nodes, the piezometric load values on nodes where they are constant (tanks for example), demanding flows in those nodes where the fluid is removed from the system, a connectivity table indicating the assumed flow direction in each pipe, and the number of pumps with respective parabolic curve coefficients. Program data also included both the maximum number of iterations and tolerance allowed. Fluid properties such as kinematic viscosity, density and pipe features such as length, diameter and absolute rugosity are also required. The output data include pipe volumetric flows and piezometric load on variable static pressure nodes. In this work, three different network systems were analyzed: 51-, 63- and 65-element networks. All were examples taken from the bibliography. The Finite Element Methodology results were first validated with real data, and then compared with the other results coming from the Hardy-Cross, Newton-Raphson and Linear Methods. The comparison was based on convergence speed and numerical stability. It is concluded that the methodology called Finite Element Methodology requires a smaller number of iterations than the Hardy-Cross, Linear and Newton-Raphson Methods. Another advantage of the Finite Element Methodology is that there is no need to assign the flow initial values that satisfy the Continuity Equation on each node of the piping network before running the program. Also, no loops establishing is needed. In addition, the designed code permits calculations for networks that present both booster and feed pumps. The importance of this work rests on the fact that nowadays it is necessary for piping network flow analysis to use computational simulation in order to design systems more efficiently and economically. Furthermore, this work is important for network construction as well as the satisfaction of consumer demand on a local community level, taking into account prevailing normative requirements. This paper, consequently, aims to contribute to progress in these areas.
APA, Harvard, Vancouver, ISO, and other styles
9

Khetan, Ashish, and James T. Allison. "Large-Scale Topology Optimization Using Parameterized Boolean Networks." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34256.

Full text
Abstract:
A novel parameterization concept for structural truss topology optimization is presented in this article that enables the use of evolutionary algorithms in design of large-scale structures. The representational power of Boolean networks is used here to parameterize truss topology. A genetic algorithm then operates on parameters that govern the generation of truss topologies using this random network instead of operating directly on design variables. A genetic algorithm implementation is also presented that is congruent with the local rule application of the random network. The primary advantage of using a Boolean random network representation is that a relatively large number of ground structure nodes can be used, enabling successful exploration of a large-scale design space. In the classical binary representation of ground structures, the number of optimization variables increases quadratically with the number of nodes, restricting the maximum number of nodes that can be considered using a ground structure approach. The Boolean random network representation proposed here allows for the exploration of the entire topology space in a systematic way using only a linear number of variables. The number of nodes in the design domain, therefore, can be increased significantly. Truss member geometry and size optimization is performed here in a nested manner where an inner loop size optimization problem is solved for every candidate topology using sequential linear programming with move-limits. The Boolean random network and nested inner-loop optimization allows for the concurrent optimization of truss topology, geometry, and size. The effectiveness of this method is demonstrated using a planar truss design optimization benchmark problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhou, Hong, and Kwun-Lon Ting. "Spanning Tree Based Topological Optimization of Compliant Mechanisms." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84608.

Full text
Abstract:
In graph theory, spanning trees connect all the vertices together using minimum number of edges. A topological optimization method of compliant mechanisms is presented based on spanning tree theory. A valid topology is regarded as a network connecting input, output, support and intermediate nodes, which contains at least one spanning tree among the introduced nodes. Invalid disconnected topologies can be weeded out if no spanning tree is included. No further deformation analysis and performance evaluation is needed for invalid disconnected topologies. Problem-dependent objectives are optimized for topological optimization of compliant mechanisms. Constraints about maximum input displacement and input force, maximum stress and overlapping connections are directly imposed during the optimization process. The discrete optimization problem is solved by genetic algorithm with penalty function handling constraints. An example is presented to verify the effectiveness of the proposed optimization procedure.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Maximum Number of Nodes"

1

Sun, Jun, and Carl Fossa. On Heterogeneous Mobile Network Connectivity: Number of Gateway Nodes. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada570134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jameson, L. Direct Numerical Simulation DNS: Maximum Error as a Function of Mode Number. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/793962.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Deng, Chun, Zhenyu Zhang, Zhi Guo, et al. Assessment of intraoperative use of indocyanine green fluorescence imaging on the number of lymph node dissection during minimally invasive gastrectomy: a systematic review and meta-analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, 2021. http://dx.doi.org/10.37766/inplasy2021.11.0062.

Full text
Abstract:
Review question / Objective: Whether is indocyanine green fluorescence imaging-guided lymphadenectomy feasible to improve the number of lymph node dissections during radical gastrectomy in patients with gastric cancer undergoing curative resection? Condition being studied: Gastric cancer was the sixth most common malignant tumor and the fourth leading cause of cancer-related death in the world. Radical lymphadenectomy was a standard procedure in radical gastrectomy for gastric cancer. The retrieval of more lymph nodes was beneficial for improving the accuracy of tumor staging and the long-term survival of patients with gastric cancer. Indocyanine green(ICG) near-infrared fluorescent imaging has been found to provide surgeons with effective visualization of the lymphatic anatomy. As a new surgical navigation technique, ICG near-infrared fluorescent imaging was a hot spot and had already demonstrated promising results in the localization of lymph nodes during surgery in patients with breast cancer, non–small cell lung cancer, and gastric cancer. In addition, ICG had increasingly been reported in the localization of tumor, lymph node dissection, and the evaluation of anastomotic blood supply during radical gastrectomy for gastric cancer. However, it remained unclear whether ICG fluorescence imaging would assist surgeons in performing safe and sufficient lymphadenectomy.
APA, Harvard, Vancouver, ISO, and other styles
4

Rivera-Casillas, Peter, and Ian Dettwiller. Neural Ordinary Differential Equations for rotorcraft aerodynamics. Engineer Research and Development Center (U.S.), 2024. http://dx.doi.org/10.21079/11681/48420.

Full text
Abstract:
High-fidelity computational simulations of aerodynamics and structural dynamics on rotorcraft are essential for helicopter design, testing, and evaluation. These simulations usually entail a high computational cost even with modern high-performance computing resources. Reduced order models can significantly reduce the computational cost of simulating rotor revolutions. However, reduced order models are less accurate than traditional numerical modeling approaches, making them unsuitable for research and design purposes. This study explores the use of a new modified Neural Ordinary Differential Equation (NODE) approach as a machine learning alternative to reduced order models in rotorcraft applications—specifically to predict the pitching moment on a rotor blade section from an initial condition, mach number, chord velocity and normal velocity. The results indicate that NODEs cannot outperform traditional reduced order models, but in some cases they can outperform simple multilayer perceptron networks. Additionally, the mathematical structure provided by NODEs seems to favor time-dependent predictions. We demonstrate how this mathematical structure can be easily modified to tackle more complex problems. The work presented in this report is intended to establish an initial evaluation of the usability of the modified NODE approach for time-dependent modeling of complex dynamics over seen and unseen domains.
APA, Harvard, Vancouver, ISO, and other styles
5

Abdolmaleki, Kourosh. PR-453-205101-R02 On-Bottom Dynamic Simulation. Pipeline Research Council International, Inc. (PRCI), 2023. http://dx.doi.org/10.55274/r0012257.

Full text
Abstract:
This report presents a number of newly added features to the OBS software relevant to the dynamic simulation of pipelines. The additions include a function to extract on-bottom wave induced velocities and hydrodynamic forces on a given length of pipeline with arbitrary distribution of the nodes; a new dynamic simulation module to perform dynamic simulations for a single pipe node; two new soil models including the Verley and Sotberg for sand as well as a custom soil model as per the approach recommended in DNV-RP-F114. The added soil models are implemented in the dynamic solver, which provide full dynamic simulation of pipelines in two dimensions.
APA, Harvard, Vancouver, ISO, and other styles
6

Abdolmaleki, Kourosh. PR453-225100-Z01 OBS APIs Documentation and Examples. Pipeline Research Council International, Inc. (PRCI), 2025. https://doi.org/10.55274/r0000131.

Full text
Abstract:
This zipped package includes a number of newly added features to the OBS software relevant to the dynamic simulation of pipelines. The additions include a function to extract on-bottom wave induced velocities hydrodynamic forces on a given length of pipeline with arbitrary distribution of the nodes; a new dynamic simulation module to perform dynamic simulations for a single pipe element; two new soil models including the Verley and Sotberg for sand as well as a custom soil model as per the approach recommended in DNVRP- F114. The added soil models are implemented in the dynamic solver, which provide full dynamic simulation of pipelines in two dimensions. Also included is the Oct 2024 updated PR453-225100-M01 Pipeline On-Bottom Stability Software User Manual.
APA, Harvard, Vancouver, ISO, and other styles
7

Chandra, Shailesh, and Vivek Mishra. Optimizing Multimodal Transportation Access to Support Commuting Among Low-Income Transit Riders with Social Distancing. Mineta Transportation Institute, 2022. http://dx.doi.org/10.31979/mti.2022.2140.

Full text
Abstract:
During the COVID-19 pandemic, LA Metro has encouraged social distancing among passengers—especially at stations of high-demand routes—and has increased fixed-route transit (FRT) services. However, potential impacts of social distancing on the performance of FRT services remain mostly unknown. This research evaluates the accessibility of FRT buses with social distancing using the ridership data collected on four FRT routes: 105, 108, 111, and 115 of the LA Metro's A Line stations located in low-income neighborhoods. This research shows that social distancing of six feet can impact FRT's accessibility to destination stations, and maximum accessibility is achieved only for a certain number of stops served—which is less than the current number of stops served. The FRT routes 105, 108, 111 and 115 have maximum accessibility with social distancing for the number of stops served equal to 65, 52, 52 and 50, respectively. The methodology used in this research can help decision-makers understand how FRT bus frequencies are impacted by social distancing measures, and the results can guide the transit authorities developing FRT service among low-income commuters during and after the pandemic.
APA, Harvard, Vancouver, ISO, and other styles
8

Bobashev, Georgiy, R. Joey Morris, Elizabeth Costenbader, and Kyle Vincent. Assessing network structure with practical sampling methods. RTI Press, 2018. http://dx.doi.org/10.3768/rtipress.2018.op.0049.1805.

Full text
Abstract:
Using data from an enumerated network of worldwide flight connections between airports, we examine how sampling designs and sample size influence network metrics. Specifically, we apply three types of sampling designs: simple random sampling, nonrandom strategic sampling (i.e., selection of the largest airports), and a variation of snowball sampling. For the latter sampling method, we design what we refer to as a controlled snowball sampling design, which selects nodes in a manner analogous to a respondent-driven sampling design. For each design, we evaluate five commonly used measures of network structure and examine the percentage of total air traffic accounted for by each design. The empirical application shows that (1) the random and controlled snowball sampling designs give rise to more efficient estimates of the true underlying structure, and (2) the strategic sampling method can account for a greater proportion of the total number of passenger movements occurring in the network.
APA, Harvard, Vancouver, ISO, and other styles
9

Ciapponi, Agustín. What are the impacts of policies regarding direct patient payments for medicines? SUPPORT, 2017. http://dx.doi.org/10.30846/1701153.

Full text
Abstract:
Policies in which consumers pay directly for their medicines when they fill a prescription include caps (a maximum number of prescriptions or medicines that are reimbursed, fixed co-payments (patients pay a fixed amount per prescription or medicine), tier co-payments (the amount payed depends on whether the prescription is for a brand (patented) medicine or a generic medicine), co-insurance (patients pay part of the price of the medicine), and ceilings (patients pay the full price or part of the cost up to a ceiling, after which medicines are free or are available at reduced cost).
APA, Harvard, Vancouver, ISO, and other styles
10

ADAS, RSK. Nitrate Surveillance Monitoring Program (Annual Report May 2021 - March 2022). Food Standards Agency, 2022. http://dx.doi.org/10.46756/sci.fsa.uau489.

Full text
Abstract:
Every Member State is required to monitor and report levels of nitrate in specified foodstuffs as part of the European Commission regulation and the UK also requires this information as part of the collection of data to support the review of retained EU law in the UK and inform the setting of policy around maximum nitrate levels. The requirement to carry out monitoring for nitrate in lettuce, spinach and rocket is being met by the UK Nitrate Surveillance Programme. Results are presented for the period between 1st April 2021 and 31st March 2022. A total of 202 samples were collected within the sampling period, comprising of 130 lettuce, 9 rocket, 26 spinach samples. A further 37 samples categorised at “Other Green Leafy Vegetables”, which comprised of samples including mustard, mizuna, celery, Pak Choi and cabbage. The lowest average nitrate concentration was recorded in summer-grown iceberg lettuce (935.2 mg/kg), and no iceberg samples exceeded the maximum nitrate concentration. The highest average nitrate concentration was seen in winter grown non-iceberg lettuce grown under protection within the lettuce group (3242.2 mg/kg), and in winter-grown rocket overall (4271.2 mg/kg). The number of samples exceeding the maximum threshold increased this year to 7 samples – 2 samples of open-air non-iceberg lettuce sampled in the summer, 1 sample of protected non-iceberg lettuce in the summer, and 3 samples of spinach. A further 4 samples were within 10% of the maximum threshold. Consistent with previous years of this project, a strong correlation was found between nitrate concentration and sampling date, with samples collected later in the season showing greater concentrations, indicating potential interactions between nitrate accumulation and climate – particularly light levels and available soil moisture and the accumulation of nitrate in the soil through subsequent fertiliser applications with successive planting. Furthermore, there was significant interaction between nitrate accumulation, product type and cultivation type, which could be further explored to better identify risk factors associated with nitrate accumulation in leafy vegetables grown in the UK.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Maximum Number of Nodes' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography