• Title/Summary/Keyword: 정보 불균형

Search Result 593, Processing Time 0.03 seconds

KOSDAQ Firm's Cyber IR Activity and Stock Price Behavior (코스닥 기업의 사이버 IR과 주가행태)

  • Song, Myung-Gyu;Cho, Jun-Hee;Kim, Chan-Jung
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.2
    • /
    • pp.388-397
    • /
    • 2012
  • Recently, KOSDAQ company's cyber IR activities has increased. Major advantages offered by the Internet include low cost and high accessibility the Internet is used as a strategic tool of many KOSDAQ companies in IR activity. Thus, this study tried to empirically analyze the overall impact of cyber IR. And this study examine the difference in impact of cyber IR activity on stock prices in the period before and after depending on ownership structure and venture or not. The main result of the study can be summarized as follows. First, IR activities have a positive impact on KOSDAQ firms stock price. This means that the investors are recognizing IR activity of KOSDAQ firm as a good news. Second, The lower stock ownership have great impact on stock prices. The act of reporting and monitoring system are performing effectively to lower stock ownership as compared with higher stock ownership. Third, The return rate of KOSDAQ venture firms with IR enforcement effect appears high than KOSDAQ firms with IR enforcement.

WDMA protocol with collision avidance for high speed optical networks (고속 광통신망에서 충돌 회피를 위한 파장 분할 다중 액세스 프로토콜)

  • 이호숙;최형원;박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.664-674
    • /
    • 1996
  • In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

  • PDF

Online Hard Example Mining for Training One-Stage Object Detectors (단-단계 물체 탐지기 학습을 위한 고난도 예들의 온라인 마이닝)

  • Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.5
    • /
    • pp.195-204
    • /
    • 2018
  • In this paper, we propose both a new loss function and an online hard example mining scheme for improving the performance of single-stage object detectors which use deep convolutional neural networks. The proposed loss function and the online hard example mining scheme can not only overcome the problem of imbalance between the number of annotated objects and the number of background examples, but also improve the localization accuracy of each object. Therefore, the loss function and the mining scheme can provide intrinsically fast single-stage detectors with detection performance higher than or similar to that of two-stage detectors. In experiments conducted with the PASCAL VOC 2007 benchmark dataset, we show that the proposed loss function and the online hard example mining scheme can improve the performance of single-stage object detectors.

A Study on the Link Cost Estimation for Data Reliability in Wireless Sensor Network (무선 센서 네트워크에서 데이터 신뢰성을 위한 링크 비용 산출 방안에 관한 연구)

  • Lee, Dae-hee;Cho, Kyoung-woo;Kang, Chul-gyu;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.571-573
    • /
    • 2018
  • Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

  • PDF

Effective Parallel Hash Join Algorithm Based on Histoftam Equalization in the Presence of Data Skew (데이터 편재 하에서 히스토그램 변환기법에 기초한 효율적인 병렬 해쉬 결합 알고리즘)

  • Park, Ung-Gyu;Choe, Hwang-Gyu;Kim, Tak-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.338-348
    • /
    • 1997
  • In this pater, we first propose a data distribution framework to resolve load imbalance and bucket oerflow in parallel hash join.Using the histogram equalization technique, the framework transforms a histogram of skewed data to the desired uniform distribution that corresponds to the relative computing power of node processors in the system.Next we propose an effcient parallel hash join algorithm for handing skwed data based on the proposed data distribution methodology.For performance comparison of our algorithm with other hash join algorithms.we perform similation experiments and actual exeution on COREDB database computer with 8-node hyperube architecture. In these experiments, skwed data distebution of the join atteibute is modeled using a Zipf-like distribution.The perfomance studies undicate that our algorithm outperforms other algorithms in the skewed cases.

  • PDF

Circuit Design of Parallel Power Operation Equipment for Peak Power Reduction (상전원의 피크치 전력 감소를 위한 전력병합장치 회로설계)

  • Yang, Jaesoo;Kim, Donghan;Kim, ManDo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.9
    • /
    • pp.273-278
    • /
    • 2014
  • Recent use of electricity during peak hours electricity supply-demand imbalance is inevitable that limit power use force. Therefore, in this paper, a circuit of parallel power operation equipment for peak power reduction which saves the power to electricity storage device during the non-peak power time and supply from the storage power during the expected power shortages time is designed Through this circuitry, the peak power of the commercial power supply with the parallel operation and connection of the commercial power supply and the power supply of the inverter from electricity storage that is a key feature of PRS(Peak power Reduction System) can be controlled. In addition, in order to increase the efficiency, a Transless Power Circuit DC-AC inverter is developed. Moreover, a variable impedance control is applied to the storage of electric power of an Uninterruptible Power Supply associated with a commercial power source.

A Method for Determining Sending Rates of Peers for Efficient Network Resource Utilization in P2P Environment (P2P 환경에서 효율적 망 자원 이용을 위한 피어의 송신률 결정 방법)

  • Park, Jaesung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.99-102
    • /
    • 2012
  • The performance of P2P application services may be improved by reducing unnecessary inter-network traffic through intelligent peer selection. However, since a logical link between peers in a P2P overlay network is composed of a set of physical links in an underlay network, the traffic pattern determined by the sending rates of selected peers imposes loads on each underlay links. Thus, if the sending rates are not determined carefully, the loads between underlay links may not be balanced, which means some links are underloaded while the other links are congested. In this paper, we take an optimization approach to determine the sending rates of peers strategically to avoid the inefficient use of underlay links. The proposed scheme also guarantee the minimum receiving rates of peers while minimizing the maximum link utilization of underlay links, which is beneficial both to P2P applications and an underlay network.

A Real-time Copper Foil Inspection System using Multi-thread (다중 스레드를 이용한 실시간 동판 검사 시스템)

  • Lee Chae-Kwang;Choi Dong-Hyuk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.499-506
    • /
    • 2004
  • The copper foil surface inspection system is necessary for the factory automation and product quality. The developed system is composed of the high speed line scan camera, the image capture board and the processing computer. For the system resource utilization and real-time processing, multi-threaded architecture is introduced. There are one image capture thread, 2 or more defect detection threads, and one defect communication thread. To process the high-speed input image data, the I/O overlap is used through the double buffering. The defect is first detected by the predetermined threshold. To cope with the light irregularity, the compensation process is applied. After defect detection, defect type is classified with the defect width, eigenvalue ratio of the defect covariance matrix and gray level of defect. In experiment, for high-speed input image data, real-time processing is possible with multi -threaded architecture, and the 89.4% of the total 141 defects correctly classified.

A New Cell Selection Scheme For Heterogeneous Mobile Communication Networks (이종 이동통신 네트워크를 위한 새로운 셀 선택 기법)

  • Ban, Tae-Won;Jung, Bang Chul;Jo, Jung-Yeon;Sung, Kil-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2397-2402
    • /
    • 2014
  • Recently, heterogeneous mobile communication network is attracting plenty of interest to serve explosively increasing mobile data traffic. Although the heterogeneous mobile communication network can enhance spatial reuse ratio by using both conventional macro cells and small cells simultaneously, it causes the unbalance in performance of downlink and uplink. In this paper, we propose a new cell selection scheme for heterogeneous mobile communication network. In the proposed cell selection scheme, mobiles select their home cells by considering both uplink and downlink performance, contrary to conventional schemes. We analyze the performance of the proposed scheme in terms of average cell transmission rate through system level simulations and compare it with those of conventional schemes.

An Algorithm For Load-Sharing and Fault-Tolerance In Internet-Based Clustering Systems (인터넷 기반 클러스터 시스템 환경에서 부하공유 및 결함허용 알고리즘)

  • Choi, In-Bok;Lee, Jae-Dong
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.215-224
    • /
    • 2003
  • Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.