Pseudo-time particle filtering for diffuse optical tomography

We recast the reconstruction problem of diffuse optical tomography (DOT) in a pseudo-dynamical framework and develop a method to recover the optical parameters using particle filters, i.e., stochastic filters based on Monte Carlo simulations. In particular, we have implemented two such filters, viz., the bootstrap (BS) filter and the Gaussian-sum (GS) filter and employed them to recover optical absorption coefficient distribution from both numerically simulated and experimentally generated photon fluence data. Using either indicator functions or compactly supported continuous kernels to represent the unknown property distribution within the inhomogeneous inclusions, we have drastically reduced the number of parameters to be recovered and thus brought the overall computation time to within reasonable limits. Even though the GS filter outperformed the BS filter in terms of accuracy of reconstruction, both gave fairly accurate recovery of the height, radius, and location of the inclusions. Since the present filtering algorithms do not use derivatives, we could demonstrate accurate contrast recovery even in the middle of the object where the usual deterministic algorithms perform poorly owing to the poor sensitivity of measurement of the parameters. Consistent with the fact that the DOT recovery, being ill posed, admits multiple solutions, both the filters gave solutions that were verified to be admissible by the closeness of the data computed through them to the data used in the filtering step (either numerically simulated or experimentally generated). (C) 2011 Optical Society of America

Optimal association of mobile wireless devices with a WLAN-3G access network

In this paper, we consider the problem of association of wireless stations (STAs) with an access network served by a wireless local area network (WLAN) and a 3G cellular network. There is a set of WLAN Access Points (APs) and a set of 3G Base Stations (BSs) and a number of STAs each of which needs to be associated with one of the APs or one of the BSs. We concentrate on downlink bulk elastic transfers. Each association provides each ST with a certain transfer rate. We evaluate an association on the basis of the sum log utility of the transfer rates and seek the utility maximizing association. We also obtain the optimal time scheduling of service from a 3G BS to the associated STAs. We propose a fast iterative heuristic algorithm to compute an association. Numerical results show that our algorithm converges in a few steps yielding an association that is within 1% (in objective value) of the optimal (obtained through exhaustive search); in most cases the algorithm yields an optimal solution.

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

Provider-Customer Coalitional Games

Efficacy of commercial wireless networks can be substantially enhanced through large-scale cooperation among involved entities such as providers and customers. The success of such cooperation is contingent upon the design of judicious resource allocation strategies that ensure that the individuals' payoffs are commensurate to the resources they offer to the coalition. The resource allocation strategies depend on which entities are decision-makers and whether and how they share their aggregate payoffs. Initially, we consider the scenario where the providers are the only decision-makers and they do not share their payoffs. We formulate the resource allocation problem as a nontransferable payoff coalitional game and show that there exists a cooperation strategy that leaves no incentive for any subset of providers to split from the grand coalition, i.e., the core of the game is nonempty. To compute this cooperation strategy and the corresponding payoffs, we subsequently relate this game and its core to an exchange market setting and its equilibrium, which can be computed by several efficient algorithms. Next, we investigate cooperation when customers are also decision-makers and decide which provider to subscribe to based on whether there is cooperation. We formulate a coalitional game in this setting and show that it has a nonempty core. Finally, we extend the formulations and results to the cases where the payoffs are vectors and can be shared selectively.

Benchmark Control Problem for Highway Bridge based on FLC

Fuzzy logic control (FLC) systems have been applied as an effective control system in various fields, including vibration control of structures. The advantage of this approach is its inherent robustness and ability to handle non‐linearities and uncertainties in structural behavior and loading. The study evaluates the three‐dimensional benchmark control problem for a seismically excited highway bridge using an ANFIS driven hydraulic actuators. An ANN based training strategy that considers both velocity and acceleration feedback together with a fuzzy logic rule base is developed. Present study needs only 4 accelerometers and 4 fuzzy rule bases to determine the control force, instead of 8 accelerometers and 4 displacement transducers used in the benchmark study problem. The results obtained are better than that obtained from the benchmark control algorithm.

Pickup and delivery problem using metaheuristics techniques

Dial-a-ride problem (DARP) is an optimization problem which deals with the minimization of the cost of the provided service where the customers are provided a door-to-door service based on their requests. This optimization model presented in earlier studies, is considered in this study. Due to the non-linear nature of the objective function the traditional optimization methods are plagued with the problem of converging to a local minima. To overcome this pitfall we use metaheuristics namely Simulated Annealing (SA), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Immune System (AIS). From the results obtained, we conclude that Artificial Immune System method effectively tackles this optimization problem by providing us with optimal solutions. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

The pursuit-evasion problem of two aircraft in a horizontal plane

The pursuit-evasion problem of two aircraft in a horizontal plane is modelled as a zerosum differential game with capture time as payoff. The aircraft are modelled as point masses with thrust and bank angle controls. The games of kind and degree for this differential game are solved.

Decision tree design and applications in speech processing

The design and operation of the minimum cost classifier, where the total cost is the sum of the measurement cost and the classification cost, is computationally complex. Noting the difficulties associated with this approach, decision tree design directly from a set of labelled samples is proposed in this paper. The feature space is first partitioned to transform the problem to one of discrete features. The resulting problem is solved by a dynamic programming algorithm over an explicitly ordered state space of all outcomes of all feature subsets. The solution procedure is very general and is applicable to any minimum cost pattern classification problem in which each feature has a finite number of outcomes. These techniques are applied to (i) voiced, unvoiced, and silence classification of speech, and (ii) spoken vowel recognition. The resulting decision trees are operationally very efficient and yield attractive classification accuracies.

Approach to the problem of ferroresonance in e.h.v. systems

An analytical analysis of ferroresonance with possible cases of its occurrence in series-and shunt-compensated systems is presented. A term `percentage unstable zoneÿ is defined to compare the jump severity of different nonlinearities. A direct analytical method has been shown to yield complete information. An attempt has been made to find all four critical points: jump-from and jump-to points of ferroresonance jump phenomena. The systems considered for analysis are typical 500 kV transmission systems of various lengths.

Relaxation: Application to the matrix reconstruction problem

This report describes some preliminary experiments on the use of the relaxation technique for the reconstruction of the elements of a matrix given their various directional sums (or projections).

Experimental implementation of quantumUlam’s problem in a nuclear magnetic resonance quantum information processor

The Ulam’s problem is a two person game in which one of the player tries to search, in minimum queries, a number thought by the other player. Classically the problem scales polynomially with the size of the number. The quantum version of the Ulam’s problem has a query complexity that is independent of the dimension of the search space. The experimental implementation of the quantum Ulam’s problem in a Nuclear Magnetic Resonance Information Processor with 3 quantum bits is reported here.

An extension of Mangler transformation to a 3-D problem

Considering the linearized boundary layer equations for three-dimensional disturbances, a Mangler type transformation is used to reduce this case to an equivalent two-dimensional one.