• Title/Summary/Keyword: representation numbers

Search Result 126, Processing Time 0.025 seconds

Fast Converging Correction Current for the Physical Optics Edge Diffraction by a dielectric Wedge (유전체 쐐기에 의한 물리광학해를 수정하기 위한 새 로운 급수)

  • 전재영;서종화;나정웅
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.877-880
    • /
    • 1999
  • A rigorous formulation is suggested〔l,2,3〕 in solving the scattering of plane waves by a dielectric wedge. Correcting surface currents are expanded in a Neumann series of fractional orders to meet the edge condition of static limit〔4〕. For the better converging series, the modified Neumann series satisfying the static limit edge condition and the radiation condition are suggested here for the surface currents having two different wave numbers of air and dielectric〔4〕. This representation gives accurate solutions over the whole region including the grazing incidence of the plane waves upon the dielectric wedge of large permittivities.

  • PDF

Numerical method of hyperbolic heat conduction equation with wave nature (파동특성을 갖는 쌍곡선형 열전도방정식에 관한 수치해법)

  • 조창주
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.22 no.5
    • /
    • pp.670-679
    • /
    • 1998
  • The solution of hyperbolic equation with wave nature has sharp discontinuties in the medium at the wave front. Difficulties encounted in the numrtical solution of such problem in clude among oth-ers numerical oscillation and the representation of sharp discontinuities with good resolution at the wave front. In this work inviscid Burgers equation and modified heat conduction equation is intro-duced as hyperboic equation. These equations are caculated by numerical methods(explicit method MacCormack method Total Variation Diminishing(TVD) method) along various Courant numbers and numerical solutions are compared with the exact analytic solution. For inviscid Burgers equa-tion TVD method remains stable and produces high resolution at sharp wave front but for modified heat Conduction equation MacCormack method is recommmanded as numerical technique.

  • PDF

Enumerate tropical algebraic curves (열대곡선 헤아리기)

  • Kim, Young Rock;Shin, Yong-Su
    • Journal for History of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.185-199
    • /
    • 2017
  • In tropical geometry, the sum of two numbers is defined as the minimum, and the multiplication as the sum. As a way to build tropical plane curves, we could use Newton polygons or amoebas. We study one method to convert the representation of an algebraic variety from an image of a rational map to the zero set of some multivariate polynomials. Mikhalkin proved that complex curves can be replaced by tropical curves, and induced a combination formula which counts the number of tropical curves in complex projective plane. In this paper, we present close examinations of this particular combination formula.

Selection of a Probability Distribution for Modeling Labor Productivity during Overtime

  • Woo, Sung-Kwon
    • Korean Journal of Construction Engineering and Management
    • /
    • v.6 no.1 s.23
    • /
    • pp.49-57
    • /
    • 2005
  • Construction labor productivity, which is the greatest source of variation in overall construction productivity, is the critical factor for determining the project performance in terms of time and cost, especially during scheduled overtime when extra time and cost are invested. The objective of this research is to select an appropriate type of probability distribution function representing the variability of daily labor productivity during overtime. Based on the results of statistical data analysis of labor performance during different weekly work hours, lognormal distribution is selected in order to take advantage of easiness of generating correlated random numbers. The selected lognormal distribution can be used for development of a simulation model in construction scheduling, cost analysis, and other applications areas where representation of the correlations between variables are essential.

A Study on a 2 Layer Channel Router Considering Cycle Problems (사이클 문제를 고려한 2층채널 배선기에 관한 연구)

  • Kim, Seung-Youn
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.2
    • /
    • pp.102-108
    • /
    • 1988
  • In this paper, a channel routing algorithm which considers cycle problem is proposed. The requirements of routing is given by pin numbers which imply interconnections between a upper block and lower block of the channel. Output is represented by interconnections among equipotential pins. When input is given, the algorithm constructs a channel representation graph and makes weight of each net. And then it checks cycle and finidhes the routing. If the cycle is detected, it finds path with maze routing. This algorithm have coded in C language on IBM-PC /AT. If cycle is not detected, the results are near optimal values. If it is detected, routing is possible as well.

  • PDF

A Genetic Approach to Transmission Rate and Power Control for Cellular Mobile Network (ICEIC'04)

  • Lee YoungDae;Park SangBong
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.10-14
    • /
    • 2004
  • When providing flexible data transmission for future CDMA(Code Division Multiple Access) cellular networks, problems arise in two aspects: transmission rate. This paper has proposed an approach to maximize the cellular network capacity by combining the genetic transmission rate allocation and a rapid power control algorithm. We present a genetic chromosome representation to express call drop numbers and transmission rate to control mobile's transmission power levels while handling their flexible transmission rates. We suggest a rapid power control algorithm, which is based on optimal control theory and Steffenson acceleration technique comparing with the existing algorithms. Computer simulation results showed effectiveness and efficiency of the proposed algorithm Conclusively, our proposed scheme showed high potential for increasing the cellular network capacity and it can be the fundamental basis of future research.

  • PDF

ON THE k-LUCAS NUMBERS VIA DETERMINENT

  • Lee, Gwang-Yeon;Lee, Yuo-Ho
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1439-1443
    • /
    • 2010
  • For a positive integer k $\geq$ 2, the k-bonacci sequence {$g^{(k)}_n$} is defined as: $g^{(k)}_1=\cdots=g^{(k)}_{k-2}=0$, $g^{(k)}_{k-1}=g^{(k)}_k=1$ and for n > k $\geq$ 2, $g^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n-2}+{\cdots}+g^{(k)}_{n-k}$. And the k-Lucas sequence {$l^{(k)}_n$} is defined as $l^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n+k-1}$ for $n{\geq}1$. In this paper, we give a representation of nth k-Lucas $l^{(k)}_n$ by using determinant.

Particle Swarm Optimizations to Solve Multi-Valued Discrete Problems (다수의 값을 갖는 이산적 문제에 적용되는 Particle Swarm Optimization)

  • Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.63-70
    • /
    • 2013
  • Many real world optimization problems are discrete and multi-valued. Meta heuristics including Genetic Algorithm and Particle Swarm Optimization have been effectively used to solve these multi-valued optimization problems. However, extensive comparative study on the performance of these algorithms is still required. In this study, performance of these algorithms is evaluated with multi-modal and multi-dimensional test functions. From the experimental results, it is shown that Discrete Particle Swarm Optimization (DPSO) provides better and more reliable solutions among the considered algorithms. Also, additional experiments shows that solution quality of DPSO is not lowered significantly when bit size representing a solution increases. It means that bit representation of multi-valued discrete numbers provides reliable solutions instead of becoming barrier to performance of DPSO.

Re-organization of Parametric epidermis (파라메트릭 표피 재 조직화)

  • Park, Jeong-Joo
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2008.05a
    • /
    • pp.46-49
    • /
    • 2008
  • This research does Complexity form, Interior epidermis cell re-organization, Object discovery that have correct numerical value concept by purpose. Research applied by Grid re-organization in form generation, Parameter variation of cell unit (morphor, tweener), Symbol, pattern of variation, self-organization cell substitution order. Representation through 3d digital modeler of polygon, Nurbs and street-sheet program(x,y,z coordinates & Network way of points) etc. of main work. Investigator specified numbers of U profiles*30, V point-20 that is 600 Paramaters individual in volume, and define circle radius of lighting in object, Projection size variously and tried difference. Transposition cell to point and Heightened brightness of color using pointillism of painting. Led lighting cell object is expressed being decoded by digital code.

  • PDF

A Computer Oriented Solution for the Fractional Boundary Value Problem with Fuzzy Parameters with Application to Singular Perturbed Problems

  • Asklany, Somia A.;Youssef, I.K.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.223-227
    • /
    • 2021
  • A treatment based on the algebraic operations on fuzzy numbers is used to replace the fuzzy problem into an equivalent crisp one. The finite difference technique is used to replace the continuous boundary value problem (BVP) of arbitrary order 1<α≤2, with fuzzy boundary parameters into an equivalent crisp (algebraic or differential) system. Three numerical examples with different behaviors are considered to illustrate the treatment of the singular perturbed case with different fractional orders of the BVP (α=1.8, α=1.9) as well as the classical second order (α=2). The calculated fuzzy solutions are compared with the crisp solutions of the singular perturbed BVP using triangular membership function (r-cut representation in parametric form) for different values of the singular perturbed parameter (ε=0.8, ε=0.9, ε=1.0). Results are illustrated graphically for the different values of the included parameters.