149,209 research outputs found
The differential properties of certain permutation polynomials over finite fields
Finding functions, particularly permutations, with good differential
properties has received a lot of attention due to their possible applications.
For instance, in combinatorial design theory, a correspondence of perfect
-nonlinear functions and difference sets in some quasigroups was recently
shown [1]. Additionally, in a recent manuscript by Pal and Stanica [20], a very
interesting connection between the -differential uniformity and boomerang
uniformity when was pointed out, showing that that they are the same for
an odd APN permutations. This makes the construction of functions with low
-differential uniformity an intriguing problem. We investigate the
-differential uniformity of some classes of permutation polynomials. As a
result, we add four more classes of permutation polynomials to the family of
functions that only contains a few (non-trivial) perfect -nonlinear
functions over finite fields of even characteristic. Moreover, we include a
class of permutation polynomials with low -differential uniformity over the
field of characteristic~. As a byproduct, our proofs shows the permutation
property of these classes. To solve the involved equations over finite fields,
we use various techniques, in particular, we find explicitly many Walsh
transform coefficients and Weil sums that may be of an independent interest
Uniqueness of diffusion on domains with rough boundaries
Let be a domain in and
a
quadratic form on with domain where the
are real symmetric -functions with
for almost all . Further assume there are such that for where is the Euclidean
distance to the boundary of .
We assume that is Ahlfors -regular and if , the Hausdorff
dimension of , is larger or equal to we also assume a mild
uniformity property for in the neighbourhood of one . Then
we establish that is Markov unique, i.e. it has a unique Dirichlet form
extension, if and only if . The result applies to forms
on Lipschitz domains or on a wide class of domains with a self-similar
fractal. In particular it applies to the interior or exterior of the von Koch
snowflake curve in or the complement of a uniformly disconnected
set in .Comment: 25 pages, 2 figure
Materials and Mix Optimization Procedures for PCC Pavements;TR-484, March 2006
Severe environmental conditions, coupled with the routine use of deicing chemicals and increasing traffic volume, tend to place extreme demands on portland cement concrete (PCC) pavements. In most instances, engineers have been able to specify and build PCC
pavements that met these challenges. However, there have also been reports of premature deterioration that could not be specifically attributed to a single cause. Modern concrete mixtures have evolved to become very complex chemical systems. The complexity can be attributed to both the number of ingredients used in any given mixture and the various types and sources of the ingredients supplied to any given project. Local environmental conditions can also influence the outcome of paving projects.
This research project investigated important variables that impact the homogeneity and rheology of concrete mixtures. The project consisted of a field study and a laboratory study. The field study collected information from six different projects in Iowa. The
information that was collected during the field study documented cementitious material properties, plastic concrete properties, and hardened concrete properties. The laboratory study was used to develop baseline mixture variability information for the field study. It
also investigated plastic concrete properties using various new devices to evaluate rheology and mixing efficiency. In addition, the lab study evaluated a strategy for the optimization of mortar and concrete mixtures containing supplementary cementitious materials. The results of the field studies indicated that the quality management concrete (QMC) mixtures being placed in the state generally exhibited good uniformity and good to excellent workability. Hardened concrete properties (compressive strength and hardened air content) were also satisfactory. The uniformity of the raw cementitious materials that were used on the projects could not be monitored as closely as was desired by the investigators; however, the information that was gathered indicated that the bulk chemical composition of most materials streams was reasonably uniform. Specific minerals phases in the cementitious materials were less uniform than the bulk chemical composition. The results of the laboratory study indicated that ternary mixtures show significant promise for improving the performance of concrete mixtures. The lab study also verified the results from prior projects that have indicated that bassanite is
typically the major sulfate phase that is present in Iowa cements. This causes the cements to exhibit premature stiffening problems (false set) in laboratory testing. Fly ash helps to reduce the impact of premature stiffening because it behaves like a low-range water reducer in most instances. The premature stiffening problem can also be alleviated by increasing the waterâcement ratio of the mixture and providing a remix cycle for the mixture
The Complexity of Synthesizing Uniform Strategies
We investigate uniformity properties of strategies. These properties involve
sets of plays in order to express useful constraints on strategies that are not
\mu-calculus definable. Typically, we can state that a strategy is
observation-based. We propose a formal language to specify uniformity
properties, interpreted over two-player turn-based arenas equipped with a
binary relation between plays. This way, we capture e.g. games with winning
conditions expressible in epistemic temporal logic, whose underlying
equivalence relation between plays reflects the observational capabilities of
agents (for example, synchronous perfect recall). Our framework naturally
generalizes many other situations from the literature. We establish that the
problem of synthesizing strategies under uniformity constraints based on
regular binary relations between plays is non-elementary complete.Comment: In Proceedings SR 2013, arXiv:1303.007
Uniform Strategies
We consider turn-based game arenas for which we investigate uniformity
properties of strategies. These properties involve bundles of plays, that arise
from some semantical motive. Typically, we can represent constraints on allowed
strategies, such as being observation-based. We propose a formal language to
specify uniformity properties and demonstrate its relevance by rephrasing
various known problems from the literature. Note that the ability to correlate
different plays cannot be achieved by any branching-time logic if not equipped
with an additional modality, so-called R in this contribution. We also study an
automated procedure to synthesize strategies subject to a uniformity property,
which strictly extends existing results based on, say standard temporal logics.
We exhibit a generic solution for the synthesis problem provided the bundles of
plays rely on any binary relation definable by a finite state transducer. This
solution yields a non-elementary procedure.Comment: (2012
Rotated sphere packing designs
We propose a new class of space-filling designs called rotated sphere packing
designs for computer experiments. The approach starts from the asymptotically
optimal positioning of identical balls that covers the unit cube. Properly
scaled, rotated, translated and extracted, such designs are excellent in
maximin distance criterion, low in discrepancy, good in projective uniformity
and thus useful in both prediction and numerical integration purposes. We
provide a fast algorithm to construct such designs for any numbers of
dimensions and points with R codes available online. Theoretical and numerical
results are also provided
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized
semi-Markov processes. The kernel of this pseudo-metric corresponds to
bisimulation; thus we have extended bisimulation for continuous-time
probabilistic processes to a much broader class of distributions than
exponential distributions. This pseudo-metric gives a useful handle on
approximate reasoning in the presence of numerical information -- such as
probabilities and time -- in the model. We give a fixed point characterization
of the pseudo-metric. This makes available coinductive reasoning principles for
reasoning about distances. We demonstrate that our approach is insensitive to
potentially ad hoc articulations of distance by showing that it is intrinsic to
an underlying uniformity. We provide a logical characterization of this
uniformity using a real-valued modal logic. We show that several quantitative
properties of interest are continuous with respect to the pseudo-metric. Thus,
if two processes are metrically close, then observable quantitative properties
of interest are indeed close.Comment: Preliminary version appeared in QEST 0
Construction of topologies, filters and uniformities for a product of sets
Starting from filters over the set of indices, we introduce structures in a
product of sets where the coordinate sets have the given structures
Many Different Uniformity Numbers of Yorioka Ideals
Using a countable support product of creature forcing posets, we show that
consistently, for uncountably many different functions the associated Yorioka
ideals' uniformity numbers can be pairwise different. In addition we show that,
in the same forcing extension, for two other types of simple cardinal
characteristics parametrised by reals (localisation and anti-localisation
cardinals), for uncountably many parameters the corresponding cardinals are
pairwise different.Comment: 29 pages, 4 figure
- âŠ