• Korean Journal of Agricultural and Forest Meteorology
• /
• v.13 no.2
• /
• pp.101-108
• /
• 2011

Climate change could have a pronounced impact on natural and agricultural ecosystems. To assess the impact of climate change, projected climate data have been used as inputs to models. Because such studies are conducted occasionally, it would be useful to employ Cloud computing, which provides multiple instances of operating systems in a virtual environment to do processing on demand without building or maintaining physical computing resources. Furthermore, it would be advantageous to use open source geospatial applications in order to avoid the limitations of proprietary software when Cloud computing is used. As a pilot study, Amazon Web Service ? Elastic Compute Cloud (EC2) was used to calculate the number of days with rain in a given month. Daily sets of climate projection data, which were about 70 gigabytes in total, were processed using virtual machines with a customized database transaction application. The application was linked against open source libraries for the climate data and database access. In this approach, it took about 32 hours to process 17 billion rows of record in order to calculate the rain day on a global scale over the next 100 years using ten clients and one server instances. Here I demonstrate that Cloud computing could provide the high level of performance for impact assessment studies of climate change that require considerable amount of data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.967-983
• /
• 2003

In wireless spread-spectrum communication systems utilizing PN (pseudo noise) sequences, a variety of noise sources from the channel affect the data reception performance. Among them, in this paper we are concerned with the narrowband interference that may arise from the use of the spectral bands overlapped by the existing narrowband users or the intentional jammers as in military communication. The effect of this interference can be reduced to some extent at the receiver with the PN demodulation by processing gain. It is known, however, that when the interferers are strong, the reduction cannot be sufficient and thereby requiring the extra use of narrowband interference cancellers (NIC's) at the receivers. A class of adaptive NIC's are studied here based on different two cost functions. One is the chip mean-squared error (MSE) computed prior to the PN demodulation and used in the conventional cancellers. Since thses conventional cancellers should be operated at the chip rate, the computational requirements are enormous. The other is the symbol MSE computed after the PN demodulation in which case the weights of the NIC's can be updated at a lot lower symbol rate. To compare the performance of these NIC's, we derive a common measure of performance, i.e., the symbol MSE after the PN demodulation. The analytical results are verified by computer simulation. As a result, it is shown that the cancellation capability of the symbol-rate NIC's are similar or better than the conventional one while the computational complexity can be reduced a lot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.103-112
• /
• 2010

In this paper, we propose a coarse and fine frequency synchronization method which is suitable for the 3GPP(3rd Generation Partnership Project) LTE(Long Term Evolution) FDD(Frequency Division Duplexing) / TDD(Time Division Duplexing) dual mode system. In general, PSS(Primary Synchronization Signal) correlation based estimation method and CP(Cyclic Prefix) correlation based tracking loop are applied for coarse and fine frequency synchronization in 3GPP LTE OFDMA(Orthogonal Frequency Division Multiple Access) system, respectively. However, the conventional coarse frequency synchronization method has performance degradation caused by fading channel and squaring loss. Also, the conventional fine frequency synchronization method cannot guarantee stable operation in TDD mode because of signal power difference between uplink and downlink subframe. Therefore, in this paper, we propose enhanced coarse and fine frequency synchronization methods which can estimate more accurately in multi-path fading channel and high speed channel environments and has stable operation for TDD frame structure, respectively. By computer simulation, we show that the proposed methods outperform the conventional methods, and verify that the proposed frequency synchronization method can guarantee stable operation in 3GPP LTE FDD/TDD dual mode downlink receiver.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.572-579
• /
• 2009

A monitoring system needs many parameters to increase devices for monitoring data and to support various services. In particular, monitoring the status of a device in a wireless mobile environment has a difficulty in displaying multi data in a limited screen size, and transfer of the status data of a device into a network is largely related with network traffic. The research aims at designing a control board that collects data in order to effectively manage a greenhouse environment system. Also, the research tries to appropriately operate devices, environment data monitoring, and the control of each device by realizing a multiplexed interface based on a web. Thus, in the case in which a distributed client was a computer, monitoring and control were obtained with a web browser through the Lab VIEW web server of a server or local control module in order to effectively monitor and control according to the status of a user. In the case in which a client was a PDA, application of a wireless mobile considering the scale and data processing capacity of a displayer was connected. As a result of the research, we could confirm a satisfactory outcome from the viewpoint of a human-centered design by supplying adaptability and mobility according to the environment of a user.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.145-154
• /
• 2018

A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2960-2965
• /
• 2013

Customized services for individuals in analysis of recently collected GPS information have been investigated in various aspects. As the size of collected GPS data gets larger, a variety of services is being released accordingly. Existing studies, however, are limited to presenting service models for users while there is little study on developing intelligent computing technologies in the introduction of GPS information into the system. This study suggests an algorithm to analyze traffic information by introducing GPS information into the system in order to take the lead among intelligent computing technologies. The suggested algorithm analyzes a map by means of the collected vehicle GPS information and sectional traffic information interpretation method; thus, the computer judges the traffic information collected by humans. The experiment result shows that the traffic information was properly analyzed upon the utilization of the given data. Although a small quantity of analyzed data was less reliable, the system maintained high reliability as the data was sufficient.

• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1228-1238
• /
• 2003

This paper presents a new and practical method based on computer vision for detecting the monitor position where the user is looking. In general, the user tends to move both his face and eyes in order to gaze at certain monitor position. Previous researches use only one wide view camera, which can capture a whole user's face. In such a case, the image resolution is too low and the fine movements of user's eye cannot be exactly detected. So, we implement the gaze detection system with dual camera systems(a wide and a narrow view camera). In order to locate the user's eye position accurately, the narrow view camera has the functionalities of auto focusing and auto panning/tilting based on the detected 3D facial feature positions from the wide view camera. In addition, we use dual R-LED illuminators in order to detect facial features and especially eye features. As experimental results, we can implement the real-time gaze detection system and the gaze position accuracy between the computed positions and the real ones is about 3.44 cm of RMS error.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.155-162
• /
• 2013

Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

• Journal of the Mineralogical Society of Korea
• /
• v.30 no.4
• /
• pp.161-172
• /
• 2017

Clay minerals play a major role in the geochemical cycles of metals in the Critical Zone, the Earth surface-layer ranging from the groundwater bottom to the tree tops. Atomistic scale research of the very fine particles can help understand the fundamental mechanisms of the important geochemical processes and possibly apply to development of hybrid nanomaterials. Molecular dynamics (MD) simulations can provide atomistic level insights into the crystal structures of clay minerals and the chemical reactivity. Classical MD simulations use a force field which is a parameter set of interatomic pair potentials. The ClayFF force field has been widely used in the MD simulations of dioctahedral clay minerals as the force field was developed mainly based on dioctahedral phyllosilicates. The ClayFF is often used also for trioctahedral mineral simulations, but disagreement exits in selection of the interatomic potential parameters, particularly for Mg atom-types of the octahedral sheet. In this study, MD simulations were performed for trioctahedral clay minerals such as brucite, lizardite, and talc, to test how the two different Mg atom types (i.e., 'mgo' or 'mgh') affect the simulation results. The structural parameters such as lattice parameters and interatomic distances were relatively insensitive to the choice of the parameter, but the vibrational power spectra of hydroxyls were more sensitive to the choice of the parameter particularly for lizardite.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1314-1323
• /
• 1999

컴퓨터의 사용이 일반화됨에 따라 데이타를 생성하고 수집하는 것이 용이해졌다. 이에 따라 데이타로부터 자동적으로 유용한 지식을 얻는 기술이 필요하게 되었다. 데이타 마이닝에서 얻어진 지식은 정확성과 이해성을 충족해야 한다. 본 논문에서는 데이타 마이닝을 위하여 퍼지 결정트리에 기반한 효율적인 퍼지 규칙을 생성하는 알고리즘을 제안한다. 퍼지 결정트리는 ID3와 C4.5의 이해성과 퍼지이론의 추론과 표현력을 결합한 방법이다. 특히, 퍼지 규칙은 속성 축에 평행하게 판단 경계선을 결정하는 방법으로는 어려운 속성 축에 평행하지 않는 경계선을 갖는 패턴을 효율적으로 분류한다. 제안된 알고리즘은 첫째, 각 속성 데이타의 히스토그램 분석을 통해 적절한 소속함수를 생성한다. 둘째, 주어진 소속함수를 바탕으로 ID3와 C4.5와 유사한 방법으로 퍼지 결정트리를 생성한다. 또한, 유전자 알고리즘을 이용하여 소속함수를 조율한다. IRIS 데이타, Wisconsin breast cancer 데이타, credit screening 데이타 등 벤치마크 데이타들에 대한 실험 결과 제안된 방법이 C4.5 방법을 포함한 다른 방법보다 성능과 규칙의 이해성에서 보다 효율적임을 보인다.Abstract With an extended use of computers, we can easily generate and collect data. There is a need to acquire useful knowledge from data automatically. In data mining the acquired knowledge needs to be both accurate and comprehensible. In this paper, we propose an efficient fuzzy rule generation algorithm based on fuzzy decision tree for data mining. We combine the comprehensibility of rules generated based on decision tree such as ID3 and C4.5 and the expressive power of fuzzy sets. Particularly, fuzzy rules allow us to effectively classify patterns of non-axis-parallel decision boundaries, which are difficult to do using attribute-based classification methods.In our algorithm we first determine an appropriate set of membership functions for each attribute of data using histogram analysis. Given a set of membership functions then we construct a fuzzy decision tree in a similar way to that of ID3 and C4.5. We also apply genetic algorithm to tune the initial set of membership functions. We have experimented our algorithm with several benchmark data sets including the IRIS data, the Wisconsin breast cancer data, and the credit screening data. The experiment results show that our method is more efficient in performance and comprehensibility of rules compared with other methods including C4.5.