• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.2
• /
• pp.331-337
• /
• 2015

The power flow analysis of electrified railway is required complicated calculation, because of variable load. Train runs trough rail supplied by electric power therefore, the load value in electrified railway system fluctuates along time. The power flow algorithm in electrified railway system is different from general power system, and the power flow simulation is peformed by the particular simulation software. Powerail is simulation software for analysis of traction power supply system developed by KRRI, in 2008. This consists of load forecasting module, including TPS and time scheduling, and power flow module. This software was verified by measured current under normal feeding condition, however, has not been verified by voltage on the condition of extended feeding. This paper presents the verification of PowerRail based on voltage drop under extended feeding condition. This is performed by comparing simulation result with field test. Field test and simulation is done in commercial railway line.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• Journal of Advanced Navigation Technology
• /
• v.10 no.3
• /
• pp.275-281
• /
• 2006

Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources for relaying at each relay is limited due to either its available power which is much smaller than base station (BS) power or the overhead required for exchanging feedback information. The performance of SRARA schemes is evaluated with schedulers such as proportional fair (PF) and TGS at 64kbps and 128kbps user throughput requirements when total MS power is set to 500mW or 1 W. For 64kbps throughput requirement level, more improvement comes from relay than scheduler design. For 128kbps case, it comse from scheduler design than relay due to the fact that simple relay can't help using strictly limited amount of resources for relaying function.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.21-28
• /
• 2013

The paper proposes an optimal sizing method of a customer's battery energy storage system (BESS) which aims at managing the electricity demand of the customer to minimize electricity cost under the time of use(TOU) pricing. Peak load limit of the customer and charging and discharging schedules of the BESS are optimized on annual basis to minimize annual electricity cost, which consists of peak load related basic cost and actual usage cost. The optimal scheduling is used to assess the maximum cost savings for all sets of candidate capacities of BESS. An optimal size of BESS is determined from the cost saving curves via capacity of BESS. Case study uses real data from an apartment-type factory customer and shows how the proposed method can be employed to optimally design the size of BESS for customer demand management.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.555-562
• /
• 2010

After starting digital terrestrial broadcasting, there have been a number oftrials to provide new services like data broadcasting on a spare bandwidth of a DTV channel. Recently, the Push-VOD service, which provides A/V contents on that bandwidth, gets more attention and is being standardized as NRT(Non-Real-Time) by ATSC. However, it is highly probable that the contents transmitted in this way contain many errors due to the DTV receiving environment. Thus, in order to improve the reliability of transmission, the contents should be transmitted repeatedly several times, considering the unidirectional property of DTV terrestrial network. In this paper, we propose a method to calculate the optimal number of repetitions to transmit each contents in a way that minimizes the number of errors occured, when trying to transmit several contents to the receiver in a restricted time, using Markov-chain modeling and dynamic programming approach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.45-55
• /
• 2010

While Long Term Evolution-Frequency Division Duplexing (LTE-FDD) is regarded as one of the strong candidates for "4G" wireless broadband access in FDD field, LTE-Time Division Duplexing (TDD) is emerging as one possible migration path for WiMAX-TDD in some cases as well as the migration path for Time Division-Synchronous Code Division Multiple Access (TD-SCDMA). In this paper, we analyze the feasibility of dual mode with LTE-TDD in two combinations: dual mode LTE-FDD/TDD and dual mode Worldwide Interoperability for Microwave Access (WiMAX)-TDD/LTE-TDD. Thanks to the commonality in numerology, terminology, and frame structure between LTE-FDD and LTE-TDD, dual mode LTE-FDD/TDD looks feasible in a cost-effective manner. Thanks to the commonality in scheduling algorithm, control mechanism, and supported spectrum bands, it is shown that dual mode WiMAX-TDD/LTE-TDD looks feasible as well. It should be also noted that the commonality in numerology and frame structure is critical for building a chip while the commonality in algorithms and control mechanisms is critical to make it work.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

• IE interfaces
• /
• v.15 no.1
• /
• pp.99-106
• /
• 2002

A recently developed alternative to traditional production planning and control systems such as material requirement planning(MRP) and just-in-time(JIT) is the drum-buffer-rope(DBR). The DBR now being implemented in growing number of manufacturing organizations enables better scheduling and decision making on the shop floor. In implementing the DBR, however, an information system is usually needed to transmit the signal that runs from the constraint to material release. In this paper we propose a different mechanism to transmit the signal in the case that the demand of product is stable, which uses the well-known Kanban system. To improve the reality, this paper shows and example of the Kanban format, its operation, and calculation of the number of Kanbans.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.220-230
• /
• 2013

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.