• Title/Summary/Keyword: Critical metric

Search Result 67, Processing Time 0.027 seconds

Probabilistic Performance Evaluation Technique for Mixed-criticality Scheduling with Task-level Criticality-mode (작업별 중요도 모드를 적용한 혼합 중요도 스케줄링에서 확률적 성능 평가 기법)

  • Lee, Jaewoo
    • The Journal of Society for e-Business Studies
    • /
    • v.23 no.3
    • /
    • pp.1-12
    • /
    • 2018
  • Mixed-criticality systems consist of components with different criticality. Recently, components are categorized depending on criticality by ISO 26262 standard and DO-178B standard in automotive and avionic domain. Existing mixed-criticality system research achieved efficient and safe scheduling through system-level criticality mode. The drawback of these approaches is performance degradation of low-criticality tasks on high-criticality mode. Task-level criticality mode is one method to address the problem and improve the performance of low-critical tasks. In this paper, we propose probabilistic performance metric for the approach. In simulation results with probabilistic performance metric, we showed that our approach has better performance than the existing approaches.

An Adaptive K-best Algorithm Based on Path Metric Comparison for MIMO Systems (MIMO System을 위한 Path Metric 비교 기반 적응형 K-best 알고리즘)

  • Kim, Bong-Seok;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1197-1205
    • /
    • 2007
  • An adaptive K-best detection scheme is proposed for MIMO systems. The proposed scheme changes the number of survivor paths, K based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical drawback of the fixed K-best detection is that the correct path's metric may be temporarily larger than K minimum paths metrics due to imperfect interference cancellation by the incorrect ZF estimates. Based on the observation that there are insignificant differences among path metrics (ML distances) when the ZF estimates are incorrect, we use the ratio of the minimum ML distance to the second minimum as a reliability indicator for the ZF estimates. So, we adaptively select the value of K according to the ML distance ratio. It is shown that the proposed scheme achieves the significant improvement over the conventional fixed K-best scheme. The proposed scheme effectively achieves the performance of large K-best system while maintaining the overall average computation complexity much smaller than that of large K system.

Application of Software Quality Model and Metric for Software Product Assurance for KASS Control Station (KASS 통합운영국 소프트웨어 품질 보증을 위한 소프트웨어 품질 모델 및 메트릭 적용방안)

  • Kim, Youn-sil;Lee, Eun-sung
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.1
    • /
    • pp.28-36
    • /
    • 2020
  • Korea augmentation satellite system (KASS) is the Korean satellite based augmentation system (SBAS) developed by ministry of land, infrastructure, and transport (MOLIT) since 2014. Since KASS is the safety critical system that can affect to the safety of airplane, the software of KASS is developed according to the DO178B software level induced from safety analysis. In case of KASS control station (KCS), most of the software of KCS get assigned software level E in DO178B. In that case, ECSS-Q-ST-80C category D is assigned as a software product assurance standard. In this paper, the software related standard ECSS-E-ST-40C, ECSS-Q-HB-80-04A are analyzed to satisfy ECSS-Q-ST-80C and as a result the software product assurance activities regarding software life cycle and the software quality model, metric is proposed for the product assurance of the KCS software.

A Review Study on Ozone Phytotoxicity Metrics for Setting Critical Levels in Asia

  • Agathokleous, Evgenios;Kitao, Mitsutoshi;Kinose, Yoshiyuki
    • Asian Journal of Atmospheric Environment
    • /
    • v.12 no.1
    • /
    • pp.1-16
    • /
    • 2018
  • Ground-level ozone ($O_3$) can be a menace for vegetation, especially in Asia where $O_3$ levels have been dramatically increased over the past decades. To ensure food security and maintain forest ecosystem services, such as nutrient cycling, carbon sequestration and functional diversity of soil biota, in the over-populated Asia, environmental standards are needed. To set proper standards, dose-response relationships should be established from which critical levels are derived. The predictor of the response in the dose-response relationship is an $O_3$ metric that indicates the dose level to which the plant has been exposed. This study aimed to review the relevant scientific literature and summarize the $O_3$ metrics used worldwide to provide insights for Asia. A variety of $O_3$ metrics have been used, for which we discuss their strengths and weaknesses. The most widely used metrics are based only on $O_3$ levels. Such metrics have been adopted by several regulatory agencies in the global. However, they are biologically irrelevant because they ignore the plant physiological capacity. Adopting AOT40 ($O_3$ mixing ratios Accumulated Over the Threshold of $40nmol\;mol^{-1}$) as the default index for setting critical levels in Asia would be a poor policy with severe consequences at national and Pan-Asian level. Asian studies should focus on flux-based $O_3$ metrics to provide relevant bases for developing proper standards. However, given the technical requirements in calculating flux-based $O_3$ metrics, which can be an important limitation in developing countries, no-threshold cumulative exposure indices like AOT0 should always accompany flux-based indices.

CRITICAL METRICS ON NEARLY KAEHLERIAN MANIFOLDS

  • Pak, Jin-Suk;Yoo, Hwal-Lan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.9-13
    • /
    • 1992
  • In this paper, we consider the function related with almost hermitian structure on a copact complex manifold. More precisely, on a 2n-diminsional complex manifold M admitting 2-form .ohm. of rank 2n everywhere, assume that M admits a metric g such that g(JX, JY)=g(X,Y), that is, assume that g defines an hermitian structure on M admitting .ohm. as fundamental 2-form-the 'almost complex structure' J being determined by g and .ohm.:g(X,Y)=.ohm.(X,JY). We consider the function I(g):=.int.$_{M}$ $N^{2}$d $V_{g}$, where N is the norm of Nijenhuis tensor N defined by (J,g). by (J,g).

  • PDF

Interference-Aware Downlink Resource Management for OFDMA Femtocell Networks

  • Jung, Hyun-Duk;Lee, Jai-Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.3
    • /
    • pp.508-522
    • /
    • 2011
  • Femtocell is an economical solution to provide high speed indoor communication instead of the conventional macro-cellular networks. Especially, OFDMA femtocell is considered in the next generation cellular network such as 3GPP LTE and mobile WiMAX system. Although the femtocell has great advantages to accommodate indoor users, interference management problem is a critical issue to operate femtocell network. Existing OFDMA resource management algorithms only consider optimizing system-centric metric, and cannot manage the co-channel interference. Moreover, it is hard to cooperate with other femtocells to control the interference, since the self-configurable characteristics of femtocell. This paper proposes a novel interference-aware resource allocation algorithm for OFDMA femtocell networks. The proposed algorithm allocates resources according to a new objective function which reflects the effect of interference, and the heuristic algorithm is also introduced to reduce the complexity of the original problem. The Monte-Carlo simulation is performed to evaluate the performance of the proposed algorithm compared to the existing solutions.

Improving Performance of Jaccard Coefficient for Collaborative Filtering

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.11
    • /
    • pp.121-126
    • /
    • 2016
  • In recommender systems based on collaborative filtering, measuring similarity is very critical for determining the range of recommenders. Data sparsity problem is fundamental in collaborative filtering systems, which is partly solved by Jaccard coefficient combined with traditional similarity measures. This study proposes a new coefficient for improving performance of Jaccard coefficient by compensating for its drawbacks. We conducted experiments using datasets of various characteristics for performance analysis. As a result of comparison between the proposed and the similarity metric of Pearson correlation widely used up to date, it is found that the two metrics yielded competitive performance on a dense dataset while the proposed showed much better performance on a sparser dataset. Also, the result of comparing the proposed with Jaccard coefficient showed that the proposed yielded far better performance as the dataset is denser. Overall, the proposed coefficient demonstrated the best prediction and recommendation performance among the experimented metrics.

Impact force localization for civil infrastructure using augmented Kalman Filter optimization

  • Saleem, Muhammad M.;Jo, Hongki
    • Smart Structures and Systems
    • /
    • v.23 no.2
    • /
    • pp.123-139
    • /
    • 2019
  • Impact forces induced by external object collisions can cause serious damages to civil engineering structures. While accurate and prompt identification of such impact forces is a critical task in structural health monitoring, it is not readily feasible for civil structures because the force measurement is extremely challenging and the force location is unpredictable for full-scale field structures. This study proposes a novel approach for identification of impact force including its location and time history using a small number of multi-metric observations. The method combines an augmented Kalman filter (AKF) and Genetic algorithm for accurate identification of impact force. The location of impact force is statistically determined in the way to minimize the AKF response estimate error at measured locations and then time history of the impact force is accurately constructed by optimizing the error co-variances of AKF using Genetic algorithm. The efficacy of proposed approach is numerically demonstrated using a truss and a plate model considering the presence of modelling error and measurement noises.

A SPEC-T Viterbi decoder implementation with reduced-comparison operation (비교 연산을 개선한 SPEC-T 비터비 복호기의 구현)

  • Bang, Seung-Hwa;Rim, Chong-Suck
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.81-89
    • /
    • 2007
  • The Viterbi decoder, which employs the maximum likelihood decoding method, is a critical component in forward error correction for digital communication system. However, lowering power consumption on the Viterbi decoder is a difficult task since the number of paths calculated equals the number of distinctive states of the decoder and the Viterbi decoder utilizes trace-back method. In this paper, we propose a method which minimizes the number of operations performed on the comparator, deployed in the SPEC-T Viterbi decoder implementation. The proposed comparator was applied to the ACSU(Add-Compare-Select Unit) and MPMSU(Minimum Path Metric Search Unit) modules on the decoder. The proposed ACS scheme and MPMS scheme shows reduced power consumption by 10.7% and 11.5% each, compared to the conventional schemes. When compared to the SPEC-T schemes, the proposed ACS and MPMS schemes show 6% and 1.5% less power consumption. In both of the above experiments, the threshold value of 26 was applied.

Performance Evaluation of the new AODV Routing Protocol with Cross-Layer Design Approach (교차 계층 설계 기법을 사용한 새로운 AODV 라우팅 프로토콜 설계 및 성능평가)

  • Jang, Jaeshin;Wie, Sunghong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.768-777
    • /
    • 2020
  • In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.