• Title/Summary/Keyword: boolean model

Search Result 93, Processing Time 0.023 seconds

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

  • Kim, Sunn-Ho;Kwon, Yong-Sung;Lee, Byong-Ki;Kang, Kyung-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.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

Feedrate Optimization Using CL Surface (공구경로 곡면을 이용한 이송속도 최적화)

  • 김수진;정태성;양민양
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.4
    • /
    • pp.39-47
    • /
    • 2004
  • In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR(material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over loom, so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL (cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants were applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to the machining of speaker and cellular phone mold. The finishing time was reduced to 12.6%, tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were reduced, compared to the machining by constant feedrate. The machining time was shorter to 17% and surface quality and tool was also better than the conventional federate regulation using curvature of the tool path.

A Study on an Extended Cyber Attack Tree for an Analysis of Network Vulnerability (네트워크 취약성 분석을 위한 확장된 사이버 공격 트리에 관한 연구)

  • Eom, Jung Ho;Park, Seon Ho;Chung, Tai M.
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.49-57
    • /
    • 2010
  • We extended a general attack tree to apply cyber attack model for network vulnerability analysis. We defined an extended cyber attack tree (E-CAT) which extends the general attack tree by associating each node of the tree with a transition of attack that could have contributed to the cyber attack. The E-CAT resolved the limitation that a general attack tree can not express complex and sophisticate attacks. Firstly, the Boolean expression can simply express attack scenario with symbols and codes. Secondary, An Attack Generation Probability is used to select attack method in an attack tree. A CONDITION-composition can express new and modified attack transition which a aeneral attack tree can not express. The E-CAT is possible to have attack's flexibility and improve attack success rate when it is applied to cyber attack model.

RELIABILITY ESTIMATION FOR A DIGITAL INSTRUMENT AND CONTROL SYSTEM

  • Yaguang, Yang;Russell, Sydnor
    • Nuclear Engineering and Technology
    • /
    • v.44 no.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.

Offsetting Operations in Non-manifold Geometric Modeling (비다양체 모델의 옵셋 기능 개발)

  • 이상헌
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.1
    • /
    • pp.1-14
    • /
    • 1998
  • This paper introduces non-manifold offsetting operations, which add or remove a uniform thickness from a given non-manifold model. Since these operations can be applied to not only solids but also wireframe or sheet objects, they are potentially useful for pipeline modeling, sheet metal and plastic part modeling, tolerance analysis, clearance checking, constant-radius rounding and filleting of solids, converting of abstracted models to solids, HC too1 path generation and so on. This paper describes mathematical properties and algorithms for non-manifold offsetting. In this algorithm, a sufficient set of tentative faces are generated first by offsetting all or a subset of the vertices, edges and faces of the non-manifold model. And then they are merged into a model using the Boolean operations. Finally topological entities which are within offset distance are removed. The partially modified offsetting algorithms for wireframes or sheets are also discussed in order to provide more practical offset models.

  • PDF

Sheet Modeling and Transformation of Sheet into Solid Based on Non-manifold Topological Representation (바다양체 위상 표현을 바탕으로 한 박판 형상 모델링 및 솔리드로의 변환)

  • Lee, S.H.;Lee, K.W.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.7
    • /
    • pp.100-114
    • /
    • 1996
  • In order to create a solid model more efficiently for a plastic or sheet metal product with a thin and constant thickness, various methods have been proposed up to now. One of the most typical approaches is to create a sheet model initially and then transform it into a solid model automatically for a given thickness. The sheet model as well as the transitive model in sheet modeling procedure is a non-manifold model. However, the previous methods adopted the boundary representations for a solid model as their topological framework. Thus, it is difficult to represent the exact adjacency relationship between topological entities and to implement the topological operations for sheet modeling and the transformation procedure of a sheet into a solid. In this paper, we proposed a sheet modeling system based on a non-manifold topological representation which can represent solids, sheets, wireframes, and their mixture. A set of generalized Euler operators for non-manifold topology as well as the sheet modeling capabilities including adding, bending, and punching functions are provided for easy modeling of sheet objects, and they are perfomed interactively with a two dimensional curve editor. Once a sheet model is completed, it can be transformed into a solid automatically. The transformation procedure is composed of the offset functions and the Boolean operations of sheet models, and it is even more comprehensive and easier to be implemented than the precious methods.

  • PDF

Material feature representation and identification with composite surfacelets

  • Huang, Wei;Wang, Yan;Rosen, David W.
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.4
    • /
    • pp.370-384
    • /
    • 2016
  • Computer-aided materials design requires new modeling approaches to characterize and represent fine-grained geometric structures and material compositions at multiple scales. Recently, a dual-Rep approach was developed to model materials microstructures based on a new basis function, called surfacelet. As a combination of implicit surface and wavelets, surfacelets can efficiently identify and represent planar, cylindrical, and ellipsoidal geometries in material microstructures and describe the distribution of compositions and properties. In this paper, these primitive surfacelets are extended and composite surfacelets are proposed to model more complex geometries. Composite surfacelets are constructed by Boolean operations on the primitives. The surfacelet transform is applied to match geometric features in three-dimensional images. The composition of the material near the identified features can then be modeled. A cubic surfacelet and a v-joint surfacelet are developed to demonstrate the reverse engineering process of retrieving material compositions from material images.

Implementation of Hybrid Neural Network for Improving Learning ability and Its Application to Visual Tracking Control (학습 성능의 개선을 위한 복합형 신경회로망의 구현과 이의 시각 추적 제어에의 적용)

  • 김경민;박중조;박귀태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.12
    • /
    • pp.1652-1662
    • /
    • 1995
  • In this paper, a hybrid neural network is proposed to improve the learning ability of a neural network. The union of the characteristics of a Self-Organizing Neural Network model and of multi-layer perceptron model using the backpropagation learning method gives us the advantage of reduction of the learning error and the learning time. In learning process, the proposed hybrid neural network reduces the number of nodes in hidden layers to reduce the calculation time. And this proposed neural network uses the fuzzy feedback values, when it updates the responding region of each node in the hidden layer. To show the effectiveness of this proposed hybrid neural network, the boolean function(XOR, 3Bit Parity) and the solution of inverse kinematics are used. Finally, this proposed hybrid neural network is applied to the visual tracking control of a PUMA560 robot, and the result data is presented.

  • PDF

The Site Analysis for Land Use Planing using Fuzzy Sets Theory and Analytic Hierarchy Process(AHP) - The Case Study of Technopark Planning in Pohang - (토지이용계획의 용도별 적지분석에 있어서 퍼지이론 및 계층분석과정(AHP)의 활용 - 포항시 첨단연구단지의 사례분석을 중심으로-)

  • Koo, Jahoon;Sung, Keum-Young
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.4 no.1
    • /
    • pp.34-46
    • /
    • 2001
  • The Boolean logic analysis method using GIS as a spatial decision support system(SDSS) contains two problems. One is losing a lots of informations in analysis process, the other is unable to reflect of different weights between analysis items. The purpose of this study is to provide a new decision-making model for site analysis, that provides a rational and systemic way using fuzzy sets theory and analytic hierarchy process(AHP) theory. According to this study of technopark in Pohang, Boolean logic method did not reflect the influence of the differently weighted items and selected only 8.0% to 16.1% of the area for suitable sites for residence, commercial/research, park/green uses. The fuzzy sets theory and AHP theory method were able to reflect the influence of differently weighted items and selected 32.9% to 37.4% of the area for the best sites, and also provided more other kinds of informations. The results of this study show that GIS system using fuzzy sets theory and AHP proess method provides a more flexible and objective solutions for site analysis.

  • PDF

Conjunctive Boolean Query Optimization based on Join Sequence Separability in Information Retrieval Systems (정보검색시스템에서 조인 시퀀스 분리성 기반 논리곱 불리언 질의 최적화)

  • 박병권;한욱신;황규영
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.395-408
    • /
    • 2004
  • A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).