• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.763-766
• /
• 2011

Timely management is an important activity in long running transactions. This can be seen in many Supply Chain scenarios where insufficient time management could lead to expensive compensations. Therefore, effective strategy for timely management in long running transactions is needed. In this paper, we propose our solution to detect and avoid violating deadline based on a comparison strategy of predicted complete time and required deadline. Three approaches are used. Firstly, we build Open Nested Transaction Model (ONTM) where deadline of top-level transactions are managed through a flexible time adjustment of lower level transactions. Secondly, workflow is introduced to WSTransaction framework which supports the algorithm to predict complete time and spot delaying activities. Thirdly, a rule-based coordinator is developed to decide the confirmation or cancelation of participants' ongoing activities. We also discuss a workflow example for implementation.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1337-1349
• /
• 2011

So far as a solution of the given consistent linear system is concerned many numerical methods - both mathematically non-iterative as well as iterative - have been reported in the literature over the last couple of centuries. Most of these methods consider all the equations including linearly dependent ones in the system and obtain a solution whenever it exists. Since linearly dependent equations do not add any new information to a system concerning a solution we have proposed an algorithm that identifies them and prunes them in the process of solving the system. The pruning process does not involve row/column interchanges as in the case of Gauss reduction with partial/complete pivoting. We demonstrate here that the use of pruning as an inbuilt part of our solution process reduces computational and storage complexities and also computational error.

• 한국잠사곤충학회지
• /
• 제36권2호
• /
• pp.152-156
• /
• 1994

생사에 G.A.(glutaraldehyde)와 formalin을 혼합처리하는 방법으로 세리신정착을 실시한 다음 세리신 정착효과, 정착에 따른 백도의 변화, 물성 변화 등을 검토한 결과를 요약하면 다음과 같다. 1. G.A. 농도에 관계 없이 formalin 1% 용액 이상으로 정착하면 미정착사의 96%까지 백도가 향상된다. 2. Formalin G.A의 혼합처리에 의해 정련에 의한 백도 감소를 방지할 수 있었다. 3. Formalin 0.5% 용액 혼합처리로 완전한 세리신 정착을 얻을 수 있었다. 4. 세리신정착처리는 미정착사에 비해 강·신도의 증가를 가져왔다. 5. 정착사와 미정착사의 표면구조는 큰 차이가 없었다.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.161-176
• /
• 2005

In a situation that ordinal preferences on multiattribute weights are captured, we present two solution approaches: an exact approach and an approximate method. The former, an exact solution approach via interaction with a decision-maker, pursues the progressive reduction of a set of non-dominated alternatives by narrowing down the feasible attribute weights region. Subsequent interactive questions and responses, however, sometimes may not guarantee the best alternative or a complete rank order of a set of alternatives that the decision-maker desires to have. Approximate solution approaches, on the other hand, can be divided into three categories including surrogate weights methods, dominance value-based decision rules, and three classical decision rules. Their efficacies are evaluated in terms of choice accuracy via a simulation analysis. The simulation results indicate that a proposed hybrid approach, intended to combine an exact solution approach through interaction and a dominance value-based approach, is recommendable for aiding a decision making in a case that a final choice is seldom made at single step under attribute weights that are imprecisely specified beyond ordinal descriptions.

• 한국컴퓨터정보학회논문지
• /
• 제20권7호
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Bulletin of the Korean Chemical Society
• /
• 제19권10호
• /
• pp.1036-1042
• /
• 1998

The preconcentration and determination of trace elements in water samples were studied by a solvent sublation utilizing dithizonate complexation. After metal dithizonates were formed, trace amounts of cadmium, cobalt, copper and lead were floated and extracted into small volume of a water-immiscible organic solvent on the surface of sample solution and determined in the solvent directly by GF-AAS. Several experimental conditions as formation condition of metal-dithizonate complexes, pH of solution, amount of dithizone, stirring time, the type and amount of surfactants, N2 bubbling rate and so on were optimized for the complete formation and effective flotation of the complexes. And also four kinds of light solvents were compared each other to extract the floated complexes, effectively. After the pH was adjusted to 4.0 with 5 M HNO3, 8.0 mL of 0.05% acetone solution of dithizone was added to 1.00 L water sample. The dithizonate complexes were flotated and extracted into the upper methyl isobutylketone (MIBK) layer by the addition of 2.0 mL 0.2% ethanolic sodium lauryl sulfate solution and with the aid of small nitrogen gas bubbles. And this solvent sublation method was applied to the analysis of real water samples and good results of more than 85% recoveries were obtained in spiked samples.

• 한국인터넷방송통신학회논문지
• /
• 제21권2호
• /
• pp.169-175
• /
• 2021

로트 크기 문제(LSP)는 다항시간으로 최적 해를 찾을 수 있는 알고리즘이 알려져 있지 않은 NP-완전의 난제이다. LSP에 대해 다항시간으로 해를 구할 수 있는 W-W 알고리즘이 알려져 있지만, 이 알고리즘은 너무나 복잡하여 이해와 적용에 어려움이 있어 S-M의 휴리스틱 근사 알고리즘이 제안되었다. 본 논문에서는 LSP의 근사 해가 아닌 최적 해를 찾을 수 있는 간단한 공식을 가진 O(n)의 선형 복잡도 알고리즘을 제안하였다. 제안된 알고리즘은 t시점에서의 로트 크기(생산량) Xt∗은 비축 비가 절차 비를 초과하지 않는 t+k 시점을 결정하여 [t,t+k] 구간의 요구량 합으로 단순히 결정하였다. 제안된 알고리즘을 다양한 실험 데이터에 적용한 결과 모든 데이터에 대해 최적 해를 찾았다.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.749-759
• /
• 2024

In this manuscript, we formulate the notion of Ω(H, θ)-contraction on a self mapping f : W → W, this contraction based on the concept of Ω-distance mappings equipped on G-metric spaces together with the concept of H-simulation functions and the class of Θ-functions, we employ our new contraction to unify the existence and uniqueness of some new fixed point results. Moreover, we formulate a numerical example and a significant application to show the novelty of our results; our application is based on the significant idea that the solution of an equation in a certain condition is similar to the solution of a fixed point equation. We are utilizing this idea to prove that the equation, under certain conditions, not only has a solution as the Intermediate Value Theorem says but also that this solution is unique.

• Restorative Dentistry and Endodontics
• /
• 제26권4호
• /
• pp.341-349
• /
• 2001

Dental caries is the most common oral disease. There are many factors contributing to its development, but complete understanding and prevention are not fully known. However, it is possible to remineralize the early enamel curious lesion by fluoride containing remineralization solution. Recently the pH-cycling model has been used to examine the effect of fluoride solution on remineralization of artificial caries in vitro as it can closely simulate the conditions encountered in vivo within a carefully controlled environment. The aim of this study was to evaluate the remineralizing effects of supersaturated buffer solutions under pH-cycling model. The specimen with 3mm-diameter was made using mature bovine incisors which has no caries and has sound enamel surface. Early curious lesions were produced by suspending each specimens into demineralization solution at pH 5.0 for 33 hours and the specimen whose surface hardness value ranged from 25 to 45 VHN were used. The pH cycling treatment regimen consisted of 5 min soaks of three treatment solutions four times per days for 15 days and the continuous cycling of demineralization and remineralization were carried out for 15 days. Following the pH-cycling treatment regimen, the specimens' surface microhardness were measured by the Vickers hardness test (VHN) and analyzed by ANOVA and Duncan's multiple-range test. 1. The surface microhardness value of supersaturated solution, Senstime, and Gagline groups were increased after pH cycling, and that of supersaturated solution was significantly Increased compared to saline group(P<0.05). 2. The surface remineralization effect of fluoride containing solutions was accelerated by saliva under pH-cycling mode 3. The pH cycling model was considered appropriate to mimic the intra-oral pH changes when evaluating demineralization and remineralization in vitro. Under the results of above study, salivary remineralization effect can be improved by fluoride containing remineralization solution. The pH-cycling model was considered appropriate to mimic the intra-oral pH changes when evaluating demineralization and remineralization in vitro.

• 대한교통학회지
• /
• 제23권4호
• /
• pp.81-91
• /
• 2005

외판원 문제(TSP; Traveling Salesman Problem)는 경로탐색 최적화문제로 '풀리지 않는 문제'(NP-complete; None-deterministic Polynomial-time complete)에 속하므로 경유지 수가 많아짐에 따라 급격히 계산시간이 증가한다. 때문에 적용시 정확한 최적해보다는 최적 근사해에 대한 발견적 (heuristic) 알고리즘들을 이용한다. 본 연구는 TSP에 적용되는 발견적 알고리즘으로 개미 시스템알고리즘(ASA; Ant System Algorithm)을 검토하고. 국내 택배시스템에 ASA의 적용가능성을 검토하였다. ASA는 NP-complete 문제를 위한 발견적 알고리즘으로, 1990년대 초 M. Dorigo 등에 의해 연구되어졌다. ASA는 개미들이 이동간에 페로몬이라는 일종의 화학물질을 분비할 때, 이동경로 상에 분비된 페로몬 누적에 따라 확률적 방법으로 경로를 결정하게 된다. 이러한 ASA는 NP-complete문제에서 계산시간이나 최단경로탐색에서 우수한 결과를 얻는 것으로 발표되고 있으며, 교통분야에서 차량경로탐색뿐만 아니라 네트워크 관리 및 도로선형계획 등 그 적용범위가 점차 확대되어지고 있다. 현재 국내 택배시스템에서 차량배차시 명확한 기준이 없으며 주로 담당 운전자의 경험과 판단에 의해 결정된다. 본 연구에서는 국내택배시스템에 ASA의 적용가능성을 검토하였다. 담당 운전자의 경로결정이 가로 10.0km, 세로 10.0km의 범위에서 인접이웃알고리즘(NNA: Nearest Neighbor Algorithm)을 따른다고 가정했을 때와 랜덤한 20개의 경유지를 가질 때, 그리고 경유지 수를 10개씩 증가하여 200개까지 증가할 때를 비교 분석한 결과, ASA이 NNA 보다 우수하였다. ASA을 국내택배시스템에 적용시 운송비용 절감 등의 운영개선을 기대할 수 있으며, 특히 영세한 택배업체에서 보다 저렴하고 우수한 택배시스템을 구축할 수 있을 것으로 보인다.