Search results for "rete"
showing 10 items of 3470 documents
Unitary units and skew elements in group algebras
2003
Let FG be the group algebra of a group G over a field F and let * denote the canonical involution of FG induced by the map g→g −1 ,gG. Let Un(FG)={uFG|uu * =1} be the group of unitary units of FG. In case char F=0, we classify the torsion groups G for which Un(FG) satisfies a group identity not vanishing on 2-elements. Along the way we actually prove that, in characteristic 0, the unitary group Un(FG) does not contain a free group of rank 2 if FG − , the Lie algebra of skew elements of FG, is Lie nilpotent. Motivated by this connection we characterize most groups G for which FG − is Lie nilpotent and char F≠2.
Polynomials generated by linear operators
2004
We study the class of Banach algebra-valued n n -homogeneous polynomials generated by the n t h n^{th} powers of linear operators. We compare it with the finite type polynomials. We introduce a topology w E F w_{EF} on E , E, similar to the weak topology, to clarify the features of these polynomials.
On an Inequality for Trigonometric Polynomials In Several Variables
1990
Publisher Summary This chapter presents trigonometric polynomials in n variables. Using the methods of approximation theory, an inequality can be extended to almost periodic functions and to still more general classes of functions as in the case for Bohr's inequality. However, no analogous result exists in the case of two variables. For the solution of problems containing small divisors, the estimate has to be completed by theorems concerning the best approximation of holomorphic functions by trigonometric polynomials in polystrips. The chapter also presents equations to provide an estimate for a differential operator.
Complex Numbers and Polynomials
2016
As mentioned in Chap. 1, for a given set and an operator applied to its elements, if the result of the operation is still an element of the set regardless of the input of the operator, then the set is said closed with respect to that operator.
Maximum weight relaxed cliques and Russian Doll Search revisited
2015
Trukhanov et al. [Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comp. Opt. and Appl., 56(1), 113–130] used the Russian Doll Search (RDS) principle to effectively find maximum hereditary structures in graphs. Prominent examples of such hereditary structures are cliques and some clique relaxations intensely discussed and studied in network analysis. The effectiveness of the tailored RDS by Trukhanov et al. for s-plex and s-defective clique can be attributed to their cleverly designed incremental verification procedures used to distinguish feasible from infeasible struct…
On the chromatic number of disk graphs
1998
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.
Anaerobic thermophilic (55°C) treatment of TMP whitewater in reactors based on biomass attachment and entrapment
1999
Abstract Thermomechanical pulping (TMP) whitewater was treated in thermophilic (55°C) anaerobic laboratory-scale reactors using three different reactor configurations. In all reactors up to 70 % COD removals were achieved. The anaerobic hybrid reactor, composed of an upflow anaerobic sludge blanket (UASB) and a filter, gave degradation rates up to 10 kg COD/m 3 d at loading rates of 15 kg COD/m 3 d and hydraulic retention time (HRT) of 3.1 hours. The anaerobic multi-stage reactor, consisting of three compartments, each packed with granular sludge and carrier elements, gave degradation rates up to 9 kg COD/m 3 d at loading rates of 15–16 kg COD/m 3 d, and HRT down to 2.6 hours. Clogging and …
The Permeable Concrete: A Low Energy Consumption Solution for Deep Draining Trenches
2018
The reduction of pore water pressures is one of the very effective measures to improve the stability conditions of marginally stable water-bearing slopes or to stabilise landslides. For this purpose the trench drains have been used long since. Like filling material of deep trenches the permeable concrete can be effectively employed. It presents relatively high hydraulic conductivity, filtering capacity in order to prevent the internal erosion of the soil in which the trench drain is installed, enough residual hydraulic conductivity after possible clogging, sufficient shear strength after a short curing time to avoid the instabilisation of adjacent previously built panels or piles. Results o…
Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean
2015
Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…
A Combinatorial Color Edge Detector
2004
In this paper, we present an edge detection approach in color image using neighborhood hypergraph. The edge structure is detected by a structural model. The Color Image Neighborhood Hypergraph (CINH) representation is first computed, then the hyperedges of CINH are classified into noise or edge based on hypergraph properties. To evaluate the algorithm performance, experiments were carried out on synthetic and real color images corrupted by alpha-stable noise. The results show that the proposed edge detector finds the edges properly from color images.