The simultaneous role of an alveolus as flow mixer and flow feeder for the deposition of inhaled submicron particles

In an effort to understand the fate of inhaled submicron particles in the small sacs, or alveoli, comprising the gas-exchange region of the lung, we calculated the flow in three-dimensional (3D) rhythmically expanding models of alveolated ducts. Since convection toward the alveolar walls is a precursor to particle deposition, it was the goal of this paper to investigate the streamline maps' dependence upon alveoli location along the acinar tree. On the alveolar midplane, the recirculating flow pattern exhibited closed streamlines with a stagnation saddle point. Off the midplane we found no closed streamlines but nested, funnel-like, spiral, structures (reminiscent of Russian nesting dolls) that were directed towards the expanding walls in inspiration, and away from the contracting walls in expiration. These nested, funnel-like, structures were surrounded by air that flowed into the cavity from the central channel over inspiration and flowed from the cavity to the central channel over expiration. We also found that fluid particle tracks exhibited similar nested funnel-like spiral structures. We conclude that these unique alveolar flow structures may be of importance in enhancing deposition. In addition, due to inertia, the nested, funnel-like, structures change shape and position slightly during a breathing cycle, resulting in flow mixing. Also, each inspiration feeds a fresh supply of particle-laden air from the central channel to the region surrounding the mixing region. Thus, this combination of flow mixer and flow feeder makes each individual alveolus an effective mixing unit, which is likely to play an important role in determining the overall efficiency of convective mixing in the acinus.

Leading coordinate analysis of reaction pathways in proton chain transfer: Application to a two-proton transfer model for the green fluorescent protein

The ‘leading coordinate’ approach to computing an approximate reaction pathway, with subsequent determination of the true minimum energy profile, is applied to a two-proton chain transfer model based on the chromophore and its surrounding moieties within the green fluorescent protein (GFP). Using an ab initio quantum chemical method, a number of different relaxed energy profiles are found for several plausible guesses at leading coordinates. The results obtained for different trial leading coordinates are rationalized through the calculation of a two-dimensional relaxed potential energy surface (PES) for the system. Analysis of the 2-D relaxed PES reveals that two of the trial pathways are entirely spurious, while two others contain useful information and can be used to furnish starting points for successful saddle-point searches. Implications for selection of trial leading coordinates in this class of proton chain transfer reactions are discussed, and a simple diagnostic function is proposed for revealing whether or not a relaxed pathway based on a trial leading coordinate is likely to furnish useful information.

Dynamics of learning with restricted training sets

The dynamics of supervised learning in layered neural networks were studied in the regime where the size of the training set is proportional to the number of inputs. The evolution of macroscopic observables, including the two relevant performance measures can be predicted by using the dynamical replica theory. Three approximation schemes aimed at eliminating the need to solve a functional saddle-point equation at each time step have been derived.

Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels

Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under low-density parity-check (LDPC) network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and symmetric and asymmetric interference. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases. © 2007 IOP Publishing Ltd.

Typical kernel size and number of sparse random matrices over Galois fields: a statistical physics approach

Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over GF(q), with a given connectivity profile, in the thermodynamical limit of large matrices. We introduce a mapping of GF(q) matrices onto spin systems using the representation of the cyclic group of order q as the q-th complex roots of unity. This representation facilitates the derivation of the average kernel size of random matrices using the replica approach, under the replica symmetric ansatz, resulting in saddle point equations for general connectivity distributions. Numerical solutions are then obtained for particular cases by population dynamics. Similar techniques also allow us to obtain an expression for the exact and average number of random matrices for any general connectivity profile. We present numerical results for particular distributions.

Some aspects of drill performance

High speed twist drills are probably the most common of all metal cutting tools and also the least efficient. In this study, detailed research was undertaken into aspects of drill performance and ways in which drilling could be improved in short hole depths of up to two diameters. The work included an evaluation of twist drill geometry and grinding parameters. It was established that errors in point grinding lead to increased hole oversize and reduced drill life. A fundamental analysis was made to establish predictive equations for the drill torque and thrust using modified orthogonal cutting equations and empirical data. A good correlation was obtained between actual and predicted results. Two new techniques for extending twist drill life by the use of coolant feeding holes and also the application of titanium nitride coatings were evaluated. Both methods were found to have potential for improving drill performance. A completely new design of carbide tipped drill was designed and developed. The new design was tested and it compared favourably with two commercially available carbide tipped drills. In further work an entirely different type of drill point geometry was developed for the drill screw. A new design was produced which enabled the drilling time to be minimised for the low thrust forces that were likely to be used with hand held power tools.

Non-Gaussian error probability in optical soliton transmission

We find the probability distribution of the fluctuating parameters of a soliton propagating through a medium with additive noise. Our method is a modification of the instanton formalism (method of optimal fluctuation) based on a saddle-point approximation in the path integral. We first solve consistently a fundamental problem of soliton propagation within the framework of noisy nonlinear Schrödinger equation. We then consider model modifications due to in-line (filtering, amplitude and phase modulation) control. It is examined how control elements change the error probability in optical soliton transmission. Even though a weak noise is considered, we are interested here in probabilities of error-causing large fluctuations which are beyond perturbation theory. We describe in detail a new phenomenon of soliton collapse that occurs under the combined action of noise, filtering and amplitude modulation. © 2004 Elsevier B.V. All rights reserved.

Nonlinear σ model for disordered superconductors

We suggest a variant of the nonlinear σ model for the description of disordered superconductors. The main distinction from existing models lies in the fact that the saddle point equation is solved nonperturbatively in the superconducting pairing field. It allows one to use the model both in the vicinity of the metal-superconductor transition and well below its critical temperature with full account for the self-consistency conditions. We show that the model reproduces a set of known results in different limiting cases, and apply it for a self-consistent description of the proximity effect at the superconductor-metal interface.

A Differential Game Described by a Hyperbolic System

An antagonistic differential game of hyperbolic type with a separable linear vector pay-off function is considered. The main result is the description of all ε-Slater saddle points consisting of program strategies, program ε-Slater maximins and minimaxes for each ε ∈ R^N > for this game. To this purpose, the considered differential game is reduced to find the optimal program strategies of two multicriterial problems of hyperbolic type. The application of approximation enables us to relate these problems to a problem of optimal program control, described by a system of ordinary differential equations, with a scalar pay-off function. It is found that the result of this problem is not changed, if the players use positional or program strategies. For the considered differential game, it is interesting that the ε-Slater saddle points are not equivalent and there exist two ε-Slater saddle points for which the values of all components of the vector pay-off function at one of them are greater than the respective components of the other ε-saddle point.

Variational Principles for Monotone and Maximal Bifunctions

2000 Mathematics Subject Classification: 49J40, 49J35, 58E30, 47H05

Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.

An Efficient Precoder Design for Multiuser MIMO Cognitive Radio Networks with Interference Constraints

We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm. 

Second-order elliptic PDE with discontinuous boundary data

We shall consider the weak formulation of a linear elliptic model problem with discontinuous Dirichlet boundary conditions. Since such problems are typically not well-defined in the standard H^1-H^1 setting, we will introduce a suitable saddle point formulation in terms of weighted Sobolev spaces. Furthermore, we will discuss the numerical solution of such problems. Specifically, we employ an hp-discontinuous Galerkin method and derive an L^2-norm a posteriori error estimate. Numerical experiments demonstrate the effectiveness of the proposed error indicator in both the h- and hp-version setting. Indeed, in the latter case exponential convergence of the error is attained as the mesh is adaptively refined.

People semantic description and re-identification from point cloud geometry

The automatic extraction of biometric descriptors of anonymous people is a challenging scenario in camera networks. This task is typically accomplished making use of visual information. Calibrated RGBD sensors make possible the extraction of point cloud information. We present a novel approach for people semantic description and re-identification using the individual point cloud information. The proposal combines the use of simple geometric features with point cloud features based on surface normals.

Elements of analytical geometry: embracing the equations of the point, the straight line, the conic sections, and surfaces of the first and second order.

Mode of access: Internet.