• Title/Summary/Keyword: N:M Corresponding Pairs

Search Result 12, Processing Time 0.03 seconds

Determination of N:M Corresponding Pairs between Block Polygon Sets from a Topographical Map and a Cadastral Map (지형도와 연속지적도의 가구계 폴리곤 집합간의 N:M 대응쌍 탐색)

  • Huh, Yong;Kim, Jung-Ok;Yu, Ki-Yun
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.47-49
    • /
    • 2009
  • In this paper, we proposed a new algorithm for determination of many-to-many corresponding pairs between block-polygon sets from the national topographical map and the cadastral map in Korea Land Information System, caused by different abstraction and generalization rules of the two maps. Our proposed algorithm starts from an assumption that a block-polygon for a N:M pair should significantly overlap at least one block polygon of the counterpart group, and determines N:M pairs using an iterative updating and searching with this overlapping analysis. This iteration process is terminated when the N:M corresponding pairs satisfy our predefined 1:1 corresponding condition.

  • PDF

Identification of N:M corresponding polygon pairs using a graph spectral method (Graph spectral 기법을 이용한 N:M 대응 폴리곤쌍 탐색)

  • Huh, Yong;Yu, Ki-Yun
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2010.04a
    • /
    • pp.11-13
    • /
    • 2010
  • Combined with the indeterminate boundaries of spatial objects, n:m correspondences makes an object-based matching be a complex problem. In this study, we model the boundary of a polygon object with fuzzy model and describe their overlapping relations as a weighted bipartite graph. Then corresponding pairs including 1:0, 1:1, 1:n and n:m relations are identified using a spectral singular value decomposition.

  • PDF

Detection of M:N corresponding class group pairs between two spatial datasets with agglomerative hierarchical clustering (응집 계층 군집화 기법을 이용한 이종 공간정보의 M:N 대응 클래스 군집 쌍 탐색)

  • Huh, Yong;Kim, Jung-Ok;Yu, Ki-Yun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.2
    • /
    • pp.125-134
    • /
    • 2012
  • In this paper, we propose a method to analyze M:N corresponding relations in semantic matching, especially focusing on feature class matching. Similarities between any class pairs are measured by spatial objects which coexist in the class pairs, and corresponding classes are obtained by clustering with these pairwise similarities. We applied a graph embedding method, which constructs a global configuration of each class in a low-dimensional Euclidean space while preserving the above pairwise similarities, so that the distances between the embedded classes are proportional to the overall degree of similarity on the edge paths in the graph. Thus, the clustering problem could be solved by employing a general clustering algorithm with the embedded coordinates. We applied the proposed method to polygon object layers in a topographic map and land parcel categories in a cadastral map of Suwon area and evaluated the results. F-measures of the detected class pairs were analyzed to validate the results. And some class pairs which would not detected by analysis on nominal class names were detected by the proposed method.

Road network data matching using the network division technique (네트워크 분할 기법을 이용한 도로 네트워크 데이터 정합)

  • Huh, Yong;Son, Whamin;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.285-292
    • /
    • 2013
  • This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

THE ZAGREB INDICES OF BIPARTITE GRAPHS WITH MORE EDGES

  • XU, KEXIANG;TANG, KECHAO;LIU, HONGSHUANG;WANG, JINLAN
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.3_4
    • /
    • pp.365-377
    • /
    • 2015
  • For a (molecular) graph, the first and second Zagreb indices (M1 and M2) are two well-known topological indices, first introduced in 1972 by Gutman and Trinajstić. The first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Let $K_{n_1,n_2}^{P}$ with n1 $\leq$ n2, n1 + n2 = n and p < n1 be the set of bipartite graphs obtained by deleting p edges from complete bipartite graph Kn1,n2. In this paper, we determine sharp upper and lower bounds on Zagreb indices of graphs from $K_{n_1,n_2}^{P}$ and characterize the corresponding extremal graphs at which the upper and lower bounds on Zagreb indices are attained. As a corollary, we determine the extremal graph from $K_{n_1,n_2}^{P}$ with respect to Zagreb coindices. Moreover a problem has been proposed on the first and second Zagreb indices.

On the Tensor Product of m-Partition Algebras

  • Kennedy, A. Joseph;Jaish, P.
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.4
    • /
    • pp.679-710
    • /
    • 2021
  • We study the tensor product algebra Pk(x1) ⊗ Pk(x2) ⊗ ⋯ ⊗ Pk(xm), where Pk(x) is the partition algebra defined by Jones and Martin. We discuss the centralizer of this algebra and corresponding Schur-Weyl dualities and also index the inequivalent irreducible representations of the algebra Pk(x1) ⊗ Pk(x2) ⊗ ⋯ ⊗ Pk(xm) and compute their dimensions in the semisimple case. In addition, we describe the Bratteli diagrams and branching rules. Along with that, we have also constructed the RS correspondence for the tensor product of m-partition algebras which gives the bijection between the set of tensor product of m-partition diagram of Pk(n1) ⊗ Pk(n2) ⊗ ⋯ ⊗ Pk(nm) and the pairs of m-vacillating tableaux of shape [λ] ∈ Γkm, Γkm = {[λ] = (λ1, λ2, …, λm)|λi ∈ Γk, i ∈ {1, 2, …, m}} where Γk = {λi ⊢ t|0 ≤ t ≤ k}. Also, we provide proof of the identity $(n_1n_2{\cdots}n_m)^k={\sum}_{[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ f[λ]mk[λ] where mk[λ] is the multiplicity of the irreducible representation of $S{_{n_1}}{\times}S{_{n_2}}{\times}....{\times}S{_{n_m}}$ module indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$, where f[λ] is the degree of the corresponding representation indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ and ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}=\{[{\lambda}]=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_m){\mid}{\lambda}_i{\in}{\Lambda}^k_{n_i},i{\in}\{1,2,{\ldots},m\}\}$ where ${\Lambda}^k_{n_i}=\{{\mu}=({\mu}_1,{\mu}_2,{\ldots},{\mu}_t){\vdash}n_i{\mid}n_i-{\mu}_1{\leq}k\}$.

Graph Equations Involving Tensor Product of Graphs

  • Patil, H.P.;Raja, V.
    • Kyungpook Mathematical Journal
    • /
    • v.57 no.2
    • /
    • pp.301-307
    • /
    • 2017
  • In this paper, we solve the following four graph equations $L^k(G)=H{\oplus}J$; $M(G)=H{\oplus}J$; ${\bar{L^k(G)}}=H{\oplus}J$ and ${\bar{M(G)}}=H{\oplus}J$, where J is $nK_2$ for $n{\geq}1$. Here, the equality symbol = means the isomorphism between the corresponding graphs. In particular, we shall obtain all pairs of graphs (G, H), which satisfy the above mentioned equations, upto isomorphism.

Rate and Product Studies with 2-Methyl-2-Chloroadamantane under Solvolytic Conditions

  • Lee, Young-Hoon;Seong, Mi-Hye;Lee, Eun-Sung;Lee, Yong-Woo;Won, Ho-Shik;Kyong, Jin-Burm;Kevill, Dennis N.
    • Bulletin of the Korean Chemical Society
    • /
    • v.31 no.5
    • /
    • pp.1209-1214
    • /
    • 2010
  • Reactions of 2-methyl-2-chloroadamantane (1) in a variety of pure and binary solvents have been studied at various temperatures and pressures up to 80 MPa. The sensitivity (m) to changes in solvent ionizing power of the Grunwald-Winstein equation, and the activation volume (${\Delta}V^{\ddag}$) are calculated from the specific rates. An excellent linear relationship (R = 0.997) for 1, log (k/$k_0$) = $0.80Y_{Cl}$ + 0.11, and the activation volume, ${\Delta}V^{\ddag}$ = -15.2 ~ -10.2 $mL{\cdot}mol^{-1}$ were observed. These values are similar to those for solvolyses of 1-adamantyl halides over the full range of solvents, suggesting that the unimolecular mechanism involving ion pairs is rate-determining. These observations are also compared with those previously reported for the corresponding 1-adamantyl derivatives and chloroformate esters.

Cloning of Growth Hormone Complementary DNA from Red-Spotted Grouper (Epinephelus akaara) and Its Expression in E. coli (붉바리(Epinephelus akaara)의 성장호르몬 cDNA의 Cloning과 E. coli에서의 발현)

  • 강거영;송춘복;이제희
    • Journal of Aquaculture
    • /
    • v.16 no.2
    • /
    • pp.110-117
    • /
    • 2003
  • We have cloned and sequenced the cDNA encoding growth hormone (GH) from pituitary poly(A)$^{+}$ RNA of red-spotted grouper (Epinephelus akaara). The cDNA of red-spotted grouper GH is 883 base pairs (bp) consisting of 21 bp of 5'untranslated region (UTR), 615 Up of an open reading frame (ORF) and 247 Up of 3'UTR. The polyadenylation signal, AATAAA, was 20 bp upsteam of polyadenylation site. Based on the nucleotide sequences, the deduced putative polypeptide contains 204 amino acids (aa), representing 17 aa of a signal and 187 aa of a mature polypeptide. The putative GH cDNA encodes a polypeptide with four cysteine residues and only one N-gly- cosylation site. Comparative sequence alignment shows that red-spotted grouper GH exhibits high similarity with its corresponding other Perciformes species GH cDNAs.

Genetic Structure and Differentiation of Three Indian Goat Breeds

  • Dixit, S.P.;Verma, N.K.;Aggarwal, R.A.K.;Kumar, Sandeep;Chander, Ramesh;Vyas, M.K.;Singh, K.P.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.22 no.9
    • /
    • pp.1234-1240
    • /
    • 2009
  • Gene flow, genetic structure and differentiation of Kutchi, Mehsana and Sirohi breeds of goat from North-Western India were evaluated based on 25 microsatellite markers so as to support breed conservation and improvement decisions. The microsatellite genotyping was carried out using an automated DNA sequencer. The gene diversity across the studied loci for the Kutchi breed varied from 0.57 (ILST 065) to 0.93 (OarFCB 304, OMHC 1, ILSTS 058) with an overall mean of 0.79${\pm}$0.02. The corresponding values for Mehsana and Sirohi breeds were 0.16 (ILST 008) to 0.93 (OMHC 1, ILSTS 058) with an average of 0.76${\pm}$0.04, and 0.50 (ILSTS 029) to 0.94 (ILSTS 058) with an average of 0.78${\pm}$0.02, respectively. The Mehsana breed had lowest gene diversity among the 3 breeds studied. All the populations showed an overall significant heterozygote deficit ($F_{is}$). The Fis values were 0.26, 0.14 and 0.36 for Kutchi, Mehsana and Sirohi goat breeds, respectively. Kutchi and Mehsana were more differentiated (16%) followed by Mehsana and Sirohi (13%).The measures of standard genetic distance between pairs of breeds indicated that the lowest genetic distance was between Kutchi and Sirohi breeds (0.73) and the largest genetic distance was between Mehsana and Kutchi (1.0) followed by Sirohi and Mehsana (0.75) breeds. Mehsana and Kutchi are distinct breeds and this was revealed by the estimated genetic distance between them. All measures of genetic variation revealed substantial genetic variation in each of the populations studied, thereby showing good scope for their further improvement.