• Title/Summary/Keyword: Feature data file

Search Result 68, Processing Time 0.025 seconds

A study on the Restoration of Feature Information in STEPAP224 to Solid model (STEP AP224에 표현된 특징형상 정보의 솔리드 모델 복원에 관한 연구)

  • 김야일;강무진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.367-372
    • /
    • 2001
  • Feature restoration is that restore feature to 3D solid model using the feature information in STEP AP224. Feature is very important in CAPP, but feature information is defined very complicated in STEP AP224. This paper recommends the algorithm of extraction the feature information in physical STEP AP224file. This program import STEP AP224 file, parse the geometric and topological information, the tolerance data, and feature information line-by-line. After importation and parsing, store data into database. Feature restoration module analyze database including feature information, extract feature information, e.g. feature type, feature's parameter, etc., analyze the relationship and then restore feature to 3D solid model.

  • PDF

A Study on feature-based Design System for Mold and Moldbase (특징형상기법을 원용한 사출금형 설계시스템 연구)

  • 허용정
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.2 no.2
    • /
    • pp.101-106
    • /
    • 2001
  • The integrated design system for injection molding has been studied. The current CAD system do not provide mold designers with necessary function for CAD/CAPP/CAE interface except the geometric modeling capability. This paper describes a feature-based CAD system for mold and moldbase design which enables the concurrent design and CIM, with integrated design procedure, at the initial design stage of injection molding A new design methodology and resulting feature data files for this design system are also discussed.

  • PDF

Design and Implementation of Distributed File Transfer Server (파일 공유를 위한 분산 파일 서버 설계 및 구현)

  • 박주영;고석주;강신각
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.614-618
    • /
    • 2002
  • Although there are a lot of file sharing mechanisms in the Internet such as NFS and P2P, FTP is one of the most common mechanisms used until now. In this paper, we propose a more enhanced file sharing mechanism, the Distributed File Server (DFS) method. The most remarkable feature of DFS is that it can be simply adopted in the current Internet FTP services by locating a DFS node between existing FTP servers and clients without changing any existing file transfer environment. To verify the proposed mechanism we implemented a DFS prototype on RedHat 7.2 system and we finally show that it can reduce the file storage problem caused by big-sized multimedia data.

  • PDF

Information Hiding and Detection in MS Office 2007 file (Microsoft Office 2007 파일에의 정보 은닉 및 탐지 방법)

  • Park, Bo-Ra;Park, Jung-Heum;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.3
    • /
    • pp.143-154
    • /
    • 2008
  • Information hiding is a very important technology recently. Having this technology can be a competitive power for secure communication. In this paper, it will be showed that hiding data in MS Office 2007 file is possible. Considering Microsoft (MS) Office 2007 file format is based on Open XML format, the feature of Open XML format makes it possible to hide data in MS Office 2007 file. In Open XML format, unknown XML files and their relationships can be defined by user. These parts and relationships are used to hide data in MS Office 2007 file. Considering unknown parts and unknown relationships are not in normal MS Office 2007 file, the hidden data can be detected by confirming of unknown parts and unknown relationships.

A Study on the Ship Cargo Hold Structure Data Model Based on STEP (STEP을 근거로 한 선체화물창부 구조 데이터 모델에 관한 연구)

  • 박광필;이규열;조두연
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.4
    • /
    • pp.381-390
    • /
    • 1999
  • In this study, a pseudo ship structure data model for the :.hip cargo hold structure based on STEP is proposed. The proposed data model is based on Application Reference Model of AP218 Ship Structure which is the model that specifies conceptual structures and constraints used to describe the information requirements of an application. And the proposeddata model refers the Ship Common Model framework for the model architecture which is the basis for ongoing ship AP development within the ISO ship-building group and the ship product definition information model of CSDP research project for analyzing the relationship between ship structure model entities. The proposed data model includes Space, Compartment. Ship Structural System, Structural Part and Structural Feature of cargo hold. To generate this data model schema in EXPRESS format, ‘GX-Converter’was used which enables user to edit a model in EXPRESS format and convert schema file in EXPRESS format. Using this model schema, STEP physical file containing design data for ship cargo hold data structure was generated through SDAI programming. The another STEP physical file was also generated containing geometry data of ship cargo hold which was extracted and calculated by SDAI and external surface/surface intersection program. The geometry information of ship cargo hold can be then transferred to commercial CAD system, for example, Pro/Engineer. Examples of the modification of the design information are also Presented.

  • PDF

Geometrical Analysis on the Formation Mechanism of Milling Burr on Arbitrary Feature (임의형상의 버 발생 메카니즘의 기하학적 해석)

  • 이제열;안용진;김영진
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.4
    • /
    • pp.222-228
    • /
    • 2001
  • In the milling operation, the burr can be generated on the intersection of cutting tool and workpiece. Due to burr formation, we expect lower efficiency in the operation and the cost increase. In order to understand the burr formation mechanism in the milling operation on the arbitrary feature, we developed an algorithm to analyse and predict the exit burr formation mechanism. Firstly, the recognition of arbitrary shaped workpiece was done through the CAD data. This data includes point information on the vertices of the workpiece. Secondly, tile CAM data regarding tool geometry, tool path, cutting speed, and material data are retrieved to simulate the actual cutting process. Thirdly, we predict the exit burr formation on the edge of workpiece based on the geometric analysis. Lastly, an algorithm implemented in the Windows environment to visualize the burr formation simulation. With this information, we can predict which portion of workpiece would have the exit burr in advance so that we call manage to find a way to minimize the edit burr formation in the actual cutting.

  • PDF

Stepwise Volume Decomposition Considering Design Feature Recognition (설계 특징형상 인식을 고려한 단계적 볼륨 분해)

  • Kim, Byung Chul;Kim, Ikjune;Han, Soonhung;Mun, Duhwan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.1
    • /
    • pp.71-82
    • /
    • 2013
  • To modify product design easily, modern CAD systems adopt the feature-based model as their primary representation. On the other hand, the boundary representation (B-rep) model is used as their secondary representation. IGES and STEP AP203 edition 1 are the representative standard formats for the exchange of CAD files. Unfortunately, both of them only support the B-rep model. As a result, feature data are lost during the CAD file exchange based on these standards. Loss of feature data causes the difficulty of CAD model modification and prevents the transfer of design intent. To resolve this problem, a tool for recognizing design features from a B-rep model and then reconstructing a feature-based model with the recognized features should be developed. As the first part of this research, this paper presents a method for decomposing a B-rep model into simple volumes suitable for design feature recognition. The results of experiments with a prototype system are analyzed. From the analysis, future research issues are suggested.

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

Development of Integrated Product Information Model Using STEP (STEP 을 이용한 통합제품정보모델(IPIM) 개발)

  • Suh, Hyo-Won;Yoo, Sang-Bong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.3
    • /
    • pp.441-461
    • /
    • 1995
  • This research proposes an Integrated Product Information Model (IPIM) using STEP (Standard for the Exchange of product model data) for Computer Integrated Manufacturing (CIM) of Concurrent Engineering (CE). IPIM is based on Geometry and Topology (STEP Part 42), Form Feature (STEP Part 48), and Tolerance (STEP Part 48) for representing the integrated information of mechanical parts. For the IPIM, 1) new entities are developed for integration of existing entities, and 2) the existing entities are restructured and modified for a special application protocol. In CIM or CE, the advantages of using IPIM having integrated form of geometry, feature and tolerance are 1) integration of product design, process design and manufacturing sequentially or concurrently. 2) keep the product data consistency, modified by different domain, and 3) automatic data exchange between different application software and different hardware. The prototype system is composed of CAD, Data Probe, DBMS and SDAI (Standard Data Access Interface), and the generated STEP data is stored in a step file of DBMS for other applications.

  • PDF

Program Development for Extracting the Numerical Data of Aspherical Surface for the Core Manufacturing of Ophthalmic Lens (안경렌즈 코아 가공을 위한 비구면 형상 도출 프로그램 개발)

  • Lee, Dong-Hee
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.12 no.4
    • /
    • pp.87-90
    • /
    • 2007
  • To manufacture the lens mold used in producing polycarbonate (PC) lenses, the core manufacturing is needed and this core manufacturing is generally performed by diamond turning machine (DTM) or computer numerical control (CNC) lathe. The numerical data about the lens core feature is necessarily needed for operating of these devices. Therefore, we developed the program which calculate the numerical data about the lens core feature. The program was composed to be able to input aspherical coefficients of lens feature, display the graph of lens feature, and save the numerical data file.

  • PDF