• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.39-48
• /
• 1999

An economic procedure of selective assembly is proposed when a product is composed of two mating components. The major qualify characteristic of the product is the clearance between the two components. The components are divided into several classes prior to assembly. The component characteristics are assumed to be independently and normally distributed with equal variance. The procedure is designed so that the proportions of both components in their corresponding classes are the same. A cost model is developed based on a quadratic loss function and methods of obtaining the optimal class limits as well as the optimal number of classes are provided. Formulas for obtaining the proportion of rejection and the unavailability of mating components are also provided. The proposed model is compared with the equal width and the equal area partitioning methods using a numerical example.

• Journal of Korean Society for Quality Management
• /
• v.45 no.1
• /
• pp.65-92
• /
• 2017

Purpose: The performance of global major airports is evaluated and several research questions are examined relative to the measures characterizing airport performance. Methods: The two-stage internal structure of airport performance is considered by decomposing it into physical operations and revenue generation. In the physical operations stage, operating costs, number of runways, terminal area and number of employees are used as inputs, while passenger throughput, cargo throughput and aircraft movements are taken as outputs. Subsequently, in the revenue generation stage, the outputs from the preceding stage are taken as inputs, while revenue is used as output. Results: Based upon this two-stage modeling of airport performance, a multiplicative two-stage network data envelopment analysis model is employed to calculate the overall and stage efficiencies of 59 airports using the recent data in the 2014 Airport Benchmarking Report published by the Air Transport Research Society. Several internal and external factors are also considered such as airport size, airport geographical location, proportion of international passengers, ownership (listed or not) and management style, and statistical analysis is performed to examine their impacts on airport performance. Conclusion: It is shown that the airports exhibit statistically significant difference across regions, and also some statistically significant factors affecting airport performance are identified.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.388-394
• /
• 2007

In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.10
• /
• pp.73-80
• /
• 1995

In this paper, a synthesis tool using matrix operations for designing multi-level Reed Muller circuits is described which has been named as MRM (Multi-level Reed Muller Minimizer). The synthesis method which uses matrix operations has advantages in effectively minimizing chip area, delay optimization and fault detection capability. However, it uses only truth-table type maps for inputs, synthesizing only small circuits. To overcome the weakness, our method accepts two-level description of a logic function. Since the number of cubes in the two-level description is small, the input matrix becomes small and large circuits can be synthesized. To convert two-level representations into multi-level ones, different input patterns are extracted to make a map which can be fed to the matrix operation procedure. Experimental results show better performance than previous methods. The matrix operation method presented in this paper is new to the society of Reed Muller circuits synthesis and provides solid mathematical foundations.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.816-827
• /
• 2008

In this paper, two-stage pipelined floating-point arithmetic unit (FP-AU) is designed. The FP-AU processor supports seventeen operations to apply 3D graphics processor and has area-efficient and low-latency architecture that makes use of modified dual-path computation scheme, new normalization circuit, and modified compound adder based on flagged prefix adder. The FP-AU has about 4-ns delay time at logic synthesis condition using $0.18{\mu}m$ CMOS standard cell library and consists of about 5,930 gates. Because it has 250 MFLOPS execution rate and supports saturated arithmetic including a number of graphics-oriented operations, it is applicable to mobile 3D graphics accelerator efficiently.

• Journal of Fisheries and Marine Sciences Education
• /
• v.22 no.3
• /
• pp.354-361
• /
• 2010

Author investigated the distribution of debris by a bottom trawler in the eight sea stations over the sea between Busan and Jeju island. 2,118 debris in number and 2,401.5kg in weight were collected. Most of collected debris were fishing gears which seemed to be lost or discarded during operations, and also most of the fishing gears was an eel pot. The densities of debris per hectare in number and weight were 1.21pieces and 2.639kg respectively. Station A was the highest densities compared to other stations, showing 2.7pisces and 4.9kg per hectare in number and weight. The closer to Busan it is, the higher density of debris can be collected.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.97-107
• /
• 1977

This report examines several models, such as random or area bombardment, salvo fire and pattern fire, for the computation of target coverage when multiple rounds are fired at a target. Fractional kill of a fragment sensitive target by a fragmenting projectile as a function of the number of rounds fired is compared for two salvo fire models. The first is a standard salvo fire model in which N rounds are fired at the same aim point, in the second model single kill probability is computed for a fragment sensitive target and then fractional kill from the firing of N rounds is computed according to the assumption that the effects of each round are independent. Because the method of solution becomes very laborious for large patterns, this report gives a method only for the case of evaluating the effectiveness of stick and trianglar pattern fire. The need for the sophisticated and complicated target coverage models is demonstrated by the results of computations performed in this report.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.697-705
• /
• 2013

Emerging trends in the area of digital very large scale integration (VLSI) signal processing can lead to a reduction in the cost of the cochlear implant. Digital signal processing algorithms are repetitively used in speech processors for filtering and encoding operations. The critical paths in these algorithms limit the performance of the speech processors. These algorithms must be transformed to accommodate processors designed to be high speed and have less area and low power. This can be realized by basing the design of the auditory filter banks for the processors on digital VLSI signal processing concepts. By applying a folding algorithm to the second-order digital gammatone filter (GTF), the number of multipliers is reduced from five to one and the number of adders is reduced from three to one, without changing the characteristics of the filter. Folded second-order filter sections are cascaded with three similar structures to realize the eighth-order digital GTF whose response is a close match to the human cochlea response. The silicon area is reduced from twenty to four multipliers and from twelve to four adders by using the folding architecture.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.267-276
• /
• 2007

In OSPF, the larger and more unstable the area, the greater the likelihood for performance problems associated with routing protocol recalculation. Generally, an area should have no more than 50 routers. Areas with unstable links should be smaller. Military tactical data network is used for military operations during war-time. It consists of wireless network for mobility of node. Thus, it has low-bandwidth and unstable property. In addition, it is expected that many kinds of router-failure, Link-failure and recovery at emergency period. However, Military tactical data network is designed with about one and half times the number of recommendation. This paper proves that the traffic is limited by the increase of re-calculation of area.