• The Korean Journal of Financial Management
• /
• v.26 no.3
• /
• pp.103-138
• /
• 2009

In this article we examine a unique data set of intraday fair disclosure(FD) releases to shed light on market efficiency within the trading day. Specifically, this paper analyze the response of stock prices on fair disclosure disseminated in real-time through KIND(Korea Investor's Network for Disclosure) on Korea stock exchange during the period from January 2003 to September 2004. We find that the prices of stock experiences a statistically and economically significant increase beginning seconds after the fair disclosure is initially announced and lasting approximately two minutes. The stock price responds more strongly to fair disclosure on smaller firm but the response to fair disclosure on the largest firm stock is more gradual, lasting five minutes. We also examine the profitability of a short-term trading strategy based on dissemination of fair disclosure. After controlling for trading costs we find that trader who execute a trade following initial disclosure generate negative profits, but trader buying stock before initial disclosure realize statistically significant positive profit after two minute of disclosure. Summarizing overall results, our evidence supports that security prices on Korea stock exchange reflects all available information within two minutes and the Korea stock market is semi-strongly efficient enough that a trader cannot generate profits based on widely disseminated news unless he acts almost immediately.

• Korean Security Journal
• /
• no.43
• /
• pp.205-230
• /
• 2015

This study aims to compare the differences of crucial factors that are associated with probation warning tickets between sex offenders and non-sex offenders in South Korea. Serious high-profile cases have occurred in recent years which resulted in public and political conners for successful sex offender management and monitoring strategy through community corrections. The official response has been to initiate a series of legislative probation and parole measures by using GPS electronic monitoring system, chemical castration, and sex offender registry and notification. In this context, the current study is designed to explore the major factors that could affect the failure of probation by comparing the differences between sex offenders and non-sex offenders in terms of their major factors which are related to the failure of probation. The failure of probation is measured by the number of warning tickets which would be issued when there is the violation of probation conditions. The data is obtained from Seoul Probation office from January, 29, 2014 to February, 28, 2014. The sample number of sex offenders is 144 and the number of non-sex offenders is 1,460. The data includes the information regarding the offenders who completed their probation order after they were assigned to Seoul Probation in 2013. Furthermore, this study uses the chi-square and logistic regression analysis by using SPSS statistical package program. The result demonstrated that only prior criminal history was statistically significant factor that was related to the number of warning tickets in the sex offender group when other variables were controlled($X^2=25.15$, p<0.05, Nagelkerke $R^2=0.23$)(b=0.19, SE=0.08, p<0.05). By contrast, there were various factors that were associated with the number of warning tickets in non-sex offender group. Specifically, the logistic regression analysis for the non-sex offenders showed that demographic variable(marital status and employment type), offender-victim relationships, alcohol addiction, violent behavior, prior criminal history, community service order, and attendance order were statistically significant factors that were associated with the odds of warning tickets. Further policy implication will be discussed.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.