• Title/Summary/Keyword: pattern blocks

Search Result 225, Processing Time 0.031 seconds

An Efficient Disk Block Allocation Method for XML Data (XML 데이타를 위한 효율적인 디스크 블록 할당 방법)

  • Kim, Jung-Hoon;Son, Jin-Hyun;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.465-472
    • /
    • 2007
  • With the recent proliferation of the use of semi-structured data such as XML, it becomes more important to efficiently store and manage the semi-structured data. The XML data can be logically modelled as a rooted tree e.g., the DOM tree. In order to process a query on the XML data, we traverse the tree structure. In this paper we present an algorithm that places the XML data to disk blocks. The proposed algorithm assigns a number to each node of the tree in a bottom-up fashion. Then, the nodes are allocated to disk blocks using the assigned number. The proposed algorithm does not need access pattern information, and provides good performance for any access pattern. The characteristics of the proposed method are presented with analysis. Through experiments, we evaluate the performance of the proposed method.

Characteristics of Pattern Design from Dries Van Noten Collection (드리스 반 노텐의 컬렉션에 나타난 문양디자인 특성)

  • Kim, Chanju;Ro, Mikyung
    • Journal of the Korean Society of Costume
    • /
    • v.63 no.5
    • /
    • pp.115-131
    • /
    • 2013
  • Dries Van Noten, one of the Antwerp Six, focused on recreating traditional attire from each region to complex contemporary attire and has shown designs that interpreted ethnic image in contemporary perspective from his very first collection. He has positioned himself as a designer with creative expression of ethnic image through broad use of various patterns. This paper analyze the use of pattern in Dries Van Noten's designs by season and item, and reflects on the characteristics of pattern use and influence on fashion image. Total of 887 clothing items were collected from Noten's collections on the Internet. Through analysis of frequency and percentage and cross tab of expression techniques, types, patterns of each motif, and classifications of print combinations, it was shown that Noten has applied six aesthetic rules in the use of pattern design. Pattern played the most significant role in his design. It was possible to achieve the balance of ethnic image and modern image with the mix of flower and abstract motives. Overall pattern was mostly used for practical purpose: border patterns and spaced patterns played a vital role in rendering uniqueness. Noten exhibited unity and variation in combining prints. He expressed the beauty of Oriental style by inserting solid color blocks in between patterns and decorations along trim lines.

Defining of Architectural Patterns through Formalization of Architectural Styles (소프트웨어 구조스타일의 정형화를 통한 조립형 구조패턴의 정의)

  • Kung, Sang-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.877-886
    • /
    • 2002
  • The problem of software reuse is dealt in two approaches. One is to build a new software by composing of the built-in components, and the other is to reuse architectural patterns that most of software system is generally composed of. Although the two approaches are important in design of software architecture, we could find outstanding difference in what kind of building blocks they use. The component based software design makes uses of building blocks whose contents are filled in by someone, on the other hand, the architectural pattern based software design is not interested in the contents of building blocks, but in the framework for building blocks including relationship of the building blocks. The paper purposes to find architectural patterns which are commonly found in diverse applications and help software architects reuse them in the software design process. We refine the architectural styles which is the well-known concept for software architecture design, and refine them as architectural components or templates which can be parts of software architecture.

A Case Study of Spatial Allocation of Cut Blocks Using a Timber Harvest Simulator HARVEST (산림수확 시뮬레이터 HARVEST 응용에 의한 벌채지 공간배치 사례연구)

  • Song, Jungeun;Jang, Kwangmin;Han, Hee;Seol, Ara;Chung, Woodam;Chung, Joosang
    • Journal of Korean Society of Forest Science
    • /
    • v.101 no.1
    • /
    • pp.96-103
    • /
    • 2012
  • In this study, we used HARVEST, a timber management strategy assessment tool, to evaluate alternative forest planning strategies on spatial pattern of cutting blocks. We applied the tool to the Gwangreung Experimental Forest (GEF) as a case study. The harvest schedules developed for GEF using a linear programming model was used to assess spatial patterns of cutting blocks under different management constraints. The results show that the allowable maximum harvest size largely affects the number, size, and distribution of cutting blocks. We also found that spatial dispersion methods and adjacency constraints could be used as an effective means to control spatial allocation of cutting blocks in order to meet certain forest ecosystem management goals.

Framework for Building Reusable Design Systems (재사용 가능한 디자인 시스템 구축을 위한 프레임워크)

  • Lee, Young-Ju
    • Journal of Digital Convergence
    • /
    • v.19 no.1
    • /
    • pp.343-348
    • /
    • 2021
  • This study investigated the method of constructing and combining blocks based on the atomic design system in order to propose a framework for rescue of a reusable design system. For that, I first looked at the necessity of a design system and examples of snow white, skeuomorphic design, flat design, and material design. In addition, molecules, atoms, organisms, templates and pages of atomic design using the principles of chemistry as metaphors were defined through literature studies. In order to implement a new framework, an interface inventory was constructed, and among them, font, color, image and control elements were extracted as core visual elements, and guidelines were defined, and molecular elements were classified and composed of atoms based on them. Blocks are constructed in the form of blocks based on the design pattern most used in the content inventory, and the framework is constructed to implement a layout based on a visual grid and design a page through a combination of blocks. The significance of this paper is that the new framework helps team consistency and collaboration by reusing blocks and supports file sharing and updating.

Classification Rule for Optimal Blocking for Nonregular Factorial Designs

  • Park, Dong-Kwon;Kim, Hyoung-Soon;Kang, Hee-Kyoung
    • Communications for Statistical Applications and Methods
    • /
    • v.14 no.3
    • /
    • pp.483-495
    • /
    • 2007
  • In a general fractional factorial design, the n-levels of a factor are coded by the $n^{th}$ roots of the unity. Pistone and Rogantin (2007) gave a full generalization to mixed-level designs of the theory of the polynomial indicator function using this device. This article discusses the optimal blocking scheme for nonregular designs. According to hierarchical principle, the minimum aberration (MA) has been used as an important criterion for selecting blocked regular fractional factorial designs. MA criterion is mainly based on the defining contrast groups, which only exist for regular designs but not for nonregular designs. Recently, Cheng et al. (2004) adapted the generalized (G)-MA criterion discussed by Tang and Deng (1999) in studying $2^p$ optimal blocking scheme for nonregular factorial designs. The approach is based on the method of replacement by assigning $2^p$ blocks the distinct level combinations in the column with different blocks. However, when blocking level is not a power of two, we have no clue yet in any sense. As an example, suppose we experiment during 3 days for 12-run Plackett-Burman design. How can we arrange the 12-runs into the three blocks? To solve the problem, we apply G-MA criterion to nonregular mixed-level blocked scheme via the mixed-level indicator function and give an answer for the question.

Method of 3D Body Surface Segmentation and 2D Pattern Development Using Triangle Simplification and Triangle Patch Arrangement (Triangle Simplification에 의한 3D 인체형상분할과 삼각조합방법에 의한 2D 패턴구성)

  • Jeong, Yeon-Hee;Hong, Kyung-Hi;Kim, See-Jo
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.29 no.9_10 s.146
    • /
    • pp.1359-1368
    • /
    • 2005
  • When we develop the tight-fit 2D pattern from the 3D scan data, segmentation of the 3D scan data into several parts is necessary to make a curved surface into a flat plane. In this study, Garland's method of triangle simplification was adopted to reduce the number of data point without distorting the original shape. The Runge-Kutta method was applied to make triangular patch from the 3D surface in a 2D plane. We also explored the detailed arrangement method of small 2D patches to make a tight-fit pattern for a male body. As results, minimum triangle numbers in the simplification process and efficient arrangement methods of many pieces were suggested for the optimal 2D pattern development. Among four arrangement methods, a block method is faster and easier when dealing with the triangle patches of male's upper body. Anchoring neighboring vertices of blocks to make 2D pattern was observed to be a reasonable arrangement method to get even distribution of stress in a 2D plane.

Adaptive Video Watermarking based on 3D-DCT Using Image Characteristics (영상 특성을 이용한 3D-DCT 기반의 적응적인 비디오 워터마킹)

  • Lee, Sung-Hyun;Park, Hyun;Moon, Young-Shik
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1173-1176
    • /
    • 2005
  • Depending on the characteristics of each 3D-DCT block, images can be classified into three types: images with motion and textures, images with high textures and little motion, images with little textures and little motion. In this paper, we propose an adaptive watermarking method using these characteristics of each 3D-DCT block. and the human visual system. The proposed method classifies patterns of 3D-DCT blocks based on the motion and texture information, and classifies the image type according to the ratio of these patterns. The watermark is inserted proportional to the 3D-DCT coefficients by using pattern adaptive JND, which. makes the proposed watermarking robust by inserting watermarks in as many blocks as possible. Experimental results show that the proposed method achieves better performance in terms of invisibility and robustness than the previous method.

  • PDF

Estimation of the Stability Number of Breakwater Armor Blocks Using Probabilistic Neural Networks (확률신경망을 이용한 방파제 피복재 설계)

  • Kim, Doo-Kie;Kim, Dong-Hyawn;Chang, Seong-Kyu;Chang, Sang-Kil
    • Journal of Ocean Engineering and Technology
    • /
    • v.20 no.5 s.72
    • /
    • pp.70-76
    • /
    • 2006
  • A Probabilistic neural network (PNN) technique for predicting the stability number for the armor blocks of breakwaters is presented. A PNN is prepared using the experimental data of van der Meer and is then compared with the empirical formula and previous artificial neural network (ANN) model. This comparison shows that a PNN can effectively predict the stability numbers in spite of data complexity, incompleteness, and incoherence, and can be an effective tool for the designers of rubble mound breakwaters to support their decision process and to improve design efficiency.

A hierarchical plcement method for building block layout design (빌딩블록의 레이아웃 설계를 위한 계층적 배치 방법)

  • 강병익;이건배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.11
    • /
    • pp.128-139
    • /
    • 1996
  • In this paper, we propose an algorithm to solve the problem of placement of rectangular blocks whose sizes and shpaes are pre-determined. The proposed method solves the placement of many retangular blocks of different sizes and shapes in a hierarchical manner, so as to minimize the chip area. The placement problem is divided into several sub-problems: hierarchical partioning, hierarchical area/shape estimation, hierarchical pattern pacement, overlap removal, and module rotation. After the circuit is recursively partitioned to build a hierarchy tree, the necessary wiring area and module shpaes are estimated using the resutls of the partitioning and the pin information before the placement is performed. The placement templaes are defined to represent the relative positions of the modules. The area and the connectivity are optimized separately at each level of hierachy using the placement templates, so the minimization of chip area and wire length can be achieved in a short execution time. Experiments are made on the MCNC building block benchmark circuits and the results are compared with those of other published methods. The proposed technique is shown to produce good figures in tems of execution time and chip area.

  • PDF