• Bulletin of the Korean Space Science Society
• /
• 2009.10a
• /
• pp.29.2-29.2
• /
• 2009

During the last four years, we have performed Sejong/ARCSEC Ca uvby survey using the CTIO-1m telescope aimed at obtaining Ca uvby photometry for about 50 globular clusters and selected fields in Baade's Windows. Our results show that Ca uvby photometric system can provide a powerful method to probe multiple populations in Galactic globular clusters. We will discuss the multiple stellar population in the globular cluster NGC6218 and NGC6752 as illustrations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.63.2-63.2
• /
• 2013

Unlike the conventional wisdom, observations made during the past decade have revealed that many globular clusters possess more than one stellar population. Here, we have discovered evidence for multiple red giant branches (RGBs) in the globular cluster NGC 6388 from the narrow-band Calcium and Str$\ddot{o}$mgren b & y (Caby) photometry. In order to confirm the difference in Calcium abundance, we have acquired the low resolution spectroscopy for these RGB stars. In this paper, we will present results of our photometry and hand in the preliminary results of spectroscopic observations.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.70-81
• /
• 1997

In this paper, we propose HMCNN(hybrid multiple component neural networks) that enhance performance of MCNN by adapting new pattern partitioning algorithm which can cluster many input patterns efficiently. Added neural network performs similar learning procedure that of kohonen network. But it dynamically determine it's number of output neurons using algorithms that decide self-organized number of clusters and patterns in a cluster. The proposed network can effectively be applied to problems of large data as well as huge networks size. As a sresutl, proposed pattern partitioning network can enhance performance results and solve weakness of MCNN like generalization capability. In addition, we can get more fast speed by performing parallel learning than that of other supervised learning networks.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.297-307
• /
• 2012

A femtocell is a small cellular base station, typically designed for use in a home or small business. The random deployment of a femtocell has a critical effect on the performance of a macrocell network due to co-channel interference. Utilizing the advantage of a multiple-input multiple-output system, each femto base station (FBS) is able to form a cluster and generates a precoding matrix, which is a modified version of conventional single-cell block diagonalization, in a cooperative manner. Since interference from clustered-FBSs located at the nearby macro user equipment (MUE) is the dominant interference contributor to the coexisting networks, each cluster generates a precoding matrix considering the effects of interference on nearby MUEs. Through simulation, we verify that the proposed algorithm shows better performance respective to both MUE and femto user equipment, in terms of capacity.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1507-1510
• /
• 2003

We propose UPGMA(Unweighted Pair Group Method using Average distance) as hierarchical clustering to detect abrupt shot changes using multiple features such as pixel-by-pixel difference, global and local histogram difference. Conventional $\kappa$-means algorithm which is a method of the partitional clustering, has to select an efficient initial cluster center adaptively UPGMA that we propose, does not need initial cluster center because of agglomerative algorithm that it starts from each sample for clusters. And UPGMA results in stable performance. Experiment results show that the proposed algorithm works not only well but also stably.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.365-374
• /
• 2007

This paper investigates the nature of Japanese argument cluster (Steedman 2000b). Based on Combinatory Categorial Grammar, a type-raising analysis of case particles which captures some aspects of the information structure in Japanese is discussed, including contrastive interpretation of coordination, wh-constructions, and some theme and rheme-related grammatical phenomena. These observations offer further support for the study of syntax, semantics, and phonology interface and the earlier analysis of English information structure.

• Bulletin of the Korean Chemical Society
• /
• v.12 no.2
• /
• pp.211-213
• /
• 1991

The ground state of the oxygen molecule is calculated by various methods of coupled cluster approaches and many body perturbation theory using a double zeta plus polarization basis set and the UHF reference state. All the methods employed are capable of describing the oxygen molecule near the equilibrium bond length and the separated atom, but do not correctly depict the breaking of the multiple bond. For this basis set, including more correlations does not necessarily improve the agreement with experiment for molecular properties such as bond lengths and dissociation energies.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.