• Title/Summary/Keyword: AnV

Search Result 14,810, Processing Time 0.037 seconds

ON $H_v$-SUBGROUPS AND ANTI FUZZY $H_v$-SUBGROUPS

  • Davvaz, B.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.1
    • /
    • pp.181-190
    • /
    • 1998
  • In this paper we define the concept of anti fuzzy $H_v$-subgroup of an $H_v$ -group and prove a few theorems concerning this concept. We also obtain a necessary and sufficient condition for a fuzzy subset of an $H_v$-group to be an anti fuzzy $H_v$ -subgroup. We also abtain a relation between the fuzzy $H_v$-subgroups and the and the anti fuzzy $H_v$-subgroup.

SOME PROPERTIES ON f-EDGE COVERED CRITICAL GRAPHS

  • Wang, Jihui;Hou, Jianfeng;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.357-366
    • /
    • 2007
  • Let G(V, E) be a simple graph, and let f be an integer function on V with $1{\leq}f(v){\leq}d(v)$ to each vertex $v{\in}V$. An f-edge cover-coloring of a graph G is a coloring of edge set E such that each color appears at each vertex $v{\in}V$ at least f(v) times. The f-edge cover chromatic index of G, denoted by ${\chi}'_{fc}(G)$, is the maximum number of colors such that an f-edge cover-coloring of G exists. Any simple graph G has an f-edge cover chromatic index equal to ${\delta}_f\;or\;{\delta}_f-1,\;where\;{\delta}_f{=}^{min}_{v{\in}V}\{\lfloor\frac{d(v)}{f(v)}\rfloor\}$. Let G be a connected and not complete graph with ${\chi}'_{fc}(G)={\delta}_f-1$, if for each $u,\;v{\in}V\;and\;e=uv{\nin}E$, we have ${\chi}'_{fc}(G+e)>{\chi}'_{fc}(G)$, then G is called an f-edge covered critical graph. In this paper, some properties on f-edge covered critical graph are discussed. It is proved that if G is an f-edge covered critical graph, then for each $u,\;v{\in}V\;and\;e=uv{\nin}E$ there exists $w{\in}\{u,v\}\;with\;d(w)\leq{\delta}_f(f(w)+1)-2$ such that w is adjacent to at least $d(w)-{\delta}_f+1$ vertices which are all ${\delta}_f-vertex$ in G.

A Study of Epidemiology and Pathogenicity of Vibrio parahaemolyticus - III. Isolation of Vibrio parahaemolyticus around seashore of Masan (장염(腸炎) 비브리오의 역학(疫學) 및 병원성(病原性)에 관(關)한 연구(硏究) - III. 마산시(馬山市) 연안(沿岸)에서의 분리상황(分離狀況))

  • Jeong, Heung-Mo;Suh, Inn-Soo
    • The Journal of the Korean Society for Microbiology
    • /
    • v.16 no.1
    • /
    • pp.7-12
    • /
    • 1981
  • This study was undertaken to know the distribution of V. parahaemolyticus in sea fishes feeding at an aquarium and from kitchen environments of restaurants located in Masan, Kyungnam, during May and June, 1979. Results obtained are as follows: The detection rate of V. parahaemolyticus was calculated as 21.1% from 1103 specimens; as 38.1% from 336 sea fishes and as 10.4% from 675 kitchen environments. The detection rate of V. parahaemolyticus were 49.6% from 127 sea fishes feeded at an aquarium contaminated by V. parahaemolyticus and 31.1% from 209 sea fishes feeded at an aquarium not contaminated by V. parahaemolyticus. The detection rate of V. parahaemolyticus were shown as 14.6% from 261 kitchen environments having an V. parahaemolyticus contaminated aquarium but as 7.7% from 414 kitchen environments of restaurants having an aquarium not contaminated by V. parahaemolyticus.

  • PDF

An Extended Numerical Calibration Method for an Electrochemical Probe in Thin Wavy Flow with Large Amplitude Waves

  • Park, Ki-Yong;No, Hee-Cheon
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1998.05a
    • /
    • pp.553-558
    • /
    • 1998
  • The calibrating method for an electrochemical Probe, neglecting the effect of the normal velocity on the mass transport, can cause large errors when applied to the measurement of wall shear rates in thin wavy flow with large amplitude waves. An extended calibrating method is developed to consider the contributions of the normal velocity. The inclusion of the turbulence-induced normal velocity term is found to have a negligible effect on the mass transfer coefficient. The contribution wave-induced normal velocity can be classified on the dimensionless parameter V. If V above a critical value of V, $V_{crit}$, the effects of the wave-induced normal velocity become larger with an increase in V. IF V its effects negligible for V < $V_{crit}$. The unknown shear rate is numerically determined by solving the 2-D mass transport equation inversely. The president inverse method can predict the unknown shear rate more accurately in thin wavy flow with large amplitude waves than the previous method.

  • PDF

Peptide Micelles for Anti-cancer Drug Delivery in an Intracranial Glioblastoma Animal Model

  • Yi, Na;Lee, Minhyung
    • Bulletin of the Korean Chemical Society
    • /
    • v.35 no.10
    • /
    • pp.3030-3034
    • /
    • 2014
  • Bis-chloroethylnitrosourea (BCNU) is currently used as an anti-cancer drug for glioblastoma therapy. In this study, BCNU was loaded into the hydrophobic cores of R3V6 amphiphilic peptide micelles for efficient delivery into brain tumors. The scanning electron microscope (SEM) study showed that the BCNU-loaded R3V6 peptide micelles (R3V6-BCNU) formed spherical micelles. MTT assay showed that R3V6-BCNU more efficiently induced cell death in C6 glioblastoma cells than did BCNU. In the Annexin V assay, R3V6-BCNU more efficiently induced apoptosis than did BCNU alone. Furthermore, the results showed that R3V6 was not toxic to cells. The positive charges of the R3V6 peptide micelles may facilitate the interaction between R3V6-BCNU and the cellular membrane, resulting in an increase in cellular uptake of BCNU. In vivo evaluation with an intracranial glioblastoma rat model showed that R3V6-BCNU more effectively reduced tumor size than BCNU alone. The results suggest that R3V6 peptide micelles may be an efficient carrier of BCNU for glioblastoma therapy.

Thereshold Switching into Conductance Quantized Sttes in V/vamorphous- $V_{2}$ $O_{5}$/V Thin Film Devices (V/비정질- $V_{2}$ $O_{5}$ /lV 박막소자에서의 양자화된 컨덕턴스 상태로의 문턱 스위칭)

  • 윤의중
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.34D no.12
    • /
    • pp.89-100
    • /
    • 1997
  • This paper investigated a new type of low voltage threshold switch (LVTS). As distinguished from the many other types of electronic threshold switches, the LvTS is ; voltage controlled, occurs at low voltages ($V_{2}$ $O_{5}$lV devices. The average low threshold voltage < $V_{LVT}$>=218 mV (standard deviation =24mV~kT/q, where T=300K), and was independent of the device area (x100) and amorphous oxide occurred in an ~22.angs. thick interphase of the V/amorphous- $V_{2}$ $O_{5}$ contacts. At $V_{LVT}$ there was a transition from an initially low conductance (OFF) state into a succession of quantized states of higher conductance (ON). The OFF state was spatically homogeneous and dominated by tunneling into the interphase. The ON state conductances were consistent with the quantized conductances of ballistic transport through a one dimensional, quantum point contact. The temeprature dependence of $V_{LVT}$, and fit of the material parameters (dielectric function, barrier energy, conductivity) to the data, showed that transport in the OFF and ON states occurred in an interphase with the characteristics of, respectively, semiconducting and metallic V $O_{2}$. The experimental results suggest that the LVTS is likely to be observed in interphases produced by a critical event associated with an inelastic transfer of energy.rgy.y.rgy.

  • PDF

SHARP CONDITIONS FOR THE EXISTENCE OF AN EVEN [a, b]-FACTOR IN A GRAPH

  • Cho, Eun-Kyung;Hyun, Jong Yoon;O, Suil;Park, Jeong Rye
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.31-46
    • /
    • 2021
  • Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

A Study of on Minimizing the Number of V\ulcorner/V\ulcorner Pins in Simultaneous Switching Environment (동시 스위칭 환경에서 V\ulcorner/V\ulcorner Pin 수의 최소화를 위한 연구)

  • Bae, Yun-Jeong;Lee, Yun-Ok;Kim, Jae-Ha;Kim, Byeong-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2179-2187
    • /
    • 2000
  • This paper provides a heuristic analysis technique which determines an optimal number of V\ulcorner/V\ulcorner pads meeting allowable Simultaneous Switching Noise(SN) budget, early in the design phase. Until now, in determining the number of V\ulcorner/V\ulcorner pads, designers had to simulate packaging models case by case in the design phase or roughly allocate the power/ground pins in an inaccurate way according to typical design rules. However, due to the high density and frequency trends of IC technologies, the V\ulcorner/V\ulcorner pads allocation method can affect an adverse effect on IC operations, which requires more accurate and efficient methods be devised. Thus, this paper proposes an analytic V\ulcorner/V\ulcorner pads calculation method that gives a practical help for packaging designs early in the design phase. The proposed method is applied to a design example of a 1/8x208 pin plastic quad flat package (PQFP) and the results are verified through simulation using HSPICE.

  • PDF

[r, s, t; f]-COLORING OF GRAPHS

  • Yu, Yong;Liu, Guizhen
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.1
    • /
    • pp.105-115
    • /
    • 2011
  • Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.