Empirical analysis of the effect of dimension reduction and word order on semantic vectors

The aim of this paper is to provide a comparison of various algorithms and parameters to build reduced semantic spaces. The effect of dimension reduction, the stability of the representation and the effect of word order are examined in the context of the five algorithms bearing on semantic vectors: Random projection (RP), singular value decom- position (SVD), non-negative matrix factorization (NMF), permutations and holographic reduced representations (HRR). The quality of semantic representation was tested by means of synonym finding task using the TOEFL test on the TASA corpus. Dimension reduction was found to improve the quality of semantic representation but it is hard to find the optimal parameter settings. Even though dimension reduction by RP was found to be more generally applicable than SVD, the semantic vectors produced by RP are somewhat unstable. The effect of encoding word order into the semantic vector representation via HRR did not lead to any increase in scores over vectors constructed from word co-occurrence in context information. In this regard, very small context windows resulted in better semantic vectors for the TOEFL test.

Towards Bayesian experimental design for nonlinear models that require a large number of sampling times

The use of Bayesian methodologies for solving optimal experimental design problems has increased. Many of these methods have been found to be computationally intensive for design problems that require a large number of design points. A simulation-based approach that can be used to solve optimal design problems in which one is interested in finding a large number of (near) optimal design points for a small number of design variables is presented. The approach involves the use of lower dimensional parameterisations that consist of a few design variables, which generate multiple design points. Using this approach, one simply has to search over a few design variables, rather than searching over a large number of optimal design points, thus providing substantial computational savings. The methodologies are demonstrated on four applications, including the selection of sampling times for pharmacokinetic and heat transfer studies, and involve nonlinear models. Several Bayesian design criteria are also compared and contrasted, as well as several different lower dimensional parameterisation schemes for generating the many design points.

Fiber Bragg grating strain modulation based on nonlinear string transverse force amplifier

The only effective method of Fiber Bragg Grating (FBG) strain modulation has been by changing the distance between its two fixed ends. We demonstrate an alternative being more sensitive to force based on the nonlinear amplification relationship between a transverse force applied to a stretched string and its induced axial force. It may improve the sensitivity and size of an FBG force sensor, reduce the number of FBGs needed for multi-axial force monitoring, and control the resonant frequency of an FBG accelerometer.

Identification of copper species present in Cu-ZSM-5 catalysts for NOx reduction

The structure of Cu-ZSM-5 catalysts that show activity for direct NO decomposition and selective catalytic reduction of NOx by hydrocarbons has been investigated by a multitude of modern surface analysis and spectroscopy techniques including X-ray photoelectron spectroscopy, thermogravimetric analysis, and in situ Fourier transform infrared spectroscopy. A series of four catalysts were prepared by exchange of Na-ZSM-5 with dilute copper acetate, and the copper loading was controlled by variation of the solution pH. Underexchanged catalysts contained isolated Cu2+OH-(H2O) species and as the copper loading was increased Cu2+ ions incorporated into the zeolite lattice appeared. The sites at which the latter two copper species were located were fundamentally different. The Cu2+OH-(H2O) moieties were bound to two lattice oxygen ions and associated with one aluminum framework species. In contrast, the Cu2+ ions were probably bound to four lattice oxygen ions and associated with two framework aluminum ions. Once the Cu-ZSM-5 samples attained high levels of exchange, the development of [Cu(μ-OH)2Cu]n2+OH-(H2O) species along with a small concentration of Cu(OH)2 was observed. On activation in helium to 500°C the Cu2+OH-(H2O) species transformed into Cu2+O- and Cu+ moieties, whereas the Cu2+ ions were apparently unaffected by this treatment (apart from the loss of ligated water molecules). Calcination of the precursors resulted in the formation of Cu2+O2- and a one-dimensional CuO species. Temperature-programmed desorption studies revealed that oxygen was removed from the latter two species at 407 and 575°C, respectively. © 1999 Academic Press.

Oxide reduction in NiO-containing solid solution systems during transmission electron microscopy

The effects of electron irradiation on NiO-containing solid solution systems are described. Partially hydrated NiO solid solutions, e. g. , NiO-MgO, undergo surface reduction to Ni metal after examination by TEM. This surface layer results in the formation of Moire interference patterns.

High strong order methods for non-commutative stochastic ordinary differential equation systems and the Magnus formula

In recent years considerable attention has been paid to the numerical solution of stochastic ordinary differential equations (SODEs), as SODEs are often more appropriate than their deterministic counterparts in many modelling situations. However, unlike the deterministic case numerical methods for SODEs are considerably less sophisticated due to the difficulty in representing the (possibly large number of) random variable approximations to the stochastic integrals. Although Burrage and Burrage [High strong order explicit Runge-Kutta methods for stochastic ordinary differential equations, Applied Numerical Mathematics 22 (1996) 81-101] were able to construct strong local order 1.5 stochastic Runge-Kutta methods for certain cases, it is known that all extant stochastic Runge-Kutta methods suffer an order reduction down to strong order 0.5 if there is non-commutativity between the functions associated with the multiple Wiener processes. This order reduction down to that of the Euler-Maruyama method imposes severe difficulties in obtaining meaningful solutions in a reasonable time frame and this paper attempts to circumvent these difficulties by some new techniques. An additional difficulty in solving SODEs arises even in the Linear case since it is not possible to write the solution analytically in terms of matrix exponentials unless there is a commutativity property between the functions associated with the multiple Wiener processes. Thus in this present paper first the work of Magnus [On the exponential solution of differential equations for a linear operator, Communications on Pure and Applied Mathematics 7 (1954) 649-673] (applied to deterministic non-commutative Linear problems) will be applied to non-commutative linear SODEs and methods of strong order 1.5 for arbitrary, linear, non-commutative SODE systems will be constructed - hence giving an accurate approximation to the general linear problem. Secondly, for general nonlinear non-commutative systems with an arbitrary number (d) of Wiener processes it is shown that strong local order I Runge-Kutta methods with d + 1 stages can be constructed by evaluated a set of Lie brackets as well as the standard function evaluations. A method is then constructed which can be efficiently implemented in a parallel environment for this arbitrary number of Wiener processes. Finally some numerical results are presented which illustrate the efficacy of these approaches. (C) 1999 Elsevier Science B.V. All rights reserved.

Efficient solution of two-sided nonlinear space-fractional diffusion equations using fast Poisson preconditioners

We develop a fast Poisson preconditioner for the efficient numerical solution of a class of two-sided nonlinear space fractional diffusion equations in one and two dimensions using the method of lines. Using the shifted Gr¨unwald finite difference formulas to approximate the two-sided(i.e. the left and right Riemann-Liouville) fractional derivatives, the resulting semi-discrete nonlinear systems have dense Jacobian matrices owing to the non-local property of fractional derivatives. We employ a modern initial value problem solver utilising backward differentiation formulas and Jacobian-free Newton-Krylov methods to solve these systems. For efficient performance of the Jacobianfree Newton-Krylov method it is essential to apply an effective preconditioner to accelerate the convergence of the linear iterative solver. The key contribution of our work is to generalise the fast Poisson preconditioner, widely used for integer-order diffusion equations, so that it applies to the two-sided space fractional diffusion equation. A number of numerical experiments are presented to demonstrate the effectiveness of the preconditioner and the overall solution strategy.

A banded preconditioner for the two-sided, nonlinear space-fractional diffusion equation

The method of lines is a standard method for advancing the solution of partial differential equations (PDEs) in time. In one sense, the method applies equally well to space-fractional PDEs as it does to integer-order PDEs. However, there is a significant challenge when solving space-fractional PDEs in this way, owing to the non-local nature of the fractional derivatives. Each equation in the resulting semi-discrete system involves contributions from every spatial node in the domain. This has important consequences for the efficiency of the numerical solver, especially when the system is large. First, the Jacobian matrix of the system is dense, and hence methods that avoid the need to form and factorise this matrix are preferred. Second, since the cost of evaluating the discrete equations is high, it is essential to minimise the number of evaluations required to advance the solution in time. In this paper, we show how an effective preconditioner is essential for improving the efficiency of the method of lines for solving a quite general two-sided, nonlinear space-fractional diffusion equation. A key contribution is to show, how to construct suitable banded approximations to the system Jacobian for preconditioning purposes that permit high orders and large stepsizes to be used in the temporal integration, without requiring dense matrices to be formed. The results of numerical experiments are presented that demonstrate the effectiveness of this approach.

Optimally increasing secure connectivity in multihop wireless ad hoc networks

We consider the problem of how to maximize secure connectivity of multi-hop wireless ad hoc networks after deployment. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by secret keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one is based of increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We show that both problems are NP-hard and MAX-SNP (i.e., it is NP-hard to approximate them within a factor of 1 + e for e > 0 ) with a reduction to MAX3SAT problem. Thus, we design and implement a fully distributed algorithm for authenticated key establishment in wireless sensor networks where each sensor knows only its one- hop neighborhood. Our witness based approaches find witnesses in multi-hop neighborhood to authenticate the key establishment between two sensor nodes which do not share a key and which are not connected through a secure path.

Nanoporous Graphitic-C3N4@Carbon Metal-Free Electrocatalysts for Highly Efficient Oxygen Reduction

Based on theoretical prediction, a g-C3N4@carbon metal-free oxygen reduction reaction (ORR) electrocatalyst was designed and synthesized by uniform incorporation of g-C3N4 into a mesoporous carbon to enhance the electron transfer efficiency of g-C3N4. The resulting g-C3N4@carbon composite exhibited competitive catalytic activity (11.3 mA cm–2 kinetic-limiting current density at −0.6 V) and superior methanol tolerance compared to a commercial Pt/C catalyst. Furthermore, it demonstrated significantly higher catalytic efficiency (nearly 100% of four-electron ORR process selectivity) than a Pt/C catalyst. The proposed synthesis route is facile and low-cost, providing a feasible method for the development of highly efficient electrocatalysts.

Complexity of increasing the secure connectivity in wireless ad hoc networks

We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem.

Reduction in resting plasma granulysin as a marker of increased training load

Granulysin is a cytolytic granule protein released by natural killer cells and activated cytotoxic T lymphocytes. The influence of exercise training on circulating granulysin concentration is unknown, as is the relationship between granulysin concentration, natural killer cell number and natural killer cell cytotoxicity. We examined changes in plasma granulysin concentration, natural killer cell number and cytotoxicity following acute exercise and different training loads. Fifteen highly trained male cyclists completed a baseline 40-km cycle time trial (TT401) followed by five weeks of normal training and a repeat time trial (TT402). The cyclists then completed four days of high intensity training followed by another time trial (TT403) on day five. Following one final week of normal training cyclists completed another time trial (TT404). Fasting venous blood was collected before and after each time trial to determine granulysin concentration, natural killer cell number and natural killer cell cytotoxicity. Granulysin concentration increased significantly after each time trial (P<0.001). Pre-exercise granulysin concentration for TT403 was significantly lower than pre-exercise concentration for TT401 (-20.3 +/- 7.5%, P<0.026), TT402 (-16.7 +/- 4.3%, P<0.003) and 7T404 (-21 +/- 4.2%, P<0.001). Circulating natural killer cell numbers also increased significantly post-exercise for each time trial (P<0.001), however there was no significant difference across TT40 (P>0.05). Exercise did not significantly alter natural killer cell cytotoxicity on a per cell basis, and there were no significant differences between the four time trials. In conclusion, plasma granulysin concentration increases following moderate duration, strenuous exercise and is decreased in response to a short-term period of intensified training.

Numerical approximation for a variable-order nonlinear reaction–subdiffusion equation

Fractional reaction–subdiffusion equations are widely used in recent years to simulate physical phenomena. In this paper, we consider a variable-order nonlinear reaction–subdiffusion equation. A numerical approximation method is proposed to solve the equation. Its convergence and stability are analyzed by Fourier analysis. By means of the technique for improving temporal accuracy, we also propose an improved numerical approximation. Finally, the effectiveness of the theoretical results is demonstrated by numerical examples.