• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.1
• /
• pp.113-125
• /
• 2004

The network disconnection problem ms to find a set of edges such that the total cost of removing the edges is no more than a given budget and the weight of nodes disconnected from a designated source by removing edges is maximized. Martel et at. have shown that the problem with unit capacity and unit demand Is NP-hard and Myung and kim present an integer programming formulation and develop an algorithm that Includes a preprocessing procedure and lower and upper bounding strateagies. in this paper, we present new findings on the properties of the optimal solution and an alternative integer programming formulation, based on which new lower and upper bounding strategies are developed. Computational results for evaluating the performance of the proposed algorithm are also presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.876-885
• /
• 1991

This paper proposes an on-line method of understanding humans conducting action observed through a vision sensor. The vision system captures images of conducting action and extracts image coordinates of endpoint of the baton. A proposed algorithm based on the expert knowledge about conducting recognizes patterns of the conducting action from the extracted image coordimates and play the corresponding music score. Complementary algorithms are also proposed for identifying the first beat static point and dynamics through extensive experiments, this algorithm is found to detect lower edges and upper edges without error.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.569-583
• /
• 2019

Given a graph G, the Motzkin and Straus formulation of the maximum clique problem is the quadratic program (QP) formed from the adjacent matrix of the graph G over the standard simplex. It is well-known that the global optimum value of this QP (called Lagrangian) corresponds to the clique number of a graph. It is useful in practice if similar results hold for hypergraphs. In this paper, we attempt to explore the relationship between the Lagrangian of a hypergraph and the order of its maximum cliques when the number of edges is in a certain range. Specifically, we obtain upper bounds for the Lagrangian of a hypergraph when the number of edges is in a certain range. These results further support a conjecture introduced by Y. Peng and C. Zhao (2012) and extend a result of J. Talbot (2002). We also establish an upper bound of the clique number in terms of Lagrangians for hypergraphs.

• Management Science and Financial Engineering
• /
• v.11 no.1
• /
• pp.49-61
• /
• 2005

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

• Fashion & Textile Research Journal
• /
• v.17 no.6
• /
• pp.988-995
• /
• 2015

Gaps between the upper edges of brassiere mold cups and the breasts are one of the most serious issues in realizing comfort wearing of commercial brassieres for small-breasted women. The surplus ease amounts causing the fit problem were measured from 3D wearing images of the small-breasted women's brassieres. The effect after the removing the surplus ease amounts from the upper edge of mold cup was approved by subjective wearing evaluation. Since the volume distribution of mold cup can also affect the wearing sensation of brassiere, the subjective wearing sensation was compared for two brassieres of different volume distributions, V_L, of which volume was concentrated at the lower cup, and V_C, which has the thickest part at the nipple. As the results, the suitable sensation for cup volume and the natural wearing silhouette could be accomplished by removing the surplus ease amounts from the upper edge of mold cup to reduce the gaps between brassieres and the breasts, which could be accomplished through an approach reducing the volume near the upper edge of mold brassiere cup and making the volume concentrated at the lower cup. These works provide a useful information on the design of the brassiere mold cups for small-breasted women. Moreover, modeling methods of 3D scan data and 3D printing technique for making more accurate mold cases used in this research can be helpful to develop and evaluate clothing products in future.

• Journal of Chest Surgery
• /
• v.5 no.2
• /
• pp.135-140
• /
• 1972

Papilloma of the upper respiratory tract, particularly larynx and vocal cords are relatively common disease. However, solitary papilloma of the bronchus is extremely rare condition and only a handful cases were reported in the literature. The patient is a 39 year old housewife who has been suffering from productive cough and occasional hemoptysis in the past one year. X-ray of the chest showed complete atelectasis of the right upper lobe. Bronchography revealed a hemispherical protruding mass in the right main bronchus with complete occlusion of the upper lobe bronchus. Bronchoscopy showed a whitish friable mass in the lumen of the right main bronchus biopsy of which was reported as benign papilloma. Right upper lobectomy together with wedge resection of the portion of right main bronchus to include the tumor was done. Cut-edges of the bronchus were stitched together with interrupted fine dacron sutures. During this procedure, right main bronchus was gently clamped with non-crushing Satinsky type clamp. Patient has had uneventful recovery from surgery and was discharged without symptom. Patientis doing well three months following the operation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.6
• /
• pp.865-871
• /
• 2022

In this paper, we propose a method of extracting prostate region using morphological characteristics of ultra-sonic image of prostate. In the first step of the proposed method, the edge area of the prostate image is extracted. The histogram of ultra-sonic image is used to extract base objects to detect the upper edge of prostate region by altering the contrast of the image, then, the lower edges of the extracted base objects are connected by using monotone cubic spline interpolation to extract the upper edge. Step 2, Otsu's binarization is applied to the region under the extracted upper edge of the prostate ultra-sonic image to extract the lower edge of prostate. In the last step, the upper and the lower edges are connected to extract prostate region and by comparing the extracted region of prostate with the one measured manually, the result showed that the morphological characteristics of prostate in ultrasonic image can be utilized to extract the prostate region.

• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.365-377
• /
• 2015

For a (molecular) graph, the first and second Zagreb indices (M₁ and M₂) are two well-known topological indices, first introduced in 1972 by Gutman and Trinajstić. The first Zagreb index M₁ is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M₂ is equal to the sum of the products of the degrees of pairs of adjacent vertices. Let $K_{n_1,n_2}^{P}$ with n₁ $\leq$ n₂, n₁ + n₂ = n and p < n₁ be the set of bipartite graphs obtained by deleting p edges from complete bipartite graph K_n1,n2. In this paper, we determine sharp upper and lower bounds on Zagreb indices of graphs from $K_{n_1,n_2}^{P}$ and characterize the corresponding extremal graphs at which the upper and lower bounds on Zagreb indices are attained. As a corollary, we determine the extremal graph from $K_{n_1,n_2}^{P}$ with respect to Zagreb coindices. Moreover a problem has been proposed on the first and second Zagreb indices.

• 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.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called 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 sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.