• Title/Summary/Keyword: UN number

Search Result 664, Processing Time 0.029 seconds

Time- and Frequency-Domain Block LMS Adaptive Digital Filters: Part Ⅰ- Realization Structures (시간영역 및 주파수영역 블럭적응 여파기에 관한 연구 : 제1부- 구현방법)

  • Lee, Jae-Chon;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.7 no.4
    • /
    • pp.31-53
    • /
    • 1988
  • In this work we study extensively the structures and performance characteristics of the block least mean-square (BLMS) adaptive digital filters (ADF's) that can be realized efficiently using the fast Fourier transform (FFT). The weights of a BLMS ADF realized using the FFT can be adjusted either in the time domain or in the frequency domain, leading to the time-domain BLMS(TBLMS) algorithm or the frequency-domain BLMS (FBLMS) algorithm, respectively. In Part Ⅰof the paper, we first present new results on the overlap-add realization and the number-theoretic transform realization of the FBLMS ADF's. Then, we study how we can incorporate the concept of different frequency-weighting on the error signals and the self-orthogonalization of weight adjustment in the FBLMS ADF's , and also in the TBLMS ADF's. As a result, we show that the TBLMS ADF can also be made to have the same fast convergence speed as that of the self-orthogonalizing FBLMS ADF. Next, based on the properties of the sectioning operations in weight adjustment, we discuss unconstrained FBLMS algorithms that can reduce two FFT operations both for the overlap-save and overlap-add realizations. Finally, we investigate by computer simulation the effects of different parameter values and different algorithms on the convergence behaviors of the FBLMS and TBLMS ADF's. In Part Ⅱ of the paper, we will analyze the convergence characteristics of the TBLMS and FBLMS ADF's.

  • PDF

Simultaneous Determination of B Group Vitamins in Supplemented Food Products by High Performance Liquid Chromatography-Diode Array Detection

  • Suh, Joon-Hyuk;Yang, Dong-Hyug;Lee, Byung-Kyu;Eom, Han-Young;Kim, Un-Yong;Kim, Jung-Hyun;Lee, Hye-Yeon;Han, Sang-Beom
    • Bulletin of the Korean Chemical Society
    • /
    • v.32 no.8
    • /
    • pp.2648-2656
    • /
    • 2011
  • A simple HPLC-DAD method was developed and validated to determine B group vitamin content (thiamine, riboflavin, nicotinamide, pantothenic acid, pyridoxine and folic acid) in supplemented food samples, i.e., infant formula, cereal, low-calorie food, a multi-vitamin pill and a vitamin drink. In this study, the most significant advantages were simultaneous determination of the six B group vitamins in various food matrices and a small number of sample treatment steps that required only an organic solvent, acetonitrile. Moreover, this method prevents reduction of column durability, because the mobile phase does not contain ion-pairing reagents. Analytes were separated on a Develosil RPAQUEOUS $C_{30}$ (4.6 mm ${\times}$ 250 mm, 5 ${\mu}M$ particle size) column with a gradient elution of acetonitrile and 20 mM phosphate buffer (pH 3.0) at a flow rate between 0.8 and 1.0 mL/min. Detection was performed at 275 nm, except for that of pantothenic acid (205 nm). The calibration curves for all six vitamins showed good linearity with correlation coefficients ($r^2$) higher than 0.995. The developed method was validated with respect to linearity, intra- and inter-day accuracy and precision, limit of quantification (LOQ), recovery and stability. The method showed good precision and accuracy, with intra- and inter-assay coefficients of variation less than 15% at all concentrations. The recovery was carried out according to the standard addition procedure, with yields ranging from 89.8 to 104.4%. This method was successfully applied to the determination of vitamin B groups in supplemented food products.

Reverse Baby-step 2k-ary Adult-step Method for 𝜙((n) Decryption of Asymmetric-key RSA (비대칭키 RSA의 𝜙(n) 해독을 위한 역 아기걸음- 2k-ary 성인걸음법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.25-31
    • /
    • 2014
  • When the public key e and the composite number n=pq are disclosed but not the private key d in an asymmetric-key RSA, message decryption is carried out by obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and subsequently computing $d=e^{-1}(mod{\phi}(n))$. The most commonly used decryption algorithm is integer factorization of n/p=q or $a^2{\equiv}b^2$(mod n), a=(p+q)/2, b=(q-p)/2. But many of the RSA numbers remain unfactorable. This paper therefore applies baby-step giant-step discrete logarithm and $2^k$-ary modular exponentiation to directly obtain ${\phi}(n)$. The proposed algorithm performs a reverse baby-step and $2^k$-ary adult-step. As a results, it reduces the execution time of basic adult-step to $1/2^k$ times and the memory $m={\lceil}\sqrt{n}{\rceil}$ to l, $a^l$ > n, hence obtaining ${\phi}(n)$ by executing within l times.

Effect of Dietary Protein Levels on the Manifestation of Gramoxone Toxicity in Rat Liver (Gramoxone이 단백질 level에 따라 흰쥐 간에 미치는 독성에 관한 연구)

  • Kim, Sung-Ro;Lee, Hyun-Ki;Jo, Un-Bock;Park, Byung-Tae
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.21 no.3
    • /
    • pp.231-240
    • /
    • 1992
  • Effects of dietary protein levels on the manifestations of the toxicity of gramoxone, a bipyridine herbicide, in the liver of rats were investigated. The addition of gramoxone, with regard to the body weight and feed efficiency ratio of rats, had a move dramatic effect on animals fed a low or intermediate protein diet than for those similarly treated among rats fed a relatively high protein diet. Lipid content in the rat liver tended to increase with the addition of gramoxone into each protein diet, with the exception of the high protein-gramoxone diet. The addition of gramoxone tended to increase hepatic TBA value significantly in rats, especially among those fed the low protein-gramoxone diet or the control-gramoxone diet. Significant morphological changes, including fat changes of hepatic cells and increases in the number of Kupffer cells, were found both in rats fed the low protein diet and those fed any of the gramoxone-treated diets. fat changes within hepatic cells were found to be especially severe in rats fed the low protein-gramoxone diet. Distributions of glycogen in rat liver appeared to increase in rats fed any of the diets to which gramoxone had been added.

  • PDF

Study on the Fluid Dynamics Modeling in Artificial Lung Assist Device (인공 폐 보조장치 내에서의 유체 유동 모델링에 대한 연구)

  • Kim, Gi-Beum;Park, Young-Ran;Kim, Shang-Jin;Hong, Chul-Un;Kang, Hyung-Sub;Kim, Jin-Shang;Kim, Seong-Jong;Kim, Min-Ho
    • Korean Chemical Engineering Research
    • /
    • v.49 no.2
    • /
    • pp.230-237
    • /
    • 2011
  • In this study, the characteristic of fluid flow in the new type lung assist devices has been established using computational fluid dynamics(CFD). For the modeling, the hollow fiber was ignored, and vertical types and tangential types were used for the model. Which was to analyze the flow characteristics of the fluid flow model when there exists 1 and 2 input/output ports, and when the input/output ports is located at the center of the cylinder and at the tangential direction with the cylinder wall. The modeling results showed that it was possible to eliminate no-flow region(stagnant layer) as shown in the vertical type when an inlet and an outlet were installed on the tangential direction of the cylinder as shown in the tangential type. Also, in the tangential type, vortex-type flow appeared as dominant, and it showed a complicated flow not deviated to one side. When the number of input/output was two, there was no deviated flow, and complicated flows were generated all across the tube. From the test result, it was found that input/output of flow was tangential type and complicated flows with no stagnant layer would be generated when there are two inputs/outputs, respectively.

Genetic Diversity of Quercus gilva in Je-ju Island (제주도 개가시나무의 유전구조와 유전적 다양성)

  • Kim, Go-Un;Jang, Kyoung-Soo;Lim, Hyungwoo;Kim, Eun-Hye;Lee, Kye-Han
    • Journal of Korean Society of Forest Science
    • /
    • v.107 no.2
    • /
    • pp.151-157
    • /
    • 2018
  • This study was to analyze the genetic diversity of Quercus gilva Blume growing in Jeju Island for developing a preservation strategy. We examined the genetic diversity and structure using 6 ISSR primers and investigated 67 polymorphic ISSR amplicons in 80 trees distributed among five populations. The average of proportion of polymorphic loci were 93%, the average level of Shannon's information index was 0.237, and Nei's genetic diversity was 0.156. According to the analysis of the molecular variance (AMOVA), $F_{st}$ was 0.169 indicating there was a genetic variation among five populations. 17% of the total variation was allocated among the five populations, while the other 83% of the total variation was in individual trees in each population. The result could be due to the uneven number of trees among the five populations. Based on these results, the preservation strategy could be developed, for examples, considering for designation as "forest genetic resources conservation area" about the habitat, monitoring continuously, fostering the growth of seedling, ex situ preservation of genetic resources, and comparing the differences of environmental and genetic characteristic with population in ex situ.

A Case-Control Study on Risk Factors of Uterine Cervix Cancer in Korea (한국인 여성에서 자궁경부암의 위험요인에 관한 환자-대조군 연구)

  • Koo, Hye-Won;Yoo, Keun-Young;Kim, Dong-Hyun;Song, Yong-Sang;Park, No-Hyun;Kang, Soon-Beom;Lee, Hyo-Pyo;Ahn, Yoon-Ok;Lee, Chae-Un
    • Journal of Preventive Medicine and Public Health
    • /
    • v.29 no.2 s.53
    • /
    • pp.159-172
    • /
    • 1996
  • A hospital-based case-control study was carried out to investigate the risk factors of uterine cervical cancer in Korea. Information on a wide-range of life-styles, which might be related with uterine cervix cancer, has been routinely collected through a dual application of the self-administered questionnaire and the direct interview by a well-trained nurse at the Department of Gynecology, Seoul National University Hosiptal since 1992. The number of cervical cancer cases, histologically confirmed at the hospital, were 284. Included were 939 women as controls, who were free of past history of any malignancies. Adjusted odds ratio and 95% confidence limits were based on the unconditional logistic regression model. The multivariate logistic model was constructed under the consideration of biologic characteristics on the natural history of the malignancy. In the multivariate results, the uterine cervical cancer risk was higher in women of shorter height$(P_{trend}<0.05)$, less educated spouse$(P_{trend}<0.001)$(0.001), multiple marriages(adjusted OR=2,70, 95% C.I. $1.64\sim4.47$), ever had a family history (adjusted OR=2.14., 95% C.I. $1.18\sim3.89$), multiparity$(P_{trend}<0.001)$, and early age at first $(P_{trend}<0.001)$. These results strongly suggest that the uterine cervix cancer might be related to the reproductive factors, and probably with sexual behaviour of both women and men in Korea.

  • PDF

Study on the Establishment of a Safety Allowance Level of Disastrous and Hazardous Facilities in Large Cities (대도시 위해.위험시설에 대한 안전도 수용기준 정립에 관한 연구)

  • 고재선;윤명오
    • Fire Science and Engineering
    • /
    • v.15 no.1
    • /
    • pp.84-92
    • /
    • 2001
  • In today's world, rise in the establishment of social infrastructure resulting from population saturation in large cities has led to more extensive and frequent use of chemical materials on facilities. A result, unexpected and serious accidents, hazards, contingencies and disasters are more prevalent than ever. Such phenomenon calls for more devoted and concerted efforts towards finding ways to reduce the safety hazards that are seen to take place more often than before with the increase in the number of facilities that are prone to bring disaster and hazard coupled with the conventional safety problems that continue to exist even today. In developed countries, such challenge is addressed by various appropriate countermeasures drawn up by local professional committees on industrial facilities, whose members conduct offsite and onsite evaluation un the potential industrial disasters and its seriousness and provide their advice thereof. Against this backdrop, this study aims at identifying a comprehensive safety allowance level (safety acceptable level) when imposing limitation on the development of conventional or new facilities, for the fur pose of establishing a safety allowance level of disastrous and dangerous facilities in Korea. This is done by assessing and applying the level of danger each individual is exposed to in a randomly selected region (disastrous and dangerous areas in Seoul) based on probability of quantitative hazards, as well as simulation and calculation methods which include: i) social disaster evaluation method applying Quantified Risk Assessment of Health & Safety Executive of UK and Matrix of Risk of Evaluated Sources of Hazard; ii) Fault Tree or Event Tree Analysis and etc.

  • PDF

A Real-time Point-to-Point Shortest Path Search Algorithm Based on Traveling Time (주행시간 기반 실시간 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2012
  • The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

An Efficient Implementation of Kruskal's and Reverse-Delete Minimum Spanning Tree Algorithm (Kruskal과 역-삭제 최소신장트리 알고리즘의 효율적 구현 방법)

  • Choi, Myeong-Bok;Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.103-114
    • /
    • 2013
  • This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.