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

This paper describes the design of asynchronous adders based on carry selection and carry bypass techniques. The designs are faster than existing asynchronous adders which are based on ripple carry technique. It is caused by reducing the carry transfer time by using carry selection and carry bypass techniques. Also, the design uses tree structure to reduce the completion sensing time. The proposed adders are designed with CMOS domino logic and experimented with HSPICE simulator. Experimental results show that the proposed adders can be faster about 50% in average cases than previous ripple carry adders.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.1
• /
• pp.75-84
• /
• 2008

A new automatic small target detection and tracking algorithm for the real-time IR surveillance system is presented. The automatic target detection and tracking algorithm of the real-time systems, requires low complexity and robust tracking performance in the cluttered environment. Linear-array and parallel-scan IR systems usually suffer from severe scan noise caused by the detector non-uniformity. After the spatial filtering and thresholding, this scan noise still remains as high amplitude clutter which degrades the target detection rate and tracking performance. In this paper, we propose a new feature which consists of area and validity information of a measurement. By adopting this feature to the measurements selection and track confirmation, we can increase the target detection rate and reduce both the track loss rate and false track rate. From the experimental results, we can validate the feasibility of the proposed method in the noisy IR images.

• Journal of Construction Engineering and Project Management
• /
• v.6 no.2
• /
• pp.16-23
• /
• 2016

The use of inappropriate procurement methods to deliver construction projects has long been acknowledged as a major source of poor project performance and is particularly problematic for the Libyan Construction Industry. Poor procurement method selection has been recognised as a major contributory factor to frequent time and cost overruns. This paper offers a way of selecting specific procurement methods to maximize successful project performance. The methodology involves an intensive review of relevant literature, followed by a semi-structured questionnaire survey. The key findings of the study reveal that 11 out of its 12 common selection criteria exhibit a significant contribution to one or more project performance criteria (time, cost and quality). Project clients should therefore prioritise these criteria when selecting a design-bid-build method. Knowledge of the criteria that contribute positively to project performance will also enable clients to work out, prior to and during construction, the best measures and provisions for successful project outcomes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.516-520
• /
• 1996

This paper focues on development of a timer selection algorithm for IEEE802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisfy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. Therefore, the object of this paper is to develop timer selection algorithm to minimize a certain penalty function. This paper presents an algorithm based on Genetic Algorithm. The efficacy of the algorithm has been demonstrated by a series of simulation experiments.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.1-13
• /
• 2005

In distributed replicating server model, providing replicated services is able to improve the performance of providing a service and efficiency for several clients. And, the composition of the server selection algorithm is efficiently able to decrease the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides optimal service using server-side downstream measurement and proposes an applicable algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.13-26
• /
• 2000

Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

• Earthquakes and Structures
• /
• v.16 no.1
• /
• pp.29-39
• /
• 2019

A three-step screening process is presented in this article for selection of consistent earthquake records in which number of suitable ground motions is quickly screened and reduced to a handful number. Records that remain at the end of this screening process considerably reduce the dispersion of structural responses. Then, an effective method is presented for spectral matching and modification of the selected records. Dispersion of structural responses is explored using different statistical measures for each scaling procedure. It is shown that the Uniform Design Method, presented in this study for scaling of earthquake records, results in most cases in the least dispersion measure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.4
• /
• pp.159-165
• /
• 2007

In this paper, we propose a new pre-selection of candidate units that is suitable for the unit selection based Japanese TTS system. General pre-selection method performed by calculating a context-dependent cost within IP (Intonation Phrase). Different from other languages, however. Japanese has an accent represented as the height of a relative pitch, and several words form a single accentual phrase. Also. the prosody in Japanese changes in accentual phrase units. By reflecting such prosodic change in pre-selection. the qualify of synthesized speech can be improved. Furthermore, by calculating a context-dependent cost within accentual phrase, synthesis speed can be improved than calculating within intonation phrase. The proposed method defines AP. analyzes AP in context and performs pre-selection using accentual phrase matching which calculates CCL (connected context length) of the Phoneme's candidates that should be synthesized in each accentual phrase. The baseline system used in the proposed method is VoiceText, which is a synthesizer of Voiceware. Evaluations were made on perceptual error (intonation error, concatenation mismatch error) and synthesis time. Experimental result showed that the proposed method improved the qualify of synthesized speech. as well as shortened the synthesis time.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.