• 제목/요약/키워드: representations

검색결과 1,277건 처리시간 0.026초

APPLICATION OF THE OPERATOR H (α, β) TO THE SARAN FUNCTION FE AND SOME OTHER RESULTS

  • Choi, June-Sang;Kim, Yong-Sup;Hasanov, Anvar
    • 호남수학학술지
    • /
    • 제33권4호
    • /
    • pp.441-452
    • /
    • 2011
  • The enormous success of the theory of hypergeometric series in a single variable has stimulated the development of a corresponding theory in two and more variables. A wide variety of investigations in the theory of several variable hypergeometric functions have been essentially motivated by the fact that solutions of many applied problems involving partial differential equations are obtainable with the help of such hypergeometric functions. Here, in this trend, we aim at presenting further decomposition formulas for Saran function $F_E$, which are used to give some integral representations of the function $F_E$. We also present a system of partial differential equations for the Saran function $F_E$.

고개운동에 의한 단순 비언어 의사표현의 비전인식 (Vision-based recognition of a simple non-verbal intent representation by head movements)

  • 유기호;노덕수;이성철
    • 대한인간공학회지
    • /
    • 제19권1호
    • /
    • pp.91-100
    • /
    • 2000
  • In this paper the intent recognition system which recognizes the human's head movements as a simple non-verbal intent representation is presented. The system recognizes five basic intent representations. i.e., strong/weak affirmation. strong/weak negation, and ambiguity by image processing of nodding or shaking movements of head. The vision system for tracking the head movements is composed of CCD camera, image processing board and personal computer. The modified template matching method which replaces the reference image with the searched target image in the previous step is used for the robust tracking of the head movements. For the improvement of the processing speed, the searching is performed in the pyramid representation of the original image. By inspecting the variance of the head movement trajectories. we can recognizes the two basic intent representations - affirmation and negation. Also, by focusing the speed of the head movements, we can see the possibility which recognizes the strength of the intent representation.

  • PDF

SOME DECOMPOSITION FORMULAS ASSOCIATED WITH THE SARAN FUNCTION FE

  • Kim, Yong-Sup;Hasanov, Anvar;Lee, Chang-Hyun
    • 호남수학학술지
    • /
    • 제32권4호
    • /
    • pp.581-592
    • /
    • 2010
  • With the help of some techniques based upon certain inverse pairs of symbolic operators initiated by Burchnall-Chaundy, the authors investigate decomposition formulas associated with Saran's function $F_E$ in three variables. Many operator identities involving these pairs of symbolic operators are first constructed for this purpose. By employing their decomposition formulas, we also present a new group of integral representations for the Saran function $F_E$.

Data-based Control for Linear Time-invariant Discrete-time Systems

  • Park, U. S.;Ikeda, M.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1993-1998
    • /
    • 2004
  • This paper proposes a new framework for control system design, called the data-based control approach or data space approach, in which the input and output data of a dynamical system is directly and solely used to analyze or design a control system without the employment of any mathematical models like transfer functions, state space equations, and kernel representations. Since, in this approach, most of the analysis and design processes are carried out in the domain of the data space, we introduce some notions of geometrical objects, e.g., the openloop and closed-loop data spaces, which serve as the system representations in the data space. In addition, we establish a relationship between the open-loop and closed-loop data spaces that the closed-loop data space is contained in the open-loop data space as one of its subspaces. By using this relationship, we can derive the data-based stabilization condition for a linear time-invariant discrete-time system, which leads to a linear matrix inequality with a rank constraint.

  • PDF

어머니의 아동 양육 방식이 5세 아동의 애착 관계와 사회성 발달에 미치는 영향 (The Relationship of Mothers' Childrearing Attitudes to Their 5-Year-Old Children's Attachment and Social Development)

  • 조은영
    • 아동학회지
    • /
    • 제17권1호
    • /
    • pp.213-226
    • /
    • 1996
  • The aim of this study was to investigate the relationships of mothers' authoritative and authoritarian childrearing attitudes to their 5-year-old children's attachment representations and to teacher-rated social competence. The sample consisted of 69 mothers and their 5-year-old children from intact families. Children were interviewed to assess the quality of their attachment representations using Slough & Greenberg's(1990) version of the Separation Anxiety Test(SAT). Mothers were administered the Childrearing Practices Report Q-sort(Block, 1965) and filled out questionnaires regarding their childhood experiences, their marital relationship and their psychological well-being. In addition, teachers rated children's social competency in school settings using Kohn's(1972) Social Competence Scale. Hierarchical multiple regression showed that mothers' high scores on affective components of authoritative parenting and low scores on authoritarian attitudes are closely associated with children's secure attachment as well as teacher-rated social competence.

  • PDF

진화 알고리듬을 위한 새로운 트리 표현 방법 (A New Tree Representation for Evolutionary Algorithms)

  • 석상문;안병하
    • 대한산업공학회지
    • /
    • 제31권1호
    • /
    • pp.10-19
    • /
    • 2005
  • The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

SUMS OF (pr + 1)-TH POWERS IN THE POLYNOMIAL RING Fpm[T]

  • Car, Mireille
    • 대한수학회지
    • /
    • 제49권6호
    • /
    • pp.1139-1161
    • /
    • 2012
  • Let $p$ be an odd prime number and let F be a finite field with $p^m$ elements. We study representations and strict representations of polynomials $M{\in}F$[T] by sums of ($p^r$ + 1)-th powers. A representation $$M=M_1^k+{\cdots}+M_s^k$$ of $M{\in}F$[T] as a sum of $k$-th powers of polynomials is strict if $k$ deg $M_i<k$ + degM.

DETERMINANTAL EXPRESSION OF THE GENERAL SOLUTION TO A RESTRICTED SYSTEM OF QUATERNION MATRIX EQUATIONS WITH APPLICATIONS

  • Song, Guang-Jing
    • 대한수학회보
    • /
    • 제55권4호
    • /
    • pp.1285-1301
    • /
    • 2018
  • In this paper, we mainly consider the determinantal representations of the unique solution and the general solution to the restricted system of quaternion matrix equations $$\{{A_1X=C_1\\XB_2=C_2,}\;{{\mathcal{R}}_r(X){\subseteq}T_1,\;{\mathcal{N}}_r(X){\supseteq}S_1$$, respectively. As an application, we show the determinantal representations of the general solution to the restricted quaternion matrix equation $$AX+Y B=E,\;{\mathcal{R}}_r(X){\subseteq}T_1,\;{\mathcal{N}}_(X){\supseteq}S_1,\;{\mathcal{R}}_l(Y){\subseteq}T_2,\;{\mathcal{N}}_l (Y){\supseteq}S_2$$. The findings of this paper extend some known results in the literature.

PROJECTIVE PROPERTIES OF REPRESENTATIONS OF A QUIVER OF THE FORM Q = • ⇉ • → •

  • Park, Sangwon;Han, Juncheol
    • Korean Journal of Mathematics
    • /
    • 제17권4호
    • /
    • pp.429-436
    • /
    • 2009
  • We define a projective representation $M_1{^{\rightarrow}_{\rightarrow}}M_2{\rightarrow}M_3$ of a quiver $Q={\bullet}{^{\rightarrow}_{\rightarrow}}{\bullet}{\rightarrow}{\bullet}$ and consider their properties. Then we show that any projective representation $M_1{^{\rightarrow}_{\rightarrow}}M_2{\rightarrow}M_3$ of a quiver $Q={\bullet}{^{\rightarrow}_{\rightarrow}}{\bullet}{\rightarrow}{\bullet}$ is isomorphic to the quotient of a direct sum of projective representations $0{^{\rightarrow}_{\rightarrow}}0{\rightarrow}P,\;0{^{\rightarrow}_{\rightarrow}}P{\rightarrow\limits^{id}}P$ and $P{^{\rightarrow}_{\rightarrow}}^{e1}_{e2}P{\oplus}P{\rightarrow\limits^{id_{P{\oplus}P}}}P{\oplus}P$, where $e_1(a)=(a,0)$ and $e_2(a)=(0,a)$.

  • PDF

전장 설계 자동화를 위한 동시공학 시스템 (Concurrent Engineering System for an Automation of Wiring Harness Design)

  • 이수홍;최두선
    • 한국자동차공학회논문집
    • /
    • 제4권2호
    • /
    • pp.32-49
    • /
    • 1996
  • An approach to providing computational support for concurrent design is discussed in the context of an automobile wiring harness design problem. Key issues include the development of an architecture that supports collaboration among specialists, the development of hierarchical representations that capture different characteristics of the design, and decomposition of tasks to achieve a tradeoff between efficiency and robustness of the system. We present an architecture in which the main design tasks are supported by agents-asynchronous and semi-autonomous modules that automate routine design tasks and provide specialized interfaces for working on particular aspects of the design. The agent communication and coordination mechanisms permit members of an engineering team to work concurrently, at different levels of detail and of different versions of the design. The design is represented hierarchically, with detailed models maintained by the participating agents. In conjunction with the architecture and design representations, issues pertaining to the exchange of information among different views of the design, management of dependencies and constraints, and propagation of design changes are discussed.

  • PDF