• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.7-18
• /
• 2000

KS-SIGNAL, a traffic signal optimization model for coordinated arterials, is an optimization model using the mixed integer linear Programming that minimizes total delay on arterials by optimizing left-turn Phase sequences. However, the Previous version of KS-SIGNAL had a difficulty in reducing computation speed because the related variables and constraints multiply rapidly in accordance with the increase of intersections. This study is designed to propose a new model, improving optimizing computation speed in KS-SIGMAl, and evaluate it. This Paper Puts forth three kinds of methodological approaches as to achieve the above goals. At the first step to reduce run-time in the proposed model objective function and a few constraints are Partially modified, which replaces variable in related to queue clearance time with constant, by using thru-movements at upstream intersection and the length of red time at downstream intersection. The result shows that the run-time can be reduced up to 70% at this step. The second step to load the library in LINDO for Windows, in order to solve mixed integer linear programming. The result suggests that run-time can be reduced obviously up to 99% of the first step result. The third step is to add constraints in related to left-turn Phase sequences. The proposed methodological approach, not optimizing all kinds of left-turn sequences, is more reasonable than that of previous model , only in the view of reducing run-tim. In conclusion, run-time could be reduced up to 30% compared with the second results. This Proposed model was tested by several optimization scenarios. The results in this study reveals that signal timing plan in KS-SIGNAL is closer to PASSER-II (bandwidth maximizing model) rather than to TRANSYT-7F(delay minimizing model).

• Journal of Computing Science and Engineering
• /
• v.6 no.1
• /
• pp.12-25
• /
• 2012

For real-time systems it is important to obtain the accurate worst-case execution time (WCET). Furthermore, how to improve the WCET of applications that run on multicore processors is both significant and challenging as the WCET can be largely affected by the possible inter-core interferences in shared resources such as the shared L2 cache. In order to solve this problem, we propose an innovative approach that adopts a code positioning method to reduce the inter-core L2 cache interferences between the different real-time threads that adaptively run in a multi-core processor by using different strategies. The worst-case-oriented strategy is designed to decrease the worst-case WCET among these threads to as low as possible. The other two strategies aim at reducing the WCET of each thread to almost equal percentage or amount. Our experiments indicate that the proposed multicore-aware code positioning approaches, not only improve the worst-case performance of the real-time threads but also make good tradeoffs between efficiency and fairness for threads that run on multicore platforms.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.15-24
• /
• 1999

In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result. it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB.

• Journal of Korean Society on Water Environment
• /
• v.20 no.5
• /
• pp.457-465
• /
• 2004

The objective of this study is to evaluate the possibility to apply the Moving Bed Biofilm Reactor(MBBR) in the activated sludge treatment process with existing aerobic HRT. Optimal operation conditions were assumed according to the analysis of organic matter and nutrients removal efficiencies depending on loading variations. The process was operated under different conditions: RUN I(HRT=7.14hr, $I{\cdot}R=100%$), RUN II(HRT=6.22hr, $I{\cdot}R=100%$), RUN III(HRT=6.22 hr, $I{\cdot}R=150%$), RUN IV(HRT=6.22hr, $I{\cdot}R=200%$), the TBOD removal efficien cies are 88%, 88.5%, 94.6%, 97.6%, respectively. Overall TSS removal efficiency is 90%, and it is increasing in RUN IV. In the case of Nitrogen, the highest removal efficiency of 90% was observed in RUN III and RUN IV, Nitrification and Denitrification rates are 0.013-0.016kg $NH_3-N/kg$ Mv-d and 0.009-0.019kg $NO_3/kg$ Mv-d, respectively. Phosphorus removal efficiencies are 89.6% in RUN I, 91.5% in RUN II, 84.3% in RUN III, and 76.4% in RUN IV. The process under shorter SRT yields better performance in terms of phosphorus removal. It was noticed that to achieve the effluent phosphorus concentration ofless than 1mg/L and removal efficiency higher than 80%, SRT should not be longer than 10 days. Experimental result shows that HRT of 6.22 hours is suitable for this treatment process, and, as a result, the aerobic reactor including moving media and DO depletion tank have a sufficient effect to the process performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.9-17
• /
• 2006

This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.387-396
• /
• 2003

This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with minimum number of Steiner Points).Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with $n^{O(1)}$ run time. The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

• Journal of Environmental Health Sciences
• /
• v.27 no.3
• /
• pp.99-106
• /
• 2001

A laboratory experiment was performed to investigate phosphorus and nitrogen removal from synthetic wastewater by intermittently activated sludge process packed with aluminium plate. Three continuous experimental systems, I. e. an intermittently activated sludge process(Run A), an intermittently activated sludge process with an aluminium plate packed into the reactor(Run B), and a reactor post stage(Run C) were compared. In the batch experiments, the phosphorus removal time in the reactor packed with copper and aluminium plate simultaneously was faster than that of the reactor packed with only an aluminium plates. However, the reactor packed with only an aluminium plate could be used for phosphorus removal. Move phosphorus was removed with an increase of surface area of aluminium plate and electrolysis(NaCl) concentration. The efficiency of COD and nitrogen removal was not affected in Run B. However, the phosphrus removal efficiency decreased because of reaction products and activated sludge which gradually covered gradually the surface of the aluminium plate. The efficiency of phosphorus removal in Run C was 86.3% at the HRT of 3.2 hours. Especially, the efficiency of phosphorus removal in Run C was higher than that in Run B.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.4
• /
• pp.163-171
• /
• 2020

The study aims to examine the effects of inward every presence of foreign investment, import, and real exchange rate shocks on export performance in Vietnam. This study employs a time-series sample dataset in the period of 2009 - 2018. All data are collected from the General Statistics Office of Ministry of Planning and Investment in Vietnam, World Development Indicator and Ministry of Finance, State Bank of Vietnam. This study employs the Augmented Dickey-Fuller test and the vector error correction model with the analysis of cointegration. The results demonstrate that a higher value of import significantly accelerates export performance in the short run, but insignificantly generates in the long run. When the volume of registered foreign investment goes up, the export performance will predominantly decrease in the both short run and long run. Historically, countries worldwide are more likely to devaluate their currencies in order to support export performance. According to the study, the exchange rate volatility has an effect on the external trade in the long run but no effect in the short run. Finally, Vietnam's export performance converges on its long-run equilibrium by roughly 6.3% with the speed adjustment via a combination of import, every presence of foreign investment, and real exchange rate fluctuations.

• The Journal of Asian Finance, Economics and Business
• /
• v.10 no.2
• /
• pp.203-212
• /
• 2023

This research work aims to investigate the role of FDI in Economic Development by assessing its relationship with GDP per capita in Vietnam +5 from 1986-2020. Through descriptive statistical, correlation matrix analysis, and econometric models, including Vector Error Correction Model (VECM) and Feasible Generalized Least Squares (FGLS) estimation methods using Stata 15.1. The VECM estimation method results show that FDI positively impacts Economic Development in the short run while not finding a long-run relationship. In addition, it is found that a clear relationship between Exports and Economic Development in both the short run and the long run. Meanwhile, CO2 emissions and Employment Opportunities have no clear relationship with Economic Development in the short run. However, the relationship is reversed in the long run, as the empirical study in Vietnam. The results of the FGLS estimation method show that FDI, CO2 emissions, and Exports have a significant and positive impact on Economic Development in five selected Southeast Asian countries without Employment Opportunities in the long run. From these findings, the author proposes some policy implications of attaching FDI to sustainable Economic Development in Vietnam next time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.396-413
• /
• 2017

Dynamically checking the integrity of software at run-time is always a hot and difficult spot for trusted computing. Control-flow integrity is a basic and important safety property of software integrity. Many classic and emerging security attacks who introduce illegal control-flow to applications can cause unpredictable behaviors of computer-based systems. In this paper, we present a software-based approach to checking violation of control flow integrity at run-time. This paper proposes a high-performance and low-overhead software control flow checking solution, control flow checking at virtual edges (CFCVE). CFCVE assigns a unique signature to each basic block and then inserts a virtual vertex into each edge at compile time. This together with insertion of signature updating instructions and checking instructions into corresponding vertexes and virtual vertexes. Control flow faults can be detected by comparing the run-time signature with the saved one at compile time. Our experimental results show that CFCVE incurs only 10.61% performance overhead on average for several C benchmark programs and the average undetected error rate is only 9.29%. Compared with previous techniques, CFCVE has the characteristics of both high fault coverage and low memory and performance overhead.