Готові списки джерел за темами / Maximum Size Matching

Добірка наукової літератури з теми "Maximum Size Matching"

Автор: Grafiati

Опубліковано: 6 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Maximum Size Matching".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Maximum Size Matching"

Cameron, Kathie, and Tracy Walker. "The graphs with maximum induced matching and maximum matching the same size." Discrete Mathematics 299, no. 1-3 (August 2005): 49–55. http://dx.doi.org/10.1016/j.disc.2004.07.022.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Noureen, Sadia, and Bhatti Ahmad. "The modified first Zagreb connection index and the trees with given order and size of matchings." Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics 13, no. 2 (2021): 85–94. http://dx.doi.org/10.5937/spsunp2102085n.

Повний текст джерела

Анотація:

A subset of the edge set of a graph G is called a matching in G if its elements are not adjacent in G. A matching in G with the maximum cardinality among all the matchings in G is called a maximum matching. The matching number in the graph G is the number of elements in the maximum matching of G. This present paper is devoted to the investigation of the trees, which maximize the modified first Zagreb connection index among the trees with a given order and matching number.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pálvölgyi, Dömötör. "Partitioning to three matchings of given size is NP-complete for bipartite graphs." Acta Universitatis Sapientiae, Informatica 6, no. 2 (December 1, 2014): 206–9. http://dx.doi.org/10.1515/ausi-2015-0004.

Повний текст джерела

Анотація:

Abstract We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned into three matchings, of size k1, k2 and k3 is NP-complete, even if one of the matchings is required to be perfect. We also show that the problem of deciding whether the edge set of a simple graph contains a perfect matching and a disjoint matching of size k or not is NP-complete, already for bipartite graphs with maximum degree 3. It also follows from our construction that it is NP-complete to decide whether in a bipartite graph there is a perfect matching and a disjoint matching that covers all vertices whose degree is at least 2.

Стилі APA, Harvard, Vancouver, ISO та ін.

Keslassy, I., Rui Zhang-Shen, and N. McKeown. "Maximum size matching is unstable for any packet switch." IEEE Communications Letters 7, no. 10 (October 2003): 496–98. http://dx.doi.org/10.1109/lcomm.2003.817330.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rhee, Wansoo T. "A concentration inequality for maximum matching size in random graphs1." Optimization 21, no. 5 (January 1990): 797–803. http://dx.doi.org/10.1080/02331939008843608.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kobler, Daniel, and Udi Rotics. "Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size." Algorithmica 37, no. 4 (May 28, 2003): 327–46. http://dx.doi.org/10.1007/s00453-003-1035-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Plummer, Michael D., and Akira Saito. "Forbidden subgraphs and bounds on the size of a maximum matching." Journal of Graph Theory 50, no. 1 (2005): 1–12. http://dx.doi.org/10.1002/jgt.20087.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Klemz, Boris, and Günter Rote. "Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs." Algorithmica 84, no. 4 (January 6, 2022): 1064–80. http://dx.doi.org/10.1007/s00453-021-00904-w.

Повний текст джерела

Анотація:

AbstractA bipartite graph $$G=(U,V,E)$$ G = ( U , V , E ) is convex if the vertices in V can be linearly ordered such that for each vertex $$u\in U$$ u ∈ U , the neighbors of u are consecutive in the ordering of V. An induced matchingH of G is a matching for which no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and mweighted edges, an induced matching of maximum total weight can be computed in $$O(n+m)$$ O ( n + m ) time. An unweighted convex bipartite graph has a representation of size O(n) that records for each vertex $$u\in U$$ u ∈ U the first and last neighbor in the ordering of V. Given such a compact representation, we compute an induced matching of maximum cardinality in O(n) time. In convex bipartite graphs, maximum-cardinality induced matchings are dual to minimum chain covers. A chain cover is a covering of the edge set by chain subgraphs, that is, subgraphs that do not contain induced matchings of more than one edge. Given a compact representation, we compute a representation of a minimum chain cover in O(n) time. If no compact representation is given, the cover can be computed in $$O(n+m)$$ O ( n + m ) time. All of our algorithms achieve optimal linear running time for the respective problem and model, and they improve and generalize the previous results in several ways: The best algorithms for the unweighted problem versions had a running time of $$O(n^2)$$ O ( n 2 ) (Brandstädt et al. in Theor. Comput. Sci. 381(1–3):260–265, 2007. 10.1016/j.tcs.2007.04.006). The weighted case has not been considered before.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kuz'min, Nikita Aleksandrovich, and Dmitriy Sergeevich Malyshev. "On diameter $5$ trees with the maximum number of matchings." Sbornik: Mathematics 214, no. 2 (2023): 273–84. http://dx.doi.org/10.4213/sm9745e.

Повний текст джерела

Анотація:

A matching in a graph is any set of edges of this graph without common vertices. The number of matchings, also known as the Hosoya index of the graph, is an important parameter, which finds wide applications in mathematical chemistry. Previously, the problem of maximizing the Hosoya index in trees of radius $2$ (that is, diameter $4$) of fixed size was completely solved. This work considers the problem of maximizing the Hosoya index in trees of diameter $5$ on a fixed number $n$ of vertices and solves it completely. It turns out that for any $n$ the extremal tree is unique. Bibliography: 6 titles.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, H., S. Liu, Z. Ye, X. Tong, H. Xie, S. Zheng, and Q. Du. "EFFECT OF IMAGE MATCHING WINDOW SIZE ON SATELLITE JITTER FREQUENCY DETECTION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIII-B1-2020 (August 6, 2020): 149–55. http://dx.doi.org/10.5194/isprs-archives-xliii-b1-2020-149-2020.

Повний текст джерела

Анотація:

Abstract. Satellite attitude jitter is a common and complex phenomenon for high-resolution satellites and it is detectable by multi-temporal image matching. This paper analyses the effect of image matching window size on jitter frequency detection. First, two simulation images with a given short time lag and line scanning frequency affected by a modelled jitter are generated based on the principle of dynamic imaging model. Then, the relative image distortions are obtained by dense image matching with different matching window size and the frequency is estimated through spectrum analysis of the obtained image distortions. The experimental results demonstrated the feasibility and reliability of high frequency jitter detection based on dense image matching, and the results indicated that the maximum detectable frequency is almost not affected by the change of image matching window size, which provided useful demonstration of image-based satellite jitter detection capacity.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Maximum Size Matching"

Sidibé, Abdoul Karim. "Three essays in microeconomic theory." Thesis, 2020. http://hdl.handle.net/1866/24659.

Повний текст джерела

Анотація:

Cette thèse est un recueil de trois articles sur la théorie microéconomique. Les deux premiers traitent de la question de la course vers le bas lorsque les gouvernements se livrent à la concurrence pour certains facteurs mobiles. Le troisième article propose une extension du problème d'appariement plusieurs-à-un en y introduisant des agents de tailles différentes. Dans le premier article, nous montrons comment le résultat standard de course vers le bas (race-to-the-bottom) peut être évité en introduisant du bien public dans un modèle de compétition fiscale. Notre économie comporte deux juridictions peuplées par de la main-d’œuvre parfaitement mobile répartie en deux catégories : qualifiée et non-qualifiée. Les gouvernements, en poursuivant un objectif Rawlsien (max-min), annoncent simultanément leur projet d'investissement en bien public avant d'adopter une politique de taxation non-linéaire du revenu. Les travailleurs, après avoir observé la politique de taxation des différents gouvernements et leurs promesses d'investissement en bien publique, choisissent chacun un lieu de résidence et une offre de travail. Ainsi, les gouvernements atteignent leurs objectifs de redistribution en cherchant à attirer de la main-d’œuvre productive à travers la fourniture de bien public en plus d'une politique de taxation favorable. Nous montrons qu'il existe des équilibres où les travailleurs qualifiés paient une taxe strictement positive. En outre, lorsque l'information sur le type des travailleurs est privée, il existe, pour certaines valeurs des paramètres, des équilibres où la main-d’œuvre non-qualifiée bénéficie d'un transfert net (ou subvention) de la part du gouvernement. Dans le second article, nous étudions comment le modèle standard de compétition des prix à la Bertrand avec des produits différenciés pourrait fournir des informations utiles pour les programmes de citoyenneté par investissement dans les Caraïbes. Nous montrons que lorsque les pays peuvent être classés en deux types en fonction de la taille de leur demande, l'imposition d'un prix minimum uniforme et d'un quota maximum appropriés amène les pays à un résultat efficace qui Pareto domine l'équilibre de Nash non coopératif. Enfin, le troisième article explore une extension du problème standard d'appariement plusieurs-à-un en y incorporant des agents de tailles différentes (familles de réfugiés) d'un côté, à assigner à des foyers de capacités différentes de l'autre. La taille d'une famille de réfugiés représente le nombre de membres qui la compose. Une caractéristique spécifique à ce modèle est qu'il n'autorise pas de répartir les membres d'une même famille entre différents foyers. Il est bien connu que, dans ces conditions, bon nombre de propriétés désirables des règles d'appariement s'effondrent. Nous faisons donc l'hypothèse des priorités croissantes avec la taille pour chaque foyer, c'est-à-dire qu'une famille d'accueil préférerait toujours un plus grand nombre de réfugiés tant que la capacité de son foyer le permet. Nous montrons qu'un appariement stable par paire existe toujours sous cette hypothèse et nous proposons un mécanisme pour le trouver. Nous montrons que notre mécanisme est non-manipulable du point de vue des réfugiés : aucun groupe de réfugiés ne pourrait tirer profit d'une déclaration truquée de leurs préférences. Notre mécanisme est également optimal pour les réfugiés en ce sens qu'il n'existe aucun autre mécanisme stable par paire qui serait plus profitable à tous les réfugiés.
This thesis is a collection of three articles on microeconomic theory. The first two articles are concerned with the issue of race-to-the-bottom when governments engage in competition for some mobile factor. The third article proposes an extension for the many-to-one matching problem by introducing different-size agents. In the first article, we show how the standard race-to-the-bottom result can be avoided by introducing public good into a tax competition model. Our economy has two jurisdictions populated by perfectly mobile workers divided into two categories: skilled and unskilled. Governments, in pursuit of a Rawlsian objective (max-min), simultaneously announce their plans for investing in public good before deploying a nonlinear income tax schedule. After observing the tax schedules of the governments and their promises to invest in public good, each worker chooses a place of residence and a supply of labour. Thus, governments achieve their redistribution objectives by seeking to attract productive labour through the provision of public goods in addition to favorable taxation policy. We show that there exist equilibria where skilled workers pay a strictly positive tax. In addition, when information on the type of workers is private, there are equilibria for certain parameter values in which unqualified workers receive a net transfer (or subsidy) from the government. In the second article, we investigate how the Bertrand standard price competition with differentiated products could provide useful insight for Citizenship By Investment programs in the Caribbean. We show that when countries can be classified into two types according to the size of their demand, imposing appropriate uniform minimum price and maximum quota brings countries to an efficient outcome that Pareto dominates the Non-Cooperative Nash Equilibrium. Finally. in the third article, we explore an extension of the standard many-to-one matching problem by incorporating different-size agents (refugee families) on the many side of the market, to be assigned to entities (homes) with different capacities on the other side. A specific feature of this model is that it does not allow refugee families to be split between several homes. It is well known that many of the desirable properties of matching rules are unachievable in this framework. We introduce size-monotonic priority ranking over refugee families for each home, that is, a host family (home) would always prefer a greater number of members of refugee families until its capacity constraint binds. We show that a pairwise stable matching always exists under this assumption and we propose a mechanism to find it. We show that our mechanism is strategy-proof for refugees: no refugee family could benefit from misrepresenting his preferences. Our mechanism is also refugees optimal pairwise stable in the sense that there is no other pairwise stable mechanism that would be more profitable to all refugees.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Maximum Size Matching"

Gupta, Rajesh. Randomized controlled trial evidence for gabapentin in post-herpetic neuralgia. Edited by Paul Farquhar-Smith, Pierre Beaulieu, and Sian Jagger. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198834359.003.0069.

Повний текст джерела

Анотація:

The landmark paper discussed in this chapter is ‘Gabapentin for the treatment of postherpetic neuralgia: A randomized controlled trial’, published by Rowbotham et al. in 1998. In the study, a 4-week initial period of titration of gabapentin (up to a maximum of 3,600 mg) or matching placebo was given, followed by a further 4-week period at the maximum tolerated dose. The primary efficacy measure was change in average daily pain score from start to finish of the treatment, and secondary measures observed were the average daily sleep score, a short-form McGill Pain Questionnaire, the subject’s global impression of change, the investigator-rated clinical global impression of change, the Short Form 36, a quality-of-life questionnaire, and a Profile of Mood States questionnaire. Subjects receiving gabapentin had significant reduction in daily pain scores as well as improvement in secondary measures of pain, although with an increased incidence of side effects.

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Maximum Size Matching"

Behnezhad, Soheil. "Dynamic Algorithms for Maximum Matching Size." In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 129–62. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nikolopoulos, Stavros D., and Leonidas Palios. "Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching." In Advances in Informatics, 68–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11573036_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kapralov, Michael, Slobodan Mitrović, Ashkan Norouzi-Fard, and Jakab Tardos. "Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1753–72. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.107.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Blanton, Marina, and Siddharth Saraph. "Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification." In Computer Security -- ESORICS 2015, 384–406. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24174-6_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

"Size and structure of maximum matchings." In Matching Theory, 83–119. Providence, Rhode Island: American Mathematical Society, 2009. http://dx.doi.org/10.1090/chel/367/03.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bažant, Zdeněk P., Jia-Liang Le, and Marco Salviato. "Energetic Size Effect in Quasibrittle Fracture." In Quasibrittle Fracture Mechanics and Size Effect, 112–39. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192846242.003.0005.

Повний текст джерела

Анотація:

The energetic size effect, transitioning from ductile behavior at small structure sizes to brittle behavior at large ones, is a quintessential feature of all quasibrittle fracture. Its analytical law, recently adopted for ACI Standard 318, is important for safe and efficient structural design. First it is explained that, in absence of any material characteristic length, which is the case for both elasticity and LEFM, the scaling of structural strength must be a power law of structure size. Its particular form is derived from dimensional analysis. After establishing the second-order asymptotic size effect of quasibritle structures at the small-size limit, the size effect law for geometrically scaled structure is derived by asymptotic matching to large-size asymptotic expansion of equivalent LEFM. The brittleness number is introduced as a geometry independent characteristic of failure behavior. Differences between the deterministic size effects of Type 1 and Type 2 are explained and their particular size effect laws are derived. It is also shown how to derive the R-curve from the observed size effect. Finally, the standardized use of the type 2 size effect law to obtain the fracture energy and characteristic FPZ size from the tests of maximum loads of similar notched specimens of sufficiently different sizes is derived and explained.

Стилі APA, Harvard, Vancouver, ISO та ін.

"Doing the experiment." In Muon Spectroscopy, edited by Stephen J. Blundell, Roberto De Renzi, Tom Lancaster, and Francis L. Pratt, 217–38. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198858959.003.0015.

Повний текст джерела

Анотація:

This chapter describes various practicalities that are important in performing muon experiments and doing the analysis. Practical considerations for setting up and carrying out muon measurements include matching the sample to the beam spot size, choosing the sample environment and setting the required time resolution and measurement window. Muon spectroscopy data are often analysed in the time domain, which might involve fitting individual or multiple detector groups in a sequence or simultaneously. Data analysis in the frequency domain can be carried out using Fourier and Maximum Entropy methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

"3 Size and Structure of Maximum Matchings." In North-Holland Mathematics Studies, 83–119. Elsevier, 1986. http://dx.doi.org/10.1016/s0304-0208(08)73639-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Maximum Size Matching"

Assadi, Sepehr, Sanjeev Khanna, and Yang Li. "On Estimating Maximum Matching Size in Graph Streams." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.113.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hu, Shujing, Jinyuan Sehn, Runjie Liu, Wenying Zhang, and Weixin Mu. "Maximum Size Matching Method Realized by Hopfield Neural Network for ATM cell scheduling." In 2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop (KAM 2008 Workshop). IEEE, 2008. http://dx.doi.org/10.1109/kamw.2008.4810566.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Winick, K. A., and P. Kumar. "Spatial mode matching efficiencies for heterodyned GaAlAs semiconductor lasers." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tux5.

Повний текст джерела

Анотація:

The performance of an optical heterodyne receiver is strongly influenced by the degree to which the signal and local oscillator beams can be spatially matched in both amplitude and phase at the detector. Any mismatch reduces the IF signal power and consequently the SNR. The ratio of IF signal power obtained in the presence of a mismatch to that obtained when there is no mismatch is referred to as the spatial mode matching efficiency. Several authors have performed theoretical studies to determine the mode matching efficiency as a function of system parameters, including signal/local oscillator beam angular misalignment, signal/local oscillator beam size differences, and detector-to-spot size ratios. Experiments to quantitatively measure mode matching efficiencies, however, are few. We experimentally measured these efficiencies when two independent GaAlAs semiconductor lasers were heterodyned on a high-speed silicon PIN photo-detector. The experiments have also been repeated using a single frequency-modulated GaAlAs laser, which is self-heterodyned with the aid of an unequal path length Mach-Zehnder interferometer. In the former case, maximum repeatable efficiencies of 75% were obtained. In the latter case, these values increased to ~90 %.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ponce, João Pedro Poloni, and Ricardo Suyama. "Study of Convolutional Neural Networks applied to Image Stereo Matching." In Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sibgrapi.est.2020.13005.

Повний текст джерела

Анотація:

Stereo images are images formed from two or more sources that capture the same scene so that it is possible to infer the depth of the scene under analysis. The use of convolutional neural networks to compute these images has been shown to be a viable alternative due to its speed in finding the correspondence between the images. This raises questions related to the influence of structural parameters, such as size of kernel, stride and pooling policy on the performance of the neural network. To this end, this work sought to reproduce an article that deals with the topic and to explore the influence of the parameters mentioned above in function of the results of error rate and losses of the neural model. The results obtained reveal improvements. The influence of the parameters on the training time of the models was also notable, even using the GPU, the temporal difference in the training period between the maximum and minimum limits reached a ratio of six times.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhou, Jianrong, Kun He, Jiongzhi Zheng, Chu-Min Li, and Yanli Liu. "A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/265.

Повний текст джерела

Анотація:

We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) and Leaf vertex Union Match (LUM). Given two graphs for which we search for the maximum common (connected) induced subgraph, the first operator of LSM maintains a score for the branching node using the short-term reward of each vertex of the first graph and the long-term reward of each vertex pair of the two graphs. In this way, the BnB process learns to reduce the search tree size significantly and boost the algorithm performance. The second operator of LUM further improves the performance by simultaneously matching the leaf vertices connected to the current matched vertices, and allows the algorithm to match multiple vertex pairs without affecting the optimality of solution. We incorporate the two operators into the state-of-the-art BnB algorithm McSplit, and denote the resulting algorithm as McSplit+LL. Experiments show that McSplit+LL outperforms McSplit+RL, a more recent variant of McSplit using reinforcement learning that is superior than McSplit.

Стилі APA, Harvard, Vancouver, ISO та ін.

Nikitopoulos, D. E., J. Fiedler, M. Dowden, and E. Evans. "Bubble Size Effects on Dispersed Phase Motion in Vertical Bubbly Pipe Flow." In ASME/JSME 2003 4th Joint Fluids Summer Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/fedsm2003-45553.

Повний текст джерела

Анотація:

Three-dimensional measurements of bubble size, and velocity are presented along with the associated statistics for dilute bubbly flow in a vertical pipe. These measurements were obtained through a combination of precise index-of-refraction matching and a stereoscopic high-speed imaging system. An image-processing algorithm has been developed and used to extract instantaneous bubble size, shape, velocity and trajectory information and statistics corrected for magnification errors (maximum of 2%). The experiments have been conducted at a Reynolds of 14,600 in vertical pipe-flow and a volumetric gas flow ratio of 0.29%. Bubble sizes ranged from sub millimeter to several millimeters. The results indicate that bubbles less than approximately 20 wall units with very low ratios of rise velocity-to-liquid-average-velocity occupy the full breadth of the test section, while bubbles in the range between 20 and 60 wall units with ratios of rise-velocity-to-liquid-average-velocity greater than 0.5 are efficiently trapped by the wall and are almost exclusively found in the inner wall region (y+ < 30). Bubbles larger than 60 wall units with ratios of rise-velocity-to-liquid-average-velocity less than 0.5 are found throughout the pipe cross-section although with a strong preference to the wall neighborhood. This bubble behavior is put in perspective considering four mechanisms of bubble migration: (a) turbulent dispersion due to near-wall large scale structure, (b) inviscid transverse forces (Magnus), (c) viscous transverse forces (Saffman), and (d) unsteady transverse forces because of vortex shedding and bubble shape deformation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Tianbai, Haofeng Chen, Weihang Chen, and James Ure. "Ratchet Limits for a Crack in a Welded Pipe Subjected to a Cyclic Temperature Load and a Constant Mechanical Load." In ASME 2011 Pressure Vessels and Piping Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/pvp2011-57046.

Повний текст джерела

Анотація:

This paper presents the ratchet limit analysis of a pipe with a symmetric crack in a mismatched weld by using the extended Linear Matching Method (LMM). Two loading conditions are considered: i) a cyclic temperature load and a constant internal pressure; and ii) a cyclic temperature load and a constant axial tension. Individual effects of i) the geometry of the Weld Metal (WM), ii) the size of the crack, iii) the location of the crack and iv) the yield stress of WM on the ratchet limits, maximum temperature ranges to avoid ratchetting and limit loads are investigated. Influence functions of the yield stress of WM on the maximum temperature ranges and limit loads are generated. The results confirm the applicability of the extended LMM to the cracked welded pipe.

Стилі APA, Harvard, Vancouver, ISO та ін.

Thirumurthy, Deepak, Jose Carlos Casado Coca, and Kanishka Suraweera. "Capacity Matching of Aeroderivative Gas Generator With Free Power Turbine: Challenges, Uncertainties, and Opportunities." In ASME Turbo Expo 2019: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gt2019-90617.

Повний текст джерела

Анотація:

Abstract For gas turbines with free power turbines, the capacity or flow parameter matching is of prime importance. Accurately matched capacity enables the gas turbine to run at its optimum conditions. This ensures maximum component efficiencies, and optimum shaft speeds within mechanical limits. This paper presents the challenges, uncertainties, and opportunities associated with an accurate matching of a generic two-shaft aeroderivative HP-LP gas generator with the free power turbine. Additionally, generic performance trends, uncertainty quantification, and results from the verification program are also discussed. These results are necessary to ensure that the final free power turbine capacity is within the allowable range and hence the product meets the performance guarantees. The sensitivity of free power turbine capacity to various design variables such as the vane throat area, vane trailing edge size, and manufacturing tolerance is presented. In addition, issues that may arise due to not meeting the target capacity are also discussed. To conclude, in addition to design, analysis, and statistical studies, a system-of-systems approach is mandatory to meet the allowed variation in the free power turbine capacity and hence the desired gas turbine performance.

Стилі APA, Harvard, Vancouver, ISO та ін.

Sakamoto, Hitoshi, and Kazuyuki Mikubo. "Closed-Loop Flow Boiling Module With a Plated Heat Sink." In ASME 2007 InterPACK Conference collocated with the ASME/JSME 2007 Thermal Engineering Heat Transfer Summer Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/ipack2007-33260.

Повний текст джерела

Анотація:

A compact flow boiling module was developed for cooling a 100-W class package of about one-inch square in size. The cold plate, where heat is transferred from the package was made with a porous plating inside to augment boiling heat transfer. Heat transfer increased by a maximum of 50 percent when an organic refrigerant HFE-7100 was used, while the conditions for heat rejection to the ambient were kept unchanged. The heat rejection was achieved with an 80-mm fan with a matching corrugated fin radiator, whose effectiveness limits the overall size of the cooling module. The microscopic structure in the cold plate negatively influenced boiling of water, holding large patches of vapor bubbles on the surface. When the convective effect was increased by decreasing the cross sectional area of the channel by 10 times, heat transfer was further augmented approximately by 2 folds, making the use of the organic refrigerant an attractive option as the working fluid.

Стилі APA, Harvard, Vancouver, ISO та ін.

Choi-Rokas, Hyegjoo, Todd Garlie, and K. Blake Mitchell. "Theoretical Framework for the Sizing of Body Armor Plates to Optimize Fit." In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001898.

Повний текст джерела

Анотація:

The development of optimized fitting body armor is critical to the fightability and protection of our warfighters and first responders. Body armor systems generally worn by warfighters consists of three protective portions: rigid plates, a soft armor insert, and a carrier/vest. Rigid plates are inserted into the front, back, and sides of the body armor to provide a higher level of protection for the wearer, while the soft armor is positioned behind the plates and in areas of the body where a lower level of protection is acceptable or required for mobility and comfort. Previously, a comprehensive fit mapping study on the family of armor plates to investigate the relationship between the coverage, anthropometry and mobility relative to size specifications of torso and side plates was conducted (Choi et. al., 2017). There is a delicate tradeoff between covering more (i.e., a greater area of protection) while not degrading the wearer’s mission performance (primarily their mobility). However, some level of mobility degradation is unavoidable. Choi et. al. (2017)'s results quantitatively defined the impact of coverage on mobility, visualized the mobility degradation as coverage increase, and set the allowable mobility degradation to be 10%. The coverage corresponding to the allowable mobility degradation was then converted into anthropometric dimensions. Accommodation envelopes for the current U.S. Army torso plates, relative to the male and female US Army population, were reported. Final size tariffs were calculated using the front plate. A sizing system for the back plate and/or side plates were not developed.This current study explores a theoretical framework for ballistic rigid plate size optimization for the front, back and side plates. When the protection coverage is maximized with minimal mobility degradation, the system would be considered optimized. For this study, minimal mobility degradation was set to 10%. For the front plate, Choi et. al. was revisited to retrieve the maximum width and length while limiting the mobility degradation to 10%. Chest Breadth, was measured using the ANSUR II (Gordon et. al., 2014) procedure, and Suprasternale -Tenth Rib Length was used to derive the width and length of plates, respectively. Then, a specification of the front ballistic plate, given anthropometric characteristics of the current U.S. Army population was developed from a reverse engineering approach. Theoretical accommodation envelopes for each front plate size were then developed and plotted against the current ANSUR II data. Once the front plate sizing system was developed, anthropometric characteristics of cases within each accommodation envelope per size were investigated to develop the required size specifications for the back plate. The width of the back plate shares the width of the matching front plate, but the length takes into account the back length, from the Cervicale -Tenth Rib Length. Size specifications for the side plates were also developed. Given that the front and back plates are worn together; the maximum width of the side plate is defined by the surface availability at the location of the tenth rib level. The side plate length is defined using the distance between Tenth Rib and the Axilla. A theoretical size system for a family of rigid armor plates is presented in a series of tables as well as bivariate plots. A detailed process for plate size prediction and the interaction between the front, back and side plates is presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!