• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.919-922
• /
• 2016

Neuronal cells and Schwann cells from dorsal root ganglion (DRG) in embryos of rat were isolated and cultured in vitro respectively. The purified neuronal cells added with anti-mitotic agents and purified Schwann cells were co-cultured and then accomplished myelination processing. This myelinated co-culture system was infected by herpes simplex virus-1 and then accomplished demyelination processing in this myelinated co-culture. We identified myelination and demyelination processing using antibody of neuropeptide Y meaning presence of myelinated neuron.

• Current Optics and Photonics
• /
• v.6 no.2
• /
• pp.161-170
• /
• 2022

Three-dimensional (3D) geometric models are introduced to correct vignetting, and a downhill simplex search is applied to determine the coefficients of a 3D model used in digital microscopy. Vignetting is nonuniform illuminance with a geometric regularity on a two-dimensional (2D) image plane, which allows the illuminance distribution to be estimated using 3D models. The 3D models are defined using generalized polynomials and arbitrary coefficients. Because the 3D models are nonlinear, their coefficients are determined using a simplex search. The cost function of the simplex search is defined to minimize the error between the 3D model and the reference image of a standard white board. The conventional and proposed methods for correcting the vignetting are used in experiments on four inspection systems based on machine vision and microscopy. The methods are investigated using various performance indices, including the coefficient of determination, the mean absolute error, and the uniformity after correction. The proposed method is intuitive and shows performance similar to the conventional approach, using a smaller number of coefficients.

• Journal of the Korean Society of Radiology
• /
• v.81 no.3
• /
• pp.714-718
• /
• 2020

Herpetic mastitis is extremely rare, and its imaging findings remain unclear. We report a case of herpes simplex mastitis in an adolescent woman and describe the clinical and ultrasound features. The patient showed unilateral nipple and areolar skin thickening and axillary lymphadenopathy on B-mode ultrasonography. Doppler ultrasonography revealed multiple linear and branching blood flows in the areolar area. The lesion was verified as herpes simplex mastitis via a skin biopsy. This report shows that the radiologic features of herpes simplex mastitis may be similar to those of Paget's disease because of localized nipple and areolar skin thickening and increased vascularity.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.79-86
• /
• 1985

A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.399-400
• /
• 2002

A numerical procedure for analyzing thermo-elastic contact applied to an automotive disk brake and calculating subsurface stress distribution has been developed. The proposed procedure takes the advantage of the simplex algorithm to save computing time. Flamant's solution and Boussinesq's solution are adopted as Green function in analysis. Comparing the numerical results with the exact solutions has proved the validity of this procedure.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.313-318
• /
• 2012

The power inequality ${\prod}_{k=1}^{N}\;{x}_{k}^{x_{k}}\;{\geq}\;{\prod}_{k=1}^{N}\;{p}_{k}^{x_{k}}$ holds for the points $(x_1,{\ldots},x_N),(p_1,{\ldots},p_N)$ of the simplex. We show this using the analytic method combining Frostman's density theorem with the strong law of large numbers.

• Journal of the military operations research society of Korea
• /
• v.9 no.2
• /
• pp.57-60
• /
• 1983

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.3 no.3
• /
• pp.49-53
• /
• 1980

Computer program about the simplex method -one of the most popularity used linear programming- has been studied. Variable and subject to the restriction are growing according to the growing of all of the problem. In this paper, the problem that can be solved by simplex method may be processed with enormous block unit ( $50\;{\times};\50$ ). Because of using computer all of the problem can be solved more accurately and quickly. In appendix, computer program and running example are recorded.

• Journal of Microbiology and Biotechnology
• /
• v.6 no.2
• /
• pp.142-144
• /
• 1996

To clone the gene coding for steroid $\Delta^1$-dehydrogenase of Arthrobacter simplex, its genomic library was constructed with a , $\lambda$gt11 expression vector and immunoscreened with antiserum against the enzyme. One positive clone was found to carry a 1.6-kb EcoR I restriction endonuclease fragment of A. simplex DNA. The restriction map of the 1.6-kb EcoR I fragment was determined after cloning of the DNA into pBS vector.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.