• Title/Summary/Keyword: Conflict graph

Search Result 29, Processing Time 0.022 seconds

Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications

  • Liu, Huanlin;Dai, Hongyue;Chen, Yong;Xia, Peijie
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.36-41
    • /
    • 2016
  • Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.

A Scheduling and Synchronization Technique for RAPIEnet Switches Using Edge-Coloring of Conflict Multigraphs

  • Abbas, Syed Hayder;Hong, Seung Ho
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.321-328
    • /
    • 2013
  • In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

Detection of Conflict Transition Scene Using Character Regions (인물 면적을 이용한 갈등 전환 장면 검출)

  • Park, Seung-Bo;Lee, Chang-Hyun
    • Journal of Broadcast Engineering
    • /
    • v.26 no.5
    • /
    • pp.543-552
    • /
    • 2021
  • The story is formed by the flow of the development and resolution of the conflict between the characters. Namely, the story consists of conflict setting, development, and resolution. Character region is an important expression technique to describe the emotions or states of characters and the relationship between characters and the environment. The purpose of this paper is to propose a method for detecting the transition of conflict from the graph of character region's change. To this end, we present a method of generating a change graph of a character region in a movie by calculating the character region and a method of detecting a conflict transition scene from a graph of character region's change. To verify the performance of the proposed method, an experiment was conducted to extract conflict transition scenes for 7 movies, and performance evaluation results of 73.57% accuracy and 77.26% recall were obtained. This proves that it is possible to extract conflict transition scenes based on the character region.

Efficient Authorization Conflict Detection Using Prime Number Graph Labeling in RDF Access Control (RDF 접근 제어에서 소수 그래프 레이블링을 사용한 효율적 권한 충돌 발견)

  • Kim, Jae-Hoon;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.35 no.2
    • /
    • pp.112-124
    • /
    • 2008
  • RDF and OWL are the primary base technologies for implementing Semantic Web. Recently, many researches related with them, or applying them into the other application domains, have been introduced. However, relatively little work has been done for securing the RDF and OWL data. In this article, we briefly introduce an RDF triple based model for specifying RDF access authorization related with RDF security. Next, to efficiently find the authorization conflict by RDF inference, we introduce a method using prime number graph labeling in detail. The problem of authorization conflict by RDF inference is that although the lower concept is permitted to be accessed, it can be inaccessible due to the disapproval for the upper concept. Because by the RDF inference, the lower concept can be interpreted into the upper concept. Some experimental results show that the proposed method using the prime number graph labeling has better performance than the existing simple method for the detection of the authorization conflict.

A Case Analysis on Remarried Family with Family Conflict (재혼가족의 가족갈등 사례분석)

  • Park, Tai-Young;Kim, Tae-Han
    • Journal of Families and Better Life
    • /
    • v.28 no.4
    • /
    • pp.15-28
    • /
    • 2010
  • The study investigated the repeated conflict of remarried family from family systems perspective, and used the verbatim of family members, who were participated in family therapy, as analysis data. the study used Miles and Hubernam's matrix, graph, and graphical network display to analyze the data. The results of study were as follows. After the couples remarried, a husband and two step-children, who were born in ex-wife, used dysfunctional communication method to keep the established family systems. Also, a wife used dysfunctional communication method to change the existing family systems. These dysfunctional communication method, which were used by family members, caused vicious cycle rather than resolving the family conflict. The differences of remarried husband first-married wife, and the differences of blooded and non-blooded relationships among family members had influenced on family conflict.

Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph (최대 EDP를 이용한 경로설정 및 경로 충돌 그래프를 이용한 파장할당 문제 해결 방안)

  • Kim Duk Hun;Chung Min Young;Lee Tae-Jin;Choo Hyunseung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.417-426
    • /
    • 2005
  • Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

The Analysis of Stakeholders' Conflict Surrounding Water use Charges: Targeting the Han River region (한강수계 물이용부담금을 둘러싼 이해당사자 간 갈등분석)

  • Lee, Youngkyeong;Choi, Ye Seul;Kim, Chanyong;Lim, up
    • Journal of the Korean Regional Science Association
    • /
    • v.37 no.1
    • /
    • pp.45-61
    • /
    • 2021
  • This research purposes to design a methodological framework to suggest the optimal method to resolve the conflicts of stakeholders surrounding the water use charge of the Han River region, and to use the analysis results to provide the direction of policy. For this, it was preceded that the process of understanding the mechanisms of the multifaceted conflict between decision makers taking different positions over water use charge of the Han River region, and an optimal method to resolve the conflict of water use charge of the Han River region was derived by using a graph model for conflict resolution(GMCR). According to the analysis results, the optimal state to find a solution to the water use charge of the Han River is that the Seoul-Incheon-Gyeonggi region pays the charge according to the original rate while Seoul-Incheon requesting discount the water use rate. In addition, the Han River management committee should establish policies desired by Seoul-Incheon-Gyeonggi region including rationalization of the decision-making structure to determine the rate of water use charge, making the basis to support the Han River management fund system for the Seoul-Incheon region, and transparent management of the Han River management fund system considering the characteristics of beneficiary regions and residents. This study is expected to provide objective decision-making information in establishing environmental policy directions related to conflict resolution in the water use charge of the Han River region and to offer a methodological basis for similar follow-up studies related to conflicts derived from sharing nature environment.

Role Graph Security Management Model based on Lattice (격자기반 역할그래프 보안 관리 모델)

  • Choi, Eun-Bok;Park, Ju-Gi;Kim, Jae-Hoon
    • Journal of Internet Computing and Services
    • /
    • v.7 no.5
    • /
    • pp.109-121
    • /
    • 2006
  • In this paper, we suggest lattice based role graph security management model which changes security level in mandatory access control model as well as constraint and role hierarchy systematically in role base access control model. In this model, we solved privilege abuse of senior role that is role graph model's problem, and when produce conflict between privileges, we can keep integrity of information by reseting grade of subject through constraint. Also, we offer strong security function by doing to be controlled by subject's security level as well as privilege inheritance by role hierarchy, Finally, we present the role graph algorithms with logic to disallow roles that contain conflicting privileges.

  • PDF

Compromise Scheme for Assigning Tasks on a Homogeneous Distributed System

  • Kim, Joo-Man
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.141-149
    • /
    • 2011
  • We consider the problem of assigning tasks to homogeneous nodes in the distributed system, so as to minimize the amount of communication, while balancing the processors' loads. This issue can be posed as the graph partitioning problem. Given an undirected graph G=(nodes, edges), where nodes represent task modules and edges represent communication, the goal is to divide n, the number of processors, as to balance the processors' loads, while minimizing the capacity of edges cut. Since these two optimization criteria conflict each other, one has to make a compromise between them according to the given task type. We propose a new cost function to evaluate static task assignments and a heuristic algorithm to solve the transformed problem, explicitly describing the tradeoff between the two goals. Simulation results show that our approach outperforms an existing representative approach for a variety of task and processing systems.

Conflict Analysis of the Nanjing Yuhuan and A.O Smith Joint Venture Case

  • Yu, Yunxia;Wang, Ying
    • Asian Journal of Business Environment
    • /
    • v.8 no.1
    • /
    • pp.7-15
    • /
    • 2018
  • Purpose -This paper is to study the process of the negative effects of Sino-foreign joint ventures, hoping to find out an effective path in which local enterprises can avoid the risks in the utilization of foreign capital, and ultimately achieve independent innovation. Research design, data, and methodology -The outflow of assets, the loss of local brands and the "technology hollowing-out" problem brought by joint ventures is becoming more and more serious. Based on conflict analysis graph model, this paper takes Yuhuan joint venture as an example to identify the conflict problem in Sino-foreign joint ventures. Results -The results of the stability analysis show that establishing joint venture cannot really realize the introduction of technology because the technology is fully controlled by the foreign part. So when introducing foreign capital, local enterprises should participate in R&D and master the initiative. Conclusions - Local enterprises should pay attention to patent containment and technology blockade of multinationals. Domestic enterprises should try to protect state-owned assets and local brands in Sino-foreign joint ventures. Independent innovation is the most effective strategy for the development of enterprises in China.