Partial instantiation methods for inference in first-order logic

Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-order logic that reduce the problem to a series of ground-level satisfiability problems. R. Jeroslow introduced a partial instantiation method of this kind that differs radically from the standard resolution-based methods. This paper lays the theoretical groundwork for an extension of his method that is general enough and efficient enough for general logic programming with indefinite clauses. In particular we improve Jeroslow's approach by (1) extending it to logic with functions, (2) accelerating it through the use of satisfiers, as introduced by Gallo and Rago, and (3) simplifying it to obtain further speedup. We provide a similar development for a "dual" partial instantiation approach defined by Hooker and suggest a primal-dual strategy. We prove correctness of the primal and dual algorithms for full first-order logic with functions, as well as termination on unsatisfiable formulas. We also report some preliminary computational results.

A comparative study of Pt/CeO2 catalysts for catalytic partial oxidation of methane to syngas for application in fuel cell electric vehicles

In the framework of a project aimed at developing a reliable hydrogen generator for mobile polymer electrolyte fuel cells (PEFCs), particular emphasis has been addressed to the analysis of catalysts able to assure high activity and stability in transient operations (frequent start-up and shut-down cycles). In this paper, the catalytic performance of 1 at.% Pt/ceria samples prepared by coprecipitation, impregnation and combustion, has been evaluated in the partial oxidation of methane. Methane conversion and hydrogen selectivity of 96 and 99%, respectively, associated with high stability during 100h of reaction under operative conditions (start-up and shut-down cycles), have been obtained. (C) 2002 Elsevier Science B.V. All rights reserved.

Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data. (C) 2011 Optical Society of America

Dynamic matrix rank with partial lookahead

We consider the problem of maintaining information about the rank of a matrix $M$ under changes to its entries. For an $n \times n$ matrix $M$, we show an amortized upper bound of $O(n^{\omega-1})$ arithmetic operations per change for this problem, where $\omega < 2.376$ is the exponent for matrix multiplication, under the assumption that there is a {\em lookahead} of up to $\Theta(n)$ locations. That is, we know up to the next $\Theta(n)$ locations $(i_1,j_1),(i_2,j_2),\ldots,$ whose entries are going to change, in advance; however we do not know the new entries in these locations in advance. We get the new entries in these locations in a dynamic manner.

Partial Flow Sensitivity

Compiler optimizations need precise and scalable analyses to discover program properties. We propose a partially flow-sensitive framework that tries to draw on the scalability of flow-insensitive algorithms while providing more precision at some specific program points. Provided with a set of critical nodes — basic blocks at which more precise information is desired — our partially flow-sensitive algorithm computes a reduced control-flow graph by collapsing some sets of non-critical nodes. The algorithm is more scalable than a fully flow-sensitive one as, assuming that the number of critical nodes is small, the reduced flow-graph is much smaller than the original flow-graph. At the same time, a much more precise information is obtained at certain program points than would had been obtained from a flow-insensitive algorithm.

OOCs, Partial Relative Difference Families and a Conjecture of Golomb

The cyclic difference sets constructed by Singer are also examples of perfect distinct difference sets (DDS). The Bose construction of distinct difference sets, leads to a relative difference set. In this paper we introduce the concept of partial relative DDS and prove that an optical orthogonal code (OOC) construction due to Moreno et. al., is a partial relative DDS. We generalize the concept of ideal matrices previously introduced by Kumar and relate it to the concepts of this paper. Another variation of ideal matrices is introduced in this paper: Welch ideal matrices of dimension n by (n - 1). We prove that Welch ideal matrices exist only for n prime. Finally, we recast an old conjecture of Golomb on the Welch construction of Costas arrays using the concepts of this paper. This connection suggests that our construction of partial relative difference sets is in a sense, unique

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

Low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, were given by Guo and Xia along with sufficient conditions for a Space-Time Block Code (STBC) to achieve full diversity with PIC/PIC-SIC decoding for point-to-point MIMO channels. In Part-I of this two part series of papers, we give new conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. We then show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks and give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders. In Part-II, we construct new low complexity full-diversity PIC/PIC-SIC decodable STBCs and DSTBCs that achieve higher rates than the known full-diversity low complexity ML decodable STBCs and DSTBCs.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

Variation of the partial thermodynamic properties of oxygen with composition in YBa2Cu3O7−δ

The variation of equilibrium oxygen potential with oxygen concentration inYBa 2Cu3O7-δhas been measured in the temperature range of 773 to 1223 K. For temperatures up to 1073 K, the oxygen content of theYBa 2Cu3O7-δsample, held in a stabilized-zirconia crucible, was altered by coulometric titration. The compound was in contact with the electrolyte, permitting direct exchange of oxygen ions. For measurements above 1073 K, the oxide was contained in a magnesia crucible placed inside a closed silica tube. The oxygen potential in the gas phase above the 123 compound was controlled and measured by a solid-state cell based on yttria-stabilized zirconia, which served both as a pump and sensor. Pure oxygen at a pressure of 1.01 × 105 Pa was used as the reference electrode. The oxygen pressure over the sample was varied from 10-1 to 105 Pa. The oxygen concentrations of the sample equilibrated with pure oxygen at 1.01 × 105 Pa at different temperatures were determined after quenching in liquid nitrogen by hydrogen reduction at 1223 K. The plot of chemical potential of oxygen as a function of oxygen non-stoichiometry shows an inflexion at δ ∼ 0.375 at 873 K. Data at 773 K indicate tendency for phase separation at lower temperatures. The partial enthalpy and entropy of oxygen derived from the temperature dependence of electromotive force (emf ) exhibit variation with composition. The partial enthalpy for °= 0.3, 0.4, and 0.5 also appears to be temperature dependent. The results are discussed in comparison with the data reported in the literature. An expression for the integral free energy of formation of YBa2Cu3O6.5 is evaluated based on measurements reported in the literature. By integration of the partial Gibbs’ energy of oxygen obtained in this study, the variation of integral property with oxygen concentration is obtained at 873 K.

A Generalized Enthalpy Update Scheme for Solidification of a Binary Alloy with Solid Phase Movement

A generalized enthalpy update scheme is presented for evaluating solid and liquid fractions during the solidification of binary alloys, taking solid movement into consideration. A fixed-grid, enthalpy-based method is developed such that the scheme accounts for equilibrium as well as for nonequilibrium solidification phenomena, along with solid phase movement. The effect of solid movement on the solidification interface shape and macrosegregation is highlighted.

Discovering injective episodes with general partial orders

Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.

Estimation of vapour pressure and partial pressure of subliming compounds by low-pressure thermogravimetry

A method for the estimation of vapour pressure and partial pressure of subliming compounds under reduced pressure, using rising temperature thermogravimetry, is described in this paper. The method is based on our recently developed procedure to estimate the vapour pressure from ambient pressure thermogravimetric data using Langmuir equation. Using benzoic acid as the calibration standard, vapour pressure temperature curves are calculated at 80, 160 and 1000 mbar for salicylic acid and vanadyl bis-2,4-pentanedionate, a precursor used for chemical vapour deposition of vanadium oxides. Using a modification of the Langmuir equation, the partial pressure of these materials at different total pressures is also determined as a function of temperature. Such data can be useful for the deposition of multi-metal oxide thin films or doped thin films by chemical vapour deposition (CVD).

Ganga-Brahmaputra river discharge from Jason-2 radar altimetry: An update to the long-term satellite-derived estimates of continental freshwater forcing flux into the Bay of Bengal

This paper discusses the use of Jason-2 radar altimeter measurements to estimate the Ganga-Brahmaputra surface freshwater flux into the Bay of Bengal for the period mid-2008 to December 2011. A previous estimate was generated for 1993-2008 using TOPEX-Poseidon, ERS-2 and ENVISAT, and is now extended using Jason-2. To take full advantages of the new availability of in situ rating curves, the processing scheme is adapted and the adjustments of the methodology are discussed here. First, using a large sample of in situ river height measurements, we estimate the standard error of Jason-2-derived water levels over the Ganga and the Brahmaputra to be respectively of 0.28 m and 0.19 m, or less than similar to 4% of the annual peak-to-peak variations of these two rivers. Using the in situ rating curves between water levels and river discharges, we show that Jason-2 accurately infers Ganga and Brahmaputra instantaneous discharges for 2008-2011 with mean errors ranging from similar to 2180 m(3)/s (6.5%) over the Brahmaputra to similar to 1458 m(3)/s (13%) over the Ganga. The combined Ganga-Brahmaputra monthly discharges meet the requirements of acceptable accuracy (15-20%) with a mean error of similar to 16% for 2009-2011 and similar to 17% for 1993-2011. The Ganga-Brahmaputra monthly discharge at the river mouths is then presented, showing a marked interannual variability with a standard deviation of similar to 12500 m(3)/s, much larger than the data set uncertainty. Finally, using in situ sea surface salinity observations, we illustrate the possible impact of extreme continental freshwater discharge event on the northern Bay of Bengal as observed in 2008.

Modified Newton, rank-1 Broyden update and rank-2 BFGS update methods in helicopter trim: A comparative study

Nonlinear equations in mathematical physics and engineering are solved by linearizing the equations and forming various iterative procedures, then executing the numerical simulation. For strongly nonlinear problems, the solution obtained in the iterative process can diverge due to numerical instability. As a result, the application of numerical simulation for strongly nonlinear problems is limited. Helicopter aeroelasticity involves the solution of systems of nonlinear equations in a computationally expensive environment. Reliable solution methods which do not need Jacobian calculation at each iteration are needed for this problem. In this paper, a comparative study is done by incorporating different methods for solving the nonlinear equations in helicopter trim. Three different methods based on calculating the Jacobian at the initial guess are investigated. (C) 2011 Elsevier Masson SAS. All rights reserved.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.