Search results for "SOFC"
showing 10 items of 660 documents
A lower bound for the Bloch radius of 𝐾-quasiregular mappings
2004
We give a quantitative proof to Eremenko’s theorem (2000), which extends Bloch’s classical theorem to the class of n n -dimensional K K -quasiregular mappings.
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.
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 musical reading of a contemporary installation and back: mathematical investigations of patterns in Qwalala
2021
Mathematical music theory helps us investigate musical compositions in mathematical terms. Some hints can be extended towards the visual arts. Mathematical approaches can also help formalize a "translation" from the visual domain to the auditory one and vice versa. Thus, a visual artwork can be mathematically investigated, then translated into music. The final, refined musical rendition can be compared to the initial visual idea. Can an artistic idea be preserved through these changes of media? Can a non-trivial pattern be envisaged in an artwork, and then still be identified after the change of medium? Here, we consider a contemporary installation and an ensemble musical piece derived from…
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.
When is a 𝑝-block a 𝑞-block?
1997
Let p p and q q be distinct prime numbers and let G G be a finite group. If B p B_{p} is a p p -block of G G and B q B_{q} is a q q -block, we study when the set of ordinary irreducible characters in the blocks B p B_{p} and B q B_{q} coincide.
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
Hausdorff dimension from the minimal spanning tree
1993
A technique to estimate the Hausdorff dimension of strange attractors, based on the minimal spanning tree of the point distribution is extensively tested in this work. This method takes into account in some sense the infimum requirement appearing in the definition of the Hausdorff dimension. It provides accurate estimates even for a low number of data points and it is especially suited to high-dimensional systems.
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.