• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3761-3779
• /
• 2022

The performance of existing recognition algorithms for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals degrade under conditions of low signal-to-noise ratios (SNR). Hence, a novel recognition algorithm based on features in the graph domain is proposed in this study. First, the power spectrum of the squared candidate signal is truncated by a rectangular window. Thereafter, the graph representation of the truncated spectrum is obtained via normalization, quantization, and edge construction. Based on the analysis of the connectivity difference of the graphs under different hypotheses, the sum of degree (SD) of the graphs is utilized as a discriminate feature to classify BPSK and QPSK signals. Moreover, we prove that the SD is a Schur-concave function with respect to the probability vector of the vertices (PVV). Extensive simulations confirm the effectiveness of the proposed algorithm, and its superiority to the listed model-driven-based (MDB) algorithms in terms of recognition performance under low SNRs and computational complexity. As it is confirmed that the proposed method reduces the computational complexity of existing graph-based algorithms, it can be applied in modulation recognition of radar or communication signals in real-time processing, and does not require any prior knowledge about the training sets, channel coefficients, or noise power.

• Korean Journal of Construction Engineering and Management
• /
• v.22 no.1
• /
• pp.106-115
• /
• 2021

Classifying work trades using images can serve an important role in a multitude of advanced applications in construction management and automated progress monitoring. However, images obtained from work sites may not always be clean. Defective images can damage an image classifier's accuracy which gives rise to a needs for a method to enhance a work trade image classifier's performance. We propose a method that uses work dependency information to aid image classifiers. We show that using work dependency can enhance the classifier's performance, especially when a base classifier is not so great in doing its job.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.711-725
• /
• 2008

We give an explicit construction of Grobner-Shirshov pairs and monomial bases for finite-dimensional irreducible representations of the simple Lie algebra $sp_4$. We also identify the monomial basis consisting of the reduced monomials with a set of semistandard tableaux of a given shape, on which we give a colored oriented graph structure.

• Communications of Mathematical Education
• /
• v.22 no.2
• /
• pp.125-136
• /
• 2008

There are different perspectives on a function graph. For instance, a parabola is defined by movement of a ball in physics and by quadratic function in mathematics. This study deals with the turtle motion, which is local and intrinsic, and the construction of function graphs with mathematical experiments in a microworld. This paper concerns with a function graph which is in the curriculum or in the history of mathematics. In view of pre-calculus, we introduce activities of mathematization about formalizing of length and area of function graphs without knowledge of calculus.

• Journal of The Korean Association For Science Education
• /
• v.22 no.4
• /
• pp.768-778
• /
• 2002

Science teachers often suppose that students are able to know the symbolical meaning of graphs when they see the graphs. But such a assumption is not based on the firm theories but a mere image. And we need to search them for holding the abilities to construct and to interpret. In addition, unfortunately, many researchers show that they scarcely have the graphing skills. And then, The Test of Graphing in Science(TOGS) was administered to 535 7th to 12th graders, for we search them for holding the graphing abilities to some degree. Though the higher grade, the better score, they lack the first three among 9 objectives of TOGS which are scaling axes, assigning variables to the axes, using a best fit line, plotting points, translating a graph that displays the data, selecting the corresponding value for y(or x), interrelating/extrapolating graphs, describing the relationship between variables, interrelating the results of the two graphs. It was concluded from this that subjects' graph construction is lower than their graph interpretation in graph skills. It suggests that school science have a bias toward graph interpretation. This tendency represents more strikingly in the case of upper students in TOGS than the others'.

• Journal of Cadastre & Land InformatiX
• /
• v.46 no.1
• /
• pp.117-131
• /
• 2016

The development of LBS(location-based services) due to the widespread mobile environment highlights the importance of POI(point of interest) information. The accurate and up-to-date POI has to be ensured to reflect the information of rapidly changing places. For the efficient construction of POI, here we propose the novel construction system for t he place information. This system is based on crowd-sourcing in which a great number of users participate. In addition, we utilize the graph data model to build the new concept of the place information covering the wide areas extending from the specific point. Moreover, the implementation of the new system applying the graph data model and crowd-sourcing is realized in this paper. That is, this study suggests the whole new concept of the place information and shows the clustering and the renewal of the place information through crowd-sourcing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2367-2372
• /
• 2009

Recently, Many studies have been progressing to path-finding adapted dynamic information on the Terminal Based Navigation System(TBNS). The algorithms proposed are based on $A^*$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost. Path-finding with an abstract graph which expresses real road network as a simple graph is proposed for reducing dependency of heuristic and exploring cost. In this paper, two abstract graph that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost and the number of node access but $AG^C$ has worse performance than AGH at exploring cost.

• Journal of the Korean Chemical Society
• /
• v.63 no.6
• /
• pp.473-485
• /
• 2019

In this study, we investigated the differences of graph constructed by middle school students in daily-life and scientific contexts according to the views on the nature of scientific measurement. A test consisting of three similar data sets regarding daily-life and scientific contexts was developed, and administered to 151 ninth graders. They were expected to construct proportional, inverse-proportional, and increasing and become constant form of graphs for each data set. Graphs constructed were analyzed in the aspects of constructing a trend line (types of a trend line, interpolation/extrapolation), selecting axes variables, scaling axes, and plotting points. Analyses of the results revealed that the students with set paradigm tended to construct a curved trend line, while those with point paradigm constructed a broken trend line in inverse-proportional graph questions. In the aspects of interpolation/extrapolation, most students with set paradigm performed both interpolation and extrapolation better than those with point paradigm in scientific context. Most students with set paradigm performed both interpolation and extrapolation regardless of contexts, while the proportion of interpolation of those with point paradigm was higher in scientific context than in daily-life context. In selecting axes variables, scaling axes, and plotting dots, there were no statistically significant differences between set and point paradigms. On the bases of the results, educational implications for improving graph construction skills of middle school students are discussed.

• Journal of the Korean earth science society
• /
• v.29 no.6
• /
• pp.487-494
• /
• 2008

The purpose of this study was to investigate the effects of MBL experiment instruction on the 7th graders' scientific inquiry skills and graph construction and interpretation ability in the unit "Elements and movement of sea water". Results are as follows: First, this study analyzed the influence on students' scientific inquiry skill after having six MBL instructional classes. The result showed a significant difference in the scientific inquiry skills between the experimental group and the control group, which implies that the instruction using MBL was an effective way to improve students' scientific inquiry skills. Second, this study also analyzed the influence on students' abilities to construct and interpret graphs. The result did not show any significant differences between the experimental group and the control group in the ability to construct graphs. But it showed significant differences in the ability to interpretgraphs, which means that instruction using MBL was an effective way to improve students' ability to interpret graphs.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1428-1444
• /
• 1999

MSC는 ITU에 의해 표준화된, 병행 시스템의 명세를 기술하기 위한 그래픽 형태와 텍스트 형태를 제공하는 언어로서 실시간 시스템 특히 통신 교환 시스템의 특성을 기술하기 위해 자주 사용된다. 통신 시스템이 제대로 동작함을 보이기 위해서는 정형적인 방법을 사용하여 시스템 행위를 검증할 필요가 있다. 통신 소프트웨어를 검증하는 방법 중 하나의 방법으로 유한 상태를 기반으로 하는 방법이 있다. 유한 상태를 기반으로 하는 방법에서는 먼저 시스템 명세에 해당하는 전체 상태 전이 그래프를 생성한 후 이를 바탕으로 model-checking 등의 방법을 사용하여 시스템의 특성을 검증한다. 본 논문에서는 MSC로 기술된 통신 소프트웨어 명세로부터 전체 상태 전이 그래프를 생성하는 방법에 초점을 맞추었다. 시스템 명세에 해당하는 상태 전이 그래프를 생성하기 위해 보다 직관적으로 MSC의 의미론을 표현할 수 있고, 또한 쉽게 전체 상태 전이 그래프를 생성할 수 있는 행위 종속 그래프를 제안하였다. MSC 명세는 일단 행위 종속 그래프로 변환이 되고 이 행위 종속 그래프를 이용하여 전체 상태 전이 그래프가 생성된다.Abstract Message Sequence Chart (MSC) standardized by International Telecommunication Union is a graphical and textual language for describing the specification of concurrent systems. It is frequently used both formally and informally for specifying the behavior of real-time systems, in particular telecommunication switching systems. To ensure that a communication system operates properly, the verification process showing the correctness of system's behavior formally is necessary. One of the verification methods is a finite-state method. In the finite-state method, the global state transition graph (GSTG) is constructed and then safety and liveness properties of systems are verified through a well-known method such as model checking. In this paper, we forcus on the construction of GSTG from the specifications of telecommunication software written in MSC. We suggest Action Dependency Graph (ADG) which can present the semantics of MSC intuitively and also provide a GSTG construction method from ADG. MSC specifications are translated to ADGs and, in turns, the GSTGs are constructed by using these ADGs.