A New Successive Displacement Type Load Flow Algorithm and its Application to Radial Systems

A new successive displacement type load flow method is developed in this paper. This algorithm differs from the conventional Y-Bus based Gauss Seidel load flow in that the voltages at each bus is updated in every iteration based on the exact solution of the power balance equation at that node instead of an approximate solution used by the Gauss Seidel method. It turns out that this modified implementation translates into only a marginal improvement in convergence behaviour for obtaining load flow solutions of interconnected systems. However it is demonstrated that the new approach can be adapted with some additional refinements in order to develop an effective load flow solution technique for radial systems. Numerical results considering a number of systems-both interconnected and radial, are provided to validate the proposed approach.

Measurement of Large Dipolar Couplings of a Liquid Crystal with Terminal Phenyl Rings and Estimation of the Order Parameters

NMR spectroscopy is a powerful means of studying liquid-crystalline systems at atomic resolutions. Of the many parameters that can provide information on the dynamics and order of the systems, H-1-C-13 dipolar couplings are an important means of obtaining such information. Depending on the details of the molecular structure and the magnitude of the order parameters, the dipolar couplings can vary over a wide range of values. Thus the method employed to estimate the dipolar couplings should be capable of estimating both large and small dipolar couplings at the same time. For this purpose, we consider here a two-dimensional NMR experiment that works similar to the insensitive nuclei enhanced by polarization transfer (INEPT) experiment in solution. With the incorporation of a modification proposed earlier for experiments with low radio frequency power, the scheme is observed to enable a wide range of dipolar couplings to be estimated at the same time. We utilized this approach to obtain dipolar couplings in a liquid crystal with phenyl rings attached to either end of the molecule, and estimated its local order parameters.

Generalized Spatial Modulation in Large-Scale Multiuser MIMO Systems

Generalized spatial modulation (GSM) uses n(t) transmit antenna elements but fewer transmit radio frequency (RF) chains, n(rf). Spatial modulation (SM) and spatial multiplexing are special cases of GSM with n(rf) = 1 and n(rf) = n(t), respectively. In GSM, in addition to conveying information bits through n(rf) conventional modulation symbols (for example, QAM), the indices of the n(rf) active transmit antennas also convey information bits. In this paper, we investigate GSM for large-scale multiuser MIMO communications on the uplink. Our contributions in this paper include: 1) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and 2) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of 10(-3). Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.

Broadcast Control Mechanism for Positional Consensus in Multiagent Systems

In this paper, a strategy for controlling a group of agents to achieve positional consensus is presented. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming (LP) formulation that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command that helps the agents to come close to each other even for a large number of agents, which was not possible with an existing strategy in the literature, is introduced. The method is extended to achieve positional consensus at a prespecified location. The effectiveness of the approach is illustrated through simulation results. A comparison between the LP approach and the existing second-order cone programming-based approach is also presented. The algorithm was successfully implemented on a robotic platform with three robots.

Low-Order Harmonic Suppression for Open-End Winding IM With Dodecagonal Space Vector Using a Single DC-Link Supply

This paper proposes a technique to suppress low-order harmonics for an open-end winding induction motor drive for a full modulation range. One side of the machine is connected to a main inverter with a dc power supply, whereas the other inverter is connected to a capacitor from the other side. Harmonic suppression (with complete elimination of fifth- and seventh-order harmonics) is achieved by realizing dodecagonal space vectors using a combined pulsewidth modulation (PWM) control for the two inverters. The floating capacitor voltage is inherently controlled during the PWM operation. The proposed PWM technique is shown to be valid for the entire modulation range, including overmodulation and six-step mode of operation of the main inverter. Experimental results have been presented to validate the proposed technique.

Joint Channel Estimation and Data Detection in MIMO-OFDM Systems: A Sparse Bayesian Learning Approach

The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.

Length scales in glass-forming liquids and related systems: a review

The central problem in the study of glass-forming liquids and other glassy systems is the understanding of the complex structural relaxation and rapid growth of relaxation times seen on approaching the glass transition. A central conceptual question is whether one can identify one or more growing length scale(s) associated with this behavior. Given the diversity of molecular glass-formers and a vast body of experimental, computational and theoretical work addressing glassy behavior, a number of ideas and observations pertaining to growing length scales have been presented over the past few decades, but there is as yet no consensus view on this question. In this review, we will summarize the salient results and the state of our understanding of length scales associated with dynamical slow down. After a review of slow dynamics and the glass transition, pertinent theories of the glass transition will be summarized and a survey of ideas relating to length scales in glassy systems will be presented. A number of studies have focused on the emergence of preferred packing arrangements and discussed their role in glassy dynamics. More recently, a central object of attention has been the study of spatially correlated, heterogeneous dynamics and the associated length scale, studied in computer simulations and theoretical analysis such as inhomogeneous mode coupling theory. A number of static length scales have been proposed and studied recently, such as the mosaic length scale discussed in the random first-order transition theory and the related point-to-set correlation length. We will discuss these, elaborating on key results, along with a critical appraisal of the state of the art. Finally we will discuss length scales in driven soft matter, granular fluids and amorphous solids, and give a brief description of length scales in aging systems. Possible relations of these length scales with those in glass-forming liquids will be discussed.

Integrals of motion for one-dimensional Anderson localized systems

Anderson localization is known to be inevitable in one-dimension for generic disordered models. Since localization leads to Poissonian energy level statistics, we ask if localized systems possess `additional' integrals of motion as well, so as to enhance the analogy with quantum integrable systems. We answer this in the affirmative in the present work. We construct a set of nontrivial integrals of motion for Anderson localized models, in terms of the original creation and annihilation operators. These are found as a power series in the hopping parameter. The recently found Type-1 Hamiltonians, which are known to be quantum integrable in a precise sense, motivate our construction. We note that these models can be viewed as disordered electron models with infinite-range hopping, where a similar series truncates at the linear order. We show that despite the infinite range hopping, all states but one are localized. We also study the conservation laws for the disorder free Aubry-Andre model, where the states are either localized or extended, depending on the strength of a coupling constant. We formulate a specific procedure for averaging over disorder, in order to examine the convergence of the power series. Using this procedure in the Aubry-Andre model, we show that integrals of motion given by our construction are well-defined in localized phase, but not so in the extended phase. Finally, we also obtain the integrals of motion for a model with interactions to lowest order in the interaction.

Uncooled DBR laser directly modulated at 3.125 Gb/s as athermal transmitter for low-cost WDM systems

An uncooled three-section tunable distributed Bragg reflector laser is demonstrated as an athermal transmitter for low-cost uncooled wavelength-division-multiplexing (WDM) systems with tight channel spacing. A ±0.02-nm thermal wavelength drift is achieved under continuous-wave operation up to 70 °C. Dynamic sidemode suppression ratio of greater than 35 dB is consistently obtained under 3.125-Gb/s direct modulation over a 20 °C-70 °C temperature range, with wavelength variation of as low as ±0.2 nm. This indicates that more than an order of magnitude reduction in coarse WDM channel spacing is possible using this source. © 2005 IEEE.

Asymptotic solutions to a class of nonlinear oscillation systems

In this paper, we present an asymptotic method for the analysis of a class of strongly nonlinear oscillators, derive second-order approximate solutions to them expressed in terms of their amplitudes and phases, and obtain the equations governing the amplitudes and phases, by which the amplitudes of the corresponding limit cycles and their behaviour can be determined. As an example, we investigate the modified van der Pol oscillator and give the second-order approximate analytical solution of its limit cycle. The comparison with the numerical solutions shows that the two results agree well with each other.

A semantic middleware to enhance current multimedia retrieval systems with content-based functionalities

210 p. : graf.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Semi-automatic generation of learning domain modules for technology supported learning systems

In a time when Technology Supported Learning Systems are being widely used, there is a lack of tools that allows their development in an automatic or semi-automatic way. Technology Supported Learning Systems require an appropriate Domain Module, ie. the pedagogical representation of the domain to be mastered, in order to be effective. However, content authoring is a time and effort consuming task, therefore, efforts in automatising the Domain Module acquisition are necessary.Traditionally, textbooks have been used as the main mechanism to maintain and transmit the knowledge of a certain subject or domain. Textbooks have been authored by domain experts who have organised the contents in a means that facilitate understanding and learning, considering pedagogical issues.Given that textbooks are appropriate sources of information, they can be used to facilitate the development of the Domain Module allowing the identification of the topics to be mastered and the pedagogical relationships among them, as well as the extraction of Learning Objects, ie. meaningful fragments of the textbook with educational purpose.Consequently, in this work DOM-Sortze, a framework for the semi-automatic construction of Domain Modules from electronic textbooks, has been developed. DOM-Sortze uses NLP techniques, heuristic reasoning and ontologies to fulfill its work. DOM-Sortze has been designed and developed with the aim of automatising the development of the Domain Module, regardless of the subject, promoting the knowledge reuse and facilitating the collaboration of the users during the process.

Fisheries marketing systems and consumer preferences in Puttalam District Sri-Lanka

The aim of this study was to understand the current and historic market situation for inland fish and it’s substitutes in order to identify which of the various production opportunities presented by the seasonal tank resource might have greatest relevance for marginal communities in the Dry-zone. Regional and sub-regional market networks for fish and meat products were investigated, ranking and scoring exercises used to characterise consumer demand in rain-fed areas of North West Province and secondary data sources were used to assess historic patterns of demand and supply [PDF contains 57 pages]

Commercial aquaculture in Nigeria: a vertically integrated approach in the commercial freshwater farming of tilapia in floating bamboo net-hapas and cages systems

Tilapia once termed "poor man's" fish, still remains as the highly-priced food fish in many developing countries. The good attributes of this fish prompt its use in intensive aquaculture vertically integrated systems (VIS) which embrace broodstock development, hatchery/nursery and growout phase. Based on the series of studies carried out at Kainji Lake Research Institute, in New Bussa, Nigeria using Oreochromis (Tilapia niloticus) in floating bamboo hapas/cages, the recommended intensive modular systems were estimated to be capable of producing 4 million Tilapia fingerlings and 729 tons fish (Market-size) annually. Cost-benefit analysis showed the venture to have high prospects. It is recommended that priority be given to Tilapia cage culture at the national level in order to contribute immensely towards increased fish production