• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.40-47
• /
• 1996

A method for computing effectiv ebandwidth of aggregated varable bit rate (VBR) moving picture experts group (MPEG) video traffic is proposed. To compute statistical characteristics of aggregated MPEG traffic, first we split input MPEG traffic into I, B, and P frame traffics and aggregate respective I, B, and P frame traffics according to the frame type. Second statisticsal characteristics of the aggregated MPEG traffic are obtained using those of aggregated I, B, and P frame traffics. The effective bandwidth of the aggregated I frame traffic is computed by using the gaussian bound. Using the modified equivalent capacity, we obtain the effective bandwidths of aggregated B and P frame traffics and then compute the effective bandwidth of the combined B and P frame traffic. Finally the effective bandwidth of the aggregated MPEG traffic is computed by adding the gaussian bound of the aggregated I frame traffic and modifed equivalent capacity of combined B and P frame traffic. Computer simulation shows that the proposed method estimates effective bandwidth of the aggregated MPEG traffic well.

• Geomechanics and Engineering
• /
• v.22 no.3
• /
• pp.265-275
• /
• 2020

As a flexible supporting structure, the anchoring frame structure is widely adopted to support multistage slopes in high earthquake-intensity area for its effectiveness and practicality. The previous study indicates that the anchor of anchoring frame structure is the most likely to be damaged during earthquakes. It is crucial to determine the pull-out capacity of anchor against seismic force for the seismic design of anchoring frame structure. In this study, an analytical model of a three-stage slope supported by anchoring frame structure is established, and the upper bound method of limit analysis is applied to deduce the seismic anchor force of anchoring frame structure. The pull-out capacity of anchor against seismic force of anchoring frame structure at each stage is obtained by computer programming. The proposed method is proved to be reasonable and effective compared with the existing published solution. Besides, the influence of main parameters on the pull-out capacity of anchor against seismic force is analyzed to provide some recommendations for the seismic design of anchoring frame structure.

• Korean Journal of Mathematics
• /
• v.29 no.4
• /
• pp.725-732
• /
• 2021

This paper aims to present a new lower bound for some inequalities related to Frames in Hilbert space. Some refinements of the inequalities for general frames and alternate dual frames under suitable conditions are given. These results refine the remarkable results obtained by Balan et al. and Gavruta.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2007

In this paper we show that for each finite frame for a Hilbert space there are two orthonormal elements related to the optimal lower and upper bounds of the frame. Based on this we show that an orthonormal basis is naturally associated with every finite frame. We then analyze the relationship between such an orthonormal basis and the given finite frame.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.372-375
• /
• 2008

IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

• Wind and Structures
• /
• v.14 no.1
• /
• pp.1-14
• /
• 2011

Open frame structures, such as those commonly found in industrial process facilities, are often densely occupied with process related equipment. This paper presents a method for estimating wind loads for high-solidity open frame structures that differs from current approaches, which accumulate wind load contributions from various individual structure components. The method considers the structure as a porous block of arbitrary plan dimension that is subject to wind from any direction. The proposed method compares favorably with wind tunnel test results for similar structures. The possibility of defining an upper bound force coefficient is also discussed.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.1
• /
• pp.116-127
• /
• 1994

A reliability analysis model for the frame structure which grafts the discretized ideal plastic method to the stochastic finite element method is introduced. The proposed method simmulates realistically the sequencial occurrence of plastic hinges and yields the probability of failure directly from the geometrical and material properties of a frame structure. The presented method can also take into account the uncertainties inherent in loads and resisten- ces through the stochastic finite element technique. The analysis results are compared with those of the Monte Carlo Simmulation, the Bound Theory, and the fs-unzipping method, and show good agreement.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

Given the frame size and constituent encoders, interleaver plays a central role in a turbo code performance. Interleaver should be designed to generate a heavy weight codeword in the second encoder if the first encoder generates a low weight codeword. In this paper we present a search procedure for high performace interleaver whose performance is measured by computing union bound using the weight spectrum of all the weight 2, 3

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.1-12
• /
• 2005

In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.215-225
• /
• 2017

In this paper, we study some equivalence relations between continuous frames in a Hilbert space ${\mathcal{H}}$. In particular, we seek two necessary and sufficient conditions under which two continuous frames are near. Moreover, we investigate a distance between continuous frames in order to acquire the closest and nearest tight continuous frame to a given continuous frame. Finally, we implement these results for shearlet and wavelet frames in two examples.