• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.327-339
• /
• 2022

In this paper, we introduce arithmetic ${\mathcal{I}}$-statistically convergent sequence space $A{\mathcal{I}}SC$, ${\mathcal{I}}$-lacunary arithmetic statistically convergent sequence space $A{\mathcal{I}}SC_{\theta}$, strongly ${\mathcal{I}}$-lacunary arithmetic convergent sequence space $AN_{\theta}[{\mathcal{I}}]$ and prove some inclusion relations between these spaces. Futhermore, we give ${\mathcal{I}}$-lacunary arithmetic statistical continuity. Finally, we define ${\mathcal{I}}$-Cesàro arithmetic summability, strongly ${\mathcal{I}}$-Cesàro arithmetic summability. Also, we investigate the relationship between the concepts of strongly ${\mathcal{I}}$-Cesàro arithmetic summability, strongly ${\mathcal{I}}$-lacunary arithmetic summability and arithmetic ${\mathcal{I}}$ -statistically convergence.

• Journal of Applied and Pure Mathematics
• /
• v.6 no.3_4
• /
• pp.105-117
• /
• 2024

In the classical sense, it is known that it is impossible to construct a vector space over the entire set of real numbers with the help of simple interval arithmetic. In this article, it has shown that a vector space can be constructed in the classical sense by helping Markov's extended interval arithmetic on the interval valued Cesaro sequence spaces of non-absolute type. As a result of the positive answers, this idea was extended by us with some theorems. Consequently, a new perspective was gained to the construction of new types of sequence spaces by using different algebraic operations on interval-valued sequence spaces.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.265-279
• /
• 2023

In this paper, we firstly presented the definitions of arithmetic ${\mathcal{I}}$-statistically convergence, ${\mathcal{I}}$-lacunary arithmetic statistically convergence, strongly ${\mathcal{I}}$-lacunary arithmetic convergence, ${\mathcal{I}}$-Cesàro arithmetic summable and strongly ${\mathcal{I}}$-Cesàro arithmetic summable using weighted density via Orlicz function ${\tilde{\phi}}$. Then, we proved some theorems associated with these concepts, and we examined the relationship between them. Finally, we establish some sequential properties of ${\mathcal{I}}$-lacunary arithmetic statistical continuity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1307-1329
• /
• 2022

This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.977-988
• /
• 2022

The Padovan sequence is the third-order linear recurrence (𝓟_n)_n≥0 defined by 𝓟_n = 𝓟_n-2 + 𝓟_n-3 for all n ≥ 3 with initial conditions 𝓟₀ = 0 and 𝓟₁ = 𝓟₂ = 1. In this paper, we investigate a generalization of the Padovan sequence called the k-generalized Padovan sequence which is generated by a linear recurrence sequence of order k ≥ 3. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.49-64
• /
• 2003

Although assembly sequence planning is an essential task in assembly process planning, it is known as one of the most difficult and time consuming jobs because its complexity is increased geometrically when the number of parts in an assembly is increased. The purpose of this study is to develop a more efficient algorithm for generating assembly sequences automatically. By considering subassemblies, a new heuristic method generates a preferred parallel assembly sequence that can be used in robotic assembly systems. A parallel assembly sequence concept provides a new representation scheme for an assembly in which the assembly sequence precedence information is not required. After an user inputs both the directional mating relation information and the mating condition information, an assembly product is divided into subgroups if the product has cut-vertices. Then, a virtual disassembly process is executed to generate alternate parallel assembly sequences with intermediate assembly stability. Through searching parts relations in the virtual disassembly process, stable subassemblies are extracted from translation-free parts along disassembling directions and this extraction continues until no more subassemblies are existed. Also, the arithmetic mean parallelism formula as a preference criterion is adapted to select the best parallel assembly sequence among others. Finally a preferred parallel assembly sequence is converted to an assembly BOM structure. The results from this study can be utilized for developing CAAPP(Computer-Aided Assembly Process Planning) systems as an efficient assembly sequence planning algorithm.

• Korean Journal of Mathematics
• /
• v.30 no.3
• /
• pp.433-442
• /
• 2022

Let N^(q) be an arithmetic table of a negative exponent polynomial with q-commuting variables. We study sequential properties of diagonal sums of N^(q). We first device a q-coefficient table $\hat{N}$ of N^(q), find sequences of diagonal sums over $\hat{N}$, and then retrieve the findings of $\hat{N}$ to N^(q). We also explore recurrence rules of s-slope diagonal sums of N^(q) with various s and q.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.297-305
• /
• 2005

In this paper, we study irregular 3D-Arrays with pyramid shapes. Some computation using Maple software and C++ language have been carried out to illustrate some novel and interesting patterns of numbers in these arrays.

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.149-159
• /
• 2008

We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid's algorithm, and the other is in essence a minimal polynomial version of the Berlekamp-Massey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up seamlessly with decoding procedure of alternant codes.