http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Varun Thakur,Sanjay Kumar Nayak,Kodihalli Keeriti Nagaraja,Sonnada Math Shivaprasad 대한금속·재료학회 2015 ELECTRONIC MATERIALS LETTERS Vol.11 No.3
Surface nitridation of the c-sapphire substrate is used to improve the optical and structural quality of a GaN nanowall network film grown by plasma assisted molecular beam epitaxy. The nitridation results in the formation of a thin AlN layer on the sapphire surface. Several in-situ and ex-situ characterization are complementarily used to probe the changes in epitaxial growth, band edge emission and strain in the films. The GaN nanowall network layer formed on the pre-nitrided substrate shows a two order higher intensity of band edge luminescence than that of a GaN epilayer, demonstrating its potential for light-emission applications.
A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites
( Aniket Bhatnagar ),( Varun Gambhir ),( Manish Kumar Thakur ) 한국정보처리학회 2018 Journal of information processing systems Vol.14 No.4
For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.
A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites
Bhatnagar, Aniket,Gambhir, Varun,Thakur, Manish Kumar Korea Information Processing Society 2018 Journal of information processing systems Vol.14 No.4
For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.