Two-stage Matching and Pricing with Applications to Ride Hailing

2020 ◽  
Author(s):  
Yiding Feng ◽  
Rad Niazadeh ◽  
Amin Saberi
Keyword(s):  
Two Stage ◽  
Stage Matching

Characterization of Glycosphingolipids and Their Diverse Lipid Forms through Two-Stage Matching of LC-MS/MS Spectra

2021 ◽  
Vol 93 (6) ◽  
pp. 3154-3162
Author(s):  
Laura S. Bailey ◽  
Fanran Huang ◽  
Tianqi Gao ◽  
Jinying Zhao ◽  
Kari B. Basso ◽  
...  
Keyword(s):  
Two Stage ◽  
Stage Matching

scholarly journals Fingerprinting Acoustic Localization Indoor Based on Cluster Analysis and Iterative Interpolation

2018 ◽  
Vol 8 (10) ◽  
pp. 1862 ◽  
Author(s):  
Shuopeng Wang ◽  
Peng Yang ◽  
Hao Sun
Keyword(s):  
Cluster Analysis ◽  
Interpolation Method ◽  
Reference Points ◽  
Matching Method ◽  
Two Stage ◽  
Positioning Accuracy ◽  
Acoustic Localization ◽  
Database Construction ◽  
Iterative Interpolation ◽  
Stage Matching

Fingerprinting acoustic localization usually requires tremendous time and effort for database construction in sampling phase and reference points (RPs) matching in positioning phase. To improve the efficiency of this acoustic localization process, an iterative interpolation method is proposed to reduce the initial RPs needed for the required positioning accuracy by generating virtual RPs in positioning phase. Meanwhile, a two-stage matching method based on cluster analysis is proposed for computation reduction of RPs matching. Results reported show that, on the premise of ensuring positioning accuracy, two-stage matching method based on feature clustering partition can reduce the average RPs matching amount to 30.14% of the global linear matching method taken. Meanwhile, the iterative interpolation method can guarantee the positioning accuracy with only 27.77% initial RPs of the traditional method needed.

scholarly journals Robust palmprint identification using efficient enhancement and two-stage matching technique

2020 ◽  
Vol 14 (11) ◽  
pp. 2333-2342
Author(s):  
Mubeen Ghafoor ◽  
Syed Ali Tariq ◽  
Imtiaz A. Taj ◽  
Noman M. Jafri ◽  
Tehseen Zia
Keyword(s):  
Two Stage ◽  
Palmprint Identification ◽  
Matching Technique ◽  
Stage Matching

Probabilistic analysis of two stage matching

1989 ◽  
Vol 22 (3) ◽  
pp. 331-343 ◽  
Author(s):  
Ramesh Sitaraman ◽  
Azriel Rosenfeld
Keyword(s):  
Probabilistic Analysis ◽  
Two Stage ◽  
Stage Matching

scholarly journals Bandwidth Analysis of a Broadband Amplifier with Two-Stage Matching System Using the Smith Chart

2021 ◽  
Vol 24 (3) ◽  
pp. 53-60
Author(s):  
A.A. Sherstneva
Keyword(s):  
Noise Figure ◽  
Impedance Matching ◽  
Low Noise ◽  
Low Noise Amplifiers ◽  
Matching Problem ◽  
Two Stage ◽  
Analysis And Design ◽  
Design Variables ◽  
Stage Matching ◽  
Smith Chart

This paper describes a novel trace structure for the analysis and design of two-stage Broadband Frequency Low Noise Amplifiers based on standard Smith chart procedures and program algorithm realization. The method allows to put the transistor's S-parameters and details of the source and load networks and to interactively explore the effects of these quantities on design variables such as gain, noise figure and stability. It also facilitates the design of two-element matching networks to transform the source and load impedances to optimum values to achieve the desired gain and noise performance. The extended Smith chart concept is proposed to enable the advanced graphical interpretation of devices containing complex properties. This methodology is based on the Smith chart concept, and makes it easy to deal with devices containing signal sources, nonlinearity, very high Q factors and negative resistances. The concept of explaining the use of the Smith chart in combination with using modern tools as MATLAB scripts is exemplified in graphical forms. Phyton-based program contains the algorithm for parameters calculation. It explains the procedure that must be used to solve the two-stage impedance-matching problem. The point of this proposal is using of Smith chart plane for the graphical processing for its application to oscillator analysis. To demonstrate the effective usage of this methodology an interpretation and analysis of the oscillator, especially in terms of gain, noise and stability, are provided. The practical relevance concludes results of multistage design using impedance matching LC networks for the intersection level. The values of the parameters of the integrated microcircuit confirm the possibility of using the calculation methodology considered in the paper. The proposed solution is validated with extensive RF measurements at 3.5 GHz and is benchmarked against several frequency ranges for noise, stability and gain values. The methodology shown in the paper can be used in the development and design of modern microwave amplifiers, as well as for research and analysis of the efficiency of existing devices.

RECOGNITION OF PARTIAL PLANAR SHAPES IN LIMITED MEMORY ENVIRONMENTS

1990 ◽  
Vol 04 (04) ◽  
pp. 603-628 ◽  
Author(s):  
SANTANU CHAUDHURY ◽  
S. SUBRAMANIAN ◽  
GUTURU PARTHASARATHY
Keyword(s):  
Heuristic Search ◽  
Recognition Algorithm ◽  
Two Stage ◽  
Second Stage ◽  
Limited Memory ◽  
Occluded Objects ◽  
Planar Shapes ◽  
Problem Instances ◽  
Stage Matching ◽  
Partially Occluded

Industrial vision systems should be capable of recognising noisy objects, partially occluded objects and randomly located and/or oriented objects. This paper considers the problem of recognition of partially occluded planar shapes using contour segment-based features. None of the techniques suggested in the literature for solving the above problem guarantee reliable results for problem instances which require memory in excess of what is available. In this paper, a heuristic search-based recognition algorithm is presented, which guarantees reliable recognition results even when memory is limited. This algorithm identifies an object, the maximum portion of whose contour is visible in a conglomerate of objects. For increasing efficiency of the method, a two-stage recognition scheme has been designed. In the first phase, a relevant subset of the known model shapes is chosen and in the second stage, matching between the unknown shape and elements of the relevant subset is attempted using the above approach. The technique is general in the sense that it can be used with any kind of contour features. To evaluate the efficiency of the method, experimentation was carried out using polygonal approximations of the object contours. Results are cited for establishing the effectiveness of the approach.

Sign in / Sign up

Export Citation Format

Share Document