Log in

Relevant bibliographies by topics / Maximum Size Matching / Journal articles

Journal articles on the topic 'Maximum Size Matching'

To see the other types of publications on this topic, follow the link: Maximum Size Matching.

Author: Grafiati

Published: 6 September 2023

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Maximum Size Matching.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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.

Full text

Abstract:

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, and other styles

3

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.

Full text

Abstract:

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, and other styles

4

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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.

Full text

Abstract:

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, and other styles

9

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.

Full text

Abstract:

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, and other styles

10

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.

Full text

Abstract:

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, and other styles

11

Zhang, Huajun. "On the maximum size of subfamilies of labeled set with given matching number." Journal of Combinatorial Optimization 38, no. 4 (October 21, 2019): 1296–304. http://dx.doi.org/10.1007/s10878-019-00451-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

BABENKO, MAXIM, ALEXEY GUSAKOV, and ILYA RAZENSHTEYN. "TRIANGLE-FREE 2-MATCHINGS REVISITED." Discrete Mathematics, Algorithms and Applications 02, no. 04 (December 2010): 643–54. http://dx.doi.org/10.1142/s1793830910000930.

Full text

Abstract:

A 2-matching in an undirected graph G = (VG, EG) is a function x: EG → {0, 1, 2} such that for each node v ∈ VG the sum of values x(e) for all edges e incident to v does not exceed 2. The size of x is the sum ∑e x(e). If {e ∈ EG|x(e) ≠ 0} contains no triangles then x is called triangle-free. Cornuéjols and Pulleyblank devised a combinatorial O(mn)-algorithm that finds a maximum triangle free 2-matching of size (hereinafter n ≔ |VG|, m ≔ |EG|) and also established a min-max theorem. We claim that this approach is, in fact, superfluous by demonstrating how these results may be obtained directly from the Edmonds–Gallai decomposition. Applying the algorithm of Micali and Vazirani we are able to find a maximum triangle-free 2-matching in [Formula: see text] time. Also we give a short self-contained algorithmic proof of the min-max theorem. Next, we consider the case of regular graphs. It is well-known that every regular graph admits a perfect 2-matching. One can easily strengthen this result and prove that every d-regular graph (for d ≥ 3) contains a perfect triangle-free 2-matching. We give the following algorithms for finding a perfect triangle-free 2-matching in a d-regular graph: an O(n)-algorithm for d = 3, an O(m + n3/2)-algorithm for d = 2k(k ≥ 2), and an O(n2)-algorithm for d = 2k + 1(k ≥ 2). We also prove that there exists a constant c > 1 such that every 3-regular graph contains at least cn perfect triangle-free 2-matchings.

APA, Harvard, Vancouver, ISO, and other styles

13

Sonnenberg, FA, MH Eckman, and SG Pauker. "Bone marrow donor registries: the relation between registry size and probability of finding complete and partial matches [see comments]." Blood 74, no. 7 (November 15, 1989): 2569–78. http://dx.doi.org/10.1182/blood.v74.7.2569.2569.

Full text

Abstract:

Abstract In a registry of volunteer bone marrow donors, the relation between registry size and probability of finding an exact or partial match for a random recipient cannot be theoretically derived because it depends on specifics of the human leukocyte antigen (HLA) haplotype frequencies in the donor and recipient populations. The relation must be explicitly calculated using empirically determined HLA haplotype frequency data for all possible pairings between a donor and a recipient population. This report describes a general solution to this problem. The method shows that the relation of the probability of matching to registry size is sigmoidal, with small increases in probability at the extremes of registry size and a middle range of registry size within which the probability of matching increases most sharply. This range determines the approximate size of the most cost-effective registry. In addition, for any pairing of donor and recipient populations, there is a maximum probability of identifying a match of a given quality for a random recipient, which cannot be exceeded even if registry size were infinite. This upper limit is a function of the frequency of blank (or unknown) alleles in the donor and recipient populations; the higher that frequency, the lower the maximum probability of achieving any given quality of match. The determinants of the probability of achieving a given quality of match with a given registry size are (1) the genetic heterogeneity within the recipient and donor populations, which increases the registry size required to achieve a given probability of matching, and (2) the degree of genetic homology between the donor and recipient populations, which increases the maximum probability of matching and also lowers registry size requirements. The method described here can be used to estimate donor pool size requirements using any donor and recipient populations for which HLA frequency data are available.

APA, Harvard, Vancouver, ISO, and other styles

14

Sonnenberg, FA, MH Eckman, and SG Pauker. "Bone marrow donor registries: the relation between registry size and probability of finding complete and partial matches [see comments]." Blood 74, no. 7 (November 15, 1989): 2569–78. http://dx.doi.org/10.1182/blood.v74.7.2569.bloodjournal7472569.

Full text

Abstract:

In a registry of volunteer bone marrow donors, the relation between registry size and probability of finding an exact or partial match for a random recipient cannot be theoretically derived because it depends on specifics of the human leukocyte antigen (HLA) haplotype frequencies in the donor and recipient populations. The relation must be explicitly calculated using empirically determined HLA haplotype frequency data for all possible pairings between a donor and a recipient population. This report describes a general solution to this problem. The method shows that the relation of the probability of matching to registry size is sigmoidal, with small increases in probability at the extremes of registry size and a middle range of registry size within which the probability of matching increases most sharply. This range determines the approximate size of the most cost-effective registry. In addition, for any pairing of donor and recipient populations, there is a maximum probability of identifying a match of a given quality for a random recipient, which cannot be exceeded even if registry size were infinite. This upper limit is a function of the frequency of blank (or unknown) alleles in the donor and recipient populations; the higher that frequency, the lower the maximum probability of achieving any given quality of match. The determinants of the probability of achieving a given quality of match with a given registry size are (1) the genetic heterogeneity within the recipient and donor populations, which increases the registry size required to achieve a given probability of matching, and (2) the degree of genetic homology between the donor and recipient populations, which increases the maximum probability of matching and also lowers registry size requirements. The method described here can be used to estimate donor pool size requirements using any donor and recipient populations for which HLA frequency data are available.

APA, Harvard, Vancouver, ISO, and other styles

15

Henning, Michael A., and Anders Yeo. "Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph." Graphs and Combinatorics 23, no. 6 (December 2007): 647–57. http://dx.doi.org/10.1007/s00373-007-0757-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Zhao, Jin-Hua. "A local algorithm and its percolation analysis of bipartite z-matching problem." Journal of Statistical Mechanics: Theory and Experiment 2023, no. 5 (May 1, 2023): 053401. http://dx.doi.org/10.1088/1742-5468/acd105.

Full text

Abstract:

Abstract A z-matching on a bipartite graph is a set of edges, among which each vertex of two types of the graph is adjacent to at most 1 and at most z ( ⩾ 1 ) edges, respectively. The z-matching problem concerns finding z-matchings with the maximum size. Our approach to this combinatorial optimization problem is twofold. From an algorithmic perspective, we adopt a local algorithm as a linear approximate solver to find z-matchings on any graph instance, whose basic component is a generalized greedy leaf removal procedure in graph theory. From a theoretical perspective, on uncorrelated random bipartite graphs, we develop a mean-field theory for the percolation phenomenon underlying the local algorithm, leading to an analytical estimation of z-matching sizes on random graphs. Our analytical theory corrects the prediction by belief propagation algorithm at zero-temperature limit in (Kreačić and Bianconi 2019 Europhys. Lett. 126 028001). Besides, our theoretical framework extends a core percolation analysis of k-XORSAT problems to a general context of uncorrelated random hypergraphs with arbitrary degree distributions of factor and variable nodes.

APA, Harvard, Vancouver, ISO, and other styles

17

BIRÓ, PÉTER, DAVID F. MANLOVE, and ROMEO RIZZI. "MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS." Discrete Mathematics, Algorithms and Applications 01, no. 04 (December 2009): 499–517. http://dx.doi.org/10.1142/s1793830909000373.

Full text

Abstract:

Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is to maximize the number of transplants, but sometimes the total benefit is maximized by considering the differences between suitable kidneys. These problems correspond to computing cycle packings of maximum size or maximum weight in directed graphs. Here we prove the APX-completeness of the problem of finding a maximum size exchange involving only 2-cycles and 3-cycles. We also present an approximation algorithm and an exact algorithm for the problem of finding a maximum weight exchange involving cycles of bounded length. The exact algorithm has been used to provide optimal solutions to real kidney exchange problems arising from the National Matching Scheme for Paired Donation run by NHS Blood and Transplant, and we describe practical experience based on this collaboration.

APA, Harvard, Vancouver, ISO, and other styles

18

Kosowski, Adrian, Michał Małafiejski, and Paweł Żyliński. "Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic Graph." Graphs and Combinatorics 24, no. 5 (October 2008): 461–68. http://dx.doi.org/10.1007/s00373-008-0807-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

FRANKL, PETER, VOJTECH RÖDL, and ANDRZEJ RUCIŃSKI. "On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size." Combinatorics, Probability and Computing 21, no. 1-2 (February 2, 2012): 141–48. http://dx.doi.org/10.1017/s0963548311000496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Shi, Chao, and Tianlong Ma. "A note on maximum size of a graph without isolated vertices under the given matching number." Applied Mathematics and Computation 460 (January 2024): 128295. http://dx.doi.org/10.1016/j.amc.2023.128295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Jin, Zemin, Kun Ye, He Chen, and Yuefang Sun. "Large rainbow matchings in semi-strong edge-colorings of graphs." Discrete Mathematics, Algorithms and Applications 10, no. 02 (April 2018): 1850021. http://dx.doi.org/10.1142/s1793830918500210.

Full text

Abstract:

The lower bounds for the size of maximum rainbow matching in properly edge-colored graphs have been studied deeply during the last decades. An edge-coloring of a graph [Formula: see text] is called a strong edge-coloring if each path of length at most three is rainbow. Clearly, the strong edge-coloring is a natural generalization of the proper one. Recently, Babu et al. considered the problem in the strongly edge-colored graphs. In this paper, we introduce a semi-strong edge-coloring of graphs and consider the existence of large rainbow matchings in it.

APA, Harvard, Vancouver, ISO, and other styles

22

GÜNTHER, MANUEL, and ROLF P. WÜRTZ. "FACE DETECTION AND RECOGNITION USING MAXIMUM LIKELIHOOD CLASSIFIERS ON GABOR GRAPHS." International Journal of Pattern Recognition and Artificial Intelligence 23, no. 03 (May 2009): 433–61. http://dx.doi.org/10.1142/s0218001409007211.

Full text

Abstract:

We present an integrated face recognition system that combines a Maximum Likelihood (ML) estimator with Gabor graphs for face detection under varying scale and in-plane rotation and matching as well as a Bayesian intrapersonal/extrapersonal classifier (BIC) on graph similarities for face recognition. We have tested a variety of similarity functions and achieved verification rates (at FAR 0.1%) of 90.5% on expression-variation and 95.8% on size-varying frontal images within the CAS-PEAL database. Performing Experiment 1 of FRGC ver2.0, the method achieved a verification rate of 72%.

APA, Harvard, Vancouver, ISO, and other styles

23

Feng, Yongde, Yanting Xie, Fengxia Liu, and Shoujun Xu. "The Extendability of Cayley Graphs Generated by Transposition Trees." Mathematics 10, no. 9 (May 7, 2022): 1575. http://dx.doi.org/10.3390/math10091575.

Full text

Abstract:

A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be extended to a perfect matching. The extendability number of Γ is the maximum k such that Γ is k-extendable. In this paper, we prove that Cayley graphs generated by transposition trees on {1,2,…,n} are (n−2)-extendable and determine that the extendability number is n−2 for an integer n≥3.

APA, Harvard, Vancouver, ISO, and other styles

24

HOPPEN, CARLOS, YOSHIHARU KOHAYAKAWA, and HANNO LEFMANN. "Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size." Combinatorics, Probability and Computing 21, no. 1-2 (February 2, 2012): 203–18. http://dx.doi.org/10.1017/s0963548311000484.

Full text

Abstract:

Let k and ℓ be positive integers. With a graph G, we associate the quantity ck,ℓ(G), the number of k-colourings of the edge set of G with no monochromatic matching of size ℓ. Consider the function ck,ℓ: given by ck,ℓ(n) = max {ck,ℓ(G): |V(G)| = n}, the maximum of ck,ℓ(G) over all graphs G on n vertices. In this paper, we determine ck,ℓ(n) and the corresponding extremal graphs for all large n and all fixed values of k and ℓ.

APA, Harvard, Vancouver, ISO, and other styles

25

Golovkov, A. A., and E. I. Mozhaeva. "Limiting Characteristics for Receiving Small Size Frame Antenna Matching Using Converter Negative Impedance." Journal of the Russian Universities. Radioelectronics, no. 1 (April 17, 2018): 32–37. http://dx.doi.org/10.32603/1993-8985-2018-21-1-32-37.

Full text

Abstract:

The limiting characteristics of electrically small-sized loop antenna matching by means of non-Foster's negative inductance are studied. Various options for including negative inductance in frame antenna structure are considered. The analytical limit expression for the operating frequency band of the small-sized loop antenna with the inclusion of negative inductance in the gap of the conductor frame is obtained. It is shown that for practical implementation the most convenient is the scheme with the inclusion of negative inductance between the conducting plane and the free output of the frame. Such inclusion of negative inductance causes small loss in width of the working frequency band compared with the inclusion of this inductance in the gap of the frame conductive plane, but EMF induced in the frame is twice as large. An integral expression is obtained for the maximum band matching of the small-sized loop antenna with the inclusion of negative inductance in grounded output, the integral in which is calculated numerically for various small-sized loop antenna quality factor and ratios between resonant frequency of the frame and operating frequency range. The results obtained are similar to Fano-Yula restriction for passive matching chains.

APA, Harvard, Vancouver, ISO, and other styles

26

Li, Yanjia, and Sophie Spirkl. "The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size." Discrete Mathematics 346, no. 4 (April 2023): 113342. http://dx.doi.org/10.1016/j.disc.2023.113342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Boyar, Joan, and Faith Ellen. "Tight Bounds for Restricted Grid Scheduling." International Journal of Foundations of Computer Science 30, no. 03 (April 2019): 375–405. http://dx.doi.org/10.1142/s0129054119500102.

Full text

Abstract:

The following problem is considered: Items with integer sizes are given and variable sized bins arrive online. A bin must be used if there is still an item remaining which fits in it when the bin arrives. The goal is to minimize the total size of all the bins used. Previously, a lower bound of [Formula: see text] on the competitive ratio of this problem was achieved using items of size [Formula: see text] and [Formula: see text]. For these item sizes and maximum bin size [Formula: see text], we obtain asymptotically matching upper and lower bounds, which vary depending on the ratio of the number of small items to the number of large items.

APA, Harvard, Vancouver, ISO, and other styles

28

LEE, D. T., and MAJID SARRAFZADEH. "MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS." International Journal of Computational Geometry & Applications 03, no. 03 (September 1993): 291–304. http://dx.doi.org/10.1142/s021819599300018x.

Full text

Abstract:

A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set Φ of chords with end-points on two horizontal lines). The problem of finding, among all noncrossing subsets of Φ with density at most k, one with maximum size is considered, where the density of a subset is the maximum number of chords crossing a vertical line and k is a given parameter. A Θ(n log n) time and Θ(n) space algorithm, for solving the problem with n chords, is proposed. As an application, we solve the problem of finding, among all proper subsets with density at most k of an interval graph, one with maximum number of intervals.

APA, Harvard, Vancouver, ISO, and other styles

29

Stoecklin, Sebastian, Adnan Yousaf, Gunnar Gidion, Leonhard Reindl, and Stefan J. Rupitsch. "Simultaneous Power Feedback and Maximum Efficiency Point Tracking for Miniaturized RF Wireless Power Transfer Systems." Sensors 21, no. 6 (March 12, 2021): 2023. http://dx.doi.org/10.3390/s21062023.

Full text

Abstract:

Near-field interfaces with miniaturized coil systems and low output power levels, such as applied in biomedical sensor systems, can suffer from severe efficiency degradation due to dynamic impedance mismatches, reducing battery life of the power transmitter unit and requiring to increase the level of electromagnetic emission. Moreover, the stability of weakly-coupled power transfer systems is generally limited by transient changes in coil alignment and load power consumption. Hence, a central research question in the domain of wireless power transfer is how to realize an adaptive impedance matching system under the constraints of a simultaneous power feedback to increase the system’s efficiency and stability, while maintaining circuit characteristics such as small size, low power consumption and fast reaction times. This paper presents a novel approach based on a two-stage control loop implemented in the primary-side reader unit, which uses a digital PI controller to maintain the rectifier output voltage for power feedback and an on-top perturb-and-observe controller configuring the setpoint of the voltage controller to maximize efficiency. The paper mathematically analyzes the AC and DC transfer characteristics of a resonant inductive link to design the reactive AC matching network, the digital voltage controller and ultimately the DC-domain impedance matching algorithm. It was found that static reactive L networks result in suitable efficiency levels for coils with sufficiently high quality factor even without adaptive tuning of operational frequency or reactive components. Furthermore, the regulated output voltage of the rectifier is a direct measure of the DC load impedance when using a regular DC/DC converter to supply the load circuits, so that this quantity can be tuned to maximize efficiency. A prototype implementation demonstrates the algorithms in a 40.68 MHz inductive link with load power levels from 10 to 100 mW and tuning time constants of 300 ms, while allowing for a simplified receiver with a footprint smaller than 200 mm2 and a self-consumption below 1 mW. Hence, the presented concepts enable adaptive impedance matching with favorable characteristics for low-energy sensor systems, i.e., minimized footprint, power level and reaction time.

APA, Harvard, Vancouver, ISO, and other styles

30

AKUTSU, TATSUYA. "ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES." International Journal of Foundations of Computer Science 17, no. 04 (August 2006): 903–17. http://dx.doi.org/10.1142/s0129054106004170.

Full text

Abstract:

The largest common point set problem (LCP) is, given two point set P and Q in d-dimensional Euclidean space, to find a subset of P with the maximum cardinality that is congruent to some subset of Q. We consider a special case of LCP in which the size of the largest common point set is at least (|P| + |Q| - k)/2. We develop efficient algorithms for this special case of LCP and a related problem. In particular, we present an O(k3n1.34 + kn2 log n) time algorithm for LCP in two-dimensions, which is much better for small k than an existing O(n3.2 log n) time algorithm, where n = max {|P|,|Q|}.

APA, Harvard, Vancouver, ISO, and other styles

31

He, Xin Sheng, Zuo Cai Dai, Chun Fu Gao, and Shao Tai Deng. "Research of Matching Power for Photovoltaic Charging Control System." Key Engineering Materials 620 (August 2014): 220–24. http://dx.doi.org/10.4028/www.scientific.net/kem.620.220.

Full text

Abstract:

For the maximum output power varies with changes in load characteristics match the characteristics of solar cells in photovoltaic power generation system, the system runs through dynamic MPPT maximum power of self-optimizing process to achieve power from the PV charge control match. First, the output characteristic simulation analysis of the solar load resistive, capacitive load showed that solar power batteries for load matching efficiency is higher than in a purely resistive load. Then, using the improved algorithm for variable step size perturbation and observation of the received output power of solar power and load matching control, experiments showed that the optimum operating point of the circuit can control the real-time monitoring of solar cells and load. The output power from the battery load matching circuit to match the time working in the best working condition, if the energy is surplus or shortage, the system can control dynamic self-optimizing adjustment to charge, which leads to batteries absorbed power increasing and the efficiency of solar energy collection improving.

APA, Harvard, Vancouver, ISO, and other styles

32

Bahadur, Saloni, Rashmee Shrestha, Yalapi Sumaharshini, Gnv Ravi Teja, and Kalpitha N. "LITERATURE REVIEW ON VARIOUS DEPTH ESTIMATION METHODS FOR AN IMAGE." International Journal of Research -GRANTHAALAYAH 5, no. 4RACSIT (April 30, 2017): 8–13. http://dx.doi.org/10.29121/granthaalayah.v5.i4racsit.2017.3342.

Full text

Abstract:

In this survey paper, different depth estimation techniques using cues from two images are observed. In this paper, different methods for depth estimation like Vergence, Stereo Disparity, Stereo Matching, Familiar Size, Defocus Cue, Convex Optimization, and Sum of Absolute Differences Algorithm are reviewed. Depth is determined by using maximum and minimum disparity.

APA, Harvard, Vancouver, ISO, and other styles

33

Lucibello, C., and F. Ricci-Tersenghi. "The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm." International Journal of Statistical Mechanics 2014 (March 10, 2014): 1–13. http://dx.doi.org/10.1155/2014/136829.

Full text

Abstract:

We analyse the asymptotic behaviour of random instances of the maximum set packing (MSP) optimization problem, also known as maximum matching or maximum strong independent set on hypergraphs. We give an analytic prediction of the MSPs size using the 1RSB cavity method from statistical mechanics of disordered systems. We also propose a heuristic algorithm, a generalization of the celebrated Karp-Sipser one, which allows us to rigorously prove that the replica symmetric cavity method prediction is exact for certain problem ensembles and breaks down when a core survives the leaf removal process. The e-phenomena threshold discovered by Karp and Sipser, marking the onset of core emergence and of replica symmetry breaking, is elegantly generalized to Cs=e/(d-1) for one of the ensembles considered, where d is the size of the sets.

APA, Harvard, Vancouver, ISO, and other styles

34

Liu, Mengyin, Chao Zhu, Jun Wang, and Xu-Cheng Yin. "Adaptive Pattern-Parameter Matching for Robust Pedestrian Detection." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 3 (May 18, 2021): 2154–62. http://dx.doi.org/10.1609/aaai.v35i3.16313.

Full text

Abstract:

Pedestrians with challenging patterns, e.g. small scale or heavy occlusion, appear frequently in practical applications like autonomous driving, which remains tremendous obstacle to higher robustness of detectors. Although plenty of previous works have been dedicated to these problems, properly matching patterns of pedestrian and parameters of detector, i.e., constructing a detector with proper parameter sizes for certain pedestrian patterns of different complexity, has been seldom investigated intensively. Pedestrian instances are usually handled equally with the same amount of parameters, which in our opinion is inadequate for those with more difficult patterns and leads to unsatisfactory performance. Thus, we propose in this paper a novel detection approach via adaptive pattern-parameter matching. The input pedestrian patterns, especially the complex ones, are first disentangled into simpler patterns for detection head by Pattern Disentangling Module (PDM) with various receptive fields. Then, Gating Feature Filtering Module (GFFM) dynamically decides the spatial positions where the patterns are still not simple enough and need further disentanglement by the next-level PDM. Cooperating with these two key components, our approach can adaptively select the best matched parameter size for the input patterns according to their complexity. Moreover, to further explore the relationship between parameter sizes and their performance on the corresponding patterns, two parameter selection policies are designed: 1) extending parameter size to maximum, aiming at more difficult patterns for different occlusion types; 2) specializing parameter size by group division, aiming at complex patterns for scale variations. Extensive experiments on two popular benchmarks, Caltech and CityPersons, show that our proposed method achieves superior performance compared with other state-of-the-art methods on subsets of different scales and occlusion types.

APA, Harvard, Vancouver, ISO, and other styles

35

Zhang, Li Ping, Yao Fu Zhu, and Zhong Fan. "Research and Simulation of Photovoltaic System MPPT Control Based on Fuzzy Algorithm." Advanced Materials Research 740 (August 2013): 164–69. http://dx.doi.org/10.4028/www.scientific.net/amr.740.164.

Full text

Abstract:

The maximum power point tracking (MPPT) control implements an effective utilization of solar energy. On the basis of the equivalent mathematical model of the photovoltaic (PV) array, presents the fixed step size perturbation and observation method, which has considerable power loss and poor adaptability. Because the existing variable step size control is complex, a fuzzy algorithm controller was designed according to the power variation and the previous step of the duty cycle, which could adjust the duty cycle of PWM dynamically, to make the PV system impedance matching and obtain the maximum power rapidly and steadily. The simulation shows that the self-optimizing fuzzy control can achieve good adaptability and good robustness when the parameters change.

APA, Harvard, Vancouver, ISO, and other styles

36

Jiao, Yuxin, Zhikun Lin, Long Yu, and Xiaozhu Wu. "A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing." ISPRS International Journal of Geo-Information 11, no. 3 (March 17, 2022): 203. http://dx.doi.org/10.3390/ijgi11030203.

Full text

Abstract:

Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.

APA, Harvard, Vancouver, ISO, and other styles

37

Bonnet, Xavier, François Brischoux, Marine Briand, and Richard Shine. "Plasticity matches phenotype to local conditions despite genetic homogeneity across 13 snake populations." Proceedings of the Royal Society B: Biological Sciences 288, no. 1943 (January 27, 2021): 20202916. http://dx.doi.org/10.1098/rspb.2020.2916.

Full text

Abstract:

In a widespread species, a matching of phenotypic traits to local environmental optima is generally attributed to site-specific adaptation. However, the same matching can occur via adaptive plasticity, without requiring genetic differences among populations. Adult sea kraits ( Laticauda saintgironsi ) are highly philopatric to small islands, but the entire population within the Neo-Caledonian Lagoon is genetically homogeneous because females migrate to the mainland to lay their eggs at communal sites; recruits disperse before settling, mixing up alleles. Consequently, any matching between local environments (e.g. prey sizes) and snake phenotypes (e.g. body sizes and relative jaw sizes (RJSs)) must be achieved via phenotypic plasticity rather than spatial heterogeneity in gene frequencies. We sampled 13 snake colonies spread along an approximately 200 km northwest–southeast gradient ( n > 4500 individuals) to measure two morphological features that affect maximum ingestible prey size in gape-limited predators: body size and RJS. As proxies of habitat quality (HQ), we used protection status, fishing pressure and lagoon characteristics (lagoon width and distance of islands to the barrier reef). In both sexes, spatial variation in body sizes and RJSs was linked to HQ; albeit in different ways, consistent with sex-based divergences in foraging ecology. Strong spatial divergence in morphology among snake colonies, despite genetic homogeneity, supports the idea that phenotypic plasticity can facilitate speciation by creating multiple phenotypically distinct subpopulations shaped by their environment.

APA, Harvard, Vancouver, ISO, and other styles

38

Chiba, Shuya, and Yuji Nakano. "Remarks on upper and lower bounds formatching sequencibility of graphs." Filomat 30, no. 8 (2016): 2091–99. http://dx.doi.org/10.2298/fil1608091c.

Full text

Abstract:

In 2008, Alspach [The Wonderful Walecki Construction, Bull. Inst. Combin. Appl. 52 (2008) 7-20] defined the matching sequencibility of a graph G to be the largest integer k such that there exists a linear ordering of its edges so that every k consecutive edges in the linear ordering form a matching of G, which is denoted by ms(G). In this paper, we show that every graph G of size q and maximum degree ? satisfies 1/2?q/?+1? ? ms(G) ? ?q?1/??1? by using the edge-coloring of G, and we also improve this lower bound for some particular graphs. We further discuss the relationship between the matching sequencibility and a conjecture of Seymour about the existence of the kth power of a Hamilton cycle.

APA, Harvard, Vancouver, ISO, and other styles

39

Ma, Chao, Hongjiang Wu, Xudong Lu, and Haitao Sun. "Research and Design of X-band Low Noise Amplifier Based on CMOS Process." Journal of Physics: Conference Series 2108, no. 1 (November 1, 2021): 012102. http://dx.doi.org/10.1088/1742-6596/2108/1/012102.

Full text

Abstract:

Abstract Based on CMOS process, a low noise amplifier(LNA) operating at 7.4GHz~11.4GHz was designed. The two-stage differential cascode structure is adopted. Transformer was used to achieve inter-stage matching. Balun was used to achieve input and output matching, which reduces the number of inductors used, effectively reduces the chip size while ensuring good gain and noise figure. The actual measurement results show that the power gain at the center frequency of 9.4GHz is 27dB, the maximum noise figure is less than 3.82dB, the output power 1dB compression point is greater than 8dBm, the chip area is only 0.41mm×0.83mm(excluding PAD).

APA, Harvard, Vancouver, ISO, and other styles

40

Zhou, M., L. S. Chen, J. H. Wang, G. E. Teng, C. R. Li, Q. Q. Yao, and J. Y. Chen. "ANALYSIS OF INFLUENCING FACTORS OF CURVE MATCHING BASED GEOMETRIC CALIBRATION FOR ZY3-02 ALTIMETER DATA." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-2/W7 (September 16, 2019): 221–26. http://dx.doi.org/10.5194/isprs-annals-iv-2-w7-221-2019.

Full text

Abstract:

<p><strong>Abstract.</strong> High-precision on-orbit geometric calibration of spaceborne laser altimetry data is essential to its effective applications. Firstly, the existing calibration methods for laser altimeter data are analyzed. Then, a geometric calibration method based on curve matching is proposed. Compared to the existing methods, the proposed method does not rely on ground calibration field. Thus, it is efficiency in expense and time. Notably, three factors, i.e. matching method, initial control point selection and the step size of matching step, which significantly affect the results of calibration are analyzed respectively. The analysis was validated based on the original laser altimetry data obtained by ZY3-02 satellite. According to the results, the following conclusions can be drawn preliminarily: (1) Both the correlation coefficient maximum (COR) criterion and the mean square error minimum (MSD) criterion in the curve matching can be used to correct the systematic error in altimetry data. (2) The initial control points of the selected track should have a significant change trend and the slope within the laser footprints should be less than 15&deg;. (3) Current experimental data show that the best step size for matching search is 10&thinsp;m. The relevant conclusions can provide reference for the research of geometrical calibration and data processing of the same type of laser altimetry satellite.</p>

APA, Harvard, Vancouver, ISO, and other styles

41

GAMARNIK, DAVID, TOMASZ NOWICKI, and GRZEGORZ ŚWIRSZCZ. "Invariant probability measures and dynamics of exponential linear type maps." Ergodic Theory and Dynamical Systems 28, no. 5 (October 2008): 1479–95. http://dx.doi.org/10.1017/s014338570700106x.

Full text

Abstract:

AbstractWe consider the problem of the asymptotic size of the random maximum-weight matching of a sparse random graph, which we translate into dynamics of the operator in the space of distribution functions. A tight condition for the uniqueness of the globally attracting fixed point is provided, which extends the result of Karp and Sipser [Maximum matchings in sparse random graphs. 22nd Ann. Symp. on Foundations of Computer Science (Nashville, TN, 28–30 October, 1981). IEEE, New York, 1981, pp. 364–375] from deterministic weight distributions (Dirac measures μ) to general ones. Given a probability measure μ which corresponds to the weight distribution of a link of a random graph, we form a positive linear operator Φμ (convolution) on distribution functions and then analyze a family of its exponents, with parameter λ, which corresponds to the connectivity of a sparse random graph. The operator 𝕋 relates the distribution F on the subtrees to the distribution 𝕋F on the node of the tree by 𝕋F=exp (−λΦμF). We prove that for every probability measure μ and every λ<e, there exists a unique globally attracting fixed point of the operator; the probability measure corresponding to this fixed point can then be used to compute the expected maximum-weight matching on a sparse random graph. This result is called the e-cutoff phenomenon. For deterministic distributions and λ>e, there is no fixed point attractor. We further establish that the uniqueness of the invariant measure of the underlying operator is not a monotone property of the average connectivity; this parallels similar non-monotonicity results in the statistical physics context.

APA, Harvard, Vancouver, ISO, and other styles

42

Arulmurugan, R., and N. Suthanthiravanitha. "Improved Fractional Order VSS Inc-Cond MPPT Algorithm for Photovoltaic Scheme." International Journal of Photoenergy 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/128327.

Full text

Abstract:

Nowadays a hot topic among the research community is the harnessing energy from the free sunlight which is abundant and pollution-free. The availability of cheap solar photovoltaic (PV) modules has to harvest solar energy with better efficiency. The nature of solar modules is nonlinear and therefore the proper impedance matching is essential. The proper impedance matching ensures the extraction of the maximum power from solar PV module. Maximum power point tracking (MPPT) algorithm is acting as a significant part in solar power generating system because it varies in the output power from a PV generating set for various climatic conditions. This paper suggested a new improved work for MPPT of PV energy system by using the optimized novel improved fractional order variable step size (FOVSS) incremental conductance (Inc-Cond) algorithm. The new proposed controller combines the merits of both improved fractional order (FO) and variable step size (VSS) Inc-Cond which is well suitable for design control and execution. The suggested controller results in attaining the desired transient reaction under changing operating points. MATLAB simulation effort shows MPPT controller and a DC to DC Luo converter feeding a battery load is achieved. The laboratory experimental results demonstrate that the new proposed MPPT controller in the photovoltaic generating system is valid.

APA, Harvard, Vancouver, ISO, and other styles

43

Sallow, Amira B., and Hawkar Kh Shaikha. "Optical Disc and Blood Vessel Segmentation in Retinal Fundus Images." Academic Journal of Nawroz University 8, no. 3 (August 31, 2019): 67. http://dx.doi.org/10.25007/ajnu.v8n3a398.

Full text

Abstract:

Segmentation of optical disk (OD) and blood vessel is one of the significant steps in automatic diabetic retinopathy (DR) detecting. In this paper, a new technique is presented for OD segmentation that depends on the histogram template matching algorithm and OD size. In addition, Kirsch method is used for Blood Vessel (BV) segmentation which is one of the popular methods in the edge detection and image processing technique. The template matching algorithm is used for finding the center of the OD. In this step, the histogram of each RGB (Red, Green, and Blue) planes are founded and then the cross-correlation is founded between the template and the original image, OD location is the point with maximum cross-correlation between them. The OD size varies according to the camera field of sight and the resolution of the original image. The rectangle size of OD is not the same for various databases, the estimated size for DRIVE, STARE, DIARTDB0, and DIARTDB1 are 80×80, 140×140, 190×190, and 190×190 respectively. After finding the OD center and rectangle size of OD, a binary mask is created with Region of Interest (ROI) for segmenting the OD. The DIARTDB0 is used to evaluate the proposed technique, the result is robust and vital with an accuracy of 96%.

APA, Harvard, Vancouver, ISO, and other styles

44

Hao, Shaohua, Hongwei Wang, Chao Zhong, Likun Wang, and Hao Zhang. "Research and Fabrication of High-Frequency Broadband and Omnidirectional Transmitting Transducer." Sensors 18, no. 7 (July 19, 2018): 2347. http://dx.doi.org/10.3390/s18072347.

Full text

Abstract:

A wide-band cylindrical transducer was developed by using the wide band of the composite material and the matched matching layer for multimode coupling. Firstly, the structure size of the transducer’s sensitive component was designed by using ANSYS simulation software. Secondly, the piezoelectric composite ring-shaped sensitive component was fabricated by the piezoelectric composite curved-surface forming process, and the matching layer was coated on the periphery of the ring-shaped piezoelectric composite material. Finally, it was encapsulated and the electrodes were drawn out to make a high-frequency broadband horizontal omnidirectional water acoustic transducer prototype. After testing, the working frequency range of the transducer was 230–380 kHz, and the maximum transmission voltage response was 168 dB in the water.

APA, Harvard, Vancouver, ISO, and other styles

45

Xiang, Zhong, Ding Zhou, Miao Qian, Miao Ma, Yang Liu, Zhenyu Wu, and Xudong Hu. "Repeat pattern segmentation of print fabric based on adaptive template matching." Journal of Engineered Fibers and Fabrics 15 (January 2020): 155892502097328. http://dx.doi.org/10.1177/1558925020973285.

Full text

Abstract:

Patterned fabrics are generally constructed from the periodic repetition of a primitive pattern unit. Repeat pattern segmentation of printed fabrics has a very significant impact on the pattern retrieval and pattern defect detection. In this paper, we propose a new approach for repeat pattern segmentation by employing the adaptive template matching method. In contrast to the traditional method for template matching, the proposed algorithm first selects an adaptive size template image in the repeat pattern image based on the size of the original image and its local maximum edge density. Then it uses the sum of absolute differences as the matching features to identify the matched regions in the original image, and the minimum envelope border of the primitive pattern, typically as a parallelogram, can be determined from the results of the four adjacent matched templates. Finally, image traversal base on the obtained parallelogram is implemented over the original image using minimum information loss theory to produce a well-segmented primitive pattern with a complete edge structure. The results from the experiments conducted using an extensive database of real fabric images show that the proposed algorithm has the advantage of rotation invariance and scaling invariance and will not be affected when the background or foreground color is changed.

APA, Harvard, Vancouver, ISO, and other styles

46

Choi, Hojong. "Pre-Matching Circuit for High-Frequency Ultrasound Transducers." Sensors 22, no. 22 (November 16, 2022): 8861. http://dx.doi.org/10.3390/s22228861.

Full text

Abstract:

High-frequency ultrasound transducers offer higher spatial resolution than low-frequency ultrasound transducers; however, their maximum sensitivity are lower. Matching circuits are commonly utilized to increase the amplitude of high-frequency ultrasound transducers because the size of the piezoelectric material decreases as the operating frequency of the transducer increases. Thus, it lowers the limit of the applied voltage to the piezoelectric materials. Additionally, the electrical impedances of ultrasound transducers generally differ at the resonant-, center-, and anti-resonant-frequencies. The currently developed most-matching circuits provide electrical matching at the center frequency ranges for ultrasound transmitters and transducers. In addition, matching circuits with transmitters are more difficult to use to control the echo signal quality of the transducers because it is harder to control the bandwidth and gain of an ultrasound transmitter working in high-voltage operation. Therefore, we provide a novel pre-matching circuit method to improve the amplitude and bandwidth of high-frequency ultrasound transducers at the resonant-, center-, and anti-resonant-frequency ranges, with an ultrasound receiver and transducer. To verify the pre-matching circuit, pulse-echo response tests were conducted on the ultrasound transducers. The results show that the designed pre-matching circuits provide higher amplitude (5.63- and 2.02-times) and wider bandwidth (175.55% and 62.01%) for the high-frequency ultrasound transducer compared to the original circuit without a pre-matching circuit, and the parallel capacitor with a series-inductor circuit, respectively; therefore, the proposed pre-matching circuit is an appropriate solution for improving the amplitudes and bandwidths of high-frequency ultrasound transducers over wide frequency ranges.

APA, Harvard, Vancouver, ISO, and other styles

47

Fauzi, Rizky Rezha, Djoko Sulistyanto, and Ghanima Yasmaniar. "Optimization of MBR Field Integrated Production Model." PETRO:Jurnal Ilmiah Teknik Perminyakan 9, no. 1 (May 1, 2020): 45. http://dx.doi.org/10.25105/petro.v9i1.6514.

Full text

Abstract:

<p>MBR Field is an onshore field located at East Kalimantan. In this field, there are five clusters with 2 main stations and 1 supporting station. With the current pipe flow conditions, this field has several constraints which are ESP maximum motor loads, ESP maximum frequencies, and current maximum water injection plant capacity. First, modeling is done with deviations of less than 10 percent to reach matching conditions in several parameters such as upstream pressure, downstream pressure, liquid rate, water rate, oil rate, and gas rate. Afterward, the first optimization is done by increasing the ESP frequency, increasing choke bean size, and shutting-in relatively low oil production wells with high water cut. But due to the water production is almost exceeding the water injection plant capacity, then the second optimization is done. The second optimization is done by increasing choke bean size and shutting-in relatively low oil production wells with high water cut. Each optimization is then followed by an analysis of pressure and flowrates alterations and the existence of backpressure in unoptimized wells.</p>

APA, Harvard, Vancouver, ISO, and other styles

48

Hosono, Kiyoshi. "On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane." Discrete Applied Mathematics 113, no. 2-3 (October 2001): 291–98. http://dx.doi.org/10.1016/s0166-218x(01)00202-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Xiang, Changyuan, Yongxin Lan, Qinghua Yan, and Changqing Xu. "The Outer-Planar Anti-Ramsey Number of Matchings." Symmetry 14, no. 6 (June 16, 2022): 1252. http://dx.doi.org/10.3390/sym14061252.

Full text

Abstract:

A subgraph H of an edge-colored graph G is called rainbow if all of its edges have different colors. Let ar(G,H) denote the maximum positive integer t, such that there is a t-edge-colored graph G without any rainbow subgraph H. We denote by kK2 a matching of size k and On the class of all maximal outer-planar graphs on n vertices, respectively. The outer-planar anti-Ramsey number of graph H, denoted by ar(On,H), is defined as max{ar(On,H)|On∈On}. It seems nontrivial to determine the exact values for ar(On,H) because most maximal outer-planar graphs are asymmetry. In this paper, we obtain that ar(On,kK2)≤n+3k−8 for all n≥2k and k≥6, which improves the existing upper bound for ar(On,kK2), and prove that ar(On,kK2)=n+2k−5 for n=2k and k≥5. We also obtain that ar(On,6K2)=n+6 for all n≥29.

APA, Harvard, Vancouver, ISO, and other styles

50

Bernstein, Derek T., Craig A. O’Neill, Ryan S. Kim, Hugh L. Jones, Philip C. Noble, Joshua D. Harris, and Patrick C. McCulloch. "Osteochondral Allograft Donor-Host Matching by the Femoral Condyle Radius of Curvature." American Journal of Sports Medicine 45, no. 2 (October 29, 2016): 403–9. http://dx.doi.org/10.1177/0363546516671519.

Full text

Abstract:

Background: Conventional osteochondral allograft (OCA) matching, requiring orthotopic, size-matched condyles, and narrow surgical time windows often prohibit timely transplantation. Hypothesis: The femoral condyle radius of curvature (RoC) is an appropriate, isolated criterion for donor-host matching in fresh OCAs, potentially enhancing matching efficiency when compared with conventional matching techniques. Study Design: Descriptive laboratory study. Methods: In part 1 of this study, 3-dimensional digital reconstructions of 14 randomly selected, cadaveric distal femoral hemicondyles were performed. Each condyle was divided into anterior, middle, and posterior zones. A virtual best-fit grid was applied to each, and each zone’s sagittal- and coronal-plane RoCs were determined. Seven nonorthotopic OCA transplantations were performed based on RoC matching with 1-mm tolerance, and the preoperative and postoperative surface geometry were quantified to assess the accuracy of articular surface restoration. Of note, each donor-host pair did not match by the conventional method. In part 2 of this study, 12 cadaveric distal femora were categorized by size and digitized in the aforementioned manner. Simulated circular defects measuring 20, 25, and 30 mm in diameter were introduced into each zone. OCA matches were determined based on donor and host RoCs, and the total number of potential matches (of 71 total comparisons) was recorded as a percentage for each simulated defect. Finally, the results of RoC matching were compared with the conventional method for simulated defects in all zones of both the medial and lateral femoral condyles. Results: Part 1: The mean surface deviation after OCA transplantation was −0.09 mm, with a mean maximum protrusion at any point of 0.59 mm. Part 2: Using the RoC, 20-mm defects had a 100% chance of being matched. Defects of 25 and 30 mm had a 91% and 64% chance of being matched, respectively. Compared with the conventional method, the RoC method yielded a 3.2-fold greater match rate for lesions of the medial and lateral femoral condyles ( P = .02). Conclusion: This investigation shows that femoral condyle RoCs in the sagittal and coronal planes may be useful, alternative matching criteria, expanding on current standards. Clinical Relevance: These matching criteria may increase the number of available matches, reduce wait times for patients, and reduce the number of wasted grafts.

APA, Harvard, Vancouver, ISO, and other styles

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!