• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1165-1168
• /
• 1995

This paper describes the evaluation of a robot based filament winding cell consisting of an industrial robot (ASEA IRB 6/2) and an in-house fabricated mandrel drive mechanism, both being coordinated by a personal computer. As in many manufacturing processes, tradeoffs exist between accuracy and speed. The accuracy versus speed relationships of the robotic winding cell were experimentally determined for discrete, fine and medium movement modes while traversing a segmented delivery eye path for a cylindrical mandrel in three configurations (in-line, offset and angled with respect to the axis of rotation). the results show that the robot winding cell is appropriate for very accurate winding of fibre strands if the mandrel axis is concentric with the mandrel drive axis and the discrete mode(i.e. low speed) of the robot is used.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.172-178
• /
• 1996

Databases are critical to business information systems, and RDBMS is most widely usded for the database system. Normalization has been designed to control various anomalies(insert, update, and delete anomalies). However, normalized databese design does not account for the tradeoffs necessary for the performance. In this research, we develop a model for database desin by denormalization of duplicating attributes in order to reduce frequent join processes. In this model, we consider insert, update, and delete costs. The anomalies are treated by additional disk I/O which is necessary for each insert and update transaction. We propose a branch and bound method for this model, and show considerable cost reduction.

• Speech Sciences
• /
• v.10 no.2
• /
• pp.65-75
• /
• 2003

This paper describes the issues associated with the real-time implementation of G.723.1A dual-rate speech coder on a TMS320VC5402 DSP. Firstly, the main features of the G.723.1A speech coder and the procedure involved in the implementation using assembly and C languages are discussed. Various real-time implementation issues such as memory/MIPS tradeoffs are also presented. For fixed-point implementation, we converted the ITU-T fixed-point ANSI C code into TMS320VC5402 code in the bit-exact way through verification using the test vectors. Finally, as the result of implementation, we present the MIPS and memory requirement for the real-time operation.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.247-254
• /
• 1998

This paper presents a performance study of two LU decomposition algorithms on two massively parallel SIMD machines: the 16K processor MasPar MP-1 and the 4K processor MasPar MP-2. The paper presents experimental results and an analysis of the algorithms to explain the results. While the blocked and the nonblocked algorithms for LU decomposition have been studied individually by others, we compare the two algorithms and identify the tradeoffs between them. Our analysis of the blocked algorithm shows how the block size affects the interprocessor communication cost and the memory read/write overhead. The analysis in this paper is useful to determine an optimum block size for the blocked algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.251-261
• /
• 1996

Databases are critical to business information systems and RDBMS is most widely used for the database system. Normalization was designed to control various anomalies(insert, update, and delete anomalies). However normalized database design does not account for the tradeoffs necessary for the performance reason. In this research, we model a database design problem without storage constraint. Given a normalized database design, in this model, we do the denormalization of duplicating columns in order in reduce frequent join processes. In this paper, we consider insert, update, delete, and storage cost, and the anomalies are treated by additional disk I/O cost necessary for each insert, update transaction. We propose a branch and bound method, and show considerable cost reduction.

• The Journal of Information Technology and Database
• /
• v.3 no.1
• /
• pp.3-24
• /
• 1996

Databases are critical to business information systems, and RDBMS is most widely used for the database system. Normalization has been designed to control various anomalies(insert, update, and delete anomalies). However, normalized database design does not account for the tradeoffs necessary for the performance. In this research, we develop a model for database design by denormalization of duplicating attributes in order to reduce frequent join processes. In this mood, we consider insert, update, delete, and query costs. The anomaly and data inconsistency are removed by additional disk I/O which is necessary for each update and insert transaction. We propose a branch and bound method for this model, and show considerable cost reduction.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1439-1446
• /
• 2016

The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.560-574
• /
• 2010

In this paper, the relationship between the energy efficiency and spectrum efficiency in a two-cell cellular network is obtained, and the impact of multi-antenna on the energy efficiency of cellular network is analyzed and modeled based on two-state Markovian wireless channels. Then, the energy efficiency of multi-cell cellular networks with co-channel interference is investigated. Simulation results verify the proposed model and the energy-spectrum efficiency tradeoffs in cellular networks with multi-antenna and co-channel interference.

• Journal of Korean Society for Quality Management
• /
• v.33 no.1
• /
• pp.64-72
• /
• 2005

The ever increasing demand for enhanced competitiveness of engineered products requires "designing-in-quality" strategies that can effectively and efficiently incorporate concepts of uncertainty and quality into design. Multi-attribute utility function is commonly used to represent the decision-maker's preference on multiple design attributes under conditions of uncertainty and risk. One of the major issues in implementing this approach concerns the generation of appropriate utility function, especially in a complex engineering design environment. Typically, the decision maker's preference is revealed through lottery questions rather than being structured on the deductive reasoning to reflect the nonlinear tradeoffs among the attributes. The use of such intuitive procedures can lead to inexact preference information that may result in inaccuracy and rank reversal problems. This paper presents an alternative procedure based on the pair-wise comparisons between design alternatives towards a consistent preference presentation in assessing multiplicative utility function. The effectiveness of the overall procedures is tested with the aid of an injection-molding process design for a capacitor can and the results are discussed.