• 한국산업정보학회논문지
• /
• 제11권1호
• /
• pp.29-37
• /
• 2006

오늘날 컴퓨터 네트워크의 발전과 휴대통신의 광범위한 보급으로 연예 오락, 영상 문화콘텐츠, 전자상거래 또는 의료분야에 이르기 까지 멀티미디어 자료의 응용은 매우 중요한 위치를 차지하고 있다. 그러나 실제 이들 자료들이 발달된 통신망을 통하여 효율적으로 전파, 활용되기 위해서는 무엇보다도 이들을 저장하거나 전송하는 과정에서 충분한 안정성이 전제되어야 할 것이다. 이를 위하여 오늘날 많은 암호화 방법들이 개발되어 응용되고 있다. 그러나 대부분 원문에 대한 자료를 텍스트에 기반으로 하게 됨으로, 영상과 같이 자료의 양이 방대하고 실시간 처리하는데 제약이 존재하는 멀티미디어 자료에 직접 적용하기는 문제점이 많다. 이에 본 논문에서는 먼저 복잡성과 초기 조건에 대한 민감성 등 카오스적 특성을 지닌 Logistic 함수를 이용한 암호화 기법을 도입하고 다음으로 비트평면상에서 Boolean 행렬의 기본 연산을 이용한 대수적 암호화 알고리즘을 수행함으로써 효과적인 영상 암호화 방법을 제시하였다.

• 대한수학회보
• /
• 제32권2호
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• Biotechnology and Bioprocess Engineering:BBE
• /
• 제10권5호
• /
• pp.400-407
• /
• 2005

Reverse engineering is defined as the process where the internal structures and dynamics of a given system are inferred and analyzed from external observations and relevant knowledge. The first part of this paper surveys existing techniques for biosystem reverse engineering. Network structure inference techniques such as Correlation Matrix Construction (CMC), Boolean network and Bayesian network-based methods are explained. After the numeric and logical simulation techniques are briefly described, several representative working software tools were introduced. The second part presents our component-based software architecture for biosystem reverse engineering. After three design principles are established, a loosely coupled federation architecture consisting of 11 autonomous components is proposed along with their respective functions.

• 대한수학회지
• /
• 제32권4호
• /
• pp.849-856
• /
• 1995

There are some papers on structure theorems for the spaces of matrices over certain semirings. Beasley, Gregory and Pullman [1] obtained characterizations of semiring rank 1 matrices over certain semirings of the nonnegative reals. Beasley and Pullman [2] also obtained the structure theorems of Boolean rank 1 spaces. Since the semiring rank of a matrix differs from the column rank of it in general, we consider a structure theorem for semiring rank in [1] in view of column rank.

• 대한수학회지
• /
• 제31권4호
• /
• pp.645-657
• /
• 1994

If S is a semiring of nonnegative reals, which linear operators T on the space of $m \times n$ matrices over S preserve the column rank of each matrix\ulcorner Evidently if P and Q are invertible matrices whose inverses have entries in S, then $T : X \longrightarrow PXQ$ is a column rank preserving, linear operator. Beasley and Song obtained some characterizations of column rank preserving linear operators on the space of $m \times n$ matrices over $Z_+$, the semiring of nonnegative integers in [1] and over the binary Boolean algebra in [7] and [8]. In [4], Beasley, Gregory and Pullman obtained characterizations of semiring rank-1 matrices and semiring rank preserving operators over certain semirings of the nonnegative reals. We considers over certain semirings of the nonnegative reals. We consider some results in [4] in view of a certain column rank instead of semiring rank.

• 대한수학회보
• /
• 제20권1호
• /
• pp.9-13
• /
• 1983

M$_{n}$(F) denotes the set of all n*n matrices over F={0, 1}. For a, b.mem.F, define a+b=max{a, b} and ab=min{a, b}. Under these operations a+b and ab, M$_{n}$(F) forms a multiplicative semigroup (see [1], [4]) and we call it the semigroup of the n*n boolean matrices over F={0, 1}. Since the semigroup M$_{n}$(F) is the matrix representation of the semigroup B$_{n}$ of the binary relations on the set X with n elements, we may identify M$_{n}$(F) with B$_{n}$ for finding all D-classes.l D-classes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1556-1559
• /
• 1987

In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

• 한국IT서비스학회지
• /
• 제3권2호
• /
• pp.99-104
• /
• 2004

Conventional and public-key cryptography has been widely accepted as a base technology for the design of computer security systems. D-classes have the potential for application to conventional and public-key cryptography. However, there are very few results on D-classes because the computational complexity of D-class computation is NP-complete. This paper discusses the design of algorithms for the efficient computation of D-classes and the Java implementation of them. In addition, the paper implements the same D-class computation algorithms in C and shows the performance of C and Java programming languages for the computation-intensive applications by comparing their execution results.

• 산업경영시스템학회지
• /
• 제21권47호
• /
• pp.219-232
• /
• 1998

A lot of difficulties exist in analyzing the structure of a system owing to the complex and organic relations in the systems we face in reality. Focuses have been put on the research of optimal solution in a defined structure, however, on the assumption that the structure of the system has been already defined. With the grasping of the structure as the most prior condition, ISM(Interpretive Structural Modeling) and FSM(Fuzzy Structural Modeling) are suggested as solutions in this paper. ISM uses the systematic application of some elementary notions of graph theory and boolean algebra, FSM uses Fuzzy conception for representing relationship between elements. In FSM, the entries in the relation matrix are taken to value on the interval [0,1] by virtue of a fuzzy binary relation. Numeric examples are used as the actual application as follows.

• 한국전산구조공학회논문집
• /
• 제35권5호
• /
• pp.249-257
• /
• 2022

본 논문은 직접해법 기반 FETI 알고리즘의 개선 방안을 제시하였다. 개선 대상은 FETI-local로, 해당 알고리즘은 국부 Lagrange 승수를 통해 부영역 간 경계 문제를 정의한다. 부영역 경계 강성 및 하중 계산 단계의 경우, 전체 역행렬 계산 등 과도한 비용을 요구했던 기존 알고리즘을 Boolean 행렬 특성을 활용한 선택적 역행렬 성분 계산으로 개선하였다. 전역 경계 행렬식 계산 단계의 경우, 기존 단일 프로세서 연산을 다중 프론탈 기법 기반 병렬 연산으로 대체하였다. 제시된 FETI-local 알고리즘의 성능 개선은 64만 자유도 수치 예제를 통해 검증되었으며, 기존 대비 최대 97.8%의 계산 시간 감소가 달성되었다. 또한, 기존 대비 안정적이고 개선된 확장성이 가속 지표를 통해 확인되었다. 추가로, 432만 자유도의 대용량 계산 성능 비교가 제시된 알고리즘과 상용 프로그램인 ANSYS 간에 수행되었다. 그 결과, 계산 시간 측면에선 ANSYS가 우수하였으나, 프로세서 수에 따른 가속 성능 증가율 측면에선 제시된 알고리즘이 우수한 것이 확인되었다.