• Journal of the Korean Electrochemical Society
• /
• v.17 no.4
• /
• pp.216-221
• /
• 2014

A rapid and sensitive voltammetric method for the quantitative determination of Clenbuterol on electrochemically activated glassy carbon electrode has been developed. Using differential pulse voltammetry, the linear response range for the clenbuterol was between $1{\times}10^{-7}$ and $2{\times}10^{-5}M$, and the detection limit was $6{\times}10^{-9}M$ (S/N = 3). The relative standard derivation was 4.3% for $1{\times}10^{-6}M$ clenbuterol. Recoveries of 96% of the clenbuterol (n = 3) were obtained from urine spiked with different amounts in the ranges $5{\times}10^{-7}M$ and $1{\times}10^{-6}M$ by this method.

• Korean Journal of Soil Science and Fertilizer
• /
• v.31 no.1
• /
• pp.16-24
• /
• 1998

To determine the optimum application of fertilizers for the cultivation of Chinese cabbage in plastic film house, twenty soils which contain different salts contents were taken from 4 different area of plastic film house cultivation, Youngdong. Boeun county, Cheongweon county, and Cheongju city. The dry weight and the amount of N. P, and K uptakes of Chinese cabbage in the plot of no fertilization were considered as the factors representing the fertility of the soil. And a difference of dry weight and the amounts of N, P, and K uptakes of plants between the plot of fertilization and no fertilization were considered as the factors representing the total effect of fertilizer and fertilizer N, P, and K effects. respectively. These factors of soil fertility and fertilizer effects were estimated by correlation and regression with soil tests in order to find the critical levels and recommended method for optimum fertilization of Chinese cabbage. Chinese cabbage transplanted in two soils, having the electrical conductivity of 9.3 and 15.2 dS/m, were not able to root due to the salts toxicity. The content of inorganic N, the electrical conductivity, and CEC were founded to have significant correlation with the factors of both the soil fertility and fertilizer effects for the cultivation of Chinese cabbage. To determine the weighting degree for the productivity and the fertilizer effects, the standardized partial regression coefficient was analyzed by regression among the factors of fertility, the fertilizer effects, and the soil tests. The coefficient for inorganic N($NH_4-N$ and $NO_3-N$) was obtained as the absolute value of 756-1871 and this value was extremely higher than those of other soil tests which was 0.07-4.11. These results suggested that the content of inorganic N is the best tests for the estimation of the productivity and the fertilizer effects for the cultivation of Chinese cabbage in plastic film house. The critical level of inorganic N($NH_4-N+NO_3-N$) estimated by Cate-Nelson split method for maximum productivity and zero point of fertilizer effect was 220 mg/kg for all the factors of estimation. These results suggested that no application of fertilizer N. P, and K is required at the critical level of inorganic N of soil. Consequently the optimum application of fertilizer N, P, and K for the cultivation of Chinese cabbage in plastic film house was possible to determine by the critical level of inorganic N of soil. The critical level of electrical conductivity was estimated as 2.8 dS/m by the same method.

• Korean Journal of Materials Research
• /
• v.8 no.10
• /
• pp.890-897
• /
• 1998

The direct wafer bonding between n-InP(001) wafer and the ${Si}_3N_4$(200 nm) film grown on the InP wafer by PECVD method was investigated. The surface states of InP wafer and ${Si}_3N_4$/InP which strongly depend upon the direct wafer bonding strength between them when they are brought into contact, were characterized by the contact angle measurement technique and atomic force microscopy. When InP wafer was etched by $50{\%}$ HF, contact angle was $5^{\circ}$ and RMS roughness was $1.54{\AA}$. When ${Si}_3N_4$ was etched by ammonia solution, RMS roughness was $3.11{\AA}$. The considerable amount of initial bonding strength between InP wafer and ${Si}_3N_4$/InP was observed when the two wafer was contacted after the etching process by $50{\%}$ HF and ammonia solution respectively. The bonded specimen was heat treated in $H^2$ or $N^2$, ambient at the temperature of $580^{\circ}C$-$680^{\circ}C$ for lhr. The bonding state was confirmed by SAT(Scannig Acoustic Tomography). The bonding strength was measured by shear force measurement of ${Si}_3N_4$/InP to InP wafer increased up to the same level of PECVD interface. The direct wafer bonding interface and ${Si}_3N_4$/InP PECVD interface were chracterized by TEM and AES.

• Journal of Korean Institute of Industrial Engineers
• /
• v.7 no.1
• /
• pp.5-11
• /
• 1981

In the case of numerical implementation, the exact solution method for the M/M/s system where customers demand multiple server use [2] reveals limitations, if a system has large number of servers or types of customers. This is due to the huge matrices involved in the course of the calculations. This paper offers an approximation scheme for such cases. Capitalizing the characteristics of the service rate curve of the system, this method approximates the service rate as a piecewise linear function. With the service rates obtained from the linear function for each number of customers n (n=0. 1. 2,$\cdots$), ${\mu}(n)$, steady-state probabilities and measures of performance are found treating this system as an ordinary M/M/s system. This scheme performs well when the traffic intensity of a system is below about 0.8. Some numerical examples are presented.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Analytical Science and Technology
• /
• v.11 no.5
• /
• pp.321-331
• /
• 1998

The separation and sample extraction methods of 19 polycyclic aromatic hydrocarbons (PAHs) in water samples were investigated by gas chromatography/mass spectrometry (GC/MS) and some extraction methods involved liquid-liquid extraction, disk extraction and solid-phase extraction methods. The separation of 19 PAHs was possible by partial variation of oven temperature of GC/MS in temperature range $80{\sim}310^{\circ}C$. Extraction procedures of PAHs in water samples were somewhat modified and compared as extraction recoveries and the simplicity of methods. Extraction recoveries of PAHs were 71.3~109.5% by liquid-liquid extraction method. By using disk extraction, good extraction recoveries (80.7~94.9%) were obtained in case of $C_{18}$ disk extraction method by filtration. And extraction recoveries of PAHs by $C_{18}$ solid-phase were in the range of 51.8~77.9%. Method detection limits (S/N=5) of 19 PAHs were in the range of 0.25~6.25 ppb by liquid-liquid extraction and solid-phase extraction and 0.05~1.25 ppb by disk extraction methods.

• Korean Journal of Food Science and Technology
• /
• v.41 no.2
• /
• pp.157-161
• /
• 2009

This paper proposes an analytical method for determining amounts of polycyclic aromatic hydrocarbons (PAHs; benzo[a]anthracene, chrysene, benzo[b]fluoranthene, benzo[k]fluoranthene, benzo[a]pyrene, dibenzo[a,h]anthracene, benzo[g,h,i] perylene) in coffees beans. Soxhlet extraction and liquid/liquid extraction were tested for the quantification of seven PAHs. Soxhlet extraction was followed by cyclohexane extraction and used a silica cartridge. Liquid/liquid extraction was followed by n-hexane extraction and utilized a florisil cartridge. The extracts were analyzed by HPLC-fluorescence detection (FLD) with a Supelcosil LC-PAH column. The PAH recoveries ranged from 78.68 to 96.28% for the liquid/liquid extraction, and from 67.47 to 84.60% for the Soxhlet extraction.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.585-594
• /
• 2004

When several service providers want to work together with only one master key, they need to properly distribute the key to participants who come in for the co-work business and then securely manage the distributed keys. This paper describes the system that can efficiently and securely manage the master key on the basis of the secret sharing scheme that can reconstruct original secret information as the necessity of reconstructing original secret arises. The proposed system can distribute secret information to several groups and also redistribute the secret to subgroup in proportion to the participant's security level using smart card-based (t, t)-(k, n)-threshold secret scheme for securely keeping secret information and authentication of participant's identification.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.8-15
• /
• 2009

Side-channel attacks including the differential power analysis attack are often more powerful than classical cryptanalysis and have to be seriously considered by cryptographic algorithm's implementers. Various countermeasures have been proposed against such attacks. In this paper, we deal with the masking method, which is known to be a very effective countermeasure against the differential power analysis attack and propose new gate-level conversion methods between Boolean and arithmetic masks. The new methods require only 6n-5 XOR and 2n-2 AND gates with 3n-2 gate delay for converting n-bit masks. The basic idea of the proposed methods is that the carry and the sum bits in the ripple adder are manipulated in a way that the adversary cannot detect the relation between these bits and the original raw data. Since the proposed methods use only bitwise operations, they are especially useful for DPA-securely implementing cryptographic algorithms in hardware which use both Boolean and arithmetic operations. For example, we applied them to securely implement the block encryption algorithm SEED in hardware and present its detailed implementation result.