• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.151-160
• /
• 2023

The Hadith is the second source of Islamic jurisprudence after Qur'an. Both sources are indispensable for muslims to practice Islam. All Ahadith are collected and are written. But most books of Hadith contain Ahadith that can be weak or rejected. So, quite a long time, scholars of Hadith have defined laws, rules and principles of Hadith to know the correct Hadith (Sahih) from the fair (Hassen) and weak (Dhaif). Unfortunately, the application of these rules, laws and principles is done manually by the specialists or students until now. The work presented in this paper is part of the automatic treatment of Hadith, and more specifically, it aims to automatically process the chain of narrators (Hadith Isnad) to find its different components and affect for each component its own tag using a statistical method: the Hidden Markov Models (HMM). This method is a power abstraction for times series data and a robust tool for representing probability distributions over sequences of observations. In this paper, we describe an important tool in the Hadith isnad processing: A chunker with HMM. The role of this tool is to decompose the chain of narrators (Isnad) and determine the tag of each part of Isnad (POI). First, we have compiled a tagset containing 13 tags. Then, we have used these tags to manually conceive a corpus of 100 chains of narrators from "Sahih Alboukhari" and we have extracted a lexicon from this corpus. This lexicon is a set of XML documents based on HPSG features and it contains the information of 134 narrators. After that, we have designed and implemented an analyzer based on HMM that permit to assign for each part of Isnad its proper tag and for each narrator its features. The system was tested on 2661 not duplicated Isnad from "Sahih Alboukhari". The obtained result achieved F-scores of 93%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1815-1827
• /
• 1993

In this paper, we evaluate the performance of a Futurebus based multiprocessor system with MESI cache coherence protocol for four bus transaction types. Graphical symbols and compiler of SLAM II are used in modeling and simulation. A steady-state probability of each state for MESI protocol is computed by a Markov chain. The probability of each state is used as an input value for a correct simulation. Processor utilization, memory utilization, bus utilization, and the waiting time for bus arbitration are measured in terms of the number of processors, the hit ratio of cache memory, the probability of internal operation, and bus bandwidth.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.43-58
• /
• 2008

In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.

• Asian-Australasian Journal of Animal Sciences
• /
• v.22 no.1
• /
• pp.124-130
• /
• 2009

Estimating genetic interaction effects in animal genomics would be one of the most challenging studies because the phenotypic variation for economically important traits might be largely explained by interaction effects among multiple nucleotide sequence variants under various environmental exposures. Genetic improvement of economic animals would be expected by understanding multi-locus genetic interaction effects associated with economic traits. Most analyses in animal breeding and genetics, however, have excluded the possibility of genetic interaction effects in their analytical models. This review discusses a historical estimation of the genetic interaction and difficulties in analyzing the interaction effects. Furthermore, two recently developed methods for assessing genetic interactions are introduced to animal genomics. One is the restricted partition method, as a nonparametric grouping-based approach, that iteratively utilizes grouping of genotypes with the smallest difference into a new group, and the other is the Bayesian method that draws inferences about the genetic interaction effects based on their marginal posterior distributions and attains the marginalization of the joint posterior distribution through Gibbs sampling as a Markov chain Monte Carlo. Further developing appropriate and efficient methods for assessing genetic interactions would be urgent to achieve accurate understanding of genetic architecture for complex traits of economic animals.

• The Journal of Society for e-Business Studies
• /
• v.22 no.3
• /
• pp.75-85
• /
• 2017

Personalization recommendations have already proven in many areas of the e-commerce industry. For personalization recommendations, additional work such as reclassifying items is generally necessary, which requires personal information. In this study, we propose a recommendation technique that neither exploit personal information nor reclassify items. We focus on music recommendation and performed experiments with actual music listening data. Experimental analysis shows that the proposed method may result in meaningful recommendations albeit it exploits less amount of data. We analyze the appropriate number of items and present future considerations for contextual recommendation.

• Korean Journal of Clinical Pharmacy
• /
• v.23 no.2
• /
• pp.137-141
• /
• 2013

Purpose: This study compared the performance of new NONMEM estimation methods using a population analysis dataset collected from a clinical study that consisted of 40 individuals and 567 observations after a single oral dose of glimepiride. Method: The NONMEM 7.2 estimation methods tested were first-order conditional estimation with interaction (FOCEI), importance sampling (IMP), importance sampling assisted by mode a posteriori (IMPMAP), iterative two stage (ITS), stochastic approximation expectation-maximization (SAEM), and Markov chain Monte Carlo Bayesian (BAYES) using a two-compartment open model. Results: The parameters estimated by IMP, IMPMAP, ITS, SAEM, and BAYES were similar to those estimated using FOCEI, and the objective function value (OFV) for diagnosing the model criteria was significantly decreased in FOCEI, IMPMAP, SAEM, and BAYES in comparison with IMP. Parameter precision in terms of the estimated standard error was estimated precisely with FOCEI, IMP, IMPMAP, and BAYES. The run time for the model analysis was shortest with BAYES. Conclusion: In conclusion, the new estimation methods in NONMEM 7.2 performed similarly in terms of parameter estimation, but the results in terms of parameter precision and model run times using BAYES were most suitable for analyzing this dataset.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.81-91
• /
• 2014

This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.

• Journal of Digital Convergence
• /
• v.13 no.10
• /
• pp.219-224
• /
• 2015

This research estimates the Mixture of Normals of households saving rate in Korea. Our sample is MDSS, micro-data in 2014 and Gibbs algorithm is used to estimate the Mixture of Normals. Evidences say some results. First, Gibbs algorithm works very well in estimating the Mixture of Normals. Second, Saving rate data has at least two components, one with mean zero and the other with mean 29.4%. It might be that households would be separated into high saving group and low saving group. Third, analysis of Mixture of Normals cannot answer that question and we find that income level and age cannot explain our results.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1579-1602
• /
• 2020

In the design of production system, buffer capacity allocation is a major step. Through polymorphism analysis of production capacity and production capability, this paper investigates a buffer allocation optimization problem aiming at the multi-stage production line including unreliable machines, which is concerned with maximizing the system theoretical production rate and minimizing the system state entropy for a certain amount of buffers simultaneously. Stochastic process analysis is employed to establish Markov models for repairable modular machines. Considering the complex structure, an improved vector UGF (Universal Generating Function) technique and composition operators are introduced to construct the system model. Then the measures to assess the system's multi-state reliability and structural complexity are given. Based on system theoretical production rate and system state entropy, mathematical model for buffer capacity optimization is built and optimized by a specific genetic algorithm. The feasibility and effectiveness of the proposed method is verified by an application of an engine head production line.