• Kyungpook Mathematical Journal
• /
• 제61권1호
• /
• pp.49-59
• /
• 2021

Recently, Andrews introduced partition functions ����(n) and ${\bar{\mathcal{EO}}}$(n) where the function ����(n) denotes the number of partitions of n in which every even part is less than each odd part and the function ${\bar{\mathcal{EO}}}$(n) denotes the number of partitions enumerated by ����(n) in which only the largest even part appears an odd number of times. In this paper we obtain some congruences modulo 2, 4, 10 and 20 for the partition function ${\bar{\mathcal{EO}}}$(n). We give a simple proof of the first Ramanujan-type congruences ${\bar{\mathcal{EO}}}$ (10n + 8) ≡ 0 (mod 5) given by Andrews.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.721-724
• /
• 2006

본 논문에서는 분할기법을 이용하여 디지털논리스위칭함수를 구성하는 한가지 방법을 제안하였다. 먼저, 디지털논리시스템에 대한 분할기법의 개념을 서술하였고, 본 논문에서 사용되는 각종 정의에 대해 논의하였다. 또한, 제안한 방법으로 구한 디지털논리스위칭함수를 회로설계하기 위해 먼저, 각각의 분할함수에 기초를 둔 Building Block(BB)을 구성에 대해 서술하였다. 그리고 이들 BB를 근간으로 회로설계하는 방법에 대해 논의하였다. 그리고 제안한 방법을 적용 예를 들어 그 결과를 기존의 방법과 비교 및 검토하였다. 그 결과 기존의 방법에 비해 효과적인 cost를 얻을 수 있었다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2014년도 추계학술대회 논문집
• /
• pp.690-692
• /
• 2014

To identify characterization of a simple extension chamber that have the two internal partition, produce the curve to estimate the transmission loss without the computer analysis. For helpful for internal optimum design, identify the characteristic of internal partition on transmission loss. Made estimated transmission loss curve by function of relationship of internal partition and transmission. Check the similarity of predicted transmission loss and analysis transmission loss. Usage of the predicted transmission loss made by relationship of internal partition and transmission loss is good information to place the internal partition so as to maximize the transmission loss on target frequency at optimal design on muffler.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• pp.357-364
• /
• 2006

The meshfree method is extended by the local partition of unity method to model the cohesive cracks in two dimensional continuum The shape function of a particle whose domain of influence is completely cut by a crack is enriched by the step enrichment function. If the domain of influence contains a crack tip inside, it is enriched by the branch enrichment function without the stress singularity. It is found that this method is more accurate and converges faster than the meshless methods for LEFM cracks based on the visibility concept Several staic and dynamic examples are solved to verify the method.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제23권3호
• /
• pp.205-221
• /
• 2016

We formulate the additive entropy of a natural number in terms of the additive partition function, and show that its multiplicative entropy is directly related to the multiplicative partition function. We give a practical formula for the multiplicative entropy of natural numbers with two prime factors. We use this formula to analyze the comparative density of additive and multiplicative entropy, prove that this density converges to zero as the number tends to infinity, and empirically observe this asymptotic behavior.

• Macromolecular Research
• /
• 제15권7호
• /
• pp.682-687
• /
• 2007

The equation of state developed herein is predicated on a hard-sphere reference with perturbations introduced via a potential function to account for electrostatic forces and for attraction between protein particles. During this process, the generalized Lennard-Jones (GLJ) pair potential function is employed. The GLJ pair potential function is employed to represent the protein-protein interaction in two-protein systems. Via the use of the relation between the equation of state and the chemical potential, the phase behavior in the aqueous two-protein system can be estimated. The partition coefficients can be obtained via these processes. The calculated values of the coefficients agree fairly well with the experimental data in the given pH and ionic strength range, with no additional adjustable model parameters.

• 대한화학회지
• /
• 제8권1호
• /
• pp.30-32
• /
• 1964

H. Eyring등의 액체의 구조에 관한 이론에 따라서 액체 사염화탄소의 partition function을 정하였다. 이 Partition function 에 쓰인 parameter $E_s,\;{\sigma},\;{\theta},\;V_s$ 등은 액체 안의 고체와 같은 분자의 고요한 값으로 새로운 방법$^{(4)}$으로 그 값들을 정하였다. 이렇게 정해진 Partition function을 써서 액체 사염화탄소의 몰부피, 증기압, 한계점, 증발엔트로피 및 표면장력 등을 계산하였다. 계산치와 실측치를 비교한 결과 몰부피와 증기압, 엔트로피의 값은 거의 일치하였다. 표면장력 또한 실험치와 좋은 일치를 보여주는 값을 얻었다.

• 한국결정성장학회지
• /
• 제11권6호
• /
• pp.264-268
• /
• 2001

표면계의 분배함수를 적절히 계산하여 유도하였다. 흡착등온식을 유도하였다. 유도된 흡작등온식의 분석을 통하여 표면상변이 현상은 흡착분자간에 강한 인력이 존재할 때 일어나는 것임을 보였다. 얻어진 이론적 결과는 실험 사실을 잘 설명한다는 것을 알수 있었다.

• 대한화학회지
• /
• 제8권2호
• /
• pp.65-67
• /
• 1964

H. Eyring등에 의하여 제안된 액체구조에 관한 이론에 따라서 액체의 partition function을 정하였다. parameter $E_S$, $V_S$, ${\theta}$, a는 앞서 저자들에 의해 제안된 방법에 의하여 정하였고, 이렇게 정해진 partition function을 써서 액체의 몰부피, 증기압, 한계점. 증발엔트로피 및 표면장력등을 계산한 결과 실측치와 잘 맞는 값을 얻었다.

• International journal of advanced smart convergence
• /
• 제8권3호
• /
• pp.46-53
• /
• 2019

When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.