• 대한전자공학회논문지
• /
• 제13권6호
• /
• pp.20-23
• /
• 1976

본논문에서는 통신회로망의 신뢰도를 계산하는데 부울대수를 이용하는 방법을 제시하였다. 한 회로의 두 접합점사이의 모든 단순통로가 주어지면 병렬연산이라고 명명되는 부울대수산법에 의하여 두 단점사이의 신뢰도가 기호적으로 계산된다. 이 방법은 회로가 방향성이거나 비방향성이거나 다 효과적이다. A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.

• 전기학회논문지
• /
• 제66권1호
• /
• pp.137-143
• /
• 2017

In this paper, we investigate static control of Boolean networks described in the framework of semi-tensor product (STP) operation. The control objective is to determine control input nodes and their logical values so as to stabilize the considered Boolean network to a desired fixed point or cycle. Using topology of Boolean networks such as incidence matrix and hub nodes, a set of appropriate control input nodes is selected, and based on STP operations, we assign constant control inputs so that the controlled network can converge to a prescribed fixed point or cycle. To validate applicability of the proposed scheme, we conduct a numerical study on the problem of determining control input nodes for a Boolean network representing hierarchical differentiation of myeloid progenitors.

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

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• 한국정밀공학회지
• /
• 제22권9호
• /
• pp.194-201
• /
• 2005

Recently, as Rapid Prototyping is attracting people's attention, many peoples are actively participating in the research on STL format. The STL files are transformed to be input for RP after modeling in CAD system. When the shape, however, needs to be changed or edited, it is impossible without the original data. So, if the original data is lost, new modeling is required. Therefore, this study suggests a way to edit the shape in STL format and to make the Boolean operation possible between the original and edited shapes. In addition, the reliability was confirmed after going over the errors of the edited data.

• 한국CDE학회논문집
• /
• 제5권4호
• /
• pp.293-300
• /
• 2000

The non-manifold geometric modeling technique is to improve design process and to Integrate design, analysis, and manufacturing by handling mixture of wireframe model, surface model, and solid model in a single data structure. For the non-manifold geometric modeling, Euler operators and other high level modeling methods are necessary. Boolean operation is one of the representative modeling method for the non-manifold geometric modeling. This thesis studies Boolean operations of non-manifold model with the data structure of selective storage. The data structure of selective storage is improved non-manifold data structure in that existing non-manifold data structures using ordered topological representation method always store non-manifold information even if edges and vortices are in the manifold situation. To implement Boolean operations for non-manifold model, intersection algorithm for topological cells of three different dimensions, merging and selection algorithm for three dimensional model, and Open Inventor(tm), a 3D toolkit from SGI, are used.

• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.145-153
• /
• 1998

An approach has been developed to generate parametric models with Boolean operations. The approach combines Boolean operations and graph manipulation on the constraints imposed on primitives. A Boolean operation is first performed on two primitives and new geometric elements such as vertices and edges are computed. Then to generate the constraint graph of the polygon the each constraints graph of two primitives are merged by adding the new geometric elements with its corresponding constraints. In the merging process, some of the geometric elements belonging to the primitives may be eliminated based on its contribution to the polygon. A computer implementation in a 2D space is described to illustrate the approach with examples.

• 대한전자공학회논문지
• /
• 제21권4호
• /
• pp.43-51
• /
• 1984

부울함수의 간소화법에서 Quine Mcclustey법은 최소항들의 2진수 표현의 구조를 조사하는 방법을 쓰고 있다. 이 논문에서는 10진수로 표현한 최소항을 가지고 그들간의 큐브관계와 간소화에 따르는 제규칙을 정리로 간추려 표현하고 증명하였으며, 이들을 바탕으로 새로운 알고리즘의 부울함수 간소화법을 제안하였다. 예제를 들어 손작업의 방법을 보였고 아울러 이 과정을 FORTRAN 프로그램으로 작성하였다. 프로그램은 여분항을 포함하여 100개까지의 최소항을 가진 부울함수에 대하여 진성주항을 찾아 인쇄하도록 작성하였는데(배열을 크게 잡으면 그 이상도 가능함), 모든 경우에 손작업과 일치하는 결과를 얻었다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.833-835
• /
• 2002

In this paper, we propose multi-resolutional representation of B-rep solid models using the selective Boolean operations on non-manifold geometric models. Since the union and subtraction operations of the selective Boolean operations are commutative, the integrity of the model is guaranteed for reordering design features. A multi-resolution representation is established using a non-manifold merged set model and a feature modeling tree reordered according to some criterion of level of detail (LOD). Then, a solid model for a specified LOD can be extracted from this multi-resolution model using the selective Boolean operations.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권1호
• /
• pp.1-14
• /
• 2004

Due to the development of computer network and mobile communications, the security in image data and other related source are very important as in saving or transferring the commercial documents, medical data, and every private picture. Nonetheless, the conventional encryption algorithms are usually focusing on the word message. These methods are too complicated or complex in the respect of image data because they have much more amounts of information to represent. In this sense, we proposed an efficient secret symmetric stream type encryption algorithm which is based on Boolean matrix operation and the characteristic of image data.