• Journal of The Korean Astronomical Society
• /
• v.48 no.6
• /
• pp.333-341
• /
• 2015

A search for hot and bright white dwarfs (WDs) in the Milky Way globular clusters M13 (NGC 6205) and M22 (NGC 6656) is carried out using the deep and homogeneous V I photometric catalog of Anderson et al. and and Sarajedini et al., based on data taken with the ACS/WFC aboard the Hubble Space Telescope (HST). V versus V − I color-magnitude diagrams (CMDs) of M13 and M22 are constructed and numerous spurious detections are rejected according to their photometric quality parameters qfit(V ) and qfit(I). In the case of M13, further radial restriction is applied to reject central stars with higher photometric errors due to central crowding. From each resultant V versus V −I CMD, sixteen and thirteen WD candidates are identified in M13 and M22, respectively. They are identified as stellar objects in the accompanying ACS/WFC images and are found to be randomly distributed across the central regions of M13 and M22. Their positions in the CMDs are in the bright part of the DA WD cooling sequences indicating that they are true WDs. In order to confirm their nature, follow-up spectroscopic observations are needed.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.5
• /
• pp.479-493
• /
• 2016

LiDAR(Light Detection and Ranging) data acquired from ALS(Airborne Laser Scanner) has been intensively utilized to reconstruct object models. Especially, researches for 3D modeling from LiDAR data have been performed to establish high quality spatial information such as precise 3D city models and true orthoimages efficiently. To reconstruct object models from irregularly distributed LiDAR point clouds, sensor calibration, noise removal, filtering to separate objects from ground surfaces are required as pre-processing. Classification and segmentation based on geometric homogeneity of the features, grouping and representation of the segmented surfaces, topological analysis of the surface patches for modeling, and accuracy assessment are accompanied by modeling procedure. While many modeling methods are based on the segmentation process, this paper proposed to extract key points directly for building modeling without segmentation. The method was applied to simulated and real data sets with various roof shapes. The results demonstrate feasibility of the proposed method through the accuracy analysis.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.73-86
• /
• 2008

Because of its capability of automatic identification of objects, RFID(Radio Frequency Identification) technologies have extended their application areas to logistics, healthcare, and food management system. Load balancing is a basic technique for improving scalability of systems by moving loads of overloaded middlewares to under loaded ones. Adaptive load balancing has been known to be effective for distributed systems of a large load variance under unpredictable situations. There are needs for applying load balancing to RFID middlewares because they must efficiently treat vast numbers of RFID tags which are collected from multiple RFID readers. Because there can be a large amount of variance in loads of RFID middlewares which are difficult to predict, it is desirable to consider adaptive load balancing approach for RFID middlewares, which can dynamically choose a proper load balancing strategy depending on the current load. This paper proposes an adaptive load balancing approach for RFID middlewares and presents its design and implementation. First we decide a performance model by a experiment with a real RFID middleware. Then, a set of proper load balancing strategies for high/medium/low system loads is determined from a simulation of various load balancing strategies based on the performance model.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.865-874
• /
• 2002

HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5486-5492
• /
• 2011

This paper presents a model of ubiquitous learning environment system based on the concepts of ubiquitous computing technology that enables learning to take place anywhere at anytime. This ubiquitous learning environment is described as an environment-friendly learning scheme that supports students' learning using digital media in geographically distributed environments. The u-learning model is a web-based e-learning system that could enable learners to acquire knowledge and skills through interaction between them and the ubiquitous learning environment. Education is happening all around the student but the student may not even be conscious of the learning process. Source data is present in the embedded objects and students do not have to do anything in order to learn. The communication between devices and the embedded computers in the environment allows learners to learn in an environment of their interest while they are moving, hence, attaching them to their learning environment.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1237-1242
• /
• 2006

Microsoft's ActiveX corresponding to the advanced type of COM based distributed application model is made available for the use of component communication[1]. ActiveX supports reuse of code and object linking, so developers can integrate many objects into application and improve the efficiency of development. Also, Integration of seperated application makes easy to develop customized program[2]. ActiveX, formerly used to develope communication application in Visual C++ or Visual Basic, has the efficiency of programming and is widely used in the M&C(Monitoring and Control) of instruments. In this paper, we will implement M&C application capable of remote operating, and besides, develop web browser and media player in the form of ActiveX control in order to control and monitor program remotely.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.188-196
• /
• 2002

As networked virtual environment (NVE) scales in terms of users and network latency, a key aspect to consider is scalability for interactive performance because a large number of objects likely impose heavy burden especially on the network and computational resources. To improve the scalability, various relevance-filtering mechanism have been proposed. However, the existing filtering mechanism do not scale well in terms of interactive performance as the number of users increase and crowds in a specific place. In this paper, we propose a new scalable filtering scheme which reduces the number of messages by dynamically grouping users based on their interests and distance. Within a group, members communicate with each other with high fidelity. However, a representative sends up-to-dated group information of members with low transmission frequency when they are not of immediate interest but are still within the interest area. The representative is elected from members of the group in distributed manner. The proposed scheme enhances the interactive performance scalability of large-scale NVE systems as much as 18% compared with the existing approach.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.10
• /
• pp.487-492
• /
• 2017

Clustering is a technique which is used to measure similarities between data in big data analysis and data mining field. Among various clustering methods, k-Modes algorithm is representatively used for categorical data. To increase the performance of iterative-centric tasks such as k-Modes, a distributed and concurrent framework Spark has been received great attention recently because it overcomes the limitation of Hadoop. Spark provides an environment that can process large amount of data in main memory using the concept of abstract objects called RDD. Spark provides Mllib, a dedicated library for machine learning, but Mllib only includes k-means that can process only continuous data, so there is a limitation that categorical data processing is impossible. In this paper, we design RDD for k-Modes algorithm for categorical data clustering in spark environment and implement an algorithm that can operate effectively. Experiments show that the proposed algorithm increases linearly in the spark environment.