• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.6
• /
• pp.27-33
• /
• 2008

Given a polynomial ${\hbar}(x){\in}F_q[x]$ of degree h, it is an important problem to determine the size of multiplicative subgroup of $\(F_q[x]/({\hbar(x))\)*$ generated by $x-s_1,\;x-s_2,\;{\cdots},\;x-s_n$, where $\{s_1,\;s_2,\;{\cdots},\;s_n\}{\sebseteq}F_q$, and for all ${\hbar}(x){\neq}0$. So far the best known asymptotic lower bound is $(rh)^{O(1)}\(2er+O(\frac{1}{r})\)^h$, where $r=\frac{n}{h}$ and e(=2.718...) is the base of natural logarithm. In this paper, we exploit the coding theory connection of this problem and prove a better lower bound $(rh)^{O(1)}\(2er+{\frac{e}{2}}{\log}r-{\frac{e}{2}}{\log}{\frac{e}{2}}+O{(\frac{{\log}^2r}{r})}\)^h$, where log stands for natural logarithm We also discuss about the limitation of this approach.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1506-1517
• /
• 1999

In this paper, we propose two fast block matching algorithm using the distribution of mean absolute difference (MAD) at the search region overlapped with neighbor blocks and pixel subsapmling. The proposed methods use the lower and upper bound of MAD at the overlapped search region which is calculated from the MAD of neighbor block at that search position and MAD between the current block and neighbor block. In the first algorithm, we can reduce the computational complexity by executing the block matching operation at the only necessary search points. That points are selected using the lower bound of MAD. In the second algorithm, we use the statictical distribution of actual MAD which exists between the lower bound and upper bound of MAD. By using the statistical distribution of actual MAD, we can significantly reduce the computational complexity for motion estimation. after striking space key 2 times.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1842-1850
• /
• 1997

This paper proposes a new rearrangeable algorithm in multistage reverse shuffle/exchange network. The best known lower bound of stages for rearrangeability in symmetric network is 2logN-1 stages. However, it has never been proved for nonsymmetric networks before. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric network is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with $N{\le}16$. This rearrangeability can be established by setting one more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results in this paper enable us to establish an upper bound, 2logN stages for rearrangeable reverse shuffle/exchange network with $N{\le}16$, and leads to the possibility of this bound when $N{\le}16$.

• Journal of Pharmacopuncture
• /
• v.20 no.4
• /
• pp.230-234
• /
• 2017

Objective: Neurasthenia is a disease which consists of increased fatigue or bodily weakness and exhaustion plus pantalgia, dizziness, headache and other symtoms relevant to autonomic nerve dysfunction. There are plenty of studies investigating the history of diagnostic criteria of neurasthenia, which is influenced by diverse cultural(or social) environment. The obejective of this study is to provide review of the previous studys on the changes of neurasthenia diagnoses in the context of local area to find meanings of these transition and improve health care for psychiatric patient. Methods: Literature review was conducted on studies demonstrating diagnostic criteria of neurasthenia with cultural(or social) environment. We investigated the literature reviews or observative studies which described alteration of diagnostic criteria of neurasthenia and assessed its significance. After selecting eligible studies, the authors read the articles and summarized the meaningful contents those were significant in clinical practice. Results: Transformation of Chinese Classification of Mental Disorder(CCMD) integrated with internationally utilized DSM-IV or ICD-10 is controversial about its significance in that it had limited effect on public health care due to the variables of sociocultural context, but primarily differentiated neurasthenia from other disorders. The latter one can be the directing point of the diagnostic criteria of other culture-bound diseases, which is the traits of not outstanding mood(or affect) than other neurotic disorders. Conclusion: As diagnostic criteria of neurasthenia varies, the significance of this variation is controversial, but could be the paragon of other culture-bound diseases.

• Journal of Veterinary Clinics
• /
• v.10 no.1
• /
• pp.1-10
• /
• 1993

To investigate the availability of hamster test in assaying the fertilizing capacity of dog sperm and the effect of canine sperm motility on sperm binding and penetration, semen were collected from four dogs(three dogs had been proven to be fertile and one dog to be subfertile during the past two years) and then preserved in BWW(Biggers, Whitten, Whittingham) medium for about 20 hours. The semen were given each different treatment according to the experimental design and coincubated with zona-free hamster ova for 5 hours. The ova were stained by lacmoid and examined under phase contrast microscope to investigate the rates of ova bound with sperm(sperm binding) and ova penetrated by sperm(penetration), and also numbers of both bound and penetrated sperm per ovum. In comparison between fertile dogs and a subfertile dog, the rate of sperm binding was higher in fertile dogs than the subfertile dog(p<0.01, p<0.05). The number of bound sperm per ovum was considerably higher in a fertile dog than the subfertile dog((p<0.01), and also difference of number of the bound sperm was obtained among the fertile dogs(p<0.01, p<0.05). The rate of penetration as well as the number of penetrated sperm per ovum was higher in the fertile dogs than the subfertile dog(p<0.01, p<0.05). In fertile dogs. the canine semen preserved at 4$^{\circ}C$ for 18 to 22 hours showed from 30 to 80% motility at Insemination, however, no difference in hamster test was obtained according to different degree of sperm motility. These results indicated that hamster test would be of avail in assaying the fertilizing capacity of dog sperm.

• Bulletin of the Korean Chemical Society
• /
• v.2 no.2
• /
• pp.60-66
• /
• 1981

The hypothesis that three classes of water exist in hydrogels, namely X water (free water-like), Z-water (bound water-like), and Y water (interfacial water-like), has been verified and generally accepted. To further check the validity of this hypothesis and to study the nature of X, Y, and Z water as conformation changes, several experiments have been done using Tactic Poly(2-hydroxyethyl methacrylate) (P-HEMA) gels. Thermal expansively data for tactic P-HEMA gel was obtained. In each case of isotactic and syndiotactic P-HEMA, the higher water content gels showed an extremely sharp volume change at $0^{\circ}C$, indicating the presence of normal free water-like. Lower water content gels showed no anomalous change in thermal expansion, indicating that the water is bound water-like. The medium water content gels exhibited intermediate behavior. These results were also confirmed by bulk gel conductivity measurments. The differential scanning calorimeter(DSC) experiment was simply introduced to further verify the bound water-like quantities which was obtained by the method of dilatometry and specific conductivity. Observing the amounts of X, Y, and Z water with the change of tacticity, the similar content of bound water-like may be due to the same primary structure of isotactic and syndiotactic polymer and the difference in free and interfacial water-like content may be due to the difference in secondary and tertiary structure of tactic polymer. Therefore, as the polymer conformation varies, the free and interfacial water-like content will be varied. In order to demonstrate these concepts, Russel et al.'s CPK space-filling molecular models of isotactic and syndiotactic P-HEMA was utilized.

• Elastomers and Composites
• /
• v.40 no.1
• /
• pp.29-36
• /
• 2005

Mixing condition and procedure affect properties or a filled rubber compound such as filler dispersion, viscosity, and bound rubber formation. Influence of separate load of styrene-butadiene rubber (SBR) and acrylonitrile-butadiene rubber (NBR) on properties or silica-filled SBR compounds containing NBR was studied. Cure time and cure rate became faster as NBR content increased. The crosslink density increased with increase in the NBR content. The bound rubber content also increased as the NBR content increased. NBR content of the bound rubber was higher than that of the compounded rubber. The bound rubber content was higher when SBR and NBR were loaded separately than when loading simultaneously. The cure time and cure rate were slower for the separate load than for the simultaneous one. The crosslink density was also lower for the former case than for the latter one.

• Journal of Veterinary Science
• /
• v.22 no.3
• /
• pp.38.1-38.17
• /
• 2021

Background: The feline viral rhinotracheitis, calicivirus, and panleukopenia (FVRCP) vaccine, prepared from viruses grown in the Crandell-Rees feline kidney cell line, can induce antibodies to cross-react with feline kidney tissues. Objectives: This study surveyed the prevalence of autoantibodies to feline kidney tissues and their association with the frequency of FVRCP vaccination. Methods: Serum samples and kidneys were collected from 156 live and 26 cadaveric cats. Antibodies that bind to kidney tissues and antibodies to the FVRCP antigen were determined by enzyme-linked immunosorbent assay (ELISA), and kidney-bound antibody patterns were investigated by examining immunofluorescence. Proteins recognized by antibodies were identified by Western blot analysis. Results: The prevalences of autoantibodies that bind to kidney tissues in cats were 41% and 13% by ELISA and immunofluorescence, respectively. Kidney-bound antibodies were observed at interstitial cells, apical border, and cytoplasm of proximal and distal tubules; the antibodies were bound to proteins with molecular weights of 40, 47, 38, and 20 kDa. There was no direct link between vaccination and anti-kidney antibodies, but positive antibodies to kidney tissues were significantly associated with the anti-FVRCP antibody. The odds ratio or association in finding the autoantibody in cats with the antibody to FVRCP was 2.8 times higher than that in cats without the antibody to FVRCP. Conclusions: These preliminary results demonstrate an association between anti-FVRCP and anti-cat kidney tissues. However, an increase in the risk of inducing kidney-bound antibodies by repeat vaccinations could not be shown directly. It will be interesting to expand the sample size and follow-up on whether these autoantibodies can lead to kidney function impairment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.113-119
• /
• 2004

Exponentiation is widely used in practical applications related with cryptography, and as the discrete log is easily solved in case of a low exponent n, a large exponent n is needed for a more secure system. However. since the time complexity for exponentiation algorithm increases in proportion to the n figure, the development of an exponentiation algorithm that can quickly process the results is becoming a crucial problem. In this paper, we propose a parallel exponentiation algorithm which can reduce the number of rounds with a fixed number of processors, where the field elements are in GF($2^m$), and also analyzed the round bound of the proposed algorithm. The proposed method uses window method which divides the exponent in a particular bit length and make idle processors in window value computation phase to multiply some terms of windows where the values are already computed. By this way. the proposed method has improved round bound.