Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

2013 ◽  
Author(s):  
Andrew Drucker
Keyword(s):  
Direct Product ◽  
Success Probability ◽  
Sat Solvers

Equitable Total Coloring of Direct Product of Path and Cycle

2019 ◽  
Vol 10 (7) ◽  
pp. 1476-1481
Author(s):  
S. Moidheen Aliyar ◽  
S. Manimaran ◽  
K. Manikandan
Keyword(s):  
Direct Product ◽  
Total Coloring

Sport and nationalism in the Republic of North Macedonia

Focaal ◽  
2019 ◽  
pp. 1-13
Author(s):  
Vasiliki P. Neofotistos
Keyword(s):  
Direct Product ◽  
Nation Building ◽  
National History ◽  
Sports Teams ◽  
The Balkans ◽  
The North ◽  
Political Forces ◽  
The Republic

Using the Republic of North Macedonia as a case study, this article analyzes the processes through which national sports teams’ losing performance acquires a broad social and political significance. I explore claims to sporting victory as a direct product of political forces in countries located at the bottom of the global hierarchy that participate in a wider system of coercive rule, frequently referred to as empire. I also analyze how public celebrations of claimed sporting victories are intertwined with nation-building efforts, especially toward the global legitimization of a particular version of national history and heritage. The North Macedonia case provides a fruitful lens through which we can better understand unfolding sociopolitical developments, whereby imaginings of the global interlock with local interests and needs, in the Balkans and beyond.

On Multiple Access of a Large Number of Machine-Type Devices in Cellular Networks

2018 ◽  
pp. 105-114
Author(s):  
O. S. Galinina ◽  
S. D. Andreev ◽  
A. M. Tyurlikov
Keyword(s):  
Success Probability ◽  
Random Access ◽  
Time Interval ◽  
Short Time Interval ◽  
Control Mechanisms ◽  
Network Access ◽  
Smart Meters ◽  
Machine To Machine ◽  
Machine To Machine Communication ◽  
Machine Communication

Introduction: Machine-to-machine communication assumes data transmission from various wireless devices and attracts attention of cellular operators. In this regard, it is crucial to recognize and control overload situations when a large number of such devices access the network over a short time interval.Purpose:Analysis of the radio network overload at the initial network entry stage in a machine-to-machine communication system.Results: A system is considered that features multiple smart meters, which may report alarms and autonomously collect energy consumption information. An analytical approach is proposed to study the operation of a large number of devices in such a system as well as model the settings of the random-access protocol in a cellular network and overload control mechanisms with respect to the access success probability, network access latency, and device power consumption. A comparison between the obtained analytical results and simulation data is also offered. 

On the g-hypergroupoids associated with g-hypergraphs

Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4819-4831 ◽  
Author(s):  
Mehdi Farshi ◽  
Bijan Davvaz ◽  
Saeed Mirvakili
Keyword(s):  
Direct Product ◽  
Fundamental Relation ◽  
Join Space ◽  
Commutative Hypergroup ◽  
Regular Relation

In this paper, we associate a partial g-hypergroupoid with a given g-hypergraph and analyze the properties of this hyperstructure. We prove that a g-hypergroupoid may be a commutative hypergroup without being a join space. Next, we define diagonal direct product of g-hypergroupoids. Further, we construct a sequence of g-hypergroupoids and investigate some relationships between it?s terms. Also, we study the quotient of a g-hypergroupoid by defining a regular relation. Finally, we describe fundamental relation of an Hv-semigroup as a g-hypergroupoid.

scholarly journals On the sandpile model of modified wheels II

2020 ◽  
Vol 18 (1) ◽  
pp. 1531-1539
Author(s):  
Zahid Raza ◽  
Mohammed M. M. Jaradat ◽  
Mohammed S. Bataineh ◽  
Faiz Ullah
Keyword(s):  
Direct Product ◽  
Critical Group ◽  
Complete Structure ◽  
Sandpile Model ◽  
Cyclic Subgroups ◽  
Algebr Comb ◽  
Abelian Sandpile ◽  
Chip Firing ◽  
Sandpile Group

Abstract We investigate the abelian sandpile group on modified wheels {\hat{W}}_{n} by using a variant of the dollar game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999), 25–45]. The complete structure of the sandpile group on a class of graphs is given in this paper. In particular, it is shown that the sandpile group on {\hat{W}}_{n} is a direct product of two cyclic subgroups generated by some special configurations. More precisely, the sandpile group on {\hat{W}}_{n} is the direct product of two cyclic subgroups of order {a}_{n} and 3{a}_{n} for n even and of order {a}_{n} and 2{a}_{n} for n odd, respectively.

scholarly journals DeepLocBox: Reliable Fingerprinting-Based Indoor Area Localization

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2000
Author(s):  
Marius Laska ◽  
Jörg Blankenbach
Keyword(s):  
Wireless Local Area Network ◽  
Indoor Localization ◽  
Local Area Network ◽  
Success Probability ◽  
Local Area ◽  
Position Estimation ◽  
Location Based Services ◽  
Global Navigation Satellite Systems ◽  
Area Network ◽  
Floor Plan

Location-based services (LBS) have gained increasing importance in our everyday lives and serve as the foundation for many smartphone applications. Whereas Global Navigation Satellite Systems (GNSS) enable reliable position estimation outdoors, there does not exist any comparable gold standard for indoor localization yet. Wireless local area network (WLAN) fingerprinting is still a promising and widely adopted approach to indoor localization, since it does not rely on preinstalled hardware but uses the existing WLAN infrastructure typically present in buildings. The accuracy of the method is, however, limited due to unstable fingerprints, etc. Deep learning has recently gained attention in the field of indoor localization and is also utilized to increase the performance of fingerprinting-based approaches. Current solutions can be grouped into models that either estimate the exact position of the user (regression) or classify the area (pre-segmented floor plan) or a reference location. We propose a model, DeepLocBox (DLB), that offers reliable area localization in multi-building/multi-floor environments without the prerequisite of a pre-segmented floor plan. Instead, the model predicts a bounding box that contains the user’s position while minimizing the required prediction space (size of the box). We compare the performance of DLB with the standard approach of neural network-based position estimation and demonstrate that DLB achieves a gain in success probability by 9.48% on a self-collected dataset at RWTH Aachen University, Germany; by 5.48% for a dataset provided by Tampere University of Technology (TUT), Finland; and by 3.71% for the UJIIndoorLoc dataset collected at Jaume I University (UJI) campus, Spain.

scholarly journals Experimental test of the Greenberger–Horne–Zeilinger-type paradoxes in and beyond graph states

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Zheng-Hao Liu ◽  
Jie Zhou ◽  
Hui-Xian Meng ◽  
Mu Yang ◽  
Qiang Li ◽  
...  
Keyword(s):  
Quantum Mechanics ◽  
Quantum Theory ◽  
Success Probability ◽  
Quantum Foundations ◽  
Mixed States ◽  
Graph States ◽  
Hardy Type ◽  
Realistic Description ◽  
Entanglement Detection ◽  
Quantum Paradoxes

AbstractThe Greenberger–Horne–Zeilinger (GHZ) paradox is an exquisite no-go theorem that shows the sharp contradiction between classical theory and quantum mechanics by ruling out any local realistic description of quantum theory. The investigation of GHZ-type paradoxes has been carried out in a variety of systems and led to fruitful discoveries. However, its range of applicability still remains unknown and a unified construction is yet to be discovered. In this work, we present a unified construction of GHZ-type paradoxes for graph states, and show that the existence of GHZ-type paradox is not limited to graph states. The results have important applications in quantum state verification for graph states, entanglement detection, and construction of GHZ-type steering paradox for mixed states. We perform a photonic experiment to test the GHZ-type paradoxes via measuring the success probability of their corresponding perfect Hardy-type paradoxes, and demonstrate the proposed applications. Our work deepens the comprehension of quantum paradoxes in quantum foundations, and may have applications in a broad spectrum of quantum information tasks.

Sign in / Sign up

Export Citation Format

Share Document