• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.665-671
• /
• 2000

A matrix whose entries consist of the symbols +.- and 0 is called a sign pattern matrix . In 1994 , Eschenbach gave a graph theoretic characterization of irreducible sign idempotent pattern matrices. In this paper, we give a characterization of reducible sign idempotent matrices. We show that reducible sign idempotent matrices, whose digraph is contained in an irreducible sign idempotent matrix, has all nonnegative entries up to equivalences. this extend the previous result.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1187-1237
• /
• 2020

Simply reducible groups are important in physics and chemistry, which contain some of the important groups in condensed matter physics and crystal symmetry. By studying the group structures and irreducible representations, we find some new examples of simply reducible groups, namely, dihedral groups, some point groups, some dicyclic groups, generalized quaternion groups, Heisenberg groups over prime field of characteristic 2, some Clifford groups, and some Coxeter groups. We give the precise decompositions of product of irreducible characters of dihedral groups, Heisenberg groups, and some Coxeter groups, giving the Clebsch-Gordan coefficients for these groups. To verify some of our results, we use the computer algebra systems GAP and SAGE to construct and get the character tables of some examples.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2536-2542
• /
• 2000

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrarY directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we present the effective sequency reducible algorithm and delay reducible algorithm.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.117-125
• /
• 2005

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrary directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we implement the effective sequency reducible algorithm and delay reducible algorithm. As a result of implementation, we can see that the delay reducible algorithm takes less execution time than the sequency reducible algorithm. Therefore, we can reduce the flow graph to dominator tree effectively.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.257-268
• /
• 2007

An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex $v_i$ in an oriented graph D is $a_{v_i}\;(or\;simply\;a_i)=n-1+d_{v_i}^+-d_{v_i}^-,\;where\; d_{v_i}^+\;and\;d_{v_i}^-$ are the outdegree and indegree, respectively, of $v_i$ and n is the number of vertices in D. In this paper, we give a new proof of Avery's theorem and obtain some stronger inequalities for scores in oriented graphs. We also characterize strongly transitive oriented graphs.

• Journal of Korean Society for Quality Management
• /
• v.11 no.2
• /
• pp.10-17
• /
• 1983

The former paper (Part I) studies two methods for searching and determining the simple paths in an acyclic or a cyclic network. The two methods are computer programmed as subroutines (SPLP1 and SPLP2) for various use. And a few examples of its applications are discussed Another paper (Par II) studies the reliability computation for a network by using the Event Space Methods. A computer program is developed for the computation by applying the SPLP2 subroutine subprogram. In this paper the former results are summarized with another computer program for reliability computation by using the Path Tracing Methods. The two subroutines appear in the Appendix as reference for others. The programs can be used in the reliability computation of reducible and irreducible structure networks.

• Journal of Korean Neurosurgical Society
• /
• v.48 no.1
• /
• pp.37-45
• /
• 2010

Objective : Craniovertebral junction (CVJ) consists of the occipital bone that surrounds the foramen magnum, the atlas and the axis vertebrae. The mortality and morbidity is high for irreducible CVJ lesion with cervico-medullary compression. In a clinical retrospective study, the authors reviewed clinical and radiographic results of occipitocervical fusion using a various methods in 32 patients with CVJ instability. Methods : Thirty-two CVJ lesions (18 male and 14 female) were treated in our department for 12 years. Instability resulted from trauma (14 cases), rheumatoid arthritis (8 cases), assimilation of atlas (4 cases), tumor (2 cases), basilar invagination (2 cases) and miscellaneous (2 cases). Thirty-two patients were internally fixed with 7 anterior and posterior decompression with occipitocervical fusion, 15 posterior decompression and occipitocervical fusion with wire-rod, 5 C1-2 transarticular screw fixation, and 5 C1 lateral mass-C2 transpedicular screw. Outcome (mean follow-up period, 38 months) was based on clinical and radiographic review. The clinical outcome was assessed by Japanese Orthopedic Association (JOA) score. Results : Nine neurologically intact patients remained same after surgery. Among 23 patients with cervical myelopathy, clinical improvement was noted in 18 cases (78.3%). One patient died 2 months after the surgery because of pneumonia and sepsis. Fusion was achieved in 27 patients (93%) at last follow-up. No patient developed evidence of new, recurrent, or progressive instability. Conclusion : The authors conclude that early occipitocervical fusion to be recommended in case of reducible CVJ lesion and the appropriate decompression and occipitocervical fusion are recommended in case of irreducible craniovertebral junction lesion.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.171-180
• /
• 2002

The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian's path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.

• Journal of Veterinary Clinics
• /
• v.26 no.6
• /
• pp.632-636
• /
• 2009

Three dogs presented to the Veterinary Medical Teaching Hospital of the University of Konkuk and Hangang Animal Hospital with a history of perineal swelling. No tenesmus, stranguria, or any clinical signs other than the swelling was observed by the owners in three dogs. On physical examination, the swelling was observed unilaterally in two dogs and bilaterally in a dog. Digital palpation to the swelling confirmed reducible perineal herniation in two dogs and irreducible perineal herniation in a dog. Plain radiographs revealed that no pelvic or abdominal contents other than the fat were displaced into subcutaneous perineal region in three dogs. Internal obturator transposition herniorrhaphy was performed for correction of perineal herniation in three dogs. Contralateral herniation involving fat was noted after surgery in a dog. The follow-up information was based on physical examination by veterinarians or telephone interview with owners. The owners reported that there was no evidence of complications related to surgery such as sciatic nerve injury, rectal prolapse, wound dehiscence, or perineal hernia recurrence in all dogs.