• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.45 no.3
• /
• pp.277-285
• /
• 2019

In this study, effective cosmetic raw material weighing and bulk manufacturing management system were constructed by using bar code or quick response code (QR code) and database. Raw material labels and weighing labels for bulk manufacturing were published in web environment using the information entered in the database using ScriptX, a print component of Medi&Co. By checking the weighing and manufacturing process by using scanner, tablet and PC, it was possible to remarkably improve the product error caused by erroneous amount or misapplication which is the most cause of error in the production of cosmetic bulk. In conclusion, applying a database that utilizes bar code and QR code to cosmetics manufacturing can reduce the various problems in the process, thereby improving quality control and productivity of cosmetics.

• Nuclear Engineering and Technology
• /
• v.21 no.2
• /
• pp.63-72
• /
• 1989

An analysis for the gamma radiation fields in the research reactor MAPLE-X10 facility has been peformed under the assumption of partial loss of reactor and service pool water to assess the safety from the view point of design. Four photon source terms considered in the analysis were calculated using the ORIGEN-S code. Gamma dose rate calculations over the reactor and service pools during the water-loss accident conditions were performed using QAD-CG code. MCNP code (Monte Carlo Neuron and Photon Transport code), also, was used to assess the scattered radiation fields away from the pools, which is appropriate for calculating the scattered photon dose rates outside of the solid angle subtended by the source and pool walls.

• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3494-3515
• /
• 2022

This paper presents the development of a nodal diffusion code, RAST-V, and its verification and validation for VVER (vodo-vodyanoi energetichesky reactor) analysis. A VVER analytic solver has been implemented in an in-house nodal diffusion code, RAST-K. The new RAST-K version, RAST-V, uses the triangle-based polynomial expansion nodal method. The RAST-K code provides stand-alone and two-step computation modes for steady-state and transient calculations. An in-house lattice code (STREAM) with updated features for VVER analysis is also utilized in the two-step method for cross-section generation. To assess the calculation capability of the formulated analysis module, various verification and validation studies have been performed with Rostov-II, and X2 multicycles, Novovoronezh-4, and the Atomic Energy Research benchmarks. In comparing the multicycle operation, rod worth, and integrated temperature coefficients, RAST-V is found to agree with measurements with high accuracy which RMS differences of each cycle are within ±47 ppm in multicycle operations, and ±81 pcm of the rod worth of the X2 reactor. Transient calculations were also performed considering two different rod ejection scenarios. The accuracy of RAST-V was observed to be comparable to that of conventional nodal diffusion codes (DYN3D, BIPR8, and PARCS).

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.281-288
• /
• 2009

This paper proposes a novel algorithm for the efficient classification and annotation of medical images, especially X-ray images. Since X-ray images have a bright foreground against a dark background, we need to extract the different visual descriptors compare with general nature images. In this paper, a Color Structure Descriptor (CSD) based on Harris Corner Detector is only extracted from salient points, and an Edge Histogram Descriptor (EHD) used for a textual feature of image. These two feature vectors are then applied to a multi-class Support Vector Machine (SVM), respectively, to classify images into one of 20 categories. Finally, an image has the Annotation Code Array based on the pre-defined hierarchical relations of categories and priority code order, which is given the several optimal keywords by the Annotation Code Array. Our experiments show that our annotation results have better annotation performance when compared to other method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.269-272
• /
• 2004

The target of this paper is the development of Web-based monitoring & control system which is for effective and economic management of mold manufacturing process. This system has three module; G-code Control, Monitoring Module and Result analysis module. Also, as the environment of development is based on internet, this system which is possible to the remote site management of manufacturing process works on Web. To be possible to control the manufacturing monitoring by client, each module is made ActiveX control and is based on socket communication. This system makes the foundation which is possible to manage the mold manufacturing process efficiently from remote site by matching real-time monitoring with manufacturing process in factory using G-code control and displaying the result of manufacturing using Ch-CGI.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.2
• /
• pp.341-358
• /
• 1998

The X-ray astronomy team of the Korea Astronomy Observatory(KAO) is planning to develop a multi-cell proportional counter, adopting an anti-coincidence method to reduce its internal background. We have developed a Monte Carlo code to determine the X-ray detection efficiency of the counter. As a check of our code, we successfully reproduced the detection efficiency of Ginga/LAC. In this paper, we report the simulation results for the counter being considered in KAO.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2022

This paper proposes an augmented QSBC(Quantum Short-Block Code) that preserves the function of the existing QSBC and adds a single bit-flip error correction function due to Pauli X and Y errors. The augmented QSBC provides the diagnosis and automatic correction of a single Pauli X error by inserting additional auxiliary qubits and Toffoli gates as many as the number of information words into the existing QSBC. In this paper, the general expansion method of the augmented QSBC using seed vector and the realization method of the Toffoli gate of the single bit-flip error automatic correction function reflecting the scalability are also presented. The augmented QSBC proposed in this paper has a trade-off with a coding rate of at least 1/3 and at most 1/2 due to the insertion of auxiliary qubits.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2002.05a
• /
• pp.242-242
• /
• 2002

Two MIMAS MaX fuel rods base-irradiated in a commercial PWR have been reinstrumented and irradiated at a test reactor. The fabrication data for two MOX roda are characterized together with base irradiation information. Both Rods were reinstrumented to be fitted with thermocouple to measure centerline temperature of fuel. One rod was equipped with pressure transducer for rod internal pressure whereas the other with cladding elongation detector. The post irradiation examinations for various items were performed to determine fuel and cladding in-pile behavior after base irradiation. By using well characterized fabrication and re-instrumentation data and power history, the fuel performance code, COSMOS, is verified with measured in-pile and PIE information. The COMaS code shows good agreement for the cladding oxidation and creep, and fission gas release when compared with PIE dad a after base irradiaton. Based on the re-instrumention information and power history measured in-pile, the COSMOS predicts re-instrumented in-pile thermal behaviour during power up-ramp and steady operation with acceptable accuracy. The rod internal pressure is also well simulated by COSMOS code. Therfore, with all the other verification by COSMOS code up to now, it can be concluded that COSMOS fuel performance code is applicable for the design and license for MaX fuel rods up to high burnup.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.529-537
• /
• 2014

The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.