• 약학회지
• /
• 제21권3호
• /
• pp.135-140
• /
• 1977

Solubilization of cholesterol, its fatty acid esters and gallstones were undertaken employing nonionic, anionic and cationic surfactants. Cholesterol was effectively solubilized by all of these surfactants. Cationic surfactants were most effective. However, cholesteryl myristate was not solubilized at all. In the dissolution test of gallstones in surfactant solutions, cationic surfactant solutions were exceptionally effective in dissolving gallstones. These results suggest the possible existence of interaction between alkylammonium radical and cholesterol on micellar surface.

• 한국의사학회지
• /
• 제28권1호
• /
• pp.81-92
• /
• 2015

Objectives : The purpose of this study is to analyze and identify the problems of current laws and regulations regarding preparation and processing of herbal medicines at hospitals of Korean Medicine. Possible solutions are proposed in the end Methods : Based on the status of hospitals of Korean Medicine and characteristics of Korean Medicine and Korean Medicine industry, I analyze the laws and regulations in regards to preparation and processing of herbal medicines and propose possible solutions. Results : Regulations for the agents, places, and cautions in respect of preparation and processing of herbal medicines are inadequate. Meanwhile, the definition of drug preparation in the Pharmaceutical Affairs Act does not apply to processing and preparation of herbal Medicines at hospitals of Korean Medicine, since herbal medicines accompanies chemical and physical change. Discussions & Conclusions : New regulations for on-site preparation at hospitals of Korean Medicine are necessary. Also, the definition for herbal medicines preparation, which states possible chemical and physical changes of herbal medicines, should be specified in Pharmaceutical Affairs Act.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2008년 영문 학술대회
• /
• pp.247-254
• /
• 2008

The primary objective of this research is to develop an efficient design and optimization methodology for SRM Wagon Wheel Grain and to develop of software for practical designing and optimization of Wagon Wheel grains. This work will provide a design process reference guide for engineers in the field of Solid Rocket Propulsion. Using these proposed design methods, SRM Wagon Wheel grains can be designed for various geometries, their optimal solutions can be found and best possible configuration be attained thereby ensuring finest design in least possible iterations & time. The main focus is to improve computational efficiency at various levels of the design work. These have been achieved by the following way. a. Evaluation of system requirements and design objectives. b. Development of Geometric Model of Wagon Wheel grain configuration. c. Internal ballistic performance predictions. d. Preliminary designing of the Wagon Wheel grain configuration involving various independent geometric variables. e. Optimization of the grain configuration using Sequential Quadratic Programming f. In depth analysis of the optimal results considering affects of various geometric variables on ballistic parameters and analysis of performance prediction outputs have been performed g. Development of software for design and optimization of Wagon Wheel Grain. By using these proposed design methods, SRM Wagon Wheel grains can be designed by using geometric model, their optimal solutions can be found and best possible configuration be attained thereby ensuring finest design.

• 한국펄프종이공학회:학술대회논문집
• /
• 한국펄프종이공학회 2007년도 제32회 펄프종이기술 국제세미나
• /
• pp.83-125
• /
• 2007

Increasing energy costs have caused profitability problems for paper suppliers. Therefore unprofitable lines are being closed down. The actions aiming for improved profits are focused either on cost savings or on increasing the capacity of the remaining machines. The runnability of a paper machine and its total efficiency have a significant effect on energy consumption. Producing one ton of waste paper consumes at least as much energy as producing the same amount of sellable end product. New automation solutions enable significant cost-effective improvements to the total efficiency of a line without large investment projects. The measures focus on minimizing changes, interruptions, interruption recovery times and grade change times. Newest actuators, online quality measurements and wet end analysators create an improvement potential, which can be optimally implemented with the latest machine direction control solutions, based on model predictive control concepts. Equally, drying management is significant to the energy consumption. The newest control strategies optimize the use of various drying actuators for different situations; either by responding to changes as efficiently as possible or by using only the cheapest energy sources in stable situations. An even steam supply, which is vital for paper machines, is achieved with control for the power plant steam network. This makes possible to avoid the delays upon starting the paper machine and assure an even steam supply for the drying section and the actuators. This document describes means which have brought significant energy and raw material savings for paper machines. Metso Automation has provided efficiency improvement packages, which are usually based on optimized control of dry weight and drying in all running conditions. The solutions are based on performance analysis, on which the estimations for improvement potential and the necessary actions are based on. Typically benefits on an annual level have been from hundreds of thousands of euros to over one million euro. For example, variations in dry weight have been decreased more than 50%. The results are presented with a few examples. Additionally, the analysis models, adjustment solutions and the changes in running methods with which the results were achieved, are presented.

• 대한수학회보
• /
• 제57권5호
• /
• pp.1095-1113
• /
• 2020

In this paper, we investigate the transcendental meromorphic solutions for the nonlinear differential equations $f^nf^{(k)}+Q_{d_*}(z,f)=R(z)e^{{\alpha}(z)}$ and fⁿf^(k) + Q_d(z, f) = p₁(z)e^α₁(z) + p₂(z)e^α₂(z), where $Q_{d_*}(z,f)$ and Q_d(z, f) are differential polynomials in f with small functions as coefficients, of degree d_* (≤ n - 1) and d (≤ n - 2) respectively, R, p₁, p₂ are non-vanishing small functions of f, and α, α₁, α₂ are nonconstant entire functions. In particular, we give out the conditions for ensuring the existence of these kinds of meromorphic solutions and their possible forms of the above equations.

• Management Science and Financial Engineering
• /
• 제11권2호
• /
• pp.45-60
• /
• 2005

This paper investigates the application of the computer method COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) to the process routing (PR) problem with multiple objectives. In any computer aided process planning (CAPP) system, one of the most critical activities for manufacturing a part could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The COMSOAL has been adopted to find the optimum sequence of operations that optimizes two major conflicting criteria : production cost and production quality. The COMSOAL is here slightly modified to simultaneously generate and evaluate a set of possible solutions (called as population) instead of processing a solution stepwise in each iteration. The significant features of the COMSOAL include : no parameters settings needed, and a guarantee of feasible solutions. Experimental results show that COMSOAL is a simple but powerful method to quickly generate multiple feasible solutions which are as good as the ones obtained from several other well-known process routing algorithms.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.29-46
• /
• 2007

This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.

• 전자공학회논문지S
• /
• 제35S권1호
• /
• pp.39-51
• /
• 1998

In this paper, we propose signaling procedures amon network elements for a connection rerouting method which can reduce inter-switch handoff processing delay reduces the delay in the connection re-routing by reserving VPI/VCIs for possible inter-switch handoff calls in advance. Additionally, we mathematically analyze the signaling procedures and then suggest solutions to the relations with cluser size, network topoloty, handoff-request rete and handoff delay. With simulation, the solutions are validated. From numerical examples, we concluded taht handoff delay, one of the handoff QoSs, can be satisfied by adjusting the cluster size and network topology according to the handoff -request rate of service area. With our proposed signaling and analytic methods, we concluded that the connection rerouting method using cluster-sectoring effectively reduces the delay of inter-switch handoff processing than dynamic connection rerouting method. Our solutions are useful in guaranteeing the requested handoff delay (especially, inter-switch handoff delay) when the connection rerouting method is applied to ATM-based wireless/wired integrated network.

• 한국정밀공학회지
• /
• 제17권7호
• /
• pp.196-202
• /
• 2000

In the precision point synthesis of mechanisms, it is usually required to solve a system of polynomial equations. With the aid of efficient algorithms such as elimination, it is possible to obtain all the solutions of the equations in the complex domain. But among these solutions only real values can be used fur real mechanisms, while imaginary ones are liable to be discarded. In this article, a method is presented, which leads the imaginary solutions to real domain permitting slight alteration of prescribed positions and eventually increases the number of feasible mechanisms satisfying the desired motion approximately. Two synthesis problems of planar 4-bar path generation and spatial 7-bar motion generation are given to verify the proposed method.

• ETRI Journal
• /
• 제24권2호
• /
• pp.131-141
• /
• 2002

This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.