• 대한전자공학회논문지
• /
• 제18권3호
• /
• pp.9-14
• /
• 1981

테스트셋트를 적게 가지면서 literal 수도 적게 포함하는 RMC (Reed-Muller Canonical) form을 찾는 방법을 고안하여 현존하는 수법보다 간단함을 보였다. 더불어 이 방법은 Don't Care 조건을 갗는 함수에도 적용됨을 보였다.

• ETRI Journal
• /
• 제33권4호
• /
• pp.656-659
• /
• 2011

In ICISC 2007, Comuta and others showed that among the methods for constructing pairing-friendly curves, those using cyclotomic polynomials, that is, the Brezing-Weng method and the Freeman-Scott-Teske method, are affected by Cheon's algorithm. This paper proposes a method for searching parameters of pairing-friendly elliptic curves that induces minimal security loss by Cheon's algorithm. We also provide a sample set of parameters of BN-curves, FST-curves, and KSS-curves for pairing-based cryptography.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.461-470
• /
• 2007

Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.

• Kyungpook Mathematical Journal
• /
• 제49권2호
• /
• pp.321-348
• /
• 2009

In this paper, we give two lower bounds on the diameter of the boundary slope set of a Montesinos knot. One is described in terms of the minimal crossing numbers of the knots, and the other is related to the Euler characteristics of essential surfaces with the maximal/minimal boundary slopes.

• ETRI Journal
• /
• 제14권4호
• /
• pp.19-27
• /
• 1992

Since. as is well known, direct computation of the reliability for a large-scaled and complex net work generally requires exponential time, a variety of alternative methods to estimate the network reliability using simulation have been proposed. Monte Carlo sampling is the major approach to estimate the network reliability using simulation. In the paper, a dynamic Monte Carlo sampling method, called conditional minimal cut set (CMCS) algorithm, is suggested. The CMCS algorithm simulates a minimal cut set composed of arcs originated from the (conditional) source node until s-t connectedness is confirmed, then reduces the network on the basis of the states of simulated arcs. We develop the importance sampling estimator and the total hazard estimator and compare the performance of these simulation estimators. It is found that the CMCS algorithm is useful in reducing variance of network reliability estimator.

• 대한전자공학회논문지
• /
• 제21권5호
• /
• pp.55-60
• /
• 1984

CMOS기술의 발전에 따라 디지탈 회로를 실현하는데 complex gate 구조를 많이 사용하게 되었다. CMOS complex gate에 대해 내부 게이트 응답과 unknown state등을 고려하여 모든 stuck-open(이하 s-op)과 stuck-on(이하 s-on) 고장을 검출할 수 있는 새로운 테스트 생성 알고리즘이 제소되었다 이 알고리즘은 minimal하고 complete한 테스트 집합을 구할 수 있게 해준다. 또한, 임의의 CMOS complex gate 회로에 대해 본 알고리즘을 적용시켜, 컴퓨터를 통해 그와 같은 테스트 집합이 구해짐을 입증하였다.

• 충청수학회지
• /
• 제26권1호
• /
• pp.53-69
• /
• 2013

Topology may described a pattern of existence of elements of a given set X. The family ${\tau}(X)$ of all topologies given on a set X form a complete lattice. We will give some topologies on this lattice ${\tau}(X)$ using a topology on X and regard ${\tau}(X)$ a topological space. A topology ${\tau}$ on X can be regarded a map from X to ${\tau}(X)$ naturally. Such a map will be called topology field. Similarly we can also define pe-topology field. If X is a topological flow group with acting group T, then naturally we can get a another topological flow ${\tau}(X)$ with same acting group T. If the topological flow X is minimal, we can prove ${\tau}(X)$ is also minimal. The disjoint unions of the topological spaces can describe some topological systems (topological organisms). Here we will give a definition of topological organism. Our purpose of this study is to describe some properties concerning patterns of relationship between topology fields and topological organisms.

• Nuclear Engineering and Technology
• /
• 제50권8호
• /
• pp.1255-1265
• /
• 2018

The need for a PSA (Probabilistic Safety Assessment) for a multi-unit at a site is growing after the Fukushima accident. Many countries have been studying issues regarding a multi-unit PSA. One of these issues is the problem of many combinations of accident sequences in a multi-unit PSA. This paper deals with the methodology and software to quantify a PSA scenarios for a multi-unit site. Two approaches are developed to quantify a multi-unit PSA. One is to use a minimal cut set approach, and the other is to use a Monte Carlo approach.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 2005년도 추계학술발표회
• /
• pp.544-545
• /
• 2005

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3274-3297
• /
• 2021

Permission delegation is an important research issue in access control. It allows a user to delegate some of his permissions to others to reduce his workload, or enables others to complete some tasks on his behalf when he is unavailable to do so. As an ideal solution for controlling read access on outsourced data objects on the cloud, Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has attracted much attention. Some existing CP-ABE schemes handle the read permission delegation through the delegation of the user's private key to others. Still, these schemes lack the further consideration of granularity and traceability of the permission delegation. To this end, this article proposes a flexible and fine-grained CP-ABE key delegation approach that supports white-box traceability. In this approach, the key delegator first examines the relations between the data objects, read permission thereof that he intends to delegate, and the attributes associated with the access policies of these data objects. Then he chooses a minimal attribute set from his attributes according to the principle of least privilege. He constructs the delegation key with the minimal attribute set. Thus, we can achieve the shortest delegation key and minimize the time of key delegation under the premise of guaranteeing the delegator's access control requirement. The Key Generation Center (KGC) then embeds the delegatee's identity into the key to trace the route of the delegation key. Our approach prevents the delegatee from combining his existing key with the new delegation key to access unauthorized data objects. Theoretical analysis and test results show that our approach helps the KGC transfer some of its burdensome key generation tasks to regular users (delegators) to accommodate more users.