• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.361-369
• /
• 2018

For a given graph G = (V, E), a set $D{\subseteq}V(G)$ is said to be an outer-connected vertex edge dominating set if D is a vertex edge dominating set and the graph $G{\backslash}D$ is connected. The outer-connected vertex edge domination number of a graph G, denoted by ${\gamma}^{oc}_{ve}(G)$, is the cardinality of a minimum outer connected vertex edge dominating set of G. We characterize trees T of order n with l leaves, s support vertices, for which ${\gamma}^{oc}_{ve}(T)=(n-l+s+1)/3$ and also characterize trees with equal domination number and outer-connected vertex edge domination number.

• Computers and Concrete
• /
• v.16 no.4
• /
• pp.605-623
• /
• 2015

A coupled experimental and numerical study of shear fracture in the edge-notched beam specimens of quasi-brittle materials (concrete-like materials) are carried out using four point bending flexural tests. The crack initiation, propagation and breaking process of beam specimens are experimentally studied by producing the double inclined edge notches with different ligament angles in beams under four point bending. The effects of ligament angles on the shear fracturing path in the bridge areas of the double edge-notched beam specimens are studied. Moreover, the influence of the inclined edge notches on the shear-fracture behavior of double edge-notched beam specimens which represents a practical crack orientation is investigated. The same specimens are numerically simulated by an indirect boundary element method known as displacement discontinuity method. These numerical results are compared with the performed experimental results proving the accuracy and validity of the proposed study.

• Electronics and Telecommunications Trends
• /
• v.34 no.2
• /
• pp.51-59
• /
• 2019

Edge computing, which is computing on the edge of the network, is becoming a market value as a means of overcoming the fear of communication disconnection and delay reduction, which are the technical weaknesses of cloud computing. Edge computing is continuously expanding applications in various applications such as safety industry, smart factories, autonomous vehicles, mobile communications, and AR/VR. Looking at edge computing trends from Microsoft, IBM, HPE, and Dell EMC, current edge computing must be understood as an integral binding technology and not as a simple complement to the cloud. This paper examines market trends in edge computing and analyzes the impact of edge computing on major related industries.

• Transactions of Materials Processing
• /
• v.28 no.3
• /
• pp.154-158
• /
• 2019

The hole expansion tests using conical punch, flat punch or hemispherical punch are widely used for stretch flangeability verification of HSS. In this study, we investigate the strain distribution on the shear edges of the hole expansion test using grid marking and a projector. A small crack at the edge is distributed, resulting in a large gap between the HER and the crack strain. The strain distribution at the edges is irregular due to anisotropy of sheet metal. While an edge perpendicular to the rolling direction indicate a lower strain level compared to an edge parallel to the rolling direction, edge cracks occur at the edge perpendicular to the rolling direction. To predict the manifestation of edge cracks in FE analysis, the result of the hole expansion test with a crack strain measurement may well be a better tool than FLD. In this case, the level of strain and the direction of the edge relative to the rolling direction should be well considered.

• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1331-1346
• /
• 2018

Aiming at the problem that the gradient-based edge detection operators are sensitive to the noise, causing the pseudo edges, a triqubit-state measurement-based edge detection algorithm is presented in this paper. Combing the image local and global structure information, the triqubit superposition states are used to represent the pixel features, so as to locate the image edge. Our algorithm consists of three steps. Firstly, the improved partial differential method is used to smooth the defect image. Secondly, the triqubit-state is characterized by three elements of the pixel saliency, edge statistical characteristics and gray scale contrast to achieve the defect image from the gray space to the quantum space mapping. Thirdly, the edge image is outputted according to the quantum measurement, local gradient maximization and neighborhood chain code searching. Compared with other methods, the simulation experiments indicate that our algorithm has less pseudo edges and higher edge detection accuracy.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2020

In order to reach Ultra-Reliable Low-Latency communication, one of 5G aims, Multi-access Edge Computing paradigm was born. The idea of this paradigm is to bring cloud computing technologies closer to the network edge. User services are hosted in multiple Edge Clouds, deployed at the edge of the network distributedly, to reduce the service latency. For mobile users, migrating their services to the most proper Edge Clouds for maintaining a Quality of Service is a non-convex problem. The service migration problem becomes more complex in high mobility scenarios. The goal of the study is to observe how user mobility affects the selection of Edge Cloud during a fixed mobility path. Mobility-Aware Service Migration (MASM) is proposed to optimize service migration based on two main parameters: routing cost and service migration cost, during a high mobility scenario. The performance of the proposed algorithm is compared with an existing greedy algorithm.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.357-366
• /
• 2007

Let G(V, E) be a simple graph, and let f be an integer function on V with $1{\leq}f(v){\leq}d(v)$ to each vertex $v{\in}V$. An f-edge cover-coloring of a graph G is a coloring of edge set E such that each color appears at each vertex $v{\in}V$ at least f(v) times. The f-edge cover chromatic index of G, denoted by ${\chi}'_{fc}(G)$, is the maximum number of colors such that an f-edge cover-coloring of G exists. Any simple graph G has an f-edge cover chromatic index equal to ${\delta}_f\;or\;{\delta}_f-1,\;where\;{\delta}_f{=}^{min}_{v{\in}V}\{\lfloor\frac{d(v)}{f(v)}\rfloor\}$. Let G be a connected and not complete graph with ${\chi}'_{fc}(G)={\delta}_f-1$, if for each $u,\;v{\in}V\;and\;e=uv{\nin}E$, we have ${\chi}'_{fc}(G+e)>{\chi}'_{fc}(G)$, then G is called an f-edge covered critical graph. In this paper, some properties on f-edge covered critical graph are discussed. It is proved that if G is an f-edge covered critical graph, then for each $u,\;v{\in}V\;and\;e=uv{\nin}E$ there exists $w{\in}\{u,v\}\;with\;d(w)\leq{\delta}_f(f(w)+1)-2$ such that w is adjacent to at least $d(w)-{\delta}_f+1$ vertices which are all ${\delta}_f-vertex$ in G.

• 한국연소학회:학술대회논문집
• /
• 2006.10a
• /
• pp.60-64
• /
• 2006

Propagation rates ($U_{edge}$) of various premixed, twin edge-flames were measured as a function of global strain rate ($\sigma$), mixture strength, and Lewis number (Le). Using a counterflow slot-jet burner with electrical heaters at each end, both advancing (positive $U_{edge}$) and retreating (negative $U_{edge}$) edge-flames can be studied as they propagate along the long dimension of the burner. Experimental results are presented for premixed methane/air twin flames in terms of the effects of $\sigma$ on $U_{edge}$. Both low-$\sigma$ and high-$\sigma$ extinction limits were discovered for all mixtures tested. As a result, the domain of edge-flame stability was obtained in terms of heat loss factor and normalized flame thickness, and comparison with the numerical result of other researchers was also made. For low ($CH_4/O_2/CO_2$) and high ($C_3H_8$/air) Lewis number cases, propagation rates clearly show a strong dependence on Le.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.31-40
• /
• 2016

In this paper, we analyse the characteristics of the edge image and propose a new entropy coding optimized to the compression of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are '0'. By using this analysis, the Zero Block technique is utilized in spatial domain. And the Intra Prediction Mode of the edge image is similar to the mode of the surrounding blocks or likely to be the Planar Mode or the Horizontal Mode. In this paper, we make use of the MPM technique that produces the Intra Prediction Mode with high probability modes. By utilizing the above properties, we design a new entropy coding method that is suitable for edge image and perform the compression. In case the existing compression techniques are applied to edge image, compression ratio is low and the algorithm is complicated as more than necessity and the running time is very long, because those techniques are based on the natural images. However, the compression ratio and the running time of the proposed technique is high and very short, respectively, because the proposed algorithm is optimized to the compression of the edge image. Experimental results indicate that the proposed algorithm provides better visual and PSNR performance up to 11 times than the JPEG.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.454-458
• /
• 2001

Based on a fuzzy system representation of gray scale images, we derive and edge detection algorithm whose convolution kernel is different from the known kernels such as those of Robert's Prewitt's or Sobel's gradient. Our fuzzy system representation is an exact representation of the bicubic spline function which represents the gray scale image approximately. Hence the fuzzy system is a continuous function and it provides a natural way to define the gradient and the Laplacian operator. We show that the gradient at grid points can be evaluated by taking the convolution of the image with a 3$\times$3 kernel. We also that our gradient coupled with the approximate value of the continuous function generates an edge detection method which creates edge images clearer than those by other methods. A few examples of applying our methods are included.