• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.355-372
• /
• 2015

In the present paper, by using the Fibonacci difference matrix, we introduce the almost convergent sequence space $\hat{c}^f$. Also, we show that the spaces $\hat{c}^f$and $\hat{c}$ are linearly isomorphic. Further, we determine the ${\beta}$-dual of the space $\hat{c}^f$ and characterize some matrix classses on this space. Finally, Fibonacci core of a complex-valued sequence has been introduced, and we prove some inclusion theorems related to this new type of core.

• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.115-123
• /
• 2009

This paper proposes an algorithm to improve the performance of the spatial partitioning method for flocking behaviors. The core concept is to improve the performance by using the fact that even if a moving entity, boid in flock continuously changes its direction and position, its k-nearest neighbors, kNN to effect on decision of the next direction is not changed frequently. From the previous kNN, the method to check whether new kNN is changed or not is proposed in this paper and then the correctness of the proposed method is proved by two theorems. The proposed algorithm was implemented and its performance was compared with the conventional spatial partitioning method. The results of the comparison show that the proposed algorithm outperforms the conventional one by about 30% with respect to the number of frames per a second.