Search results for "TRANSFORMATION"
showing 10 items of 1634 documents
Analysis of the crystallization behaviour of PBT-rich PBT/PET blends under processing conditions
2007
Among the high‐performance polyesters blends PBT/PET blends are expected to exhibit remarkable properties as far as the crystallization behaviour is concerned. The solidification behaviour of a 60/40 w/w PBT/PET blend was studied in a wide range of cooling conditions, according to a Continuous Cooling Transformation (CCT) procedure developed by the authors, aiming to emulate the typical conditions encountered in polymer processing. A set of several samples characterized by an homogeneous structure was prepared by solidification from the melt through spray cooling, and the resulting structure and properties were evaluated by density, Micro Hardness (MH), Wide Angle X‐ray Diffraction (WAXD) m…
Levy targeting and the principle of detailed balance
2011
We investigate confining mechanisms for Lévy flights under premises of the principle of detailed balance. In this case, the master equation of the jump-type process admits a transformation to the Lévy-Schrödinger semigroup dynamics akin to a mapping of the Fokker-Planck equation into the generalized diffusion equation. This sets a correspondence between above two stochastic dynamical systems, within which we address a (stochastic) targeting problem for an arbitrary stability index μ ε (0,2) of symmetric Lévy drivers. Namely, given a probability density function, specify the semigroup potential, and thence the jump-type dynamics for which this PDF is actually a long-time asymptotic (target) …
Digital Transformation: An Overview of the Current State of the Art of Research
2021
[EN] The increasing digitalization of economies has highlighted the importance of digital transformation and how it can help businesses stay competitive in the market. However, disruptive changes not only occur at the company level; they also have environmental, societal, and institutional implications. This is the reason why during the past two decades the research on digital transformation has received growing attention, with a wide range of topics investigated in the literature. The following aims to provide insight regarding the current state of the literature on digital transformation (DT) by conducting a systematic literature review. An analysis of co-occurrence using the software VOS…
Industry 4.0 transition: a systematic literature review combining the absorptive capacity theory and the data–information–knowledge hierarchy
2021
Purpose The effect of the transition toward digital technologies on today’s businesses (i.e. Industry 4.0 transition) is becoming increasingly relevant, and the number of studies that have examined this phenomenon has grown rapidly. However, systematizing the existing findings is still a challenge, from both a theoretical and a managerial point of view. In such a setting, the knowledge management (KM) discipline can provide guidance to address such a gap. Indeed, the implementation of fundamental digital technologies is reshaping how firms manage knowledge. Thus, this study aims to critically review the existing literature on Industry 4.0 from a KM perspective. Design/methodology/approach …
Singular systems in dimension 3: Cuspidal case and tangent elliptic flat case
2007
We study two singular systems in R3. The first one is affine in control and we achieve weighted blowings-up to prove that singular trajectories exist and that they are not locally time optimal. The second one is linear in control. The characteristic vector field in sub-Riemannian geometry is generically singular at isolated points in dimension 3. We define a case with symmetries, which we call flat, and we parametrize the sub-Riemannian sphere. This sphere is subanalytic.
Planar maps whose second iterate has a unique fixed point
2007
Let a>0, F: R^2 -> R^2 be a differentiable (not necessarily C^1) map and Spec(F) be the set of (complex) eigenvalues of the derivative F'(p) when p varies in R^2. (a) If Spec(F) is disjoint of the interval [1,1+a[, then Fix(F) has at most one element, where Fix(F) denotes the set of fixed points of F. (b) If Spec(F) is disjoint of the real line R, then Fix(F^2) has at most one element. (c) If F is a C^1 map and, for all p belonging to R^2, the derivative F'(p) is neither a homothety nor has simple real eigenvalues, then Fix(F^2) has at most one element, provided that Spec(F) is disjoint of either (c1) the union of the number 0 with the intervals ]-\infty, -1] and [1,\infty[, or (c2) t…
Dimensions of random affine code tree fractals
2014
We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.
On the computational power of affine automata
2017
We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.
The Alternating BWT: an algorithmic perspective
2020
Abstract The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several areas in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in Gessel et al. (2012) [21] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in Giancarlo et al. (2018) [23] , where we have shown that BWT and ABWT are part of a larger class of reversible transformations, …
On a Conjecture by Christian Choffrut
2017
It is one of the most famous open problems to determine the minimum amount of states required by a deterministic finite automaton to distinguish a pair of strings, which was stated by Christian Choffrut more than thirty years ago. We investigate the same question for different automata models and we obtain new upper and lower bounds for some of them including alternating, ultrametric, quantum, and affine finite automata.