• Journal of the Korea Fashion and Costume Design Association
• /
• v.22 no.4
• /
• pp.93-104
• /
• 2020

This paper focuses on the spatial changes that create a three-dimensional or deep feeling on the surface of a scarf centering on the cube shape. Through this, consumers with various tastes were able to satisfy their image presentation. The cube form has simplicity and order and is likely to be used as a formative object. The cube shapes can be expressed in various forms through visual and perceptual spatial changes by presenting various shape changes based on the viewpoint of the two-dimensional silk surface, that is, by changing the eyes' position and orientation. Various visual theorists' discussions about cube-shaped visual changes were discussed. In addition, the three-dimensional spatial illusion caused by the shape and color of Victor Bazaarelli's cube was examined. The cube shape was printed silk surfaces to give a three-dimensional sense of space on a two-dimensional scarf design using the size change, the difference in the length of the line, and the color change. As such, the cube shape has infinite possibilities as a method that can express three-dimensional depth and space on the flat surface of a scarf. Therefore, it is hoped that this study will be applied to various aspects as the basic data for the scarf design that expresses the spatial changes in the form of cubes.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.353-362
• /
• 2006

A data warehouse is a data repository that enables users to store large volume of data and to analyze it effectively. In this research, we investigate an algorithm to establish a multidimensional data cube which is a powerful analysis tool for the contents of data warehouses and databases. There exists an inevitable retrieval overhead in a multidimensional data cube due to the sparsity of the cube. In this paper, we propose a dense sub-cube extraction algorithm that identifies dense regions from a large sparse data cube and constructs the sub-cubes based on the dense regions found. It reduces the retrieval overhead remarkably by retrieving those small dense sub-cubes instead of scanning a large sparse cube. The algorithm utilizes the bitmap and histogram based techniques to extract dense sub-cubes from the data cube, and its effectiveness is demonstrated via an experiment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3715-3722
• /
• 2011

This paper presents a new Boolean extraction technique for logic synthesis. This method first calculates divisor/2-cube quotients, 2-cube quotient pairs, and 2-cube quotient matrices. Then we find candidates, which can be common sub-expressions, from 2-cube quotients and matrices. Next, candidate intersection provides the common sub-expressions for several logic expressions. Experimental results show the improvements in literal counts over the previous methods.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.205-214
• /
• 2011

We propose a new interconnection network, called Twisted cube torus(TT) network based on well-known 3-dimensional twisted cube. Twisted cube torus network has smaller diameter and improved network cost than honeycomb torus with the same number of nodes. In this paper, we propose routing algorithm of Twisted cube torus network and analyze its diameter, network cost, bisection width and hamiltonian cycle.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.596-605
• /
• 2001

In this paper we propose a method, called the range-based cube partitioning (RCP)method for reducing I/O cost of cube computation in OLAP The method improves I/O performance of cube partitioning process by overlapping some computation between partitioning stages. For overlapping the computation, the method partitions the cube based on the ranges of attribute values, not the points of attribute value, Through analysis any experiments, we show the performance of the proposed method with comparison of the previous cube partitioning method.

• 한국초전도학회:학술대회논문집
• /
• 2008.08a
• /
• pp.50-50
• /
• 2008

• 한국초전도학회:학술대회논문집
• /
• 2008.08a
• /
• pp.55-55
• /
• 2008

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.175-187
• /
• 2006

The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

• Journal of Aerospace System Engineering
• /
• v.8 no.3
• /
• pp.27-33
• /
• 2014

The CubeSat, which was first launched to verify new technologies and for educational purposes, is now widely used as an educational tool since it makes possible development of manpower through practical training to produce the satellite at low development costs. At present, research and development on the CubSat is rapidly expanding in domestic and foreign universities. As one of the final 3 teams selected in the 2013 CUBE SATELLITE CONTEST organized by the Ministry of Science, ICT and Future Planning, Chosun University is also currently conducting R & D of STEP Cube Lab, which is a CubeSat scheduled to be launched in 2015 and whose main task is to verify space-based technologies in orbit. The present paper tries to present an overview of the CubeSat of Chosun University whose development is being led by its undergraduate students, and further, introduce the strengths of the present development program for developing space experts, based on the educational achievements from the R & D.

• Journal of Astronomy and Space Sciences
• /
• v.34 no.2
• /
• pp.127-138
• /
• 2017

The current study designs the mission orbit of the lunar CubeSat spacecraft to measure the lunar local magnetic anomaly. To perform this mission, the CubeSat will impact the lunar surface over the Reiner Gamma swirl on the Moon. Orbit analyses are conducted comprising ${\Delta}V$ and error propagation analysis for the CubeSat mission orbit. First, three possible orbit scenarios are presented in terms of the CubeSat's impacting trajectories. For each scenario, it is important to achieve mission objectives with a minimum ${\Delta}V$ since the CubeSat is limited in size and cost. Therefore, the ${\Delta}V$ needed for the CubeSat to maneuver from the initial orbit toward the impacting trajectory is analyzed for each orbit scenario. In addition, error propagation analysis is performed for each scenario to evaluate how initial errors, such as position error, velocity error, and maneuver error, that occur when the CubeSat is separated from the lunar orbiter, eventually affect the final impact position. As a result, the current study adopts a CubeSat release from the circular orbit at 100 km altitude and an impact slope of $15^{\circ}$, among the possible impacting scenarios. For this scenario, the required ${\Delta}V$ is calculated as the result of the ${\Delta}V$ analysis. It can be used to practically make an estimate of this specific mission's fuel budget. In addition, the current study suggests error constraints for ${\Delta}V$ for the mission.