• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.184-187
• /
• 1995

This paper proposes an algorithm for machine recognition of phonemes in continuous speech. The proposed algorithm is static strategy neural network. The algorithm uses, at the stage of training neuron, features such as PARCOR coefficient and auditory-like perceptual liner prediction . These features are extracted from speech samples selected by a sliding 25.6msec windows with s sliding gap being 3 msec long, then interleaved and summed up to 7 sets of parmeters covering 171 msec worth of speech for use of neural inputs. Perfomances are compared when either PARCOR or auditory-like PLP is included in the feture set.

• Journal of the Korean Chemical Society
• /
• v.41 no.8
• /
• pp.427-436
• /
• 1997

A simple relation exists between electronegativities of cations and their oxidation states and ionic radii. An empirical law is proposed: X = 0.274 z-0.15 z r - 0.01 r+1+${\alpha}$, z being oxidation number, r ionic radius in $\AA$ and ${\alpha}$ a term related to the atomic number. this relation permits to calculate an electronegativity scale covering a large set of electronic and crystallographic situations. An application to the calculation of acid strengths of cations is presented.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.34-46
• /
• 2000

The object of this study is to construct a model for an optimal allocation of short surface to air missile defending our targets most efficiently from hostile aircraft´s attack. For the purpose of this, we analyze and establish facility allocation concept of existing models, apply set covering theory appropriate to problem´s properties, present the process of calculating the probability of target being protected, apply Sherali-Kim´s branching variable selection strategy, and then construct the model. As constructed model apply the reducing problem with application, we confirm that we can apply the large scale, real problem.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.237-242
• /
• 1994

One of the most well-known geometric lattices is a partition lattice. Every upper interval of a partition lattice is a partition lattice. The whitney numbers of a partition lattices are the Stirling numbers, and the characteristic polynomial is a falling factorial. The set of partitions with a single non-trivial block containing a fixed element is a Boolean sublattice of modular elements, so the partition lattice is supersolvable in the sense of Stanley [6]. In this paper, we rephrase four results due to Heller[1] and Murty [4] in terms of matroids and give several characterizations of partition lattices. Our notation and terminology follow those in [8,9]. To clarify our terminology, let G, be a finte geometric lattice. If S is the set of points (or rank-one flats) in G, the lattice structure of G induces the structure of a (combinatorial) geometry, also denoted by G, on S. The size vertical bar G vertical bar of the geometry G is the number of points in G. Let T be subset of S. The deletion of T from G is the geometry on the point set S/T obtained by restricting G to the subset S/T. The contraction G/T of G by T is the geometry induced by the geometric lattice [cl(T), over ^1] on the set S' of all flats in G covering cl(T). (Here, cl(T) is the closure of T, and over ^ 1 is the maximum of the lattice G.) Thus, by definition, the contraction of a geometry is always a geometry. A geometry which can be obtained from G by deletions and contractions is called a minor of G.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• Korean Management Science Review
• /
• v.19 no.2
• /
• pp.75-89
• /
• 2002

According to the fast-paced environment of information technology and improving customer services, the design activities of logistics systems improve customer centric services and delivery performance implementing e-logistics system. The fundamental design issues that arise in the delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the integrated model development of delivery system with customer responsive service level for DCM, Demand Chain Management. We used a two-step approach for this study. First, we formulated the supply. center facility planning using stochastic set-covering problem and assigned the customers to the supply center using clustering algorithm. Second, we developed vehicle delivery planning for a supply center based on GIS, GIS-VRP. Also we developed a GUI-type computer program for proposed method for supply center problem using GIS and Geo-DataBase of Busan area. The computational results showed that the proposed method was very effective on a set of test problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.235-235
• /
• 2012

The "Widefield ASKAP L-band Legacy All-sky Blind surveY" (WALLABY) is an extragalactic HI survey which aims to examine HI properties and large-scale distribution of ~500,000 galaxies out to z ~ 0.27, covering a wide range of science goals associated with galaxy formation and evolution (P.I.: B. Koribalski & L. Staveley-Smith). The combination of ASKAP's exquisite column density sensitivity and a large primary beam will make it possible to systematically investigate the rarely explored low column-density HI in the universe. Ultimately, the largest and most homogeneous data set from WALLABY will drastically improve and broaden our knowledge on galaxy formation and evolution. ASKAP will be on-line in 2013, so to ensure timely and efficient reduction and analysis of the large WALLABY data set, we have been developing and testing reliable source finding tools and data analysis pipelines. In this talk I present recent progress of WALLABY, especially on the kinematic parameterisation pipeline for the spatially resolved galaxies detected by WALLABY.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.117-124
• /
• 1993

In this paper, we introduce a concept of quasi $O_{z}$ -spaces which generalizes that of $O_{z}$ -spaces. Indeed, a completely regular space X is a quasi $O_{z}$ -space if for any regular closed set A in X, there is a zero-set Z in X with A = c $l_{x}$ (in $t_{x}$ (Z)). We then show that X is a quasi $O_{z}$ -space iff every open subset of X is $Z^{#}$-embedded and that X is a quasi $O_{z}$ -spaces are left fitting with respect to covering maps. Observing that a quasi $O_{z}$ -space is an extremally disconnected iff it is a cloz-space, the minimal extremally disconnected cover, basically disconnected cover, quasi F-cover, and cloz-cover of a quasi $O_{z}$ -space X are all equivalent. Finally it is shown that a compactification Y of a quasi $O_{z}$ -space X is again a quasi $O_{z}$ -space iff X is $Z^{#}$-embedded in Y. For the terminology, we refer to [6].[6].

• Korean Journal of Cognitive Science
• /
• v.19 no.1
• /
• pp.57-74
• /
• 2008

This study aimed to investigate the preferential brain activations involed in the set size during random number generation (RNG). The BNG condition gave more increased activations in the anterior cingulate cortex (ACC), inferior frontal gyrus (IFG), inferior parietal lobule (IPL), and superior temporal gyrus (STG) than the simple counting condition, which was a control rendition. When the activations were compared by the small set size condition versus the large set size condition, broad areas covering tempore-occipital network, ACC, and postcentral gyrus were more highly activated in the small set size condition than in the large set size condition, while responses of areas including medial frontal gyrus, superior parietal lobule, and lingual gyrus were more increased in the large set size condition than in the small set size condition. The capacity hypothesis of working memory fails to explain the results. On the contrary, strategy selection hypothesis seems to explain the current observations properly.