• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제11권9호
• /
• pp.289-304
• /
• 2022

스마트 IoT의 특징인 분산성 및 이동성에 기반한 안전 요구사항을 분석 및 검증하기 위한 프로세스 대수 및 논리가 요구된다. 하지만 기존의 프로세스 대수 및 논리는 분산성 및 이동성에 대한 표현이 제한적이므로 스마트 IoT의 요구사항 분석 및 검증이 비직관적이다. 이러한 한계를 극복하기 위해, 본 논문에서는 GTS-VL(Geo-Temporal Space-Visual Logic)을 제시한다. GTS-VL은 GTS에서 표현된 블록 간의 관계를 다루는 1차술어논리이며, GTS는 프로세스 대수인 dTP-Calculus를 사용하여 명세한 시스템의 동작 과정을 2차원 시공간에서 표현한 그래프이다. 본 논문에서 사용한 SAVE 도구는 ADOxx Meta-modeling Platform을 통해 개발되었으며, SAVE를 사용하여 PBC(Producer-Buffer-Consumer) 예제의 안전 요구사항을 분석 및 검증하고 문자 및 시각화 기반 검증 방법을 비교 분석하여 장점 및 실용성을 보인다.

• 한국산업정보학회논문지
• /
• 제16권5호
• /
• pp.9-19
• /
• 2011

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

• Journal of Computing Science and Engineering
• /
• 제7권1호
• /
• pp.1-20
• /
• 2013

Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP's table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features from both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework. Experimental results demonstrate that not only does the design improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

• 대한수학교육학회지:수학교육학연구
• /
• 제20권2호
• /
• pp.185-202
• /
• 2010

본 연구는 중등수학교육에서 도구화된 CAS에 기반한 최적화 문제해결 활동을 통해 CAS가 교육과정 내용제시 순서에 영향을 줄 수 있는지를 분석하기 위해 설계되었다. 이를 위하여 본 연구자는 CAS를 활용한 최적화 문제해결 활동을 구안하였으며 3개월간의 CAS 활용 수업 경험이 있으나 아직 미적분학을 접해 본 적이 없는 고등학교 2학년 7명을 선정하여 총 9차시의 수업을 실시하고, 수업녹화자료와 면담을 통해 학생들의 활동을 분석하였다. 분석 결과, 학생들은 CAS를 이용하여 미 학습된 교육내용인 미분과 삼차방정식, 무리방정식의 해구하기와 그래프 분석이 포함된 최적화 문제해결활동을 수준 높게 다룰 수 있는 것으로 나타나 CAS가 교육과정 내용제시 순서에 영향을 줄 수 있음을 확인할 수 있었다.

• 정보교육학회논문지
• /
• 제13권3호
• /
• pp.341-349
• /
• 2009

본 논문에서는 정보 과학교육에서 디지털 시스템의 동작 원리를 이해하는데 기초가 되는 디지털 논리 회로에 대한 내용을 쉽게 이해할 수 있도록, 전기회로 실험 조작 활동을 통한 논리회로 결과 검증 방법을 제안하였다. 그리고 제안한 검증방법을 활용하고 실생활 디지털 기기 예제를 통해 PBL 기법에 기반한 논리회로의 개념교육 방법 및 부울 논리 교육 방법을 제안하고 실제 수업에 적용한 결과를 난이도 할당의 적절성 및 학생들의 문제해결력 측면에서 분석하였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2835-2850
• /
• 2016

RSA is a public key cryptosystem that is currently the most popularly used in information security. Development of RSA variants has attracted many researchers since its introduction in 1978 by Ron Rivest, Adi Shamir, and Leonard Adleman. In this paper, we propose an algebraic structure for RSA and show that the proposed structure covers all known RSA variants. The usefulness of the proposed structure is then proved by showing that, following the structure we can construct a RSA variant based on the Bergman ring. We compare the original RSA and its variants from the point of view of factoring the modulus to determine why the original RSA is widely used than its variants.

• Journal of applied mathematics & informatics
• /
• 제33권5_6호
• /
• pp.545-557
• /
• 2015

A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G₁ and G₂ using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

• 대한수학회지
• /
• 제57권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.19-22
• /
• 1987

A program is developed for generations the dynamic equations for robotic manipulators using the symbolic language muSIMP/MATH. The muSIMP/MATH is a LISP-based computer algebra package, devoted to the manipulation of algebraic expressions including number, variables, functions, and matrix. The muSIMP/MATH can operate on IBM-PC compatibles with MS-DOS. The program is developed, on the e formalism. This is program is applicable to the manipulators of any number of degrees of freedom, maximum six degree of freedom in this program. To control robotic manipulators by using dynamic equation is required a symbolic equations. The generated dynamic equation can be applied directly to the robotic manipulators, for the generated dynamic equation is a reduced form of symbolic expression.