Stress intensity factors calculation in anti-plane fracture problem by orthogonal integral extraction method based on femol

For an anti-plane problem, the differential operator is self-adjoint and the corresponding eigenfunctions belong to the Hilbert space. The orthogonal property between eigenfunctions (or between the derivatives of eigenfunctions) of anti-plane problem is exploited. We developed for the first time two sets of radius-independent orthogonal integrals for extraction of stress intensity factors (SIFs), so any order SIF can be extracted based on a certain known solution of displacement (an analytic result or a numerical result). Many numerical examples based on the finite element method of lines (FEMOL) show that the present method is very powerful and efficient.

En las raíces ideológicas de Montoneros : John William Cooke lee a Gramsci en Cuba

Desde 1945 la izquierda argentina no pudo resolver el enigma planteado por el hecho de que la clase obrera era peronista. Varios intentos teóricos fracasaron antes de que John William Cooke hiciera el suyo a mediados de los años sesenta. Influenciado por Gramsci, consideró que la clase obrera es una categoría histórica, por lo que el peronismo era la experiencia histórica de la clase obrera argentina y, como tal, revolucionario. Neutralizó el papel político de Perón convirtiéndolo en el símbolo de la identidad peronista. Por esto, la teoría de Cooke fue clave para que guerrilleros de izquierda se declararan peronistas sin que les importaran las opiniones e intenciones políticas de Perón. Las limitaciones de esa teoría quedaron expuestas cuando el general regresó a la Argentina y fue electo presidente por tercera vez.

平面上旋转充液腔体稳定性问题的谱分析及状态空间算子的势理论

本文对充满均匀粘性液体的旋转对称腔体在光滑水平面上的平衡旋转态附近的振动模,导出本征方程?φ=0,对算子?进行谱分析,给出各模及总体的稳定性结论。本文还将Hilbert空间的算子势论推广到充液腔的复空间,给出与?相关的势泛函,从而获得二条泛函微分定理。本文方法比伴随变分更具普遍性。

FORTRAN语言的非数值应用

<正> 1.系统设计 利用高速计算机,进行微分方程公式的推导是数学研究工作的一个新的尝试,它将影响今后微分方程研究工作的现代化。 微分方程程序系统(Differential Equation Program System,简称DEPS)的主要用途是

Stress-distribution around a rigid line in dissimilar media

The elastic plane problem of a rigid line inclusion between two dissimilar media was considered. By solving the Riemann-Hilbert problem, the closed-form solution was obtained and the stress distribution around the rigid line was investigated. It was found that the modulus of the singular behavior of the stress remains proportional to the inverse square root of the distance from the rigid line end, but the stresses possess a pronounced oscillatory character as in the case of an interfacial crack tip.

El vino de los héroes homéricos

(ES) El vino tiene un importante papel en el mundo idealizado de los héroes homéricos. El poeta ofrece las primeras descripciones de vinos griegos, principalmente procedentes del norte del Egeo, situándolos en contextos muy variados, como centro del banquete, bebida reconstituyente, elemento imprescindible en plegarias y juramentos e incluso símbolo de honor que distingue a los personajes más destacados.

Stability of Switched Feedback Time-Varying Dynamic Systems Based on the Properties of the Gap Metric for Operators

The stabilization of dynamic switched control systems is focused on and based on an operator-based formulation. It is assumed that the controlled object and the controller are described by sequences of closed operator pairs (L, C) on a Hilbert space H of the input and output spaces and it is related to the existence of the inverse of the resulting input-output operator being admissible and bounded. The technical mechanism addressed to get the results is the appropriate use of the fact that closed operators being sufficiently close to bounded operators, in terms of the gap metric, are also bounded. That philosophy is followed for the operators describing the input-output relations in switched feedback control systems so as to guarantee the closed-loop stabilization.

El mito de Safo en el relato decadente

[FR] La femme homosexuelle, reflet d’un désir mythique hermaphrodite, est, pendant la fin du siècle une figure littéraire paradoxale et en même temps obsédante. Sapho est, comme la femme fatale, une des protagonistes de la fin-du-siècle qui répond à une misogynie récurrente dans l’imaginaire créateur. Il s’agit d’un désir artificiel, éros intangible (Péladan 1910: 74), contre nature, un idéal impossible: Sexe initial,sexe définitif, absolu de l’amour, absolu de la forme, sexe qui nies le sexe, sexe d’éternité! Los à toi, Androgyne! (Péladan 1910: 76). Sapho, figure archétypique, androgyne, constitue en définitive le symbole de l’abolition des sexes, de la confusion des genres, de la crise du couple traditionnel. Elle met en évidence la solitude, la peur et un désir inassouvi.

Completions of epsilon-dense partial Latin squares

A classical question in combinatorics is the following: given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of textbf{$epsilon$-dense partial Latin squares}: partial Latin squares in which each symbol, row, and column contains no more than $epsilon n$-many nonblank cells. Based on a conjecture of Nash-Williams, Daykin and H"aggkvist conjectured that all $frac{1}{4}$-dense partial Latin squares are completable. In this paper, we will discuss the proof methods and results used in previous attempts to resolve this conjecture, introduce a novel technique derived from a paper by Jacobson and Matthews on generating random Latin squares, and use this novel technique to study $ epsilon$-dense partial Latin squares that contain no more than $delta n^2$ filled cells in total.

In Chapter 2, we construct completions for all $ epsilon$-dense partial Latin squares containing no more than $delta n^2$ filled cells in total, given that $epsilon < frac{1}{12}, delta < frac{ left(1-12epsilonright)^{2}}{10409}$. In particular, we show that all $9.8 cdot 10^{-5}$-dense partial Latin squares are completable. In Chapter 4, we augment these results by roughly a factor of two using some probabilistic techniques. These results improve prior work by Gustavsson, which required $epsilon = delta leq 10^{-7}$, as well as Chetwynd and H"aggkvist, which required $epsilon = delta = 10^{-5}$, $n$ even and greater than $10^7$.

If we omit the probabilistic techniques noted above, we further show that such completions can always be found in polynomial time. This contrasts a result of Colbourn, which states that completing arbitrary partial Latin squares is an NP-complete task. In Chapter 3, we strengthen Colbourn's result to the claim that completing an arbitrary $left(frac{1}{2} + epsilonright)$-dense partial Latin square is NP-complete, for any $epsilon > 0$.

Colbourn's result hinges heavily on a connection between triangulations of tripartite graphs and Latin squares. Motivated by this, we use our results on Latin squares to prove that any tripartite graph $G = (V_1, V_2, V_3)$ such that begin{itemize} item $|V_1| = |V_2| = |V_3| = n$, item For every vertex $v in V_i$, $deg_+(v) = deg_-(v) geq (1- epsilon)n,$ and item $|E(G)| > (1 - delta)cdot 3n^2$ end{itemize} admits a triangulation, if $epsilon < frac{1}{132}$, $delta < frac{(1 -132epsilon)^2 }{83272}$. In particular, this holds when $epsilon = delta=1.197 cdot 10^{-5}$.

This strengthens results of Gustavsson, which requires $epsilon = delta = 10^{-7}$.

In an unrelated vein, Chapter 6 explores the class of textbf{quasirandom graphs}, a notion first introduced by Chung, Graham and Wilson cite{chung1989quasi} in 1989. Roughly speaking, a sequence of graphs is called "quasirandom"' if it has a number of properties possessed by the random graph, all of which turn out to be equivalent. In this chapter, we study possible extensions of these results to random $k$-edge colorings, and create an analogue of Chung, Graham and Wilson's result for such colorings.

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Special Frobenius Traces in Galois Representations

This thesis studies Frobenius traces in Galois representations from two different directions. In the first problem we explore how often they vanish in Artin-type representations. We give an upper bound for the density of the set of vanishing Frobenius traces in terms of the multiplicities of the irreducible components of the adjoint representation. Towards that, we construct an infinite family of representations of finite groups with an irreducible adjoint action.

In the second problem we partially extend for Hilbert modular forms a result of Coleman and Edixhoven that the Hecke eigenvalues a_p of classical elliptical modular newforms f of weight 2 are never extremal, i.e., a_p is strictly less than 2[square root]p. The generalization currently applies only to prime ideals p of degree one, though we expect it to hold for p of any odd degree. However, an even degree prime can be extremal for f. We prove our result in each of the following instances: when one can move to a Shimura curve defined by a quaternion algebra, when f is a CM form, when the crystalline Frobenius is semi-simple, and when the strong Tate conjecture holds for a product of two Hilbert modular surfaces (or quaternionic Shimura surfaces) over a finite field.

Chains of Non-regular de Branges Spaces

We consider canonical systems with singular left endpoints, and discuss the concept of a scalar spectral measure and the corresponding generalized Fourier transform associated with a canonical system with a singular left endpoint. We use the framework of de Branges’ theory of Hilbert spaces of entire functions to study the correspondence between chains of non-regular de Branges spaces, canonical systems with singular left endpoints, and spectral measures.

We find sufficient integrability conditions on a Hamiltonian H which ensure the existence of a chain of de Branges functions in the first generalized Pólya class with Hamiltonian H. This result generalizes de Branges’ Theorem 41, which showed the sufficiency of stronger integrability conditions on H for the existence of a chain in the Pólya class. We show the conditions that de Branges came up with are also necessary. In the case of Krein’s strings, namely when the Hamiltonian is diagonal, we show our proposed conditions are also necessary.

We also investigate the asymptotic conditions on chains of de Branges functions as t approaches its left endpoint. We show there is a one-to-one correspondence between chains of de Branges functions satisfying certain asymptotic conditions and chains in the Pólya class. In the case of Krein’s strings, we also establish the one-to-one correspondence between chains satisfying certain asymptotic conditions and chains in the generalized Pólya class.

The conjugate representation of signal envelope

The problem of the representation of signal envelope is treated, motivated by the classical Hilbert representation in which the envelope is represented in terms of the received signal and its Hilbert transform. It is shown that the Hilbert representation is the proper one if the received signal is strictly bandlimited but that some other filter is more appropriate in the bandunlimited case. A specific alternative filter, the conjugate filter, is proposed and the overall envelope estimation error is evaluated to show that for a specific received signal power spectral density the proposed filter yields a lower envelope error than the Hilbert filter.

Algebraic Techniques in Coding Theory: Entropy Vectors, Frames, and Constrained Coding

The study of codes, classically motivated by the need to communicate information reliably in the presence of error, has found new life in fields as diverse as network communication, distributed storage of data, and even has connections to the design of linear measurements used in compressive sensing. But in all contexts, a code typically involves exploiting the algebraic or geometric structure underlying an application. In this thesis, we examine several problems in coding theory, and try to gain some insight into the algebraic structure behind them.

The first is the study of the entropy region - the space of all possible vectors of joint entropies which can arise from a set of discrete random variables. Understanding this region is essentially the key to optimizing network codes for a given network. To this end, we employ a group-theoretic method of constructing random variables producing so-called "group-characterizable" entropy vectors, which are capable of approximating any point in the entropy region. We show how small groups can be used to produce entropy vectors which violate the Ingleton inequality, a fundamental bound on entropy vectors arising from the random variables involved in linear network codes. We discuss the suitability of these groups to design codes for networks which could potentially outperform linear coding.

The second topic we discuss is the design of frames with low coherence, closely related to finding spherical codes in which the codewords are unit vectors spaced out around the unit sphere so as to minimize the magnitudes of their mutual inner products. We show how to build frames by selecting a cleverly chosen set of representations of a finite group to produce a "group code" as described by Slepian decades ago. We go on to reinterpret our method as selecting a subset of rows of a group Fourier matrix, allowing us to study and bound our frames' coherences using character theory. We discuss the usefulness of our frames in sparse signal recovery using linear measurements.

The final problem we investigate is that of coding with constraints, most recently motivated by the demand for ways to encode large amounts of data using error-correcting codes so that any small loss can be recovered from a small set of surviving data. Most often, this involves using a systematic linear error-correcting code in which each parity symbol is constrained to be a function of some subset of the message symbols. We derive bounds on the minimum distance of such a code based on its constraints, and characterize when these bounds can be achieved using subcodes of Reed-Solomon codes.

Multiplication in Riesz spaces

A.G. Vulih has shown how an essentially unique intrinsic multiplication can be defined in certain types of Riesz spaces (vector lattices) L. In general, the multiplication is not universally defined in L, but L can always be imbedded in a large space L^# in which multiplication is universally defined.

If ф is a normal integral in L, then ф can be extended to a normal integral on a large space L₁(ф) in L^#, and L₁(ф) may be regarded as an abstract integral space. A very general form of the Radon-Nikodym theorem can be proved in L₁(ф), and this can be used to give a relatively simple proof of a theorem of Segal giving a necessary and sufficient condition that the Radon-Nikodym theorem hold in a measure space.

In another application, the multiplication is used to give a representation of certain Riesz spaces as rings of operators on a Hilbert space.