• 제목/요약/키워드: Boolean Research

검색결과 68건 처리시간 0.027초

혼돈함수와 기본 행렬 연산을 이용한 영상의 암호화 (Image Encryption using the chaos function and elementary matrix operations)

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

  • PDF

효율적인 연관규칙 감축을 위한 WT-알고리즘에 관한 연구 (A Study on WT-Algorithm for Effective Reduction of Association Rules)

  • 박진희;피수영
    • 한국산업정보학회논문지
    • /
    • 제20권5호
    • /
    • pp.61-69
    • /
    • 2015
  • 매일 각종 모바일 디바이스와 온라인, 소셜네트워크서비스 등에서 쏟아지는 데이터로 인해 정보의 홍수를 넘어 과부하 상태에 있다. 이미 생성되어 있는 기존 정보들도 있지만 시시각각 새롭게 생겨나고 있는 정보들이 헤아릴 수 없을 정도이다. 연관분석은 이러한 정보들 속에서 나타나는 항목의 발생 빈도수가 최소 지지도보다 큰 빈발항목집합(Frequent Item set)을 찾는 방법이다. 항목의 수가 많아짐에 따라 규칙의 수도 기하급수적으로 늘어나므로 원하는 정보를 찾기가 어려운 단점이 있다. 따라서 본 논문에서는 트랜잭션데이터 집합을 Boolean 변수 아이템으로 나타내었다. 논리함수를 간소화하는데 사용되는 Quine-McKluskey의 방법으로 알고리즘화하여 각 항목에 가중치를 부여한 WT-알고리즘을 제안한다. 제안한 알고리즘은 항목의 개수와 관계없이 간략화가 가능한 장점으로 인하여 불필요한 규칙을 감소시켜 데이터마이닝 효율을 향상시킬 수 있다.

고장수목으로부터 변환된 BDD에서 효율적인 MCS 추출을 위한 BDD 재구성 방법과 새로운 근사확률 공식 (A Method of BDD Restructuring for Efficient MCS Extraction in BDD Converted from Fault Tree and A New Approximate Probability Formula)

  • 조병호;현원기;이우준;김상암
    • 한국정보통신학회논문지
    • /
    • 제23권6호
    • /
    • pp.711-718
    • /
    • 2019
  • 이진결정도는 고장수목 해석에서 기존의 Boolean Logic 해석법의 잘 알려진 대체 방법이다. 고장수목의 규모가 커짐에 따라 계산에 필요한 컴퓨터 연산시간과 자원이 급격하게 증가한다. 이진결정도로부터 단절집합 및 최소단절 집합을 효과적으로 계산하기 위해 새로운 고장경로 탐색법과 고장경로 재구성 방법이 제안되었다. 고장경로 그룹화와 Bottom-Up 탐색법은 고장경로의 탐색에 효율적임을 증명하였고, 최소단절집합 계산을 위한 단절집합의 비교계산 횟수를 줄이기 위해 경로 재구성 방법을 사용할 수 있음을 증명하였다. 새로 제안된 방법을 적용하고, 기존의 근사확률 공식인 MCUB 확률공식과 동일한 새로운 ASDMP 확률공식을 사용하여 정상사상 확률을 계산 할 수 있다.

RELIABILITY ESTIMATION FOR A DIGITAL INSTRUMENT AND CONTROL SYSTEM

  • Yaguang, Yang;Russell, Sydnor
    • Nuclear Engineering and Technology
    • /
    • 제44권4호
    • /
    • pp.405-414
    • /
    • 2012
  • In this paper, we propose a reliability estimation method for DI&C systems. At the system level, a fault tree model is suggested and Boolean algebra is used to obtain the minimal cut sets. At the component level, an exponential distribution is used to model hardware failures, and Bayesian estimation is suggested to estimate the failure rate. Additionally, a binomial distribution is used to model software failures, and a recently developed software reliability estimation method is suggested to estimate the software failure rate. The overall system reliability is then estimated based on minimal cut sets, hardware failure rates and software failure rates.

Three-Dimensional Digital-Mold Modeling and Sand-Printing for Replication of Bronze Mirror

  • Jo, Young Hoon;Lee, Jungmin
    • 보존과학회지
    • /
    • 제37권1호
    • /
    • pp.25-33
    • /
    • 2021
  • To extend the application of digital technology to the replication of artifacts, meticulous details of the process and the diversity of three-dimensional (3D) printing output materials need to be supplemented. Thus, in this study, a bronze mirror with Hwangbichangcheon inscription was digitalized by 3D scanning, converted into a voxel model, and virtual conservation treatment was performed using a haptic device. Furthermore, the digital mold of the bronze mirror completed by Boolean modeling was printed using a 3D sand-printer. Such contactless replication based on digital technology reflects the stability, precision, expressivity, collectivity, durability, and economic feasibility of artifacts. Its application can be further extended to cultural products as well as such areas as education, exhibition, and research. It is expected to be in high demand for metal artifacts that require casting. If empirical studies through experimental research on casting are supplemented in the future, it could extend the application of digital technology-based contactless replication methods.

Visualisation of the Mathematical Process: Boolean Algebra and Graph Theory with TI-83/89

  • Gashkov, Igor
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제11권2호
    • /
    • pp.143-151
    • /
    • 2007
  • Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

  • PDF

Statistical Tolerance Allocation을 이용한 제조비용과 품질손실비용의 최소화 (The Minimization of Tolerance Cost and Quality Loss Cost by the Statistical Tolerance Allocation Method)

  • 김선호;권용성;이병기;강경식
    • 대한산업공학회지
    • /
    • 제24권2호
    • /
    • pp.175-183
    • /
    • 1998
  • When a product is designed, tolerances must be given to the product so that required functions are guaranteed and production costs are minimized. In this research, a model is suggested which allocates tolerances to components optimally according to the STA(Statistical Tolerance Allocation) method. Taking into account the concept that dimensional errors have characteristics of statistical distributions, this model presents the discrete pseudo-boolean approach for the tolerance optimization by minimizing the tolerance cost and the quality loss cost. In this approach, two methods are proposed for the reduction of the problem scale; 1) a method for converting the minimization model for casts into the maximization model for cost savings, and 2) procedures to reduce the number of constraints and variables.

  • PDF

다중 터미널 신뢰도 계산을 위한 효율적 알고리즘 (An Algorithm for Computing the Reliability of Multiple Terminal-Pairs)

  • 하경재;김원경
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.385-388
    • /
    • 2000
  • The computation of a terminal-pair reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Sum of Disjoint Products form. The terminal reliability can then be obtained in a straightforward manner from the Sum of Disjoint Products form. In this paper, we proposed an efficient method to obtain reliability expressions for calculating multiple K terminal-pairs reliability between terminal-pairs of nodes of computers of complex networks. Actual programming results show that the new method is superior with regard to computational efficiency, especially for computing the reliability of multiple terminals.

  • PDF

최적화에 근거한 LAD의 패턴생성 기법 (Optimization-Based Pattern Generation for LAD)

  • 장인용;류홍서
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.409-413
    • /
    • 2005
  • The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

  • PDF

SDP기법에 근거한 전체 네트워크 신뢰도 계산을 위한 효율적 알고리즘 (An Algorithm for Computing of the Network Reliability)

  • 하경재;서상희
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.473-476
    • /
    • 2000
  • The network reliability is to be computed in terms of the terminal reliability. The computation of a termini reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Disjoint Sum of Products form. But this computaion of the terminal reliability obviously does not consider the communication between any other nodes but for the source and the sink. In this paper, we derive the overall network reliability which is the probability of communication that each node in the network communicates with all other remaining nodes. For this, we propose a method to make the SOP disjoint for deriving the network reliability expression from the system success expression using the modified Sheinman's method and modified BDD method.

  • PDF