A measure of logical complexity of programs

The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.

Logical design of a negative binary adder-subtracter

Two different designs for negative binary adder-subtracter are compared. Ono design uses the method of a hybrid-carry—borrow, while the other 11303 the method of polarization and addition.

Design of logical topologies for wavelength-routed optical networks

his paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.

Programming an FPGA to Emulate the Dynamics of DC Machines

This paper presents the programming an FPGA (Field Programmable Gate Array) to emulate the dynamics of DC machines. FPGA allows high speed real time simulation with high precision. The described design includes block diagram representation of DC machine, which contain all arithmetic and logical operations. The real time simulation of the machine in FPGA is controlled by user interfaces they are Keypad interface, LCD display on-line and digital to analog converter. This approach provides emulation of electrical machine by changing the parameters. Separately Exited DC machine implemented and experimental results are presented.

An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (MVDs) in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a): computing the inference basis of a given set M of MVDs; (b): computing the dependency basis of a given attribute set w.r.t. M; and (c): solving the membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Theoretical Maximum Limits on Power-Handling Capacity of HVDC Cables

In the case of an ac cable, power transmission is limited by the length of the cable due to the capacitive reactive current component. It is well known that high-voltage direct current (HVDC) cables do not have such limitations. However, insulation-related thermal problems pose a limitation on the power capability of HVDC cables. The author presents a viable theoretical development, a logical extension to Whitehead's theory on thermal limitations of the insulation. The computation of the maximum power-carrying capability of HVDC cables subject to limits on the maximum operable temperature of the insulation is presented. The limitation on the power-carrying capability is closely associated with the electrothermal insulation failure. The effect of environmental interaction by way of external thermal resistance, an important aspect, is also considered in the formulations. The Lagrange multiplier method has been used to handle the ensuing optimization problem. The theory is based on an accepted theory of thermal breakdown in insulation and is an important and a coherent extension of great significance.

Uniformity of film thickness on rotating planetary planar substrates

For the purposes of obtaining a number of components with nearly identical thickness distributions over the substrate area and of minimizing the inhomogeneities of the film, it is logical to presume that a substrate rotating on its own axis and revolving around another axis will give more uniformity in film thickness than a substrate only revolving around one axis. In relation to the practical applications, an investigation has been undertaken to study the refinement that can be achieved by using a planar planetary substrate holder. It is shown theoretically that the use of the planetary substrate holder under ideal conditions of source and geometry does not offer any further improvement in uniformity of thickness over the conventional rotary work-holder. It is also shown that the geometrical parameters alone have little influence over the uniformity achieved on a planetary substrate, because of the complex cyclidal motion of any point on it. However, for any given geometry, a non-integral speed ratio of the planetary substrate and the work-holder shows considerably less variation in thickness over the substrate area.

Synchronous decade up/down counter

Sequential up/down counting is required many a time. In this paper, the logical design of such a counter of the parallel carry type is furnished.

Thermal decomposition of rare-earth trioxalatocobaltates

The thermal decomposition of rare-earth trioxalatocobaltates LnCo(C2O4)3 · x H2O, where Ln = La, Pr, Nd, has been studied in flowing atmospheres of air/oxygen, argon/ nitrogen, carbon dioxide and a vacuum. The compounds decompose through three major steps, viz. dehydration, decomposition of the oxalate to an intermediate carbonate, which further decomposes to yield rare-earth cobaltite as the final product. The formation of the final product is influenced by the surrounding gas atmosphere. Studies on the thermal decomposition of photodecomposed lanthanum trioxalatocobaltate and a mechanical mixture of lanthanum oxalate and cobalt oxalate in 1 : 2 molar ratio reveal that the decomposition behaviour of the two samples is different. The drawbacks of the decomposition scheme proposed earlier have been pointed out, and logical schemes based on results obtained by TG, DTA, DTG, supplemented by various physico-chemical techniques such as gas and chemical analyses, IR and mass spectroscopy, surface area and magnetic susceptibility measurements and X-ray powder diffraction methods, have been proposed for the decomposition in air of rare-earth trioxalatocobaltates as well as for the photoreduced lanthanum salt and a mechanical mixture of lanthanum and cobalt oxalates.

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].

Structural aspects of semantic-directed clusters

Knowledge-based clusters are studied from the structural point of view. Generalized descriptions for such clusters are stated and illustrated. Peculiarities of certain knowledge-based cluster configurations are highlighted. The adequacy of the connectives logical and (“and”) logical or (“exclusive-or”) in describing such clusters is justified. The definition of “concept” is elaborated from the clustering point of view and used to establish the equivalence between, descriptions of clusters and concepts. The order-independence of semantic-directed clustering approach is established formally based on axiomatic considerations.

Structural alteration from non-B to B-form could reflect DNase I hypersensitivity

Preferential cleavage of active genes by DNase I has been correlated with a structurally altered conformation of DNA at the hypersensitive site in chromatin. To have a better understanding of the structural requirements for gene activation as probed by DNase I action, digestability by DNase I of synthetic polynucleotides having the ability to adopt B and non-B conformation (like Z-form) was studied which indicated a marked higher digestability of the B-form of DNA. Left handed Z form present within a natural sequence in supercoiled plasmid also showed marked resistance towards DNase I digestion. We show that alternating purine-pyrimidine sequences adopting Z-conformation exhibit DNAse I foot printing even in a protein free system. The logical deductions from the results indicate that 1) altered structure like Z-DNA is not a favourable substrate for DNase I, 2) both the ends of the alternating purine-pyrimidine insert showed hypersensitivity, 3) B-form with a minor groove of 12-13 A is a more favourable substrate for DNase I than an altered structure, 4) any structure of DNA deviating largely from B form with a capacity to flip over to the B-form are potential targets for the DNase I enzymic probes in naked DNA.

Normal state tunneling conductance of perovskite oxides: Implications for high-Tc superconductors

We have investigated tunneling conductances in disordered, normally conducting perovskite oxides close to the metal�insulator transition. We show that the normal state tunneling conductance of perovskite oxides can be cast in a general form G(V) = G0[1 + curly logical orV/V*curly logical orn] with 1?n?0.5 and where V* is an intrinsic energy scale. The exponent n graduall y increases from 0.5 to 1 as the metal-insulator (M-I) transition is approached. In the high-Tc Bi(2212) cuprates, the normally observed, linear G(V)(n=1) can be made sub-linear (n<1) by substitution of Ca with Y. From the similarity of the linear conductances, we suggest proximity to the M-I transition as a likely cause for this G(V)logical or, bar below V dependence. In systems showing linear conductances (nreverse similar, equals1), we find that ?G/?Vreverse similar, equalsG?0 with ?reverse similar, equals 1 and the intrinsic energy scale V*reverse similar, equals25�75 meV in the different oxides investigated.

The energy balance in the Ramdas layer

On calm clear nights, air at a height of a few decimetres above bare soil can be cooler than the surface by several degrees in what we shall call the Ramdas layer (Ramdas and Atmanathan, 1932). The authors have recently offered a logical explanation for such a lifted temperature minimum, together with a detailed numerical model. In this paper, we provide physical insight into the phenomenon by a detailed discussion of the energy budget in four typical cases, including one with a lifted minimum. It is shown that the net cooling rate near ground is the small difference between two dominant terms, representing respectively radiative upflux from the ground and from the air layers just above ground. The delicate energy balance that leads to the lifted minimum is upset by turbulent transport, by surface emissivity approaching unity, or by high ground cooling rates. The rapid variation of the flux emissivity of humid air is shown to dominate radiative transport near the ground.