• 산업기술연구
• /
• 제28권A호
• /
• pp.113-117
• /
• 2008

Wireless carrier sense multiple access (CSMA) systems are widely used but show extremely different transmission efficiency according to the operation environment. Simulation or prototype deployment is needed to see the transmission efficiency of a wireless CSMA system with the partial packet retransmission scheme. The lower bound for the transmission efficiency of such a system is found mathematically in this work. This shows how much the partial packet retransmission scheme improves the transmission efficiency quantitatively. It also shows that the maximum throughput is obtained at higher offered load compared to the conventional CSMA system without the partial packet transmission. The result of this work can be applied to IEEE 802.11 networks or wireless mesh networks.

• Structural Engineering and Mechanics
• /
• 제60권3호
• /
• pp.365-386
• /
• 2016

This paper describes a systematic numerical investigation into the nonlinear elastic behavior of conical shells, with various types of initial imperfections, subject to a uniformly distributed axial compression. Three different patterns of imperfections, including first axisymmetric linear bifurcation mode, first non-axisymmetric linear bifurcation mode, and weld depression are studied using geometrically nonlinear finite element analysis. Effects of each imperfection shape and tapering angle on imperfection sensitivity curves are investigated and the lower bound curve is determined. Finally, an empirical lower bound relation is proposed for hand calculation in the buckling design of conical shells.

• 대한수학회지
• /
• 제53권2호
• /
• pp.461-473
• /
• 2016

Let C be a projective plane curve of degree d whose singularities are all isolated. Suppose C is not concurrent lines. P loski proved that the Milnor number of an isolated singlar point of C is less than or equal to $(d-1)^2-{\lfloor}\frac{d}{2}{\rfloor}$. In this paper, we prove that the Milnor sum of C is also less than or equal to $(d-1)^2-{\lfloor}\frac{d}{2}{\rfloor}$ and the equality holds if and only if C is a P loski curve. Furthermore, we find a bound for the Milnor sum of projective plane curves in terms of GIT.

• 소성∙가공
• /
• 제3권1호
• /
• pp.23-37
• /
• 1994

The upper bound element technique(UBET) is used to analyze the final stage of the axisymmetric forward extrusion. Kinematically admissible velocity field involving curved surface of velocity discontinuity is assumed. The required power to arise the piping defect is obtained and is compared with Aviture's solution a the same condition. Conditions for inception of the cavity and development of the pipe are predicted. The internal radius of the pipe and critical length of billet are also determined. Experiments are carried out for extrusion with lead specimens to investigate the piping phenomena. The theoretically predicted results showed reasonably good agreement with the experimental observation.

• 대한수학회지
• /
• 제35권3호
• /
• pp.713-725
• /
• 1998

Let X and Y be Ito processes with dX$_{s}$ = $\phi$$_{s}$dB$_{s}$ ＋ $\psi$$_{s}$ds and dY$_{s}$ = (equation omitted)dB$_{s}$ ＋ ξ$_{s}$ds. Burkholder obtained a sharp bound on the distribution of the maximal function of Y under the assumption that │Y$_{0}$│$\leq$│X$_{0}$│,│ζ│$\leq$│$\phi$│, │ξ│$\leq$│$\psi$│ and that X is a nonnegative local submartingale. In this paper we consider a wider class of Ito processes, replace the assumption │ξ│$\leq$│$\psi$│ by a more general one │ξ│$\leq$$\alpha$ │$\psi$│ , where a $\geq$ 0 is a constant, and get a weak-type inequality between X and the maximal function of Y. This inequality, being sharp for all a $\geq$ 0, extends the work by Burkholder.der.urkholder.der.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.507-526
• /
• 2009

Since SIP uses a text-based message format and is open to the public Internet, it provides a number of potential opportunities for Denial of Service (DoS) attacks in a similar manner to most Internet applications. In this paper, we propose an effective detection method for SIP flooding attacks in order to deal with the problems of conventional schemes. We derive the upper bound of the possible number of SIP messages, considering not only the network congestion status but also the different properties of individual SIP messages such as INVITE, BYE and CANCEL. The proposed method can be easily extended to detect flooding attacks by other SIP messages.

• BMB Reports
• /
• 제43권5호
• /
• pp.344-348
• /
• 2010

Messenger ribonucleoprotein particles (mRNPs) are used to transport mRNAs along neuronal dendrites to their site of translation. Staufen2 is an mRNA-binding protein expressed in the cell bodies and cellular processes of different brain cells. It is notably involved in the transport of dendritic mRNAs along microtubules. Its knockdown expression was shown to change spine morphology and impair synaptic functions. However, the identity of Staufen2-bound mRNAs in brain cells is still completely unknown. As a mean to identify these mRNAs, we immunoprecipitated Staufen2-containing mRNPs from embryonic rat brains and used a genome wide approach to identify Staufen2-associated mRNAs. The genome wide approach identified 1780 mRNAs in Staufen2-containing mRNPs that code for proteins involved in cellular processes such as post-translational protein modifications, RNA metabolism, intracellular transport and translation. These results represent an additional and important step in the characterization of Staufen2- mediated neuronal functions in rat brains.

• 대한수학회지
• /
• 제41권5호
• /
• pp.933-944
• /
• 2004

Packing dimension of a set is an upper bound for the packing dimensions of measures on the set. Recently the packing dimension of statistically self-similar Cantor set, which has uniform distributions for contraction ratios, was shown to be its Hausdorff dimension. We study the method to find an upper bound of packing dimensions and the upper Renyi dimensions of measures on a statistically quasi-self-similar Cantor set (its packing dimension is still unknown) which has non-uniform distributions of contraction ratios. As results, in some statistically quasi-self-similar Cantor set we show that every probability measure on it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely and it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely for almost all probability measure on it.

• 한국생물공학회:학술대회논문집
• /
• 한국생물공학회 2005년도 생물공학의 동향(XVI)
• /
• pp.99-102
• /
• 2005

The Basidomycetes fungus Agaricus blazei Murill has been well known as a health food for the prevention of cancer, diabetes, hyperlipidemia, arteriosclerosis and chronic hepatitis. This study was concentrated to investigate the characteristics of crude protein-bound polysaccharides(PBP) compositions extracted from Agaricus blazei Murill. In order to produce crude polysaccharides, culture conditions were examined using YMK media. Total sugars and protein contents of PBP were detected by phenol-sulfuric acid method and Bradford -assay. Hexosamine was found to be involved in the linkage, N-linked and O-linked types. To identify helical conformation existence, wavelength was measured using Congo red after the treatment with alkali solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.