Thermomechanical generalization of partial contact in pin joints

Mechanical fasteners introduce structural weakness, still they are an essential constituent of most structures as they permit interchangeability of parts and flexible construction programs; Variable temperature operations of Aerospace and Nuclear structures make it imperative to investigate the thermoelastic behaviour of joints. This paper explores analytically similar mechanical and thermal parameters to generalise the thermomechanical behaviour of a pin joint in an isotropic Sheet for a class of configurations. This generalization enables virtually direct application of existing information regarding joints under pure mechanical loading to joints subjected to combined thermomechanical loading, thus reducing the efforts of both the analyst and the designer by an order of magnitude. Copyright (C) 1996 Published by Elsevier Science Ltd.

Purification and partial characterization of acyl carrier proteins from developing oil seeds of pisa (Actinodaphne hookeri) and ground nut (Arachis hypogaea)

Acyl carrier proteins (ACP) were purified to homogeneity in the active form from developing seeds of pisa (Actinodaphne hookeri) which synthesizes exclusively trilaurin and from ground nut (Arachis hypogaea) which synthesizes triacylglycerols containing long chain fatty acids. Two major isoforms of ACPs were purified from developing pisa seeds using DEAE-cellulose, Superose-6 FPLC and C-4 reversed phase HPLC chromatographic methods. In contrast, only a single form of ACP was present in ground nut seeds which was purified by anion-exchange and activated thiol-Sepharose 4B affinity chromatography. The two isoforms of ACPs from pisa showed nearly the same specific activity of 6,706 and 7,175 pmol per min per mg protein while ground nut ACP showed a specific activity of 3,893 pmol per min per mg protein when assayed using E. coli acyl-ACP synthetase and [1-C-14]palmitic acid. When compared with E. coli ACP, the purified ACPs from both the seeds showed considerable difference in their mobility in native PAGE, but showed similar mobility in SDS-PAGE under reducing conditions. In the absence of reducing agents formation of dimers was quite prominent. The ACPs from both the seed sources were acid- and heat-stable. The major isoform of pisa seed ACP and the ground nut ACP contain 91 amino acids with M(r) 11,616 and 1,228 respectively. However, there is significant variation in their amino acid composition. A comparision of the amino acid sequence in the N-terminal region of pisa and ground nut seed ACPs showed considerable homology between themselves and with other plant ACPs but not with E. coli ACP.

Relation between integral and partial properties of ternary solutions along different composition trajectories

The relations between partial and integral properties of ternary solutions along composition trajectories suggested by Kohler, Colinet and Jacob, and along an arbitrary path are derived. The chemical potentials of the components are related to the slope of integral free energy by expressions involving the binary compositions generated by the intersections of the composition trajectory with the sides of the ternary triangle. Only along the Kohler composition trajectory it is possible to derive the integral free energy from the variation of the chemical potential of a single component with composition or vice versa. Along all other paths the differential of the integral free energy is related to two chemical potentials. The Gibbs-Duhem integration proposed by Darken for the ternary system uses the Kohler isogram. The relative merits of different limits for integration are discussed.

A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding

Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative 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. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.

Comparative study on flexural response of full and partial depth fiber-reinforced high-strength concrete

This study presents the results of an experimental and analytical comparison of the flexural behavior of a high-strength concrete specimen (no conventional reinforcement) with an average plain concrete cube strength of nearly 65 MPa and containing trough shape steel fibers. Trough shape steel fibers with a volume fraction ranging from 0 to 1.5% and having a constant aspect ratio of 80 have been used in this study. Increased toughness and a more ductile stress-strain response were observed with an increase in fiber content, when the fibers were distributed over the full/partial depth of the beam cross section. Based on the tests, a robust analytical procedure has been proposed to establish the required partial depth to contain fiber-reinforced concrete (FRC) so as to obtain the flexural capacity of a member with FRC over the full depth. It is expected that this procedure will help designers in properly estimating the required partial depth of fibers in composite sections for specific structural applications. Empirical and mechanistic relations have also been proposed in this study to establish the load-deflection behavior of high-strength FRC.

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.

A Multi-layer Perceptron based Non-linear Mixture Model to estimate class abundance from mixed pixels

Sub-pixel classification is essential for the successful description of many land cover (LC) features with spatial resolution less than the size of the image pixels. A commonly used approach for sub-pixel classification is linear mixture models (LMM). Even though, LMM have shown acceptable results, pragmatically, linear mixtures do not exist. A non-linear mixture model, therefore, may better describe the resultant mixture spectra for endmember (pure pixel) distribution. In this paper, we propose a new methodology for inferring LC fractions by a process called automatic linear-nonlinear mixture model (AL-NLMM). AL-NLMM is a three step process where the endmembers are first derived from an automated algorithm. These endmembers are used by the LMM in the second step that provides abundance estimation in a linear fashion. Finally, the abundance values along with the training samples representing the actual proportions are fed to multi-layer perceptron (MLP) architecture as input to train the neurons which further refines the abundance estimates to account for the non-linear nature of the mixing classes of interest. AL-NLMM is validated on computer simulated hyperspectral data of 200 bands. Validation of the output showed overall RMSE of 0.0089±0.0022 with LMM and 0.0030±0.0001 with the MLP based AL-NLMM, when compared to actual class proportions indicating that individual class abundances obtained from AL-NLMM are very close to the real observations.

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.