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.

Investigations of superconducting bismuth cuprates of the general formula Bi2-xPbx(Ca,Sr,Y)n 1 Cun O2n 4 δ

In the (Bi,Pb)-Sr-Cu-O system we have examined many compositions which are either metallic or semiconducting. In the Bi2-xPbx(Ca, Sr)n+1 Cun O2n+4+δ system, we have established the superconducting properties of the n = 1 to 4 members. The Tc increases from n = 1 to 3 and does not increase further when n = 4. In Bi2Ca1-x,YxSr2Cu2Oy, the Tc decreases with increase in x.

Analysis of network architectures for zigbee sensor clusters

We provide a comparative performance analysis of network architectures for beacon enabled Zigbee sensor clusters using the CSMA/CA MAC defined in the IEEE 802.15.4 standard, and organised as (i) a star topology, and (ii) a two-hop topology. We provide analytical models for obtaining performance measures such as mean network delay, and mean node lifetime. We find that the star topology is substantially superior both in delay performance and lifetime performance than the two-hop topology.

Undamped Oscillations of Collisionless Stellar Systems: Spheres,Spheroids and Discs.

The collisionless Boltzmann equation governing self-gravitating systems such as galaxies has recently been shown to admit exact oscillating solutions with planar and spherical symmetry. The relation of the spherically symmetric solutions to the Virial theorem, as well as generalizations to non-uniform spheres, uniform spheroids and discs form the subject of this paper. These models generalize known families of static solutions. The case of the spheroid is worked out in some detail. Quasiperiodic as well as chaotic time variation of the two axes is demonstrated by studying the surface of section for the associated Hamiltonian system with two degrees of freedom. The relation to earlier work and possible implications for the general problem of collisionless relaxation in self gravitating systems are also discussed.

The Formation, Numbers And Radio Output Of Giant Radio Galaxies

The numbers and mean radio luminosities of giant radio galaxies (GRGs) have been calculated for redshifts up to z = 0.6, assuming a sensitivity limit of 1 Jy at 1 GHz for the observations. The estimates are obtained with a model for the beam propagation, first through the hot gaseaous halo around the parent galaxy, and thereafter, through the even hotter but less dense intergalactic medium. The model is able to accurately reproduce the observed numbers and mean radio luminosities of GRGs at redshifts of less than 0.1, and it predicts that a somewhat larger number of GRGs should be found at redshifts of greater than 0.1.

The Shannon Cipher System with a Guessing Wiretapper: General Sources

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents formfixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.

A general thermodynamic framework for understanding the behaviour of absorption chillers

In this article, a general definition of the process average temperature has been developed, and the impact of the various dissipative mechanisms on 1/COP of the chiller evaluated. The present component-by-component black box analysis removes the assumptions regarding the generator outlet temperature(s) and the component effective thermal conductances. Mass transfer resistance is also incorporated into the absorber analysis to arrive at a more realistic upper limit to the cooling capacity. Finally, the theoretical foundation for the absorption chiller T-s diagram is derived. This diagrammatic approach only requires the inlet and outlet conditions of the chiller components and can be employed as a practical tool for system analysis and comparison. (C) 2000 Elsevier Science Ltd and IIR. All rights reserved.

A general procedure for generation of curved DNA molecules.

A general method for generation of base-pairs in a curved DNA structure, for any prescribed values of helical parameters--unit rise (h), unit twist (theta), wedge roll (theta R) and wedge tilt (theta T), propeller twist (theta p) and displacement (D) is described. Its application for generation of uniform as well curved structures is also illustrated with some representative examples. An interesting relationship is observed between helical twist (theta), base-pair parameters theta x, theta y and the wedge parameters theta R, theta T, which has important consequences for the description and estimation of DNA curvature.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Electronic structure of square planar CuO46− clusters

The results of spin-polarized MSXagr calculations show that the ground state of the CuO 4 6– cluster is essentially non-magnetic in spite of odd number of electrons in the system for short Cu–O distances (1.90 Å) as found in the highT c superconductors. This arises due to the fact that the unpaired electron resides in a molecular orbital with primarily oxygen 3s character. The stability of this molecular orbital is found to be sensitive to the cluster geometry and thus, increase in Cu–O distance (as well as other changes affecting oxygen-oxygen distance) tend to favour a magnetic state. From these calculations we have also estimated the Coulomb correlation strength within the Cu 3d to be about 5.3 eV.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

Hot gaseous coronae of early-type galaxies and their radio luminosity function

Recent X-ray observations have revealed that early-type galaxies (which usually produce extended double radio sources) generally have hot gaseous haloes extending up to approx102kpc1,2. Moreover, much of the cosmic X-ray background radiation is probably due to a hotter, but extremely tenuous, intergalactic medium (IGM)3. We have presented4–7 an analytical model for the propagation of relativistic beams from galactic nuclei, in which the beams' crossing of the pressure-matched interface between the IGM and the gaseous halo, plays an important role. The hotspots at the ends of the beams fade quickly when their advance becomes subsonic with respect to the IGM. This model has successfully predicted (for typical double radio sources) the observed8 current mean linear-size (approx2Dsime350 kpc)4,5, the observed8–11 decrease in linear-size with cosmological redshift4–6 and the slope of the linear-size versus radio luminosity10,12–14 relation6. We have also been able to predict the redshift-dependence of observed numbers and radio luminosities of giant radio galaxies7,15. Here, we extend this model to include the propagation of somewhat weaker beams. We show that the observed flattening of the local radio luminosity function (LRLF)16–20 for radio luminosity Papproximately 1024 W Hz-1 at 1 GHz can be explained without invoking ad hoc a corresponding break in the beam power function Phi(Lb), because the heads of the beams with Lb < 1025 W Hz-1 are decelerated to sonic velocity within the halo itself, which leads to a rapid decay of radio luminosity and a reduced contribution of these intrinsically weaker sources to the observed LRLF.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.