• Title/Summary/Keyword: Min-Max

Search Result 1,653, Processing Time 0.033 seconds

Effect of Jaeumkanghwatang (JEKHT), a Polyherbal Formula on the Pharmacokinetics Profiles of Tamoxifen in Male SD Rats (1) - Single Oral Combination Treatment of Tamoxifen 50 mg/kg with JEKHT 100 mg/kg within 5 min -

  • Kwak, Min A;Park, Soo Jin;Park, Sung Hwan;Lee, Young Joon;Ku, Sae Kwang
    • The Journal of Korean Medicine
    • /
    • v.37 no.2
    • /
    • pp.1-11
    • /
    • 2016
  • Objectives: The objective of this study was to elucidate the effect of Jaeumkanghwatang (JEKHT) on the plasma concentration and pharmacokinetics of tamoxifen in combination therapy as a process of the comprehensive and integrative medicine against breast cancer. Methods: After 50 mg/kg of tamoxifen treatment, JEKHT 100 mg/kg was orally administered within 5 min. The plasma were collected at 30 min before administration, 30min, 1, 2, 3, 4, 6, 8 and 24 hrs after end of JEKHT treatment, and plasma concentrations of tamoxifen were analyzed using LC-MS/MS methods. PK parameters of tamoxifen ($T_{max}$, $C_{max}$, AUC, $t_{1/2}$ and $MRT_{inf}$) were analysis as compared with tamoxifen single administered rats. Results: JEKHT did not influenced on the plasma concentrations and pharmacokinetics of tamoxifen after single oral co-administration, within 5min except for some negligible effects on plasma concentration. The $T_{max}$, $C_{max}$, AUC, $t_{1/2}$ and $MRT_{inf}$ of tamoxifen in co-administered rats were quite similar to those of tamoxifen single treated rats. Conclusions: Based on the results of the present study, JEKHT did not influenced on the oral bioavailability of tamoxifen, when they were single co-administered within 5min. However, more detail pharmacokinetic studies should be tested to conclude the possibilities that can be used as comprehensive and integrative therapy with JEKHT and tamoxifen for breast cancers, when they were co-administered, like the effects on the pretreatment of JEKHT and after repeat co-administrations.

Nonlinear frequency analysis of beams resting on elastic foundation using max-min approach

  • Bayat, Mahmoud;Bayat, Mahdi;Kia, Mehdi;Ahmadi, Hamid Reza;Pakar, Iman
    • Geomechanics and Engineering
    • /
    • v.16 no.4
    • /
    • pp.355-361
    • /
    • 2018
  • In this paper, nonlinear vibration of Euler-Bernoulli beams resting on linear elastic foundation is studied. It has been tried to prepare a semi-analytical solution for whole domain of vibration. Only one iteration lead us to high accurate solution. The effects of linear elastic foundation on the response of the beam vibration are considered and studied. The effects of important parameters on the ratio of nonlinear to linear frequency of the system are studied. The results are compared with numerical solution using Runge-Kutta $4^{th}$ technique. It has been shown that the Max-Min approach can be easily extended in nonlinear partial differential equations.

Design of Sewage Treatment Process Simulator with the Aid of IG-based RBFNNs (정보입자기반 RBFNNs에 의한 하수처리공정 시뮬레이터의 설계)

  • Lee, Seung-Joo;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.1958-1959
    • /
    • 2011
  • RBFNNs(Radial Basis Function Neural Networks) 모델의 경우 Min-Max, HCM(Hard C-means)클러스터링 그리고 FCM(Fuzzy C-means)클러스터링 중 한가지를 통해 데이터 입자는 로드 규칙을 생성한 후 퍼지 공간을 분할 및 가우시안 함수의 정점을 정의한다. 본 논문은 기존의 방법과는 다르게 Min-Max와 FCM클러스터링을 혼합하여 로드의 규칙을 생성한 후 퍼지 공간을 분할 및 가우시안 함수의 정정을 정의하는 방법으로 사용하고자 한다. PSO최적화 알고리즘을 이용하여 같은조건에서 최적화한 기존의 방법으로 모델링된 RBFNNs와 Min-Max와 FCM 클러스터링을 혼합하여 사용한 방법의 비교를 통하여 어떤 모델의 성능이 더욱 좋은지 비교하고자 한다.

  • PDF

Derivations of Upper and Lower Bounds of the Expected Busy Periods for a Controllable M/G/1 Queueing Model Operating Under the Triadic Max(N, T, D) Policy (삼변수 Max(N, T, D) 운용방침이 적용되는 조정가능한 M/G/1 대기모형의 busy period 기대값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.1
    • /
    • pp.67-73
    • /
    • 2011
  • Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better estimation.

Derivations of Upper and Lower Bounds of the Expected Busy Periods for the Min(N, D) and Max(N, D) Operating Policies in a Controllable M/G/1 Queueing Model (조정가능한 M/G/1 대기모형에 Min(N, D)와 Max(N, D) 운용방침이 적용될 때 busy period 기대값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou;Oh, Hyun-Seung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.3
    • /
    • pp.71-77
    • /
    • 2009
  • Using the results of the expected busy periods for the dyadic Min(N, D) and Max(N, D) operating policies in a controllable M/G/1 queueing model, an important relation between them is derived. The derived relation represents the complementary property between two operating policies. This implies that it could be possible to obtained desired system characteristics for one of the two operating policies from the corresponding known system characteristics for the other policy. Then, upper and lower bounds of expected busy periods for both dyadic operating policies are also derived.

A study to improve the Performance of induction motor using Min Max algorithm and dead time compensation method (Min Max 알고리즘과 Dead Time 보상기법에 의한 유도전동기의 성능 향상에 관한 연구)

  • Kim, Hyung-Gu;Yang, Oh
    • Proceedings of the KIEE Conference
    • /
    • 1999.07b
    • /
    • pp.976-978
    • /
    • 1999
  • Recently PWM invertor is broadly used for control of induction motor. The invertor is able to generate sin wave current from high speed switching power device such as IGBT. However the invertor is disturbed by dead time inevitably needed to prevent a short of the DC link voltage, and the dead time mainly causes distortions of the output current. In this Paper the dead time compensation method which corrects the voltage error from dead time, and Min Max algorithm enlarging the operating voltage of PWM were Proposed. This method can be implemented by software programming without any additional hardware circuit. The proposed algorithms were implemented by DSP(TMS320C31, 40MHz) and FPGA(QL2007, Quick Logic) described in VHDL. and applied to 3 phase induction motor(2.2 KW) to show the superior performance

  • PDF

A High-speed Max/Min circuit

  • Riewruja, V.;ChimpaLee, T.;Chaikla, A.;Supaph, S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.513-513
    • /
    • 2000
  • An integrable circuit technique for implementing high-speed analog two-input Max/Min circuit is described. The realization method is suitable for fabrication using CMOS technology. The proposed circuit comprises a current mirror and electronic switch connected with a absolute value circuit. The maximum or minimum operation of the proposed circuit can be selected by an external control voltage. The proposed analog Max/Min circuit has a very sharp transfer characteristic and is suitable for real-time systems. Simulation results verified the circuit performances are agreed with the expected values.

  • PDF

A Heuristic Algorithm to Find the Critical Path Minimizing the Maximal Regret (최대후회 최소화 임계 경로 탐색 알고리듬)

  • Kang, Jun-Gyu;Yoon, Hyoup-Sang
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.3
    • /
    • pp.90-96
    • /
    • 2011
  • Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

A Study on K -Means Clustering

  • Bae, Wha-Soo;Roh, Se-Won
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.2
    • /
    • pp.497-508
    • /
    • 2005
  • This paper aims at studying on K-means Clustering focusing on initialization which affect the clustering results in K-means cluster analysis. The four different methods(the MA method, the KA method, the Max-Min method and the Space Partition method) were compared and the clustering result shows that there were some differences among these methods, especially that the MA method sometimes leads to incorrect clustering due to the inappropriate initialization depending on the types of data and the Max-Min method is shown to be more effective than other methods especially when the data size is large.

Two-Input Max/Min Circuit for Fuzzy Inference System

  • P. Laipasu;A. Chaikla;A. Jaruwanawat;P. Pannil;Lee, T.;V. Riewruja
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.105.3-105
    • /
    • 2001
  • In this paper, a current mode two-input maximum (Max) and minimum (Min) operations scheme, which is a useful building block for analog fuzzy inference systems, is presented. The Max and Min operations are incorporated in the same scheme with parallel processing. The proposed scheme comprises a MOS class AB/B configuration and current mirrors. Its simple structure can provide a high efficiency. The performance of the scheme exhibits a very sharp transfer characteristic and high accuracy. The proposed scheme achieves a high-speed operation and is suitable for real-time systems. The simulation results verifying the performances of the scheme are agreed with the expected values.

  • PDF