• Title/Summary/Keyword: $S_t$ number

Search Result 2,938, Processing Time 0.031 seconds

Spin-up for stratified fluid in a cylinder with time-dependent rotation rate (시간적으로 변하는 각속도를 가지는 실린더 내부의 비균질 유체의 스핀업)

  • Kim, K.S.;Hyun, J.M.
    • 유체기계공업학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.323-326
    • /
    • 2006
  • Numerical solutions for spin-up problem of a thermally stratified fluid in a cylinder with an insulating sidewall and time-dependent rotation rate are presented. Detailed results are given for aspect ratio of O(1), fixed Ekman number $10-^{4}$, Rossby number 0.05 and Prandtl number O(1). Angular velocity of a cylinder wall changes with following formula, $\Omega_f=\Omega_i+\Delta\Omega[1-\exp(-t/t_c)]$. Here, this $t_c$, value, which is very significant in present study, represents that how fast/slow the angular velocity of the cylinder wall reaches final angular velocity. The normalized azimuthal velocity and meridional flow plots for several tc value which cover ranges of the stratification parameter S(1 ~ 10) are presented. The role of viscous-diffusion and Coriolis term in present study is examined by diagnostic analysis of the azimuthal velocity equation.

  • PDF

ON THE SIGNED TOTAL DOMINATION NUMBER OF GENERALIZED PETERSEN GRAPHS P(n, 2)

  • Li, Wen-Sheng;Xing, Hua-Ming;Sohn, Moo Young
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.6
    • /
    • pp.2021-2026
    • /
    • 2013
  • Let G = (V,E) be a graph. A function $f:V{\rightarrow}\{-1,+1\}$ defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, ${\gamma}^s_t(G)$, is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen graphs P(n, 2) and prove that for any integer $n{\geq}6$, ${\gamma}^s_t(P(n,2))=2[\frac{n}{3}]+2t$, where $t{\equiv}n(mod\;3)$ and $0 {\leq}t{\leq}2$.

IoT Based Distributed Intelligence Technology for Hyper-Connected Space (IoT기반 초연결 공간 분산지능 기술)

  • Park, J.H.;Son, Y.S.;Park, D.H.;Cho, J.M.;Bae, M.N.;Han, M.K.;Lee, H.K.;Choi, J.C.;Kim, H.;Hwang, S.K.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.1
    • /
    • pp.11-19
    • /
    • 2018
  • IoT is used not only as a technical terminology but also as a paradigm representation. As the number of IoT devices spread tremendously throughout the world, they are able to be located anywhere,recognize their environment, and achieve adaptable reactions. All market investigation agencies expect the number of IoT devices to reach tens to hundreds of billions in number. They also expect various technical problems owing to the huge number of connected things and data that will emerge during the AI era. The decentralization of centralized computing for AI is the one of the technical solutions to such problems, and the computing roles for AI will be soon distributed into the things, which can be located anywhere. In this article, the traditional distributed intelligence and its current research activities are introduced, and the next distributed intelligence target for the IoT 2.0 era is briefly touched upon using the keyword Socio-Things.

BOUNDS ON PROBABILITY FOR THE OCCURRENCE OF EXACTLY r, t OUT OF m, n EVENTS

  • Lee, Min-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.2
    • /
    • pp.393-401
    • /
    • 1997
  • Let $A_1,A_2,\cdots,A_m$ and $B_1,B_2,\cdots,B_n$ be two sequences of events on a given probability space. Let $X_m$ and $Y_n$, respectively, be the number of those $A_i$ and $B_j$, which occur we establish new upper and lower bounds on the probability $P(X=r, Y=t)$ which improve upper bounds and classical lower bounds in terms of the bivariate binomial moment $S_{r,t},S_{r+1,t},S_{r,t+1}$ and $S_{r+1,t+1}$.

  • PDF

Self-esteem, Parent-adolescent Communication, Friend's Sexual Attitude and Sexual Permissiveness in College Students (대학생의 자아존중감, 부모-자녀간 의사소통, 친구집단 성태도와 성허용성)

  • Jang, Su-Hyun;Lee, Sung-Hee
    • Women's Health Nursing
    • /
    • v.17 no.4
    • /
    • pp.395-406
    • /
    • 2011
  • Purpose: This study was done to identify factors that affect sexual permissiveness in college students. Methods: A descriptive design was used with 380 college students who completed a questionnaire about self-esteem, parents-adolescent communication, friend's sexual attitude and sexual permissiveness. Results: The sexual permissiveness showed significant differences for the variable: grade (F=0.51, p=.002), gender (t=7.28, p<.001), age (F=14.72, p<.001), religion (t=4.97, p<.001), residence type (F=4.75, p=.009), number of call with parents (F=3.56, p=.030), number of viewing pornographic video (F=36.05, p<.001), number of viewing pornographic magazine (F= 47.90, p<.001), status of dating (t=3.62, p<.001), number of sexual intercourse (F=14.51, p<.001), and experience of sexual intercourse (t=13.00, p<.001). There was a positive correlation between the friend's sexual attitude and sexual permissiveness (r=.64, p<.001). The variables such as friend's sexual attitude, experience of sexual intercourse, the number of watching pornographic video, educational system, religion, and the number of calls with parent explained 52% of the variance in sexual permissiveness. Conclusion: The results of this study indicate that it is necessary to develop sexual education program for college students considering their level of sexual permissiveness and their friend's sexual attitude.

Spectral Properties of k-quasi-class A(s, t) Operators

  • Mecheri, Salah;Braha, Naim Latif
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.3
    • /
    • pp.415-431
    • /
    • 2019
  • In this paper we introduce a new class of operators which will be called the class of k-quasi-class A(s, t) operators. An operator $T{\in}B(H)$ is said to be k-quasi-class A(s, t) if $$T^{*k}(({\mid}T^*{\mid}^t{\mid}T{\mid}^{2s}{\mid}T^*{\mid}^t)^{\frac{1}{t+s}}-{\mid}T^*{\mid}^{2t})T^k{\geq}0$$, where s > 0, t > 0 and k is a natural number. We show that an algebraically k-quasi-class A(s, t) operator T is polaroid, has Bishop's property ${\beta}$ and we prove that Weyl type theorems for k-quasi-class A(s, t) operators. In particular, we prove that if $T^*$ is algebraically k-quasi-class A(s, t), then the generalized a-Weyl's theorem holds for T. Using these results we show that $T^*$ satisfies generalized the Weyl's theorem if and only if T satisfies the generalized Weyl's theorem if and only if T satisfies Weyl's theorem. We also examine the hyperinvariant subspace problem for k-quasi-class A(s, t) operators.

Convective Heat Transfer in a Channel with Isothermal Rectangular Beams (등온사각빔이 부착된 채널에서의 대류열전달)

  • Ree, J.S.;Kwon, S.S.
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.7 no.1
    • /
    • pp.63-72
    • /
    • 1995
  • Convective heat transfer in a two-dimensional horizontal and vertical channel with isothermal rectangular beams attached to one adiabatic wall is investigated from the numerical solution of Navier-Stokes and energy equations. The solutions have been obtained for dimensionless beam spacings, S/L=1~4, aspect ratios of beam, H/B=0.25~4, Reynolds numbers, Re=50~1000 and Grashof numbers, $Gr=0{\sim}5{\times}10^4$. The total mean Nusselt number, Nu_T for horizontal and vertical channels shows same value at Gr=0. As Gr increases, Nu_T for horizontal channel increases, but Nu_T for vertical channel shows similar value at S/L=2, H/B=0.25, Re=100. The total mean Nusselt number for horizontal channel is higher than that for vertical channel. As H/B increases, $Nu_T$ for both channel decrease at $Gr=10^4$, Re=100.

  • PDF

Adaptive Diagnosis for Over-d Fault Diagnosis of Hypercube (하이퍼큐브의 Over-d 결함에 대한 적응적 진단)

  • Kim Dong-Gun;Lee Kyung-Hee;Cho Yoon-Ki;Kim Jang-Hwan;Rhee Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5C
    • /
    • pp.483-489
    • /
    • 2006
  • Somani and Peleg proposed t/k-diagnosable system to diagonse more faults than t(dimension) by allowing upper bounded few number of units to be diagnosed incorrectly. Kranakis and Pelc showed that their adaptive diagnosis algorithm was more efficient than that of any previous ones, assuming that the number of faults does not exceed the hypercube dimension. We propose an adaptive diagnosis algorithm using the idea of t/k-diagnosable system on the basis of that of Kranakis and Pelc's. When the number of faults exceeds t, we allow a fault(k=1, 2, 3) to be diagnosed incorrectly. Based on this idea, we find that the performance of the proposed algorithm is nearly as efficient as any previously known strategies and detect above about double faults.

A Distributed Algorithm to Update Spanning Tree and Strongly-Connected Components (생성트리와 강결합요소의 갱신을 위한 분산 알고리즘)

  • Park, Jeong-Ho;Park, Yun-Yong;Choe, Seong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.299-306
    • /
    • 1999
  • Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network. This paper proposes a distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(n'log n'+ (n'+s+t)) and O(n'logn') respectively where n'is the number of processors in the network after the topology change, s is the number of added links, and t is the total number of links in the strongly connected component (of the network before the topology change) including the deleted links.

  • PDF

Experimental Proof for Symmetric Ramsey Numbers (대칭 램지 수의 실험적 증명)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.3
    • /
    • pp.69-74
    • /
    • 2015
  • This paper offers solutions to unresolved $43{\leq}R(5,5){\leq}49$ and $102{\leq}R(6,6){\leq}165$ problems of Ramsey's number. The Ramsey's number R(s,t) of a complete graph $k_n$ dictates that n-1 number of incidental edges of a arbitrary vertex ${\upsilon}$ is dichotomized into two colors: (n-1)/2=R and (n-1)/2=B. Therefore, if one introduces the concept of distance to the vertex ${\upsilon}$, one may construct a partite graph $K_n=K_L+{\upsilon}+K_R$, to satisfy (n-1)/2=R of {$K_L,{\upsilon}$} and (n-1)/2=B of {${\upsilon},K_R$}. Subsequently, given that $K_L$ forms the color R of $K_{s-1)$, $K_S$ is attainable. Likewise, given that $K_R$ forms the color B of $K_{t-1}$, $K_t$ is obtained. By following the above-mentioned steps, $R(s,t)=K_n$ was obtained, satisfying necessary and sufficient conditions where, for $K_L$ and $K_R$, the maximum distance should be even and incidental edges of all vertices should be equal are satisfied. This paper accordingly proves R(5,5)=43 and R(6,6)=91.