• Korean Journal of Clinical Pharmacy
• /
• v.18 no.2
• /
• pp.84-96
• /
• 2008

In the recent, pharmacokinetic (PK)/pharmacodynamic (PD) modeling has appeared as a critical path tools in new drug development to optimize drug efficacy and safety. PK/PD modeling is the mathematical approaches of the relationships between PK and PD. This approach in new drug development can be estimated inaccessible PK and PD parameters, evaluated competing hypothesis, and predicted the response under new conditions. Additionally, PK/PD modeling provides the information about systemic conditions for understanding the pharmacology and biology. These advantages of PK/PD model development are to provide the early decision-making information in new drug development process, and to improve the prediction power for the success of clinical trials. The purpose of this review article is to summarize the PK/PD modeling process, and to provide the theoretical and practical information about widely used PK/PD models. This review also provides model schemes and the differential equations for the development of PK/PD model.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.2
• /
• pp.160-168
• /
• 2013

In tactical environment, tactical wireless networks are generally comprised of Tactical MANETs(T-MANETs) or Tactical WMNs(T-WMNs). The most important services in tactical network are voice and low rate data such as command control and situation awareness. These data should be forwarded via multi-hop in tactical wireless networks. Urgent and mission-critical data should be protected in this environment, so QoS(Quality of Service) must be guaranteed for specific type of traffic for satisfying the requirement of a user. In IEEE 802.11s, TDMA-based MAC protocol, MCCA(MCF Controlled Channel Access), has a function of resource reservation. But 802.11s protocol can not guarantee the end-to-end QoS, because it only supports reservation with neighbors. In this paper, we propose the routing protocol, R-HWMP(Reservation-based HWMP) which has the resource reservation to support the end-to-end QoS. The proposed protocol can reserve the channel slots and find optimal path in T-WMNs. We analyzed the performance of the proposed protocol and showed that end-to-end QoS is guaranteed using NS-2 simulation.

• The Journal of Society for e-Business Studies
• /
• v.17 no.1
• /
• pp.91-110
• /
• 2012

Recently the effort of retailers improving the efficiency of store operations by using the information technology (IT) is increasing. Among them, the analysis of the shoppers' flow in retail stores is one of the critical tasks since it is an essential part in optimizing store layout and item grouping, and in developing the customized services specialized to shoppers' classification. Agent-Based Modeling and Simulation (ABMS) is one of the most promising methods which support analyzing the shoppers' flow. In this paper, we suggested a shopper's behavior model and developed an agent-based simulator for optimizing the operations of retail stores. In order to model the shoppers' behavior, we analyzed the behavioral characteristics of shoppers based on their shopping lists, suggesting BDI-based agent models of the shoppers' behavior. The shopping agent model were suggested, which has an additional mental state, the shopper's behavioral characteristic, as well as the original mental states of the BDI theory which has beliefs, desires and Intentions. The result of this study can be used in as a preliminary study for modeling and simulation of retail stores congestion and in the end the optimization of item grouping and store layout.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.117-127
• /
• 2012

The purpose of this study is to develop the auto-building algorithm of the Geometric Network Model(GNM), a topology model including geometric information because of the need to reflect the features' geometric characteristic into the topology model, which is for development of indoor 3D virtual model enabling queries. As the critical algorithm, the Straight Medial Axis Transformation(SMAT) algorithm is proposed in order to automatically extract the medial axis of features. The SMAT algorithm is generalized from the existing S-MAT algorithm and a range of target features where applicable is extended from simple polygons to weakly simple polygons which mean the polygons containing the inner ring inside. The GNM built automatically is finally printed out as the .csv file for easy access and w ide application in other systems. This auto-building algorithm of the GNM is available for plenty of cases such as finding a shortest path, guiding a route in emergency situation, and semantic analysis.

• Bulletin of the Korean Chemical Society
• /
• v.33 no.9
• /
• pp.2937-2942
• /
• 2012

We have theoretically investigated the magnetic properties of N-confused porphyrin (NCP), tetraphenyl-N-confused porphyrin (TPNCP) and their substituted derivatives with O, S and Se heteroatoms (2ONCP, 2STPNCP, 2SeNCP, 2OTPNCP, etc.) by using DFT method. In the minimum energy structures of the 2OTPNCP, the two couples opposite phenyl substitutes are staggered. In the case of TPNCP, 2STPNCP and 2SeTPNCP, two phenyls being respectively close to or opposite to N-confused pyrrole are found to be pointed the same direction, whilst others are in the opposite direction. Based on the equilibrium structures, the $^1H$ chemical shifts and nucleus-independent chemical shifts (NICS) are calculated in this paper. The ${\pi}$ current density being induced by the tridimensional perpendicular magnetic field transmits the inner section of the pyrrole segments for NCP and TPNCP. As for their substituted derivatives with O, S and Se atoms, the current path passes through the outer section of the two heterorings. The NICS values at the ring critical points of the heterorings are much lower (in absolute value) than those of which is at the center of an isolated pyrrole molecule. The $^1H$ NMR for ${\beta}H$ atoms of the heterorings decreases from O, S to with Se.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• Journal of the Korea Institute of Building Construction
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2011

Linear scheduling method limits to present works of work breakdown structure as a form of lines and was often developed manually. In other words, linear schedule could not utilize activity, work breakdown structure, and etc. information of network schedule such as CPM(Critical Path Method) and has been used only for reporting or confirming construction master plan. Therefore, it is necessary to develop system which can automatically generating the linear schedule based on the network schedule having many accumulated and useful construction schedule information. Thus, this research has an effort to establish data process model, data flow diagram, and data model in order to make linear schedule. In addition, this research addresses the system solution structure, user interface class diagram and logic diagram, and data type schema. The results of this paper can be used as a preliminary research for developing linear schedule generating system prototype by utilizing the network schedule information.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.222-226
• /
• 2008

The construction industry has remained stagnant for a long time. So many researchers have wanted to solve this problem not only focusing on enhancement of construction process, but also introducing the culture of cooperation. The Last Planner System(LPS), one of the elementary techniques of Lean Construction, aims for improving the work reliability and reducing variability by measuring and managing the daily or weekly performance for overcoming the weakness of recent complex schedule management tools such as Critical Path Method. This research propose a framework for implementation of LPS conducted by owner focused on construction stage and introduce optimal owner participation model in plant construction, based on needs analysis for construction participants. Furthermore, this research introduce a modified needs analysis, so called IPBA(Importance-Performance-Betterment Analysis), and an advanced LPS procedure which add the needs analysis during pre-LPS and(or) main LPS stages.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.351-355
• /
• 2006

RSA 암호 시스템은 IC카드, 모바일 및 WPKI, 전자화폐, SET, SSL 시스템 등에 많이 사용된다. RSA는 모듈러 지수승 연산을 통하여 수행되며, Montgomery 곱셈기를 사용하는 것이 효율적이라고 알려져 있다. Montgomery 곱셈기에서 임계 경로 지연 시간(Critical Path Delay)은 세 피연산자의 덧셈에 의존하고 캐리 전파를 효율적으로 처리하는 문제는 Montgomery 곱셈기의 효율성에 큰 영향을 미친다. 최근 캐리 전파를 제거하는 방법으로 캐리 저장 덧셈기(Carry Save Adder, CSA)를 사용하는 연구가 계속 되고 있다. McIvor외 세 명은 지수승 연산에 최적인 CSA 3단계로 구성된 Montgomery 곱셈기와 CSA 2단계로 구성된 Montgomery 곱셈기를 제안했다. 시간 복잡도 측면에서 후자는 전자에 비해 효율적이다. 본 논문에서는 후자보다 빠른 연산을 수행하기 위해 캐리 전파 제거 특성을 가진 이진 부호 자리(Signed-Digit, SD) 수 체계를 사용한다. 두 이진 SD 수의 덧셈을 수행하는 잉여 이진 덧셈기(Redundant Binary Adder, RBA)를 새로 제안하고 Montgomery 곱셈기에 적용한다. 기존의 RBA에서 사용하는 이진 SD 덧셈 규칙 대신 새로운 덧셈 규칙을 제안하고 삼성 STD130 $0.18{\mu}m$ 1.8V 표준 셀 라이브러리에서 지원하는 게이트들을 사용하여 설계하고 시뮬레이션 하였다. 그 결과 McIvor의 2 방법과 기존의 RBA보다 최소 12.46%의 속도 향상을 보였다.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.97-121
• /
• 2001

Until now, we have believed that one of advantages of cyber market is that it can virtually display and sell goods because it does not necessary maintain expensive physical shops and inventories. But, in a highly competitive environment, business model that does away with goods in stock must be modified. As we know in the case of AMAZON, leading companies already consider merchandise management as a critical success factor in their business model. That is, a solution to compete against one's competitors in a highly competitive environment is merchandise management as in the traditional retail market. Cyber market has not only past sales data but also web log data before sales data that contains information of path that customer search and purchase on cyber market as compared with traditional retail market. So if we can correctly analyze the characteristics of before sales patterns using web log data, we can better prepare for the potential customers and effectively manage inventories and merchandises. We introduce a systematic analysis method to extract useful data for merchandise management - demand forecasting, evaluating & selecting - using web mining that is the application of data mining techniques to the World Wide Web. We use various techniques of web mining such as clustering, mining association rules, mining sequential patterns.