• Journal of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1301-1321
• /
• 2012

In this paper we study the unique solvability of backward stochastic Volterra integral equations (BSVIEs in short), in terms of both the adapted M-solutions introduced in [19] and the adapted solutions via a new method. A general existence and uniqueness of adapted M-solutions is proved under non-Lipschitz conditions by virtue of a briefer argument than the ones in [13] and [19], which modifies and extends the results in [13] and [19] respectively. For the adapted solutions, the unique solvability of BSVIEs under more general stochastic non-Lipschitz conditions is shown, which improves and generalizes the results in [7], [14] and [15].

• International Journal of Fluid Machinery and Systems
• /
• v.3 no.4
• /
• pp.315-323
• /
• 2010

This work investigates the influence of water compressibility on pressure pulsations induced by rotor-stator interaction (RSI) in hydraulic machinery, using the commercial CFD solver ANSYS-CFX. A pipe flow example with harmonic velocity excitation at the inlet plane is simulated using different grid densities and time step sizes. Results are compared with a validated code for hydraulic networks (SIMSEN). Subsequently, the solution procedure is applied to a simplified 2.5-dimensional pump-turbine configuration in prototype with different speeds of sound as well as in model scale with an adapted speed of sound. Pressure fluctuations are compared with numerical and experimental data based on prototype scale. The good agreement indicates that the scaling of acoustic effects with an adapted speed of sound works well. With respect to pressure fluctuation amplitudes along the centerline of runner channels, incompressible solutions exhibit a linear decrease while compressible solutions exhibit sinusoidal distributions with maximum values at half the channel length, coinciding with analytical solutions of one-dimensional acoustics. Furthermore, in compressible simulation the amplification of pressure fluctuations is observed from the inlet of stay vane channels to the spiral case wall. Finally, the procedure is applied to a three-dimensional pump configuration in model scale with adapted speed of sound. Normalized Pressure fluctuations are compared with results from prototype measurements. Compared to incompressible computations, compressible simulations provide similar pressure fluctuations in vaneless space, but pressure fluctuations in spiral case and penstock may be much higher.

• Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.295-311
• /
• 2016

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.127-135
• /
• 2000

This paper provides a new method of initializing neurons used in self-organizing neural networks and sequencing input nodes for applying to Euclidean traveling salesman problem. We use a general property that in any optimal solution for Euclidean traveling salesman problem, vertices located on the convex hull are visited in the order in which they appear on the convex hull boundary. We composite input nodes as number of convex hulls and initialize neurons as shape of the external convex hull. And then adapt input nodes as the convex hull unit and all convex hulls are adapted as same pattern, clockwise or counterclockwise. As a result of our experiments, we obtain l∼3 % improved solutions and these solutions can be used for initial solutions of any global search algorithms.

• Journal of Soil and Groundwater Environment
• /
• v.17 no.4
• /
• pp.9-18
• /
• 2012

This study was carried out to leach valuable metal ions from the mine waste ore using the adapted indigenous bacteria. In order to tolerance the heavy metals, the indigenous bacteria were repeatedly subcultured in the adaptation-medium containing $CuSO_4{\cdot}5H_2O$ for 3 weeks and 6 weeks, respectively. As the adaptation experiment processed, the pH was rapidly decrease in the adaptation-medium of 6 weeks more than the 3 weeks. The result of bioleaching with the adapted bacteria for 42 days, the pH value of leaching-medium in the 3 weeks tend to increased, whereas the pH of the 6 weeks decreased. In decreasing the pH value in the adaptation-medium and in the leaching-medium, it was identified that the indigenous bacteria were adapted $Cu^{2+}$ the ion and the mine waste ores. The contents of Cu, Fe and Zn in the leaching solution were usually higher leached in 6 weeks than 3 weeks due to the adaptation. Considering the bioleaching rates of Cu, Fe and Zn from these leaching solutions, the highest increasing the efficiency metal ion were found to be Fe. Accordingly, it is expected that the more valuable element ions can be leached out from the any mine waste, if the adapted bacteria with heavy metals will apply in future bioleaching experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.4
• /
• pp.255-262
• /
• 2007

In the finite element analysis of forming process, objects are described with a finite number of elements and nodes and the approximated solutions can be obtained by the variational principle. One of the shortcomings of a finite element analysis is that the structure of mesh has become inefficient and unusable because discretization error increases as deformation proceeds due to severe distortion of elements. If the state of current mesh satisfies a certain remeshing criterion, analysis is stopped instantly and resumed with a reconstructed mesh. In the study, a new remeshing algorithm using tetrahedral elements has been developed, which is adapted to the desired mesh density. In order to reduce the discretization error, desired mesh sizes in each lesion of the workpiece are calculated using the Zinkiewicz and Zhu's a-posteriori error estimation scheme. The pre-constructed mesh is constructed based on the modified point insertion technique which is adapted to the density function. The object domain is divided into uniformly-sized sub-domains and the numbers of nodes in each sub-domain are redistributed, respectively. After finishing the redistribution process of nodes, a tetrahedral mesh is reconstructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.

• Reproductive and Developmental Biology
• /
• v.30 no.1
• /
• pp.71-74
• /
• 2006

Hypoosmotic swelling test (HOST) is used for evaluating the plasma membrane function and fertilizing ability in mammal spermatozoa. However, HOS solutions and experimental conditions have not been determined clearly for assessing canine spermatozoa. This study was conducted to examine the HOS solutions and assay conditions, including incubation time (30 to 120 min), storage temperature (4, 17 and $20^{\circ}C$), semen status (fresh and frozen). Maximum spermatozoal plasma membrane swelling was obtained in an 150 mOsm Na-citrate/Fructose solutions with an incubation time for 45 min. The storage temperature and semen status affected the percentage of HOS positive spermatozoa. The HOS test adapted to canine spermatozoa in this study was simple and highly consistent assay with good repeatability. The optimal condition of HOST in canine spermatozoa is an 150 mOsm Na-citrate/Fructose solutions with an incubation time for 45 min regardless of semen storage temperature and semen status.

• Journal of Mechanical Science and Technology
• /
• v.18 no.9
• /
• pp.1512-1518
• /
• 2004

Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.97-102
• /
• 2004

AGV flowpath layout design is one of the most important steps for efficient AGV systems design. Since it was formulated by Gaskins & Tanchoco (1987), a unidirectional AGV flowpath layout design problem has been tackled by many researchers. However, the solution methods were traded off between the solution quality and the computational time. In this paper, a tabu search technique is applied to obtain a good solution for a relatively large problem in reasonable computational time. Specifically, fast construction algorithm for feasible initial solutions, long-term memory structure and neighbor solutions generation are adapted to the problem characteristics and embedded in the tabu search algorithm. Also, sets of computational experiments show that the proposed tabu search algorithm outperforms to the Ko and Egbelu's algorithm (2003).

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.55-58
• /
• 2000

EC, which is done the virtual space through Web, has weakly like security problem because anybody can easily access to the system due to open network attribute of Web. Therefore, we need the solutions that protect the Web security for safe and useful EC. One of these solutions is the implementation of a strong cipher system. NC(Nonpolynomial Complete) cipher system proposed in this paper is advantage for the Web security and it overcomes the limit of the 64 bits cipher system using 128 bits key length for input, output, encryption key and 16 rounds. Moreover, it is designed for the increase of time complexity by adapted more complex design for key scheduling regarded as one of the important element effected to encryption.