• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.33-41
• /
• 2006

Nowadays, CCTV can be come across easily in public institutions, banks, and etc. These CCTV play very important roles for preventing many kinds of crimes and resolving those crime affairs. But in the case of recording image of a specific person far from the CCTV, the original image needs to be enlarged and recovered in order to identify the person more obviously. Interpolation is usually used for the enlargement and recovery of the image in this case. However, it has a certain limitation. As the magnification of enlargement is getting bigger, the quality of the original image can be worse. This paper uses FDP(Facial Definition Parameter) proposed by the MPEG-4 SNHC FBA group and introduces a new algorithm that uses face outline information of the original image based on the FDP, which makes it possible to recover better than the known methods until now.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.6 no.4
• /
• pp.39-49
• /
• 2002

In this paper, the characteristics of RB(rubber bearing) were studied by various prototype tests on RB with low hardness rubber. The characteristics of RB were tested on displacements, repeated cycles, frequencies, vertical pressures, temperature, vertical stiffness and the capability of shear deformation. The prototype test showed that the displacement and vertical pressures were the most governing factors influencing on characteristics of RB. The effective stiffness and equivalent damping of RB showed small increment in high frequency range. After the repeated cyclic test with 50's cycles, the effective stiffness and equivalent damping of RB were almost constant compared with those of the 1st cycles due to low hysteretic damping. The shear modulus of RB was reduced after large deformation, and this value of RB was partly recovered after 40 days. Finally, the shear failure test of RB was conducted, the prototype was failed over 490% of shear strain, and real size RB was failed over 430% of shear strain.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.98-113
• /
• 2009

Conventional file systems for harddisk drive cannot be applied to NAND flash memory, because the physical characteristics of NAND flash memory differs from those of harddisk drive. To address this problem, various file systems with better reliability and efficiency have also been developed recently. However, those file systems have inherent overheads for updating the file's metadata pages, because those file systems save file's meta-data and data separately. Furthermore, those file systems have a critical reliability problem: file systems fail when either a page in meta-data of a file system or a file itself fails. In this paper, we propose a self-description page technique and In Memory Core File System technique to address these efficiency and reliability problems, and develop SDFS(Self-Description File System) newly. SDFS can be safely recovered, although some pages fail, and improves write and read performance by 36% and 15%, respectively, and reduces mounting time by 1/20 compared with YAFFS2.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.66-78
• /
• 2015

With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.5
• /
• pp.53-64
• /
• 2019

The term 're-use' here signifies the re-use of end-of-life products without changing their form after they have been thoroughly inspected and cleaned. In the re-use network model, the distributor determines the product order quantity on the network through which new products are received from the suppliers or products are supplied to the customers through re-use of the recovered products. In this paper, we propose a reusable network model for reusable products that considers the total logistics cost from the forward logistics to the reverse logistics. We also propose a reusable network model that considers the processing and disposal costs for reuse in an optimal inventory management environment. The authors employe Genetic Algorithm (GA), which is one of the optimization techniques, to verify the validity of the proposed model. And in order to investigate the effect of the parameters on the solution, the priority-based GA (priGA) under three different parameters and the modified Hybrid GA (mhGA), in which parameters are adjusted for each generation, were applied to four examples with varying sizes in the simulation.

• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1366-1379
• /
• 2019

High-gain DC/DC converters have become one of the key technologies for the grid-connected operation of new energy power generation, and its research provides a significant impetus for the rapid development of new energy power generation. Inspired by the transformer effect and the ripple-suppressed ability of a coupled inductor, a double-coupled inductor high gain DC/DC converter with a ripple absorption circuit is proposed in this paper. By integrating the diode-capacitor voltage multiplying unit into the quadratic Boost converter and assembling the independent inductor into the magnetic core of structure coupled inductors, the adjustable range of the voltage gain can be effectively extended and the limit on duty ratio can be avoided. In addition, the volume of the magnetic element can be reduced. Very small ripples of input current can be obtained by the ripple absorption circuit, which is composed of an auxiliary inductor and a capacitor. The leakage inductance loss can be recovered to the load in a switching period, and the switching-off voltage spikes caused by leakage inductance can be suppressed by absorption in the diode-capacitor voltage multiplying unit. On the basis of the theoretical analysis, the feasibility of the proposed converter is verified by test results obtained by simulations and an experimental prototype.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.5
• /
• pp.654-666
• /
• 2019

The tactical network has several different characteristics compared with commercial internet network such as hierarchical topology, dynamic topology changing and wireless link based connectivity. For considering IP mobility management in the tactical network, current mobility management using Mobile IP(MIP) is not suitable with some reasons such as non-optimal routing paths and single point of failure. Proxy Mobile IP(PMIP) which supporting network-based mobility in hierarchical manner can provide optimal routing path in the tactical network environment, but centralized anchor is still remained a threat to the stability of the tactical network which changes its topology dynamically. In this paper, we propose PMIP-based distributed mobility management for the tactical network environment. From our design, routing paths are always configured in optimized way, as well as path is recovered quickly when the mobility anchor of user is failed. From numerical analysis, comparing to other mobility scheme, result shows that the proposed scheme can reduce packet transmission cost and latency in tactical network model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.800-813
• /
• 2021

With the advent of 5G communications, internet of vehicles technology has been widely used in vehicles. Then the dynamic spread of information between vehicles began to come into focus with more research. It is well known that the identification of nodes with great spread influence has always been a hot topic in the field of information spreading. Most of the existing work measures the propagation influence by degree centrality, betweenness centrality and closeness centrality. In this paper, we will identify influential vehicle nodes based on the mobility characteristics of vehicles to explore the information spreading between vehicles in VANETs. Different from the above methods, we mainly explore the influence of the radius of gyration and vehicle kilometers of travel on information spreading. We use a real vehicle trajectory data to simulate the information transmission process between vehicles based on the susceptible-infected-recovered SIR model. The experimental results show that the influence of information spreading does not enhance with increasing radius of gyration and vehicle kilometers of travel. The fact is that both the radius of gyration and the distance travelled have a significant influence on information spreading when they are close to the median. When the value of both is large or small, it has little influence on information spreading. In view of this results, we can use the radius of gyration and vehicle kilometers of travel to better facilitate the transmission of information between vehicles.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.11
• /
• pp.31-37
• /
• 2018

This paper proposes an effective single-image haze-removal algorithm with low complexity by using a dual dark channel prior (DCP) and an adaptive brightness correction technique. The dark channel of a small patch preserves the edge information of the image, but is sensitive to noise and local brightness variations. On the other hand, the dark channel of a large patch is advantageous in estimation of the exact haze value, but halo effects from block effects deteriorate haze-removal performance. In order to solve this problem, the proposed algorithm builds a dual DCP as a combination of dark channels from patches with different sizes, and this meets low-memory and low-complexity requirements, while the conventional method uses a matting technique, which requires a large amount of memory and heavy computations. Moreover, an adaptive brightness correction technique that is applied to the recovered image preserves the objects in the image more clearly. Experimental results for various hazy images demonstrate that the proposed algorithm removes haze effectively, while requiring much fewer computations and less memory than conventional methods.