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

검색결과 513건 처리시간 0.028초

Material feature representation and identification with composite surfacelets

  • Huang, Wei;Wang, Yan;Rosen, David W.
    • Journal of Computational Design and Engineering
    • /
    • 제3권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.

모든 $l{\times}n,\;n{\times}m,\;m{\times}k$ 불리언 행렬의 곱셈 시간 개선에 관한 연구 (A Study on the Improvement of Execution Time for the Multiplication of All $l{\times}n,\;n{\times}m,\;m{\times}k$ Boolean Matrices)

  • 한재일
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2006년도 춘계학술발표대회
    • /
    • pp.839-842
    • /
    • 2006
  • 대부분의 불리언 행렬에 대한 연구는 두 불리언 행렬의 곱셈에 초점을 두고 있으며 모든 불리언 행렬을 대상으로 한 곱셈에 대한 연구는 최근에야 극히 소수의 연구결과가 보이고 있다. 이 연구들은 모든 불리언 행렬 사이의 곱셈 실행시간을 개선시켰으나 연속된 세 개의 모든 lxn, nxm, mxk 불리언 행렬에 대한 곱셈은 아직 많은 개선이 필요하다. 본 논문은 모든 $l{\times}n,\;n{\times}m,\;m{\times}k$ 불리언 행렬의 곱셈 실행시간을 보다 개선할 수 있는 이론을 제시하고 이를 적용한 불리언 행렬 연속곱셈의 실행결과에 대하여 논한다.

  • PDF

불완전 다동출력 함수를 이용한 BD프로그래머블 제어 (BD Programmable Controller Utilizing an Incomplete Multiple Output Function)

  • 우광방;안민옥;김영일;김현기
    • 대한전기학회논문지
    • /
    • 제34권1호
    • /
    • pp.1-9
    • /
    • 1985
  • In this study we described Binary-Decision Method Programmable Controller that is faster than conventional Programmable Controller (P.C) using the Boolean method. An algorithm for the optimal BD program was systematically developed by using the incomplete multiple output function and the residual characteristic function. The potential applications of BD programmable controller for the problems of industrial control were illustrated, which include on-off sequential control function and also the tasks involving continuous data processing and PID control. An example was presented that has shown how BD programmable controller and ICU (Industrial Control Unit) controller can be applied to the sequential logics.

  • PDF

솔리드 모델러를 기반으로 한 사출 금형용 전극 형상의 모델링 (Geometric Modeling of Electrodes for Injection Mold based on a Solid Modeler)

  • 이철수;박광렬;이태경
    • 한국CDE학회논문집
    • /
    • 제6권1호
    • /
    • pp.9-16
    • /
    • 2001
  • Electrical discharge machining(EDM) is an important process of machining the injection mold. This paper includes efficient design processes of electrodes for EDM. Based on the solid modeler, electrodes can be created by boolean and offset operations with core/cavity models. The built-in offset operations of the solid modeler may occur unexpected results due to the limitations of the solid modeler. We proposed the multi-step and moving-face offset processes in order to apply the EDM clearances. The proposed design processes are implemented with Unigraphics Vl5 API functions and C language and tested on Windows NT 4.0.

  • PDF

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

  • 엄정호;박선호;정태명
    • 디지털산업정보학회논문지
    • /
    • 제6권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.

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

SPECTRAL DUALITIES OF MV-ALGEBRAS

  • Choe, Tae-Ho;Kim, Eun-Sup;Park, Young-Soo
    • 대한수학회지
    • /
    • 제42권6호
    • /
    • pp.1111-1120
    • /
    • 2005
  • Hong and Nel in [8] obtained a number of spectral dualities between a cartesian closed topological category X and a category of algebras of suitable type in X in accordance with the original formalism of Porst and Wischnewsky[12]. In this paper, there arises a dual adjointness S $\vdash$ C between the category X = Lim of limit spaces and that A of MV-algebras in X. We firstly show that the spectral duality: $S(A)^{op}{\simeq}C(X^{op})$ holds for the dualizing object K = I = [0,1] or K = 2 = {0, 1}. Secondly, we study a duality between the category of Tychonoff spaces and the category of semi-simple MV-algebras. Furthermore, it is shown that for any $X\;\in\;Lim\;(X\;{\neq}\;{\emptyset})\;C(X,\;I)$ is densely embedded into a cube $I^/H/$, where H is a set.

Argumentness and Probabilistic Case Structures

  • Yang, Dan-Hee;Lee, Ik-Hwan
    • 한국언어정보학회:학술대회논문집
    • /
    • 한국언어정보학회 2002년도 Language, Information, and Computation Proceedings of The 16th Pacific Asia Conference
    • /
    • pp.447-454
    • /
    • 2002
  • This paper proposes that the argument structures be stated in a way that uses probabilities derived from a corpus to replace a Boolean-value system of subcategorization. To do this, we make a cognitive model from a situation to an utterance to explain the phenomena of arguments'ellipsis, though the traditional term ellipsis is not suitable under our new concepts. We claim that the binary distinction is neither rational nor suitable for a real syntactic analysis. To solve this problem, we propose two new concepts argumentness and probabilistic Case structures by adapting the prototype theory. We believe that these concepts are effective in the syntactic analysis of NLP.

  • PDF

Enhanced Z map을 이용한 절삭 공정 시뮬레이션 시스템의 개발 (Development of Machining Simulation System using Enhanced Z Map Model)

  • 이상규;고성림
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2002년도 춘계학술대회 논문집
    • /
    • pp.551-554
    • /
    • 2002
  • The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

  • PDF

이산사건모델에 기반한 PLC 래더다이어그램 자동합성 (Synthesis of Ladder Diagrams for PLCs Based on Discrete Event Models)

  • 강봉석;조광현
    • 제어로봇시스템학회논문지
    • /
    • 제7권11호
    • /
    • pp.939-943
    • /
    • 2001
  • PLC(programmable Logic Controller)s essential components of modern automation systems encompassing almost every industry. Ladder Diagrams (LD) have been widely used in the design of such PLC since the LD is suitable for the modeling of the sequential control system. However, the synthesis of LD itself mainly depends on the experience of the industrial engineer, which may results in unstructured or inflexible design. Hence, in this paper, we propose a ladder diagram conversion algorithm which systematically produces LDs for PLCs based on discrete event models to enhance the structured and flexible design mechanism.

  • PDF