• Title/Summary/Keyword: unit graph

Search Result 136, Processing Time 0.026 seconds

THE ZERO-DIVISOR GRAPH UNDER GROUP ACTIONS IN A NONCOMMUTATIVE RING

  • Han, Jun-Cheol
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.6
    • /
    • pp.1647-1659
    • /
    • 2008
  • Let R be a ring with identity, X the set of all nonzero, nonunits of R and G the group of all units of R. First, we investigate some connected conditions of the zero-divisor graph $\Gamma(R)$ of a noncommutative ring R as follows: (1) if $\Gamma(R)$ has no sources and no sinks, then $\Gamma(R)$ is connected and diameter of $\Gamma(R)$, denoted by diam($\Gamma(R)$) (resp. girth of $\Gamma(R)$, denoted by g($\Gamma(R)$)) is equal to or less than 3; (2) if X is a union of finite number of orbits under the left (resp. right) regular action on X by G, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3, in addition, if R is local, then there is a vertex of $\Gamma(R)$ which is adjacent to every other vertices in $\Gamma(R)$; (3) if R is unit-regular, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3. Next, we investigate the graph automorphisms group of $\Gamma(Mat_2(\mathbb{Z}_p))$ where $Mat_2(\mathbb{Z}_p)$ is the ring of 2 by 2 matrices over the galois field $\mathbb{Z}_p$ (p is any prime).

A UML-based Approach towards Test Case Generation and Optimization

  • Shahid Saleem;Saif U. R. Malik;Bilal Mehboob;Roobaea Alroobaea;Sultan Algarni;Abdullah M. Baqasah;Naveed Ahmad;Muhammad Hasnain
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.633-652
    • /
    • 2024
  • Software testing is an important phase as it ensures the software quality. The software testing process comprises of three steps: generation, execution, and evaluation of test cases. Literature claims the usage of single and multiple 'Unified Modeling Language' (UML) diagrams to generate test cases. Using multiple UML diagrams increases test case coverage. However, the existing approaches show limitations in test case generation from UML diagrams. Therefore, in this research study, we propose an approach to generate the test cases using UML State Chart Diagram (SCD), Activity Diagram (AD), and Sequence Diagram (SD). The proposed approach transforms UML diagrams into intermediate forms: SCD Graph, AD Graph, and SD Graph respectively. Furthermore, by integrating these three graphs, a System Testing Graph (STG) is formed. Finally, test cases are identified from STG by using a traversal algorithm such as Depth First Search (DFS) that is an optimization method. The results show that the proposed approach is better compared to existing approaches in terms of coverage and performance. Moreover, the generated test cases have the ability to detect faults at the unit level, integration, and system level testing.

The feasibility and properties of dividing virtual machine resources using the virtual machine cluster as the unit in cloud computing

  • Peng, Zhiping;Xu, Bo;Gates, Antonio Marcel;Cui, Delong;Lin, Weiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2649-2666
    • /
    • 2015
  • In the dynamic cloud computing environment, to ensure, under the terms of service-level agreements, the maximum efficiency of resource utilization, it is necessary to investigate the online dynamic management of virtual machine resources and their operational application systems/components. In this study, the feasibility and properties of the division of virtual machine resources on the cloud platform, using the virtual machine cluster as the management unit, are investigated. First, the definitions of virtual machine clusters are compared, and our own definitions are presented. Then, the feasibility of division using the virtual machine cluster as the management unit is described, and the isomorphism and reconfigurability of the clusters are proven. Lastly, from the perspectives of clustering and cluster segmentation, the dynamics of virtual machines are described and experimentally compared. This study aims to provide novel methods and approaches to the optimization management of virtual machine resources and the optimization configuration of the parameters of virtual machine resources and their application systems/components in large-scale cloud computing environments.

Building Knowledge Graph of the Korea Administrative District for Interlinking Public Open Data (공공데이터의 의미적 연계를 위한 행정구역 지식 그래프 구축)

  • Kim, Haklae
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.12
    • /
    • pp.1-10
    • /
    • 2017
  • Open data has received a lot of attention from around the world. The Korean government is also making efforts to open government data. However, despite the quantitative increase in public data, the lack of data is still pointed out. This paper proposes a method to improve data sharing and utilization by semantically linking public data. First, we propose a knowledge model for expressing administrative districts and their semantic relationships in Korea. An administrative district is an administrative unit that divides the territory of a nation, which is a unit of politics, according to the purpose of the state administration. The knowledge model of the administrative district defines the structure of the administrative district system and the relationship between administrative units based on the Local Autonomy Act. Second, a knowledge graph of the administrative districts is introduced. As a reference information to link public open data at a semantic level, some characteristics of a knowledge graph of administrative districts and methods for linking heterogeneous public open data and improving data quality are addressed. Finally, some use cases are addressed for interlinking between the knowledge graph of the administrative districts and public open data. In particular, national administrative organisations are interlinked with the knowledge graph, and it demonstrates how the knowledge graph can be utilised for improving data identification and data quality.

An Analysis of the Apartment House Plans in Seoul by Means of a New Graph-theoretic Method (그래프 기법에 의한 서울시 아파트 평면분석에 관한 연구)

  • Seo, Kyung-Wook
    • Journal of the Korean housing association
    • /
    • v.18 no.2
    • /
    • pp.121-128
    • /
    • 2007
  • The investigation of the apartment housing as a dwelling type has become the most important and popular research subject to understand the housing culture in Korea. In their methods of typological analysis, it is found that most studies represent each unit plan as a simplified architectural drawing. This type of typology, however, has difficulties in processing a large scale of data set because each representation of a plan contain too many informations. To deal with this problem, this study suggests a new graph-theoretical method by which apartment plans can be represented in a more simple and effective way. This new method is also tested against the sample plans from Gangnam-gu area in Seoul to reveal the design logic hidden in plan configuration. Through a series of analyses, it is verified that there exist a design strategy that guides the particular pattern of zoning and allocation of each room in the plan.

Test Sequence Generation Using Multiple Unique State Signature(MUSS)

  • Jung, Yoon-Hee;Hong, Beom-Kee
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.43-47
    • /
    • 1997
  • A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

  • PDF

Optimization of Graph Processing based on In-Storage Processing (스토리지 내 프로세싱 방식을 사용한 그래프 프로세싱의 최적화 방법)

  • Song, Nae Young;Han, Hyuck;Yeom, Heon Young
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.8
    • /
    • pp.473-480
    • /
    • 2017
  • In recent years, semiconductor-based storage devices such as flash memory (SSDs) have been developed to high performance. In addition, a trend has been observed of optimally utilizing resources such as the central processing unit (CPU) and memory of the internal controller in the storage device according to the needs of the application. This concept is called In-Storage Processing (ISP). In a storage device equipped with the ISP function, it is possible to process part of the operation executed on the host system, thus reducing the load on the host. Moreover, since the data is processed in the storage device, the data transferred to the host are reduced. In this paper, we propose a method to optimize graph query processing by utilizing these ISP functions, and show that the optimized graph processing method improves the performance of the graph 500 benchmark by up to 20%.

A GENERALIZED SINGULAR FUNCTION

  • Baek, In-Soo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.657-661
    • /
    • 2010
  • We study a singular function which we call a generalized cylinder convex(concave) function induced from different generalized dyadic expansion systems on the unit interval. We show that the generalized cylinder convex(concave)function is a singular function and the length of its graph is 2. Using a local dimension set in the unit interval, we give some characterization of the distribution set using its derivative, which leads to that this singular function is nowhere differentiable in the sense of topological magnitude.

A Study on the Guidance Signage System of Outpatient in General Hospital using Spatial Configuration Theory - View from G.D.Weisman's Way-finding Influence Factors (공간구조론을 적용한 종합병원 외래부 유도사인 배치 및 평가에 관한 연구 - G.D.Weisman의 길찾기 요소를 중심으로)

  • Kim, Suktae;Paik, Jinkyung
    • Journal of The Korea Institute of Healthcare Architecture
    • /
    • v.21 no.3
    • /
    • pp.25-35
    • /
    • 2015
  • Purpose: Signs that are installed at unnoticeable places or that disconnect before the destination can bring errors of location information delivery. Therefore, this study aims to find out the spatial relation between structure of space and signs in the perspective of visual exposure possibility, operating arrangement and assesment by applying spatial structure theory. Methods: Effectiveness of organization of guidance signs was evaluated after the four way-finding factors(Plan Configuration, Sign System, Perceptual Access, Architectural Difference) that G.D.Weisman suggested were interpreted by spatial structure theory(J-Graph analysis, Space Syntax, Visual Graph Analysis) under the premise that it is closely related to the structure of space. Results: 1) Because the south corridor that connects each department of outpatient division is located in the hierarchy center of the space, and walking density is expected to be high, guidance signs need to be organized at the place with high integration value. 2) The depth to the destination space can be estimated through J-Graph analysis. The depth means a switch of direction, and the guidance signs are needed according to the number. 3) According to visibility graph analysis, visual exposure can be different in the same hierarchy unit space according to the shape of the flat surface. Based on these data, location adjustment of signs is possible, and the improvement effect can be estimated quantitatively. Implications: Spatial structure theory can be utilized to design and evaluate sign systems, and it helps to clearly understand the improvement effect. It is desirable to specify design and estimation of sign systems in the order of J-Graph analysis${\rightarrow}$Space Syntax Theory${\rightarrow}$visibility graph analysis.

The Chromatic Number Algorithm in a Planar Graph (평면의 채색수 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.5
    • /
    • pp.19-25
    • /
    • 2014
  • In this paper, I seek the chromatic number, the maximum number of colors necessary when adjoining vertices in the plane separated apart at the distance of 1 shall receive distinct colors. The upper limit of the chromatic number has been widely accepted as $4{\leq}{\chi}(G){\leq}7$ to which Hadwiger-Nelson proposed ${\chi}(G){\leq}7$ and Soifer ${\chi}(G){\leq}9$ I firstly propose an algorithm that obtains the minimum necessary chromatic number and show that ${\chi}(G)=3$ is attainable by determining the chromatic number for Hadwiger-Nelson's hexagonal graph. The proposed algorithm obtains a chromatic number of ${\chi}(G)=4$ assuming a Hadwiger-Nelson's hexagonal graph of 12 adjoining vertices, and again ${\chi}(G)=4$ for Soifer's square graph of 8 adjoining vertices. assert. Based on the results as such that this algorithm suggests the maximum chromatic number of a planar graph is ${\chi}(G)=4$ using simple assigned rule of polynomial time complexity to color for a vertex with minimum degree.