• Journal of Acupuncture Research
• /
• 제20권5호
• /
• pp.82-92
• /
• 2003

Objective: To appreciate the effect of San-Yin-Jiao(SP-6) pressure on duratof delivery time and quantity of blood loss in order to verify the possibility of application to clinic of San-Yin-Jiao pressure. Methods: The design of this study is nonequivalent control group non- synchronized design. The subjects are 39 persons who are made up of SP-6 pressure applied(experimental) group 20 persons and to control group 19 persons. Collected data were analyzed as frequency, percentage, t-test, $x^2-test$ using SPSS 10.0 WIN Program. Conclusions: San-Yin-Jiao(SP-6) pressure not only make short duration of delivery time, but also decline quantity of blood loss in effect. 1. It could be necessary that the study of the effects of San-Yin-Jio(SP-6) pressure on duration of delivery time and quantity of blood loss for primipara be done repeatedly. 2. It could be necessary to increase this sort of study through free random experimental design in order to generalize this experimental result.

• 대한음성학회지:말소리
• /
• 제57호
• /
• pp.175-189
• /
• 2006

Because a packet loss brings about degradation of speech quality, VoIP speech coders have PLC (Packet Loss Concealment) mechanism. G.711, which is a mandatory VoIP speech coder, also has the PLC algorithm based on pitch period replication. However, it is not robust to burst losses. Thus, we propose two methods to improve the performance of the original PLC algorithm in G.711. One adaptively utilizes voiced/unvoiced information of adjacent good frames regarding to the current lost frame. The other is based on adaptive gain control according to energy variation across the frames. We evaluate the performance of the proposed PLC algorithm by measuring a PESQ value under different random and burst packet loss simulating conditions. It is shown from the experiments that the performance of the proposed PLC algorithm outperforms that of PLC employed in ITU-T Recommendation G.711.

• 한국정보과학회논문지:정보통신
• /
• 제31권1호
• /
• pp.70-80
• /
• 2004

현재의 인터넷 라우터는 Drop tail 방식으로 큐 안의 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인해 발생하는 혼잡 상황을 명시적으로 해결 할 수 없다. 이 문제를 해결하기 위해 IETF(Internet Engineering Task Force)에서는 RED(Random Early Detection) 알고리즘과 같은 능동적인 큐 관리(Active Queue Management)알고리즘을 제시하였다. 하지만 RED 알고리즘은 네트워크 환경에 따른 매개 변수의 설정의 어려움을 가지고 있어 잘못된 매개변수 설정으로 인하여 네트워크 성능을 저하시키는 문제를 발생시키며 전체 망에 불안정한 혼잡제어를 야기 시킬 수 있다. 본 논문에서는 기존의 큐 관리 알고리즘을 개선한 SQM(Stabilized Queue Management) 알고리즘을 제안하였다. SQM 알고리즘은 다양한 네트워크 조건에 대해 좋은 성능을 얻을 수 있도록 쉽게 매개 변수설정이 가능하며 불필요한 패킷 패기율을 줄여 효율적으로 혼잡상황을 제어한다. 제안한 알고리즘의 성능을 검증하기 위해 기존의 방법과 시뮬레이션을 이용하여 비교하였다.

• Asian-Australasian Journal of Animal Sciences
• /
• 제26권6호
• /
• pp.755-765
• /
• 2013

The accumulation of inbreeding and the loss of genetic diversity is a potential problem in the modern swine breeds in China. Therefore, the purpose of this study was to analyze the pedigrees of Chinese Duroc (CD), Landrace (CL) and Yorkshire (CY) swine to estimate the past and current rates of inbreeding, and to identify the main causes of genetic diversity loss. Pedigree files from CD, CL and CY containing, 4529, 16,776 and 22,600 records, respectively, were analyzed. Pedigree completeness indexes of the three breeds, accounting for one generation back, were 83.72, 93.93 and 93.59%, respectively. The estimated average annual inbreeding rates for CD, CL and CY in recent three years were 0.21, 0.19 and 0.13%, respectively. The estimated average percentage of genetic diversity loss within each breed in recent three years was about 8.92, 2.19, and 3.36%, respectively. The average relative proportion of genetic diversity loss due to unequal contributions of founders in CD, CL and CY was 69.09, 57.95 and 60.57%, and due to random genetic drift was 30.91, 42.05 and 39.43%, respectively. The estimated current effective population size for CD, CL and CY was 76, 117 and 202, respectively. Therefore, CD has been found to have lost considerable genetic diversity, demanding priority for optimizing the selection and mating to control future coancestry and inbreeding. Unequal contribution of founders was a major cause of genetic diversity loss in Chinese swine breeds and random genetic drift also showed substantial impact on the loss of diversity.

• 한국항공우주학회지
• /
• 제36권12호
• /
• pp.1186-1192
• /
• 2008

가스터빈 엔진 블레이드의 신뢰성을 해석하였다. 항복강도, 탄성계수, 엔진속도 및 기체온도를 서로 독립적인 확률변수로 가정하였다. 파손확률을 구하기 위하여 사용한 방법들 중에서 Advanced Mean Value Method가 가장 효율적임을 알 수 있었다. 동일한 평균과 표준편차를 갖는 정규, 대수정규 및 Weibull 분포로 확률변수 형상을 가정하였을 경우, 극한상태방정식의 누적분포함수는 확률변수 분포형상에 의하여 큰 영향을 받지 않음을 알 수 있었다. 확률변수의 표준편차에 대한 파손확률의 민감도는 기체온도의 경우에 가장 크다는 것을 알 수 있었다. 확률변수의 평균과 표준편차의 효과를 검토하였다. 기체온도의 평균과 엔진속도의 표준편차의 증가가 파손확률을 가장 크게 증가시킴을 알 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제16권3호
• /
• pp.305-312
• /
• 2010

The aim of this study is to find an analytic solution to the problem of determining the optimal capacity of a batch-storage network to meet demand for finished products in a system undergoing joint random variations of operating time and batch material loss. The superstructure of the plant considered here consists of a network of serially and/or parallel interlinked batch processes and storage units. The production processes transform a set of feedstock materials into another set of products with constant conversion factors. The final product demand flow is susceptible to joint random variations in the cycle time and batch size. The production processes have also joint random variations in cycle time and product quantity. The spoiled materials are treated through regeneration or waste disposal processes. The objective function of the optimization is minimizing the total cost, which is composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units. A novel production and inventory analysis the PSW (Periodic Square Wave) model, provides a judicious graphical method to find the upper and lower bounds of random flows. The advantage of this model is that it provides a set of simple analytic solutions while also maintaining a realistic description of the random material flows between processes and storage units; as a consequence of these analytic solutions, the computation burden is significantly reduced. The proposed method has the potential to rapidly provide very useful data on which to base investment decisions during the early plant design stage. It should be of particular use when these decisions must be made in a highly uncertain business environment.

• Earthquakes and Structures
• /
• 제5권4호
• /
• pp.439-459
• /
• 2013

Main objective of the present study is to determine the statistical properties and suitable probability distribution functions of spectral displacements from nonlinear static and nonlinear dynamic analysis within the frame work of Monte Carlo simulation for typical low rise and high rise RC framed buildings located in zone III and zone V and designed as per Indian seismic codes. Probabilistic analysis of spectral displacement is useful for strength assessment and loss estimation. To the author's knowledge, no study is reported in literature on comparison of spectral displacement including the uncertainties in capacity and demand in Indian context. In the present study, uncertainties in capacity of the building is modeled by choosing cross sectional dimensions of beams and columns, density and compressive strength of concrete, yield strength and elastic modulus of steel and, live load as random variables. Uncertainty in demand is modeled by choosing peak ground acceleration (PGA) as a random variable. Nonlinear static analysis (NSA) and nonlinear dynamic analysis (NDA) are carried out for typical low rise and high rise reinforced concrete framed buildings using IDARC 2D computer program with the random sample input parameters. Statistical properties are obtained for spectral displacements corresponding to performance point from NSA and maximum absolute roof displacement from NDA and suitable probability distribution functions viz., normal, Weibull, lognormal are examined for goodness-of-fit. From the hypothesis test for goodness-of-fit, lognormal function is found to be suitable to represent the statistical variation of spectral displacement obtained from NSA and NDA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.93-105
• /
• 2006

The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

• 한국통신학회논문지
• /
• 제34권4C호
• /
• pp.380-387
• /
• 2009

본 논문에서는 집적영상(integral imaging) 및 랜덤 픽셀-스크램블링(random pixel-scrambling) 기법을 이용한 새로운 광 영상 암호화(optical image encryption) 방법을 제안하였다. 즉, 제안된 방법의 부호화 과정에서는 먼저 입력영상을 여러 개의 작은 크기의 블록으로 나누어 픽셀-스크램블링을 한 다음 집적 영상 기술을 이용하여 요소영상(elemental image)을 생성하고 이 영상의 안정성을 위하여 2차 픽셀-스크램블링을 수행하여 최종 암호화된 영상을 얻게 된다. 그리고 복호화 과정에서는 암호화된 영상에 광학적인 집적 영상 복원 기법과 역 픽셀-스크램블링 방법을 사용하여 최종적으로 원 영상을 복원하게 된다. 새로이 제안된 광 영상 암호화 기법의 잡음 첨가 및 크로핑과 같은 데이터 손실에 대한 강인성을 실험을 통해 분석하고 그 결과를 제시하였다.