• Journal of Korean Society of Water and Wastewater
• /
• v.8 no.1
• /
• pp.18-26
• /
• 1994

This research investigated efficient operation mode for the successful performance of SBR(sequencing batch reactor) treating fish processing wastewater, and the effect of sodium chloride (NaCl) on treatment efficiency. 2-hour-annerobic, 6-hour-aerobic and 3-hour-anoxic operation during reaction period was found an effective operating method for organic and nitrogen removal from fish processing wastewater in SBR system. The average removal efficiencies of COD, BOD, and total nitrogen in SBR operated continuousely were 91%, 95%, and 67.1%, respectively. The estimated values of biomass yield coefficient(Y), microbial decay coefficient($K_d$), and bioreaction rate constant(K) were $0.35gMLSS/gCOD_{removed}$, $0.015day^{-1}$, and $0.209hr^{-1}$, respectively. As NaCl concentration increased from 5 to 30g/L, sludge settleability was cnhanced but organic removal in the reactor was decreased. NaCl of influent had considerable relationship with COD removal, whereas it did not significant affect nitrogen removal.

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• v.27 no.5
• /
• pp.268-273
• /
• 2017

In this study, nickel hydroxide crystalline powders were synthesized by continuous reaction in the taylor fluid flow using nickel chloride, nickel sulphate and sodium hydroxide as raw materials and compared with those prepared by a conventional batch type reaction. The crystallinity of nickel hydroxide prepared by the Taylor fluid flow reaction was higher than that of nickel hydroxide obtained by batch reaction. The particle size of nickel hydroxide decreased about 2.5 to 3.6 times, and the specific surface area was increased.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.442-450
• /
• 2006

Inter-operability between heterogeneous radio access technologies (RATs), in the sense of seamless vertical han-dover (VHO) support with common radio resource management (CRRM) functionalities, has recently attracted a significant research attention and has become a prominent issue in standardization fora. In this paper, we formulate the problem of load balancing between cooperative RAT's as a mathematical program and by trading off a pre-defined delay tolerance per request we propose a vertical handover batch processing (VHBP) scheme. To quantify the performance of the proposed VHBP scheme we compare it with a baseline processing scheme, where each VHO request is processed independently under a number of different network scenarios. Numerical investigations reveal significant net benefits of the proposed scheme compared with the baseline, both in terms of achieved load balancing levels but also with regard to the acceptance rate of the VHO requests.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1900-1906
• /
• 1997

In this paper, the efficient BILBO(named EBILBO) is designed for BIST that is able to batch the testing when circuit is designed on FPGA. The proposed algorithm of batch testing is able to test the normal operation speed with one-pin-count that can control all part of large and complex circuit. PRTPG is used for the test pattern and MISR is used for PSA. The proposed algorithm of batch testing is VHDL coding on behavioral description, so it is easily modified the model of test pattern generation, signature analysis and compression. The EBILBO's area and the performance of designed BIST are evaluated with ISCAS89 benchmark circuit on FPGA. In circuit with above 600 cells, it is shown that area is reduced below 30%, test pattern is flexibly generated about 500K and the fault coverage is from 88.3% to 100%. EBILBO for the proposed batch testing BIST is able to execute concurrently normal and test mode operation in real time to the number of $s+n+(2^s/2^p-1)$ clock(where, in CUT, # of PI;n, # of register, p is order # of polynomial). The proposed algorithm coded with VHDL is made of library, then it well be widely applied to DFT that satisfy the design and test field on sme time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.6
• /
• pp.537-544
• /
• 2004

An effective methodology is reported for determining the optimal lot size of batch processing and storage networks which include uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, infernally consumed, transported to or from other sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sires while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of the global supply chain.

• Journal of Microbiology and Biotechnology
• /
• v.11 no.5
• /
• pp.887-889
• /
• 2001

The gene encoding yeast pro-carboxypeptidase Y (pro-CPY) has been cloned and expressed in Escherichia coli. Most of the expressed pro-CPY was accumulated as cytoplasmic insoluble aggregates. In our previous study, active CPY was obtained by renaturation of entirely denatured pro-CPY followed by in vitro proteolytic processing with proteinase K along with the activation process. The same refolding process was performed to produce an active CPY from pro-CPY inclusion bodies with renaturation buffers containing proteinase K at different concentrations. The refolding efficiency decreased from $25\%\;to\;2\%$ in the renaturation buffers containing proteinase K at concentrations of $60{\mu}g/ml\;and\;0.6{\mu}g/mi$, respectively. In an attempt to increase the refolding efficiency with a lesser amount of proteinase K, a novel fed-batch refolding process was developed. In a fed-batch refolding, 99 ml of the renaturation buffer containing pro-CPY was gradually added into 1 ml of the renaturation buffer containing $60{\mu}g/ml$ of proteinase K to give a final proteinase K concentration of $0.6{\mu}g/ml$. The fed-batch refolding process resulted in a refolding efficiency of $18\%$, which corresponded to a 9-fold increase over that ($2\%$) in the batch process.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.223-224
• /
• 2021

Recently, k-farthest neighbor (kFN) queries have not as much attention as k-nearest neighbor (kNN) queries. Therefore, this study considers moving k-farthest neighbor (MkFN) queries for spatial network databases. Given a positive integer k, a moving query point q, and a set of data points P, MkFN queries can constantly retrieve k data points that are farthest from the query point q. The challenge with processing MkFN queries in spatial networks is to avoid unnecessary or superfluous distance calculations between the query and associated data points. This study proposes a batch processing algorithm, called MOFA, to enable efficient processing of MkFN queries in spatial networks. MOFA aims to avoid dispensable distance computations based on the clustering of both query and data points. Moreover, a time complexity analysis is presented to clarify the effect of the clustering method on the query processing time. Extensive experiments using real-world roadmaps demonstrated the efficiency and scalability of the MOFA when compared with a conventional solution.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.481-488
• /
• 2008

This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.175-190
• /
• 2012

Shuffling is an effective method to build a publicly verifiable mix network to implement verifiable anonymous channels that can be used for important cryptographic applications like electronic voting and electronic cash. One shuffling scheme by Groth is claimed to be secure and efficient. However, its soundness has not been formally proven. An attack against the soundness of this shuffling scheme is presented in this paper. Such an attack compromises the soundness of the mix network based on it. Two new shuffling protocols are designed on the basis of Groth's shuffling and batch verification techniques. The first new protocol is not completely sound, but is formally analyzed in regards to soundness, so it can be applied to build a mix network with formally proven soundness. The second new protocol is completely sound, so is more convenient to apply. Formal analysis in this paper guarantees that both new shuffling protocols can be employed to build mix networks with formally provable soundness. Both protocols prevent the attack against soundness in Groth's scheme. Both new shuffling protocols are very efficient as batch-verification-based efficiency-improving mechanisms have been adopted. The second protocol is even simpler and more elegant than the first one as it is based on a novel batch cryptographic technique.