Generation and optimization of electron currents along the walls of a conical target for fast ignition

The interaction of an ultraintense laser pulse with a conical target is studied by means of numerical particle-in-cell simulations in the context of fast ignition. The divergence of the fast electron beam generated at the tip of the cone has been shown to be a crucial parameter for the efficient coupling of the ignition laser pulse to the precompressed fusion pellet. In this paper, we demonstrate that a focused hot electron beam is produced at the cone tip, provided that electron currents flowing along the surfaces of the cone sidewalls are efficiently generated. The influence of various interaction parameters over the formation of these wall currents is investigated. It is found that the strength of the electron flows is enhanced for high laser intensities, low density targets, and steep density gradients inside the cone. The hot electron energy distribution obeys a power law for energies of up to a few MeV, with the addition of a high-energy Maxwellian tail.

Molecular-assisted immunohistochemical optimization

Immunohistochemistry (IHC) is an essential tool in diagnostic surgical pathology, allowing analysis of protein subcellular localization The use of IHC by different laboratories has lead to inconsistencies in published literature for several antibodies, due to either interpretative (inter-observer venation) or technical reasons These disparities have major implications in both clinical and research settings In this study, we report our experience conducting an IHC optimization of antibodies against five proteins previously identified by proteomic analysis to be breast cancer biomarkers, namely 6PGL (PGLS), CAZ2 (CAPZA2), PA2G4 (EBP1) PSD2 and TKT Large variations in the immunolocalizations and intensities were observed when manipulating the antigen retrieval method and primary antibody incubation concentration However, the use of an independent molecular analysis method provided a clear indication in choosing the appropriate biologically and functionally relevant

Low-complexity iterative method of equalization for single carrier with cyclic prefix in doubly selective channels

Orthogonal frequency division multiplexing (OFDM) requires an expensive linear amplifier at the transmitter due to its high peak-to-average power ratio (PAPR). Single carrier with cyclic prefix (SC-CP) is a closely related transmission scheme that possesses most of the benefits of OFDM but does not have the PAPR problem. Although in a multipath environment, SC-CP is very robust to frequency-selective fading, it is sensitive to the time-selective fading characteristics of the wireless channel that disturbs the orthogonality of the channel matrix (CM) and increases the computational complexity of the receiver. In this paper, we propose a time-domain low-complexity iterative algorithm to compensate for the effects of time selectivity of the channel that exploits the sparsity present in the channel convolution matrix. Simulation results show the superior performance of the proposed algorithm over the standard linear minimum mean-square error (L-MMSE) equalizer for SC-CP.

Convergence of the iterative algorithm for a general Hammerstein system identification

The convergence of the iterative identification algorithm for a general Hammerstein system has been an open problem for a long time. In this paper, it is shown that the convergence can be achieved by incorporating a regularization procedure on the nonlinearity in addition to a normalization step on the parameters.

Two-stage RBF network construction based on particle swarm optimization

The conventional radial basis function (RBF) network optimization methods, such as orthogonal least squares or the two-stage selection, can produce a sparse network with satisfactory generalization capability. However, the RBF width, as a nonlinear parameter in the network, is not easy to determine. In the aforementioned methods, the width is always pre-determined, either by trial-and-error, or generated randomly. Furthermore, all hidden nodes share the same RBF width. This will inevitably reduce the network performance, and more RBF centres may then be needed to meet a desired modelling specification. In this paper we investigate a new two-stage construction algorithm for RBF networks. It utilizes the particle swarm optimization method to search for the optimal RBF centres and their associated widths. Although the new method needs more computation than conventional approaches, it can greatly reduce the model size and improve model generalization performance. The effectiveness of the proposed technique is confirmed by two numerical simulation examples.