• Journal of Power Electronics
• /
• v.19 no.2
• /
• pp.353-362
• /
• 2019

To address the problem of circulating current loss in the traditional zero-current switching (ZCS) full-bridge (FB) DC/DC converter, a ZCS FB DC/DC converter topology and modulation strategy is proposed in this paper. The strategy can achieve ZCS turn on and zero-voltage and zero-current switching (ZVZCS) turn off for the primary switches and realize ZVZCS turn on and zero-voltage switching (ZVS) turn off for the auxiliary switches. Moreover, its resonant circuit power is small. Compared with the traditional phase shift full-bridge converter, the new converter decreases circulating current loss and does not increase the current stress of the primary switches and the voltage stress of the rectifier diodes. The diodes turn off naturally when the current decreases to zero. Thus, neither reverse recovery current nor loss on diodes occurs. In this paper, we analyzed the operating principle, steady-state characteristics and soft-switching conditions and range of the converter in detail. A 740 V/1 kW, 100 kHz experimental prototype was established, verifying the effectiveness of the converter through experimental results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.445-466
• /
• 2022

As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.476-487
• /
• 2009

The virtual memory system in 4.4 BSD operating systems exploits a clustering scheme to reduce disk I/Os in paging out (or flushing) modified pages that are intended to be replaced in order to make free rooms in memory. Upon the page out of a victim page, the scheme stores a cluster (or group) of modified pages contiguous with the victim in the virtual address space to swap disk at a single disk write. However, it fails to find large clusters of contiguous pages if applications change pages not adjacent with each other in the virtual address space. To address the problem, we propose a new clustering scheme called Multiple-Object Clustering (MOC), which together stores multiple clusters in the virtual address space at a single disk write instead of paging out the clusters to swap space at separate disk I/Os. This multiple-cluster transfer allows the virtual memory system to significantly decrease disk writes, thus improving the page-out performance. Our experiments in the FreeBSD 6.2 show that MOC improves the execution times of realistic benchmarks such as NS2, Scimark2 SOR, and nbench LU over the traditional clustering scheme ranging from 9 to 45%.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.348-359
• /
• 2000

Most of the important real time multimedia applications require multipoint transmissions. To support these applications in ATM based Intermet environments, it is important to provide efficient IP multicast transportations over ATM networks. IETF proposed MARS(Multicast Address Resolution Server) as the service architecture to transport connectionless IP multicast flows over connection oriented ATM VCs. MARS assumes UNI3.0/3.1 signalling. Since UNI3.0/3.1 does not provide any means for receivers to request a join for a multicast ATM VC, MARS provides overlay service to relay join request from IP multicast group members to the sources of the multicast group. Later on, ATM Forum standardized UNI4.0 signalling which is provisioned with a new signalling mechanism called LIJ(Leaf Initiated Join). LIJ enables receivers to directly signal the source of an ATM VC to join. In this paper, we propose a new service architecture providing IP multicast flow transportation over ATM networks deploying UNI4.0 signalling. The proposed architecture is named UNI4MARS. It comprises service components same as those of the MARS. The main functionality provided by the UNI4MARS is to provide source information to the receivers so that the receivers may exploit LIJ to join multicast ATM VCs dynamically. The implementation overhead of UNI4MARS and that of MARS are compared by a course of simulations. The simulation results show that the UNI4MARS supports the dynamic IP multicast group changes more efficiently with respect to processing, memory and bandwidth overhead.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.307-316
• /
• 2004

Wireless local area networks have known an increasing popularity during the past few years. However, as new user applications diverge from the traditional data-centric model, the introduction of efficient, QoS aware medium access methods becomes of utmost importance. EY-NPMA is a medium access protocol belonging to the contention paradigm that provides support for service differentiation and low collision rates. In this paper, we address a shortcoming of EY-NPMA as indicated by previous studies, namely the insensitivity of the protocol to different working conditions. In this work, we study and evaluate a mechanism that allows a network employing EY-NPMA to adapt its operating parameters according to the offered load. Simulation studies further document and confirm the positive characteristics of the proposed mechanism.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.144-156
• /
• 2010

When existing parts are re-used for the development of a new product or business-to-business transactions, a method for searching parts from a part database that meets user's requirements is necessary. To this end, it is important to develop a part search method which is able to measure similarity between parts and user's input data with generality as well as robustness. In this paper, the authors suggest a method for measuring part similarity using ontology and multi-criteria decision making method and address its technical details. The proposed method ensures the interoperability with existing engineering information management systems, represents part specifications systematically, and has generality in the procedure for comparing part specifications. The case study for ejector pins having been conducted to demonstrate the proposed method is also discussed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.1
• /
• pp.65-71
• /
• 2013

In this work, new smart phone based moving target detection is proposed. In order to implement the task, methods of real time image transmission from network camera, motion detecting algorithm and its effective implementation are also addressed. The network camera transfers image data by MJPEG format which contains various information such as data and IP address, and the smart phone separates the image data received through a WiFi module. Later, the image data is converted to a Bitmap image format, and with the help of the embedded OpenCV library on a smart phone and algorithm, it was found that the moving object was identified effectively in terms of real time monitoring and detection.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.133-136
• /
• 2002

This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.907-910
• /
• 2001

In this paper, we address a new time delay estimation method using third-order statistics and subband adaptive filtering to improve the accuracy of target detection for acoustic backscattered signals in a noise interference environment. Each reference and primary signals are decorrelated using the multiresolution analysis framework through a M-band discrete wavelet transform(M-DWT). Then noise effect can be reduced. Here, time delays are estimated iteratively in each subband using two different adaptation mechanisms that minimize the mean squared error (MSE) between the references and primary signal. More specifically, third-order cumulants and projection cross-correlation(PCC) criterion are utilized to achieve an effective SNR improvement for the time delay estimation.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.273-276
• /
• 1998

This paper proposes a new Asynchronous Transfer Mode(ATM) switch architecture for the Broadband ISDN. The proposed switch has the architecture to prohibit the out-of-sequence in shared buffer switch system with being fixed buffer size in the out-buffered large scale ATM Switch System. then in this paper proposes cell resequence algorithm to decrease the out-of-sequence problem. also, we studied the out-of-sequence problem that was occurred by the cell transfer delay and the cell overflow due to the fixed buffer size when cell resequenced and we propose to implement optimal ACFIFO(Address Counter First In First Out) buffer size which has the minimized cell loss.