Unsteady axisymmetric stagnation-point flow of a viscous fluid on a cylinder

The unsteady viscous flow in the vicinity of an axisymmetric stagnation point of an infinite circular cylinder is investigated when both the free stream velocity and the velocity of the cylinder vary arbitrarily with time. The cylinder moves either in the same direction as that of the free stream or in the opposite direction. The flow is initially (t = 0) steady and then at t > 0 it becomes unsteady. The semi-similar solution of the unsteady Navier-Stokes equations has been obtained numerically using an implicit finite-difference scheme. Also the self-similar solution of the Navier-Stokes equations is obtained when the velocity of the cylinder and the free stream velocity vary inversely as a linear function of time. For small Reynolds number, a closed form solution is obtained. When the Reynolds number tends to infinity, the Navier-Stokes equations reduce to those of the two-dimensional stagnation-point flow. The shear stresses corresponding to stationary and the moving cylinder increase with the Reynolds number. The shear stresses increase with time for the accelerating flow but decrease with increasing time for the decelerating flow. For the decelerating case flow reversal occurs in the velocity profiles after a certain instant of time. (C) 1999 Elsevier Science Ltd. All rights reserved.

Performance issues of distance relays for shunt FACTS compensated transmission lines

In this paper, the performance of distance relays when applied to transmission system equipped with shunt FACTS device, Static Synchronous Compensator (STATCOM) is described. The aim of the proposed study is to evaluate the performance of distance relays when STATCOM is incorporated at the mid point of transmission lines for voltage control. A detailed model of STATCOM and its control strategy is presented. The presence of these devices significantly affects apparent impedance seen by the distance relays due to their rapid response to different power system configurations. The distance relay is evaluated for different loading conditions and for different fault locations. The faults are created during various pre-fault loading conditions. The studies are performed on 400KV and 132KV systems and the results are presented. Simulation studies are carried out using transient simulation software, PSCAD/EMTDC.

Role of the cesium antimonide layer in the Na2KSb/Cs3Sb photocathode

When radiation of sufficiently high energy is incident on the surface of a semiconductor photocathode, electrons are excited from the valence band to the conduction band and these may contribute to the photocurrent. The photocurrent in a single-layer cathode is found to be small, because of collisions within the cathode material, the electron affinity condition, etc. It is observed that when a thin layer of n-type cesium antimonide (Cs3Sb) is deposited over a p-type layer of sodium potassium antimonide (Na2KSb), there occurs a sharp rise in the photocurrent. The causes for the dramatic increase in the photocurrent obtainable from a sodium potassium antimonide cathode, by depositing a thin layer of cesium antimonide are analyzed in this article. It has been shown that the interface between sodium potassium antimonide and cesium antimonide can result in lowering of the electron affinity to a level below the bottom of the conduction band of sodium potassium antimonide. The drift field that arises at the heterointerface enables the electrons to reach the surface, leading to the emission of almost all the photogenerated electrons within the cathode. The processes involved in photoemission from such a double-layer cathode are examined from a theoretical point of view. The spectral response of the two-layer cathode is also found to be better than that of a single-layer cathode.

Calibration of etched fiber bragg grating sensor arrays for measurement of molecular surface adsorption

Etched Fiber Bragg Grating (EFBG) sensors are attractive from the point of the inherently high multiplexing ability of fiber based sensors. However, the strong dependence of the sensitivity of EFBG sensors on the fiber diameter requires robust methods for calibration when used for distributed sensing in a large array format. Using experimental data and numerical modelling, we show that knowledge of the wavelength shift during the etch process is necessary for high-fidelity calibration of EFBG arrays. However as this approach requires the monitoring of every element of the sensor array during etching, we also proposed and demonstrated a calibration scheme using data from bulk refractometry measurements conducted post-fabrication without needing any information about the etching process. Although this approach is not as precise as the first one, it may be more practical as there is no requirement to monitor each element of the sensor array. We were able to calibrate the response of the sensors to within 3% with the approach using information acquired during etching and to within 5% using the post-fabrication bulk refractometry approach in spite of the sensitivities of the array element differing by more than a factor of 4. These two approaches present a tradeoff between accuracy and practicality.

Bounds on the sum-rate capacity of the Gaussian MIMO X channel

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

Membership models and the design of authentication protocols for MANETs

Authentication protocols are very much essential for secure communication in mobile ad hoc networks (MANETs). A number of authentication protocols for MANETs have been proposed in the literature which provide the basic authentication service while trying to optimize their performance and resource consumption parameters. A problem with most of these protocols is that the underlying networking environment on which they are applicable have been left unspecified. As a result, lack of specifications about the networking environments applicable to an authentication protocol for MANETs can mislead about the performance and the applicability of the protocol. In this paper, we first characterize networking environment for a MANET as its 'Membership Model' which is defined as a set of specifications related to the 'Membership Granting Server' (MGS) and the 'Membership Set Pattern' (MSP) of the MANET. We then identify various types of possible membership models for a MANET. In order to illustrate that while designing an authentication protocol for a MANET, it is very much necessary to consider the underlying membership model of the MANET, we study a set of six representative authentication protocols, and analyze their applicability for the membership models as enumerated in this paper. The analysis shows that the same protocol may not perform equally well in all membership models. In addition, there may be membership models which are important from the point of view of users, but for which no authentication protocol is available.

Effect of FIB milling on MEMS SOI cantilevers

Stress induced by Focused Ion Beam (FIB) milling of cantilevers fabricated on silicon-on-insulator (SOI) wafer has been studied. Milling induces stress gradients ranging from -10MPa/μm to -120MPa/μm, depending on the location of cantilevers from the point of milling. Simulations were done to estimate the stress in the milled cantilevers.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

An approach version of fuzzy metric spaces including an ad hoc fixed point theorem

In this paper, inspired by two very different, successful metric theories such us the real view-point of Lowen's approach spaces and the probabilistic field of Kramosil and Michalek's fuzzymetric spaces, we present a family of spaces, called fuzzy approach spaces, that are appropriate to handle, at the same time, both measure conceptions. To do that, we study the underlying metric interrelationships between the above mentioned theories, obtaining six postulates that allow us to consider such kind of spaces in a unique category. As a result, the natural way in which metric spaces can be embedded in both classes leads to a commutative categorical scheme. Each postulate is interpreted in the context of the study of the evolution of fuzzy systems. First properties of fuzzy approach spaces are introduced, including a topology. Finally, we describe a fixed point theorem in the setting of fuzzy approach spaces that can be particularized to the previous existing measure spaces.

Marketing of small indigenous species of fish (SIS) in three selected fish markets of Mymensingh

A socio-economic survey was conducted round the year in three fish markets at Mymensingh, Bangladesh. The selected markets were categorized as rural market (Sutiakhali market), a peri-urban market (Kamal Ranjeet market, BAU) and an urban market (Notun Bazar market, Mymensingh town). It was learnt from the survey that the availability of Small Indigenous Fish Species (SIS) declined to a great extent over the last few years and at presently many of such fish species are either threatened or at the edge of extinction. The supply of SIS was highest in KR market (37% of total) and more or less similar in Notun Bazar and Sutiakhali fish market (25 and 27% respectively). The total supply of SIS fluctuated from 25% to 35% throughout the year in these markets. About 48 SIS were found in the sampled markets over the survey period. The highest number of species (45) was found in KR market followed by Notun Bazar (42) and Sutiakhali (37) fish markets. During the survey, three critically endangered species namely, schilbid catfish, garua catfish and rita were found in these markets. Beside these, other 11 and 10 species were listed to be endangered and vulnerable respectively. The biodiversity of 21 SIS found in three markets were no threat at all. Three species (guntea loach, Indian glass barb and flying barb) were 'data deficient' as reported by the IUCN Red Book (IUCN-Bangladesh 2000). From the supply point of view small prawn, spotted snakehead, stinging catfish, pool barb, striped dwarf catfish, Gangetic mystus, walking catfish and tank goby were the prominent fish. The least available species found in this survey were lesser spiny eel, barred spiny eel, Gangetic ailia, freshwater garfish, zig-zag eel, flying barb, Ganges river sprat, freshwater river shad and dwarf gourami. The weight of SIS available in Notun bazar was highest and nearly double than other two markets. There was no significant difference recorded in the supply of SIS in Sutiakhali and KR markets. The average monthly SIS supply was 185, 192 and 467 kg in KR, Sutiakhali and Notun Bazar, respectively; therefore, the cumulative average supply was 844 kg per month in three markets. The price of SIS ranged widely from taka 50-450/kg depending on species, location of market, time of purchase and the condition of fish. In general small prawn, ticto barb, dwarf gourami, Gangetic leaffish, and Annandale loach were sold at a lower price (ranged taka 50-100/kg) and these species could be considered at the bottom of the market-price list. Other SIS like walking catfish, climbing parch, butter catfish, cotio and schilbid catfish valued as highest price (ranged taka 150-450/kg). There was no specific marketing chain for SIS in Mymensingh region. The components of marketing channels and their expansion varied with seasons and locations. The general pattern, however, was as this - after buying fish from fish farmer/fishermen, middlemen (locally known as Foria) used to buy fish to wholesale market and sell to the wholesalers. The retailers used to buy fish from wholesaler through auction to the highest bidders. The retailers then send the fish to particular market where the fish reached the consumers. The livelihood strategy of SIS retailers in three fish markets showed that socio-economic constraints such as low income, poor educational background, low economic status and lack of capital are the main constrains [sic]. Most of the retailers proposed that government should control the fish price throughout the year, so that the producers can get reasonable and stable price. Construction of cold storage and preservation facilities at market sites, improvement of road and communication, improvement of physical market facilities and reduction of market chain is essential. Credit facilities, improvement of their standard of living, health and sanitary condition, housing condition, children education and access to drinking water facilities were identified as additional aspects to improve socio-economic condition of SIS retailers.

'Citizen of nowhere' or 'the point where circles intersect'? Impartialist and embedded cosmopolitanisms?

Erskine, Toni, 'Citizen of nowhere' or 'the point where circles intersect'? Impartialist and embedded cosmopolitanisms', Review of International Studies (2002) 28(3) pp.457-477 RAE2008

Examining the post-adoptive infusion of mobile technology in a healthcare domain: determinants and outcomes

The healthcare industry is beginning to appreciate the benefits which can be obtained from using Mobile Health Systems (MHS) at the point-of-care. As a result, healthcare organisations are investing heavily in mobile health initiatives with the expectation that users will employ the system to enhance performance. Despite widespread endorsement and support for the implementation of MHS, empirical evidence surrounding the benefits of MHS remains to be fully established. For MHS to be truly valuable, it is argued that the technological tool be infused within healthcare practitioners work practices and used to its full potential in post-adoptive scenarios. Yet, there is a paucity of research focusing on the infusion of MHS by healthcare practitioners. In order to address this gap in the literature, the objective of this study is to explore the determinants and outcomes of MHS infusion by healthcare practitioners. This research study adopts a post-positivist theory building approach to MHS infusion. Existing literature is utilised to develop a conceptual model by which the research objective is explored. Employing a mixed-method approach, this conceptual model is first advanced through a case study in the UK whereby propositions established from the literature are refined into testable hypotheses. The final phase of this research study involves the collection of empirical data from a Canadian hospital which supports the refined model and its associated hypotheses. The results from both phases of data collection are employed to develop a model of MHS infusion. The study contributes to IS theory and practice by: (1) developing a model with six determinants (Availability, MHS Self-Efficacy, Time-Criticality, Habit, Technology Trust, and Task Behaviour) and individual performance-related outcomes of MHS infusion (Effectiveness, Efficiency, and Learning), (2) examining undocumented determinants and relationships, (3) identifying prerequisite conditions that both healthcare practitioners and organisations can employ to assist with MHS infusion, (4) developing a taxonomy that provides conceptual refinement of IT infusion, and (5) informing healthcare organisations and vendors as to the performance of MHS in post-adoptive scenarios.

Making it in the Modern Job Market: A Study of Communication among the Deaf and Hard of Hearing Population

Gemstone Team AUDIO (Assessing and Understanding Deaf Individuals' Occupations)