• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.115-124
• /
• 2000

For a finite group G, #Cent(G) denotes the number of cen-tralizers of its clements. A group G is called n-centralizer if #Cent( G) = n. and primitive n-centralizer if #Cent(G) = #Cent(${\frac}{G}{Z(G)$) = n. In this paper we compute the number of distinct centralizers of some finite groups and investigate the structure of finite groups with Qxactly SLX distinct centralizers. We prove that if G is a 6-centralizer group then ${\frac}{G}{Z(G)$${\cong}D_8$,$A_4$, $Z_2{\times}Z_2{\times}Z_2$ or $Z_2{\times}Z_2{\times}Z_2{\times}Z_2$.

• 한국HCI학회:학술대회논문집
• /
• 2007.02c
• /
• pp.306-317
• /
• 2007

We present an interactive and accurate collision detection algorithm for deformable, polygonal objects based on the streaming computational model. Our algorithm can detect all possible pairwise primitive-level intersections between two severely deforming models at highly interactive rates. In our streaming computational model, we consider a set of axis aligned bounding boxes (AABBs) that bound each of the given deformable objects as an input stream and perform massively-parallel pairwise, overlapping tests onto the incoming streams. As a result, we are able to prevent performance stalls in the streaming pipeline that can be caused by expensive indexing mechanism required by bounding volume hierarchy-based streaming algorithms. At run-time, as the underlying models deform over time, we employ a novel, streaming algorithm to update the geometric changes in the AABB streams. Moreover, in order to get only the computed result (i.e., collision results between AABBs) without reading back the entire output streams, we propose a streaming en/decoding strategy that can be performed in a hierarchical fashion. After determining overlapped AABBs, we perform a primitive-level (e.g., triangle) intersection checking on a serial computational model such as CPUs. We implemented the entire pipeline of our algorithm using off-the-shelf graphics processors (GPUs), such as nVIDIA GeForce 7800 GTX, for streaming computations, and Intel Dual Core 3.4G processors for serial computations. We benchmarked our algorithm with different models of varying complexities, ranging from 15K up to 50K triangles, under various deformation motions, and the timings were obtained as 30~100 FPS depending on the complexity of models and their relative configurations. Finally, we made comparisons with a well-known GPU-based collision detection algorithm, CULLIDE [4] and observed about three times performance improvement over the earlier approach. We also made comparisons with a SW-based AABB culling algorithm [2] and observed about two times improvement.

• 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.

• 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.

• Journal of computational fluids engineering
• /
• v.10 no.1
• /
• pp.99-106
• /
• 2005

Performance of first, second and third order accurate methods for calculation of in viscid fluxes in fluid flow governing equations are investigated here. For the purpose, an upwind method based on Roe's scheme is used to solve 2-dimensional Euler equations. To increase the accuracy of the method two different schemes are applied. The first one is a second and third order upwind-based algorithm with the MUSCL extrapolation Van Leer (1979), based on primitive variables. The other one is an upwind-based algorithm with the Chakravarthy extrapolation to the fluxes of mass, momentum and energy. The results show that the thickness of shock layer in the third order accuracy is less than its value in second order. Moreover, applying limiter eliminates the oscillations near the shock while increases the thickness of shock layer especially in MUSCL method using Van Albada limiter.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.211-222
• /
• 2006

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'COMPONENT' and 'ITEM' are different word-expressions for the same meaning. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. So we develop an algorithm mapping two terms based on their ontological definitions and their similarities. The proposed algorithm consists of four steps: the character matching, the inferencing, the definition comparing and the similarity checking. In the similarity checking step, we consider relation similarity and hierarchical similarity. The algorithm is very primitive, but it shows the possibility of semi-automatic mapping using ontology. In addition, we design a mapping procedure for a mapping system, called SOM (semantic ontology mapper).

• Journal of computational fluids engineering
• /
• v.5 no.1
• /
• pp.43-59
• /
• 2000

Characteristic boundary conditions are discussed in conjunction with a flux-difference splitting formulation as modified from Roe's linearization. Details of how one can implement the characteristic boundary conditions which are made compatible with the interior point formulation are described for different types of boundaries including subsonic outflow and adiabatic wall. The validity of boundary conditions are demonstrated through computation of transonic airfoil, supersonic ogive-cylinder, hypersonic cylinder, and S-duct internal flows. The computed wall pressure distributions are compared with published experimental and computed data. Objectives of this paper are thus to give insight of formulation procedure of a flux-difference splitting method and to pave ways for other users to adopt present boundary procedure on their numerical methods.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.295-311
• /
• 1999

An increasing attention is paid to STEP-NC, the next generation CNC controller interfacing STEP-compatible data. In this paper, we first propose an Architecture for the STEP-NC (called FBCC: Feature Baled CNC Controller) accepting feature code compatible with STEP-data, and executing NC motion feature by feature while monitoring the execution status. The main thrust of the paper has been to develop an automatic on-line tool path generation and modification scheme for milling operation. The tool path it generated iota each feature by decomposing into a finite number of primitive features. The key function in the new scheme is haw to accommodate unexpected execution results. In our scheme, the too1 path plinker is designed to have a tracing capability iota the tool path execution so that a new path can be generated from the point where the operation is stopped. An illustrative example is included to show the capability of the developed algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.262-268
• /
• 2002

Octree representation has the advantage of being able to represent complex shapes approximately through the repetition of simple primitive shapes. Due to this reason, octree representation together with VRML(Virtual Reality Modelling Language) is usually used for approximating 3D shapes. Since the data size of octree representation increases rapidly as 3D shape to be represented is more and more complicated, its transmission time also increase. In this paper, provided is the new octree representation and encoding/decoding scheme for real-time transmission through the internet in order to visualize 3D geometric data of large size approximately.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.11-23
• /
• 2010

A flexible and correct model of the activity flows is required for workflows in product development environments. In particular, the design activity flows are not known until run-time, and conventional approaches have limit to handle this situation because they cannot predefine all the potentially reachable paths. Thus, the structure of the workflow model must be flexible enough to describe variety in workflow design and accommodate dynamic changes during workflow execution. In this paper, we provide the general primitive axioms and change patterns based on event calculus for dynamic workflow specification and execution mechanisms in product development environments. Also, we describe how to execute the workflow dynamically based on the workflow specification and workflow change patterns using abductive planning technique.