• New & Renewable Energy
• /
• v.9 no.2
• /
• pp.51-57
• /
• 2013

The Grid code is being strengthen as increase of renewable energy ratio. Especially, the grid connection regulations are continuously being updated for stable operation of power grids. Static grid support and Dynamic grid support must make an accurate measure at Grid connected point because they needs control algorithm individually. It has to exactly measure voltage including switching ripple at the output of the inverter generating system. In addition, it is necessary to have an accurate voltage measurement when the situation rapidly changing the grid impedance is caused by the input of serial impedance of transformer and line impedance as well as Grid Fault Device. In this paper, We propose a new detection method of grid voltage to calculate accurately the r.m.s voltage of the grid connection point along the standard required by the low voltage regulation. We verified performance through simulation grid fault device.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.181-192
• /
• 2004

This paper presents an efficient speech interactive agent rendering smooth car navigation and Telematics services, by employing embedded automatic speech recognition (ASR), distributed speech recognition (DSR) and text-to-speech (ITS) modules, all while enabling safe driving. A speech interactive agent is essentially a conversational tool providing command and control functions to drivers such' as enabling navigation task, audio/video manipulation, and E-commerce services through natural voice/response interactions between user and interface. While the benefits of automatic speech recognition and speech synthesizer have become well known, involved hardware resources are often limited and internal communication protocols are complex to achieve real time responses. As a result, performance degradation always exists in the embedded H/W system. To implement the speech interactive agent to accommodate the demands of user commands in real time, we propose to optimize the hardware dependent architectural codes for speed-up. In particular, we propose to provide a composite solution through memory reconfiguration and efficient arithmetic operation conversion, as well as invoking an effective out-of-vocabulary rejection algorithm, all made suitable for system operation under limited resources.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.243-246
• /
• 1996

This study was peformed to characterize the physiological signal prior to develop an algorithm which quantifies EEGs evoked by tactile stimulation. The experiment was devised with four experimental conditions, which were control and two levels of pressures in tactile sensation. Twenty subjects were used to obtain EEGs while applying tactile stimulation using two types of textiles, soft towel and sand paper, to the right hand of each subject. EEGs were acquired for 20 seconds, and each trial was repeated five times randomly at the different levels of stimulus intensities. The index, $S_{n}$, was obtained by calculating the ratio of energy distribution in the time-frequency plot for each scored psychological state of the subject. The results showed that dominant aspects of the EEG signals have their maximal frequencies concentrated at a lower ranges for the resting and pleasant state, while the spectral energies were distributed to higher frequency ranges when subjects experience an unpleasant emotion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4725-4747
• /
• 2020

Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

• Smart Structures and Systems
• /
• v.29 no.1
• /
• pp.1-16
• /
• 2022

Despite recent breakthroughs in deep learning and computer vision fields, the pixel-wise identification of tiny objects in high-resolution images with complex disturbances remains challenging. This study proposes a modified U-net for tiny crack segmentation in real-world steel-box-girder bridges. The modified U-net adopts the common U-net framework and a novel Self-Attention-Self-Adaption (SASA) neuron as the fundamental computing element. The Self-Attention module applies softmax and gate operations to obtain the attention vector. It enables the neuron to focus on the most significant receptive fields when processing large-scale feature maps. The Self-Adaption module consists of a multiplayer perceptron subnet and achieves deeper feature extraction inside a single neuron. For data augmentation, a grid-based crack random elastic deformation (CRED) algorithm is designed to enrich the diversities and irregular shapes of distributed cracks. Grid-based uniform control nodes are first set on both input images and binary labels, random offsets are then employed on these control nodes, and bilinear interpolation is performed for the rest pixels. The proposed SASA neuron and CRED algorithm are simultaneously deployed to train the modified U-net. 200 raw images with a high resolution of 4928 × 3264 are collected, 160 for training and the rest 40 for the test. 512 × 512 patches are generated from the original images by a sliding window with an overlap of 256 as inputs. Results show that the average IoU between the recognized and ground-truth cracks reaches 0.409, which is 29.8% higher than the regular U-net. A five-fold cross-validation study is performed to verify that the proposed method is robust to different training and test images. Ablation experiments further demonstrate the effectiveness of the proposed SASA neuron and CRED algorithm. Promotions of the average IoU individually utilizing the SASA and CRED module add up to the final promotion of the full model, indicating that the SASA and CRED modules contribute to the different stages of model and data in the training process.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.4
• /
• pp.433-440
• /
• 2004

Since the numerical analysis was adopted in the mold design, lots of computational methods have been proposed for the simulations of casting processes for the various shaped molds. Today, it is possible to simulate the filling and solidification processes of most casts using the VOF technique. Though the three-dimensional numerical model based on the Cartesian coordinate system can be applied to any shape of cast, it becomes very inefficient when the three-dimensional model is applied to the cast of axi-symmetrical shape since the control volume includes at least 11 of the physical model. In addition, the more meshes should be distributed along the circumferential boundaries of curved shape in the Cartesian coordinate system fur the better results, while such curved circumferential boundary does not need to be considered in the two-dimensional cylindrical coordinate system. This motivates the present study i.e. developing a two-dimensional numerical model for the axi-symmetrically shaped casts. The SIMPLER algorithm, the VOF method, and the equivalent specific heat method have been adopted in the combined algorithm for the flow calculation, the free surface tracking, and the phase change heat transfer, respectively. The numerical model has been applied to the casting process of a pulley, and it was proven that the mesh and time effective calculation was accomplished comparing to the calculation using three-dimensional model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1613-1621
• /
• 2015

This paper analyzes the rate adaptation scheme and suggests applicable strategy of the MCS(Modulation and Coding Scheme) for improving DCF throughput in the IEEE 802.11ad and 802.11ad wireless LAN. IEEE 802.11ac and 802.11ad wireless LAN provide MCS technique that dynamically adjusts modulation level and code rate to the time-varying channel conditions in order to obtain considerably high data rates. But these standards did not provide rate adaptation algorithm, so this paper surveyes rate adaptation algorithm and suggests MCS scheme applied to IEEE 802.11ac and 802.11ad wireless LAN. Specially A MAC(Medium Access Control) layer throughput is evaluated over error-prone channel in the IEEE 802.11ac-based wireless LAN. In this evaluation, DCF (Distributed Coordination Function) protocol and A-MPDU (MAC Protocol Data Unit Aggregation) scheme are used. Using theoretical analysis method, the MAC saturation throughput is evaluated with the PER (Packet Error Rate) on the condition that the number of station, transmission probability, the number of parallel beams and the number of frames in each A-MPDU are variables.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.