min cut
Recently Published Documents


TOTAL DOCUMENTS

283
(FIVE YEARS 38)

H-INDEX

28
(FIVE YEARS 2)

Author(s):  
Maxwell Allman ◽  
Venus Lo ◽  
S. Thomas McCormick
Keyword(s):  

2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Thomas Colcombet ◽  
Nathanaël Fijalkow ◽  
Pierre Ohlmann

Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a target state? They showed that the problem is decidable and EXPTIME-complete in the adversarial setting, and posed as an open problem the stochastic setting, where the agent is represented by a Markov decision process. In this paper, we show that the stochastic control problem is decidable. Our solution makes significant uses of well quasi orders, of the max-flow min-cut theorem, and of the theory of regular cost functions. We introduce an intermediate problem of independence interest called the sequential flow problem and study its complexity.


Electronics ◽  
2021 ◽  
Vol 10 (22) ◽  
pp. 2797
Author(s):  
Abdullah Lakhan ◽  
Jin Li ◽  
Tor Morten Groenli ◽  
Ali Hassan Sodhro ◽  
Nawaz Ali Zardari ◽  
...  

Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodes in a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.


2021 ◽  
Vol 2021 (11) ◽  
Author(s):  
Cesar A. Agón ◽  
Márk Mezei

Abstract Recently, an effective membrane theory was proposed that describes the “hydrodynamic” regime of the entanglement dynamics for general chaotic systems. Motivated by the new bit threads formulation of holographic entanglement entropy, given in terms of a convex optimization problem based on flow maximization, or equivalently tight packing of bit threads, we reformulate the membrane theory as a max flow problem by proving a max flow-min cut theorem. In the context of holography, we explain the relation between the max flow program dual to the membrane theory and the max flow program dual to the holographic surface extremization prescription by providing an explicit map from the membrane to the bulk, and derive the former from the latter in the “hydrodynamic” regime without reference to minimal surfaces or membranes.


2021 ◽  
Author(s):  
Zekeriya Uykan ◽  
Riku Jäntti

AbstractIn this paper, we present a general Gaussian N-relay network by allowing relays to communicate to each other and allowing a direct channel between source and destination as compared to the standard diamond network in Nazaroğlu et al. (IEEE Trans Inf Theory 60:6329–6341, 2014) at the cost of extra channel uses. Our main focus is to examine the min-cut bound capacities of the relay network. Very recently, the results in Uykan (IEEE Trans Neural Netw Learn Syst 31:3294–3304, 2020) imply that the GADIA in Babadi and Tarokh (IEEE Trans Inf Theory 56:6228–6252, 2010), a pioneering algorithm in the interference avoidance literature, actually performs max-cut of a given power-domain (nonnegative) link gain matrix in the 2-channel case. Using the results of the diamond network in Nazaroğlu et al. (2014) and the results in Uykan (2020), in this paper, we (i) turn the mutual information maximization problem in the Gaussian N-relay network into an upper bound minimization problem, (ii) propose a modified GADIA-based algorithm to find the min-cut capacity bound and (iii) present an upper and a lower bound to its min-cut capacity bound using the modified GADIA as applied to the defined “squared channel gain matrix/graph”. Some advantages of the proposed modified GADIA-based simple algorithm are as follows: (1) The Gaussian N-relay network can determine the relay clusters in a distributed fashion and (2) the presented upper bound gives an insight into whether allowing the relays to communicate to each other pays off the extra channel uses or not as far as the min-cut capacity bound is concerned. The simulation results confirm the findings. Furthermore, the min-cut upper bound found by the proposed modified-GADIA is verified by the cut-set bounds found by the spectral clustering based solutions as well.


Author(s):  
Michal Dory ◽  
Yuval Efron ◽  
Sagnik Mukhopadhyay ◽  
Danupon Nanongkai
Keyword(s):  

2021 ◽  
pp. tobaccocontrol-2020-056237
Author(s):  
Yan Kwan Lau ◽  
Sumiyo Okawa ◽  
Rafael Meza ◽  
Kota Katanoda ◽  
Takahiro Tabuchi

ObjectivesJapan is currently the biggest market of heated tobacco products (HTPs) in the world. Little is known about nicotine dependence among HTP users. Thus, the objective was to assess the association of type of tobacco use and time-to-first-use, a marker of nicotine dependence.MethodsA cross-sectional analysis of the 2019 data from an internet cohort study was conducted. The analytical sample consisted of 2147 current (≥1 day use in the past 30 days) HTP and/or conventional cigarette users, aged 25+ years. Marginal structural binomial regression was used to estimate nicotine dependence prevalence ratios (PRs) for each category of tobacco use (exclusive daily cigarette, exclusive HTP (≥1 day), dual HTP+daily cigarette, dual HTP+non-daily cigarette), relative to exclusive, non-daily cigarette smoking.ResultsUsing a 5 min cut-off for time-to-first-use, the prevalence of nicotine dependence was higher among dual users of HTP and daily cigarettes (PR=1.38; 95% CI: 1.05 to 1.82) and exclusive, daily cigarette users (PR=1.48; 95% CI: 1.15 to 1.91), relative to exclusive, non-daily cigarette users. However, nicotine dependence among exclusive HTP users, and dual HTP+non-daily cigarette users, did not differ from that of exclusive, non-daily cigarette users. When using 15 and 30 min cut-offs, all types of users, including exclusive HTP, had higher levels of nicotine dependence relative to exclusive, non-daily cigarette users.ConclusionsRegardless of HTP use, daily cigarette users had higher prevalence of nicotine dependence compared with non-daily cigarette users. Exclusive HTP users had similar (or potentially higher) dependence compared with exclusive, non-daily cigarette users. Longitudinal studies are needed to interrogate the public health implications of growing HTP use worldwide.


Sign in / Sign up

Export Citation Format

Share Document