Journal articles: 'Matching Schemes'

1

Hirano, Shinji. "Matching renormalization schemes in holography." Modern Physics Letters A 33, no. 24 (August 3, 2018): 1850138. http://dx.doi.org/10.1142/s0217732318501389.

Full text

Abstract:

In holography, there is a one-to-one correspondence between physical observables in the bulk and boundary theories. To define physical observables, however, regularization needs to be implemented in both sides of the correspondence. It is arguable whether the correspondence should extend to regularization and renormalization scheme which are not physical in the conventional sense. However, if we are to take the renormalization group (RG) interpretation of holography seriously, its precise understanding appears to require the matching of regularizations and renormalization schemes in the bulk and boundary theories. We address this question in the AdS5/CFT4 correspondence by considering the simplest physical quantity, the Casimir energy of the [Formula: see text] super Yang–Mills (SYM) theory on [Formula: see text], in a [Formula: see text]-function regularization and show that there are choices of scheme which match the bulk AdS result, including the radial cutoff-dependent corrections when the cutoff is kept finite. We further discuss the implication of this result to the RG interpretation of holography.

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Xiuguang, Yuanyuan He, Ben Niu, Kai Yang, and Hui Li. "An Exact and Efficient Privacy-Preserving Spatiotemporal Matching in Mobile Social Networks." International Journal of Technology and Human Interaction 12, no. 2 (April 2016): 36–47. http://dx.doi.org/10.4018/ijthi.2016040103.

Full text

Abstract:

With the rapid development of mobile smartphone and its built-in location-aware devices, people are possible to establish trust relationships and further interaction with each other based their matched interests, hobbies, experiences, or spatiotemporal profiles. However, the possibility of sensitive information leakage and heavy computation overhead constrain the widespread use of the matching schemes in mobile social networks. Many privacy-preserving matching schemes were proposed recently years, but how to achieve privacy-preserving spatiotemporal matching exactly and efficiently remains an open question. In this paper, the authors propose a novel spatiotemporal matching scheme. The overlapping grid system is introduced into the scheme to improve the accuracy of spatiotemporal matching, and many repetitive records in a user's spatiotemporal profile are counted as one item so as to cut down the computation overhead. Their scheme decreases the spatiotemporal matching error, and promotes the efficiency of private matchmaking simultaneously. Thorough security analysis and evaluation results indicate that our scheme is effective and efficient.

APA, Harvard, Vancouver, ISO, and other styles

3

Ameer, Salah. "Histogram Matching Schemes for Image Thresholding." American Journal of Engineering and Applied Sciences 12, no. 3 (March 1, 2019): 413–19. http://dx.doi.org/10.3844/ajeassp.2019.413.419.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pang, Xue Liang, and Run Xiang Jang. "Study on Method of Key Target Tracking Parameter Matching." Advanced Materials Research 591-593 (November 2012): 2636–41. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.2636.

Full text

Abstract:

This paper addresses the issue of how to get the optimal tracking parameter matching scheme. At first it establishes the comprehensive evaluation system of target tracking parameter matching scheme which includes four indexes such as capturing probability, getting probability and so on. Then based on the AHP it brings forward the evaluation method based on multi-index decision making to realize the optimized scheme evaluation. Because of the number and level of the parameters, there are numerous parameter matching schemes. So it utilized Uniform Design to optimize simulation experiment number and calculated optimized parameters matching scheme by generalized regression equation. At last, the design examples present the validity and practicability of this method on solving the problems of key target tracking parameter matching scheme.

APA, Harvard, Vancouver, ISO, and other styles

5

Son, J., H. Kim, and T. Kim. "COMPARISON OF GEOMETRIC CORRECTION SCHEMES FOR GEOSTATIONARY OCEAN COLOR IMAGER SLOTS WITHOUT GCPS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4 (September 19, 2018): 587–90. http://dx.doi.org/10.5194/isprs-archives-xlii-4-587-2018.

Full text

Abstract:

Abstract. Currently, the geometric correction process of GOCI (Geostationary Ocean Color Imager) image is performed by matching slot images against shorelines and utilizing the matching results as GCPs (Ground Control Point). However, there are several GOCI slots without shorelines and for such slots acquiring GCPs is not easy. The purpose of this paper is to compare several alternative geometric correction schemes applicable to the slots without GCPs. We analyzed three schemes. The first scheme is to apply the correction angle of the same slot in the most recent dataset. The second scheme is to apply correction angle of the previous slot in the current dataset. And the last scheme is to apply correction angle of the slot with the largest number of GCPs in the same time dataset. Overall process for comparing the quality of the three geometric correction schemes consisted of the following steps. Firstly, using ephemeris metadata of GOCI Level 1A, we established initial sensor model, which defines geometry relationship between ground coordinate system and image coordinate system of a GOCI image. And then, by matching edge detected from GOCI slot images and shoreline landmark chips, we obtained GCPs. Using these GCPs, we calculated correction angle of each slot. After then, through the three schemes, we conducted precision sensor modeling. Among three schemes, geometric correction applying the previous slot correction angle showed the best quality. The average RMSE of this scheme was about 1.4km, which was quite close to geometric correction quality applying correction angles from GCPs.

APA, Harvard, Vancouver, ISO, and other styles

6

JONARD, NICOLAS. "ON THE SURVIVAL OF COOPERATION UNDER DIFFERENT MATCHING SCHEMES." International Game Theory Review 04, no. 04 (December 2002): 459–73. http://dx.doi.org/10.1142/s0219198902000811.

Full text

Abstract:

In this note, the persistence of cooperation in the standard Prisoner's Dilemma is examined under five distinct matching mechanisms. The general model is a birth-and-death process, which is studied using a simple direct method and the mutation-counting technique. Mean matching is discussed first, before two variants of random matching and viscosity are analyzed. Finally payoff assortative matching is considered. In all five cases the stochastic stability of the absorbing sets of the evolutionary process is examined; assortative matching is shown to sustain significant amounts of cooperation.

APA, Harvard, Vancouver, ISO, and other styles

7

JOSHI, BANSIDHAR, and MANISH K. THAKUR. "Stable Matching based Virtual Channels Allocation Scheme in Network-on-Chip." Journal of Interconnection Networks 20, no. 02 (June 2020): 2050008. http://dx.doi.org/10.1142/s0219265920500085.

Full text

Abstract:

While designing router micro-architecture of an On-Chip network, a good allocation of virtual channels (VCs) governs an effective resources utilization which essentially results in an optimized number of packets received at destination(s). Generally, the VC allocation schemes deal with the one-way approach of VC allocation to the contending flits. However, this approach produces non-optimal matching of flits to the available VCs on next routers, and therefore leads to the under-utilization of these VCs. This paper proposes a 2-Way VC Allocation scheme to map input VCs (requestors) to output VCs (resources). The proposed scheme is compared with the conventional VC allocation scheme under two different mesh configurations with a 100% channel load. Simulations performed under two different routing schemes in diverse traffic scenarios demonstrate an increase in the number of packets received at destinations by up to 76%. Also, the network’s latency exhibits trade-off with total power consumption while reducing hotspots.

APA, Harvard, Vancouver, ISO, and other styles

8

Jung, Chanju, Yong-Hyuk Kim, Yourim Yoon, and Byung-Ro Moon. "A New Adaptive Hungarian Mating Scheme in Genetic Algorithms." Discrete Dynamics in Nature and Society 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/3512546.

Full text

Abstract:

In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of mating distances, minimizing the sum, and random matching. We propose an algorithm to elect one of these Hungarian mating schemes. Every mated pair of solutions has to vote for the next generation mating scheme. The distance between parents and the distance between parent and offspring are considered when they vote. Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. Our adaptive strategy showed better results than not only pure and previous hybrid schemes but also existing distance-based mating schemes.

APA, Harvard, Vancouver, ISO, and other styles

9

Nettleton, David F., and Julian Salas. "Approximate Matching of Neighborhood Subgraphs — An Ordered String Graph Levenshtein Method." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 24, no. 03 (June 2016): 411–31. http://dx.doi.org/10.1142/s0218488516500215.

Full text

Abstract:

Given that exact pair-wise graph matching has a high computational cost, different representational schemes and matching methods have been devised in order to make matching more efficient. Such methods include representing the graphs as tree structures, transforming the structures into strings and then calculating the edit distance between those strings. However many coding schemes are complex and are computationally expensive. In this paper, we present a novel coding scheme for unlabeled graphs and perform some empirical experiments to evaluate its precision and cost for the matching of neighborhood subgraphs in online social networks. We call our method OSG-L (Ordered String Graph-Levenshtein). Some key advantages of the pre-processing phase are its simplicity, compactness and lower execution time. Furthermore, our method is able to match both non-isomorphisms (near matches) and isomorphisms (exact matches), also taking into account the degrees of the neighbors, which is adequate for social network graphs.

APA, Harvard, Vancouver, ISO, and other styles

10

Komano, Yuichi, Kazuo Ohta, Kazuo Sakiyama, Mitsugu Iwamoto, and Ingrid Verbauwhede. "Single-Round Pattern Matching Key Generation Using Physically Unclonable Function." Security and Communication Networks 2019 (January 1, 2019): 1–13. http://dx.doi.org/10.1155/2019/1719585.

Full text

Abstract:

Paral and Devadas introduced a simple key generation scheme with a physically unclonable function (PUF) that requires no error correction, e.g., by using a fuzzy extractor. Their scheme, called a pattern matching key generation (PMKG) scheme, is based on pattern matching between auxiliary data, assigned at the enrollment in advance, and a substring of PUF output, to reconstruct a key. The PMKG scheme repeats a round operation, including the pattern matching, to derive a key with high entropy. Later, to enhance the efficiency and security, a circular PMKG (C-PMKG) scheme was proposed. However, multiple round operations in these schemes make them impractical. In this paper, we propose a single-round circular PMKG (SC-PMKG) scheme. Unlike the previous schemes, our scheme invokes the PUF only once. Hence, there is no fear of information leakage by invoking the PUF with the (partially) same input multiple times in different rounds, and, therefore, the security consideration can be simplified. Moreover, we introduce another hash function to generate a check string which ensures the correctness of the key reconstruction. The string enables us not only to defeat manipulation attacks but also to prove the security theoretically. In addition to its simple construction, the SC-PMKG scheme can use a weak PUF like the SRAM-PUF as a building block if our system is properly implemented so that the PUF is directly inaccessible from the outside, and, therefore, it is suitable for tiny devices in the IoT systems. We discuss its security and show its feasibility by simulations and experiments.

APA, Harvard, Vancouver, ISO, and other styles

11

Zheng, Ya Lin. "Similarity Knowledge Mass and Multiple Multidimensional Approximate Reasoning." Applied Mechanics and Materials 333-335 (July 2013): 1392–96. http://dx.doi.org/10.4028/www.scientific.net/amm.333-335.1392.

Full text

Abstract:

Designing the approximate reasoning matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R can reflect the nature of approximate reasoning and meet more application expectations. In this paper, we introduce the type V matching scheme and the corresponding type V Q-algorithm of multiple multidimensional approximate reasoning with given multidimensional input and multidimensional knowledge bases on strong Q-logic CQ.

APA, Harvard, Vancouver, ISO, and other styles

12

Liu, C., R. Talman, and G. Krafft. "Optics matching schemes for linac-based light source." Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 735 (January 2014): 512–20. http://dx.doi.org/10.1016/j.nima.2013.08.082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Schork, Nicholas J., Laura H. Goetz, James Lowey, and Jeffrey Trent. "Strategies for Testing Intervention Matching Schemes in Cancer." Clinical Pharmacology & Therapeutics 108, no. 3 (July 24, 2020): 542–52. http://dx.doi.org/10.1002/cpt.1947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Luan, Yu, Hong Zuo Li, and Ya Fei Wang. "Acoustic Features Selection of Speaker Verification Based on Average KL Distance." Applied Mechanics and Materials 373-375 (August 2013): 629–33. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.629.

Full text

Abstract:

This paper proposes a new Average Kullback-Leibler distance to make an optimal feature selection algorithm for the matching score fusion of speaker verification. The advantage of this novel distance is to overcome the shortcoming of the asymmetry of conventional Kullback-Leibler distance, which can ensure the accuracy and robustness of the computation of the information content between matching scores of two acoustic features. From the experimental results by a variety of fusion schemes, it is found that the matching score fusion between MFCC and residual phase gains most information content. It indicates this scheme can yield an excellent performance.

APA, Harvard, Vancouver, ISO, and other styles

15

Mennig, Philipp, and Johannes Sauer. "The impact of agri-environment schemes on farm productivity: a DID-matching approach." European Review of Agricultural Economics 47, no. 3 (March 29, 2019): 1045–93. http://dx.doi.org/10.1093/erae/jbz006.

Full text

Abstract:

Abstract According to WTO standards, agri-environmental schemes (AES) payments should distort neither trade nor production but instead only compensate for income forgone and costs incurred. At the same time, contract design shall give farmers enough flexibility to react to changing market and production conditions. We apply a difference-in-difference propensity score matching estimator to test if AES have an unintended effect on farm productivity. Our results suggest that schemes designed for arable land overcompensate farmers and thus do fail to comply with WTO rules. For dairy farms, we find that AES participation reduces farm productivity, implying that action-based scheme design not considering changing market and production situations might be too restrictive, potentially preventing farmers from participating.

APA, Harvard, Vancouver, ISO, and other styles

16

Son, Jong-Hwan, Han-Gyeol Kim, Hee-Jeong Han, and Taejung Kim. "Comparison of Various Frequency Matching Schemes for Geometric Correction of Geostationary Ocean Color Imager." Sensors 19, no. 24 (December 16, 2019): 5564. http://dx.doi.org/10.3390/s19245564.

Full text

Abstract:

Current precise geometric correction of Geostationary Ocean Color Imager (GOCI) image slots is performed by shoreline matching. However, it is troublesome to handle slots with few or no shorelines, or slots covered by clouds. Geometric correction by frequency matching has been proposed to handle these slots. In this paper, we further extend previous research on frequency matching by comparing the performance of three frequency domain matching methods: phase correlation, gradient correlation, and orientation correlation. We compared the performance of each matching technique in terms of match success rate and geometric accuracy. We concluded that the three frequency domain matching method with peak search range limits was comparable to geometric correction performance with shoreline matching. The proposed method handles translation only, and assumes that rotation has been corrected. We need to do further work on how to handle rotation by frequency matching.

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Kai, and Ali E. Yilmaz. "Comparison of precorrected FFT/adaptive integral method matching schemes." Microwave and Optical Technology Letters 53, no. 6 (March 25, 2011): 1368–72. http://dx.doi.org/10.1002/mop.26006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Demokan, O. "Critical analysis of matching schemes in capacitively coupled discharges." IEEE Transactions on Plasma Science 31, no. 5 (October 2003): 1100–1102. http://dx.doi.org/10.1109/tps.2003.815480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

SONG, LUJIE, HAIBO ZOU, ZHENYU JI, XIAOMING XIE, and WEI LI. "A NOVEL ITERATIVE MATCHING SCHEME BASED ON HOMOGRAPHY METHOD FOR X-RAY IMAGE." Journal of Mechanics in Medicine and Biology 20, no. 06 (August 2020): 2050038. http://dx.doi.org/10.1142/s0219519420500384.

Full text

Abstract:

Purpose anterior cervical decompression and fusion is a common surgical procedure. Traditionally, experienced doctors observe X-ray films regularly examined by patients to determine postoperative conditions by observing the tiny movements between the limited vertebral bodies. But it is not accurate. This may lead to error diagnostics and serious deterioration of the condition and secondary injury to the patient and will also put a greater financial burden on them. Doctors need a quantitative standard to determine small motion with limited vertebral landmarks after surgery. Computer vision technology is needed to match the over-extension and over-flexion cervical vertebral body to provide objective measurement data for further quantification of intervertebral activity. Based on conventional scheme, the point mean square error is used as the evaluation criterion of the matching effect, and the iterative matching scheme is proposed to improve the stability of the original scheme. The cervical X-ray films of patients from the China–Japan Friendship Hospital were collected as samples to verify the reliability of the scheme. Compared with the existing image matching schemes based on feature points, our scheme is superior in matching effect, matching speed and stability. This scheme can provide a solid foundation for further assisting doctors in the study of rehabilitation after anterior cervical fusion.

APA, Harvard, Vancouver, ISO, and other styles

20

Vashunina, Irina V., Alexander A. Nistratov, and Evgeny F. Tarasov. "Text Creolization as the Way to Change the Text Perception." Polylinguality and Transcultural Practices 16, no. 4 (December 15, 2019): 472–84. http://dx.doi.org/10.22363/2618-897x-2019-16-4-472-484.

Full text

Abstract:

The article presents the findings of the psycholinguistic experiments based on the semantic differential technique. The experiments’ objective was to identify the effect of illustration on a verbal text perception. We compared the respondents’ assessment of verbal texts and illustrated texts (with illustrations in major and minor color schemes). The data analysis reveals seven factors: Assessment , Naturalness , Strength , Imagery , Romanticism , Dynamism , Commonality . We identified the illustrations parameters affecting the assessment of creolized texts: adding any illustration, the illustration color scheme matching the verbal text content, the color scheme naturalness, the illustration color scheme matching the text emotional and semantic dominant, the use of minor color scheme. The most pragmatic potential was identified in the parameter “(non)matching the color scheme with the semantic dominant of the text” (it is important for the assessment of five out of seven factors). We found that both conformity ( Strength factor assessment) and inconsistency (for Dynamism , Imagery , Romance , Evaluation factors assessment) can be significant. The text creolization increases its Imagery and changes Romanticism factors. The color scheme matching the image content increases the text Naturalness assessment, and an unnatural color scheme decreases it. There was a decrease in Assessment if a minor color scheme was used.

APA, Harvard, Vancouver, ISO, and other styles

21

Lopes, Fabio. "Invariant Bipartite Random Graphs on Rd." Journal of Applied Probability 51, no. 03 (September 2014): 769–79. http://dx.doi.org/10.1017/s0021900200011669.

Full text

Abstract:

Suppose that red and blue points occur inRdaccording to two simple point processes with finite intensities λRand λB, respectively. Furthermore, let ν and μ be two probability distributions on the strictly positive integers with means ν̅ and μ̅, respectively. Assign independently a random number of stubs (half-edges) to each red (blue) point with law ν (μ). We are interested in translation-invariant schemes for matching stubs between points of different colors in order to obtain random bipartite graphs in which each point has a prescribed degree distribution with law ν or μ depending on its color. For a large class of point processes, we show that such translation-invariant schemes matching almost surely all stubs are possible if and only if λRν̅ = λBμ̅, including the case when ν̅ = μ̅ = ∞ so that both sides are infinite. Furthermore, we study a particular scheme based on the Gale-Shapley stable marriage problem. For this scheme, we give sufficient conditions on ν and μ for the presence and absence of infinite components. These results are two-color versions of those obtained by Deijfen, Holroyd and Häggström.

APA, Harvard, Vancouver, ISO, and other styles

22

Machizaud, Jacques, and Thierry Fournel. "Two-out-of-two color matching based visual cryptography schemes." Optics Express 20, no. 20 (September 20, 2012): 22847. http://dx.doi.org/10.1364/oe.20.022847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Lin, Chuan-bi, and Roberto Rojas-Cessa. "Module Matching Schemes for Input-Queued Clos-Network Packet Switches." IEEE Communications Letters 11, no. 2 (February 2007): 194–96. http://dx.doi.org/10.1109/lcomm.2007.061617.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Yang, Kai, and Ali E. Yilmaz. "Erratum: Comparison of precorrected FFT/adaptive integral method matching schemes." Microwave and Optical Technology Letters 53, no. 8 (May 17, 2011): 1943. http://dx.doi.org/10.1002/mop.26230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Rojas-Cessa, Roberto, and Chuan-Bi Lin. "Captured-frame matching schemes for scalable input-queued packet switches." Computer Communications 30, no. 10 (July 2007): 2149–61. http://dx.doi.org/10.1016/j.comcom.2007.04.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Chin, Siu A. "A unified derivation of finite-difference schemes from solution matching." Numerical Methods for Partial Differential Equations 32, no. 1 (June 24, 2015): 243–65. http://dx.doi.org/10.1002/num.21993.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Lopes, Fabio. "Invariant Bipartite Random Graphs on Rd." Journal of Applied Probability 51, no. 3 (September 2014): 769–79. http://dx.doi.org/10.1239/jap/1409932673.

Full text

Abstract:

Suppose that red and blue points occur in Rd according to two simple point processes with finite intensities λR and λB, respectively. Furthermore, let ν and μ be two probability distributions on the strictly positive integers with means ν̅ and μ̅, respectively. Assign independently a random number of stubs (half-edges) to each red (blue) point with law ν (μ). We are interested in translation-invariant schemes for matching stubs between points of different colors in order to obtain random bipartite graphs in which each point has a prescribed degree distribution with law ν or μ depending on its color. For a large class of point processes, we show that such translation-invariant schemes matching almost surely all stubs are possible if and only if λRν̅ = λBμ̅, including the case when ν̅ = μ̅ = ∞ so that both sides are infinite. Furthermore, we study a particular scheme based on the Gale-Shapley stable marriage problem. For this scheme, we give sufficient conditions on ν and μ for the presence and absence of infinite components. These results are two-color versions of those obtained by Deijfen, Holroyd and Häggström.

APA, Harvard, Vancouver, ISO, and other styles

28

Yi, Guodong, Huifang Zhou, Yang Wang, Jingli Wu, and Jundi Wu. "Scheme optimization for a turbine blade under multiple working conditions based on the entropy weight vague set." Mechanical Sciences 12, no. 1 (June 4, 2021): 615–24. http://dx.doi.org/10.5194/ms-12-615-2021.

Full text

Abstract:

Abstract. The deformation of blades under complex loads of multiple working conditions will reduce the energy conversion efficiency. To reduce the deviation of the blade shape in practical working conditions, a combination and optimization method of blade design schemes under multiple working conditions, based on the entropy weight vague sets, is proposed. The sensitivity of each working condition index is analyzed based on the information entropy, and the satisfaction degree of the design scheme based on the design requirements and experiences is described with the vague set. The matching degree of different design schemes for multiple working conditions is quantified according to the scoring function. The combination and optimization of the design scheme are verified by numerical simulation analysis. The results show that the proposed design scheme has a smaller blade shape deviation than the traditional design scheme under multiple working conditions.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Hui Shu, Da Min Zhuang, and Ding Ma. "Study of Assessment of Computer Aided Color Design." Advanced Materials Research 267 (June 2011): 39–45. http://dx.doi.org/10.4028/www.scientific.net/amr.267.39.

Full text

Abstract:

At present the capacity for computer aided color design both at home and abroad is relatively weak. The paper studies one aspect of it, that is, the objective assessment of computer aided color design. It takes color matching schemes of cockpit information display as an example to carry out the experiment of assessment.The experiment mainly deals with the assessment of the color matching schemes of the primary flight display. Four-dimensional assessment indicators are used to evaluate the quickness of information recognition for pilots, through which the order of excellence of the color matching schemes is achieved. Based on the findings of the experiment, the article proposes the generalized model framework for the assessment of CACD. The framework has four parts. Color design of human-computer interface of the prototype product; the application of computer software to the design of color schemes; Computer aided assessment on color design, including experiment design, the application of computer programming to carrying out the simulated experiment which is based on the prototype and the application of computer software to statistical analaysis of the data collected; Objective assessment on the color design schemes. This framework can give an objective description of the color design, which can be applied to various products. However, different products should design different experiments. This framework provides new references for the study in the field of the CACD.

APA, Harvard, Vancouver, ISO, and other styles

30

Chai, Tong-Yuen, Bok-Min Goi, and Wun-She Yap. "Towards Better Performance for Protected Iris Biometric System with Confidence Matrix." Symmetry 13, no. 5 (May 20, 2021): 910. http://dx.doi.org/10.3390/sym13050910.

Full text

Abstract:

Biometric template protection (BTP) schemes are implemented to increase public confidence in biometric systems regarding data privacy and security in recent years. The introduction of BTP has naturally incurred loss of information for security, which leads to performance degradation at the matching stage. Although efforts are shown in the extended work of some iris BTP schemes to improve their recognition performance, there is still a lack of a generalized solution for this problem. In this paper, a trainable approach that requires no further modification on the protected iris biometric templates has been proposed. This approach consists of two strategies to generate a confidence matrix to reduce the performance degradation of iris BTP schemes. The proposed binary confidence matrix showed better performance in noisy iris data, whereas the probability confidence matrix showed better performance in iris databases with better image quality. In addition, our proposed scheme has also taken into consideration the potential effects in recognition performance, which are caused by the database-associated noise masks and the variation in biometric data types produced by different iris BTP schemes. The proposed scheme has reported remarkable improvement in our experiments with various publicly available iris research databases being tested.

APA, Harvard, Vancouver, ISO, and other styles

31

Zang, Jie, De Sheng Zhang, Yuan Tao Sun, and Song Tao Lv. "Simulation and Matching for the Powertrain System of Saloons." Advanced Materials Research 510 (April 2012): 222–26. http://dx.doi.org/10.4028/www.scientific.net/amr.510.222.

Full text

Abstract:

Reasonable match of the powertrain system is an optimized design process, which makes the saloons fuel economy low and power performance good. This document simulates the complete vehicle performance model of a specified manual transmission FF saloon by means of CRUISE. Establish 4 kinds of simulation task, select 3 kinds of engine whose displacement are 1.3 liters, 1.1liters and 1.0liters, 4 kinds of transmission and 4 kinds of main decelerator, calculate the power performance and fuel economy of saloon with 48 different kinds of alternative schemes on transmission system by CRUISE and analyze all the simulation results. A synthetic weighting index evaluation system of complete vehicle performance is created, which contains the design of evaluation indices and weighting indices. Analyze the weighting indices to obtain 5 design schemes which are superior to others. It offers reference data for saloon performance.

APA, Harvard, Vancouver, ISO, and other styles

32

Emeterio, J. L. San, A. Ramos, P. T. Sanz, and A. Ruiz. "Evaluation of Impedance Matching Schemes for Pulse-Echo Ultrasonic Piezoelectric Transducers." Ferroelectrics 273, no. 1 (January 2002): 297–302. http://dx.doi.org/10.1080/713716348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Cox, Elaine. "For better, for worse: the matching process in formal mentoring schemes." Mentoring & Tutoring: Partnership in Learning 13, no. 3 (December 2005): 403–14. http://dx.doi.org/10.1080/13611260500177484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ali, Qasim, and Sergio Montenegro. "Decentralized Control for Scalable Quadcopter Formations." International Journal of Aerospace Engineering 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/9108983.

Full text

Abstract:

An innovative framework has been developed for teamwork of two quadcopter formations, each having its specified formation geometry, assigned task, and matching control scheme. Position control for quadcopters in one of the formations has been implemented through a Linear Quadratic Regulator Proportional Integral (LQR PI) control scheme based on explicit model following scheme. Quadcopters in the other formation are controlled through LQR PI servomechanism control scheme. These two control schemes are compared in terms of their performance and control effort. Both formations are commanded by respective ground stations through virtual leaders. Quadcopters in formations are able to track desired trajectories as well as hovering at desired points for selected time duration. In case of communication loss between ground station and any of the quadcopters, the neighboring quadcopter provides the command data, received from the ground station, to the affected unit. Proposed control schemes have been validated through extensive simulations using MATLAB®/Simulink® that provided favorable results.

APA, Harvard, Vancouver, ISO, and other styles

35

English, J. M., O. B. Toon, M. J. Mills, and F. Yu. "Microphysical simulations of new particle formation in the upper troposphere and lower stratosphere." Atmospheric Chemistry and Physics 11, no. 17 (September 9, 2011): 9303–22. http://dx.doi.org/10.5194/acp-11-9303-2011.

Full text

Abstract:

Abstract. Using a three-dimensional general circulation model with sulfur chemistry and sectional aerosol microphysics (WACCM/CARMA), we studied aerosol formation and microphysics in the upper troposphere and lower stratosphere (UTLS) as well as the middle and upper stratosphere based on three nucleation schemes (two binary homogeneous schemes and an ion-mediated scheme related to one of the binary schemes). Simulations suggest that ion-mediated nucleation rates in the UTLS are 25 % higher than its related binary scheme, but that the rates predicted by the two binary schemes vary by two orders of magnitude. None of the nucleation schemes is superior at matching the limited observations available at the smallest sizes. However, it is found that coagulation, not nucleation, controls number concentration at sizes greater than approximately 10 nm. Therefore, based on this study, processes relevant to atmospheric chemistry and radiative forcing in the UTLS are not sensitive to the choice of nucleation schemes. The dominance of coagulation over other microphysical processes in the UTLS is consistent with other recent work using microphysical models. Simulations using all three nucleation schemes compare reasonably well to observations of size distributions, number concentration across latitude, and vertical profiles of particle mixing ratio in the UTLS. Interestingly, we find that we need to include Van der Waals forces in our coagulation scheme to match the UTLS aerosol concentrations. We conclude that this model can reasonably represent sulfate microphysical processes in the UTLS, and that the properties of particles at atmospherically relevant sizes appear to be insensitive to the details of the nucleation scheme. We also suggest that micrometeorites, which are not included in this model, dominate the aerosol properties in the upper stratosphere above about 30 km.

APA, Harvard, Vancouver, ISO, and other styles

36

Fodor, Gábor. "Performance Comparison of Practical Resource Allocation Schemes for Device-to-Device Communications." Wireless Communications and Mobile Computing 2018 (2018): 1–14. http://dx.doi.org/10.1155/2018/3623075.

Full text

Abstract:

Device-to-device (D2D) communications in cellular spectrum have the potential of increasing the spectral and energy efficiency by taking advantage of the proximity and reuse gains. Although several resource allocation (RA) and power control (PC) schemes have been proposed in the literature, a comparison of the performance of such algorithms as a function of the available channel state information has not been reported. In this paper, we examine which large scale channel gain knowledge is needed by practically viable RA and PC schemes for network assisted D2D communications. To this end, we propose a novel near-optimal and low-complexity RA scheme that can be advantageously used in tandem with the optimal binary power control scheme and compare its performance with three heuristics-based RA schemes that are combined either with the well-known 3GPP Long-Term Evolution open-loop path loss compensating PC or with an iterative utility optimal PC scheme. When channel gain knowledge about the useful as well as interfering (cross) channels is available at the cellular base station, the near-optimal RA scheme, termed Matching, combined with the binary PC scheme is superior. Ultimately, we find that the proposed low-complexity RA + PC tandem that uses some cross-channel gain knowledge provides superior performance.

APA, Harvard, Vancouver, ISO, and other styles

37

CHANG, CHIN-CHEN, YAW-WEN CHEN, and DANIEL JAMES BUEHRER. "A TWO-DIMENSIONAL SHAPE RECOGNITION SCHEME BASED ON PRINCIPAL COMPONENT ANALYSIS." International Journal of Pattern Recognition and Artificial Intelligence 08, no. 04 (August 1994): 859–75. http://dx.doi.org/10.1142/s0218001494000449.

Full text

Abstract:

In this paper, we propose a simple, but efficient method to recognize two-dimensional shapes without regard to their translation, rotation, and scaling factors. In our scheme, we use all of the boundary points to calculate the first principal component, which is the first shape feature. Next, by dividing the boundary points into groups by projecting them onto the first principal component, each shape is partitioned into several blocks. These blocks are processed separately to produce the remaining shape features. In shape matching, we compare two shapes by calculating the difference between the two sets of features to see whether the two shapes are similar or not. The amount of storage used to represent a shape in our method is fixed, unlike most other shape recognition schemes. The time complexity of our shape matching algorithm is also O(n), where n is the number of blocks. Therefore, the matching algorithm takes little computation time, and is independent of translation, rotation, and scaling of shapes.

APA, Harvard, Vancouver, ISO, and other styles

38

Lopresti, Daniel P., Matthew Y. Ma, Patrick S. P. Wang, and Jill D. Crisman. "Ink Matching of Cursive Chinese Handwritten Annotations." International Journal of Pattern Recognition and Artificial Intelligence 12, no. 01 (February 1998): 119–41. http://dx.doi.org/10.1142/s0218001498000099.

Full text

Abstract:

In this paper, we discuss the notion of treating electronic ink as first class data without attempting to recognize it by presenting two different variations of approximate ink matching (AIM) for searching ink data. We also illustrate a pen-based electronic document annotating and browsing system and methods for searching handdrawn personal notes employing the described matching schemes. Adapting from the Learning by Knowledge paradigm, we propose a semantic matching network that applies semantics of Chinese language early in the process of ink matching. Finally we evaluate several key components in our entire ink matching network via experiments. Preliminary experimental results show the approximate ink matching algorithms perform well, despite the informal and highly variable nature of Chinese handwriting. Our experiments also show some promising results on semantic matching and the feasibility of our semantic matching architecture.

APA, Harvard, Vancouver, ISO, and other styles

39

Ihara, Shunsuke, and Masashi Kubo. "The asymptotics of string matching probabilities for Gaussian random sequences." Nagoya Mathematical Journal 166 (June 2002): 39–54. http://dx.doi.org/10.1017/s0027763000008242.

Full text

Abstract:

AbstractWyner and Ziv (1989) studied the asymptotic properties of recurrence times of stationary ergodic processes, and applied the results to obtain optimal data compression schemes in information transmission. Since then many data compression algorithms based upon string matching of a sequence from an information source with a database have been proposed and studied. In this paper we consider Gaussian stationary processes representing an information source and a database, and study problems of string matching with distortion. We prove theorems concerning the asymptotic behavior of the probability of string matching with distortion and the waiting time for the string matching.

APA, Harvard, Vancouver, ISO, and other styles

40

Alia, Mohammad, and Khaled Suwais. "Improved Steganography Scheme based on Fractal Set." International Arab Journal of Information Technology 17, no. 1 (January 1, 2019): 128–36. http://dx.doi.org/10.34028/iajit/17/1/15.

Full text

Abstract:

Steganography is the art of hiding secret data inside digital multimedia such as image, audio, text and video. It plays a significant role in current trends for providing secure communication and guarantees accessibility of secret information by authorised parties only. The Least-Significant Bit (LSB) approach is one of the important schemes in steganography. The majority of LSB-based schemes suffer from several problems due to distortion in a limited payload capacity for stego-image. In this paper, we have presented an alternative steganographic scheme that does not rely on cover images as in existing schemes. Instead, the image which includes the secure hidden data is generated as an image of a curve. This curve is resulted from a series of computation that is carried out over the mathematical chaotic fractal sets. The new scheme aims at improving the data concealing capacity, since it achieves limitless concealing capacity and disposes of the likelihood of the attackers to realise any secret information from the resulted stego-image. From the security side, the proposed scheme enhances the level of security as the scheme depends on the exact matching between secret information and the generated fractal (Mandelbrot-Julia) values. Accordingly, a key stream is created based on these matches. The proposed scheme is evaluated and tested successfully from different perspectives

APA, Harvard, Vancouver, ISO, and other styles

41

Trivedi, Deven, Rohit Thanki, and Surekha Borra. "Edge Detection and Contour Based Ear Recognition Scheme." Journal of Information Technology Research 12, no. 3 (July 2019): 74–92. http://dx.doi.org/10.4018/jitr.2019070105.

Full text

Abstract:

In recent days, with the advancements in computer vision technology pattern recognition for biometric data has been the focus of many researchers. The human ear can be used to assist in the recognition of an individual. In this article, a new scheme for ear recognition is presented, based on edge features such as the helix shape and contours between the edge pixels. First, an ear image is detected from the acquired image using a snake model-based image segmentation technique, and then histogram equalization is applied to form an enhanced ear image. After that, an Infinite Symmetric Exponential Filter (ISEF) edge is applied to the image, the contouring of edges is calculated, and then the contour values of pixels are extracted as ear features. Finally, the ear matching is performed between query ear features and enrolled ear features. Based on the matching score, the decision about individual authentication is performed. The experimental results showed that this proposed scheme performs better than existing schemes in the literature.

APA, Harvard, Vancouver, ISO, and other styles

42

HUO, GUANGWEN, TONGYI ZHANG, GUANGHUA CHENG, and WEI ZHAO. "CALCULATION OF EFFECTIVE NONLINEAR COEFFICIENT IN BIBO FOR SPONTANEOUS PARAMETRIC DOWN CONVERSION." Journal of Nonlinear Optical Physics & Materials 22, no. 01 (March 2013): 1350010. http://dx.doi.org/10.1142/s0218863513500100.

Full text

Abstract:

We theoretically investigate the effective nonlinear coefficient d eff of spontaneous parametric down-conversion (SPDC) process in biaxial nonlinear crystal BiB3O6 (BIBO). We solve the Fresnel equations in the collinear degenerate down-converted configuration, and get the relations of phase-matching angles. Considering the double phase-matching, we compute the phase-matching angles with different wavelength. Furthermore, we simplify the expression of effective nonlinear coefficient out of the principal planes, and numerically calculate it varying with the angle and wavelength. These results indicate that there are three effective phase-matching schemes for SPDC which can be used to construct a system to generate entangled photon pairs.

APA, Harvard, Vancouver, ISO, and other styles

43

Braun, Gabor, and Sebastian Pokutta. "The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes." IEEE Transactions on Information Theory 61, no. 10 (October 2015): 5754–64. http://dx.doi.org/10.1109/tit.2015.2465864.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Guo, Lei, Guoqing Li, Chunyan Hu, Zhijun Lei, Enliang Huang, Jianbo Gong, and Gang Xu. "Optimization of Flow Matching Schemes for a Heavy Gas Turbine Burning Syngas." Journal of Thermal Science 29, no. 5 (August 13, 2020): 1292–99. http://dx.doi.org/10.1007/s11630-020-1359-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Ma, Bo, Jianhua Ge, and Jing Li. "Distributed Matching Schemes for Multi-source and Multi-relay Cooperative Wireless Networks." Wireless Personal Communications 70, no. 4 (July 18, 2012): 1525–40. http://dx.doi.org/10.1007/s11277-012-0763-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Gong, Ning, and Bruce D. Grundy. "The design of charitable fund-raising schemes: Matching grants or seed money." Journal of Economic Behavior & Organization 108 (December 2014): 147–65. http://dx.doi.org/10.1016/j.jebo.2014.09.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Renders, Luca, Kathleen Marchal, and Jan Fostier. "Dynamic partitioning of search patterns for approximate pattern matching using search schemes." iScience 24, no. 7 (July 2021): 102687. http://dx.doi.org/10.1016/j.isci.2021.102687.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Wang, Shunsen, Kunlun Bai, Yonghui Xie, Juan Di, and Shangfang Cheng. "Analysis of Combined Power and Refrigeration Generation Using the Carbon Dioxide Thermodynamic Cycle to Recover the Waste Heat of an Internal Combustion Engine." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/689398.

Full text

Abstract:

A novel thermodynamic system is proposed to recover the waste heat of an internal combustion engine (ICE) by integrating the transcritical carbon dioxide (CO2) refrigeration cycle with the supercritical CO2power cycle, and eight kinds of integration schemes are developed. The key parameters of the system are optimized through a genetic algorithm to achieve optimum matching with different variables and schemes, as well as the maximum net power output (Wnet). The results indicate that replacing a single-turbine scheme with a double-turbine scheme can significantly enhance the net power output (Wnet) and lower the inlet pressure of the power turbine (P4). With the same exhaust parameters of ICE, the maximumWnetof the double-turbines scheme is 40%–50% higher than that of the single-turbine scheme. Replacing a single-stage compression scheme with a double-stage compression scheme can also lower the value ofP4, while it could not always significantly enhance the value ofWnet. Except for the power consumption of air conditioning, the net power output of this thermodynamic system can reach up to 13%–35% of the engine power when it is used to recover the exhaust heat of internal combustion engines.

APA, Harvard, Vancouver, ISO, and other styles

49

Florez, Horacio. "About Revisiting Domain Decomposition Methods for Poroelasticity." Mathematics 6, no. 10 (October 2, 2018): 187. http://dx.doi.org/10.3390/math6100187.

Full text

Abstract:

In this paper, we revisit well-established domain decomposition (DD) schemes to perform realistic simulations of coupled flow and poroelasticity problems on parallel computers. We define distinct solution schemes to take into account different transmission conditions among subdomain boundaries. Indeed, we examine two different approaches, i.e., Dirichlet-Neumann (DN) and the mortar finite element method (MFEM), and we recognize their advantages and disadvantages. The MFEM significantly lessens the computational cost of reservoir compaction and subsidence calculations by dodging the conforming Cartesian grids that arise from the pay-zone onto its vicinity. There is a manifest necessity of producing non-matching interfaces between the reservoir and its neighborhood. We thus employ MFEM over nonuniform rational B-splines (NURBS) surfaces to stick these non-conforming subdomain parts. We then decouple the mortar saddle-point problem (SPP) using the Dirichlet-Neumann domain decomposition (DNDD) scheme. We confirm that this procedure is proper for calculations at the field level. We also carry comprehensive comparisons between the conventional and non-matching solutions to prove the method’s accuracy. Examples encompass linking finite element codes for slightly compressible single-phase and poroelasticity. We have used this program to a category of problems ranking from near-borehole applications to whole field subsidence estimations.

APA, Harvard, Vancouver, ISO, and other styles

50

Kim, Jon Jin, Susan V. Fuggle, and Stephen D. Marks. "Does HLA matching matter in the modern era of renal transplantation?" Pediatric Nephrology 36, no. 1 (December 9, 2019): 31–40. http://dx.doi.org/10.1007/s00467-019-04393-6.

Full text

Abstract:

AbstractChildren with end-stage kidney disease should be offered the best chance for future survival which ideally would be a well-matched pre-emptive kidney transplant. Paediatric and adult practice varies around the world depending on geography, transplant allocation schemes and different emphases on living (versus deceased) donor renal transplantation. Internationally, paediatric patients often have priority in allocation schemes and younger donors are preferentially allocated to paediatric recipients. HLA matching can be difficult and may result in longer waiting times. Additionally, with improved surgical techniques and modern immunosuppressive regimens, how important is the contribution of HLA matching to graft longevity? In this review, we discuss the relative importance of HLA matching compared with donor quality; and long-term patient outcomes including re-transplantation rates. We share empirical evidence that will be useful for clinicians and families to make decisions about best donor options. We discuss why living donation still provides the best allograft survival outcomes and what to do in the scenario of a highly mismatched living donor.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Matching Schemes'

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