• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.189-200
• /
• 2001

This paper proposes a memory allocation model for Real-Time Linux. The proposed model allows users to create several continuous memory regions in an application, to specify an appropriate region allocation policy for each memory region, and to request memory blocks from a necessary memory region. Instead of using single memory management module in order to support the proposed model, we adopt two-layered structure that is consisted of region allocators implementing allocation policies and a region manager controlling regions and region allocator modules. This structure separates allocation policy from allocation mechanism, thus allows system developers to implement same allocation policy using different algorithms in case of need. IN addition, it enables them to implement new allocation policy using different algorithms in case of need. In addition, it enables them to implement new allocation policy easily as long as they preserver predefined internal interfaces, to add the implemented policy into the system, and to remove unnecessary allocation policies from the system, Because the proposed model provides various allocation policies implemented previously, system builders can also reconfigure the system by just selecting most appropriate policies for a specific application without implementing these policies from scratch.

• Journal of electromagnetic engineering and science
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2009

In recent years, OFDMA(orthogonal frequency division multiple access) and SC-FDMA(Single Carrier Frequency Division Multiple Access) have been widely studied for the uplink of a mobile communication system. In this paper, PAPR(Peak-to-Average Power Ratio) and BER(Bit Error Rate) performance of the OFDMA and SC-FDMA systems are studied in relation to the uplink of a mobile communication system. Three kinds of sub-carrier allocation methods in the OFDMA system and 2 kinds of sub-carrier allocation methods in SC-FDMA system are suggested to compare and improve system performance. Simulation results show that in the OFDMA system, the first sub-band allocation method has better PAPR reduction performance than the other methods. In the SC-FDMA system, the distributed allocation method offers similar P APR, compared with the sub-band allocation method. P APR can be further reduced by adding a spectrum shaping filter with an appropriate roll of factor. Furthermore, it is found that on average, SC-FDMA can reduce the PAPR by more than 5 dB compared to OFDMA, when the total sub-carrier number is 1,024 and the sub-carrier number allocated to each user changes trom 8 to 512. Because of the frequency diversity and low PAPR characteristics, SC-FDMA system of the distributed sub-carrier allocation method can achieve better BER performance than the OFDMA system.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.6
• /
• pp.350-356
• /
• 2013

Single Carrier Frequency Domain Multiple Access (SC-FDMA) has proven to be the best long term evolution for uplink multiple access because of its low Peak to Average Power Ratio (PAPR), a feature that leads to low power consumption. This is achievable only if the resource allocation is performed in a contiguous manner. This paper proposes a new approach with an improvement in the global resources allocation. The new approach presented utilizes the gain function, which adopts some of the procedures deduced from the older Recursive Maximum Expansion (RME) algorithm. The experiment proved that the new approach is better than the original RME algorithms and in most cases, is closer to the optimal solution.

• Journal of electromagnetic engineering and science
• /
• v.10 no.2
• /
• pp.50-55
• /
• 2010

Orthogonal Frequency Division Multiplexing(OFDM) dual-hop systems can take full advantages of the techniques of both multi-hop communication and OFDM. To achievethis end, we propose a joint subcarrier matching, power allocation and bit loading algorithm operating under a total power constraint and the same Bit Error Rate(BER) threshold over all subcarriers. Simulation results demonstrated system throughput improvement compared to single-hop systems and dual-hop systems with different bit loading algorithms for each relay position, power constraint, and required BER.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

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

Manufacturing environment is getting characterized by unstable market demand,short product life cycle and timebased competition. For adapting this environment,machine tools have to be further versatile functionally in order to reduce part's set-up time. Unlike existing manufacturing systems mainly to focus on part flow, it is important to control tool flow using fast tool change device and tool delivery device in parallel machines consisting of versatile machine tools, because complete operations on a part can be performed on one machine tool in a single machine set-up. In this paper, under dynamic tool allocation strategy to share tools among machine tools, we propose a real-time tool allocation and operation esequence model with an objective of minimizing flow time using autonomy and negotiation of agents in parallel machines

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.47-65
• /
• 2010

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

• ETRI Journal
• /
• v.38 no.3
• /
• pp.487-493
• /
• 2016

Two new methods are proposed for an unsupervised adaptation of a language model (LM) with a single sentence for automatic transcription tasks. At the training phase, training documents are clustered by a method known as Latent Dirichlet allocation (LDA), and then a domain-specific LM is trained for each cluster. At the test phase, an adapted LM is presented as a linear mixture of the now trained domain-specific LMs. Unlike previous adaptation methods, the proposed methods fully utilize a trained LDA model for the estimation of weight values, which are then to be assigned to the now trained domain-specific LMs; therefore, the clustering and weight-estimation algorithms of the trained LDA model are reliable. For the continuous speech recognition benchmark tests, the proposed methods outperform other unsupervised LM adaptation methods based on latent semantic analysis, non-negative matrix factorization, and LDA with n-gram counting.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.372-375
• /
• 1999

This paper proposes a bit allocation algorithm using adaptive bandwidth for ADSL that uses the DMT technology. In certain cases for high attenuation loops the conventional algorithms are unable to assign data bits to the higher frequency tones, due to the power spectrum mask limitation recommended by ANSI Standard, even if the total power budget is not expended. In the proposed bit allocation algorithm, adjacent empty tones that would not be used merge into single tone, then additional bits is assigned to the merged empty tones. Because additional bits is allocated, most of the available power is used. The proposed algorithm show that total bit increase in about 2~9% bits more than about conventional "water-filling" and "bit removal" algorithms and that is able to use about 93% of the available budget Power

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.63-76
• /
• 1999

Recently in manufacturing environment, manufacturing order is characterized by unstable market demand, shorter product life cycle, a variety of product and shorter production lead time. In order to adapt this manufacturing order, flexible manufacturing systems(FMS) in manufacturing technology advances into the direction that machines become further versatile functionally and that tools are controlled by fast tool delivery device. Unlike conventional FMS to mainly focus on part flow, it is important to control tool flow in single-stage multimachine systems(SSMS), consisting of versatile machines and fast tool delivery device. This research is motivated by the thought that exact estimation of tool competition at part release in SSMS enhances the system performance. In this paper, in SSMS under dynamic tool allocation strategy to share tools among machines, we propose real-time part release and tool allocation algorithms which can apply real factory and which can improve system performance.