• Title/Summary/Keyword: Complete-Information

Search Result 2,118, Processing Time 0.025 seconds

MLE for Incomplete Contingency Tables with Lagrangian Multiplier

  • Kang, Shin-Soo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.919-925
    • /
    • 2006
  • Maximum likelihood estimate(MLE) is obtained from the partial log-likelihood function for the cell probabilities of two way incomplete contingency tables proposed by Chen and Fienberg(1974). The partial log-likelihood function is modified by adding lagrangian multiplier that constraints can be incorporated with. Variances of MLE estimators of population proportions are derived from the matrix of second derivatives of the loglikelihood with respect to cell probabilities. Simulation results, when data are missing at random, reveal that Complete-case(CC) analysis produces biased estimates of joint probabilities under MAR and less efficient than either MLE or MI. MLE and MI provides consistent results under either the MAR situation. MLE provides more efficient estimates of population proportions than either multiple imputation(MI) based on data augmentation or complete case analysis. The standard errors of MLE from the proposed method using lagrangian multiplier are valid and have less variation than the standard errors from MI and CC.

  • PDF

Performance Evaluation of the WiMAX Network under a Complete Partitioned User Group with a Traffic Shaping Algorithm

  • Akhter, Jesmin;Islam, Md. Imdadul;Amin, M.R.
    • Journal of Information Processing Systems
    • /
    • v.10 no.4
    • /
    • pp.568-580
    • /
    • 2014
  • To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.

Complete Tunneling of Light via Local Barrier Modes in A Composite Barrier with Metamaterials

  • Kim, Kyoung-Youm;Kim, Sae-Hwa
    • Journal of the Optical Society of Korea
    • /
    • v.12 no.4
    • /
    • pp.314-318
    • /
    • 2008
  • We investigate the conditions of the complete tunneling of light across a composite barrier made of multiple layers involving metamaterials. It is shown that complete tunneling phenomena are related to the resonance transmission properties of local modes formed in barrier layers and that there are two distinctive kinds of local barrier modes involved in actual complete tunneling: the degenerate inner-barrier mode and the full barrier mode. Complete tunneling occurs via two successive mode couplings: from the incident plane wave to the plane wave in the transmission layer through the direct mediation of these two kinds of local barrier modes.

Complete Preordering of Alternatives by Metric Distance Meausre (거리측정척도에 의한 대안들의 전체적 유사순서 결정)

  • 김영겸;이강인;김진용;이진규
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.41-52
    • /
    • 1994
  • Imprecision of evaluation or lack of prior information about preference can be an obstacle for decision maker in representing his strict preference. Therefore, fuzziness of preference can take place, and in addition, intransitivity or incomparability of preference becomes the critical difficulty in making complete preorder of alternatives. In order to get better solution and to improve practical usufulness, MCDM should be established as a pseudo-criterion model that include fuzzy preference. In this paper, we suggest a pseudo-criterion model that can make complete preorder of alternatives by metric distance measure.

  • PDF

DISTANCE SPACES, ALEXANDROV PRETOPOLOGIES AND JOIN-MEET OPERATORS

  • KIM, YOUNG-HEE;KIM, YONG CHAN;CHOI, JONGSUNG
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.1_2
    • /
    • pp.105-116
    • /
    • 2021
  • Information systems and decision rules with imprecision and uncertainty in data analysis are studied in complete residuated lattices. In this paper, we introduce the notions of distance spaces, Alexandrov pretopology (precotopology) and join-meet (meet-join) operators in complete co-residuated lattices. We investigate their relations and properties. Moreover, we give their examples.

Complete Coverage Path Planning for Cleaning robot (청소로봇의 전역 경로계획)

  • Nam, Sang-Hyun;Moon, Seung-Bin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11c
    • /
    • pp.2431-2434
    • /
    • 2002
  • 본 논문에서는 전체 영역 경로 계획인 CCPP(Complete Coverage Path Planning)를 이용해 전 청소 영역을 청소하는 방법을 나타내고 청소영역을 해석 하였다. 그리고, Template방법에 CD(Cell Decomposition)을 접목시킨 방법을 이용해 청소영역을 청소 후 재 경로계획으로 청소 안된 영역을 효율적으로 청소하는 방법을 연구하였다. 또한 청소기의 회전 및 직선 모션에 따른 청소 영역을 비교 해석해 최적 시간과 거리에 따른 경로 계획을 살펴보았다.

  • PDF

A Note on Complete Convergence in $C_{0}(R)\;and\;L^{1}(R)$ with Application to Kernel Density Function Estimators ($C_0(R)$$L^1(R)$의 완전수렴(完全收斂)과 커널밀도함수(密度函數) 추정량(推定量)의 응용(應用)에 대(對)한 연구(硏究))

  • Lee, Sung-Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.3 no.1
    • /
    • pp.25-31
    • /
    • 1992
  • Some results relating to $C_{0}(R)\;and\;L^{1}(R)$ spaces with application to kernel density estimators will be introduced. First, random elements in $C_{0}(R)\;and\;L^{1}(R)$ are discussed. Then, complete convergence limit theorems are given to show that these results can be used in establishing uniformly consistency and $L^{1}$ consistency.

  • PDF