• Title/Summary/Keyword: association schemes

Search Result 424, Processing Time 0.029 seconds

CLASSIFICATION OF ASSOCIATION SCHEMES WITH 18 AND 19 VERTICES

  • Hanaki, A.;Miyamoto, I.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.633-642
    • /
    • 1998
  • The isomorphism classes of association schemes with 18 and 19 vertices are classified. We obtain 95 isomorphism classes of association schemes with 18 vertices and denote the representatives of the isomorphism classes as subschemes of 7 association schemes. We obtain 7 isomorphism classes of association schemes with 19 vertices and six of them are cyclotomic schemes.

Partially Balanced Bipartite Weighing Designs from Association Schemes

  • Sinha, Kishore
    • Journal of the Korean Statistical Society
    • /
    • v.6 no.1
    • /
    • pp.25-29
    • /
    • 1977
  • A method of constructing partially balanced bipartile weighing designs (PBBWD) from association schemes is given. Some series of three associate PBBWE's from three associate rectangular association schemes are obtained.

  • PDF

WEAK METRIC AND WEAK COMETRIC SCHEMES

  • Kim, Dae-San;Kim, Gil-Chun
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.4
    • /
    • pp.785-812
    • /
    • 2009
  • The notion of weak metric and weak cometric schemes are introduced as a generalization of metric and cometric schemes. They are given as the wreath product of a finite number of symmetric association schemes satisfying certain equivalent conditions which are analogous to the ones for metric or cometric schemes. We characterize those schemes and determine some of their parameters.

ON 4-EQUIVALENCED ASSOCIATION SCHEMES

  • PARK, JEONG RYE
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.5
    • /
    • pp.1683-1709
    • /
    • 2015
  • Let (${\Omega}$, S) be an association scheme where ${\Omega}$ is a non-empty finite set and S is a partition of ${\Omega}{\times}{\Omega}$. For a positive integer k we say that (${\Omega}$, S) is k-equivalenced if each non-diagonal element of S has valency k. In this paper we focus on 4-equivalenced association schemes, and prove that they are transitive.

Finite difference TVD scheme for modeling two-dimensional advection-dispersion

  • Guan, Y.;Zhang, D.
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2006.05a
    • /
    • pp.22-27
    • /
    • 2006
  • This paper describes the development of the stream-tube based dispersion model for modeling contaminant transport in open channels. The operator-splitting technique is employed to separate the 2D contaminant transport equation into the pure advection and pure dispersion equations. Then the total variation diminishing (TVD) schemes are combined with the second-order Lax-Wendroff and third-order QUICKEST explicit finite difference schemes respectively to solve the pure advection equation in order to prevent the occurrence of numerical oscillations. Due to various limiters owning different features, the numerical tests for 1D pure advection and 2D dispersion are conducted to evaluate the performance of different TVD schemes firstly, then the TVD schemes are applied to experimental data for simulating the 2D mixing in a straight trapezoidal channel to test the model capability. Both the numerical tests and model application show that the TVD schemes are very competent for solving the advection-dominated transport problems.

  • PDF

POSET METRICS ADMITTING ASSOCIATION SCHEMES AND A NEW PROOF OF MACWILLIAMS IDENTITY

  • Oh, Dong Yeol
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.917-931
    • /
    • 2013
  • It is known that being hierarchical is a necessary and sufficient condition for a poset to admit MacWilliams identity. In this paper, we completely characterize the structures of posets which have an association scheme structure whose relations are indexed by the poset distance between the points in the space. We also derive an explicit formula for the eigenmatrices of association schemes induced by such posets. By using the result of Delsarte which generalizes the MacWilliams identity for linear codes, we give a new proof of the MacWilliams identity for hierarchical linear poset codes.

Posets Related to Some Association Schemes

  • Song, Sung-Yell
    • The Mathematical Education
    • /
    • v.25 no.3
    • /
    • pp.57-69
    • /
    • 1987
  • A geometric interpretation of t-designs, in the context of posets, is given in the association scheme, not isomorphic with the Hamming scheme H(2,4), but having the same parameters as H(2,4). It is also shown that there is no similar poset which characterizes the designs for ally of the three exceptional association schemes, not isomorphic with the Johnson scheme J(8,2), but having the same parameters as J(8,2).

  • PDF

Secure Proxy Signature Schemes based on RSA Problems and Warrants (RSA 문제와 위임장에 기반한 안전한 대리서명 기법)

  • Seo, Moon-Seog;Iang, Phil-Sik;Choi, Chool-Heon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.1
    • /
    • pp.42-49
    • /
    • 2011
  • Proxy signature schemes are configured as proxy signers on behalf of their original signers can be allowed to sign messages. Basic security requirements of proxy signature schemes include the strong unforgeability and the verifiability of delegation. So far, a variety of proxy signature schemes that proved on individual basic security terms but not proved on compounded security terms are proposed. Especially the proposed proxy signature schemes based on RSA problem are proved vulnerable to an attacker with his own private key in terms of the impersonating attack. A unauthorized attacker can generate the proxy signature without the appointee's consent or authorization. In this paper, we propose a proxy signature scheme based on RSA problems and warrants that can be proved the security against the impersonating attack. The proposed proxy signature scheme is analyzed on the safety and compared in terms of efficiency with other proxy signature schemes.

Sequential optimization for pressure management in water distribution networks

  • Malvin S. Marlim;Doosun Kang
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.169-169
    • /
    • 2023
  • Most distributed water is not used effectively due to water loss occurring in pipe networks. These water losses are caused by leakage, typically due to high water pressure to ensure adequate water supply. High water pressure can cause the pipe to burst or develop leaks over time, particularly in an aging network. In order to reduce the amount of leakage and ensure proper water distribution, it is important to apply pressure management. Pressure management aims to maintain a steady and uniform pressure level throughout the network, which can be achieved through various operational schemes. The schemes include: (1) installing a variable speed pump (VSP), (2) introducing district metered area (DMA), and (3) operating pressure-reducing valves (PRV). Applying these approaches requires consideration of various hydraulic, economic, and environmental aspects. Due to the different functions of these approaches and related components, an all-together optimization of these schemes is a complicated task. In order to reduce the optimization complexity, this study recommends a sequential optimization method. With three network operation schemes considered (i.e., VSP, DMA, and PRV), the method explores all the possible combinations of pressure management paths. Through sequential optimization, the best pressure management path can be determined using a multiple-criteria decision analysis (MCDA) to weigh in factors of cost savings, investment, pressure uniformity, and CO2 emissions. Additionally, the contribution of each scheme to pressure management was also described in the application results.

  • PDF

Objective Naturalness and Urbanness Evaluation of Animation Images

  • Wang, Wanting;Kim, Jae Ho
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2013.05a
    • /
    • pp.43-44
    • /
    • 2013
  • In my paper, an evaluation method on naturalness and urbanness characterizations of animation image is proposed. In contrast to the prior works, we intend to give the exact degree of naturalness and urbanness by combining the low-level visual feature-based schemes with the biological visual schemes. In our method, four descriptors are extracted and pseudoinverse is adopted. By this method, we can experiment on the exact degree of naturalness and urbanness with satisfactory results.

  • PDF