A computational algorithm for the verification of tautologies in propositional calculus

A computational algorithm (based on Smullyan's analytic tableau method) that varifies whether a given well-formed formula in propositional calculus is a tautology or not has been implemented on a DEC system 10. The stepwise refinement approch of program development used for this implementation forms the subject matter of this paper. The top-down design has resulted in a modular and reliable program package. This computational algoritlhm compares favourably with the algorithm based on the well-known resolution principle used in theorem provers.

A new algorithm for parallel solution of linear equations

Abstract is not available.

An On-Line Algorithm for the Location of Cross Point Faults in Programmable Logic Arrays

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the valgorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Implementation of a modified CVSD coder

This paper describes the implementation of the modified continuously variable slope delta modulator (MCVSD), in which the basic step size δ0 is made to vary as a function of input signal level. The information needed to carry out this is extracted at the local decoder output so that the coder and the decoder track each other. The result is a significant improvement in the dynamic range (about 15dB) as compared to CVSD coder without degrading the peak signal to noise ratio.

An investigation of solid adamantane by a modified isothermal-isobaric ensemble Monte Carlo simulation

Isothermal-isobaric ensemble Monte Carlo simulation studies of adamantane have been carried out at different temperatures. Thermodynamic properties and radial distribution functions calculated by employing a simple potential model based on sitesite interactions show good agreement with experiment and suggest that the solid is orientationally disordered at high temperatures.

Adsorption of CO and N2 on modified transition-metal surfaces

Electron spectroscopic studies clearly demonstrate that modification of the surfaces of Mn, Fe and Ni metals by chlorine significantly decreases the strength of interaction between the metal and adsorbed molecules such as CO and N2. This is in contrast to the effect of electropositive additives such as Ba and Al which increase the adsorption bond strength significantly.

An algorithm for optimum control of static VAR compensators to meet phase-wise unbalanced reactive power demands

The operation of thyristor-controlled static VAR compensators (SVCs) at various conduction angles can be used advantageously to meet the unablanced reactive power demands in a system. However, such operation introduces harmonic currents into the AC system. This paper presents an algorithm to evaluate an optimum combination of the phase-wise reactive power generations from SVC and balanced reactive power supply from the AC system, based on the defined performance indices, namely, the telephone influence factor (TIF), the total harmonic current factor (IT) and the distortion factor (D). Results of the studies conducted on a typical distribution system are presented and discussed.

Solubilities of solids in supercritical fluids using dimensionally consistent modified solvate complex models

New dimensionally consistent modified solvate complex models are derived to correlate solubilities of solids in supercritical fluids both in the presence and absence of entrainers (cosolvents). These models are compared against the standard solvate complex models [J.Chrastil, J. Phys. Chem. 86 (1982) 3016-3021; J.C. Gonzalez, M.R.Vieytes, A.M. Botana, J.M. Vieites, L.M. Botana, J. Chromatogr. A 910 (2001) 119-125; Y. Adachi, B.C.Y. Lu, Fluid Phase Equilb. 14 (1983) 47-156; J.M. del Valle, J.M. Aguilera, Ind. Eng. Chem. Res. 27 (1988) 1551-1553] by correlating the solubilities of 13 binary and 12 ternary systems. Though the newly derived models are not significantly better than the standard models in predicting the solubilities, they are dimensionally consistent. (C) 2009 Elsevier B.V. All rights reserved.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

A Modified Heffron-Phillip's Model for The Design of Power System Stabilizers

In this paper a modified Heffron-Phillip's (K-constant) model is derived for the design of power system stabilizers. A knowledge of external system parameters, such as equivalent infinite bus voltage and external impedances or their equivalent estimated values is required for designing a conventional power system stabilizer. In the proposed method, information available at the secondary bus of the step-up transformer is used to set up a modified Heffron-Phillip's (ModHP) model. The PSS design based on this model utilizes signals available within the generating station. The efficacy of the proposed design technique and the performance of the stabilizer has been evaluated over a range of operating and system conditions. The simulation results have shown that the performance of the proposed stabilizer is comparable to that could be obtained by conventional design but without the need for the estimation and computation of external system parameters. The proposed design is thus well suited for practical applications to power system stabilization, including possibly the multi-machine applications where accurate system information is not readily available.

Modified current source inverter fed induction motor drive with reduced torque pulsations

A new technique for reducing the torque pulsations in a conventional current source inverter fed induction motor drive is presented. This does not attempt to improve the current waveforms, but modifies the airgap MMF directly. This is based on the use of a motor with two sets of balanced phase windings, with a 30 electrical degree phase difference between them, and each set being fed from a conventional current source inverter. The two inverters are further connected in series so that they can operate from the same current source. As a consequence of this arrangement, the voltage rating of the components of each inverter is reduced, along with reduced torque ripple. This scheme has been experimentally verified and compared with the performance of a conventional scheme.

A parallel wilf algorithm for complex zeros of a polynomial

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.

Metabolism of structurally modified acyclic monoterpenes by Pseudomonas incognita

The ability of Pseudomonas incognita to metabolize some structurally modified acyclic monoterpenes was tested. The 6,7 double bond was found essential for these compounds to serve as a substrate for this organism, whereas the same was not true with the 1,2 double bond. Metabolism of dihydrolinalyl acetate by this strain yielded dihydrolinalool, dihydrolinalool-8-carboxylic acid, dihydrolinalyl acetate-8-carboxylic acid, and 4-acetoxy-4-methyl hexanoic acid. A cell-free extract prepared from dihydrolinalyl acetate grown cells transformed dihydrolinalyl acetate into dihydrolinalool and dihydrolinalool-8-carboxylic acid. Based on the identification of various metabolites isolated from the culture medium, and on growth and manometric studies carried out with the isolated metabolites as well as with related synthetic analogs, probable pathways for the biodegradation of dihydrolinalyl acetate are presented.