• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.4
• /
• pp.594-600
• /
• 1994

The maximum charge accumulation in transformers caused by streaming electrification is commonly observed on the bottom area of transformer winding(i.e.the oil inlet of transformer winding). It is because turbulent flows occur in this portion of transformers. Consequently, if we are to reduce the maximum charge accumulation of transformers, it is important that we should have a good understanding of the conditions of the occurence of partial turbulent flows in the oil inlet of transformer winding. With this point in mind, a simple flow model was designed in this study in order to simulate oil flow in the insulation ducts of power transformers. As a method for mitigating charge accummulation, attention was given to (a) a flow path design for the improvement of flow conditions, and (b) the charge tendency of the material used this design. The results of this study show that the above method is useful for mitigating charge accumulation.

• Journal of Families and Better Life
• /
• v.22 no.5
• /
• pp.47-58
• /
• 2004

In this article the relations between demographics, variables related to credit card, flow and compulsive buying tendency were explored. The survey data collected from 318 university students. The results of regression analysis showed that older students were related to the greater number of card. The greater allowance and number of card were related to the greater average card expenditure per month. Female, younger and the greater average card expenditure per month were related to greater flow. And younger students tended to be more compulsive buying tendency than older students. The greater allowance and flow were related to greater compulsive buying tendency. The results of path analysis showed that the age, allowance and flow influenced on compulsive buying tendency direct. Also age and allowance influenced on compulsive buying tendency direct and indirect.

• Fashion & Textile Research Journal
• /
• v.15 no.4
• /
• pp.533-542
• /
• 2013

Fashion products are frequently purchased on impulse and are also one of the most popular product categories sold online. Online environment attributes can facilitate flow experiences that are described as an optimal psychological state reached during an engagement in activities (e.g., games and e-shopping). This study estimated the path model to examine the causal relationships among shopping mall attributes, flow, e-impulse buying, and consumer satisfaction for fashion products. A total of 598 usable questionnaires were obtained from college students who had purchased fashion products through the Internet. Data were analyzed by exploratory factor analysis, confirmatory factor analysis, and path analysis using SPSS 18.0 and AMOS 18.0. The results showed that e-shopping mall attributes (visual attributes and product attributes) significantly influenced e-impulse buying (fashion-oriented impulse buying and promotion-oriented impulse buying) which was mediated by the consumer flow experience and then influenced by consumer satisfaction. In the path model, the flow was stimulated by shopping mall attributes, the e-impulse buying was influenced by flow, and the consumer satisfaction was influenced by e-impulse buying. Flow was the most highly related to the fashion-oriented impulse buying, and followed by the relationship of the flow and promotion-oriented impulse buying in the context of e-shopping for fashion products. A managerial implication was discussed for fashion product e-retailers to develop strategies on visual attributes and product attributes that could stimulate and increase the consumer flow to trigger impulse buying as well as consumer satisfaction.

• IE interfaces
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Journal of Soil and Groundwater Environment
• /
• v.28 no.6
• /
• pp.9-15
• /
• 2023

In order to properly evaluate the spatio-temporal variations of groundwater flow, the data obtained in field experiments should be corroborated into numerical simulations. Particle tracking method is a simple simulation tool often employed in groundwater simulation to predict groundwater flow paths or solute transport paths. Particle tracking simulations visually show overall the particle flow path along the entire aquifer, but no previous simulation studies has yet described the parameter values at grid nodes around the particle path. Therefore, in this study, a new technical approach was proposed that enables acquisition of parameters associated with particle transport in grid nodes distributed in the center of the particle path in groundwater. Since the particle tracking path is commonly referred to as streamline, the algorithm and codes developed in this works designated streamline analysis method. The streamline analysis method can be applied in two-dimensional and three-dimensional finite element or finite difference grid networks, and can be utilized not only in the groundwater field but also in all fields that perform numerical modeling.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.10a
• /
• pp.195-199
• /
• 2001

The flow turning process, an incremental forming process, is a cost-effective forming method for axi-symmetric intricate parts to net shape. However, the flow turning process shows a fairly complicated deformation, it is very difficult to obtain satisfactory results. Therefore extensive experimental and analytical research has not been carried out. In this study, an fundamental experiment was conducted to improve productivity with process parameters such as tool path, angle of roller holder($\alpha$), feed rate(v ) and comer radius of forming roller(Rr). These factors were selected as variables in the experiment because they were most likely expected to have an effect on spring back. The clearance was controlled in order to achieve the precision product which is comparable to deep drawing one. And also thickness and diameter distributions of a multistage cup obtained by flow turning process were observed and compared with those of a commercial product produced by conventional deep drawing.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.5
• /
• pp.197-212
• /
• 1997

The performance of a torque converter can be expressed by the performance parameters such as flow radius and flow angle, on the mean flow path. The geometric analysis of the torque converter is required to determine these parameters for the modeling of the torque converter. In general, the blade shape is depicted by three dimensional data at the mid-surface of blade or those of the pressure and suction side. To generate three dimensional model of the blade using the data mentioned above, a consistent data format and a shape generation algorithm are required. This paper presents a useful consistent data format of the blades and an algorithm for the geometrical shape generation. By the geometric analysis program to which the shape generation algorithm is embedded, the variation of blade angles in rotating element analyzed. Then finally, the analyzed results of geometric profile of a blade are compared with those of the blade design principle, so called forced vortex theorem.