• International Journal of Computer Science & Network Security
• /
• 제22권4호
• /
• pp.17-26
• /
• 2022

Sensor Nodes play a major role to monitor and sense the variations in physical space in various real-time application scenarios. These nodes are powered by limited battery resources and replacing those resource is highly tedious task along with this it increases implementation cost. Thus, maintaining a good network lifespan is amongst the utmost important challenge in this field of WSN. Currently, energy efficient routing techniques are considered as promising solution to prolong the network lifespan where multi-hop communications are performed by identifying the most energy efficient path. However, the existing scheme suffer from performance related issues. To solve the issues of existing techniques, a novel hybrid technique by merging particle swarm optimization and game theory model is presented. The PSO helps to obtain the efficient number of cluster and Cluster Head selection whereas game theory aids in finding the best optimized path from source to destination by utilizing a path selection probability approach. This probability is obtained by using conditional probability to compute payoff for agents. When compared to current strategies, the experimental study demonstrates that the proposed GTPSO strategy outperforms them.

• 대한수학회지
• /
• 제53권2호
• /
• pp.315-329
• /
• 2016

In the setting of continuous logic, we study atomless probability spaces and atomless random variable structures. We characterize ${\kappa}$-saturated atomless probability spaces and ${\kappa}$-saturated atomless random variable structures for every infinite cardinal ${\kappa}$. Moreover, ${\kappa}$-saturated and strongly ${\kappa}$-homogeneous atomless probability spaces and ${\kappa}$-saturated and strongly ${\kappa}$-homogeneous atomless random variable structures are characterized for every infinite cardinal ${\kappa}$. For atomless probability spaces, we prove that ${\aleph}_1$-saturation is equivalent to Hoover-Keisler saturation. For atomless random variable structures whose underlying probability spaces are Hoover-Keisler saturated, we prove several equivalent conditions.

• 대한수학회지
• /
• 제51권3호
• /
• pp.527-543
• /
• 2014

The theory of random variable structures was first studied by Ben Yaacov in [2]. Ben Yaacov's axiomatization of the theory of random variable structures used an early result on the completeness theorem for Lukasiewicz's [0, 1]-valued propositional logic. In this paper, we give an elementary approach to axiomatizing the theory of random variable structures. Only well-known results from probability theory are required here.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.318-328
• /
• 2020

Letter of Credit (L/C) is currently a very popular international settlement method frequently used in international trade processes amongst countries around the globe. Compared with other international settlement methods, however, L/C has some obvious shortcomings. Firstly, it is not easy to use due to the sophisticated processes its usage involves. Secondly, it is sometimes accompanied by a few risks and some uncertainty. Thus, highly efficient methods need to be used to assess and control these risks. To begin with, FAHP and KMV methods are used to resolve the problem of incomplete information associated with L/C and then, on this basis, Bayesian game theory is used in order to make more scientific and reasonable decisions with respect to international trade.

• 품질경영학회지
• /
• 제19권2호
• /
• pp.145-157
• /
• 1991

Thid study intends to pursue behavioral-structure of production behavior through statistical models which are using in PERT and Queueing theory. We can corprehand the orders of human production behavior's characteristics by several related attributes of probablity/statistics. These attributes are poisson, Beta, exponential distributions and P.S Laplace's natural probability. Human production behavior is related and regressed to these attributes in many divisions intermediately. Progressive numerical understanding in many essential human behavior acts on the application of practical behavior standard in production word and operation.

• Journal of applied mathematics & informatics
• /
• 제41권4호
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.863-866
• /
• 1998

In this paper, we proposes Moving Picture Compression reducing bit numbers within the block by probability in 3D-DCT considered of temporal axis. From Delta Modification theory for frequency components, bit numbers within the block(4$\times$4) were properly compressed by using the Probability Entropy. At the result for the proposed algorithm, we could find that the values of PSNR for resolution and the compression rate were better than existing methods.

• 한국수학사학회지
• /
• 제23권3호
• /
• pp.107-119
• /
• 2010

확률 개념과 지식이 정립되는 단계에서 중요한 의의를 가졌던 기댓값이 확률의 역사에서 초기에 역사적으로 어떻게 다루어졌는가를 알아보는 것은 의미 있는 일이다. 이에 본 연구에서는 기댓값의 개념과 정의가 변화하고 정선되어 온 역사적 과정에서 이 발전에 기여한 몇 가지 문제와 함께 그 문제의 해결 과정을 알아봄으로써 확률에서 기댓값의 의미를 다시 한번 고찰해 보고자 한다.

• Journal of the Korean Statistical Society
• /
• 제32권4호
• /
• pp.411-423
• /
• 2003

In this paper we develop a method for calculating a probability that a particular generalized variance is the smallest of all the K multivariate normal generalized variances. The method gives a way of comparing K multivariate populations in terms of their dispersion or spread, because the generalized variance is a scalar measure of the overall multivariate scatter. Fully parametric frequentist approach for the probability is intractable and thus a Bayesian method is pursued using a variant of weighted Monte Carlo (WMC) sampling based approach. Necessary theory involved in the method and computation is provided.

• 한국산업정보학회논문지
• /
• 제11권1호
• /
• pp.1-6
• /
• 2006

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.