The rectilinear distance Weber problem in the presence of a probabilistic line barrier

This paper considers the problem of locating a single facility in the presence of a line barrier that occurs randomly on a given horizontal route on the plane. The objective is to locate this new facility such that the sum of the expected rectilinear distances from the facility to the demand points in the presence of the probabilistic barrier is minimized. Some properties of the problem are reported, a solution algorithm is provided with an example problem, and some future extensions to the problem are discussed.     

Improved induced matchings in sparse graphs

An induced matching in a graph G=(V,E) is a matching M such that (V,M) is an induced subgraph of G. Clearly, among two vertices with the same neighbourhood (called twins) at most one is matched in any induced matching, and if one of them is matched then there is another matching of the same size that matches the other vertex. Motivated by this, Kanj et al. [10] studied induced matchings in twinless graphs. They showed that any twinless planar graph contains an induced matching of size at least and that there are twinless planar graphs that do not contain an induced matching of size greater than . We improve both these bounds to , which is tight up to an additive constant. This implies that the problem of deciding whether a planar graph has an induced matching of size k has a kernel of size at most 28k. We also show for the first time that this problem is fixed parameter tractable for graphs of bounded arboricity.Kanj et al. also presented an algorithm which decides in -time whether an n-vertex planar graph contains an induced matching of size k. Our results improve the time complexity analysis of their algorithm. However, we also show a more efficient -time algorithm. Its main ingredient is a new, O^∗(4^l)-time algorithm for finding a maximum induced matching in a graph of branch width at most l.     

A bound on the treewidth of planar even-hole-free graphs

The class of planar graphs has unbounded treewidth, since the k×k grid, ∀k∈N, is planar and has treewidth k. So, it is of interest to determine subclasses of planar graphs which have bounded treewidth. In this paper, we show that if G is an even-hole-free planar graph, then it does not contain a 9×9 grid minor. As a result, we have that even-hole-free planar graphs have treewidth at most 49.     

A graph-theoretic approach to a partial order of knots and links

We say that a link L₁ is an s-major of a link L₂ if any diagram of L₁ can be transformed into a diagram of L₂ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knots and links with the crossing number less than or equal to six. The proofs are given by graph-theoretic methods.     

In situ 2-D piezoelectric wafer active sensors arrays for guided wave damage detection

This paper presented development work of an in situ method for damage detection in thin-wall structures using embedded two-dimensional ultrasonic phased arrays. Piezoelectric wafer active sensors were used to generate and receive guided Lamb waves propagating in the plate-like structure. The development of a generic beamforming algorithm that does not require parallel ray assumption through using full wave propagation paths is described. A virtual beam steering method and device, the embedded ultrasonic structural radar, was implemented as a signal post-processing procedure. Several two-dimensional configurations were investigated and compared with beamforming simulation. Finally, rectangular shape arrays were developed for verifying the generic formulas and omnidirectionality. The rectangular arrays yield good directionality within the 360° full range and are able to detect damage anywhere in the entire plate.     

Gallai’s path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $?(n+1)∕2?$. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.     

Existence and stability of spatially localized patterns

Spatially localized patterns have been observed in numerous physical contexts, and their bifurcation diagrams often exhibit similar snaking behavior: symmetric solution branches, connected by bifurcating asymmetric solution branches, wind back and forth in an appropriate parameter. Previous papers have addressed existence of such solutions; here we address their stability, taking the necessary first step of unifying existence and uniqueness proofs for symmetric and asymmetric solutions. We then show that, under appropriate assumptions, temporal eigenvalues of the front and back underlying a localized solution are added with multiplicity in the right half plane. In a companion paper, we analyze the behavior of eigenvalues at $\lambda =0$ and inside the essential spectrum. Our results show that localized snaking solutions are stable if, and only if, the underlying fronts and backs are stable: unlike localized non-oscillatory solutions, no interaction eigenvalues are present. We use the planar Swift–Hohenberg system to illustrate our results.     

Emergence of a non-Fowler-Nordheim-type behavior for a general planar tunneling barrier

In this work we investigate a generalized tunneling barrier for planar emitters at zero-temperature. We present the evidence of the emergence of a non-Fowler-Nordheim-type general behavior for the field emission current density in the case that the Fermi energy (μ) is comparable with or smaller that the decay width ($d_F$). Therefore, for some non-metals or materials that have very small Fermi energy the standard Fowler-Nordheim-type theory may require a correction. In the opposite regime, i.e., for μ much larger that $d_F$, we confirm that the conventional theory is suitable for metals.     

Model Biological Membranes and Possibilities of Application of Electrochemical Impedance Spectroscopy for their Characterization

Biological membranes are essential parts of living systems. They represent an interface between intracellular and extracellular space. Depending on their structure, they often perform very complex functions and play an important role in the transport of both charged and uncharged particles in any organism. Structure of the biological membranes, which play very important role in electrochemical processes inside living organisms, is very complicated and still not precisely defined and explained. Model lipid membranes are used to gain detail information about properties of real biological membranes and about associated electrochemical processes. Electrochemistry, especially electrochemical impedance spectroscopy (EIS), can play a useful role in the characterization of properties of model lipid membranes (planar and supported lipid bilayers, tethered lipid membranes, liposomes, etc.). This review is focused on model biological membranes and the possibilities and limitations of electrochemical methods and namely of EIS in this field.