• Title/Summary/Keyword: Processing Trade

Search Result 314, Processing Time 0.024 seconds

An Analysis on Structure of Risk Factor for Maritime Terror using FSM and AHP (해상테러 위험요소의 구조와 우선순위 분석)

  • Jang Woon-Jae;Yang Won-Jae;Keum Jong-Soo
    • Journal of Navigation and Port Research
    • /
    • v.29 no.6 s.102
    • /
    • pp.487-493
    • /
    • 2005
  • Since the destruction of World Trade Center the attention of the United States and the wider international community has focussed upon the need to strengthen security and prevent terrorism This paper suggests an analysis prior to risk factor and structure for anti-terrorism in the korean maritime society. For this, in this paper, maritime terror risk factor was extracted by type and case of terror using brainstorming method. Also, risk factor is structured by FSM method and analyzed for ranking of each risk factor by AHP. At the result, the evaluation of risk factor is especially over maximum factor for related external impact.

Scalable multiplier and inversion unit on normal basis for ECC operation (ECC 연산을 위한 가변 연산 구조를 갖는 정규기저 곱셈기와 역원기)

  • 이찬호;이종호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.12
    • /
    • pp.80-86
    • /
    • 2003
  • Elliptic curve cryptosystem(ECC) offers the highest security per bit among the known publick key system. The benefit of smaller key size makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper, we propose a new multiplier structure with configurable output sizes and operation cycles. The number of output bits can be freely chosen in the new architecture with the performance-area trade-off depending on the application. Using the architecture, a 193-bit normal basis multiplier and inversion unit are designed in GF(2$^{m}$ ). It is implemented using HDL and 0.35${\mu}{\textrm}{m}$ CMOS technology and the operation is verified by simulation.

Some Future Issues of Republic of Korea's National Strategy: Land-oriented or Maritime-oriented Character? (미래 한국 국가전략 : 대륙인가 해양인가?)

  • Choi, Jae-Sun;Kim, Min-Soo
    • Strategy21
    • /
    • s.36
    • /
    • pp.121-149
    • /
    • 2015
  • This paper will examine some past and current issues concerning the Republic of Korea's national strategy, focusing predominantly upon how the ROK should respond to the urgent maritime-oriented strategy highlighted by the recent developments and achievements of national prosperity achieved during last three decades and identify some of successful cases in East Asia. Some consideration will also be given to more general emergent issues of trends and developments of East Asian countries which might affect to define the ROK's future national strategy in the context of its national grand strategy to enhance national interests and prosperity. ROK is especially dependent upon open Sea Lanes of Communication (SLOC) and its national security emphasizes the sea as the medium of geopolitical and geo-economic development, given the sea known as core geographic option remains that ROK is an important maritime power, ranking the world-level nation in term of GDP, sea-borne trade, container processing capability, shipbuilding capacity and so on. It should be apparent, therefore, that ROK's national strategic development depends upon the relationship between its peninsula geography and its national development based on sea-borne economic growth and its maritime-oriented future national strategy will be the best option to maintain its national development and economic prosperity.

An Adaptive Search Range Decision Algorithm for Fast Motion Estimation using Local Statistics of Neighboring Blocks (고속 움직임 추정을 위한 인접 블록 국부 통계 기반의 적응 탐색 영역 결정 방식)

  • 김지희;김철우;김후종;홍민철
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.310-316
    • /
    • 2002
  • In this paper, we propose an adaptive search range decision algorithm for fast motion estimation of video coding. Block matching algorithm for motion vector estimation that improves coding efficiency by reduction of temporal redundancy has trade-off problem between the motion vector accuracy and the complexity. The proposed algorithm playing as a pre-processing of fast motion estimation adaptively determines the motion search range by the local statistics of neighboring motion vectors. resulting in dramatic reduction of the computational cost without the loss of coding efficiency. Experimental results show the capability of the proposed algorithm.

Problems in the Dietary Exposure Assessment of Pesticide Residues (식품중 잔류농약에 의한 인체피폭 평가에서의 문제점)

  • Lee, Mi-Gyung;Lee, Su-Rae
    • Korean Journal of Environmental Agriculture
    • /
    • v.12 no.3
    • /
    • pp.255-263
    • /
    • 1993
  • The demand of safety assessment for pesticide residues in foods is growing in Korea. In order to assess the actual dietary exposure toward pesticide residues, the problems in utilization of pesticide residue data were reviewed and optimization of food factors applicable to Korean population was conducted. The problems and current status in setting pesticide residue tolerance-domestic and foreign-in foods were also argued. The conclusion is summarized as follows: (1) Anticipated residue estimates(ARE) calculated from field trial residue data, the percentage of crop treated, and the effects of cooking or processing should be utilized for dietary exposure assessment in a real sense. (2) Average daily intake of total foods per person in Korea was 1,104g in 1970's and 1,240g in 1980's. Much variation was observed between the two decades by food commodities. (3) Pesticide residue tolerances in Korea have been established at relatively lower levels in comparison with FAO/WHO or western countries. More extensive studies and data accumulation as related to tolerance setting are called for in future for the sake of health protection and smooth interstate trade.

  • PDF

The Effect of Contextual Factors on Resistance to Change in Lean Transformation

  • TRAN, Duc Trong;PHAM, Huong Thu;BUI, Van Thu
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.11
    • /
    • pp.479-489
    • /
    • 2020
  • The purpose of this paper is to uncover whether and how contextual factors (information exchange, participation, trust in management, and training), relate to resistance to change. It also explores the mediating effect of perceived impact of change on the relations between contextual factors and resistance to change. This study is conducted in several manufacturing plants in food processing industry in Vietnam, which is implementing a top-down large-scale change - Lean transformation, adopting Total Productive Maintenance (TPM) program, to be specific. The findings suggest that all four contextual factors are negatively associated with resistance to change, in which training had the strongest impact. Also, the perceived change impact partially mediates the relationships between the four contextual factors and resistance to change. The practical implications of this paper are that employees who receive adequate, timely and useful information relating to change are less likely to show opposing behaviors towards change. Fostering trust in management among employees, and employee involvement in decision-making, also have a significant influence when addressing employee resistance to change. Employees who are well-trained, well-equipped with tools and knowledge about the change, are less likely to resist as they view the benefits of changes more significant than the risks.

Implementation of the MPEG-1 Layer II Decoder Using the TMS320C64x DSP Processor (TMS320C64x 기반 MPEG-1 LayerII Decoder의 DSP 구현)

  • Cho, Choong-Sang;Lee, Young-Han;Oh, Yoo-Rhee;Kim, Hong-Kook
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.257-258
    • /
    • 2006
  • In this paper, we address several issues in the real time implementation of MPEG-1 Layer II decoder on a fixed-point digital signal processor (DSP), especially TMS320C6416. There is a trade-off between processing speed and the size of program/data memory for the optimal implementation. In a view of the speed optimization, we first convert the floating point operations into fixed point ones with little degradation in audio quality, and then the look-up tables used for the inverse quantization of the audio codec are forced to be located into the internal memory of the DSP. And then, window functions and filter coefficients in the decoder are precalculated and stored as constant, which makes the decoder faster even larger memory size is required. It is shown from the real-time experiments that the fixed-point implementation enables us to make the decoder with a sampling rate of 48 kHz operate with 3 times faster than real-time on TMS320C6416 at a clock rate of 600 MHz.

  • PDF

Fast Spectrum Sensing with Coordinate System in Cognitive Radio Networks

  • Lee, Wilaiporn;Srisomboon, Kanabadee;Prayote, Akara
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.491-501
    • /
    • 2015
  • Spectrum sensing is an elementary function in cognitive radio designed to monitor the existence of a primary user (PU). To achieve a high rate of detection, most techniques rely on knowledge of prior spectrum patterns, with a trade-off between high computational complexity and long sensing time. On the other hand, blind techniques ignore pattern matching processes to reduce processing time, but their accuracy degrades greatly at low signal-to-noise ratios. To achieve both a high rate of detection and short sensing time, we propose fast spectrum sensing with coordinate system (FSC) - a novel technique that decomposes a spectrum with high complexity into a new coordinate system of salient features and that uses these features in its PU detection process. Not only is the space of a buffer that is used to store information about a PU reduced, but also the sensing process is fast. The performance of FSC is evaluated according to its accuracy and sensing time against six other well-known conventional techniques through a wireless microphone signal based on the IEEE 802.22 standard. FSC gives the best performance overall.

A novel hardware design for SIFT generation with reduced memory requirement

  • Kim, Eung Sup;Lee, Hyuk-Jae
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.13 no.2
    • /
    • pp.157-169
    • /
    • 2013
  • Scale Invariant Feature Transform (SIFT) generates image features widely used to match objects in different images. Previous work on hardware-based SIFT implementation requires excessive internal memory and hardware logic [1]. In this paper, a new hardware organization is proposed to implement SIFT with less memory and hardware cost than the previous work. To this end, a parallel Gaussian filter bank is adopted to eliminate the buffers that store intermediate results because parallel operations allow all intermediate results available at the same time. Furthermore, the processing order is changed from the raster-scan order to the block-by-block order so that the line buffer size storing the source image is also reduced. These techniques trade the reduction of memory size with a slight increase of the execution time and external memory bandwidth. As a result, the memory size is reduced by 94.4%. The proposed hardware for SIFT implementation includes the Descriptor generation block, which is omitted in the previous work [1]. The addition of the hardwired descriptor generation improves the computation speed by about 30 times when compared with the previous work.

Evaluation of Feature Extraction and Matching Algorithms for the use of Mobile Application (모바일 애플리케이션을 위한 특징점 검출 연산자의 비교 분석)

  • Lee, Yong-Hwan;Kim, Heung-Jun
    • Journal of the Semiconductor & Display Technology
    • /
    • v.14 no.4
    • /
    • pp.56-60
    • /
    • 2015
  • Mobile devices like smartphones and tablets are becoming increasingly capable in terms of processing power. Although they are already used in computer vision, no comparable measurement experiments of the popular feature extraction algorithm have been made yet. That is, local feature descriptors are widely used in many computer vision applications, and recently various methods have been proposed. While there are many evaluations have focused on various aspects of local features, matching accuracy, however there are no comparisons considering on speed trade-offs of recent descriptors such as ORB, FAST and BRISK. In this paper, we try to provide a performance evaluation of feature descriptors, and compare their matching precision and speed in KD-Tree setup with efficient computation of Hamming distance. The experimental results show that the recently proposed real valued descriptors such as ORB and FAST outperform state-of-the-art descriptors such SIFT and SURF in both, speed-up efficiency and precision/recall.