A note on Sommerfeld's diffraction problem

A direct transform technique is found to be most suitable for attacking two-dimensional diffraction problems. As a first example of the application of the technique, the well-known Sommerfeld problem is reconsidered and the solution of the problem of diffraction, by a half-plane, of a cylindrical pulse is made use of in deducing the solution of the problem of diffraction of a plane wave by a soft half-plane. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

The transfer problem and the intertemporal terms of trade

In this paper the effects of a transfer on the intertemporal terms of trade are examined in the context of a simple two-country, two-period model. When intertemporal trade occurs because the two economies have different rates of time preference, a transfer improves the terms of trade of the paying country. Alternatively, when trade occurs owing to international differences in the endowments of goods over the two periods, the effect of a transfer depends on (a) the relationship between the interest rate and the rates of time preference of the two countries and (b) the relationship between their elasticities of intertemporal consumption substitution.

Mathematical model and rule extraction for tool wear monitoring problem using nature inspired techniques

In this paper, pattern classification problem in tool wear monitoring is solved using nature inspired techniques such as Genetic Programming(GP) and Ant-Miner (AM). The main advantage of GP and AM is their ability to learn the underlying data relationships and express them in the form of mathematical equation or simple rules. The extraction of knowledge from the training data set using GP and AM are in the form of Genetic Programming Classifier Expression (GPCE) and rules respectively. The GPCE and AM extracted rules are then applied to set of data in the testing/validation set to obtain the classification accuracy. A major attraction in GP evolved GPCE and AM based classification is the possibility of obtaining an expert system like rules that can be directly applied subsequently by the user in his/her application. The performance of the data classification using GP and AM is as good as the classification accuracy obtained in the earlier study.

What the problem may be with family intervention . . . and with dissemination more generally: A commentary

While the two decades since the study by Kavanagh et al. (1993) has given additional insights into effective dissemination of family interventions, the accompanying papers show that progress remains limited. The effectiveness trial that triggered this series of papers offers a cautionary tale. Despite management support, 30–35 hr of workshop training and training of local supervisors who could act as champions, use of the full intervention was limited. In part, this seemed due to the demanding nature of the intervention and its incompatibility with practitioners’ roles, in part, to limitations in the training, among other factors. While the accompanying papers note these and other barriers to dissemination, they miss a more disturbing finding in the original paper: Practitioners said they were using several aspects in routine care, despite being unable to accurately describe what they were. This finding highlights the risks in taking practitioners’ reports of their practice in files or supervision sessions at face value and potentially has implications for reports of other clinical work. The fidelity of disseminated treatments can only be assured by audits of practice, accompanied by affirming but also corrective feedback.

On-line Dynamic Security Assessment: Determination of Critical Transmission Lines

The main objective of on-line dynamic security assessment is to take preventive action if required or decide remedial action if a contingency actually occurs. Stability limits are obtained for different contingencies. The mode of instability is one of the outputs of dynamic security analysis. When a power system becomes unstable, it splits initially into two groups of generators, and there is a unique cutset in the transmission network known as critical cutset across which the angles become unbounded. The knowledge of critical cutset is additional information obtained from dynamic security assessment, which can be used for initiating preventive control actions, deciding emergency control actions, and adaptive out-of-step relaying. In this article, an analytical technique for the fast prediction of the critical cutset by system simulation for a short duration is presented. Case studies on the New England ten-generator system are presented. The article also suggests the applications of the identification of critical cutsets.

Accurate Parameter Estimation of Contaminant Transport Inverse Problem using Particle Swarm Optimization

Swarm Intelligence techniques such as particle swarm optimization (PSO) are shown to be incompetent for an accurate estimation of global solutions in several engineering applications. This problem is more severe in case of inverse optimization problems where fitness calculations are computationally expensive. In this work, a novel strategy is introduced to alleviate this problem. The proposed inverse model based on modified particle swarm optimization algorithm is applied for a contaminant transport inverse model. The inverse models based on standard-PSO and proposed-PSO are validated to estimate the accuracy of the models. The proposed model is shown to be out performing the standard one in terms of accuracy in parameter estimation. The preliminary results obtained using the proposed model is presented in this work.

A Combinatorial Optimization Problem for High Order PODs with Few Sensors

Experimental characterization of high dimensional dynamic systems sometimes uses the proper orthogonal decomposition (POD). If there are many measurement locations and relatively fewer sensors, then steady-state behavior can still be studied by sequentially taking several sets of simultaneous measurements. The number required of such sets of measurements can be minimized if we solve a combinatorial optimization problem. We aim to bring this problem to the attention of engineering audiences, summarize some known mathematical results about this problem, and present a heuristic (suboptimal) calculation that gives reasonable, if not stellar, results.

Understanding who cares: Creating the evidence to address the long-standing policy problem of staff shortages in early childhood education and care

Evidence-based policy is a means of ensuring that policy is informed by more than ideology or expedience. However, what constitutes robust evidence is highly contested. In this paper, we argue policy must draw on quantitative and qualitative data. We do this in relation to a long entrenched problem in Australian early childhood education and care (ECEC) workforce policy. A critical shortage of qualified staff threatens the attainment of broader child and family policy objectives linked to the provision of ECEC and has not been successfully addressed by initiatives to date. We establish some of the limitations of existing quantitative data sets and consider the potential of qualitative studies to inform ECEC workforce policy. The adoption of both quantitative and qualitative methods is needed to illuminate the complex nature of the work undertaken by early childhood educators, as well as the environmental factors that sustain job satisfaction in a demanding and poorly understood working environment.

Correlation, Coding, and Cooperation in Wireless Sensor Networks

We consider a single-hop data-gathering sensor network, consisting of a set of sensor nodes that transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. With our definition of network lifetime and the assumption that the radio transmission energy consumption forms the most significant portion of the total energy consumption at a sensor node, we attempt to enhance the network lifetime by reducing the transmission energy budget of sensor nodes by exploiting three system-level opportunities. We pose the problem of maximizing lifetime as a max-min optimization problem subject to the constraint of successful data collection and limited energy supply at each node. This turns out to be an extremely difficult optimization to solve. To reduce the complexity of this problem, we allow the sensor nodes and the base-station to interactively communicate with each other and employ instantaneous decoding at the base-station. The chief contribution of the paper is to show that the computational complexity of our problem is determined by the complex interplay of various system-level opportunities and challenges.

Distributed joint source channel coding on a multiple access channel with side information

We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.

Energy identities in water wave theory for free-surface boundary condition with higher-order derivatives

A modified form of Green's integral theorem is employed to derive the energy identity in any water wave diffraction problem in a single-layer fluid for free-surface boundary condition with higher-order derivatives. For a two-layer fluid with free-surface boundary condition involving higher-order derivatives, two forms of energy identities involving transmission and reflection coefficients for any wave diffraction problem are also derived here by the same method. Based on this modified Green's theorem, hydrodynamic relations such as the energy-conservation principle and modified Haskind–Hanaoka relation are derived for radiation and diffraction problems in a single as well as two-layer fluid.

Correlative fluorescence and transmission electron microscopy: An elegant tool to study the actin cytoskeleton of whole-mount (breast) cancer cells

Elucidating the structure and dynamics of lamellipodia and filopodia in response to different stimuli is a topic of continuing interest in cancer cells as these structures may be attractive targets for therapeutic purposes. Interestingly, a close functional relationship between these actin-rich protrusions and specialized membrane domains has been recently demonstrated. The aim of this study was therefore to investigate the fine organization of these actin-rich structures and examine how they structurally may relate to detergent-resistant membrane (DRM) domains in the MTLn3 EGF/serum starvation model. For this reason, we designed a straightforward and alternative method to study cytoskeleton arrays and their associated structures by means of correlative fluorescence (/laser)- and electron microscopy (CFEM). CFEM on whole mounted breast cancer cells revealed that a lamellipodium is composed of an intricate filamentous actin web organized in various patterns after different treatments. Both actin dots and DRM's were resolved, and were closely interconnected with the surrounding cytoskeleton. Long actin filaments were repeatedly observed extending beyond the leading edge and their density and length varied after different treatments. Furthermore, CFEM also allowed us to demonstrate the close structural association of DRMs with the cytoskeleton in general and the filamentous/dot-like structural complexes in particular, suggesting that they are all functionally linked and consequently may regulate the cell's fingertip dynamics. Finally, electron tomographic modelling on the same CFEM samples confirmed that these extensions are clearly embedded within the cytoskeletal matrix of the lamellipodium.

Landau-Zener problem with waiting at the minimum gap and related quench dynamics of a many-body system

We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

A FEM-Based Forward Solver for Studying the Forward Problem of Electrical Impedance Tomography (EIT) with A Practical Biological Phantom

A Finite Element Method based forward solver is developed for solving the forward problem of a 2D-Electrical Impedance Tomography. The Method of Weighted Residual technique with a Galerkin approach is used for the FEM formulation of EIT forward problem. The algorithm is written in MatLAB7.0 and the forward problem is studied with a practical biological phantom developed. EIT governing equation is numerically solved to calculate the surface potentials at the phantom boundary for a uniform conductivity. An EIT-phantom is developed with an array of 16 electrodes placed on the inner surface of the phantom tank filled with KCl solution. A sinusoidal current is injected through the current electrodes and the differential potentials across the voltage electrodes are measured. Measured data is compared with the differential potential calculated for known current and solution conductivity. Comparing measured voltage with the calculated data it is attempted to find the sources of errors to improve data quality for better image reconstruction.