• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.950-975
• /
• 2016

Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.

• Journal of Information Technology Services
• /
• v.16 no.4
• /
• pp.137-148
• /
• 2017

Researches on the Artificial Intelligence has been explosively activated in various fields since the advent of AlphaGo. Particularly, researchers on the application of multi-layer neural network such as deep learning, and various machine learning algorithms are being focused actively. In this paper, we described a development of an artificial intelligence Janggi game based on reinforcement learning algorithm and MCTS (Monte Carlo Tree Search) algorithm with accumulated game data. The previous artificial intelligence games are mostly developed based on mini-max algorithm, which depends only on the results of the tree search algorithms. They cannot use of the real data from the games experts, nor cannot enhance the performance by learning. In this paper, we suggest our approach to overcome those limitations as follows. First, we collects Janggi expert's game data, which can reflect abundant real game results. Second, we create a graph structure by using the game data, which can remove redundant movement. And third, we apply the reinforcement learning algorithm and MCTS algorithm to select the best next move. In addition, the learned graph is stored by object serialization method to provide continuity of the game. The experiment of this study is done with two different types as follows. First, our system is confronted with other AI based system that is currently being served on the internet. Second, our system confronted with some Janggi experts who have winning records of more than 50%. Experimental results show that the rate of our system is significantly higher.

• The Journal of Natural Sciences
• /
• v.8 no.1
• /
• pp.115-121
• /
• 1995

The Conventional database management system is not applicable because of their inadequate performance and difficulty of CAD database that is dependant to hierarchical structure and to repeat accesses of large data. For effective management and easy tool integration of CAD database, hierarchy Interface System(HIS) is designed and GROCO(Graph Representation fOr Complex Objects) Model is presented. Hierarchy Interface System which is composed of two subsystems of a configurator and a converter is designed for the interface between a conventional database management system and CAD tools. GROCO Model is a directed cyclic graph having five node-types for representing semantics and supports efficiently CAD database characters having a hierarchical structure of complex objects.

• Journal of Digital Contents Society
• /
• v.17 no.1
• /
• pp.11-21
• /
• 2016

To provide more efficient and exact search result, internet systems will rely more and more on semantic web. Ontology is one of the important methods for implementation of semantic web. Ontology is used to implement an explicit formal vocabularies to share. However, important problems rise when dealing with ontology. Ontologies are typically subject to change because they are living. In order to handle ontology data change situation, a version handling system is needed to keep track of changes. For example, the queries subject to the previous ontology may become inconsistent and must be updated according to the newest version of ontology. Although many research was done in this area, there are still many problems to overcome. In this paper, we propose class and property transition graph for query transformation. The graph is created when ontology data is changed and applied to query transformation.

• Interdisciplinary Bio Central
• /
• v.5 no.1
• /
• pp.1.1-1.8
• /
• 2013

High quality publicly-available transcriptomic data representing relationships in gene expression across a diverse set of biological conditions is used as a context network to explore transcriptomics of the CNS. The context network, 18367Hu-matrix, contains pairwise Pearson correlations for 22,215 human genes across18,637 human tissue samples1. To do this, we compute a network derived from biological samples from CNS cells and tissues, calculate clusters of co-expressed genes from this network, and compare the significance of these to clusters derived from the larger 18367Hu-matrix network. Sorting and visualization uses the publicly available software, MetaOmGraph (http://www.metnetdb.org/MetNet_MetaOm-Graph.htm). This identifies genes that characterize particular disease conditions. Specifically, differences in gene expression within and between two designations of glial cancer, astrocytoma and glioblastoma, are evaluated in the context of the broader network. Such gene groups, which we term outlier-networks, tease out abnormally expressed genes and the samples in which this expression occurs. This approach distinguishes 48 subnetworks of outlier genes associated with astrocytoma and glioblastoma. As a case study, we investigate the relationships among the genes of a small astrocytoma-only subnetwork. This astrocytoma-only subnetwork consists of SVEP1, IGF1, CHRNA3, and SPAG6. All of these genes are highly coexpressed in a single sample of anaplastic astrocytoma tumor (grade III) and a sample of juvenile pilocytic astrocytoma. Three of these genes are also associated with nicotine. This data lead us to formulate a testable hypothesis that this astrocytoma outlier-network provides a link between some gliomas/astrocytomas and nicotine.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.10 s.89
• /
• pp.952-960
• /
• 2004

PSK(Phase Shift Keying) is useful because of the power and spectral efficient modulation. In this paper, no additional hardware will be needed to support various transmit mode in the suggested DSP scheme. We design and implement the synchronization algorithm for M-ary PSK(M=2, 4) demodulator based on DSP scheme, instead of complex analog PSK demodulator. TMS320C6203 is used as DSP. We check the all kinds of waveforms via the graph view window after software programming the emulation on the DSP tool. The result of implementation proves that demodulator using the suggested algorithm has equal performance with demodulator using analog circuits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1907-1917
• /
• 2010

It is much needed research for ocean scientists to implement a digitizing system that effectively extracts and digitializes sea level records accumulated from the past. The main difficulty of such a system is huge anount of data to be processed. In this paper, we implement a digitizing system to handle such mass-data of sea level records. This system consists of a pre-process step, a digitizing step and a post-process step. In pre-process step, the system adjusts skewnesses of scanned images and normalizes the size of images automatically. Then, it extracts a graph area from images and thins the graph area in digitizing step. Finally, in the post-process step, the system tests the reliability. It is cost-effective and labour-reducing software for scientists not wasting their time to such boring manual digitizing jobs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3836-3854
• /
• 2022

The student group division is benefit for universities to do the student management based on the group profile. With the widespread use of student smart cards on campus, especially where students living in campus residence halls, students' daily activities on campus are recorded with information such as smart card swiping time and location. Therefore, it is feasible to depict the students with the daily activity data and accordingly group students based on objective measuring from their campus behavior with some regular student attributions collected in the management system. However, it is challenge in feature representation due to diverse forms of the student data. To effectively and comprehensively represent students' behaviors for further student group division, we proposed to adopt activity data from student smart cards and student attributes as input data with taking account of activity and attribution relationship types from different perspective. Specially, we propose a novel student group division method based on a multi-view student attribute heterogeneous information network (MSA-HIN). The network nodes in our proposed MSA-HIN represent students with their multi-dimensional attribute information. Meanwhile, the edges are constructed to characterize student different relationships, such as co-major, co-occurrence, and co-borrowing books. Based on the MSA-HIN, embedded representations of students are learned and a deep graph cluster algorithm is applied to divide students into groups. Comparative experiments have been done on a real-life campus dataset collected from a university. The experimental results demonstrate that our method can effectively reveal the variability of student attributes and relationships and accordingly achieves the best clustering results for group division.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• The Journal of Bigdata
• /
• v.6 no.2
• /
• pp.61-70
• /
• 2021

The objective of this study was to describe specific approaches for data extraction from graph when statistical information is not directly reported in some articles, enabling data intergration and meta-analysis for quantitative data synthesis. Particularly, meta-analysis is an important analysis tool that allows the right decision making for evidence-based medicine by systematically and objectively selects target literature, quantifies the results of individual studies, and provides the overall effect size. For data integration and meta-analysis, we investigated the strength points about the introduction and application of Adobe Acrobet Reader and Python-based Jupiter Lab software, a computer tool that extracts accurate statistical figures from graphs. We used as an example data that was statistically verified throught an previous studies and the original data could be obtained from ClinicalTrials.gov. As a result of meta-analysis of the original data and the extraction values of each computer software, there was no statistically significant difference between the extraction methods. In addition, the intra-rater reliability of between researchers was confirmed and the consistency was high. Therefore, In terms of maintaining the integrity of statistical information, measurement using a computational tool is recommended rather than the classically used methods.