• Title/Summary/Keyword: Boolean Operation

Search Result 71, Processing Time 0.029 seconds

A Boolean Algebra Method for Calculation of Network Reliability (부울대수산법에 의한 회로망신뢰도의 계산법)

  • 고경식;오영환
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.13 no.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.

  • PDF

Static Control of Boolean Networks Using Semi-Tensor Product Operation (Semi-Tensor Product 연산을 이용한 불리언 네트워크의 정적 제어)

  • Park, Ji Suk;Yang, Jung-Min
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.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.

Privacy-assured Boolean Adjacent Vertex Search over Encrypted Graph Data in Cloud Computing

  • Zhu, Hong;Wu, Bin;Xie, Meiyi;Cui, Zongmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Development of Boolean Operations for CAD System Kernel Supporting Non-manifold Models (비다양체 모델을 수용하는 CAD 시스템 커널을 위한 불리안 조직의 개발)

  • 김성환;이건우;김영진
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.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.

  • PDF

A Study On the Boolean Operation Of STL Format (STL 포맷의 BOOLEAN 연산에 대한 연구)

  • Son, Beom-Soo;Jeon, Eon-Chan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.9 s.174
    • /
    • 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.

Boolean Operation of Non-manifold Model with the Data Structure of Selective Storage (선택저장 자료구조를 이용한 복합다양체 모델의 불리언 작업)

  • 유병현;한순흥
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.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.

  • PDF

Polygon Modeling with Constraint Management (구속조건 관리를 이용한 다각형 모델링)

  • 김기현;김재정
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.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.

  • PDF

A New Algorithm for Boolean Function Minimization (부울함수의 간소화를 위한 새 방법)

  • 이우이
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.4
    • /
    • pp.43-51
    • /
    • 1984
  • In the case of Quine Mccluskey's methode for Boolean function minimization, we have to examine each bits of binary represented minterms. In this paper, cube relations between misterms that are represented by means of decimal number, and all sorts of rules for Boolean function minimization are described as theorems, and they are verified. And based on these theorems, the new fast algorithm for Boolean function minimization is proposed. An example of manual operation is sholvn, and the process is writed out by a FORTRAN program. In this program, the essential pl.imp implicants of the Boolean function that has 100 each of minterms including redundant minterms, are finked and printed out, (the more minterms can be treated if we take the more larger size of arrays) and the outputs are coincided with the results of manual operation.

  • PDF

Multi-Resolution Representation of Solid Models using the Selective Boolean Operations (선택적 불리안 연산자를 이용한 솔리드 모델의 다중해상도 구현)

  • 이상헌;이강수;박상근
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • 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.

  • PDF

IMAGE ENCRYPTION THROUGH THE BIT PLANE DECOMPOSITION

  • Kim, Tae-Sik
    • The Pure and Applied Mathematics
    • /
    • v.11 no.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.

  • PDF