• 천문학회지
• /
• 제48권3호
• /
• pp.165-175
• /
• 2015

We investigate physical properties of the nearby (∼ 7.5 pc) astrometric binary μ Cas in the context of standard evolutionary theory. Based on the spectroscopically determined relative abundances ([α/Fe] ≳ +0.4 dex, [Fe/H] ∼ −0.7 dex), all physical inputs such as opacities and equation of state are consistently generated. By combining recent spectroscopic analyses with the astrometric observations from the HIPPARCOS parallaxes and the CHARA array, the evolutionary model grids have been constructed. Through the statistical evaluation of the χ²-minimization among alternative models, we find a reliable evolutionary solution (M_A, M_B, t_age) = (0.74 M_⊙, 0.19 M_⊙, 11 Gyr) which excellently satisfies observational constraints. In particular, we find that the helium abundance of μ Cas is comparable with the primordial helium contents (Y_p ∼ 0.245). On the basis of the well-defined stellar parameters of the primary star, the internal structure and the p-mode frequencies have been estimated. From our seismic computation, μ Cas is expected to have a first order spacing ∆ν ∼ 169 μHz. The ultimate goal of this study is to describe physical processes inside a low-mass star through a complete modelling from the spectroscopic observation to the evolutionary computation.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권1호
• /
• pp.44-57
• /
• 2016

Rectification is used as a preprocessing to reduce the computation complexity of disparity estimation. However, rectification also requires a complex computation. To minimize the computing complexity, rectification using a lookup-table (R-LUT) has been introduced. However, since, the R-LUT consumes large amount of memory, rectification with compressed LUT (R-CLUT) has been introduced. However, the more we reduce the memory consumption, the more we need decoding overhead. Therefore, we need to attain an acceptable trade-off between the size of LUT and decoding overhead. In this paper, we present such a trade-off by adaptively combining simple coding methods, such as differential coding, modified run-length coding (MRLE), and Huffman coding. Differential coding is applied to transform coordinate data into a differential form in order to further improve the coding efficiency along with Huffman coding for better stability and MRLE for better performance. Our experimental results verified that our coding scheme yields high performance with maintaining robustness. Our method showed about ranging from 1 % to 16 % lower average inverse of compression ratio than the existing methods. Moreover, we maintained low latency with tolerable hardware overhead for real-time implementation.

• 한국전산유체공학회지
• /
• 제20권1호
• /
• pp.10-15
• /
• 2015

In this study, the characteristics of water treatment mixer with various propeller profiles are numerically invesitgated. The computation was conducted by solving the incompressible Navier-Stokes equations on unstructured tetrahedral elements with k-${\varepsilon}$ turbulence model. It was found that the spreading angle and swirl magnitude of the jet are important factors for the mixer efficiency, since they clearly characterize the propeller and the frontal surface area of the propeller but not so much affected by the skew angle if it exceeds 30 degrees. The case1 and case2 models are found to show the best propeller efficiency. The case2 with low blade angle, however, requires the lowest power input for the same discharge capacity as the case1.

• 한국정보과학회논문지:정보통신
• /
• 제31권2호
• /
• pp.179-187
• /
• 2004

대칭형 패스워드 기반의 인증 및 키교환 프로토콜은 비대칭형 프로토콜보다 설계, 분석, 효율면에서 더 좋은 성질을 가진다. 하지만, 인증 서버가 공격당하는 경우 대칭형 인증 프로토콜은 쉽게 사용자의 패스워드가 노출된다. 비대칭형의 안전성 증명을 가지는 PAK-X나 SNAPI-X같은 프로토콜이 제안되었지만, Diffie-Hellman 키교환에 비해 많은 연산을 필요로 하고 있다. 이 논문에서는 패스워드 기반의 대칭형 인중 및 키교환 프로토콜을 비대칭형 프로토콜로 변환하는 효율적인 방법을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.924-944
• /
• 2017

Telecare Medical Information System (TMIS) helps the patients to gain the health monitoring information at home and access medical services over the mobile Internet. In 2015, Das et al proposed a secure and robust user AKA scheme for hierarchical multi-medical server environment in TMIS, referred to as DAKA protocol, and claimed that their protocol is against all possible attacks. In this paper, we first analyze and show DAKA protocol is vulnerable to internal attacks, impersonation attacks and stolen smart card attack. Furthermore, DAKA protocol also cannot provide confidentiality. We then propose a lightweight pseudonym AKA protocol for multi-medical server architecture in TMIS (short for PAKA). Our PAKA protocol not only keeps good security features declared by DAKA protocol, but also truly provides patient's anonymity by using pseudonym to protect sensitive information from illegal interception. Besides, our PAKA protocol can realize authentication and key agreement with energy-saving, extremely low computation cost, communication cost and fewer storage resources in smart card, medical servers and physical servers. What's more, the PAKA protocol is proved secure against known possible attacks by using Burrows-Abadi-Needham (BAN) logic. As a result, these features make PAKA protocol is very suitable for computation-limited mobile device.

• 전자통신동향분석
• /
• 제33권5호
• /
• pp.121-134
• /
• 2018

The Von Neumann based architecture of the modern computer has dominated the computing industry for the past 50 years, sparking the digital revolution and propelling us into today's information age. Recent research focus and market trends have shown significant effort toward the advancement and application of artificial intelligence technologies. Although artificial intelligence has been studied for decades since the Turing machine was first introduced, the field has recently emerged into the spotlight thanks to remarkable milestones such as AlexNet-CNN and Alpha-Go, whose neural-network based deep learning methods have achieved a ground-breaking performance superior to existing recognition, classification, and decision algorithms. Unprecedented results in a wide variety of applications (drones, autonomous driving, robots, stock markets, computer vision, voice, and so on) have signaled the beginning of a golden age for artificial intelligence after 40 years of relative dormancy. Algorithmic research continues to progress at a breath-taking pace as evidenced by the rate of new neural networks being announced. However, traditional Von Neumann based architectures have proven to be inadequate in terms of computation power, and inherently inefficient in their processing of vastly parallel computations, which is a characteristic of deep neural networks. Consequently, global conglomerates such as Intel, Huawei, and Google, as well as large domestic corporations and fabless companies are developing dedicated semiconductor chips customized for artificial intelligence computations. The AI Processor Research Laboratory at ETRI is focusing on the research and development of super low-power AI processor chips. In this article, we present the current trends in computation platform, parallel processing, AI processor, and super-threaded AI processor research being conducted at ETRI.

• 한국환경과학회지
• /
• 제24권4호
• /
• pp.383-391
• /
• 2015

As occurrence of gradually increasing extreme temperature events in Jeju Island, a hybrid downscaling technique that simultaneously applies by dynamical method and statistical method has implemented on design rainfall in order to reduce flood damages from severe storms and typhoons.As a result of computation, Case 1 shows a strong tendency to excessively compute rainfall, which is continuously increasing. While Case 2 showed similar trend as Case 1, low design rainfall has computed by rainfall in A1B scenario. Based on the design rainfall computation method mainly used in Preventive Disaster System through Pre-disaster Effect Examination System and Basic Plan for River of Jeju Island which are considering climatic change for selecting 50-year and 100-year frequencies. Case 3 selecting for Jeju rain gage station and Case 1 for Seogwipo rain gage station. The results were different for each rain gage station because of difference in rainfall characteristics according to recent climatic change, and the risk of currently known design rainfall can be increased in near future.

• 전기학회논문지
• /
• 제65권3호
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• Journal of Communications and Networks
• /
• 제17권6호
• /
• pp.582-591
• /
• 2015

A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

• 대한임베디드공학회논문지
• /
• 제10권5호
• /
• pp.281-296
• /
• 2015

This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.