Search results for "SOFC"

A branch-and-price framework for decomposing graphs into relaxed cliques

2021

We study the family of problems of partitioning and covering a graph into/with a minimum number of relaxed cliques. Relaxed cliques are subsets of vertices of a graph for which a clique-defining property—for example, the degree of the vertices, the distance between the vertices, the density of the edges, or the connectivity between the vertices—is relaxed. These graph partitioning and covering problems have important applications in many areas such as social network analysis, biology, and disease-spread prevention. We propose a unified framework based on branch-and-price techniques to compute optimal decompositions. For this purpose, new, effective pricing algorithms are developed, and new…

Convergence in discrete Cauchy problems and applications to circle patterns

2005

A lattice-discretization of analytic Cauchy problems in two dimensions is presented. It is proven that the discrete solutions converge to a smooth solution of the original problem as the mesh size ε \varepsilon tends to zero. The convergence is in C ∞ C^\infty and the approximation error for arbitrary derivatives is quadratic in ε \varepsilon . In application, C ∞ C^\infty -approximation of conformal maps by Schramm’s orthogonal circle patterns and lattices of cross-ratio minus one is shown.

Accordo di Programma MSE-CNR - Gruppo tematico: Celle a Combustibile (wp1) Responsabile scientifico del Progetto Vincenzo Antonucci - Accordo di Coll…

2010

On groups having a p-constant character

2020

Let G G be a finite group, and p p a prime number; a character of G G is called p p -constant if it takes a constant value on all the elements of G G whose order is divisible by p p . This is a generalization of the very important concept of characters of p p -defect zero. In this paper, we characterize the finite p p -solvable groups having a faithful irreducible character that is p p -constant and not of p p -defect zero, and we will show that a non- p p -solvable group with this property is an almost-simple group.

Degrees of irreducible characters of the symmetric group and exponential growth

2015

We consider sequences of degrees of ordinary irreducible S n S_n - characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of n n with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound.

A True Extension of the Markov Inequality to Negative Random Variables

2020

The Markov inequality is a classical nice result in statistics that serves to demonstrate other important results as the Chebyshev inequality and the weak law of large numbers, and that has useful applications in the real world, when the random variable is unspecified, to know an upper bound for the probability that an variable differs from its expectation. However, the Markov inequality has one main flaw: its validity is limited to nonnegative random variables. In the very short note, we propose an extension of the Markov inequality to any non specified random variable. This result is completely new.

Famiglia e responsabilità

2015

The work traces the path that led to the development of civil liability in family law. On one hand, it seems to share the idea of strengthening the protection of the person in familiar group; on the other hand, it focuses on the opportunity of leading, under certain circumstances, the affection of non-pecuniary familiar interests to the breach of contract.

Channel Switching Protocols Hinder the Transition to IP World: The Pentagon Story

2019

In this paper, we target the strategy for telecommunications architectures during the transition to the IP-only models. The paper discusses the shifting from circuit switching to packet switching in telecommunications. Particularly, we analyze the coexistence of circuit switching and packet switching technologies in American military communications where each warfare object should have own IP address. The paper discusses the role of multifunction Soft Switches (MFSS). This Soft Switch plays the role of a media gateway between TDM channels and IP channels. As a case, we are passing through the transformation from SS7 signaling to internet protocol, ISDN-based government Defense Red Switch Ne…

Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs

2009

AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.

Law, Borders, and Speech Conference: Proceedings and Materials

2017

Tensions between national law and the Internet’s global architecture have existed since the network’s earliest days. They took on new urgency in recent years, with developments like French regulators’ efforts to globally enforce “Right to Be Forgotten” laws. New cases, technologies, and platform responses seem to come along every few months. Expert-level discussion of these issues is dynamic and fast-moving -- but the written literature is only starting to catch up. This volume contributes to that literature by capturing insights from the Stanford Center for Internet and Society’s Law, Borders, and Speech conference. The event honored the twentieth anniversary of David G. Post and David R. …