Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Dynamical cluster approximation: Nonlocal dynamics of correlated electron systems

We recently introduced the dynamical cluster approximation (DCA), a technique that includes short-ranged dynamical correlations in addition to the local dynamics of the dynamical mean-field approximation while preserving causality. The technique is based on an iterative self-consistency scheme on a finite-size periodic cluster. The dynamical mean-field approximation (exact result) is obtained by taking the cluster to a single site (the thermodynamic limit). Here, we provide details of our method, explicitly show that it is causal, systematic, Phi derivable, and that it becomes conserving as the cluster size increases. We demonstrate the DCA by applying it to a quantum Monte Carlo and exact enumeration study of the two-dimensional Falicov-Kimball model. The resulting spectral functions preserve causality, and the spectra and the charge-density-wave transition temperature converge quickly and systematically to the thermodynamic limit as the cluster size increases.

Probabilistic Analysis of Cracking Moment of Reinforced Concrete Beams

Probabilistic analysis of cracking moment from 22 simply supported reinforced concrete beams is performed. When the basic variables follow the distribution considered in this study, the cracking moment of a beam is found to follow a normal distribution. An expression is derived, for characteristic cracking moment, which will be useful in examining reinforced concrete beams for a limit state of cracking.

An Accurate Model For Interference From Spatially Distributed Shadowed Users in CDMA Uplinks

A detailed characterization of interference power statistics in CDMA systems is of considerable practical and theoretical interest. Such a characterization for uplink inter-cell interference has been difficult because of transmit power control, randomness in the number of interfering mobile stations, and randomness in their locations. We develop a new method to model the uplink inter-cell interference power as a lognormal distribution, and show that it is an order of magnitude more accurate than the conventional Gaussian approximation even when the average number of mobile stations per cell is relatively large and even outperforms the moment-matched lognormal approximation considered in the literature. The proposed method determines the lognormal parameters by matching its moment generating function with a new approximation of the moment generating function for the inter-cell interference. The method is tractable and exploits the elegant spatial Poisson process theory. Using several numerical examples, the accuracy of the proposed method in modeling the probability distribution of inter-cell interference is verified for both small and large values of interference.

A two-dimensional model for crack closure effect in plates under bending

A two-dimensional model is proposed for taking into account the establishment of contact on the compression side of crack faces in plates under bending. An approximate but simple method is developed for evaluating reduction of stress intensity factor due to such ‘crack closure’. Analysis is first carried out permitting interference of the crack faces. Contact forces are then introduced on the crack faces and their magnitudes determined from the consideration that the interference is just eliminated. The method is based partly on finite element analysis and partly on a continuum analysis using Irwin's solution for point loads on the crack line.

Study of the random vibration of nonlinear systems by the Gaussian closure technique

A technique is developed to study random vibration of nonlinear systems. The method is based on the assumption that the joint probability density function of the response variables and input variables is Gaussian. It is shown that this method is more general than the statistical linearization technique in that it can handle non-Gaussian excitations and amplitude-limited responses. As an example a bilinear hysteretic system under white noise excitation is analyzed. The prediction of various response statistics by this technique is in good agreement with other available results.

Observation of crack closure using a crack mouth opening displacement gauge

A crack mouth opening displacement (CMOD) gauge has been designed to estimate the crack length as well as the crack opening stress level in an automated fatigue crack propagation test programme. The CMOD gauge accurately predicts crack tip opening levels in K-controlled tests with constant K, K increasing or K decreasing. In all three K-controlled tests with a single 100% overload cycle, the CMOD gauge does not measure the crack tip opening stress level over a large range of crack lengths after the application of the overload. The CMOD gauge measures the stress level at which the overload plastic zone site opens. Caution should thus be exercised in using the crack opening stress level, estimated by the CMOD gauge, to explain fatigue crack propagation under arbitrary load sequences from the viewpoint of crack closure phenomena.

Therapeutic work with the present moment: A conversation analytical study of guidance into immediacy

Therapeutic work with the client’s present moment experience in existential therapy was studied by means of conversation analysis. Using publicly available video recordings of therapy sessions as data, an existential therapist’s practice of guiding a client into immediacy, or refocusing the talk on a client’s immediate experience, was described and compared with a therapist’s corresponding action in cognitive therapy. The study contributes to the description of interactional practice of existential therapy, and involves the first application of conversation analysis to a comparative study of psychotherapy process. The potential utility of this approach and the clinical and empirical implications of the present findings are discussed.

Approximation of Internal Refractive Index Variation Improves Image Guided Diffuse Optical Tomography of Breast

Effective usage of image guidance by incorporating the refractive index (RI) variation in computational modeling of light propagation in tissue is investigated to assess its impact on optical-property estimation. With the aid of realistic patient breast three-dimensional models, the variation in RI for different regions of tissue under investigation is shown to influence the estimation of optical properties in image-guided diffuse optical tomography (IG-DOT) using numerical simulations. It is also shown that by assuming identical RI for all regions of tissue would lead to erroneous estimation of optical properties. The a priori knowledge of the RI for the segmented regions of tissue in IG-DOT, which is difficult to obtain for the in vivo cases, leads to more accurate estimates of optical properties. Even inclusion of approximated RI values, obtained from the literature, for the regions of tissue resulted in better estimates of optical properties, with values comparable to that of having the correct knowledge of RI for different regions of tissue.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.