• 제목/요약/키워드: perfect set

검색결과 133건 처리시간 0.019초

제한된 HL-그래프와 재귀원형군 $G(2^m,4)$에서 매칭 배제 문제 (Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$)

  • 박정흠
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제35권2호
    • /
    • pp.60-65
    • /
    • 2008
  • 그래프의 매칭 배제 집합은 그것을 삭제한 그래프가 완전 매칭이나 준완전 매칭을 가지지 않는 에지 집합이다. 매칭 배제수는 모든 매칭 배제 집합의 최소 크기이다. 이 논문에서는 임의의 $m{\geq}4$에 대하여 H-차원 제한된 HL-그래프와 재귀원형군 $G(2^m,4)$의 매칭 배제수는 분지수 m과 같고, 모든 최소 매칭 배제 집합은 한 정점에 인접한 에지 집합임을 보인다.

BETWEEN PAIRWISE -α- PERFECT FUNCTIONS AND PAIRWISE -T- α- PERFECT FUNCTIONS

  • ALI A. ATOOM;FERAS BANI-AHMAD
    • Journal of applied mathematics & informatics
    • /
    • 제42권1호
    • /
    • pp.15-29
    • /
    • 2024
  • Many academics employ various structures to expand topological space, including the idea of topology, as a result of the importance of topological space in analysis and some applications. One of the most notable of the generalizations was the definition of perfect functions in bitopological spaces, which was presented by Ali.A.Atoom and H.Z.Hdeib. We propose the notion of α- pairwise perfect functions in bitopological spaces and define different types of this concept in this study. Pairwise -T - α- perfect functions, pairwise -α-irr-perfect functions, and pairwise -T - α- irr-perfect functions, are all characterized in addition to pairwise -α-perfect functions. We go through their primary characteristics and show how they interact. Finally, under these functions, we introduce the images and inverse images of certain bitopological features. About these concepts, some product theorems have been discovered.

SECURE DOMINATION PARAMETERS OF HALIN GRAPH WITH PERFECT K-ARY TREE

  • R. ARASU;N. PARVATHI
    • Journal of applied mathematics & informatics
    • /
    • 제41권4호
    • /
    • pp.839-848
    • /
    • 2023
  • Let G be a simple undirected graph. A planar graph known as a Halin graph(HG) is characterised by having three connected and pendent vertices of a tree that are connected by an outer cycle. A subset S of V is said to be a dominating set of the graph G if each vertex u that is part of V is dominated by at least one element v that is a part of S. The domination number of a graph is denoted by the γ(G), and it corresponds to the minimum size of a dominating set. A dominating set S is called a secure dominating set if for each v ∈ V\S there exists u ∈ S such that v is adjacent to u and S1 = (S\{v}) ∪ {u} is a dominating set. The minimum cardinality of a secure dominating set of G is equal to the secure domination number γs(G). In this article we found the secure domination number of Halin graph(HG) with perfet k-ary tree and also we determined secure domination of rooted product of special trees.

LS code pair setting and sequential allocation methods

  • Wook, Roh-Dong
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
    • /
    • pp.221-224
    • /
    • 2001
  • A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

  • PDF

한계가치함수체계의 완전대체성과 상품결합성 (Perfect Substitution and Aggregation in A System of Marginal Valuation Functions)

  • 박환재
    • 자원ㆍ환경경제연구
    • /
    • 제12권3호
    • /
    • pp.427-452
    • /
    • 2003
  • 본 연구는 모든 수요분석이 자료수집과 분석전에 완전대체성과 상품묶음을 사전적으로 가정하고 있으며, 일반적인 수요모형에서 수요함수 자체가 존재하지 않음을 주목하고 한계가치함수체계에서 완전대체성의 제약조건을 이론적으로 도출하였다. 그리고 완전대체성이 사전적인 제약으로 부과될 경우 수집된 자료와 일관되지 않음으로써 수요분석을 어렵게 할 경우 파레토의 계약곡선처럼 정보계약곡선을 이용하여 완전대체성의 정도를 조절할 수 있으며, 그 결과 도출되는 정보를 이용하여 상품묶음의 정도를 파악할 수 있음을 보여준다. 실증적 분석의 예로서 한국어류시장의 주요어종들간에 한계가치의 변화를 통하여 대체성의 정도를 파악하고 상품묶음을 할 수 있음도 보여준다. 비록 형태에 따른 어종이 다르더라도 소비자의 눈에서 보는 대체정도는 다른 것으로 볼 수 있으며, 그러한 시각에서 대체성과 상품묶음이 이루어질 수 있음도 보여준다. 이렇게 정보계약곡선을 따라 제약의 강도가 달라질 때 경제학적으로 합리적인 탄력성의 값을 택하여 후생분석으로 확장할 수 있음을 말해준다. 아직 이러한 연구가 초기단계이므로 많은 미래의 연구와 활용에 기여할 수 있을 것이다.

  • PDF

ON THE (n, d)th f-IDEALS

  • GUO, JIN;WU, TONGSUO
    • 대한수학회지
    • /
    • 제52권4호
    • /
    • pp.685-697
    • /
    • 2015
  • For a field K, a square-free monomial ideal I of K[$x_1$, . . ., $x_n$] is called an f-ideal, if both its facet complex and Stanley-Reisner complex have the same f-vector. Furthermore, for an f-ideal I, if all monomials in the minimal generating set G(I) have the same degree d, then I is called an $(n, d)^{th}$ f-ideal. In this paper, we prove the existence of $(n, d)^{th}$ f-ideal for $d{\geq}2$ and $n{\geq}d+2$, and we also give some algorithms to construct $(n, d)^{th}$ f-ideals.

On Quantifies Estimation Using Ranked Samples with Some Applications

  • Samawi, Hani-M.
    • Journal of the Korean Statistical Society
    • /
    • 제30권4호
    • /
    • pp.667-678
    • /
    • 2001
  • The asymptotic behavior and distribution for quantiles estimators using ranked samples are introduced. Applications of quantiles estimation on finding the normal ranges (2.5% and 97.5% percentiles) and the median of some medical characteristics and on finding the Hodges-Lehmann estimate are discussed. The conclusion of this study is, whenever perfect ranking is possible, the relative efficiency of quantiles estimation using ranked samples relative to SRS is high. This may translates to large savings in cost and time. Also, this conclusion holds even if the ranking is not perfect. Computer simulation results are given and real data from lows 65+ study is used to illustrate the method.

  • PDF

음성신호의 Sub-Nyquist 비균일 표준화 및 완전 복구에 관한 연구 (Sub-Nyquist Nonuniform Sampling and Perfect Reconstruction of Speech Signals)

  • 이희영
    • 음성과학
    • /
    • 제12권2호
    • /
    • pp.153-170
    • /
    • 2005
  • The sub-Nyquist nonuniform sampling (SNNS) and the perfect reconstruction (PR) formula are proposed for the development of a systematic method to obtain minimal representation of a speech signal. In the proposed method, the instantaneous sampling frequency (ISF) varies, depending on the least upper boundary of spectral support of a speech signal in time-frequency domain (TFD). The definition of the instantaneous bandwidth (IB), which determines the ISF and is used for generating the set of samples that represent continuous-time signals perfectly, is given. Also, the spectral characteristics of the sampled data generated by the sub-Nyquist nonuniform sampling method is analyzed. The proposed method doesn't generate the redundant samples due to the time-varying property of the instantaneous bandwidth of a speech signal.

  • PDF

2단 유성기어 감속기의 후부기어 치형수정에 관한 연구 (Study on Tooth Micro-geometry Optimization of Rear Gear Set in 2 Speed Planetary Gear Reducer)

  • 전민형;김래성;노승윤;진진;최창;류성기
    • 한국기계가공학회지
    • /
    • 제16권5호
    • /
    • pp.1-6
    • /
    • 2017
  • Gear tooth micro-geometry modifications include the intentional removal of material from the gear teeth flanks, so that the shape is no longer a perfect involute. If the gear shapes are perfect, then the gear tooth meshing is better, therefore the gears will transmit input torque in a more efficient manner without the generation of high frequency engine fluctuation noise. In this paper, we study tooth micro-geometry optimization of rear gear set in 2 speed planetary gear reducers. Analysis revealed problems which are need of modification. Based on the results, tooth micro-geometry was used to deal with load distributions on the rear gear set.