• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.104-110
• /
• 2008

Detached Eddy Simulation (DES) is applied to an axisymmetric base flow at supersonic mainstream. DES is a hybrid approach to modeling turbulence that combines the best features of the Reynolds-averaged Navier-Stokes (RANS) and large-eddy simulation (LES) approaches. In the Reynolds-averaged mode, the model is currently based on either the Spalart-Allmaras (S-A) turbulence model. In the large eddy simulation mode, it is based on the Smagorinski subgrid scale model. Accurate predictions of the base flowfield and base pressure are successfully achieved by using the DES methodology with less computational cost than that of pure LES and monotone integrated large-eddy simulation (MILES) approaches. The DES accurately resolves the physics of unsteady turbulent motions, such as shear layer rollup, large-eddy motions in the downstream region, small-eddy motions inside the recirculating region. Comparison of the results shows that it is necessary to resolve approaching boundary layers and free shear-layer velocity profiles from the base edge correctly for the accurate prediction of base flows. The consideration of an empirical constant CDES for a compressible flow analysis may suggest that the optimal value of empirical constant CDES may be larger in the flows with strong compressibility than in incompressible flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.789-798
• /
• 2016

In this paper, we propose a cache algorithm based on user's context for enterprise/urban smallcell environments. The smallcell caching method is to store mobile users' data traffic at a storage which is equipped in smallcell base station and it has an effect of reducing core networks traffic volume. In our algorithm, contrary to existing smallcell cache algorithms, the cache storage is equipped in a edge server by using a concept of the Mobile Edge Computing. In order to reflect user's characteristics, the edge server classifies users into several groups based on user's context. Also the edge server changes the storage size and the cache replacement frequency of each group to improve the cache efficiency. As the result of performance evaluation, the proposed algorithm can improve the cache hit ratio by about 11% and cache efficiency by about 5.5% compared to the existing cache algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.11
• /
• pp.2383-2389
• /
• 2002

This paper describes an experimental study on fatigue life extension by using cold working process in fastener hole of aircraft structure. Cold working process was applied for A12024-7351 specimens by considering the effect of edge margin on fatigue life. It is generally recognized that cold working process offers a protective zone around fastener hole of aluminum aircraft structure due to the residual compressive stresses which lead to retardation of crack growth. Thus this process provides the beneficial effect of increasing the fatigue life of the component. there by decreasing maintenance costs. It has also been successfully incorporated into damage tolerance and structural integrity programs. Cold working specimens were tested at constant amplitude peak cyclic stresses. Fatigue life of cold working specimen compared with that of specimen fabricated with base material. The increase of fatigue life for cold working specimen is discussed by both considering the effect of residual compressive stresses measured by X-ray diffraction technique and quantitative effect of edge margin.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.383-403
• /
• 2021

With the development of mobile edge computing (MEC), some late-model application technologies, such as self-driving, augmented reality (AR) and traffic perception, emerge as the times require. Nevertheless, the high-latency and low-reliability of the traditional cloud computing solutions are difficult to meet the requirement of growing smart cars (SCs) with computing-intensive applications. Hence, this paper studies an efficient offloading decision and resource allocation scheme in collaborative vehicular edge computing networks with multiple SCs and multiple MEC servers to reduce latency. To solve this problem with effect, we propose a context-aware offloading strategy based on differential evolution algorithm (DE) by considering vehicle mobility, roadside units (RSUs) coverage, vehicle priority. On this basis, an autoregressive integrated moving average (ARIMA) model is employed to predict idle computing resources according to the base station traffic in different periods. Simulation results demonstrate that the practical performance of the context-aware vehicular task offloading (CAVTO) optimization scheme could reduce the system delay significantly.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.75-82
• /
• 2010

The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.59-66
• /
• 2017

Cloud computing has evolved into a core computing infrastructure for the internet that encompasses content, as well as communications, applications and commerce. By providing powerful computing and communications capabilities in the palm of the hand everywhere with a variety of smart devices, mobile applications such as virtual reality, sensing and navigation have emerged and radically changed the patterns people live. The data that is generated is getting bigger. Cloud computing, on the other hand, has problems with system load and speed due to the collection, processing and control of remote data. To solve this problem, fog computing has been proposed in which data is collected and processed at an edge. In this paper, we propose a system that dynamically selects a fog server that acts as a cloud in the edge. It serves as a mediator in the cloud, and provides information on the services and systems belonging to the cloud to the mobile device so that the mobile device can act as a fog. When the role of the fog system is complete, we provide it to the cloud to virtualize the fog. The heterogeneous problem of data of mobile nodes can be solved by using mDBaaS (Mobile DataBase as a Service) and we propose a system design method for this.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.2
• /
• pp.127-134
• /
• 2004

Control of drag force on a circular cylinder using multiple detached splitter plates is numerically studied for laminar flow Two splitter plates with the same length as the cylinder diameter (d) are placed horizontally in the upstream of the cylinder and in the near-wake region, respectively. Their positions are described by the gap ratios (G$_1$/d, G$_2$/d), where G$_1$ represents the gap between the cylinder stagnation point and the rear edge of the upstream splitter plate, and G$_2$ represents the gap between the cylinder base point and the leading edge of the rear splitter plate. The drag varies with the two gap ratios; it has the minimum value at a certain set of gap ratios for each Reynolds number The upstream splitter plate decreases the stagnation pressure, while the rear splitter plate increases the base pressure by suppressing vortex shedding. This combined effect causes a significant drag reduction on the cylinder Particularly, the drag sharply increases past an optimum G$_2$/d; this seems to be related to a sudden change in bubble size in the wake region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.582-591
• /
• 2009

The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.