Se connecter

Bibliographies thématiques / Vertex flow / Articles de revues

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Vertex flow.

Articles de revues sur le sujet « Vertex flow »

Auteur : Grafiati

Publié le 10 mars 2023

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Vertex flow ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Hassin, Refael, and Asaf Levin. "Flow trees for vertex-capacitated networks." Discrete Applied Mathematics 155, no. 4 (2007): 572–78. http://dx.doi.org/10.1016/j.dam.2006.08.012.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Antipov, Y. A., and V. V. Silvestrov. "Double cavity flow past a wedge." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, no. 2099 (2008): 3021–38. http://dx.doi.org/10.1098/rspa.2008.0136.

Texte intégral

Résumé :

A mathematical model of supercavitating flow past a wedge with sides of arbitrary length is proposed. The flow branches at a point on the lower side of the wedge. At the vertex of the wedge and at the ends of the wedge, the flow breaks away forming a nose bubble and a trailing cavity. The closure mechanism is described by the Tulin single-spiral-vortex model. The flow domain is mapped into a parametric plane cut along a unit segment. The conformal mapping function is reconstructed through the exact solution of two Riemann–Hilbert problems on a genus-zero Riemann surface. To complete the soluti

Styles APA, Harvard, Vancouver, ISO, etc.

3

Bhandari, Phanindra Prasad, Shree Ram Khadka, Stefan Ruzika, and Luca E. Schäfer. "Lexicographically Maximum Dynamic Flow with Vertex Capacities." Journal of Mathematics and Statistics 16, no. 1 (2020): 142–47. http://dx.doi.org/10.3844/jmssp.2020.142.147.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Laber, Rob, and Geoffrey Mason. "C-Graded vertex algebras and conformal flow." Journal of Mathematical Physics 55, no. 1 (2014): 011705. http://dx.doi.org/10.1063/1.4862194.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Khuller, Samir, and Joseph (Seffi) Naor. "Flow in planar graphs with vertex capacities." Algorithmica 11, no. 3 (1994): 200–225. http://dx.doi.org/10.1007/bf01240733.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Shahrokhi, Farhad, and László A. Székely. "On Canonical Concurrent Flows, Crossing Number and Graph Expansion." Combinatorics, Probability and Computing 3, no. 4 (1994): 523–43. http://dx.doi.org/10.1017/s0963548300001383.

Texte intégral

Résumé :

We define and efficiently compute the canonical flow on a graph, which is a certain feasible solution for the concurrent flow problem and exhibits invariance under the action of the automorphism group of the graph. Using estimates for the congestion of our canonical flow, we derive lower bounds on the crossing number, bisection width, and the edge and vertex expansion of a graph in terms of sizes of the edge and vertex orbits and the average distance in the graph. We further exhibit classes of graphs for which our lower bounds are tight within a multiplicative constant. Also, in cartesian prod

Styles APA, Harvard, Vancouver, ISO, etc.

7

Faria, Luerbio, André L. P. Guedes, and Lilian Markenzon. "On feedback vertex set in reducible flow hypergraphs." Procedia Computer Science 195 (2021): 212–20. http://dx.doi.org/10.1016/j.procs.2021.11.027.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Requerey, Iker S., Basilio Ruiz Cobo, Milan Gošić, and Luis R. Bellot Rubio. "Persistent magnetic vortex flow at a supergranular vertex." Astronomy & Astrophysics 610 (February 2018): A84. http://dx.doi.org/10.1051/0004-6361/201731842.

Texte intégral

Résumé :

Context. Photospheric vortex flows are thought to play a key role in the evolution of magnetic fields. Recent studies show that these swirling motions are ubiquitous in the solar surface convection and occur in a wide range of temporal and spatial scales. Their interplay with magnetic fields is poorly characterized, however. Aims. We study the relation between a persistent photospheric vortex flow and the evolution of a network magnetic element at a supergranular vertex. Methods. We used long-duration sequences of continuum intensity images acquired with Hinode and the local correlation-tracki

Styles APA, Harvard, Vancouver, ISO, etc.

9

D'APICE, CIRO, and BENEDETTO PICCOLI. "VERTEX FLOW MODELS FOR VEHICULAR TRAFFIC ON NETWORKS." Mathematical Models and Methods in Applied Sciences 18, supp01 (2008): 1299–315. http://dx.doi.org/10.1142/s0218202508003042.

Texte intégral

Résumé :

Some models of flow on a network are discussed. Assuming a macroscopic approach on each arc of the network, we consider a system of conservation laws and various possible choices to describe the evolution at vertices are discussed. A general framework proposed in recent literature is presented, then some new solutions for the scalar case are proposed and analyzed.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Ji, Zhongping, Ligang Liu, Bin Wang, and Wenping Wang. "Feature Enhancement by Vertex Flow for 3D Shapes." Computer-Aided Design and Applications 8, no. 5 (2011): 649–64. http://dx.doi.org/10.3722/cadaps.2011.649-664.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

MASOUMI, M., A. M. MOBASSERI, and A. R. REZAEI. "MINIMUM FLOW VARIATION IN MAXIMUM FLOWS." Discrete Mathematics, Algorithms and Applications 02, no. 03 (2010): 389–93. http://dx.doi.org/10.1142/s1793830910000735.

Texte intégral

Résumé :

Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost. Among the predominant issues in this field are problems that result when the flow is going through one arc to another arc in the same direction, such as the role of compressors in gas pipeline networks or the role of transformers in electricity wide networks. Hence, in order to minimize the cost of these elements in the network, we perform appl

Styles APA, Harvard, Vancouver, ISO, etc.

12

Barron, Katrina, Karina Batistelli, Florencia Orosz Hunziker, Veronika Pedić Tomić, and Gaywalee Yamskulna. "On rationality of C-graded vertex algebras and applications to Weyl vertex algebras under conformal flow." Journal of Mathematical Physics 63, no. 9 (2022): 091706. http://dx.doi.org/10.1063/5.0117895.

Texte intégral

Résumé :

Using the Zhu algebra for a certain category of [Formula: see text]-graded vertex algebras V, we prove that if V is finitely Ω-generated and satisfies suitable grading conditions, then V is rational, i.e., it has semi-simple representation theory, with a one-dimensional level zero Zhu algebra. Here, Ω denotes the vectors in V that are annihilated by lowering the real part of the grading. We apply our result to the family of rank one Weyl vertex algebras with conformal element ω μ parameterized by [Formula: see text] and prove that for certain non-integer values of μ, these vertex algebras, whi

Styles APA, Harvard, Vancouver, ISO, etc.

13

Tran, Ngoc Viet, and Hong Dung Le. "Extended network and algorithm finding maximal flows." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1632–40. https://doi.org/10.11591/ijece.v10i2.pp1632-1640.

Texte intégral

Résumé :

Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, in ordinary graph the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex, but depend on coming and leaving edges. The paper develops a model of extended network that can be applied to modelling many practical problems more exactly and effectively. The main contribution of t

Styles APA, Harvard, Vancouver, ISO, etc.

14

Singh, Jeeoot, Tripti Agrawal, and Shashi Yadav. "Study of Vertex Shedding Phenomenon in Vortex Flow Meter." Materials Today: Proceedings 18 (2019): 2977–83. http://dx.doi.org/10.1016/j.matpr.2019.07.168.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Kaplan, Haim, and Yahav Nussbaum. "Maximum Flow in Directed Planar Graphs with Vertex Capacities." Algorithmica 61, no. 1 (2010): 174–89. http://dx.doi.org/10.1007/s00453-010-9436-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Yu, K. M., and M. W. Nansteel. "Buoyancy-induced Stokes flow in a wedge-shaped enclosure." Journal of Fluid Mechanics 221 (December 1990): 437–51. http://dx.doi.org/10.1017/s0022112090003627.

Texte intégral

Résumé :

The problem of buoyancy-induced Stokes flow in a sectorial region is addressed. Skew-symmetric flows are considered for wedge or opening angles of the sector in the range 0 < α [les ] π. The basic structure and character of the motion are found to depend critically upon the relative dominance, near the sector vertex, of the particular solution of the system with respect to the leading eigenfunction. A simple criterion is developed for the appearance of eddies, such as those observed by Moffatt (1964), in the neighbourhood of the sector vertex. A calculation is carried out for the specific c

Styles APA, Harvard, Vancouver, ISO, etc.

17

Hinton, Edward M., Andrew J. Hogg, and Herbert E. Huppert. "Shallow free-surface Stokes flow around a corner." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 378, no. 2174 (2020): 20190515. http://dx.doi.org/10.1098/rsta.2019.0515.

Texte intégral

Résumé :

The steady lateral spreading of a free-surface viscous flow down an inclined plane around a vertex from which the channel width increases linearly with downstream distance is investigated analytically, numerically and experimentally. From the vertex the channel wall opens by an angle α to the downslope direction and the viscous fluid spreads laterally along it before detaching. The motion is modelled using lubrication theory and the distance at which the flow detaches is computed as a function of α using analytical and numerical methods. Far downslope after detachment, it is shown that the mot

Styles APA, Harvard, Vancouver, ISO, etc.

18

Jiang, Qingfang. "Precipitation over Concave Terrain." Journal of the Atmospheric Sciences 63, no. 9 (2006): 2269–88. http://dx.doi.org/10.1175/jas3761.1.

Texte intégral

Résumé :

Abstract Many topographic barriers are comprised of a series of concave or convex ridges that modulate the intensity and distribution of precipitation over mountainous areas. In this model-based idealized study, stratiform precipitation associated with stratified moist airflow past idealized concave ridges is investigated with a focus on windward blocking, flow confluence, and the associated precipitation enhancement. It is found that flow confluence and precipitation enhancement by a concave ridge are controlled by the nondimensional ridge height M (M = Nmhm/U, where Nm is the moist buoyancy

Styles APA, Harvard, Vancouver, ISO, etc.

19

Hussain, Ruqiya Abed, Sawsan Abdullah Hassan, and Asmaa Abdul Jabbar Jamel. "Experimental Study on Flow over Triangular Labyrinth Weirs." International Journal of Design & Nature and Ecodynamics 17, no. 2 (2022): 249–55. http://dx.doi.org/10.18280/ijdne.170211.

Texte intégral

Résumé :

Recently, many research studies have focused on labyrinth weirs' hydraulic performance, especially as dependent on engineering features. In the current study, the hydraulic properties of flow over labyrinth triangular weirs models (from the upper perspective) with sharp crest have been experimentally studied and compare their efficiency with suppressed rectangular weirs (conventional weirs). Twelve fiberglass models are developed for this reason and tested in a 6m in length, 30cm in width, and 40cm height in laboratory flume, nine models were constructed for triangular labyrinth weirs and thre

Styles APA, Harvard, Vancouver, ISO, etc.

20

Joshaghani, M. S., V. Girault, and B. Riviere. "A vertex scheme for two-phase flow in heterogeneous media." Journal of Computational Physics 449 (January 2022): 110778. http://dx.doi.org/10.1016/j.jcp.2021.110778.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

21

Brankov, J. G., and M. Schreckenberg. "A five-vertex model interpretation of one-dimensional traffic flow." Journal of Physics A: Mathematical and General 31, no. 9 (1998): 2133–40. http://dx.doi.org/10.1088/0305-4470/31/9/005.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Klein, Cerry M., and Sencer Yeralan. "Network flow models with fuzzy auxiliary edge and vertex attributes." International Journal of Approximate Reasoning 2, no. 2 (1988): 103. http://dx.doi.org/10.1016/0888-613x(88)90085-0.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Alsaeed, Salman Saud, and Satyvir Singh. "Numerical Study of Shock Wave Interaction with V-Shaped Heavy/Light Interface." Mathematics 12, no. 19 (2024): 3131. http://dx.doi.org/10.3390/math12193131.

Texte intégral

Résumé :

This paper investigates numerically the shock wave interaction with a V-shaped heavy/light interface. For numerical simulations, we choose six distinct vertex angles (θ=40∘,60∘,90∘,120∘,150∘, and 170∘), five distinct shock wave strengths (Ms=1.12,1.22,1.30,1.60, and 2.0), and three different Atwood numbers (At=−0.32,−0.77, and −0.87). A two-dimensional space of compressible two-component Euler equations are solved using a third-order modal discontinuous Galerkin approach for the simulations. The present findings demonstrate that the vertex angle has a crucial influence on the shock wave intera

Styles APA, Harvard, Vancouver, ISO, etc.

24

Nasiruddin, Sheikh, S. N. Singh, S. V. Veeravalli, and S. Hegde. "Effect of vertex angle and vertex tip radius on the performance of V-cone flow meter using CFD." Measurement 138 (May 2019): 536–44. http://dx.doi.org/10.1016/j.measurement.2019.02.039.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Labao, Alfonso, and Henry N. Adorna. "Survivable Network Design with Constrained h-Subgraph Flows." SciEnggJ 16, no. 2 (2023): 291–309. http://dx.doi.org/10.54645/2023162jje-41.

Texte intégral

Résumé :

In this paper, we propose a variant of the survivable network design problem, where subgraphs are given flow constraints, which represent upper bounds on weights of outgoing edges with endpoints that belong to vertex subsets of these subgraphs. The general problem of verifying whether the weights of outgoing edges of any vertex subset (i.e. a graph cut) of an arbitrary subgraph meets a certain upper bound is a computationally hard problem. However, our proposed problem considers special types of subgraphs (termed h-subgraphs) which possess a tree structure. In particular, a h-subgraph consists

Styles APA, Harvard, Vancouver, ISO, etc.

26

Tran, Quoc Chien1, and Van Hung2 Ho. "EXTENDED LINEAR MULTI-COMMODITY MULTICOST NETWORK AND MAXIMAL FLOW LIMITED COST PROBLEMS." International Journal of Computer Networks & Communications (IJCNC) 10, no. 1 (2018): 1–15. https://doi.org/10.5281/zenodo.1194067.

Texte intégral

Résumé :

ABSTRACT The Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex but depend on coming and leaving edges. The presented paper develops a model of the extended linear multi-commodity multi-cost network that can be more exactly and effectively

Styles APA, Harvard, Vancouver, ISO, etc.

27

Raghavan Unnithan, Sunil Kumar, Balakrishnan Kannan, and Madambi Jathavedan. "Betweenness Centrality in Some Classes of Graphs." International Journal of Combinatorics 2014 (December 25, 2014): 1–12. http://dx.doi.org/10.1155/2014/241723.

Texte intégral

Résumé :

There are several centrality measures that have been introduced and studied for real-world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest paths between them. In this paper we present betweenness centrality of some important classes of graphs.

Styles APA, Harvard, Vancouver, ISO, etc.

28

GOMILKO, A. M., V. S. MALYUGA, and V. V. MELESHKO. "On steady Stokes flow in a trihedral rectangular corner." Journal of Fluid Mechanics 476 (February 10, 2003): 159–77. http://dx.doi.org/10.1017/s0022112002003026.

Texte intégral

Résumé :

Motivated by the recent paper of Hills & Moffatt (2000), we investigate the Stokes flow in a trihedral corner formed by three mutually orthogonal planes, induced by a non-zero velocity distribution over one of the walls of the corner. It is shown that the local behaviour of the velocity field near the edges of the corner, where a discontinuity of the boundary velocity is assumed, coincides with the Goodier–Taylor solution for a two-dimensional wedge. Analysis of the streamline patterns confirms the existence of eddies near the stationary edge in the flow, induced either by uniform translat

Styles APA, Harvard, Vancouver, ISO, etc.

29

XIN, ZHOUPING, and HUICHENG YIN. "GLOBAL MULTIDIMENSIONAL SHOCK WAVE FOR THE STEADY SUPERSONIC FLOW PAST A THREE-DIMENSIONAL CURVED CONE." Analysis and Applications 04, no. 02 (2006): 101–32. http://dx.doi.org/10.1142/s0219530506000747.

Texte intégral

Résumé :

In this paper, we establish the global existence and stability of a multidimensional conic shock wave for three-dimensional steady supersonic flow past an infinite cone. The flow is assumed to be hypersonic and described by a steady potential flow equation. Under an appropriate boundary condition on the curved cone, we show that a pointed shock attached at the vertex of the cone will exist globally in the whole space.

Styles APA, Harvard, Vancouver, ISO, etc.

30

Bhandari, Phanindra Prasad, and Shree Ram Khadka. "Lexicographically Maximum Contraflow Problem with Vertex Capacities." International Journal of Mathematics and Mathematical Sciences 2021 (February 13, 2021): 1–7. http://dx.doi.org/10.1155/2021/6651135.

Texte intégral

Résumé :

The contraflow approach has been extensively considered in the literature for modeling evacuations and has been claimed, due to its lane-direction-reversal capability, as an efficient idea to speed up the evacuation process. This paper considers the contraflow evacuation model on network with prioritized capacitated vertices that allows evacuees to be held at intermediate spots too, respecting their capacities and priority order. In particular, it studies the maximum flow evacuation planning problem and proposes polynomial and pseudo-polynomial time solution algorithms for static network and d

Styles APA, Harvard, Vancouver, ISO, etc.

31

Herrero, M. A., M. Ughi, and J. J. L. Vel�zquez. "Approaching a vertex in a shrinking domain under a nonlinear flow." NoDEA : Nonlinear Differential Equations and Applications 11, no. 1 (2004): 1–28. http://dx.doi.org/10.1007/s00030-003-1033-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Millington, Peter, and Paul M. Saffin. "Vertex functions and their flow equations from the 2PI effective action." Journal of Physics A: Mathematical and Theoretical 55, no. 43 (2022): 435402. http://dx.doi.org/10.1088/1751-8121/ac99ae.

Texte intégral

Résumé :

Abstract By exploiting the convexity of the two-particle-irreducible effective action, we describe a procedure for extracting n-point vertex functions. This procedure is developed within the context of a zero-dimensional ‘quantum field theory’ and subsequently extended to higher dimensions. These results extend the practicability and utility of a recent, alternative approach to the functional renormalization group programme (see Alexander et al 2021 Phys. Rev. D 104 069906; Millington and Saffin 2021 J. Phys. A: Math. Theor. 54 465401), and clarify the relationship between the flow equations f

Styles APA, Harvard, Vancouver, ISO, etc.

33

Needleman, A., and V. Tvergaard. "Analyses of Plastic Flow Localization in Metals." Applied Mechanics Reviews 45, no. 3S (1992): S3—S18. http://dx.doi.org/10.1115/1.3121390.

Texte intégral

Résumé :

The continuum mechanics framework for analyzing plastic flow localization is reviewed. The prediction of the localization of deformation into shear bands is sensitive to the constitutive description. The classical isotropic hardening elastic-plastic solid with a smooth yield surface and normality is very resistant to localization, but deviations from these idealizations have a strong effect. Thus, a material that forms a sharp vertex on the yield surface, as predicted by crystal plasticity, shows flow localization at quite realistic levels of strain, and even the formation of a rounded vertex

Styles APA, Harvard, Vancouver, ISO, etc.

34

Xu, Gang, and Huicheng Yin. "Instability of one global transonic shock wave for the steady supersonic Euler flow past a sharp cone." Nagoya Mathematical Journal 199 (September 2010): 151–81. http://dx.doi.org/10.1215/00277630-2010-008.

Texte intégral

Résumé :

AbstractIn this paper, we are concerned with the instability problem of one global transonic conic shock wave for the supersonic Euler flow past an infinitely long conic body whose vertex angle is less than some critical value. This is motivated by the following descriptions in the book Supersonic Flow and Shock Waves by Courant and Friedrichs: if there is a supersonic steady flow which comes from minus infinity, and the flow hits a sharp cone along its axis direction, then it follows from the Rankine-Hugoniot conditions, the physical entropy condition, and the apple curve method that there wi

Styles APA, Harvard, Vancouver, ISO, etc.

35

Xu, Gang, and Huicheng Yin. "Instability of one global transonic shock wave for the steady supersonic Euler flow past a sharp cone." Nagoya Mathematical Journal 199 (September 2010): 151–81. http://dx.doi.org/10.1017/s0027763000022261.

Texte intégral

Résumé :

AbstractIn this paper, we are concerned with the instability problem of one global transonic conic shock wave for the supersonic Euler flow past an infinitely long conic body whose vertex angle is less than some critical value. This is motivated by the following descriptions in the bookSupersonic Flow and Shock Wavesby Courant and Friedrichs: if there is a supersonic steady flow which comes from minus infinity, and the flow hits a sharp cone along its axis direction, then it follows from the Rankine-Hugoniot conditions, the physical entropy condition, and the apple curve method that there will

Styles APA, Harvard, Vancouver, ISO, etc.

36

Jia, Jun, Xiao Yuan He, and Xiao Feng Hu. "Drawing Hypergraphs in Hyperedge’s Average Degree and Multi-Rules." Applied Mechanics and Materials 713-715 (January 2015): 1682–88. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.1682.

Texte intégral

Résumé :

By analysing the past algorithms of drawing hypergraphs, this paper gives the definition of hyper graphs’ vertex degree and hyperedge’s average degree at first. Then it introduces the flow of this algorithm and particularly describes the rule set in setting the position of the vertex and the principal of minimum envelop law in drawing the hyperedge, and the complexity of this algorithm is analyzed. At last it draws a hypergraphs of scientific collaboration network successfully based on this algorithm and the result proves that the drawing algorithm of hyper graphs based on hyper edge’s average

Styles APA, Harvard, Vancouver, ISO, etc.

37

VASIL'EV, ALEXANDER. "ISOPERIMETRIC INEQUALITY FOR A CORNER HELE–SHAW DYNAMICS." Analysis and Applications 03, no. 03 (2005): 285–91. http://dx.doi.org/10.1142/s0219530505000595.

Texte intégral

Résumé :

We consider a two-dimensional Hele–Shaw flow in a wedge under injection into wedge's vertex. An isoperimetric inequality is obtained. It shows that the rate of the area growth is controlled by a special conformal quantity-triangle conformal radius.

Styles APA, Harvard, Vancouver, ISO, etc.

38

P., Arun Kumar, and E. Rathakrishnan. "Triangular tabs for supersonic jet mixing enhancement." Aeronautical Journal 118, no. 1209 (2014): 1245–78. http://dx.doi.org/10.1017/s0001924000009969.

Texte intégral

Résumé :

AbstractThe mixing promoting capability of right-angled triangular tab with sharp and truncated vertex has been investigated by placing two identical tabs at the exit of a Mach 2 axi-symmetric nozzle. The mixing promoting efficiency of these tabs have been quantified in the presence of adverse and marginally favourable pressure gradients at the nozzle exit. It was found that, at all levels of expansion of the present study though the core length reduction caused by both the tabs are appreciable, but the mixing caused by the truncated tab is superior. The mixing promoting efficiency of the trun

Styles APA, Harvard, Vancouver, ISO, etc.

39

Yi Sun, Xiaochen Chen, Matthew Rosato, and Lijun Yin. "Tracking Vertex Flow and Model Adaptation for Three-Dimensional Spatiotemporal Face Analysis." IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 40, no. 3 (2010): 461–74. http://dx.doi.org/10.1109/tsmca.2010.2041659.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Zhang, Yongqian. "Steady supersonic flow past an almost straight wedge with large vertex angle." Journal of Differential Equations 192, no. 1 (2003): 1–46. http://dx.doi.org/10.1016/s0022-0396(03)00037-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

Mo, Zeyao, Aiqing Zhang, and Zhang Yang. "A new parallel algorithm for vertex priorities of data flow acyclic digraphs." Journal of Supercomputing 68, no. 1 (2013): 49–64. http://dx.doi.org/10.1007/s11227-013-1022-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Brimkov, Boris, and Illya V. Hicks. "Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs." Discrete Applied Mathematics 204 (May 2016): 13–21. http://dx.doi.org/10.1016/j.dam.2015.10.016.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Takeuchi, Masashi, Wataru Kishimoto, and Genya Kishi. "Synthesis of a flow network with a given centrality on each vertex." Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 72, no. 3 (1989): 73–87. http://dx.doi.org/10.1002/ecjc.4430720307.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

HAN, YICHEOL, STEPHAN J. GOETZ, JEONGJAE LEE, and SEONGSOO YOON. "SIMULATING NETWORK STRUCTURES USING BERNOULLI'S PRINCIPLE." Advances in Complex Systems 15, no. 05 (2012): 1250032. http://dx.doi.org/10.1142/s0219525912500324.

Texte intégral

Résumé :

Using the fact that connections between vertices of a network often represent directed and weighted flows, we apply hydraulic principles to develop novel insights into network structure and growth. We develop a network model based on Bernoulli's principle and use it to analyze changes in network properties. Simulation results show that velocity of flow, resistance, fitness and existing connections in a system determine network connections of a vertex as well as overall network structure. We demonstrate how network structure is affected by changes in velocity and resistance, and how one vertex

Styles APA, Harvard, Vancouver, ISO, etc.

45

Hiraiwa, Tetsuya, Fu-Lai Wen, Tatsuo Shibata, and Erina Kuranaga. "Mathematical Modeling of Tissue Folding and Asymmetric Tissue Flow during Epithelial Morphogenesis." Symmetry 11, no. 1 (2019): 113. http://dx.doi.org/10.3390/sym11010113.

Texte intégral

Résumé :

Recent studies have revealed that intrinsic, individual cell behavior can provide the driving force for deforming a two-dimensional cell sheet to a three-dimensional tissue without the need for external regulatory elements. However, whether intrinsic, individual cell behavior could actually generate the force to induce tissue deformation was unclear, because there was no experimental method with which to verify it in vivo. In such cases, mathematical modeling can be effective for verifying whether a locally generated force can propagate through an entire tissue and induce deformation. Moreover

Styles APA, Harvard, Vancouver, ISO, etc.

46

Wang, Tao-Ming. "Group Constant-Sum Spectrum of Nearly Regular Graphs." Mathematics 13, no. 3 (2025): 478. https://doi.org/10.3390/math13030478.

Texte intégral

Résumé :

For an undirected graph G, a zero-sum flow is an assignment of nonzero integer weights to the edges such that each vertex has a zero-sum, namely the sum of all incident edge weights with each vertex is zero. This concept is an undirected analog of nowhere-zero flows for directed graphs. We study a more general one, namely constant-sum A-flows, which gives edge weights using nonzero elements of an additive Abelian group A and requires each vertex to have a constant-sum instead. In particular, we focus on two special cases: A=Zk, the finite cyclic group of integer congruence modulo k, and A=Z, t

Styles APA, Harvard, Vancouver, ISO, etc.

47

Nazir, Nazia, Tanzeela Shaheen, LeSheng Jin, and Tapan Senapati. "An Improved Algorithm for Identification of Dominating Vertex Set in Intuitionistic Fuzzy Graphs." Axioms 12, no. 3 (2023): 289. http://dx.doi.org/10.3390/axioms12030289.

Texte intégral

Résumé :

In graph theory, a “dominating vertex set” is a subset of vertices in a graph such that every vertex in the graph is either a member of the subset or adjacent to a member of the subset. In other words, the vertices in the dominating set “dominate” the remaining vertices in the graph. Dominating vertex sets are important in graph theory because they can help us understand and analyze the behavior of a graph. For example, in network analysis, a set of dominant vertices may represent key nodes in a network that can influence the behavior of other nodes. Identifying dominant sets in a graph can al

Styles APA, Harvard, Vancouver, ISO, etc.

48

Shao, Xueming, Xiaolong Zhang, Zhaosheng Yu, and Jianzhong Lin. "Numerical studies on the dynamics of an open triangle in a vertically oscillatory flow." Journal of Fluid Mechanics 788 (January 5, 2016): 381–406. http://dx.doi.org/10.1017/jfm.2015.703.

Texte intégral

Résumé :

A direct-forcing fictitious domain method is employed to study the dynamics of an open triangle in a vertically oscillatory flow. The flow structures, the vertical force and the torque on the fixed body are analysed for the stable flow regime in which the flow structures form and evolve exactly in the same way in each period and the unstable regime, respectively. Our results indicate that in the stable flow regime for the body with upright orientation, the steady streaming structure mainly comprises two vortex pairs located respectively above and below the body. Due to up–down asymmetry of the

Styles APA, Harvard, Vancouver, ISO, etc.

49

Petrichenko, Mihail R., and Ol’ga A. Solov’yova. "Merging and splitting flows in a tee: the Pavlovsky method." Vestnik MGSU, no. 11 (November 2020): 1546–55. http://dx.doi.org/10.22227/1997-0935.2020.11.1546-1555.

Texte intégral

Résumé :

Introduction. The Pavlovsky method is employed to consider the flows that merge and split inside a tee. Materials and methods. The problem of flows, merging and splitting inside a simple straight tee, is reduced to the problem of limits in a theory of functions applied to the characteristic function of a flow. The influence of the geometric parameter of a tee (a module), head losses and an external power source, produced on the flow rate coefficient in a tee, is identified in the work. Results. The co-authors identified a relation between the geometric parameters of a tee and its c

Styles APA, Harvard, Vancouver, ISO, etc.

50

Franzblau, D. S., and A. Raychaudhuri. "Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow." ANZIAM Journal 44, no. 2 (2002): 193–204. http://dx.doi.org/10.1017/s1446181100013894.

Texte intégral

Résumé :

A minimum Hamiltonian completion of a graph G is a minimum-size set of edges that, when added to G, guarantee a Hamiltonian path. Finding a Hamiltonian completion has applications to frequency assignment as well as distributed computing. If the new edges are deleted from the Hamiltonian path, one is left with a minimum path cover, a minimum-size set of vertex-disjoint paths that cover the vertices of G. For arbitrary graphs, constructing a minimum Hamiltonian completion or path cover is clearly NP-hard, but there exists a linear-time algorithm for trees. In this paper we first give a descripti

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!