Wyniki wyszukiwania dla: uncertainty sets

• Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets

  Publikacja

  • I. Kalesnikau
  • M. Shehaj
  • D. Nace
  • M. Pióro

  - Optical Switching and Networking - Rok 2021

  This work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Neutrosophic Sets and Systems

  Czasopisma

  ISSN: 2331-6055

• Uncertainty in emotion recognition

  Publikacja

  • A. Landowska

  - Journal of Information, Communication and Ethics in Society - Rok 2019

  Purpose–The purpose of this paper is to explore uncertainty inherent in emotion recognition technologiesand the consequences resulting from that phenomenon.Design/methodology/approach–The paper is a general overview of the concept; however, it is basedon a meta-analysis of multiple experimental and observational studies performed over the past couple of years.Findings–The mainfinding of the paper might be summarized as follows:...

  Pełny tekst do pobrania w serwisie zewnętrznym

• JOURNAL OF RISK AND UNCERTAINTY

  Czasopisma

  ISSN: 0895-5646 , eISSN: 1573-0476

• Collective Uncertainty Entanglement Test

  Publikacja

  • Ł. Rudnicki
  • P. Horodecki
  • K. Życzkowski

  - PHYSICAL REVIEW LETTERS - Rok 2011

  For a given pure state of a composite quantum system we analyze the product of its projections onto aset of locally orthogonal separable pure states. We derive a bound for this product analogous to theentropic uncertainty relations. For bipartite systems the bound is saturated for maximally entangled statesand it allows us to construct a family of entanglement measures, we shall call collectibility. As thesequantities are experimentally...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Softly switched robustly feasible mpc for constrained linear systems under set bounded uncertainty- LQ-MPC with IC action

  Publikacja

  • P. Deinrych
  • A. Szumski
  • M. Brdyś
  • M. Grochowski
  • P. Szczygielski

  - Rok 2008

  Nie jest możliwe efektywne sterowanie procesem w szerokim zakresie zmian warunków operacyjnych przy użyciu jednego uniwersalnego regulatora. W pracy zaproponowano koncepcję sposobu regulacji polegającego na przełączaniu wielu regulatorów uzależnionego od stanu operacyjnego systemu. Często twarde przełączanie regulatorów nie jest pożądane lub wręcz możliwe, alternatywą jest ich miękkie przełączanie. W pracy rozważany jest problem...

  Pełny tekst do pobrania w serwisie zewnętrznym

• NOTES on INTUITIONISTIC FUZZY SETS

  Czasopisma

  ISSN: 1310-4926

• Twitter-Based uncertainty and cryptocurrency returns

  Publikacja

  • D. Aharon
  • E. Demir
  • C. Lau
  • A. Zaremba

  - Research in International Business and Finance - Rok 2022

  Pełny tekst do pobrania w serwisie zewnętrznym

• Super Dominating Sets in Graphs

  Publikacja

  • M. Lemańska
  • V. Swaminathan
  • Y. Venkatakrishnan
  • R. Zuazua

  - PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES - Rok 2015

  In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.

  Pełny tekst do pobrania w serwisie zewnętrznym

• Global defensive sets in graphs

  Publikacja

  • R. Lewoń
  • A. Małafiejska
  • M. Małafiejski

  - DISCRETE MATHEMATICS - Rok 2016

  In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

  Pełny tekst do pobrania w portalu