Code 128 - Wikipedia
digits with a single code point) and FNC1 The minimum width of the quiet zone to the left and right of the Code 128 is 10x, where x is the minimum width
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex II: A Ti…
We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for large $m$,...
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex I: An As…
In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph...
Imposing edges in Minimum Spanning Tree
We are interested in the consequences of imposing edges in $T$ a minimum spanning tree. We prove that the sum of the replacement costs in $T$ of the imposed edges is a lower bounds of the additional costs. More precisely if r-cost$(T,e)$ is the repla...
Distribution of the Maximum and Minimum of a Random Number of Bounded Random Var…
We study a new family of random variables, that each arise as the distribution of the maximum or minimum of a random number $N$ of i.i.d.~random variables $X_1,X_2,\ldots,X_N$, each distributed as a variable $X$ with support on $[0,1]$. The general s...
A new metaheuristic approach for the art gallery problem
In the problem "Localization and trilateration with the minimum number of landmarks", we faced the 3-Guard and classic Art Gallery Problems. The goal of the art gallery problem is to find the minimum number of guards within a simple polygon to observ...
Spanning trees and the complexity of flood-filling games
We consider problems related to the combinatorial game (Free-)Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. We show that the minimum number of moves required to flood an...
The behavior of the spotless active regions during the solar minimum 23-24
In this work, we analysed the physical parameters of the spotless actives regions observed during solar minimum 23 - 24 (2007 - 2010). The study was based on radio maps at 17~GHz obtained by the Nobeyama Radioheliograph (NoRH) and magnetograms provid...
An improved error term for minimum H-decompositions of graphs
We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let φ_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that φ_H(n)=ex(n,K_r)+Θ(biex...
Minimum Wages in Concentrated Labor Markets
Economists increasingly refer to monopsony power to reconcile the absence of negative employment effects of minimum wages with theory. However, systematic evidence for the monopsony argument is scarce. In this paper, I perform a comprehensive test of...
Universal Music Group - Wikipedia
Minimum Advertised Price programs under which subsidized cooperative advertising was provided to retailers that agreed to adhere to minimum advertised
After a minimum wage increase, workers become more productive. On the whole, it…
...
Reducing the rank of a matroid
We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the minimum k-cut pr...
DAMN. got me an A+
I had an assignment to write a novel/short novel for English class with a minimum of 600 words but the minimum for an A was like 2000 or something like that. Anyway I asked if I could base my novel on...
LastPass will enforce a 12-character minimum master password
Points: 3 | Comments: 5 | Author: elorant
Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem
Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are suitable to find the solution for this problem. Recently, Multifactorial...
Weighing Anchor on Credit Card Debt
We find it is common for consumers who are not in financial distress to make credit card payments at or close to the minimum. This pattern is difficult to reconcile with economic factors but can be explained by minimum payment information presented t...
A Minimum Spanning Tree Representation of Anime Similarities
In this work, a new way to represent Japanese animation (anime) is presented. We applied a minimum spanning tree to show the relation between anime. The distance between anime is calculated through three similarity measurements, namely crew, score hi...
Minimum Reload Cost Cycle Cover in Complete Graphs
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al.[1] introduced the Minimum Reload Cost Cycle Cover problem, which is to fi...
Micro Blossom: Accelerated Minimum-Weight Perfect Matching Decoding for Quantum…
Minimum-Weight Perfect Matching (MWPM) decoding is important to quantum error correction decoding because of its accuracy. However, many believe that it is difficult, if possible at all, to achieve the microsecond latency requirement posed by superco...