• 기술혁신학회지
• /
• 제2권2호
• /
• pp.249-265
• /
• 1999

This study examines the efficiency of engineering education using DEA(data envelopment analysis) which is often used in the efficiency evaluation of public services. We evaluate 27 mechanical engineering departments according to academy-basis, general basis, and employment-basis considering students' academic level and input costs as input factors. Our empirical results suggest that an evaluation method using DEA can give us useful informations such as benchmarks to improve education specialization where it is desirable, decisions about whether a department should expand its gross input or not, and proper directions about which input factors should be controlled and how much control is needed.

• 한국산학기술학회논문지
• /
• 제16권3호
• /
• pp.1626-1629
• /
• 2015

본 논문에서는 미래전 양상을 통해서 전력증강사업의 발전방향을 제시한다. 이는 국방획득체계의 변화상황과 국내외 체계분석, 전력증강사업의 현황 및 문제점을 통해서 가능하리라 판단하며, 향후 무인지상로봇, 무인기, 무인함정의 발전방향에 대한 연구에서 다양한 방향으로 응용연구가 가능할 것이라 판단된다. 한국의 무인체계의 발전방향을 제시함에 있어 벤치마킹의 효과가 있을 것을 사료된다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.609-612
• /
• 2000

Job-shop scheduling problem(JSSP) is one of the best-known machine scheduling problems and essentially an ordering problem. A new encoding scheme which always give a feasible schedule is presented, by which a schedule directly corresponds to an assigned-operation ordering string. It is initialized with G&T algorithm and improved using the developed genetic operator; APMX or BPMX crossover operator and mutation operator. and the problem of infeasibility in genetic generation is naturally overcome. Within the framework of the newly designed genetic algorithm, the NP-hard classical job-shop scheduling problem can be efficiently solved with high quality. Moreover the optimal solutions of the famous benchmarks, the Fisher and Thompson's 10${\times}$10 and 20${\times}$5 problems, are found.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2402-2406
• /
• 2005

A collision query determines the intersection between given objects, and is used in computer-aided design and manufacturing, animation and simulation systems, and physically-based modeling. Bounding volume hierarchies are one of the simplest and most widely used data structures for performing collision detection on complex models. In this paper, we present hierarchy of oriented rounded bounding volume for fast proximity queries. Designing hierarchies of new bounding volumes, we use to combine multiple bounding volume types in a single hierarchy. The new bounding volume corresponds to geometric shape composed of a core primitive shape grown outward by some offset such as the Minkowski sum of rectangular box and a sphere shape. In the experiment of parallel close proximity, a number of benchmarks to measure the performance of the new bounding box and compare to that of other bounding volumes.

• 전자공학회논문지A
• /
• 제32A권10호
• /
• pp.81-92
• /
• 1995

In this paper, we present a high-level synthesis system that generates area-efficient RT-level datapaths with multiport memories. The proposed scheduling algorithm assigns an operation to a specific control step such that maximal sharing of functional units can be achieved with minimal number of memory ports, while satisfying given constraints. We propose a measure of multiport memory cost, MAV (Multiple Access Variable) which is defined as a variable accessed at several control steps , and overall memory cost is reduced by equally distributing the MAVs throughout all the control steps. Experimental results show the effectiveness of the proposed algorithm. When compared with previous approaches for several benchmarks available from literature, the proposed algorithm generates the datapaths with less memory modules and interconnection structures by reflecting the memory cost in the scheduling process.

• 한국지구과학회지
• /
• 제23권2호
• /
• pp.140-146
• /
• 2002

We have studied 73 pre-service science teachers' conceptions about the nature of science (NOS) using 120 true-false test items based on AAAS Benchmarks statements. We have found that participants have inadequate understanding of the NOS, especially in understanding of five categories of conceptions; change and continuity in science, bias in scientific investigations, hypothesis in scientific investigations, things common in science, and science ethics. The result also indicates that there is a difference between primary pre-service teachers and secondary pre-service teachers. From the analysis of consistency, we also found that this inadequate understanding comes from confusion rather than misconception. All the results support that there is a need of intense pre-service teacher education concerning thenature of science.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1221-1229
• /
• 1996

This paper proposes a heuristic algorithm for low power implementation of combinational circuits. Selecting an input variable for a given function, the proposed algorithm performs Shannon exansion with respect to the variable to reduce the number of gates in the subcircuit realizing the coffactor function, reducting the power dissipation of the implemented circuit. experimental results for the MCNC benchmarks show that the proposed algorithm is effective by generating the circuits consuming the power 48.9% less on the average, when compared to the previous algorithm based on precomputation logic.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.155-157
• /
• 2005

We propose a new category of hybrid multi-layer neural networks with hetero nodes such as Fuzzy Set based Polynomial Neurons (FSPNs) and Polynomial Neurons (PNs). These networks are based on a genetically optimized multi-layer perceptron. We develop a comprehensive design methodology involving mechanisms of genetic optimization and genetic algorithms, in particular. The augmented genetically optimized HFPNN (namely gHFPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional HFPNN. The GA-based design procedure being applied at each layer of HFPNN leads to the selection of preferred nodes (FPNs or PNs) available within the HFPNN. In the sequel, two general optimization mechanisms are explored. First, the structural optimization is realized via GAs whereas the ensuing detailed parametric optimization is carried out in the setting of a standard least square method-based learning. The performance of the gHFPNNs quantified through experimentation where we use a number of modeling benchmarks-synthetic and experimental data already experimented with in fuzzy or neurofuzzy modeling.

• 전자공학회논문지A
• /
• 제28A권10호
• /
• pp.847-854
• /
• 1991

This paper presents a new output phase assignment algorithm which determines the phases of all the nodes in a given boolean network. An estimation function is defined, which is represented by the relation between the literals in the given function expression. A weight function, WT (fi, fj) is defined, which is represented by approximate amount of common subexpression between function fi and fj. Common Subexpression Graph(CSG) is generated for phase selection by the weight function between all given functions. We propose a heuristic algorithm finding subgraph of which sum of weights has maximum by assigning phases into the given functions. The experiments with MCNC benchmarks show the efficiency of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.1009-1012
• /
• 1999

An analytical performance model that can predict the performance of a superscalar processor employing multiple branch prediction is introduced. The model is based on the conditional independence probability and the basic block size of instructions, with the degree of multiple branch prediction, the fetch rate, and the window size of a superscalar architecture. Trace driven simulation is performed for the subset of SPEC integer benchmarks, and the measured IPCs are compared with the results derived from the model. As the result, our analytic model could predict the performance of the superscalar processor using multiple branch prediction within 6.6 percent on the average.