• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.2
• /
• pp.76-80
• /
• 2005

In this paper, a miniaturized ring hybrid circuit is characterized based on a thin film microstrip (TFMS) on low-resistivity silicon. In order to obtain low-loss characteristics, a polyimide layer with 50 $\mu$m thickness is spin-coated onto the silicon to be used for the substrate. First, propagation characteristics of TFMS lines consisting of the ring hybrid circuit are presented. Then, a ring hybrid circuit based on TFMS is featured by employing the triple concentric circle approach for miniaturization. Triple concentric circle lines with $\lambda$$_{g}$/4 or 3$\lambda$$_{g}$/4 line lengths are implemented on the surface of the polyimide by circularly meandering to reduce the circuit size of the designed ring hybrid. Good agreement between measured and simulated results is obtained.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.913-929
• /
• 2015

Hybrid simulation is increasingly being recognized as a powerful technique for laboratory testing. It offers the opportunity for global system evaluation of civil infrastructure systems subject to extreme dynamic loading, often with a significant reduction in time and cost. In this approach, a reference structure/system is partitioned into two or more substructures. The portion of the structural system designated as 'physical' or 'experimental' is tested in the laboratory, while other portions are replaced with a computational model. Many researchers have quite effectively used hybrid simulation (HS) and real-time hybrid simulation (RTHS) methods for examination and verification of existing and new design concepts and proposed structural systems or devices. This paper provides a detailed perspective of the enabling role that HS and RTHS methods have played in advancing the practice of earthquake engineering. Herein, our focus is on investigations related to earthquake engineering, those with CURATED data available in their entirety in the NEES Data Repository.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.4
• /
• pp.10-15
• /
• 2021

Cache bypassing schemes have been studied to remove unnecessary updating the data in cache blocks. Among them, a statistics-based cache bypassing method for asymmetric-access caches is one of the most efficient approach for non-voliatile memories and shows the lowest cache access latency. However, it is proposed under the condition of the normal cache system, so further study is required for the hybrid cache architecture. This paper proposes a novel cache bypassing scheme, called hybrid bypassing block selector. In the proposal, the new model is established considering the SRAM region and the non-volatile memory region separately. Based on the model, hybrid bypassing decision block is implemented. Experiments show that the hybrid bypassing decision block saves overall energy consumption by 21.5%.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.863-868
• /
• 1992

This paper presents a method on applying Genetic Algorithm(GA), which is a well-known high performance optimizing algorithm, to construct the self-organizing fuzzy logic controller. Fuzzy logic controller considered in this paper utilizes Sugeno's hybrid inference method, which has an advantage of simple defuzzification process in the inference engine. Genetic algorithm is used to find the optimal parameters in the FLC. The proposed approach will be demonstrated using 2 d.o.f robot manipulator to verify its effectiveness.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.994-998
• /
• 1996

We propose an approach to integrating fuzzy logic control with RBF(Radial Basis Function) networks and show how the integrated network can be applied to multivariable self-organizing and self-learning fuzzy controller. Using the hybrid learning algorithm. To investigate its usefulness and performance, this controller is applied to a time-delayed process system. Simulation results show good control performance and fast convergency in hybrid loaming method.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2078-2094
• /
• 2015

Now a days, Efficient processing of Broadcast Queries is of critical importance with the ever-increasing deployment and use of mobile technologies. BQs have certain unique characteristics that the traditional spatial query processing in centralized databases does not address. In novel query processing technique, by maintaining high scalability and accuracy, latency is reduced considerably in answering BQs. Novel approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: Cache Data, which caches the data, and Cache Path, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (Hybrid Cache), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1027-1037
• /
• 2017

Penetration of renewable energy sources makes the modern interconnected power systems to have more intelligence and flexibility in the control. Hence, it is essential to maintain the system frequency and tie-line power exchange at nominal values using Load Frequency Control (LFC) for efficient, economic and reliable operation of power systems. In this paper, intelligent tuning of the Proportional Integral Derivative (PID) controller for LFC in an interconnected power system is considered as a main objective. The chosen problem is formulated as an optimization problem and the optimal gain parameters of PID controllers are computed with three innovative swarm intelligent algorithms named Particle Swarm Optimization (PSO), Bacterial Foraging Optimization Algorithm (BFOA) and hybrid Bacterial Foraging Particle Swarm Optimization (BFPSO) and a comparative study is made between them. A new objective function designed with necessary time domain specifications using weighted sum approach is also offered in this report and compared with conventional objective functions. All the simulation results clearly reveal that, the hybrid BFPSO tuned PID controller with proposed objective function has better control performances over other optimization methodologies.

• Current Optics and Photonics
• /
• v.2 no.6
• /
• pp.612-622
• /
• 2018

In wave-front-sensor-less adaptive optics (WFS-less AO) systems, the Jacopo Antonello (JA) method belongs to the model-based class and requires few iterations to achieve acceptable distortion correction. However, this method needs a lot of measurements, especially when it deals with moderate or severe aberration, which is undesired in free-space optical communication (FSOC). On the contrary, the stochastic parallel gradient descent (SPGD) algorithm only requires three time measurements in each iteration, and is widely applied in WFS-less AO systems, even though plenty of iterations are necessary. For better and faster compensation, we propose a WFS-less hybrid approach, borrowing from the JA method to compensate for low-order wave front and from the SPGD algorithm to compensate for residual low-order wave front and high-order wave front. The correction results for this proposed method are provided by simulations to show its superior performance, through comparison of both the Strehl ratio and the convergence speed of the WFS-less hybrid approach to those of the JA method and SPGD algorithm.

• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3864-3877
• /
• 2022

We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.