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.

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.

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).

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.

Full-rate full-diversity achieving MIMO precoding with partial CSIT

In this paper, we consider a slow-fading nt ×nr multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of interest in such channels. We propose a new precoding scheme which achieves both full diversity (nt ×nrth order diversity) as well as full rate (nt symbols per channel use) using partial channel state information at the transmitter (CSIT). The proposed scheme achieves full diversity and improved coding gain through an optimization over the choice of constellation sets. The optimization maximizes dmin2 for our precoding scheme subject to an energy constraint. The scheme requires feedback of nt - 1 angle parameter values, compared to 2ntnr real coefficients in case of full CSIT. Further, for the case of nt × 1 system, we prove that the capacity achieved by the proposed scheme is same as that achieved with full CSIT. Error rate performance results for nt = 3,4,8 show that the proposed scheme performs better than other precoding schemes in the literature; the better performance is due to the choice of the signal sets and the feedback angles in the proposed scheme.

Reduced-complexity partial-interference-cancellation group decoder for STBCs

In this letter, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.

Partial delamination modeling in composite beams using a finite element method

A new method of modeling partial delamination in composite beams is proposed and implemented using the finite element method. Homogenized cross-sectional stiffness of the delaminated beam is obtained by the proposed analytical technique, including extension-bending, extension-twist and torsion-bending coupling terms, and hence can be used with an existing finite element method. A two noded C1 type Timoshenko beam element with 4 degrees of freedom per node for dynamic analysis of beams is implemented. The results for different delamination scenarios and beams subjected to different boundary conditions are validated with available experimental results in the literature and/or with the 3D finite element simulation using COMSOL. Results of the first torsional mode frequency for the partially delaminated beam are validated with the COMSOL results. The key point of the proposed model is that partial delamination in beams can be analyzed using a beam model, rather than using 3D or plate models. (c) 2013 Elsevier B.V. All rights reserved.

Scheduling for Fading Channels Under Partial Channel Information

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughput-optimal policy for the network under QoS constraints when real-time and rate-guaranteed data traffic may be present.