• Title/Summary/Keyword: Number of 1's

Search Result 14,498, Processing Time 0.055 seconds

AN EXTENSION OF GENERALIZED EULER POLYNOMIALS OF THE SECOND KIND

  • Kim, Y.H.;Jung, H.Y.;Ryoo, C.S.
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.465-474
    • /
    • 2014
  • Many mathematicians have studied various relations beween Euler number $E_n$, Bernoulli number $B_n$ and Genocchi number $G_n$ (see [1-18]). They have found numerous important applications in number theory. Howard, T.Agoh, S.-H.Rim have studied Genocchi numbers, Bernoulli numbers, Euler numbers and polynomials of these numbers [1,5,9,15]. T.Kim, M.Cenkci, C.S.Ryoo, L. Jang have studied the q-extension of Euler and Genocchi numbers and polynomials [6,8,10,11,14,17]. In this paper, our aim is introducing and investigating an extension term of generalized Euler polynomials. We also obtain some identities and relations involving the Euler numbers and the Euler polynomials, the Genocchi numbers and Genocchi polynomials.

Flow Field Analysis of Smoke in a Rectangular Tunnel

  • Lee, Yong-Ho;Park, Sang-Kyoo
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.5
    • /
    • pp.679-685
    • /
    • 2009
  • In order to simulate a smoke or poisonous gas emergency in a rectangular tunnel and to investigate a better way to exhaust the smoke, the characteristics of smoke flow have been analyzed using flow field data acquired by Particle Image Velocimetry(PIV). Olive oil has been used as tracer particles with the kinematic viscosity of air, $1.51{\times}10^{-5}\;m^2/s$. The investigation has done in the range of Reynolds number of 1600 to 5333 due to the inlet velocities of 0.3 m/s to 1 m/s respectively. The average velocity vector and instantaneous kinematic energy fields with respect to the three different Reynolds numbers are comparatively discussed by the Flow Manager. In general, the smoke flow becomes more disorderly and turbulent with the increase of Reynolds number. Kinematic energy in the measured region increases with the increase of Reynolds number while decreasing at the leeward direction about the outlet region.

MONOPHONIC PEBBLING NUMBER OF SOME NETWORK-RELATED GRAPHS

  • AROCKIAM LOURDUSAMY;IRUDAYARAJ DHIVVIYANANDAM;SOOSAIMANICKAM KITHER IAMMAL
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.1
    • /
    • pp.77-83
    • /
    • 2024
  • Chung defined a pebbling move on a graph G as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The monophonic pebbling number guarantees that a pebble can be shifted in the chordless and the longest path possible if there are any hurdles in the process of the supply chain. For a connected graph G a monophonic path between any two vertices x and y contains no chords. The monophonic pebbling number, µ(G), is the least positive integer n such that for any distribution of µ(G) pebbles it is possible to move on G allowing one pebble to be carried to any specified but arbitrary vertex using monophonic a path by a sequence of pebbling operations. The aim of this study is to find out the monophonic pebbling numbers of the sun graphs, (Cn × P2) + K1 graph, the spherical graph, the anti-prism graphs, and an n-crossed prism graph.

Kth order Newton-Raphson's Floating Point Number Nth Root (K차 뉴톤-랍손 부동소수점수 N차 제곱근)

  • Cho, Gyeong-Yeon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.1
    • /
    • pp.45-51
    • /
    • 2018
  • In this paper, a tentative Kth order Newton-Raphson's floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Newton-Raphson root algorithm. Using the proposed algorithm, $F^{-1/N}$ and $F^{-(N-1)/N}$ can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration and iterates only until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.

Natural Convection from a Horisontal Conducting Tube with One Vertical Axial Fin. (단일수직(單一垂直)한 축방향(軸方向)의 핀을 가진 수평전도관(水平傳導管)으로 부터의 자연대류(自然對流))

  • Chung, H.S.;Kwon, S.S.
    • Solar Energy
    • /
    • v.6 no.1
    • /
    • pp.60-69
    • /
    • 1986
  • Two-dimensional finite difference numerical analysis is used to study conjugate natural convection heat transfer from a horizontal conducting tube with one vertical axial fin. By increasing dimensionless fin length ($L_F$), the mean total Nusselt number of the upward fin is slightly less than that of the downward fin at $L_F\;{\le}\;0.18$ and is higher than that of the downward fin at $L_F\;>\;0.18$. However comparing the upward fin and the downward fin with the no fin, the mean total Nusselt numbers of downward fin and upward fin at $L_F=0.30$ are increased approximately 4.01% and 5.51%, respectively. As Rayleigh number, Prandtl number and Biot number increase, the mean total and the mean tube Nusselt numbers are increased, but as wall thickness increases, the mean total and the mean tube Nusselt numbers are decreased. As the fin conduction parameter increases, the mean total Nusselt number is slightly increased because of increasing the mean fin Nusselt number.

  • PDF

Simulation Studies on Asymptotic Approximations Analysis of M/M/s and M/D/s Queues (M/M/s와 M/D/s 대기행렬의 점근 근사법 분석을 위한 시뮬레이션 연구)

  • Jinho Lee
    • Journal of Service Research and Studies
    • /
    • v.14 no.3
    • /
    • pp.172-187
    • /
    • 2024
  • This paper deals with asymptotic approximations analysis of M/M/s and M/D/s queues. For M/M/s queue, we observe "economies of scale" under the fixed utilization ρ and the fixed probability α that customer waits in system, how the average system size vary according to the number of servers s increasing. Simulation results show that as s increases, the number of servers who are idling increases, that is, the slack n-E[Qn] diverges. In addition, through changing the waiting probability α under the M/M/s system, α was not highly sensitive to the behavior of the system size. And, it is shown that using ${\rho}_n\,=\,1-k/\sqrt{n}$ to handle heavy-traffic regime is only appropriate for k = 1 by observing the effect on the performance of the system with different values of k. For the M/D/s queue, two approximations are used to evaluate the expected system size under the fixed ρ and α. Simulations and comparison of these two approximations show that Cosmetatos' approximation performs quite well when the number of servers is small and traffic intensity is heavy, but it overestimates the true value for the large number of servers. Meanwhile, the modified approximation gives good results for the steady state count of the system although the number of servers grows large.

Growth Characteristics and Yield of Sweet Potato Cultivars between Virus-free and Farmer's Slips in Late Season Cultivation (고구마 바이러스 무병묘와 농가묘의 만기재배에서 품종 간 생육 및 수량특성)

  • Yoo, Kyoung-Ran;Lee, Seung-Yeob
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.58 no.1
    • /
    • pp.43-49
    • /
    • 2013
  • This work was conducted to obtain some information about stable production of high quality seed-tubers in the late season cultivation of virus-free sweet potato [Ipomoea batatas (L.) Lam.]. Growth characteristics and storage root yield between virus-free and farmer's slips in 9 cultivars were investigated using black-film vinyl mulching cultivation with $75{\times}25cm$ planting density on July 10. At 30 days after planting, vine length, vine diameter, number of node, and number of branch in virus-free slips were significantly increased than those in farmer's slips. The vine growth was significantly different among cultivars, and vine elongation was excellent in 'Kogeonmi', 'Shincheonmi', 'Shinhwangmi', 'Shinyulmi', and 'Yeonhwangmi' compared to the other cultivars. At 110 days after planting, vine length, vine diameter, number of node, number of branch, and fresh weight were significantly different among cultivars, but no significant differences between virus-free and farmer's slips were seen except number of node. Total yield in virus-free slips was increased by 12-49% among cultivars than that in farmer's slips. The mean yields between virus-free and farmer's slips were 1,625 kg/10a and 1,230 kg/10a, respectively, and it was significantly different between virus-free and farmer's slips. Percentage of marketable storage root in virus-free slips was 65.6%, and it was significantly higher than 57.8% in farmer's slips. Marketable yields ($40g{\leq}$) between virus-free and farmer's slips were 1,067 kg/10a and 710 kg/10a, respectively. Marketable yield in 'Shincheonmi', 'Shinyulmi' and 'Shinzami' was more than 1,300 kg/10a, and these cultivars showed to be highly adaptable for the late-season cultivation among 9 tested cultivars.

Analysis of Train Operation Obstacle Using Number of Failures and Delay Time of Electric Door System (전기식 도어시스템의 고장건수 및 지연시간을 활용한 열차운행장애 분석)

  • Lee, Bon Hyung;Kim, Doo-Hyun;Kim, Sung-Chul
    • Journal of the Korean Society of Safety
    • /
    • v.35 no.1
    • /
    • pp.12-17
    • /
    • 2020
  • This paper analyzes functions of component parts of D-Urban Railway's door system along with operation obstacle risks on frequency(the number of occurrences/year) and severity(delay time/the number of occurrences). Based on this, the paper presents improvements and current system's problems after obstacle risks of EMU and door system are appled. The obstacle of door system causes corrosion of main parts such as DCU due to heat problem of operation environment, problems of maintenance methods and deterioration. DCUs on PCBs with more than 50% pattern corrosion cause problems. Even though the number of door system's obstacle occurrences for the last 5 years is 42, along with 104 minutes of operation obstacle, EMU operation obstacle risk is low(Level 1), which indicates there is limit in matrix of railway risks presented by the standard of railway safety management system. Therefore, it is necessary to have railway risk matrix suitable for the field. Finally, the paper deducts the obstacle risks through frequency and severity. Since 2017 when the risks of EMU and door system's obstacle, that of EMU has been 24(47% reduced) and that of door system has been average 9.5 per year(23% reduced).

Enhanced ART1 Algorithm for the Recognition of Student Identification Cards of the Educational Matters Administration System on the Web (웹 환경 학사관리 시스템의 학생증 인식을 위한 개선된 ART1 알고리즘)

  • Park Hyun-Jung;Kim Kwang-Baek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.333-342
    • /
    • 2005
  • This paper proposes a method, which recognizes student's identification card by using image processing and recognition technology and can manage student information on the web. The presented scheme sets up an average brightness as a threshold, based on the brightest Pixel and the least bright one for the source image of the ID card. It is converting to binary image, applies a horizontal histogram, and extracts student number through its location. And, it removes the noise of the student number region by the mode smoothing with 3$\times$3 mask. After removing noise from the student number region, each number is extracted using vertical histogram and normalized. Using the enhanced ART1 algorithm recognized the extracted student number region. In this study, we propose the enhanced ART1 algorithm different from the conventional ART1 algorithm by the dynamical establishment of the vigilance parameter. which shows a tolerance limit of unbalance between voluntary and stored patterns for clustering. The Experiment results showed that the recognition rate of the proposed ART1 algorithm was improved much more than that of the conventional ART1 algorithm. So, we develop an educational matters administration system by using the proposed recognition method of the student's identification card.

  • PDF

A Study on the Projected Workforce of Advanced Oncology Certified Nurses (종양전문간호사인력 수요추계에 관한 연구)

  • Hwang, Sung-Ho;Oh, Pok-Ja
    • Asian Oncology Nursing
    • /
    • v.4 no.1
    • /
    • pp.49-61
    • /
    • 2004
  • Purpose: The purpose of this study was to suggest the projected manpower of oncology nurses & Advanced oncology certified nurses needed in the future. Method: Need models, ratio models and expert opinion were used for projecting the number of oncology nurses & Advanced oncology certified nurses. Resul: 1. The demand for the oncology nurses was estimated 6,043 in the year 2003, 6,548 in the year 2005, and 4,556 in the year 2010. 2. The demand range of the advanced oncology certified nurses centering on the number of hospitalized patients were estimated 358-538 in the year 2003, 388-583 in the year 2005, and 448-672 in the year 2010. 3. The demand range of the middle and long term advanced oncology certified nurses centering on the number of sickbed were estimated 507-787 in the year 2005, 523-810 in the year 2010, and 540-837 in the year 2020. 4. The demand range of the advanced oncology certified nurses centering on the number of organizations were estimated 374 in the year 2003, 399 in the year 2005, 410 in the year 2010. 5. The total demand range, concerning the numbers of hospitalized patients, hospital bed, and organizations are estimated 358-538 in the year 2003, 388-787 in the year 2005, 428-840 in the year 2010, and 540-837 in the year 2020. 6. In the demand of developed country's level oncology nurses are OCN's level 1,495, AOCN's level 102 in the year 2003, OCN's level 1,613, AOCN's level 111 in the year 2005, OCN's level 1,879, AOCN's level 128 in the year 2010 in case of the United States, and in case of Canada, 765 in the year 2003, 826 in the year 2005, and 956 in the year 2010.

  • PDF