• Journal of Distribution Science
• /
• v.13 no.1
• /
• pp.57-70
• /
• 2015

Purpose - Open source software has high utilization in most of the server market. The utilization of open source software is a global trend. Particularly, Internet infrastructure and platform software open source software development has increased rapidly. Since 2003, the Korean government has published open source software promotion policies and a supply promotion policy. The dynamism of the open source software market, the lack of relevant expertise, and the market transformation due to reasons such as changes in the relevant technology occur slowly in relation to adoption. Therefore, this study proposes an assessment model of services provided in an open source software service company. In this study, the service level of open source software companies is classified into an enterprise-level assessment area, the service level assessment area, and service area. The assessment model is developed from an on-site driven evaluation index and proposed evaluation framework; the evaluation procedures and evaluation methods are used to achieve the research objective, involving an impartial evaluation model implemented after pilot testing and validation. Research Design, data, and methodology - This study adopted an iteration development model to accommodate various requirements, and presented and validated the assessment model to address the situation of the open source software service company. Phase 1 - Theoretical background and literature review Phase 2 - Research on an evaluation index based on the open source software service company Phase 3 - Index improvement through expert validation Phase 4 - Finalizing an evaluation model reflecting additional requirements Based on the open source software adoption case study and latest technology trends, we developed an open source software service concept definition and classification of public service activities for open source software service companies. We also presented open source software service company service level measures by developing a service level factor analysis assessment. The Behavior-Structure-Evolution Evaluation Model (BSEM) proposed in this study consisted of a rating methodology for calculating the level that can be granted through the assessment and evaluation of an enterprise-level data model. An open source software service company's service comprises the service area and service domain, while the technology acceptance model comprises the service area, technical domain, technical sub-domain, and open source software name. Finally, the evaluation index comprises the evaluation group, category, and items. Results - Utilization of an open source software service level evaluation model For the development of an open source software service level evaluation model, common service providers need to standardize the quality of the service, so that surveys and expert workshops performed in open source software service companies can establish the evaluation criteria according to their qualitative differences. Conclusion - Based on this evaluation model's systematic evaluation process and monitoring, an open source software service adoption company can acquire reliable information for open source software adoption. Inducing the growth of open source software service companies will facilitate the development of the open source software industry.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.30-36
• /
• 2003

According to an evolution of image and video compression technologies, most digital images are in the compressed form. Resizing of these compressed images have various applications such as transmission of resized image according to varying bandwidth, content adaptation for display purpose and etc. Discrete Cosine Transform (DCT) is the most popular transformation for image compression. Recently, several researches have been performed to obtain the reconstructed image of original size in the DCT domain after downsampling and upsampling in the DCT domain. Main focus of these researches is to improve quality of the reconstructed image after downsampling and upsampling in the DCT domain In this paper, we present an modified IDCT method to downsize DCT-encoded image. Furthermore, we propose an efficient scheme for image downsampling and upsampling in the DCT domain With these modified IDCT method. The proposed scheme Provides higher PSNR values than the existing schemes In terms of the reconstructed image after halving and doubling in the DCT domain.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.27-33
• /
• 2015

In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

• Honam Mathematical Journal
• /
• v.30 no.1
• /
• pp.75-89
• /
• 2008

Interrupted blood flow diminishes the concentration of oxygen in tissues. Hypoxia first appears in the region distal to the capillaries and grows throughout the entire t issue. However, the time-wise evolution of hypoxic area is diverse when some of capillaries are blocked in a multi-capillary domain with different oxygen squirt. The process of the development of hypoxia through time course is analyzed mathematically in the domain. Each source in steady state is controlled by a time sensitive function to simulate the occlusion.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.423-428
• /
• 1998

This paper studies the regional identifiability of spatially-varying parameters in distributed parameter systems of hyperbolic type. Let Ω be a bounded domain of R$^n$and let Ωo be a subregion of the closed domain Ω. The distributed parameter systems having unknown parameters defined on Ω are described by the second order evolution equations in the filbert space L$^2$(Ω) and the observations are made on the subregion Ωo ⊂ Ω. The regional identifiability is formulated as the uniqueness of parameters by the identity of solutions on the subregion. Several regional identifiability results of the spatially-varying parameters of hyperbolic distributed parameter systems are established by means of the Riesz spectral representations.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.7
• /
• pp.31-38
• /
• 1992

In this paper, numerical analysis package using Time-Domain Finite Difference (TDFD) method is developed to solve the initial value problem of Maxwell's equation and applied to several microstrip structures. TDFD allows us to show graphically the evolution of the crosswalk between microstrip lines. Moreover, we can obtain transmission line parameters and scattering parameters through Fourier transform of TDFD results in easy and efficient ways. TDFD is successfully applied to :1) wide band electromagnetic wave propagation along the single microstrip line, 2) crosswalk analysis between two microstrip lines, and 3) three metal line side-coupled filter. Our results show much better agreement with other theoretical experimental results reported in the literature. Thus we expect that TDFD is very useful to designing MMIC(Monolithic Microwave Integrated Circuit).

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.4
• /
• pp.180-187
• /
• 2001

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.333-342
• /
• 2022

In this paper, we perform a direct comparison study of real experimental data for domain rearrangement and the Cahn-Hilliard (CH) equation on the dynamics of morphological evolution. To validate a mathematical model for physical phenomena, we take initial conditions from experimental images by using an image segmentation technique. The image segmentation algorithm is based on the Mumford-Shah functional and the Allen-Cahn (AC) equation. The segmented phase-field profile is similar to the solution of the CH equation, that is, it has hyperbolic tangent profile across interfacial transition region. We use unconditionally stable schemes to solve the governing equations. As a test problem, we take domain rearrangement of lipid bilayers. Numerical results demonstrate that comparison of the evolutions with experimental data is a good benchmark test for validating a mathematical model.

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1817-1828
• /
• 2017

We give a simple and direct proof of the characterization of positivity preserving semi-flows for ordinary differential systems. The same method provides an abstract result on a class of evolution systems containing reaction-diffusion systems in a bounded domain of ${\mathbb{R}}^n$ with either Neumann or Dirichlet homogeneous boundary conditions. The conditions are exactly the same with or without diffusion. A similar approach gives the optimal result for invariant rectangles in the case of Neumann conditions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.264-272
• /
• 1995

This paper presents an efficient design method to realize an associative memory with BSB neural networks by means of the parametrization of the solution space and searching for the optimal solution using an evolution program. In particular, the performance index based on DOA analysis in this paper may make and associative memory implementation to reach on the level of practical success.