• 제목/요약/키워드: Sum-product

검색결과 301건 처리시간 0.028초

WEAKLY EQUIVARIANT CLASSIFICATION OF SMALL COVERS OVER A PRODUCT OF SIMPLICIES

  • Ilhan, Asli Guclukan;Gurbuzer, Sabri Kaan
    • 대한수학회지
    • /
    • 제59권5호
    • /
    • pp.963-986
    • /
    • 2022
  • Given a dimension function 𝜔, we introduce the notion of an 𝜔-vector weighted digraph and an 𝜔-equivalence between them. Then we establish a bijection between the weakly (ℤ/2)n-equivariant homeomorphism classes of small covers over a product of simplices ∆𝜔(1) × ⋯ × ∆𝜔(m) and the set of 𝜔-equivalence classes of 𝜔-vector weighted digraphs with m-labeled vertices, where n is the sum of the dimensions of the simplicies. Using this bijection, we obtain a formula for the number of weakly (ℤ/2)n-equivariant homeomorphism classes of small covers over a product of three simplices.

REMARKS OF CONGRUENT ARITHMETIC SUMS OF THETA FUNCTIONS DERIVED FROM DIVISOR FUNCTIONS

  • Kim, Aeran;Kim, Daeyeoul;Ikikardes, Nazli Yildiz
    • 호남수학학술지
    • /
    • 제35권3호
    • /
    • pp.351-372
    • /
    • 2013
  • In this paper, we study a distinction the two generating functions : ${\varphi}^k(q)=\sum_{n=0}^{\infty}r_k(n)q^n$ and ${\varphi}^{*,k}(q)={\varphi}^k(q)-{\varphi}^k(q^2)$ ($k$ = 2, 4, 6, 8, 10, 12, 16), where $r_k(n)$ is the number of representations of $n$ as the sum of $k$ squares. We also obtain some congruences of representation numbers and divisor function.

A PROPER TOTAL COLORING DISTINGUISHING ADJACENT VERTICES BY SUMS OF SOME PRODUCT GRAPHS

  • Choi, Hana;Kim, Dongseok;Lee, Sungjin;Lee, Yeonhee
    • 대한수학회논문집
    • /
    • 제30권1호
    • /
    • pp.45-64
    • /
    • 2015
  • In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak [15] first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus 3. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.

논리 함수를 최소의 Sum of Products와 가까운 형태로 나타내기 위한 프라임 임프리컨트 선택 별렬 처리 모델 (A Parallel Processing Model for Selecting Prime Implicants of a Logic Function for a Near Minimal Sum of Products Form)

  • Kim, Won-Jun;Hwang, Hee-Yeung
    • 대한전기학회논문지
    • /
    • 제39권12호
    • /
    • pp.1288-1295
    • /
    • 1990
  • In this paper, we propose a parallel processing model for the efficient selection of Prime Implicants of Logic Functions. This model consists of simple parallel processing nodes, connections between them, Max Net (a part of Hamming Net) and quasi essential Prime Implicant selection standard in simplified cost form. Through these, this model selects essential Prime Implicants in a certain period of time regardless of the number of given Prime Implicants and minterms and also selects quasi essential Prime Implicants in short time.

유추를 통한 코사인정리의 일반화에 대한 연구 (A Study on a Generalization of the Law of Cosine Using Vector)

  • 한인기
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제21권1호
    • /
    • pp.51-64
    • /
    • 2007
  • 본 연구에서는 유추를 바탕으로 삼각형의 코사인정리를 n각형으로 일반화시키고, 이를 벡터를 이용하여 증명할 것이다. 이를 통해, 수학교과의 내용을 유추를 통해 확장하는 한 예를 제시할 것이며, 수학 영재 교육에서 수학적 사고(특히 일반화, 유추)를 계발 육성하기 위한 교수-학습 자료로 활용할 수 있을 것으로 기대된다.

  • PDF

2차원 공간에서의 휴리스틱 배치 알고리즘 및 구현에 관한 연구 (A Study and Implementation of the Heuristic Autonesting Algorithm in the 2 Dimension Space)

  • 양성모;임성국;고석호;김현정;한관희
    • 한국CDE학회논문집
    • /
    • 제4권3호
    • /
    • pp.259-268
    • /
    • 1999
  • In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

  • PDF

조합논리회로의 기호적 신뢰도 계정 (Symbolic Reliability Evaluation of Combinational Logic Circuit)

  • 오영환
    • 한국통신학회논문지
    • /
    • 제7권1호
    • /
    • pp.25-28
    • /
    • 1982
  • 본 논문에서는 조합논리회로의 기호적 신뢰도 계정식을 구하는 한 방법을 제시하였다. 한 회로의 모든 입력이(0,1) 값을 갖는 확율변수로 나타내어지고 출력이 부울 적의합(sum of product)식으로 표시되어 지면 출력확률의 계정은 sharp 산법이라고 명명되는 부울 대수 산법에 의하여 기호적으로 계정된다.

  • PDF

Checking the Additive Risk Model with Martingale Residuals

  • Myung-Unn Song;Dong-Myung Jeong;Jae-Kee Song
    • Journal of the Korean Statistical Society
    • /
    • 제25권3호
    • /
    • pp.433-444
    • /
    • 1996
  • In contrast to the multiplicative risk model, the additive risk model specifies that the hazard function with covariates is the sum of, rather than product of, the baseline hazard function and the regression function of covariates. We, in this paper, propose a method for checking the adequacy of the additive risk model based on partial-sum of matingale residuals. Under the assumed model, the asymptotic properties of the proposed test statistic and approximation method to find the critical values of the limiting distribution are studied. Several real examples are illustrated.

  • PDF

NEW SUBCLASS OF MEROMORPHIC MULTIVALENT FUNCTIONS ASSOCIATED WITH HYPERGEOMETRIC FUNCTION

  • Khadr, Mohamed A.;Ali, Ahmed M.;Ghanim, F.
    • Nonlinear Functional Analysis and Applications
    • /
    • 제26권3호
    • /
    • pp.553-563
    • /
    • 2021
  • As hypergeometric meromorphic multivalent functions of the form $$L^{t,{\rho}}_{{\varpi},{\sigma}}f(\zeta)=\frac{1}{{\zeta}^{\rho}}+{\sum\limits_{{\kappa}=0}^{\infty}}{\frac{(\varpi)_{{\kappa}+2}}{{(\sigma)_{{\kappa}+2}}}}\;{\cdot}\;{\frac{({\rho}-({\kappa}+2{\rho})t)}{{\rho}}}{\alpha}_{\kappa}+_{\rho}{\zeta}^{{\kappa}+{\rho}}$$ contains a new subclass in the punctured unit disk ${\sum_{{\varpi},{\sigma}}^{S,D}}(t,{\kappa},{\rho})$ for -1 ≤ D < S ≤ 1, this paper aims to determine sufficient conditions, distortion properties and radii of starlikeness and convexity for functions in the subclass $L^{t,{\rho}}_{{\varpi},{\sigma}}f(\zeta)$.

Fundamental framework toward optimal design of product platform for industrial three-axis linear-type robots

  • Sawai, Kana;Nomaguchi, Yutaka;Fujita, Kikuo
    • Journal of Computational Design and Engineering
    • /
    • 제2권3호
    • /
    • pp.157-164
    • /
    • 2015
  • This paper discusses an optimization-based approach for the design of a product platform for industrial three-axis linear-type robots, which are widely used for handling objects in manufacturing lines. Since the operational specifications of these robots, such as operation speed, working distance and orientation, weight and shape of loads, etc., will vary for different applications, robotic system vendors must provide various types of robots efficiently and effectively to meet a range of market needs. A promising step toward this goal is the concept of a product platform, in which several key elements are commonly used across a series of products, which can then be customized for individual requirements. However the design of a product platform is more complicated than that of each product, due to the need to optimize the design across many products. This paper proposes an optimization-based fundamental framework toward the design of a product platform for industrial three-axis linear-type robots; this framework allows the solution of a complicated design problem and builds an optimal design method of fundamental features of robot frames that are commonly used for a wide range of robots. In this formulation, some key performance metrics of the robot are estimated by a reducedorder model which is configured with beam theory. A multi-objective optimization problem is formulated to represent the trade-offs among key design parameters using a weighted-sum form for a single product. This formulation is integrated into a mini-max type optimization problem across a series of robots as an optimal design formulation for the product platform. Some case studies of optimal platform design for industrial three-axis linear-type robots are presented to demonstrate the applications of a genetic algorithm to such mathematical models.