World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering最新文献
In this paper, we proposed the distribution of mesh normal vector direction as a feature descriptor of a 3D model. A normal vector shows the entire shape of a model well. The distribution of normal vectors was sampled in proportion to each polygon's area so that the information on the surface with less surface area may be less reflected on composing a feature descriptor in order to enhance retrieval performance. At the analysis result of ANMRR, the enhancement of approx. 12.4%~34.7% compared to the existing method has also been indicated.
{"title":"3D Model Retrieval based on Normal Vector Interpolation Method","authors":"A. Kim, O. Gwun, Juwhan Song","doi":"10.5281/ZENODO.1060878","DOIUrl":"https://doi.org/10.5281/ZENODO.1060878","url":null,"abstract":"In this paper, we proposed the distribution of mesh\u0000normal vector direction as a feature descriptor of a 3D model. A\u0000normal vector shows the entire shape of a model well. The\u0000distribution of normal vectors was sampled in proportion to each\u0000polygon's area so that the information on the surface with less surface\u0000area may be less reflected on composing a feature descriptor in order\u0000to enhance retrieval performance. At the analysis result of ANMRR,\u0000the enhancement of approx. 12.4%~34.7% compared to the existing\u0000method has also been indicated.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"1 1","pages":"621-624"},"PeriodicalIF":0.0,"publicationDate":"2009-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87390225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
the present paper, using the technique of differential subordination, we obtain certain results for analytic functions defined by a multiplier transformation in the open unit disc E = { z : IzI < 1}. We claim that our results extend and generalize the existing results in this particular direction
{"title":"An Application of Differential Subordination to Analytic Functions","authors":"S. S. Billing, Sushma Gupta, S. Dhaliwal","doi":"10.5281/ZENODO.1084444","DOIUrl":"https://doi.org/10.5281/ZENODO.1084444","url":null,"abstract":"the present paper, using the technique of differential subordination, we obtain certain results for analytic functions defined by a multiplier transformation in the open unit disc E = { z : IzI < 1}. We claim that our results extend and generalize the existing results in this particular direction","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"1 1","pages":"551-553"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82223197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many works have been carried out to compare the efficiency of several goodness of fit procedures for identifying whether or not a particular distribution could adequately explain a data set. In this paper a study is conducted to investigate the power of several goodness of fit tests such as Kolmogorov Smirnov (KS), Anderson-Darling(AD), Cramer- von- Mises (CV) and a proposed modification of Kolmogorov-Smirnov goodness of fit test which incorporates a variance stabilizing transformation (FKS). The performances of these selected tests are studied under simple random sampling (SRS) and Ranked Set Sampling (RSS). This study shows that, in general, the Anderson-Darling (AD) test performs better than other GOF tests. However, there are some cases where the proposed test can perform as equally good as the AD test.
{"title":"On the Comparison of Several Goodness of Fit tests under Simple Random Sampling and Ranked Set Sampling","authors":"F. A. Shahabuddin, K. Ibrahim, A. Jemain","doi":"10.5281/ZENODO.1072455","DOIUrl":"https://doi.org/10.5281/ZENODO.1072455","url":null,"abstract":"Many works have been carried out to compare the\u0000efficiency of several goodness of fit procedures for identifying\u0000whether or not a particular distribution could adequately explain a\u0000data set. In this paper a study is conducted to investigate the power\u0000of several goodness of fit tests such as Kolmogorov Smirnov (KS),\u0000Anderson-Darling(AD), Cramer- von- Mises (CV) and a proposed\u0000modification of Kolmogorov-Smirnov goodness of fit test which\u0000incorporates a variance stabilizing transformation (FKS). The\u0000performances of these selected tests are studied under simple\u0000random sampling (SRS) and Ranked Set Sampling (RSS). This\u0000study shows that, in general, the Anderson-Darling (AD) test\u0000performs better than other GOF tests. However, there are some\u0000cases where the proposed test can perform as equally good as the\u0000AD test.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"9 1","pages":"406-409"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86218808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
O. Ruiz, C. Cadavid, Juan G. Lalinde, Ricardo Serrano, G. Peris-Fajarnés
The Boundary Representation of a 3D manifold contains FACES (connected subsets of a parametric surface S : R2−R3) -- In many science and engineering applications it is cumbersome and algebraically difficult to deal with the polynomial set and constraints (LOOPs) representing the FACE -- Because of this reason, a Piecewise Linear (PL) approximation of the FACE is needed, which is usually represented in terms of triangles (i.e. 2-simplices) -- Solving the problem of FACE triangulation requires producing quality triangles which are: (i) independent of the arguments of S, (ii) sensitive to the local curvatures, and (iii) compliant with the boundaries of the FACE and (iv) topologically compatible with the triangles of the neighboring FACEs -- In the existing literature there are no guarantees for the point (iii) -- This article contributes to the topic of triangulations conforming to the boundaries of the FACE by applying the concept of parameter independent Gabriel complex, which improves the correctness of the triangulation regarding aspects (iii) and (iv) -- In addition, the article applies the geometric concept of tangent ball to a surface at a point to address points (i) and (ii) -- Additional research is needed in algorithms that (i) take advantage of the concepts presented in the heuristic algorithm proposed and (ii) can be proved correct
{"title":"Gabriel-constrained Parametric Surface Triangulation","authors":"O. Ruiz, C. Cadavid, Juan G. Lalinde, Ricardo Serrano, G. Peris-Fajarnés","doi":"10.5772/7401","DOIUrl":"https://doi.org/10.5772/7401","url":null,"abstract":"The Boundary Representation of a 3D manifold contains FACES (connected subsets of a parametric surface S : R2−R3) -- In many science and engineering applications it is cumbersome and algebraically difficult to deal with the polynomial set and constraints (LOOPs) representing the FACE -- Because of this reason, a Piecewise Linear (PL) approximation of the FACE is needed, which is usually represented in terms of triangles (i.e. 2-simplices) -- Solving the problem of FACE triangulation requires producing quality triangles which are: (i) independent of the arguments of S, (ii) sensitive to the local curvatures, and (iii) compliant with the boundaries of the FACE and (iv) topologically compatible with the triangles of the neighboring FACEs -- In the existing literature there are no guarantees for the point (iii) -- This article contributes to the topic of triangulations conforming to the boundaries of the FACE by applying the concept of parameter independent Gabriel complex, which improves the correctness of the triangulation regarding aspects (iii) and (iv) -- In addition, the article applies the geometric concept of tangent ball to a surface at a point to address points (i) and (ii) -- Additional research is needed in algorithms that (i) take advantage of the concepts presented in the heuristic algorithm proposed and (ii) can be proved correct","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"10 1","pages":"568-575"},"PeriodicalIF":0.0,"publicationDate":"2008-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80342686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we examine some properties of suborbital graphs for the congruence subgroup r 0 (N) . Then we give necessary and sufficient conditions for graphs to have triangels.
本文研究了同余子群r0 (N)的亚轨道图的一些性质。然后给出了图有三角形的充分必要条件。
{"title":"On Suborbital Graphs of the Congruence Subgroup r 0(N)","authors":"B. Ö. Güler, Serkan Kader, Murat Besenk","doi":"10.5281/ZENODO.1061517","DOIUrl":"https://doi.org/10.5281/ZENODO.1061517","url":null,"abstract":"In this paper we examine some properties of suborbital graphs for the congruence subgroup r 0 (N) . Then we give necessary and sufficient conditions for graphs to have triangels.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"89 1","pages":"499-502"},"PeriodicalIF":0.0,"publicationDate":"2008-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75838896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graph decompositions are vital in the study of combinatorial design theory. A decomposition of a graph G is a partition of its edge set. An n-sun graph is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper, we define n-sun decomposition of some even order graphs with a perfect matching. We have proved that the complete graph K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have n-sun decompositions. A labeling scheme is used to construct the n-suns.
{"title":"N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs","authors":"R. Anitha, R. Lekshmi","doi":"10.5281/ZENODO.1058670","DOIUrl":"https://doi.org/10.5281/ZENODO.1058670","url":null,"abstract":"Graph decompositions are vital in the study of\u0000combinatorial design theory. A decomposition of a graph G is a\u0000partition of its edge set. An n-sun graph is a cycle Cn with an edge\u0000terminating in a vertex of degree one attached to each vertex. In this\u0000paper, we define n-sun decomposition of some even order graphs\u0000with a perfect matching. We have proved that the complete graph\u0000K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have\u0000n-sun decompositions. A labeling scheme is used to construct the n-suns.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"59 1","pages":"452-457"},"PeriodicalIF":0.0,"publicationDate":"2008-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73234935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a generalized derivatives operator λ,βf introduced by the authors will be discussed. Some subordination and superordination results involving this operator for certain normalized analytic functions in the open unit disk will be investigated. Our results extend corresponding previously known results. Keywords—Analytic functions, Univalent functions, Derivative operator, Differential subordination, Differential superordination.
{"title":"Differential Sandwich Theorems with Generalised Derivative Operator","authors":"M. Darus, K. Al-Shaqsi","doi":"10.5772/8210","DOIUrl":"https://doi.org/10.5772/8210","url":null,"abstract":"In this paper, a generalized derivatives operator λ,βf introduced by the authors will be discussed. Some subordination and superordination results involving this operator for certain normalized analytic functions in the open unit disk will be investigated. Our results extend corresponding previously known results. Keywords—Analytic functions, Univalent functions, Derivative operator, Differential subordination, Differential superordination.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"3 1","pages":"149-152"},"PeriodicalIF":0.0,"publicationDate":"2008-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90102064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. H. Nasseri, E. Ardil, A. Yazdani, Reza Zaefarian
The fuzzy set theory has been applied in many fields, such as operations research, control theory, and management sciences, etc. In particular, an application of this theory in decision making problems is linear programming problems with fuzzy numbers. In this study, we present a new method for solving fuzzy number linear programming problems, by use of linear ranking function. In fact, our method is similar to simplex method that was used for solving linear programming problems in crisp environment before.
{"title":"Simplex Method For Solving Linear Programming Problems With Fuzzy Numbers","authors":"S. H. Nasseri, E. Ardil, A. Yazdani, Reza Zaefarian","doi":"10.5281/ZENODO.1058184","DOIUrl":"https://doi.org/10.5281/ZENODO.1058184","url":null,"abstract":"The fuzzy set theory has been applied in many fields,\u0000such as operations research, control theory, and management\u0000sciences, etc. In particular, an application of this theory in decision\u0000making problems is linear programming problems with fuzzy\u0000numbers. In this study, we present a new method for solving fuzzy\u0000number linear programming problems, by use of linear ranking\u0000function. In fact, our method is similar to simplex method that was\u0000used for solving linear programming problems in crisp environment\u0000before.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"5 1","pages":"513-517"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74019139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：