Log in

Relevant bibliographies by topics / Maximum Size Matching / Journal articles

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

Journal articles on the topic 'Maximum Size Matching'

Author: Grafiati

Published: 6 September 2023

Last updated: 31 July 2025

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 (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

Cannas, Massimo, and Emiliano Sironi. "Optimal Matching with Matching Priority." Analytics 3, no. 1 (2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.

Full text

Abstract:

Matching algorithms are commonly used to build comparable subsets (matchings) in observational studies. When a complete matching is not possible, some units must necessarily be excluded from the final matching. This may bias the final estimates comparing the two populations, and thus it is important to reduce the number of drops to avoid unsatisfactory results. Greedy matching algorithms may not reach the maximum matching size, thus dropping more units than necessary. Optimal matching algorithms do ensure a maximum matching size, but they implicitly assume that all units have the same matching

APA, Harvard, Vancouver, ISO, and other styles

4

Erdős, Péter L., Shubha R. Kharel, Tamás Róbert Mezei, and Zoltán Toroczkai. "New Results on Graph Matching from Degree-Preserving Growth." Mathematics 12, no. 22 (2024): 3518. http://dx.doi.org/10.3390/math12223518.

Full text

Abstract:

The recently introduced model in S. R. Kharel et al.’s study [Degree-preserving network growth. Nature Physics 2022, 18, 100–106] uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The process depends both on the size of the largest available matching, which is the focus of this paper, as well as on the actual choice of the matching. Here, we first show that the question of whether a graphic degree sequence, extended with a new degree 2δ, remains graphic is equivalent to the existence of a realization of the original degree seq

APA, Harvard, Vancouver, ISO, and other styles

5

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 (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 co

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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 (2003): 327–46. http://dx.doi.org/10.1007/s00453-003-1035-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

10

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 (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\

APA, Harvard, Vancouver, ISO, and other styles

11

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 tit

APA, Harvard, Vancouver, ISO, and other styles

12

Zhang, H., S. Liu, Z. Ye, et al. "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

APA, Harvard, Vancouver, ISO, and other styles

13

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

BABENKO, MAXIM, ALEXEY GUSAKOV, and ILYA RAZENSHTEYN. "TRIANGLE-FREE 2-MATCHINGS REVISITED." Discrete Mathematics, Algorithms and Applications 02, no. 04 (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

APA, Harvard, Vancouver, ISO, and other styles

15

Sharma, Isha, and Jagjeet Jakhar. "Restricted size Ramsey numbers and restricted size Ramsey minimal graphs for matching versus wheel upto order six." Journal of Interdisciplinary Mathematics 27, no. 2 (2024): 171–80. http://dx.doi.org/10.47974/jim-1807.

Full text

Abstract:

The notion of the restricted size Ramsey number arises from the amalgamation of the theory of Ramsey numbers and the size Ramsey number for graphs. The concept of the (restricted) size Ramsey number of small graphs was first introduced by Harary and Miller in 1983. They derived specific values for certain pairs of small graphs, each having a maximum count of four vertices. In that same year, R. J. Faudree and J. Sheehan furthered the research and expanded the findings to encompass all the pairs of small graphs with a maximum order of four. The restricted size Ramsey number and size Ramsey numb

APA, Harvard, Vancouver, ISO, and other styles

16

Das, Shibsankar. "An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs." Scientific Annals of Computer Science XXX, no. 1 (2020): 25–37. https://doi.org/10.7561/SACS.2020.1.25.

Full text

Abstract:

The problem of computing a maximum weight matching in a bipartite graph is one of the fundamental algorithmic problems that has played an important role in the development of combinatorial optimization and algorithmics. Let G<sub>w,σ</sub> is a collection of all weighted bipartite graphs, each having σ and w as the size of each of the non-empty subset of the vertex partition and the total weight of the graph, respectively. We give a tight lower bound [(w-σ)/σ] + 1 for the set {Wt(mwm(G)) | G ∈G<sub>w,σ</sub> } which denotes the collection of weights

APA, Harvard, Vancouver, ISO, and other styles

17

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 (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

APA, Harvard, Vancouver, ISO, and other styles

18

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 (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 probabil

APA, Harvard, Vancouver, ISO, and other styles

19

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 (2007): 647–57. http://dx.doi.org/10.1007/s00373-007-0757-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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 (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 dire

APA, Harvard, Vancouver, ISO, and other styles

21

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 (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 bi

APA, Harvard, Vancouver, ISO, and other styles

22

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 (2012): 141–48. http://dx.doi.org/10.1017/s0963548311000496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

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 (2008): 461–68. http://dx.doi.org/10.1007/s00373-008-0807-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

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 (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

25

Feng, Yongde, Yanting Xie, Fengxia Liu, and Shoujun Xu. "The Extendability of Cayley Graphs Generated by Transposition Trees." Mathematics 10, no. 9 (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

26

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

27

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 (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

28

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 (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

29

Arezoomand, Majid, and Mohsen Ghasemi. "Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree 3." Contributions to Discrete Mathematics 15, no. 3 (2020): 75–87. http://dx.doi.org/10.55016/ojs/cdm.v15i3.62247.

Full text

Abstract:

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We prove that every connected intransitive one-matching semi-Cayley graph, with maximum degree three, over a finite abelian group is normal and characterize all such nonnormal graphs.

APA, Harvard, Vancouver, ISO, and other styles

30

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.

APA, Harvard, Vancouver, ISO, and other styles

31

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 (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 wit

APA, Harvard, Vancouver, ISO, and other styles

32

Martin, Ryan R., and Balázs Patkós. "A Note on the Erdős Matching Conjecture." Studia Scientiarum Mathematicarum Hungarica 62, no. 1 (2025): 63–69. https://doi.org/10.1556/012.2025.04330.

Full text

Abstract:

The Erdős Matching Conjecture states that the maximum size 𝑓 (𝑛, 𝑘, 𝑠) of a family that does not contain 𝑠 pairwise disjoint sets is max. , where and . The case 𝑠 = 2 is simply the Erdős-Ko-Rado theorem on intersecting families and is well understood. The case 𝑛 = 𝑠𝑘 was settled by Kleitman and the uniqueness of the extremal construction was obtained by Frankl. Most results in this area show that if 𝑘, 𝑠 are fixed and 𝑛 is large enough, then the conjecture holds true. Exceptions are due to Frankl who proved the conjecture and considered variants for 𝑛 ∈ [𝑠𝑘, 𝑠𝑘 + 𝑐𝑠,𝑘 ] if 𝑠 is large enough co

APA, Harvard, Vancouver, ISO, and other styles

33

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 (2023): 113342. http://dx.doi.org/10.1016/j.disc.2023.113342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Singh, Sukhjit, Dr V.K Jain, and Dr Amanpreet Singh. "A novel LSB steganographic method using partition and matching algorithms." International Journal of Engineering & Technology 7, no. 4 (2018): 7079–85. http://dx.doi.org/10.14419/ijet.v7i4.22273.

Full text

Abstract:

There is always a trade-off between embedding efficiency and hiding capacity of secret information. This paper presents a new ste-ganographic technique that improves the embedding efficiency and hiding capacity. For hiding information we extract LSB bits from 24-bit bmp color image. The LSB bits are joined to form an array of bits. An array is divided into N partitions depending upon the size of secret information to hide. The secret information is also divided into N partitions. Each data part finds the best possible matching location within each LSB array partition. The maximum bit matching

APA, Harvard, Vancouver, ISO, and other styles

35

Bahadır, Selim. "Graphs with Total Domination Number Double of the Matching Number." Journal of New Theory, no. 49 (December 31, 2024): 1–6. https://doi.org/10.53570/jnt.1520557.

Full text

Abstract:

A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$. The total domination number $\gamma_t(G)$ of a graph $G$ is the minimum value of the size of a total dominating set of $G$. A subset $M$ of the edges of a graph $G$ is called a matching if no two edges of $M$ have a common vertex. The matching number $\nu (G)$ of a graph $G$ is the maximum value of the size of a matching in $G$. It can be observed that $\gamma_t(G)\leq 2\nu(G)$ holds for every graph $G$ with no isolated vertex.

APA, Harvard, Vancouver, ISO, and other styles

36

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 (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 mat

APA, Harvard, Vancouver, ISO, and other styles

37

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 (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

38

AKUTSU, TATSUYA. "ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES." International Journal of Foundations of Computer Science 17, no. 04 (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

39

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 po

APA, Harvard, Vancouver, ISO, and other styles

40

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.

APA, Harvard, Vancouver, ISO, and other styles

41

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

APA, Harvard, Vancouver, ISO, and other styles

42

Wang, Dayong, Jiahao Meng, Jie Zhao, et al. "Full-Aperture Reflective Remote Fourier Ptychography with Sample Matching." Remote Sensing 16, no. 22 (2024): 4276. http://dx.doi.org/10.3390/rs16224276.

Full text

Abstract:

Fourier ptychography (FP) can break through the limitations of existing optical systems with a single aperture and realize large field-of-view (FOV) and high-resolution (HR) imaging simultaneously by aperture synthesis in the frequency domain. The method has potential applications for remote sensing and space-based imaging. However, the aperture stop of the imaging system was generally set to be much smaller than the system with an adjustable diaphragm, so it failed to make full use of the imaging capability of the system. In this paper, a reflective remote FP with full aperture is proposed, a

APA, Harvard, Vancouver, ISO, and other styles

43

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 (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, batch

APA, Harvard, Vancouver, ISO, and other styles

44

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 (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 loca

APA, Harvard, Vancouver, ISO, and other styles

45

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 matchin

APA, Harvard, Vancouver, ISO, and other styles

46

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 (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, wh

APA, Harvard, Vancouver, ISO, and other styles

47

Kim, Jihoon, Seoungyoon Han, Bo-Bae Kim, Mun-Kyo Lee, and Bok-Hyung Lee. "Millimeter-Wave GaN High-Power Amplifier MMIC Design Guideline Considering a Source via Effect." Electronics 13, no. 13 (2024): 2616. http://dx.doi.org/10.3390/electronics13132616.

Full text

Abstract:

A millimeter-wave (mmWave) gallium nitride (GaN) high-power amplifier (HPA) monolithic microwave-integrated circuit (MMIC) was implemented, considering a source via effect. In this paper, we introduce guidelines for designing GaN HPA MMICs, from device sizing to meeting high-power specifications, power matching considering source via effects, schematic design of three-stage amplifier structures, and electromagnetic (EM) simulation. Based on the results of load pull simulation and small-signal maximum stable gain (MSG) simulation, the GaN high-electron-mobility transistor (HEMT) size was select

APA, Harvard, Vancouver, ISO, and other styles

48

Duppala, Sharmila, Nathaniel Grammel, Juan Luque, Calum MacRury, and Aravind Srinivasan. "Proportionally Fair Matching via Randomized Rounding." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 16 (2025): 16435–43. https://doi.org/10.1609/aaai.v39i16.33805.

Full text

Abstract:

Given an edge-colored graph, the goal of the proportional fair matching problem is to find a maximum weight matching while ensuring proportional representation (with respect to the number of edges) of each color. The colors may correspond to demographic groups or other protected traits where we seek to ensure roughly equal representation from each group. It is known that, assuming ETH, it is impossible to approximate the problem with ℓ colors in time subexponential in ℓ even on unweighted path graphs. Further, even determining the existence of a non-empty matching satisfying proportionality is

APA, Harvard, Vancouver, ISO, and other styles

49

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 (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

APA, Harvard, Vancouver, ISO, and other styles

50

Zhou, M., L. S. Chen, J. H. Wang, et al. "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 significant

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!