Search results for "FC"
showing 10 items of 1442 documents
Three-page encoding and complexity theory for spatial graphs
2004
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
Consensus in inventory games
2008
This paper studies design, convergence, stability and optimality of a distributed consensus protocol for n-player repeated non cooperative games under incomplete information. Information available to each player concerning the other players' strategies evolves in time. At each stage (time period), the players select myopically their best binary strategy on the basis of a payoff, defined on a single stage, monotonically decreasing with the number of active players. The game is specialized to an inventory application, where fixed costs are shared among all retailers, interested in reordering or not from a common warehouse. As information evolves in time, the number of active players changes t…
Guidelines to Select Between Self-Contained Electro-Hydraulic and Electro-Mechanical Cylinder
2020
This research paper presents guidelines on how to select between self-contained electro-hydraulic and electromechanical cylinders. An example based on the motion control of a single-boom crane is studied. The sizing process of the different off-the-shelf components is analyzed in terms of design impact when replacing a traditional valve-controlled hydraulic cylinder. The self-contained electro-hydraulic solution is the best choice when a risk for high impact forces is present, when the required output power level lies continuously above 2 kW, or when installation space, weight, and cost are critical design objectives. However, the electro-mechanical solution is expected to show more control…
Innovations, Reinvented Politics and Representative Democracy
2020
"This volume focuses on the issue of change in democratic politics in terms of experimental or actual innovations introduced either within political parties or outside the party system, involving citizen participation and mobilization (...)"
Radiative corrections in Dalitz decays of π0, η and η′ mesons
2019
We briefly summarize current experimental and theoretical results on the two important processes of the low-energy hadron physics involving neutral pions: the Dalitz decay of π0 and the rare decay π0 → e+e−. As novel results we present the complete set of radiative corrections to the Dalitz decays η(′) → l+l−γ beyond the soft-photon approximation, i.e. over the whole range of the Dalitz plot and with no restrictions on the energy of a radiative photon. The corrections inevitably depend on the η(′) → γ*γ(*) transition form factors.
Fusion in the character table
1998
Suppose that P P is a Sylow p p -subgroup of a finite p p -solvable group G G . If g ∈ P g \in P , then the number of G G -conjugates of g g in P P can be read off from the character table of G G .
Molecular spintronics: the role of coordination chemistry.
2016
Welcome to this themed issue of Dalton Transactions entitled ‘Molecular spintronics: the role of coordination chemistry’.
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Self-stabilizing Balls & Bins in Batches
2016
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. [Azar et al.; JoC'99] showed that d=2 yields an exponential improvement compared to d=1. [Berenbrink et al.; JoC'06] extended this to m ⇒ n, showing that the maximal load difference is independent of m for d=2 (in contrast…
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
2007
We describe the development and testing of a metaheuristic procedure, based on the scatter-search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of scatter search to multiobjective optimization problems has not been fully explored in the literature. We test the proposed procedure on a suite of problems that have been used extensively in multiobjective optimization. Additional tests are performed on instances that are an extension of those consid…