• 제목/요약/키워드: cartesian product

검색결과 66건 처리시간 0.022초

Another representation of hand written English alphabets by a sequence of fuzzy sets

  • Moon, Byung-Soo;Hwang, In-Koo;Chung, Chong-Eun
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.32-35
    • /
    • 2003
  • In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities: its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

  • PDF

Rotationally Invariant Space-Time Trellis Codes with 4-D Rectangular Constellations for High Data Rate Wireless Communications

  • Sterian, Corneliu Eugen D.;Wang, Cheng-Xiang;Johnsen, Ragnar;Patzold, Matthias
    • Journal of Communications and Networks
    • /
    • 제6권3호
    • /
    • pp.258-268
    • /
    • 2004
  • We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

미학적 테크놀로지로서 철학화하는 게임 (Philosophizing Game as Aesthetic Technology)

  • 전석;조현경;윤준성
    • 한국HCI학회:학술대회논문집
    • /
    • 한국HCI학회 2007년도 학술대회 3부
    • /
    • pp.183-188
    • /
    • 2007
  • 게임은 데카르트적 좌표(Cartesian coordinates)의 전통을 뒤흔들고 육체와 정신, 이성과 감성, 실재와 가상을 가로지르면서 진화하고 있다. 수많은 철학적 담론을 야기하는 사유의 대상이 되고 있는 게임은 "미학적 기술(Aesthetic Technology)의 철학화(Philosophizing)"로 새롭게 정의될 수 있다. 게임의 메타포적 특성은 철학화하는 게임을 규정하는 중요한 면이다. 메타포(Metaphor)는 '개념의 매핑'(Mapping of the Concept)이며, 분리된 정신과 육체, 내용들을 연결하는 게임 역시 개념의 매핑으로 메타포가 된다. 게임의 메타포적 특성은 몰입(Immersive)과 연결되며 게임 기술의 발달로 개념의 매핑은 '개념의 몰핑'(Morphing of the Concept)으로 나아간다. 게임과 서사 사이의 갈등 또한 철학화 하는 게임의 까다로움을 드러내는 것이다. 게임학(Ludology)과 서사학(Narratology)의 이론적 논쟁에도 불구하고, 게임의 서사와 문학의 서사 사이에는 분명한 존재론적 차이가 있다. 우리는 게임에서 단지 사물이 움직이는 것을 보는 것이 아니라, 우리는 '우리 자체가(우리 스스로가) 움직이기 때문에 움직이는 것들을 보는 것'이기 때문이다. 그러므로 게임의 앵글(보는 방식)은 의미와 행위자가 아니라 '사용과 사용자(Use and User)'로 이동되어야 하며, 이때 서사는 '규칙의 해석(Interpretation)' 과정에서 생기는 잉여물(Surplus)이 된다. 게임은 수적으로 재현되며, 수적 재현을 통해 만들어지는 생산물(Product)은 서사가 아니라 알고리즘(Algorithm)이라는 숨은 규칙을 지닌 데이터베이스(Database)이다.

  • PDF

교감 이론으로서 메를로퐁티의 '상호 엮임' (Merleau-Ponty's Intertwining as a Theory of Communion)

  • 권택영
    • 영어영문학
    • /
    • 제57권4호
    • /
    • pp.581-598
    • /
    • 2011
  • The recent revival of phenomenology and aesthetics is deeply connected to the development of neuroscience which studies the nervous system and the brain with particular regard to cognition and memory. How are those fields gathered into building up the basis for the communication not only between human beings but also between humanity and its environment? This paper examines the human mind considered unseparable from the body, with reference to Merleau-Ponty's two major works: Phenomenology of Perception (1962) and The Visible and the Invisible (1968). While reading these texts, I investigate the way he overturns the Cartesian cogito and establishes the body as the ground of perception. According to him, human perception is chiefly obtained through the body rather than consciousness. Influenced by William James, who produced the unique concept of cognition and memory through his experiments with the brain, Merleau-Ponty extends Heideggerian Desein to the field of the embodied mind. James also anticipates Bergson, who regards memory as the product of interaction between consciousness and matter (or the body). The intervention of the body which stores the past experiences makes it impossible for us to capture the present moment in itself. This failure, however, is viewed as positive by Merleau-Ponty because the human body is not only a medium of social interaction, but also that of ecological communion.

Parallel Algorithm of Improved FunkSVD Based on Spark

  • Yue, Xiaochen;Liu, Qicheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권5호
    • /
    • pp.1649-1665
    • /
    • 2021
  • In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

MORE RELATIONS BETWEEN λ-LABELING AND HAMILTONIAN PATHS WITH EMPHASIS ON LINE GRAPH OF BIPARTITE MULTIGRAPHS

  • Zaker, Manouchehr
    • 대한수학회보
    • /
    • 제59권1호
    • /
    • pp.119-139
    • /
    • 2022
  • This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph Kn☐Kn and the generation of λ-squares.

L(4, 3, 2, 1)-PATH COLORING OF CERTAIN CLASSES OF GRAPHS

  • DHANYASHREE;K.N. MEERA
    • Journal of applied mathematics & informatics
    • /
    • 제41권3호
    • /
    • pp.511-524
    • /
    • 2023
  • An L(p1, p2, p3, . . . , pm)-labeling of a graph G is an assignment of non-negative integers, called as labels, to the vertices such that the vertices at distance i should have at least pi as their label difference. If p1 = 4, p2 = 3, p3 = 2, p4 = 1, then it is called a L(4, 3, 2, 1)-labeling which is widely studied in the literature. A L(4, 3, 2, 1)-path coloring of graphs, is a labeling g : V (G) → Z+ such that there exists at least one path P between every pair of vertices in which the labeling restricted to this path is a L(4, 3, 2, 1)-labeling. This concept was defined and results for some simple graphs were obtained by the same authors in an earlier article. In this article, we study the concept of L(4, 3, 2, 1)-path coloring for complete bipartite graphs, 2-edge connected split graph, Cartesian product and join of two graphs and prove an existence theorem for the same.

초등수학영재의 분수 나눗셈의 이해에 관한 연구 (A Study on Understanding of Fraction Division of Elementary Mathematical Gifted Students)

  • 김영아;김동화;노지화
    • East Asian mathematical journal
    • /
    • 제32권4호
    • /
    • pp.565-587
    • /
    • 2016
  • The purpose of this study was to analyze the understanding of the meaning of fraction division and fraction division algorithm of elementary mathematical gifted students through the process of problem posing and solving activities. For this goal, students were asked to pose more than two real-world problems with respect to the fraction division of ${\frac{3}{4}}{\div}{\frac{2}{3}}$, and to explain the validity of the operation ${\frac{3}{4}}{\div}{\frac{2}{3}}={\frac{3}{4}}{\times}{\frac{3}{2}}$ in the process of solving the posed problems. As the results, although the gifted students posed more word problems in the 'inverse of multiplication' and 'inverse of a cartesian product' situations compared to the general students and pre-service elementary teachers in the previous researches, most of them also preferred to understanding the meaning of fractional division in the 'measurement division' situation. Handling the fractional division by converting it into the division of natural numbers through reduction to a common denominator in the 'measurement division', they showed the poor understanding of the meaning of multiplication by the reciprocal of divisor in the fraction division algorithm. So we suggest following: First, instruction on fraction division based on various problem situations is necessary. Second, eliciting fractional division algorithm in partitive division situation is strongly recommended for helping students understand the meaning of the reciprocal of divisor. Third, it is necessary to incorporate real-world problem posing tasks into elementary mathematics classroom for fostering mathematical creativity as well as problem solving ability.

초등수학에서 자연수 곱셈 지도 -곱셈의 도입과 곱셈 구구를 중심으로- (Teaching Multiplication with Whole Numbers in Elementary School Mathematics -Focusing on the Introduction of the Concept of Multiplication and Multiplication Facts-)

  • 정영옥
    • 대한수학교육학회지:학교수학
    • /
    • 제15권4호
    • /
    • pp.889-920
    • /
    • 2013
  • 본 연구는 초등학교 수학에서 곱셈 개념의 도입과 곱셈 구구 지도를 위한 교수학적 배경을 알아보고, 앞으로의 곱셈 지도 개선을 위한 시사점을 제공하는 데 그 목적이 있다. 이를 위해 여러 곱셈 연구에 대한 이론적 고찰을 통해 곱셈 지도의 교수학적 배경의 핵심 내용으로 곱셈 개념, 곱셈 상황, 곱셈 지도 모델, 곱셈 전략을 추출하고 이에 대해 살펴보았고, 이를 기초로 미국, 핀란드, 네덜란드, 독일과 우리나라 교과서를 비교 분석하였다. 이런 이론적 고찰과 분석 결과를 바탕으로 이후의 우리나라 초등학교 수학의 곱셈 지도 개선을 위한 시사점으로 곱셈 상황에서 묶음 상황의 다양화와 곱셈적 비교 상황의 강조 및 데카르트 곱의 재고, 곱셈 지도 모델에서 묶음 모델, 배열 모델, 직선 모델의 균형과 구조화와 형식화로의 이행, 곱셈 구구 지도에서 곱셈 전략과 곱셈 성질의 강조와 곱셈 구구 사이의 연결을 제안하였다.

  • PDF

식품 눈대중량 퍼지데이타의 처리방안에 관한 연구 (A Method for Fuzzy-Data Processing of Cooked-rice Portion Size Estimation)

  • 김명희
    • Journal of Nutrition and Health
    • /
    • 제27권8호
    • /
    • pp.856-863
    • /
    • 1994
  • To develop a optimized method for educing the errors associated with the estimation of portion size of foods, fuzzy-dta processing of portion size was performed. Cooked-rice was chosen as a food item. The experiment was conducted in two parts. First, to study the conceptions of respondents to bowl size(large, medium, small), 11 bowls of different size and shape were used and measured the actual weights of cooked-rice. Second, to study the conceptions of respondents to volume(1, 1/2, 1/3, 1/4), 16 different volumes of cooked-rice in bowls of same size and shape were used. Respondents for this study were 31 graduate students. After collecting the data of respondents to size and volume, fuzzy sets of size and volume were produced. The critical values were calculated by defuzzification(mean of maximum method, center of area method). The differences of the weights of cooked-rice in various bowl size and volume between the critical values and the calculated values by average portion size using in conventional methods were compared. The results hows large inter-subject variation in conception to bowl size, especially in large size. However, conception of respondents to volume is relatively accurate. Conception to bowl size seems to be influenced by bowl shape. Considering that the new fuzzy set was calculated by cartesian product(bowl size and volume), bowl shape should be considered in estimation of bowl size to make more accurate fuzzy set for cooked-rice portion size. The limitations of this study were discussed. If more accurate data for size and volume of many other food items are collected by the increased number of respondents, reducing the errors associated with the estimation of portion size of foods and rapid processing will be possible by constructing computer processing systems.

  • PDF