Matrix crack detection in spatially random composite structures using fractal dimension

Fractal dimension based damage detection method is studied for a composite structure with random material properties. A composite plate with localized matrix crack is considered. Matrix cracks are often seen as the initial damage mechanism in composites. Fractal dimension based method is applied to the static deformation curve of the structure to detect localized damage. Static deflection of a cantilevered composite plate under uniform loading is calculated using the finite element method. Composite material shows spatially varying random material properties because of complex manufacturing processes. Spatial variation of material property is represented as a two dimensional homogeneous Gaussian random field. Karhunen-Loeve (KL) expansion is used to generate a random field. The robustness of fractal dimension based damage detection methods is studied considering the composite plate with spatial variation in material properties.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Asymptotic behavior and interpretation of virtual states: The effects of confinement and of basis sets

A real-space high order finite difference method is used to analyze the effect of spherical domain size on the Hartree-Fock (and density functional theory) virtual eigenstates. We show the domain size dependence of both positive and negative virtual eigenvalues of the Hartree-Fock equations for small molecules. We demonstrate that positive states behave like a particle in spherical well and show how they approach zero. For the negative eigenstates, we show that large domains are needed to get the correct eigenvalues. We compare our results to those of Gaussian basis sets and draw some conclusions for real-space, basis-sets, and plane-waves calculations. (C) 2016 AIP Publishing LLC.

Practical Criterion for Universal Laws and Practical Methods for Construction of Co-variance Sets

给出相对论力学中普遍定律的实用判别法和协变集的实用构造法,还给出实现非普遍定律的“可导出性”的一种实用方法．

Permeability of Fractal Porous Media by Monte Carlo Simulations

The permeability of the fractal porous media is simulated by Monte Carlo technique in this work. Based oil the fractal character of pore size distribution in porous media, the probability models for pore diameter and for permeability are derived. Taking the bi-dispersed fractal porous media as examples, the permeability calculations are performed by the present Monte Carlo method. The results show that the present simulations present a good agreement compared with the existing fractal analytical solution in the general interested porosity range. The proposed simulation method may have the potential in prediction of other transport properties (such as thermal conductivity, dispersion conductivity and electrical conductivity) in fractal porous media, both saturated and unsaturated.

The Pressure Transient Analysis Of Deformation Of Fractal Medium

The assumption of constant rock properties in pressure-transient analysis of stress-sensitive reservoirs can cause significant errors in the estimation of temporal and spatial variation of pressure. In this article, the pressure transient response of the fractal medium in stress-sensitive reservoirs was studied by using the self-similarity solution method and the regular perturbation method. The dependence of permeability on pore pressure makes the flow equation strongly nonlinear. The nonlinearities associated with the governing equation become weaker by using the logarithm transformation. The perturbation solutions for a constant pressure production and a constant rate production of a linear-source well were obtained by using the self-similarity solution method and the regular perturbation method in an infinitely large system, and inquire into the changing rule of pressure when the fractal and deformation parameters change. The plots of typical pressure curves were given in a few cases, and the results can be applied to well test analysis.

Fractal Pattern Formation In Anodic Bonding Of Pyrex Glass/Al/Si

Anodic bonding of Pyrex glass/Al/Si is an important bonding technique in micro/nanoelectromechanical systems (MEMS/NEMS) industry. The anodic bonding of Pyrex 7740 glass/Aluminum film/Silicon is completed at the temperature from 300 degrees C to 375 degrees C with a bonding voltage between 150 V and 450 V. The fractal patterns are formed in the intermediate Al thin film. This pattern has the fractal dimension of the typical two-dimensional diffusion-limited aggregation (2D DLA) process, and the fractal dimension is around 1.7. The fractal patterns consist of Al and Si crystalline grains, and their occurrences are due to the limited diffusion, aggregation, and crystallization of Si and Al atoms in the intermediate Al layers. The formation of the fractal pattern is helpful to enhance the bonding strength between the Pyrex 7740 glass and the aluminum thin film coated on the crystal silicon substrates.

Fractal geometry model for effective thermal conductivity of three-phase porous media

An approximate model, a fractal geometry model, for the effective thermal conductivity of three-phase/unsaturated porous media is proposed based on the thermal-electrical analogy technique and on statistical self-similarity of porous media. The proposed thermal conductivity model is expressed as a function of porosity (related to stage n of Sierpinski carpet), ratio of areas, ratio of component thermal conductivities, and saturation. The recursive algorithm for the thermal conductivity by the proposed model is presented and found to be quite simple. The model predictions are compared with the existing measurements. Good agreement is found between the present model predictions and the existing experimental data. This verifies the validity of the proposed model. (C) 2004 American Institute of Physics.

Fractal dimensions for unsaturated porous media

The analytical expressions of the fractal dimensions for wetting and non-wetting phases for unsaturated porous media are derived and are found to be a function of porosity, maximum and minimum pore sizes as well as saturation. There is no empirical constant in the proposed fractal dimensions. It is also found that the fractal dimensions increase with porosity of a medium and are meaningful only in a certain range of saturation S-w, i.e. S-w > S-min for wetting phase and S-w < S-max for non-wetting phase at a given porosity, based on real porous media for requirements from both fractal theory and experimental observations. The present analysis of the fractal dimensions is verified to be consistent with the existing experimental observations and it makes possible to analyze the transport properties such as permeability, thermal dispersion in unsaturated porous media by fractal theory and technique.