• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.162-168
• /
• 2007

This paper proposes two detection algorithms for Multi-user Space Time Block Code systems. The first one is linear detection Gaussian Elimination algorithm, and then it combined with Ordered Successive Cancellation to get better performance. The comparisons between receiver and other popular receivers, including linear receivers are provided. It will be shown that the performance of Gaussian Elimination receiver is similar but more simplicity than linear detection algorithms and performance of Gaussian Elimination Ordered Successive Cancellation superior as compared to other linear detection method.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2002.10a
• /
• pp.549-554
• /
• 2002

In Powder System, SCC demands high dosage of superplasticizer and a lage amout of powder for suitable fluidity and viscosity. Okamura's method of most representative mixing design method in SCC of Powder-System is unfavorable economically because of using a large amount of powder. In addition, many ready-mixed concrete plants do not use his mix design method and procedure due to complexity for practical application. Therefore, Nan Su proposed more simple mix design method than Okamura's. It had an advantage in simplicity in practical application and required a smaller amount of powders compared with Okamura's method. This paper proposed an optimal mixture proportion of SCC with consideration of Nan Su's method. The new and modified mix design method required a smaller amount of powder than that of Nan Su's. To check the properties of SCC, considered with the requirements specified by the Japanese Society of Civil Engineering.(JSCE)

• Korean Institute of Interior Design Journal
• /
• no.26
• /
• pp.11-18
• /
• 2001

This study explores the interior image preferred by females living in urban areas. It also examines the relationship between interior image and socio-demographic characteristics such as age, marital status, employment status, total household income. The target population of this study was 301 adult females living in Kwangju City. The data were analyzed with frequency, percentage, General Linear Model, and Duncan's multiple range test using the SAS package. The major findings of this study were as follows. 1) The majority of the females generally preferred modernity of interior image to traditionalism. Also they preferred feminity of interior image to masculinity and complexity to simplicity. 2) Females in the age of 40s were more likely to prefer simple and oriental-traditionalism image to those under the age of 30s. 3) Those with the higher total household income were more 1ike1y prefer western-traditionalism image to those with the lower. But those with the lower household income were more tended to prefer modernity image to those with the higher.

• Advances in Computational Design
• /
• v.1 no.1
• /
• pp.87-103
• /
• 2016

This paper adopts and investigates the non-dominated sorting approach for extending the single-objective Cuckoo Search (CS) into a multi-objective framework. The proposed approach uses an archive composed of primary and secondary population to select and keep the non-dominated solutions at each generation instead of pairwise analogy used in the original Multi-objective Cuckoo Search (MOCS). Our simulations show that such a low computational complexity approach can enrich CS to incorporate multi-objective needs instead of considering multiple eggs for cuckoos used in the original MOCS. The proposed MOCS is tested on a set of multi-objective optimization problems and two well-studied engineering design optimization problems. Compared to MOCS and some other available multi-objective algorithms such as NSGA-II, our approach is found to be competitive while benefiting simplicity. Moreover, the proposed approach is simpler and is capable of finding a wide spread of solutions with good coverage and convergence to true Pareto optimal fronts.

• Journal of the Optical Society of Korea
• /
• v.15 no.3
• /
• pp.283-288
• /
• 2011

In this study, a wide-band photonic crystal Y-splitter for TE modes is proposed. A triangular lattice of air holes etched in a GaAs slab is used as the platform. In order to numerically analyze the structures, plane wave expansion (PWE) and finite difference time domain (FDTD) methods are used. In comparison with the structures reported in the literature, the proposed topology has a less complexity while it provides more than 100nm bandwidth. The simplicity of the design, its high transmission ratio and its wide bandwidth makes it a suitable choice for the implementation of photonic crystal integrated circuits.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• ETRI Journal
• /
• v.22 no.3
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

• Asia pacific journal of information systems
• /
• v.16 no.1
• /
• pp.127-144
• /
• 2006

The K-means algorithm is widely used at the initial stage of data analysis in data mining process, partly because of its low time complexity and the simplicity of practical implementation. Cluster validity indices are used along with the algorithm in order to determine the number of clusters as well as the clustering results of datasets. In this paper, we present a performance comparison of sixteen indices, which are selected from forty indices in literature, while considering their applicability to nonhierarchical clustering algorithms. Data sets used in the experiment are generated based on multivariate normal distribution. In particular, four error types including standardization, outlier generation, error perturbation, and noise dimension addition are considered in the comparison. Through the experiment the effects of varying number of points, attributes, and clusters on the performance are analyzed. The result of the simulation experiment shows that Calinski and Harabasz index performs the best through the all datasets and that Davis and Bouldin index becomes a strong competitor as the number of points increases in dataset.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1515-1522
• /
• 1997

Several image coding algorithms have been developed for the telecommunication and multimedia systems with high image quality and high compression ratio. In order to achieve low entropy and distortion, the system should pay great cost of computation time and memory. In this paper, the uniform cubic lattice is chosen for Lattice Vector Quantization (LVQ) because of its generic simplicity. As a transform coding, the Discrete Wavelet Transform (DWT) is applied to the images because of its multiresolution property. The proposed algorithm is basically composed of the biorthogonal DWT and the uniform cubic LVQ. The multiresolution property of the DWT is actively used to optimize the entropy and the distortion on the basis of the distortion-rate function. The vector codebooks are also designed to be optimal at each subimage which is analyzed by the biorthogonal DWT. For compression efficiency, the vector codebook has different dimension depending on the variance of subimage. The simulation results show that the performance of the proposed coding mdthod is superior to the others in terms of the computation complexity and the PSNR in the range of entropy below 0.25 bpp.

• Structural Engineering and Mechanics
• /
• v.44 no.3
• /
• pp.405-416
• /
• 2012

In this study the investigation of large deflections subject in compliant mechanisms is presented using homotopy perturbation method (HPM). The main purpose is to propose a convenient method of solution for the large deflection problem in compliant mechanisms in order to overcome the difficulty and complexity of conventional methods, as well as for the purpose of mathematical modeling and optimization. For simplicity, a cantilever beam of linear elastic material under horizontal, vertical and bending moment end point load is considered. The results show that the applied method is very accurate and capable for cantilever beams and can be used for a large category of practical problems for the aim of optimization. Also the consequence of effective parameters on the large deflection is analyzed and presented.