• ETRI Journal
• /
• v.30 no.3
• /
• pp.355-364
• /
• 2008

Multiple-input multiple-output (MIMO) systems can provide significant increments in capacity; however, the capacity of MIMO systems degrades severely when spatial correlation among multipath channels is present. This paper demonstrates that the influence of shadowing on the channel capacity is more substantial than that of multipath fading; therefore, the shadowing effect is actually the dominant impairment. To overcome the composite fading effects, we propose combining macroscopic selection diversity (MSD) schemes with MIMO technology. To analyze the system performance, the capacity outage expression of MIMO-based MSD (MSD-MIMO) systems using a characteristic function is applied. The analytic results show that there are significant improvements when MSD schemes are applied, even for the two-base-station diversity case. It is also observed that the effect of spatial correlation due to multipath fading is almost negligible when multiple base stations cooperatively participate in the mobile communication topology.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.296-302
• /
• 2010

This paper considers fuzzifying topologies, a special case of I-fuzzy topologies (bifuzzy topologies) introduced by Ying [16, (I)]. It investigates topological notions defined by means of regular open sets when these are planted into the frame-work of Ying's fuzzifying topological spaces (in ${\L}$ukasiewwicz fuzzy logic). The concept of fuzzifying nearly compact spaces is introduced and some of its properties are obtained. We use the finite intersection property to give a characterization of fuzzifying nearly compact spaces. Furthermore, we study the image of fuzzifying nearly compact spaces under fuzzifying completely continuous functions, fuzzifying almost continuity and fuzzifying R-map.

• Honam Mathematical Journal
• /
• v.30 no.4
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• 한국전산유체공학회:학술대회논문집
• /
• 2010.05a
• /
• pp.129-130
• /
• 2010

Design of turbo-compressors has been considered to be a high-tech which only a few early industrialized countries could do efficiently since it requires not only deep understanding of high level gas dynamics and complex fluid dynamics but also accumulation of experiences in the feedback of expensive manufacturing and difficult testing to the design theory and empirical design coefficients. CFturbo is the turbomachinery design software which incorporates traditional well formulated German design technology and latest software technology of 3-dimensional graphics. Fine/Turbo is a powerful tubomachinery-oriented CFD package with quality structured grid topology templates for almost all the tubomachinery configurations for easy, fast and accurate CFD analysis. Rapid and effcient process off turbo-compressor R&D is setup with the combination of CFturbo and Fine/Turbo.

• Journal for History of Mathematics
• /
• v.24 no.2
• /
• pp.61-70
• /
• 2011

Bernhard Riemann(1826-1866) is one of the best researchers in almost all branches of mathematics including analysis, geometry, number theory, topology and mathematical physics. In this paper, we survey the Riemann's life and achievements. In addition, we introduce the Riemann's equation.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2008.10a
• /
• pp.105-107
• /
• 2008

LED driver is important for reliable LED lighting system. A variety of ICs for LED driver are supplied by almost all semiconductor company The types and performances are too diverse to collect proper IC and use efficiently. This paper classifies driver IC according to the usage for each application area and the circuit topology. Finally, the paper shows several representative ICs for main applications with notice of important performance.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.63 no.4
• /
• pp.248-253
• /
• 2014

Generally, power factor correction (PFC) techniques play an important role in the power supply technology. Many new circuit topologies and control strategies for PFC have been proposed. Among them, the brideless PFC (BPFC) reduces the number of switching devices and the losses and improves the power density as well. Moreover, by implementing the improved topology in the discontinous conduction mode (DCM) it ensures almost unity power factor in a simple and effective manner. In the DCM operation gives additional advantages such as zero-current turn-on in the power switches, zero-current turn-off in the output diode and reduces the complexity of the control circuitry. In this paper, a new control strategy for the BPFC is proposed. Also, the performance of the proposed system is demonstrated through experiments.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.386-396
• /
• 2002

This paper presents a neural network-based near-optimal routing algorithm. It employs a modified Hopfield Neural Network (MHNN) as a means to solve the shortest path problem. It uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs, which nay be useful for implementing the routing algorithms appropriate to multi -hop packet radio networks with time-varying network topology.