• Proceedings of the Technology Innovation Conference
• /
• 2009.02a
• /
• pp.583-604
• /
• 2009

최근 제조 기업들의 가장 큰 화두 중 하나는 제품과 서비스의 통합이다. 그간 제품과 서비스 통합과 관련한 다양한 개념들이 제시되어 왔으나, 정의 및 유형에 대한 보편적인 프레임워크가 존재하지 않는다. 본 연구에서는 제품과 서비스의 통합에 관련된 다양한 개념들을 아우르는 포괄적인 용어 (umbrella term)로써 통합 제품-서비스(integrated product-service: IPS)를 제시한다. 기존 문헌 연구를 통해 IPS 관련 기존 개념들을 개괄하고, 이들을 Product/service fusion과 Product/service Convergence의 두 가지로 분류한다. 다음으로 IPS를 유형화하기 위한 분류체계(typology)로써 IPS 큐브(cube)를 제시한다. IPS 큐브는 통합의 형태(pattern), 원천(origin), 기술(technology)의 세 가지 차원으로 구성되며, 각 차원이 모두 세 가지 유형으로 구분되기 때문에, IPS 큐브는 27개의 셀로 이루어진 정육면체 형태를 띤다. 각 셀은 고유한 IPS 유형을 나타내며, 각 셀에 해당하는 실제 IPS 사례들이 제시된다. 본 연구에서 제시한 IPS 큐브는 유형별 IPS 개발을 위한 전략, 프로세스, 방법론을 개발하는데 있어서 유용한 시사점을 제공해줄 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.188-191
• /
• 2003

In this paper, we proposed data generalization and data cube mechanism for efficient data mining in distribute environment. We also proposed active Self Organization Map applying traditional Self Organization Map of Neural network for searching the most Informative data created from data cube after the generalization procedure and designed the system architecture for that.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.499-501
• /
• 2000

음함수 곡면 모델의 대표적인 구조 요소인 메타볼은 다양한 형태의 곡면을 모델링하는데 뛰어난 성능을 갖는다[1]. 그러나 복잡한 형태의 물체는 곡면 뿐 아니라 평면적인 요소를 포함하기 때문에 메타볼만으로 부정형 물체를 모델링하는 데에는 많은 어려움이 따른다. 메타큐브는 메타볼의 장점을 수용하면서 적은 수의 데이터로 평면 형태의 물체가지 모델링할 수 있는 메타볼의 확장 형태로서, 두 개의 매개변수만으로 구에서 정육면체까지 자유로운 확장이 가능하다[2]. 본 논문은 메타큐브를 이용하여 볼륨 데이터로부터 3차원 물체를 자동 모델링하는 방법을 제안한다. 제안 방법은 볼륨 데이터의 형태에 기반하여 분할된 볼륨 트리를 이용하여 비교적 빠른 시간에 볼륨 데이터로부터 비슷한 형태의 3차원 물체를 재구성하는 메타큐브 집합을 추출한다. 다양한 볼륨데이타에 대한 실험 결과를 제시함으로써 제안 방법의 효용성을 증명한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.577-580
• /
• 2008

본 논문은 차원이 증가함에 따라 분지수가 증가하는 하이퍼큐브 연결망을 분지수가 고정인 피터슨-토러스(PT) 네트워크에 임베딩 가능함을 보였다. 하이퍼큐브 $Q_{log_2n^2+3}$을 PT(n,n)에 확장율 10/8, 연장율 1.5n+2 그리고 밀집율 4n에 임베딩 하였다. 확장율은 1에 근접하도록 사상알고리즘이 설계되었고, 밀집율과 연장율은 분지수가 증가하는 하이퍼큐브의 특성 때문에 O(n)에 비례한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.378-381
• /
• 2008

최근 정형 검증 분야에서 만족가능성 처리기를 사용한 연구가 많아지면서 이를 적용한 사례들이 많이 나타나고 있다. 만족가능성 처리기를 사용하기 위해서는 검증 되어야 할 시스템을 CNF식으로 변환해야 한다. 우리는 루빅 큐브를 만족가능성 처리기를 통해 풀어보기 위해 이를 CNF식으로 변환해 보았다. 루빅 큐브는 정육면체로 이루어진 퍼즐의 일종으로 모든 면이 각각 한가지 색으로만 채워져야 하는 문제이다. 우리는 본 논문에서 만족가능성 처리기를 사용한 사례 중에 아직 적용한적이 없는 루빅 큐브를 CNF식으로 변환해 풀었음을 보여준다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

• Research in Plant Disease
• /
• v.21 no.4
• /
• pp.321-325
• /
• 2015

A rapid and simple RT-PCR diagnosis method for detection of Rice stripe virus (RSV), one of major virus infecting rice, was developed using porous ceramic cubes in this study. The porous ceramic cube can rapidly absorb biological molecules such as small-sized proteins and nucleic acid fragments into its pores. We examined whether this ability of porous ceramic cubes could be applied for isolating viral nucleic acids or particles from the RSV- infected plant tissues. In this study, we found that the porous ceramic cube was capable of absorbing a detection level of viruses from the rice tissues infected with RSV and established RT-PCR-based RNA diagnosis method using porous ceramic cubes.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.5
• /
• pp.413-421
• /
• 2015

Since the first Cubesat was launched in 2003, there have been more than 230 Cubesats launched so far. Due to their small size and lightweight, Cubesats were launched by utilizing the empty space of regular launch vehicle. However, this launch method has a weakness that has been easily affecting by the schedule of major payloads. As a new solution to this problem, it has been proposed that a robot arm installed on ISS would be used to launch Cubesats. The orbits of Cubesat deployed from the ISS in various angles and directions are analyzed in this paper. We also analyze the possibility of collision between the Cubesat and ISS within the operational orbit of the CubeSat and eventually calculate the optimal angle of a robot arm, which maximizes the lifetime of Cubesat and minimizes the risk of collision between the Cubesat and ISS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.210-216
• /
• 2009

Several empty-space leaping methods have been proposed for CPU-based volume ray casting. When sample points are located in semi-transparent cells, however, previous leaping methods perform unnecessary resamplings even if the scalar values on those points are confined within transparent range. A semi-transparent cells leaping method for volume ray casting using the Marching Cubes algorithm is proposed to solve this problem in our previous work. When a ray reaches a semi-transparent cell, our method performs in-out test between current sample point and the bounding box enclosing the triangles generated by the Marching Cubes. If the sample point lies on outside of the bounding box, we estimate the point is regarded as transparent. In this case, the ray advances to the next sample point without performing a resampling operation. We can frequently refer the tables for neighboring voxels, however, when we exploit conventional data structures of the Marching Cubes. We propose modified Marching Cubes tables for solving this problem.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.