• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.33-44
• /
• 1996

This study deals with the development of wire path searching module as a part of automobile wire harness design system. Wire path searching module manages the free space, finds transition locations, and creates bundle paths to dramatically reduce a tedious iterative routing process which results in easy optimization of the bundle paths. A prime policy in the system configuration is to compromise between man's and computer's ability, and make it possible a designer's leading role in designing process. Human input is indispensable to cope with the special cases which were not considered in the initial design stage of the system. In this study, we improve the previous shortest-path-finding algorithm, (VGraph and RCA method) into a new method called Extended RCA. Bundles, connectors and transitions are handled as objects so one can manage and modify physical properties of the objects easily. Therefore a verification is allowed at any desired stage of design. The reuse of previous result is facilitated by using Dependency Structure, which represents the mutual relations among connectors, transitions, and bundles. Dependency Structure makes it possible the elimination of redundant calculating process, and consequently shorter routing time.

• 대한전기학회논문지
• /
• 제37권7호
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.30-33
• /
• 2001

The number of hidden neurons of the feed-forward neural networks is generally decided on the basis of experience. The method usually results in the lack or redundancy of hidden neurons, and causes the shortage of capacity for storing information of learning overmuch. This research proposes a new method for optimizing the number of hidden neurons bases on information entropy, Firstly, an initial neural network with enough hidden neurons should be trained by a set of training samples. Second, the activation values of hidden neurons should be calculated by inputting the training samples that can be identified correctly by the trained neural network. Third, all kinds of partitions should be tried and its information gain should be calculated, and then a decision-tree correctly dividing the whole sample space can be constructed. Finally, the important and related hidden neurons that are included in the tree can be found by searching the whole tree, and other redundant hidden neurons can be deleted. Thus, the number of hidden neurons can be decided. In the case of building a neural network with the best number of hidden units for tea quality evaluation, the proposed method is applied. And the result shows that the method is effective

• 대한전자공학회논문지
• /
• 제26권2호
• /
• pp.124-131
• /
• 1989

본 논문은 각 서브시스템에 여러 종류의 고장모드를 갖는 시스템 신뢰성 최적화 문제를 본 논문에서 제안한 알고리듬으로 처리된 것을 나타내었다. 이 알고리듬은 시스템 신뢰성 최적화의 비선형 문제를 0-1정수계획 문제로 변환할 때 반드시 제약조건에 부가되는 GUB구조(generalized upper bounding structure)를 고려하여 개발되었으며 시스템 신뢰도 개선을 위한 용장 서브시스템 최적배분 문제를 제안한 알고리듬에 따라 계산할 결과 계산반복회수(컴퓨터 계산시간)과 사용된 변수(요구 메모리 용량) 등에서 종래의 알고리듬 보다 우수함을 알 수 있다.

• 전기학회논문지
• /
• 제64권8호
• /
• pp.1231-1239
• /
• 2015

We developed a robot that has four limbs, each of which has the same kinematic structure and has 6 degrees of freedom. The robot is 600mm high and weighs 4.3kg. The robot can perform walking and manipulating task by using the four limbs selectively. The robot has three walking patterns. The first one is biped walking, which uses two rear limbs as legs and two front limbs as arms. The second one is biped walking with supporting arms, which is basically biped walking but uses two arms as supporting legs for increasing stability of the robot. The last one is quadruped walking, which uses all the four limbs as legs. When a task for the robot is given, the robot approaches the task point by selecting an appropriate walking pattern among three walking patterns and performs the task. The robot has many degrees of freedom and is a redundant system for a three dimensional task. We propose a redundancy resolution method, in which the robot’s translational move to the task point is modeled as a prismatic joint and optimal solutions are obtained by optimizing some performance criteria. Several simulations are performed for the validity of the proposed method.

• 대한안전경영과학회지
• /
• 제13권3호
• /
• pp.45-53
• /
• 2011

The research proposes seven elimination rules of redundant gates and blocks in Fault Tree Analysis (FTA) and Reliability Block Diagram (RBD). The computational complexity of cut sets and path sets is NP-hard. In order to reduce the complexity of Minimal Cut Set (MCS) and Minimal Path Set (MPS), the paper classifies generation algorithms. Moreover, the study develops six implementation steps which reflect structural importance (SI) and reliability importance (RI) from Reliability Centered Maintenance (RCM) that a priority of using the functional logic among components is to reduce (improve) the system unavailability (or availability). The proposed steps include efficient generation of state structure function by Rare Event Enumeration (REA). Effective use of importance measures, such as SI and ill measures, is presented based on the number and the size of MCS and MPS which is generated from the reference[5] of this paper. In addition, numerical examples are presented for practitioners to obtain the comprehensive understanding of six steps that is proposed in this research.

• 시스템엔지니어링학술지
• /
• 제18권2호
• /
• pp.1-10
• /
• 2022

In general, similar or previous projects are mainly referred to in order to derive operational test and evaluation(OT&E) items after acquiring weapon system. The idea that a more systematic method is needed is spreading because some of OT&E items derived in this process are redundant or unnecessary. Therefore, in this topic, we plan to use WBS, a tool that classifies components into a hierarchical structure and manages development easily to achieve the weapon system development goal. In addition, the WBS tool is applied to the medium-sized standard vehicle project, which is currently being research and developed, to effectively derive OT&E items. As a result of deriving OT&E items by applying WBS to the vehicle development field and electric devices of the medium-sized standard vehicle project, the operability and relationship were judged early, and then contents of the evaluation items could be written substantially while working on environmental adaptability. In the future, it is judged that the efficiency will be increased if the method discussed in this paper is applied when deriving the OT&E items from the R&D development project.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.332-335
• /
• 2008

In this paper, based on H-tree, which is proposed as the basic data cube structure for multi-dimensional data stream analysis, we have done some analysis. We find there are a lot of redundant nodes in H-tree, and the tree-build method can be improved for saving not only memory, but also time used for inserting tuples. Also, to facilitate more fast and large amount of data stream analysis, which is very important for stream research, H^*-tree is designed and developed. Our performance study compare the proposed H^*-tree and H-tree, identify that H^*-tree can save more memory and time during inserting data stream tuples.

• 정보관리학회지
• /
• 제9권2호
• /
• pp.20-42
• /
• 1992

KORMARC 형식은 협동 목록으로서의 처리 능력, 국가 서지 기술 형식으로서의 포 괄성 및 간결성 그리고 국제 교환용으로서의 호환성 및 확장성을 가져야만 한다. 따라서 기 술 규칙에 충실하고, 전산 처리에 편리하고 亢長性이 없으며, 국제 표준을 준용하고 있어야 할 것이다. 본 연구는 국립중앙도서관이 1984년에 발표한 KORMARC 단행본용 형식을 이 와 같은 관점에서 검토하고 개정한 것이다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권1호
• /
• pp.51-58
• /
• 2015

This paper proposes a 10-b SAR ADC. To increase the conversion speed and reduce the power consumption and area, redundant cycles were implemented digitally in a capacitor DAC. The capacitor DAC algorithm was straightforward switching, which included digital error correction steps. A prototype ADC was implemented in CMOS $0.18-{\mu}m$ technology. This structure consumed $140{\mu}W$ and achieved 59.4-dB SNDR at 1.25MS/s under a 1.8-V supply. The figure of merit (FOM) was 140fJ/conversion-step.