• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.727-740
• /
• 2008

A ring R is called IFP, due to Bell, if ab=0 implies aRb=0 for $a,b{\in}R$. Huh et al. showed that the IFP condition need not be preserved by polynomial ring extensions. But it is shown that ${\sum}^n_{i=0}$ $E_{ai}E$ is a nonzero nilpotent ideal of E whenever R is an IFP ring and $0{\neq}f{\in}F$ is nilpotent, where E is a polynomial ring over R, F is a polynomial ring over E, and $a_i^{'s}$ are the coefficients of f. we shall use the term near IFP to denote such a ring as having place near at the IFPness. In the present note the structures of IFP rings and near-IFP rings are observed, extending the classes of them. IFP rings are NI (i.e., nilpotent elements form an ideal). It is shown that the near-IFPness and the NIness are distinct each other, and the relations among them and related conditions are examined.

• Journal of Multimedia Information System
• /
• v.5 no.3
• /
• pp.201-208
• /
• 2018

High Efficiency Video Coding range extensions (HEVC RExt) is a kind of extension model of HEVC. HEVC RExt was specially designed for dealing the high quality images. HEVC RExt is very essential for studio editing which handle the very high quality and various type of images. There are some problems to dealing these massive data in studio editing. One of the most important procedure is re-encoding and decoding procedure during the editing. Various codecs are widely used for studio data editing. But most of the codecs have common problems to dealing the massive data in studio editing. First, the re-encoding and decoding processes are frequently occurred during the studio data editing and it brings enormous time-consuming and video quality loss. This paper, we suggest new video coding structure for the efficient studio video editing. The coding structure which is called "ultra-low delay (ULD)". It has the very simple and low-delayed referencing structure. To simplify the referencing structure, we can minimize the number of the frames which need decoding and re-encoding process. It also prevents the quality degradation caused by the frequent re-encoding. Various fast coding algorithms are also proposed for efficient editing such as tool-level optimization, multi-serve based distributed coding and SIMD (Single instruction, multiple data) based parallel processing. It can reduce the enormous computational complexity during the editing procedure. The proposed method shows 9500 times faster coding speed with negligible loss of quality. The proposed method also shows better coding gain compare to "intra only" structure. We can confirm that the proposed method can solve the existing problems of the studio video editing efficiently.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.482-489
• /
• 2004

Paging extensions for Mobile IP was proposed to avoid unnecessary registration signaling overhead of Mobile IP. In order to support the paging function in Mobile IP, the slates of a mobile node arc divided into active on, active off, idle. The active on state means when any incoming or outgoing data session arrives to a mobile node. After data session is completed, the state of the motile node is changed into active off from active on. At this moment, the active timer starts to be operated. If the active timer expires, the mobile node moves to idle state. If a mobile node has very frequently data sessions at the same cell, the mobile node is better to move slowly into idle state. The other way, if the mobile node very frequently moves into new cell area and receives or sends little data, the mobile node is better to move earlier into idle state. In this raper, the active timer is adaptively set by the mobile nodes traffic and mobility characteristics and the paging scheme using this active timer is proposed to reduce the location registration cost.

• Journal of the Korean Society of Safety
• /
• v.30 no.5
• /
• pp.8-13
• /
• 2015

Molded Case Circuit Breakers (MCCBs) are typically used to provide over current protection for electrical safety caused by short circuit faults and overloads in indoor low voltage power systems. The MCCB automatically connects and disconnects loads from the electrical source when the current reaches a value and duration that will cause an excessive. However, the MCCB sometimes is not interrupted due to a malfunction, nuisance tripping, or in a fire. Ensuring electrical safety is very important in a indoor low voltage power system. This paper presents the operating characteristics of MCCBs according to a temperature rise from room temperature to 160 degrees Celsius delivered by a radiant panel heater. The ABS 54c(rated current: 30A) of the hydraulic magnetic trip type was used in the experiments. The signals of temperature, voltage, and current were measured using the high accuracy Signal Conditioning Extensions for Instrumentation (SCXI) measurement system with the LabVIEW program manufactured by National Instruments. The operating characteristics were measured as functions of current amplitude and ramp-up rate. The MCCB tripping time decreased as a result of increasing current amplitude and ramp-up rate under a temperature rise condition, because the temperature and level of the current are directly proportional to the tripping time. Additionally, an instantaneous operation was observed after 8 times of the rated current, and the MCCB began to melt a surface temperature of around 300 degrees Celsius of. The experimental results coincided well with the operating curve.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.125-135
• /
• 1992

In various viscus flow problems it has been the custom to replace the convective derivative by the ordinary partial derivative in problems for which the data are small. In this paper we consider the Benard Convection problem with small data and compare the solution of this problem (assumed to exist) with that of the linearized system resulting from dropping the nonlinear terms in the expression for the convective derivative. The objective of the present work is to derive an estimate for the error introduced in neglecting the convective inertia terms. In fact, we derive an explicit bound for the L$_{2}$ error. Indeed, if the initial data are O(.epsilon.) where .epsilon. << 1, and the Rayleigh number is sufficiently small, we show that this error is bounded by the product of a term of O(.epsilon.$^{2}$) times a decaying exponential in time. The results of the present paper then give a justification for linearizing the Benard Convection problem. We remark that although our results are derived for classical solutions, extensions to appropriately defined weak solutions are obvious. Throughout this paper we will make use of a comma to denote partial differentiation and adopt the summation convention of summing over repeated indices (in a term of an expression) from one to three. As reference to work of continuous dependence on modelling and initial data, we mention the papers of Payne and Sather [8], Ames [2] Adelson [1], Bennett [3], Payne et al. [9], and Song [11,12,13,14]. Also, a similar analysis of a micropolar fluid problem backward in time (an ill-posed problem) was given by Payne and Straughan [10] and Payne [7].

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.943-949
• /
• 2010

This paper presents some improvements on VLSI implementation of lifting-based 9/7 wavelet transform by optimization hardware multiplication. The proposed solution requires less logic area and power consumption without performance loss compared to previous wavelet filter structure based on lifting scheme. This paper proposes a better approach to the hardware implementation using Lefevre algorithm based on extensions of Pattern search methods. To compare the proposed structure to the previous solutions on full multiplier blocks, we implemented them using Verilog HDL. For a hardware implementation of the two solutions, the logical synthesis on 0.18 um standard cells technology show that area, maximum delay and power consumption of the proposed architecture can be reduced up to 51%, 43% and 30%, respectively, compared to previous solutions for a 200 MHz target clock frequency. Our evaluation show that when design VLSI chip of lifting-based 9/7 wavelet filter, our solution is better suited for standard-cell application-specific integrated circuits than prior works on complete multiplier blocks.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1297-1307
• /
• 1997

This paper presents a multimedia mail system which transmit and redeive multimedia mailing messges on Intemet.This mail system is an extension of the exsting e-mail system for multimedia uncluding,text,image,MPEG video,and binary data,The MIME(Multipurpose Intert Mail Extensions)format,which is an extension of REF-822 maill format,is used to reprssent multimedia,and SMTP(Simple Mail Transfer Protocol)is utilized as a mail transport prttocol.The IMAP(Intenet Mail Access Protcol)which privides more functions than the widely used POP(Post Office Protocol)is used as a mailbox retrival protocol.The mail client is complemented on a multimedia PC while the server is implemented on a UNIX system.In the mail system, a mail sending program allows a user to attach binary files such as Postscript files and MPEG compressed video,while a receiving program provides direct interface to application programs to play back received multimedia mail messages.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.11-16
• /
• 2007

This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.141-147
• /
• 2017

Scalable extension of High Efficiency Video Coding (SHVC) standard uses the up-sampled residual data from the base layer to make a residual data in the enhancement layer. This paper describes an efficient algorithm for improving coding gain by using the filtered residual signal of base layer in the Scalable extension of High Efficiency Video Coding (SHVC). The proposed adaptive filter selection mechanism uses the smoothing and sharpening filters to enhance the quality of inter-layer prediction. Based on two filters and the existing up-sampling filter, a rate-distortion (RD)-cost fuction-based competitive scheme is proposed to get better quality of video. Experimental results showed that average BD-rate gains of 1.5%, 2.1%, and 1.7% for Y, U and V components, respectively, were achieved, compared with SHVC reference software 5.0, which is based on HEVC reference model (HM) 13.