• 제목/요약/키워드: sequence number

검색결과 1,745건 처리시간 0.033초

피보나치수와 벤포드법칙에 대한 탐색적 접근 (Exploratory Approach for Fibonacci Numbers and Benford's Law)

  • 장대흥
    • 응용통계연구
    • /
    • 제22권5호
    • /
    • pp.1103-1113
    • /
    • 2009
  • 피보나치수열의 첫 숫자수열이 벤포드법칙을 따름은 알려진 사실이다. 이러한 피보나치수열을 확장하여 임의의 두개의 자연수를 정하고 재귀식 $a_{n+2}=a_{n+1}+a_n$을 만족하는 수열을 만들었을 때 이 수열의 첫 숫자수열이 벤포드법칙을 만족하는 지를 확인하고 이러한 수열의 첫 숫자수열의 구조를 탐색적 자료분석의 입장에서 살펴보았다.

수 세기와 수 개념의 발달 유형에 관한 이론 (Counting and the Development of Number Concepts)

  • 박만구
    • 한국수학교육학회지시리즈C:초등수학교육
    • /
    • 제4권1호
    • /
    • pp.43-49
    • /
    • 2000
  • The purpose of this paper is to address the theory of counting and the development of number concepts. Leslie Steffe and his colleagues developed the theory of children's counting types using the teaching experiment. As the results of their research, they published two books: "Children's counting types" (Steffe, von Glasersfeld, Richards, '||'&'||' Cobb, 1983) and "Construction of arithmetic meanings and strategies" (Steffe, Cobb, & von Glasersfeld, 1988). They classified children's counting types into five categories: Perceptual Counting Stage, Figural Counting Stages, Initial Number Sequence Stage, Tacitly Nested Number Sequence Stage, and Explicitly Nested Number Sequence Stage. The meaning of this theory is added in the last part of this paper. this paper.

  • PDF

목적지 순차 번호를 사용하지 않은 새로운 구조의 Ad Hoc 네트워크의 라우팅 프로토콜 (A New Framework for Ad Hoc Network routing Protocol without Destination Sequence Number)

  • 서재홍;정호열
    • 대한임베디드공학회논문지
    • /
    • 제2권3호
    • /
    • pp.155-163
    • /
    • 2007
  • In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses Destination sequence numbering for loop-free, but it may cause RREQ broadcast storm problem. This paper proposes AODV_ods that does not need destination sequence number, in routing message and routing table without routing loop. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS-2. The simulation results show that the proposed ADOV_ods efficiently uses wireless bandwidth compare to the original AODV. Finally AODV ods reduces the routing overhead, end to end delay and increases the overall packet delivery ratio.

  • PDF

수학적 추론과 연결성의 교수.학습을 위한 소재 연구 -도형수, 파스칼 삼각형, 피보나치 수열을 중심으로- (A Study on Teaching Material for Enhancing Mathematical Reasoning and Connections - Figurate numbers, Pascal's triangle, Fibonacci sequence -)

  • 손홍찬
    • 대한수학교육학회지:학교수학
    • /
    • 제12권4호
    • /
    • pp.619-638
    • /
    • 2010
  • 본 고에서는 평면이나 공간에서 정의된 도형수가 일반적으로 유한 차원에서 일반화될 때 저차원의 도형수인 그노몬수, 다각수 그리고 다각뿔수의 성질을 통합적으로 설명할 수 있음을 논하고, 도형수와 파스칼 삼각형, 피보나치 수열의 성질과 그들 사이의 관계를 알아봄으로써 이들에 대한 성질 탐구가 수학적 추론과 연결성을 지도하기 적합한 소재가 될 수 있음을 논한다.

  • PDF

A Proposal on a Multiple-Cycle Binary Sequence Generator with a ST-LFSR

  • Lee, Hoon-Jae;Park, Hee-Bong
    • 한국산업정보학회논문지
    • /
    • 제7권5호
    • /
    • pp.67-72
    • /
    • 2002
  • 출력 키수열의 사이클 수가 암호 분야에서 새로운 평가 요소로서 제안된 바 있으나 대부분의 이진 수열 발생기는 출력 사이클이 1개 뿐인 것으로 알려져 있다 본 논문에서는 다수 사이클을 갖는 발생기의 기본 함수로서 switching-tap LFSR과 이를 응용한 Rueppel 개선형 다수열 발생기를 제안하였다. 그리고 개선된 발생기에 대하여 주기, 선형 복잡도 및 출력 사이클 수에 대하여 안전성을 분석하였다.

  • PDF

자동조립에서의 신경회로망의 계산능력을 이용한 조립순서 최적화 (A Naural Network-Based Computational Method for Generating the Optimized Robotic Assembly Sequence)

  • 홍대선;조형석
    • 대한기계학회논문집
    • /
    • 제18권7호
    • /
    • pp.1881-1897
    • /
    • 1994
  • This paper presents a neural network-based computational scheme to generate the optimized robotic assembly sequence for an assembly product consisting of a number of parts. An assembly sequence is considered to be optimal when it meets a number of conditions : it must satisfy assembly constraints, keep the stability of in-process subassemblies, and minimize assembly cost. To derive such an optimal sequence, we propose a scheme using both the Hopfield neural network and the expert system. Based upon the inferred precedence constraints and the assembly costs from the expert system, we derive the evolution equation of the network. To illustrate the suitability of the proposed scheme, a case study is presented for industrial product of an electrical relay. The result is compared with that obtained from the expert system.

용접구조물의 변형 최소화를 위한 최적 용접순서의 해석적 방법 (Analytical Methodology Obtaining an Optimal Welding Sequence for Least Distortion of Welded Structure)

  • 하윤석
    • Journal of Welding and Joining
    • /
    • 제31권3호
    • /
    • pp.54-59
    • /
    • 2013
  • Several methodologies analyzing welding distortions of large shell structures like ship blocks have been developed and utilized in shipyards for a long times ago. In general, one of objects of thermal distortion analysis is to find welding sequence making least-deformation without any suppliance, and it can be solved easily and rapidly by EP strain-boundary method. But after assembly construction, there are usually more than 10 weldments in each process, and the number of sequence will follow the Factorial calculation. In this research, a method has been suggested to decide the best welding sequence by minimum analysis. Using this method, welding deformation could be reduced just analyzing some cases as many as the number of weldments. Experiments and Analysis of all cases were also done, and their best results are good agreements with predictation by suggested methodology.

ON EXTREMAL SORT SEQUENCES

  • Yun, Min-Young;Keum, Young-Wook
    • Journal of applied mathematics & informatics
    • /
    • 제9권1호
    • /
    • pp.239-252
    • /
    • 2002
  • A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

A Novel Hitting Frequency Point Collision Avoidance Method for Wireless Dual-Channel Networks

  • Quan, Hou-De;Du, Chuan-Bao;Cui, Pei-Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.941-955
    • /
    • 2015
  • In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.