• Title/Summary/Keyword: AOP.

Search Result 168, Processing Time 0.026 seconds

The Usefulness Analysis of Applying Dose Mode in Mammography Women of Childbearing Age (가임기 여성의 유방촬영에서 Dose mode 적용의 유용성 분석)

  • Lee, So-Ra;Son, Soon-Lyong;Chung, Jae-Yoen;Lee, Kwan-Seob
    • Korean Journal of Digital Imaging in Medicine
    • /
    • v.15 no.2
    • /
    • pp.19-23
    • /
    • 2013
  • Purpose : Automatic exposure system(AOP mode) in DR Mammography of the STD and DOSE apply to women of childbearing age, the average glandular dose(AGD) and image quality by comparing was to demonstrate the usefulness of DOSE. Materials and Methods : Of the under 40 age 108 patients who visit to our hospital and examined STD and DOSE mammography from January 2008 to July 2013. AGD was obtained by DICOM header information provided by GE Senographe DS. STD and DOSE images were evaluated with obtained patients, Image J program was compared by calculating the SNR. Results : The average AGD of DOSE mode was 0.99mGy, and which decreased by 19% comparing to that of STD mode which was 1.18mGy. The two the average AGDs indicated statistically significant difference(p< .01). The average SNR of STD was 40.26, DOSE displayed, and to 39.68 in, there was no statistical significance. Results : The average AGD using DOSE mode which is one of DR mammography AOP modes decreased by comparing to that of STD mode showing no difference in image quality. The use of DOSE is considered to be useful.

  • PDF

The Design of $GF(2^m)$ Multiplier using Multiplexer and AOP (Multiplexer와AOP를 적응한 $GF(2^m)$ 상의 승산기 설계)

  • 변기영;황종학;김흥수
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.40 no.3
    • /
    • pp.145-151
    • /
    • 2003
  • This study focuses on the hardware implementation of fast and low-complexity multiplier over GF(2$^{m}$ ). Finite field multiplication can be realized in two steps: polynomial multiplication and modular reduction using the irreducible polynomial and we will treat both operation, separately. Polynomial multiplicative operation in this Paper is based on the Permestzi's algorithm, and irreducible polynomial is defined AOP. The realization of the proposed GF(2$^{m}$ ) multipleker-based multiplier scheme is compared to existing multiplier designs in terms of circuit complexity and operation delay time. Proposed multiplier obtained have low circuit complexity and delay time, and the interconnections of the circuit are regular, well-suited for VLSI realization.

Aspect module design for dynamic event based RFID system (동적 이벤트 처리 기반의 RFID 시스템을 위한 애스펙트 모듈 설계)

  • Park, Sei-Seung;Hwang, Hee-Joung;Choi, Jin-Tak
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.10 no.2
    • /
    • pp.11-25
    • /
    • 2006
  • The current RFID middleware standard is ALE (Application Level Event) of EPCglobal that takes the lead in RFID standardization. ALE suggests the minimal interface and extension points so that it can be operated independently from system infrastructure, and actual implementation is left to vendors. But there is no specific mention with regard to functional extension through extension points, and It is very hard to extend or modify the function on running system. To solve this problem, we suggest AOP (Aspect Oriented Programming)-based ALE middleware framework for developing RFID middleware. In addition, we designed aspect for RFID middleware for implementing and extending functions according to ALE rules and for the convenience of maintenance.

  • PDF

Design of $AB^2 $ Multiplier for Public-key Cryptosystem (공개키 암호 시스템을 위한 $AB^2 $곱셈기 설계)

  • 김현성;유기영
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.2
    • /
    • pp.93-98
    • /
    • 2003
  • This paper presents two new algorithms and their architectures for $AB^2 $ multiplication over $GF(2^m)$.First, a new architecture with a new algorithm is designed based on LFSR (Linear Feedback Shift Register) architecture. Furthermore, modified $AB^2 $ multiplier is derived from the multiplier. The multipliers and the structure use AOP (All One Polynomial) as a modulus, which hat the properties of ail coefficients with 1. Simulation results thews that proposed architecture has lower hardware complexity than previous architectures. They could be. Therefore it is useful for implementing the exponential ion architecture, which is the tore operation In public-key cryptosystems.

A Study on the Dye Wastewater Treatment Using TiO2 Photocatalyst/Ozonation (광촉매/오존을 이용한 염색폐수처리에 관한 연구)

  • Kim, Chang-Kyun;Chung, Ho-Jin;Kim, Jong-Suk
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.21 no.6
    • /
    • pp.663-670
    • /
    • 2007
  • This study was performed to provide basic information for evaluating the efficiency and applicable extent of photocatalysis and ozonation for the treatment of dye wastewater. The treatability of dye wastewater by $UV/TiO_2$ and $UV/TiO_2/O_3$ advanced oxidation process (AOP) was investigated under various conditions. The experiments were conducted in a batch reactor of 50 liters equipped with twelve UV Lamps of 16W. In $UV/TiO_2$ AOP, the removal efficiency of TCODMn and Color increased to 58% and 67% respectively with increasing UV intensity. Also, The removal efficiency of TCODMn and Color increased to 97% and 99% respectively with increasing $H_2O_2$. Acid area was more efficient than neutral and alkalic areas in wastewater treatment, and pH 5 was the most effective and the treatment efficiency continually increased as the amount of photocatalyst was increased. When the photocatalyst was increased, TCODMn was removed faster than Color.

A Relationship Management Service for Consistent References Between Domain Objects (도메인객체의 일관성 있는 참조를 위한 연관정보 관리 서비스)

  • Choi, Yun-Seok
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.129-136
    • /
    • 2007
  • The domain model pattern which belongs to enterprise architecture patterns has reusability, scalability and maintainability. To use the domain model pattern, mapping with persistency layer, transaction management and various services are needed. This paper proposes that relationship management service to solve a consistency error which arises in case of removing domain objects. The proposed relationship management service monitors methods of domain objects and intercepts the flow of control to solve the reference errors. This service is implemented by using AOP(Aspect-Oriented Programming), so it can provide the service without modifications of domain objects and other services.

  • PDF

Development of Plant Abnormal Status Response System by Multi-Alarm Pattern in Main Control Room (원자력발전소 주제어실 다중 경보 패턴에 의한 경보/비정상 대응 체계 개발)

  • Choi, Sun Yeong;Jung, Wondea
    • Journal of the Korean Society of Safety
    • /
    • v.29 no.3
    • /
    • pp.129-135
    • /
    • 2014
  • The number of abnormal operation procedures (AOPs) for mitigating a plant abnormal status amounts to about one hundreds for the most of 1000MWe optimized power plant (OPR1000) and it is expected that the number of AOPs would be increased to cope with an abnormal status occurred newly. However, it is not well organized for operators to select a proper AOP from alarms occurred in main control room (MCR) during a plant abnormal status. It may be a burden to operators since the selection of AOP to respond an abnormal status is authorized by operators. When multiple alarms occur in MCR, it would take more time to respond them than a single alarm. To reduce the efforts, various MCR operation support systems have been developed. The purpose of this study was to develop a multi-alarm pattern card to select an appropriate AOP effectively when multiple alarms occurs in a single upper layout (UL) of MCR. It can be applied for an operation support tool as well as an education tool.

Cellular Automata based on VLSI architecture over GF($2^m$) (GF($2^m$)상의 셀룰라 오토마타를 이용한 VLSI 구조)

  • 전준철;김현성;이형목;유기영
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.87-94
    • /
    • 2002
  • This study presents an MSB(Most Significant Bit) Int multiplier using cellular automata, along with a new MSB first multiplication algorithm over GF($2^m$). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of a PBCA(Periodic Boundary Cellular Automata) and with the property of irreducible AOP(All One Polynomial). The proposed multiplier can be used in the effectual hardware design of exponentiation architecture for public-key cryptosystem.

Expansion of Water Reuse Facility for Building Unit to Solve Water Shortage Problem (물 부족 문제의 해결을 위한 건축물 단위의 물재이용 시설 확대 방안)

  • Park, Yong-hwa;Shim, In-tae;Kim, Hyun-jin;Jang, Am
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.39 no.7
    • /
    • pp.377-384
    • /
    • 2017
  • This study examined the possibility of solving the water shortage problem through the water reuse of buildings through the Suwon water reuse (greywater) facility installation project conducted as a pilot project of Ministry of Environment. Water reuse of individual building units can reduce city water demand by up to 25%. This is a level that can solve the water shortage problem in Korea. However, in order to revitalize the water reuse facilities of individual buildings, it is necessary to solve the problem of the user's rejection of the greywater and the economical problems. The resolution of the user's rejection can be solved by linking the MBR process with the AOP process. When the MBR process and the AOP process are operated in conjunction with each other, it is found that the users do not feel the water quality difference with the tap water. Economical problems can be solved at the water rate levels when the facility capacity is over 100 ton/day considering the construction cost and the operation cost, and when the operation cost alone is over 15 ton/day. Furthermore, when considering the social benefit cost, it is found that profit is generated from 150 ton/day.

$AB^2$ Semi-systolic Architecture over GF$GF(2^m)$ ($GF(2^m)$상에서 $AB^2$ 연산을 위한 세미시스톨릭 구조)

  • 이형목;전준철;유기영;김현성
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.2
    • /
    • pp.45-52
    • /
    • 2002
  • In this contributions, we propose a new MSB(most significant bit) algorithm based on AOP(All One Polynomial) and two parallel semi-systolic architectures to computes $AB^2$over finite field $GF(2^m)$. The proposed architectures are based on standard basis and use the property of irreducible AOP(All One Polynomial) which is all coefficients of 1. The proposed parallel semi-systolic architecture(PSM) has the critical path of $D_{AND2^+}D_{XOR2}$ per cell and the latency of m+1. The modified parallel semi-systolic architecture(WPSM) has the critical path of $D_{XOR2}$ per cell and has the same latency with PSM. The proposed two architectures, PSM and MPSM, have a low latency and a small hardware complexity compared to the previous architectures. They can be used as a basic architecture for exponentiation, division, and inversion. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation. They can be used as a basic architecture for algorithms, such as the Diffie-Hellman key exchange scheme, the Digital Signature Algorithm(DSA), and the ElGamal encryption scheme which are needed exponentiation operation. The application of the algorithms can be used cryptosystem implementation based on elliptic curve.