Generalized moment-independent importance measures based on Minkowski distance

Importance measures have been widely studied and applied in reliability and safety engineering. This paper presents a general formulation of moment-independent importance measures and several commonly discussed importance measures are unified based on Minkowski distance (MD). Moment-independent importance measures can be categorized into three classes of MD importance measures, i.e. probability density function based MD importance measure, cumulative distribution function based MD importance measure and quantile based MD importance measure. Some properties of the proposed MD importance measures are investigated. Several new importance measures are also derived as special cases of the generalized MD importance measures and illustrated with some case studies.     

Normality and boundary behaviour of arbitrary and meromorphic functions along simple curves and applications

In this paper, we establish some theorems giving necessary and sufficient conditions for an arbitrary function defined in the unit disc of the complex plane to have boundary values along classes of an equivalence relation over simple curves. Our results generalize the well-known theorems on asymptotic and angular boundary behaviours of meromorphic functions (Lindelölf-, Lehto–Virtanen- and Seidel–Walsh-type theorems). The obtained results are applied to the study of boundary behaviour of meromorphic functions along curves using P-sequences, as well as in the proof of the uniqueness theorem similar to ?aginjan’s one. The constructed examples of functions show that the results cannot be improved.     

Tuning the π‐π stacking distance and J‐aggregation of DPP‐based conjugated polymer via introducing insulating polymer

The close π–π stacking and the high J‐aggregation during the formation of fibrillar morphology in films of the poly[[2,5‐bis(2‐octyldodecyl)?2,3,5,6‐tetrahydro‐3,6‐dioxopyrrolo[3,4‐c]pyrrole‐1,4‐diyl]‐alt–[[2,2′‐(2,5‐thiophene)bis‐thieno[3,2‐b]thiophen]‐5,5′‐diyl]] (PDPPTT‐T) are demonstrated via blending with polystyrene (PS). The hydrodynamic radius (R_h) of PDPPTT‐T is decreased from 16.7 nm in the neat solution to 12.7 nm in the blend solution at the ratio of 1/20(PDPPTT‐T/PS). This phenomenon suggests that blending PS is beneficial for the disentanglement of PDPPTT‐T. The disentanglement of PDPPTT‐T facilitates the formation of fibrillar morphology. The growth of the fibrils occurs along the molecular backbones and the width of the fibrils is parallel to the π–π stacking direction. The disentanglement of PDPPTT‐T helps the molecules adjust conformation to improve J‐aggregation and decrease the π–π stacking distance. The maximum absorption is red‐shifted from 825 nm to 849 nm and the relative intensity of J‐aggregation (the 0‐0/0‐1 ratio) is increased from 1.19 to 1.60. The π–π stacking distance decreases from 3.57 to 3.52 Å. The charge‐carrier mobility will be improved in the fibrillar morphology with close π–π stacking and high J‐aggregation. © 2016 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2016 , 54, 838–847     

From level set to volume of fluid and back again at second‐order accuracy

We present methods for computing either the level set function or volume fraction field from the other at second‐order accuracy. Both algorithms are optimal in that O(N) computations are needed for N total grid points and both algorithms are easily parallelized. This work includes a novel interface reconstruction algorithm in three dimensions that requires a smaller local block of volume fractions than existing algorithms. A compact local solver leads to better algorithm portability and efficiency: for example, fewer restrictions must be imposed on an adaptive mesh, and fewer grid cells must be communicated between processors in a parallel implementation. We also present a fast sweeping method for computing a unique approximation of the signed distance function to a piecewise linear interface. All of the numerical examples confirm second‐order accuracy on both uniform and tree‐based adaptive grids. Copyright © 2015 John Wiley & Sons, Ltd.     

Automated inspection of micro-defect recognition system for color filter

This study focused on micro-defect recognition and classification in color filters. First, six types of defects were examined, namely grain, black matrix hole (BMH), indium tin oxide (ITO) defect, missing edge and shape (MES), highlights, and particle. Orthogonal projection was applied to locate each pixel in a test image. Then, an image comparison was performed to mark similar blocks on the test image. The block that best resembled the template was chosen as the new template (or matching adaptive template). Afterwards, image subtraction was applied to subtract the pixels at the same location in each block of the test image from the matching adaptive template. The control limit law employed logic operation to separate the defect from the background region. The complete defect structure was obtained by the morphology method. Next, feature values, including defect gray value, red, green, and blue (RGB) color components, and aspect ratio were obtained as the classifier input. The experimental results showed that defect recognition could be completed as fast as 0.154 s using the proposed recognition system and software. In micro-defect classification, back-propagation neural network (BPNN) and minimum distance classifier (MDC) served as the defect classification decision theories for the five acquired feature values. To validate the proposed system, this study used 41 defects as training samples, and treated the feature values of 307 test samples as the BPNN classifier inputs. The total recognition rate was 93.7%. When an MDC was used, the total recognition rate was 96.8%, indicating that the MDC method is feasible in applying automatic optical inspection technology to classify micro-defects of color filters. The proposed system is proven to successfully improve the production yield and lower costs.     

Sharp bounds on distance spectral radius of graphs

Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ?(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible.     

On the minimum average distance of binary constant weight codes

Let β(n,M,w) denote the minimum average Hamming distance of a binary constant weight code with length n, size M and weight w. In this paper, we study the problem of determining β(n,M,w). Using the methods from coding theory and linear programming, we derive several lower bounds on the average Hamming distance of a binary constant weight code. These lower bounds enable us to determine the exact value for β(n,M,w) in several cases.     

Surface-induced evaporative cooling

The effects of surface-induced evaporative cooling on an atom chip are investigated. The evolutions of temperature, number and phase-space density of the atom cloud are measured when the atom cloud is brought close to the surface. Rapid decrease of the temperature and number of the atoms is found when the atom-surface distance is < 100~μm. A gain of about a factor of five on the phase-space density is obtained. It is found that the efficiency of the surface-induced evaporative cooling depends on the atom-surface distance and the shape of the evaporative trap. When the atoms are moved very close to the surface, severe heating is observed, which dominates when the holding time is >8~ms. It is important that the surface-induced evaporative cooling offers novel possibilities for the realization of a continuous condensation, where a spatially varying evaporative cooling is required.     

Validation of hypersonic chemical equilibrium flow calculations using ballistic-range data

The hypersonic flow field over a sphere flying in a ballistic-range is numerically simulated for the purpose of validating a hypersonic chemical equilibrium flow solver. The numerical results obtained are compared with available experimental data on the stand-off distance and the shape of the detached bow shock wave. In the calculation, an adaptive mesh is employed for a crisp capturing of the shock wave. Comparison with the experimental data reveals that the equilibrium flow solver can yield a fairly accurate prediction of the flow field. Received 18 November 1997 / Accepted 10 November 1998