• Title/Summary/Keyword: metric selection

Search Result 96, Processing Time 0.023 seconds

SELECTION THEOREMS WITH n-CONNECTDENESS

  • In-Sook Kim
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.165-175
    • /
    • 1998
  • We give a generalization of the selection theorem of Ben-El-Mechaiekh and Oudadess to complete LD-metric spaces with the aid of the notion of n-connectedness. Our new selection theorem is used to obtain new results of fixed points and coincidence points for compact lower semicontinuous set-valued maps with closed values consisting of D-sets in a complete LD-metric space.

  • PDF

Selection Method of Software Metrics and Metric Tools using Model-Based Selection Criteria (모델 기반 선택 기준을 이용한 소프트웨어 메트릭 및 도구 선택 방법)

  • Song, Dong Hun;Seo, Yongjin;Kim, Hyeon Soo
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.1
    • /
    • pp.46-52
    • /
    • 2018
  • Software metrics as a way to evaluate software play a significant role in reducing software development costs and improving quality. However, the emergence of various software metrics creates the problem that the user must select the correct metric. Various strategies have been studied to solve this problem. However, existing studies still have difficulties in selecting metrics by requiring high user interventions. Therefore, in this paper, we propose a method that helps to select the right metric and the metric tools by using their various characteristics as selection criteria, instead of using weighted expressions to minimize user intervention.

A MISCELLANY OF SELECTION THEOREMS WITHOUT CONVEXITY

  • Kim, Hoonjoo
    • Honam Mathematical Journal
    • /
    • v.35 no.4
    • /
    • pp.757-764
    • /
    • 2013
  • In this paper, we give sufficient conditions for a map with nonconvex values to have a continuous selection and the selection extension property in LC-metric spaces under the one-point extension property. And we apply it to weakly lower semicontinuous maps and generalize previous results. We also get a continuous selection theorem for almost lower semicontinuous maps with closed sub-admissible values in $\mathbb{R}$-trees.

A Low-Complexity Antenna Selection Algorithm for Quadrature Spatial Modulation Systems

  • Kim, Sangchoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.1
    • /
    • pp.72-80
    • /
    • 2017
  • In this work, an efficient transmit antenna selection approach for the quadrature spatial modulation (QSM) systems is proposed. The conventional Euclidean distance antenna selection (EDAS)-based schemes in QSM have too high computational complexity for practical use. The proposed antenna selection algorithm is based on approximation of the EDAS decision metric employed for QSM. The elimination of imaginary parts in the decision metric enables decoupling of the approximated decision metric, which enormously reduces the complexity. The proposed method is also evaluated via simulations in terms of symbol error rate (SER) performance and compared with the conventional EDAS methods in QSM systems.

Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application (QoS 응용 서비스를 위한 효율적인 다중 메트릭 라우팅 방안)

  • 전한얼;김성대;이재용;김동연;김영준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1055-1063
    • /
    • 2002
  • In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

A Selection Process of COTS Component And Quality Evaluation Techniques (상용컴포넌트 선정 프로세스 및 품질 평가 기법)

  • Oh, Kie-Sung
    • Journal of Information Technology Services
    • /
    • v.2 no.1
    • /
    • pp.123-133
    • /
    • 2003
  • Because of rapid evolution of software technique, numerous software professionals have been concerned with component based development methodologies. However, it is hard to find out a systematic technique for the selection of COTS (Commercial Off The Shelf) component in consumer position. Up to date, the major of component quality evaluation is object-oriented metric based evaluation methodology. But this paper present four step process and evaluation criteria based on MCDM (Multiple Criteria Decision Making) technique for optimal COTS component selection in consumer position. Weconsidered funtionality, efficiency, usability based on ISO/IEC 9126 for quality measurement and executed practical analysis about commercial EJB component in internet. This paper show that the proposed selection technique is applicable to optimal COTS component selection.

COTS Component Quality Evaluation Using AHP

  • Oh Kie Sung
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.712-716
    • /
    • 2004
  • Because of rapid development of software technology, a number of software professionals have been concerned with component-based development methodologies. Up to date, the evaluation of component quality has been focused on object-oriented metric based methodology. But this paper presents the selection process and evaluation criteria based on an MCDM(Multiple Criteria Decision Making) technique for the selection of optimal COTS component from consumers' viewpoints. We considered functionality, efficiency and usability based on ISO/IEC 9126 for quality measurement and conducted practical analysis into commercial EJB component in internet. This paper shows that the proposed selection technique is applicable for the selection of the optimal COTS component.

  • PDF

Route Selection Protocol based on Energy Drain Rates in Mobile Ad Hoc Networks (무선 Ad Hoc 통신망에서 에너지 소모율(Energy Drain Rate)에 기반한 경로선택 프로토콜)

  • Kim, Dong-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.451-466
    • /
    • 2003
  • Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the Minimum Drain Rate (MDR) and the Conditional Minimum Drain Rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission power consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for power-aware routing and show that using the drain rate for power-aware route selection offers superior performance results.

The Effect Analysis of the Improved Vari-METRIC in Multi-Echelon Inventory Model (Vari-METRIC을 개선한 다단계 재고모형의 효과측정)

  • Yoon, Hyouk;Lee, Sang-Jin
    • Korean Management Science Review
    • /
    • v.28 no.1
    • /
    • pp.117-127
    • /
    • 2011
  • In the Multi-Echelon maintenance environment, METRIC(Multi-Echelon Technique for Repairable Item Control) has been used in several different inventory level selection models, such as MOD-METRIC, Vari-METRIC, and Dyna- ETRIC. While this model's logic is easy to be implemented, a critical assumption of infinite maintenance capacity would deteriorate actual values, especially Expected Back Order(EBO)s for each item. To improve the accuracy of EBO, we develop two models using simulation and queueing theory that calculates EBO considering finite capacity. The result of our numerical example shows that the expected backorder from our model is much closer to the true value than the one from Vari-METRIC. The queueing model is preferable to the simulation model regarding the computational time.

Interference-Aware Multipath (IAM) Selection in Multi-Radio Multi-Channel Wireless Mesh Networks

  • Mian Hammad Ullah;Choonhwa Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1314-1315
    • /
    • 2008
  • Recent research work has unearthed that multi-radio multi-channel wireless mesh networks offer considerable capacity gains over single-radio wireless mesh networks. In this paper, we present a new routing metric for multi-radio multi-channel wireless mesh networks. The goal of the metric is to choose multiple link/node disjoint paths between a source and destination node that, when used concomitantly, impart high end-to-end throughput. The proposed metric selects high fidelity paths that will produce elevated throughput with maximum fault tolerance.