• Title, Summary, Keyword: magic square

Search Result 28, Processing Time 0.029 seconds

Enhancement Architecture of Magic Square Considering Peer's Characteristics (피어의 특성을 고려한 Magic Square 확장)

  • 송동주;정일동;손영성;김경석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.172-174
    • /
    • 2003
  • 통신기술과 인터넷의 급속한 발달로 Napster와 Gnutella와 같은 P2P시스템이 등장하였다. P2P시스템은 피어간의 정보와 데이터를 직접 공유하는데 널리 이용되고 있다 MagicSquare는 동적인 (Dynamic) 환경에서 작동할 수 있도록 설계한 P2P 프로토콜이다. MagicSquare는 피어의 컴퓨팅 능력을 고려하기 때문에 각 피어에 대한 자원의 낭비를 최소화할 수 있지만. P2P 네트워크에 참여하는 피어의 물리적인 특성은 고려하지 않았다. 본 논문에서는 피어의 저장 공간의 크기, 사용할 수 있는 네트워크 대역폭, 피어가 가지는 특징을 고려하여 MagicSquare을 확장한다.

  • PDF

The Magic Square Algorithm (마방진 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.159-166
    • /
    • 2017
  • This paper proposes an algorithm for odd, doubly even, and singly even magic squares. In constructing an odd magic square, de la $Loub{\grave{e}}re^{\prime}s$ method is widely known and used, but it has an inherent defect of executing $O(n^2)$ steps. 2 types of cross algorithms have been proposed to the double even magic square, and more to the singly even magic square based on the odd magic square of ${\frac{n}{2}}{\times}{\frac{n}{2}}$, the most popular and simple of which is one proposed by Strachey. The algorithm proposed in this paper successfully constructs odd and doubly even magic squares by undergoing 3 steps and 4 steps respectively. It also directly constructs a singly even magic square without having its basis on the odd magic square.

On the $3^k$-magic squares ($3^k$-차 마방진에 대하여)

  • Koo, Jeong-Hoe;Lee, Byung-Gook;Yoo, Jae-Chil
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.10 no.1
    • /
    • pp.11-19
    • /
    • 2006
  • In this paper, we propose an algorithm of generating magic squares of degree $3^k$(k = 2, 3, 4, $\cdots$) by using the magic square of degree 3.

  • PDF

Design Improvement of Magic Square Considering Node Recovery (노드 복구를 고려한 Magic Square 확장)

  • 이현주;정일동;손영성;김경석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.160-162
    • /
    • 2003
  • Magic Square는 자원 탐색을 제공하는 P2P 프로토콜이다. 그러나 복구비용이 높고 인접한 하나 이상의 노드가 고장났을 경우에는 복구하지 못한다. 본 논문에서는 Magic Square의 복구를 위한 정보를 저장하는 복구 노드를 사용하였다. 복구 노드는 관리하는 영역 전체의 라우팅 테이블을 유지하기 때문에 노드가 고장이 나더라도 즉시 연결을 복구할 수 있다. 본 논문에서 제안하는 방법은 시스템의 성능을 떨어뜨리지 않고 모든 링크 복구와 대부분의 자원 복구를 할 수 있는 장점이 있다.

  • PDF

A study on various non-regular magic squares (정사각형 형태가 아닌 마방진에 대한 고찰)

  • Lee, Kyung-Eon
    • Communications of Mathematical Education
    • /
    • v.24 no.1
    • /
    • pp.195-220
    • /
    • 2010
  • The magic square is one of the number arrangements and the sums of each row, column, and diagonal are all equal. The meaning of "方" is "Square". If we don't consider the condition of 'square' then is it possible any number arrangement? There are many special number arrangements such as "magic five number circle(緊五圖)", "magic six number circle(聚六圖)", "magic eight number circle(聚八圖)", "magic nine number circle(攢九圖)", "magic eight camp circle(八陣圖)", "magic nine camp circle(連環圖)" in the ancient Chinese mathematics books such as "楊輝算法", "算法統宗". Also, there is a very special and beautiful number arrangement Jisuguimoondo(地數龜文圖) in the mathematics book "Goosuryak(九數略)" written by Choi suk jung(崔錫鼎) in the Joseon Dynasty. In this study, we introduce a various number arrangements and their properties.

Magic Square : Resource lookup protocol considering computing power of node (Magic Square : 노드의 능력을 고려한 자원 탐색 프로토콜)

  • 박선미;정일동;손영성;김경석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.163-165
    • /
    • 2003
  • P2P 시스템의 주요 이슈는 자원 (resource) 을 효율적으로 저장하고 찾는 것이다. 자원 탐색 프로토콜은 초기의 Napster, Gnutella와 같은 형태에서 발전하여, 현재는 분산 해시 테이블 (Distributed Hash Table을 사용한 형태로 발전하고 있다. 본 논문에서는 분산 해시 테이블을 사용한 P2P 프로토콜인 Magic Square를 제안한다. Magic Square에 참여하는 칵 노드는 양방향 스킬리스트로 구성된 지역 라우팅 테이블과 임의의 노드로 구성된 전역 라우팅 테이블을 가진다. 지역 라우팅 테이블은 각 노드의 능력을 고려하여 구성된다. 스킵리스트를 사용하였기 때문에 탐색과 노드의 추가라 삭제 과정이 간단하며. P2P 네트워크가 자주 바뀌어도 큰 영향을 받지 않는다.

  • PDF

A David Star Magic Square Algorithm for Efficient LED Control (효율적인 LED 제어를 위한 다윗 스타 마방진 알고리즘)

  • Lee, Kyung-Min;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.109-113
    • /
    • 2016
  • In this paper, we propose efficient LED lighting control algorithm using a David star magic square. Such algorithms increases the power reduction, the heat efficiency and LED life cycle and the efficiency of the LED lighting control consumption. Lighting system using existing Magic square algorithm could be reduced to increase the heat efficiency of the LED because the LED lighting time of the reduced cross-lighting. but it has a limit to the lighting control. If should apply the this proposed algorithm, can reduces power consumption and increases LED life-cycle, heat efficiency of LED lighting module and efficiency of the lighting control of the LED. This paper proposed that algorithm is by using a David star magic square on the LED Matrix. Divided into twelve areas to move the pattern in constant time interval, to perform the cross rotation and inversion techniques to thereby light up. In this paper proposed algorithm of this paper was compared with existing Magic square approach. As a result, power consumption and heat-value and luminous flux was reduced as the conventional lighting system. And, the LED lighting control increase the efficiency.

A Scalable Resource-Lookup Protocol for Internet File System Considering the Computing Power of a Peer (피어의 컴퓨팅 능력을 고려한 인터넷 파일 시스템을 위한 확장성 있는 자원 탐색 프로토콜 설계)

  • Jung Il-dong;You Young-ho;Lee Jong-hwan;Kim Kyongsok
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.89-99
    • /
    • 2005
  • Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

A study on solutions of Jisuguimundo using the range of magic sums (합의 범위를 이용한 지수귀문도 해의 탐구)

  • Kwon, Gyunuk;Park, Sang Hu;Song, Yun Min;Choi, Seong Woong;Park, Poo-Sung
    • Journal for History of Mathematics
    • /
    • v.27 no.2
    • /
    • pp.111-125
    • /
    • 2014
  • Jisuguimundo is an inimitable magic hexagon devised by Choi Seok-Jeong, who was the author of GuSuRyak as well as a prime minister in Joseon dynasty. Jisuguimundo, recorded in GuSuRyak, is also known as Hexagonal Tortoise Problem (HTP) because its nine hexagons resemble a tortoise shell. We call the sum of numbers in a hexagon in Jisuguimundo a magic sum, and show that the magic sum of hexagonal tortoise problem of order 2 varies 40 through 62 exactly and that of hexagonal tortoise problem of order 3 varies 77 through 109 exactly. We also find all of the possible solutions for hexagonal tortoise problem of oder 2.

Application-level Multicast Using Magic Square (MagicSquare를 이용한 애플리케이션 레벨 멀티캐스트)

  • 김강범;한동윤;손영성;김경석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.589-591
    • /
    • 2004
  • IP 멀티캐스트 기술은 지난 10여년동안 꾸준히 발전해 왔지만 라우터의 편재형 배치(Ubiquitous deployment)가 되지 않음으로 인해 네트워크 라우터가 패킷을 복사, 전달함으로서 종단 호스트와 네트워크 라우터 간에 부가적인 제어와 라우팅 프로토콜이 필요하게 되는 단점이 있다. 이에 대한 대안으로 현재 오버레이 네트워크를 이용한 애플리케이션 레벨 멀티캐스트가 많이 연구되고 있다. 본 논문에서는 P2P 오버레이 네트워크를 이용해 확장 (scalability)이 있고 참여지연(Join delay)이 적으면서 효율적인 트리를 구성할수 있는 애플리케이션 레벨 멀티캐스트를 제안한다.

  • PDF