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

Privacy vulnerability of social networks is one of the major concerns for social science research and business analysis. Most existing studies which mainly focus on un-weighted network graph, have designed various privacy models similar to k-anonymity to prevent data disclosure of vertex attributes or relationships, but they may be suffered from serious problems of huge information loss and significant modification of key properties of the network structure. Furthermore, there still lacks further considerations of privacy protection for important sensitive edges in weighted social networks. To address this problem, this paper proposes a privacy preserving method to protect sensitive weighted edges. Firstly, the sensitive edges are differentiated from weighted edges according to the edge betweenness centrality, which evaluates the importance of entities in social network. Then, the perturbation operations are used to preserve the privacy of weighted social network by adding some pseudo-edges or modifying specific edge weights, so that the bottleneck problem of information flow can be well resolved in key area of the social network. Experimental results show that the proposed method can not only effectively preserve the sensitive edges with lower computation cost, but also maintain the stability of the network structures. Further, the capability of defending against malicious attacks to important sensitive edges has been greatly improved.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.13 no.4
• /
• pp.19-24
• /
• 1976

Some method of analysis of rectangular plates under distributed load of various intensity with all edges built in are presented in. Analysis of many structures such as bottom, side shell, and deck plate of ship hull, and flat slab, deck systems of bridges is a problem of plate with continuous supports or clamped edges. When the four edges of rectangular plate is simply supported, the double fourier series solution developed by Navier can represent an exact result of this problem. If two opposite edges are simply supported, Levy's method is available to give an "exact" solution. When the loading condition and boundary condition of a plate does not fall into these cases, no simple analytic method seems to be feasible. Analysis of a plate under distributed loads of various intensity with all edges built in is carried out by applying Navier solution and Levy's method as well as "Principle of Superposition" In discussing this problem we start with the solution of the problem for a simply supported rectangular plate and superpose on the deflection of such a plate the deflections of the plate by slopes distributed along the all edges. These slopes we adjust in such a manner as to satisfy the condition of no rotation at the boundary of the clamped plate. This method can be applied for the cases of plates under irregularly distributed loads of various intensity with two opposite edges simply supported and the other two edges clamped and all edges simply supported and this method can also be used to solve the influence values of deflection, moment and etc. at arbitrary position of plates under the live load.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.6
• /
• pp.81-86
• /
• 2004

Generally, automotive cylinder head is manufactured by FCD45 material that is hard to cutting materials, and it needs the accurate machining tool fir higher output of engine. This paper is concerned with a study on TiN coated 6 edges reamer for improving machining accuracy of cylinder head guide pin. The reamer shape is changed from 4 edges to 6 edges for the improvement of machining accuracy. Also, TiN coating is applied to the improvement of surface roughness of cylinder head guide pin and tool life of 6 edges reamer. It is noted that 6 edges reamer are effective in controlling the dimensional accuracy and surface roughness as well as increasing tool life.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.51-59
• /
• 2014

This paper suggests a method of lessening number of a graph's edges population in order to rapidly obtain the minimum spanning tree. The present minimum spanning tree algorithm works on all the edges of the graph. However, the suggested algorithm reduces the edges population size by means of applying a method of deleting maximum weight edges in advance from vertices with more than 2 valencies. Next, it applies a stopping criterion which ideally terminates Borůvka, Prim, Kruskal and Reverse-Delete algorithms for reduced edges population. On applying the suggested algorithm to 9 graphs, it was able to minimize averagely 83% of the edges that do not become MST. In addition, comparing to the original graph, edges are turned out to be lessened 38% by Borůvka, 37% by Prim, 39% by Kruskal and 73% by Reverse-Delete algorithm, and thereby the minimum spanning tree is obtained promptly.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.1
• /
• pp.197-205
• /
• 2007

We have proposed a novel line detection method based on the estimated probability density function of gradient directions of edges. By estimating peaks of the density function, we determine groups of edges that have the same gradient direction. For edges in the same groups, we detect lines that correspond to peaks of the connectivity weighted distribution of the distances from the origin. In the experiments using the Data Matrix barcode images and LCD images, the proposed method showed better performance than conventional Methods in terms of the processing speed and accuracy.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.63-66
• /
• 2002

In this paper, we consider the hamiltonian properties of m ${\times}$ n mesh networks with two wrap-around edges. We describe sufficient condition that at least two edges should be added to a mesh to make it hamiltonian-connected. We propose two graphs, M1(ｍ,n) and M2(ｍ,n). These are obtained by adding one and two edges respectively in the ｍ${\times}$ｎ mesh. We show the hamiltonian properties of M1(ｍ,n) and prove that M2(m, n) is hamiltonian-connected using the hamiltonian properties of M1(ｍ,n).

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2079-2082
• /
• 2002

An interconnection network is called hamiltonian-connected if there exists a hamiltonian path joining every pair of nodes. We consider the problem of adding edges to a mesh to make it hamiltonian- connected. We show that at least two edges are necessary for the problem. Also, we present the method to add two edges to a mesh so that the resulting network is hamiltonian-connected.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.925-927
• /
• 1995

The purpose of extaction of edges of buildings is an extraction of 3-dimensional imformation. The performance of an exact extraction of edges of buildings using several classic algorithms was not so good. In this study we merged several exposed algorithms-----split-and-merge, anisotropic diffusion, modified canny operation, least mean sqare. Results of this extraction algorithm show better performance than any other detection algorithms of edges of buildings.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.34 no.1
• /
• pp.78-86
• /
• 1992

This paper aims at investigating the effect of steel ratio and the magnitude of edge-ratio on the mechanical characteristics of reinforced concrete ring sector plate. The influence of steel bars was taken into account by coupling stiffness matrix of the steel bar element with that of the concrete plate element without dealing with separate element of steel bar and by establishing the composite stiffness matrix, which leads to the desirable result which does not increase th number of element could be obtained. Through case studies with 6 cases various steel ratios in ring sector plate supported at four edges and 4 cases with different open angles, the influence of the steel ratio was examined. A numerical analysis to find out the effect of the steel ratio d ue to above mentioned cases was carried out by 4 boundary conditions ; all edges clamped (B.C-1), all edges simply supported (B.C-2), curvilinear two edges clamped and other edges free (B.C-3) and curvilinear two edges simply supported and other edges free(B.C-4). The main results obtained are summarized as follows : 1. The effect of steel ratio on the magnitude of lateral deflection and x-directional bending moment at the center of sector plate and the midpoint of outer and inner curvilinear edges is almost the same up to $30^{\circ}$ of open angle. Beyond $30^{\circ}$ of the angle, the larger the angle, the greater the effect of ratio. 2. In design works using balanced steel ratio, the effect of steel bar can be ignored. But for larger open angles, especially greater than $90^{\circ}$, it proves desirable to consider the effect of steel bar. 3. The effect of the arc length of center circle/straight edge on lateral deflection and bending moment is remarkable in B.C-2. For larger open angle, the effect is also noted except for B.C-3 which turn out hardly affected. 4. The effect of the radius of curvature/straight side length on lateral deflection and x-directional bending moment is noted in B.C-2. As open angle increases, B.C-1 and B.C-3 almost agree and B.C-2 approaches B.C-4.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.114-125
• /
• 1998

In this study, for the first time, we propose the ADI(Adaptive De-Interlacing) algorithm, which improves visually and subjectively, horizontal and vertical edges on the image processed by the ELA (Edge Based Line Average) method. The proposed ADI algorithm enlargesthe window size to 5*3 in order to utilize the feature of the continuity of edges, and the adaptive interpolator is employed to decide adaptiely horizontal, diagonal, and vertical edges. Based on the results of the compter simulation, it is confimed that the new ADI algorithm improve the PSNR by 0.5dB in the Lena image with 512*512 size and by 0.4dB in the sequence image of a salesman, respectively. For the horizontal and vertial edges on the still and salesman sequence images, the proposed ADI algorithm has better visulal improvement than the conventional ELA algorithm.