• Title/Summary/Keyword: number of functions

Search Result 2,743, Processing Time 0.026 seconds

PROPERTIES OF REGULAR FUNCTIONS WITH VALUES IN BICOMPLEX NUMBERS

  • Kim, Ji Eun;Shon, Kwang Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.2
    • /
    • pp.507-518
    • /
    • 2016
  • In this paper, using forms of conjugations, we give some algebraic properties of bicomplex numbers. We research differential operators, elementary functions and the analogous Cauchy-Riemann system in bicomplex number systems. Also, we investigate the definition and properties of regular functions with values in bicomplex settings in Clifford analysis.

An Emerging New Paradigm of the Control Mechanism of Cellular Functions

  • Park, Chun-Sik
    • Proceedings of the Korean Biophysical Society Conference
    • /
    • 1999.06a
    • /
    • pp.14-15
    • /
    • 1999
  • The control mechanism of cellular functions has been classified into two modes: one rapid mechanism occurring within minutes by kinetic alterations of effector proteins without changing the number of effector molecules and another slow mechanism occurring over hours and days by changes in the number of effector molecules without kinetic alterations.(omitted)

  • PDF

The Ordered Weighted Averaging (OWA) Operator Weighting Functions with Constant Value of Orness and Application to the Multiple Criteria Decision Making Problems (순위가 있는 가중치 평균 방법에서 일정한 수준의 결합력을 갖는 가중치 함수의 성질 및 다기준의사결정 문제에의 활용)

  • Ahn, Byeong-Seok
    • Asia pacific journal of information systems
    • /
    • v.16 no.1
    • /
    • pp.85-101
    • /
    • 2006
  • Actual type of aggregation performed by an ordered weighted averaging (OWA) operator heavily depends upon the weighting vector. A number of approaches have been suggested for obtaining the associated weights. In this paper, we present analytic forms of OWA operator weighting functions, each of which has such properties as rank-based weights and constant value of orness, irrespective of number of objectives aggregated. Specifically, we propose four analytic forms of OWA weighting functions that can be positioned at 0.25, 0.334, 0.667, and 0.75 on the orness scale. The merits for using these weights over other weighting schemes can be mentioned in a couple of ways. Firstiy, we can efficiently utilize the analytic forms of weighting functions without solving complicated mathematical programs once the degree of orness is specified a priori by decision maker. Secondly, combined with well-known OWA operator weights such as max, min, and average, any weighting vectors, having a desired value of orness and being independent of the number of objectives, can be generated. This can be accomplished by convex combinations of predetermined weighting functions having constant values of orness. Finally, in terms of a measure of dispersion, newly generated weighting vectors show just a few discrepancies with weights generated by maximum entropy OWA.

Logic synthesis algorithm of multiple-output functions using the functional decomposition method for the TLU-type FPGA (기능적 분해방법을 이용한 TLU형 FPGA의 다출력 함수 로직 합성 알고리즘 설계)

  • 손승원;장종수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2365-2374
    • /
    • 1997
  • This paper describes two algorithms for technology mapping of multiple output functions into interesting and pupular FPGAs(Field Programmable Gate Array) that use look-yp table memories. For improvement of technology mapping for FPGA, we use the functional decompoition method for multiple output functions. Two algorithms are proposed. The one is the Roth-Karpalgorithm extended for multiple output functions. The other is the efficient algorithm which looks for common decomposition functions through the decomposition procedure. The cost function is used to minimize the number of CLBs and nets and to improve performance of the network. Finally we compare our new algorithm with previous logic design technique. Experimental resutls show sigificant reduction in the number of CLBs and nets.

  • PDF

Fragility curves and loss functions for RC structural components with smooth rebars

  • Cardone, Donatello
    • Earthquakes and Structures
    • /
    • v.10 no.5
    • /
    • pp.1181-1212
    • /
    • 2016
  • Fragility and loss functions are developed to predict damage and economic losses due to earthquake loading in Reinforced Concrete (RC) structural components with smooth rebars. The attention is focused on external/internal beam-column joints and ductile/brittle weak columns, designed for gravity loads only, using low-strength concrete and plain steel reinforcing bars. First, a number of damage states are proposed and linked deterministically with commonly employed methods of repair and related activities. Results from previous experimental studies are used to develop empirical relationships between damage states and engineering demand parameters, such as interstory and column drift ratios. Probability distributions are fit to the empirical data and the associated statistical parameters are evaluated using statistical methods. Repair costs for damaged RC components are then estimated based on detailed quantity survey of a number of pre-70 RC buildings, using Italian costing manuals. Finally, loss functions are derived to predict the level of monetary losses to individual RC components as a function of the experienced response demand.

APPROXIMATION BY FUZZY B-SPLINE SERIES

  • BLAGA PETRU;BEDE BARNABAS
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.157-169
    • /
    • 2006
  • We study properties concerning approximation of fuzzy-number-valued functions by fuzzy B-spline series. Error bounds in approximation by fuzzy B-spine series are obtained in terms of the modulus of continuity. Particularly simple error bounds are obtained for fuzzy splines of Schoenberg type. We compare fuzzy B-spline series with existing fuzzy concepts of splines.

NUMBER OF VERTICES FOR POLYGONAL FUNCTIONS UNDER ITERATION

  • Li, Lin
    • The Pure and Applied Mathematics
    • /
    • v.14 no.2 s.36
    • /
    • pp.99-109
    • /
    • 2007
  • Being complicated in computation, iteration of a nonlinear 1-dimensional mapping makes many interesting problems, one of which is about the change of the number of vertices under iteration. In this paper we investigate iteration of polygonal functions which each have only one vertex and give conditions under which the number of vertices either does not increase or has a bound under iteration.

  • PDF

FORMULAS OF GALOIS ACTIONS OF SOME CLASS INVARIANTS OVER QUADRATIC NUMBER FIELDS WITH DISCRIMINANT D ≡ 1(mod 12)

  • Jeon, Daeyeol
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.4
    • /
    • pp.799-814
    • /
    • 2009
  • A class invariant is the value of a modular function that generates a ring class field of an imaginary quadratic number field such as the singular moduli of level 1. In this paper, using Shimura Reciprocity Law, we compute the Galois actions of some class invariants from the generalized Weber functions $\mathfrak{g}_0,\mathfrak{g}_1,\mathfrak{g}_2$ and $\mathfrak{g}_3$ over quadratic number fields with discriminant $D{\equiv}1$ (mod 12).

  • PDF