• Korean Journal of Culture and Social Issue
• /
• v.14 no.1
• /
• pp.101-123
• /
• 2008

We investigated the implicit representations of success/failure associated with mother in male and female college students. In study 1, participants were presented 'mother' or 'basket' as a context prime and 'success' or 'failure' related words as second primes for 100ms, and were asked to make lexical decisions about 'accept' or 'reject' related words and non-words after 150 ms (SOA 250ms). Results revealed that lexical decision times on the mother condition were more rapid than the ones on the basket condition, and lexical decision times on the acceptance condition were more rapid than the ones on the rejection condition, and female participants showed shorter times than male students did. In study 2, we divided participants into four groups by gender and attachment style, Results showed that the interaction between success/failure and acceptance/rejection was statistically significant, that is, quickest lexical decision times on the success-acceptance condition, and slowed times on failure-acceptance, failure-rejection, and success-rejection condition in order. On the other hand, no significant differences between high and low attachment group were found in males, but significant three-way interactions were found in females. In highly attached females, lexical decision times in success-acceptance condition were not differed from ones in success-rejection condition, and slowed times in failure-rejection condition. Low attached females showed very rapid times in success-acceptance condition, but very slow times in success-rejection condition. The results were discussed in terms of self-positivity and success/failure scheme depending on gender and attachment styles.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.101-109
• /
• 2011

The Riemann's zeta function $\zeta(s)$ has been known as answer for a number of primes $\pi$(x) less than given number x. In prime number theorem, there are another approximation function $\frac{x}{lnx}$,Li(x), and R(x). The error about $\pi$(x) is R(x) < Li(x) < $\frac{x}{lnx}$. The logarithmic integral function is Li(x) = $\int_{2}^{x}\frac{1}{lnt}dt$ ~ $\frac{x}{lnx}\sum\limits_{k=0}^{\infty}\frac{k!}{(lnx)^k}=\frac{x}{lnx}(1+\frac{1!}{(lnx)^1}+\frac{2!}{(lnx)^2}+\cdots)$. This paper shows that the $\pi$(x) can be represent with finite Li(x), and presents generalized prime counting function $\sqrt{{\alpha}x}{\pm}{\beta}$. Firstly, the $\pi$(x) can be represent to $Li_3(x)=\frac{x}{lnx}(\sum\limits_{t=0}^{{\alpha}}\frac{k!}{(lnx)^k}{\pm}{\beta})$ and $Li_4(x)=\lfloor\frac{x}{lnx}(1+{\alpha}\frac{k!}{(lnx)^k}{\pm}{\beta})}k\geq2$ such that $0{\leq}t{\leq}2k$. Then, $Li_3$(x) is adjusted by $\pi(x){\simeq}Li_3(x)$ with ${\alpha}$ and error compensation value ${\beta}$. As a results, this paper get the $Li_3(x)=Li_4(x)=\pi(x)$ for $x=10^k$. Then, this paper suggests a generalized function $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$. The $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$ function superior than Riemann's zeta function in representation of prime counting.