On walls of marginal stability in N=2 string theories

We study the properties of walls of marginal stability for BPS decays in a class of N = 2 theories. These theories arise in N = 2 string compactifications obtained as freely acting orbifolds of N = 4 theories, such theories include the STU model and the FHSV model. The cross sections of these walls for a generic decay in the axion-dilaton plane reduce to lines or circles. From the continuity properties of walls of marginal stability we show that central charges of BPS states do not vanish in the interior of the moduli space. Given a charge vector of a BPS state corresponding to a large black hole in these theories, we show that all walls of marginal stability intersect at the same point in the lower half of the axion-dilaton plane. We isolate a class of decays whose walls of marginal stability always lie in a region bounded by walls formed by decays to small black holes. This enables us to isolate a region in moduli space for which no decays occur within this class. We then study entropy enigma decays for such models and show that for generic values of the moduli, that is when moduli are of order one compared to the charges, entropy enigma decays do not occur in these models.

Spatial patterning of the distribution of Ca-2+ in Dictyostelium discoideum

We have shown previously that the Ca2+-specific fluorescent dyes chlortetracycline (CTC) and indo-1/AM can be used to distinguish between prestalk and prespore cells in Dictyostelium discoideum at a very early stage. In the present study, pre- and post-aggregative amoebae of Dictyostelium discoideum were labelled with CTC or indo-1 and their fluorescence monitored after being drawn into a fine glass capillary. The cells rapidly form two zones of Ca2+-CTC or Ca2+-indo-1 fluorescence. Anterior (air side) cells display a high level of fluorescence; the level drops in the middle portion of the capillary and rises again to a lesser extent in the posteriormost cells (oil side). When bounded by air on both sides, the cells display high fluorescence at both ends. When oil is present at both ends of the capillary, there is little fluorescence except for small regions at the ends. These outcomes are evident within a couple of minutes of the start of the experiment and the fluorescence pattern intensifies over the course of time. By using the indicator neutral red, as well as with CTC and indo-1, we show that a band displaying strong fluorescence moves away from the anterior end before stabilizing at the anterior-posterior boundary. We discuss our findings in relation to the role of Ca2+ in cell-type differentiation in Dictyostelium discoideum.

The problem with teamwork: A discursive investigation

- Background Teamwork sits comfortably within the vocabularies of most physical education teachers. It is used to both describe and prescribe student behaviour in a variety of physical and sport-related activities. Yet while supporters of sport and PE have readily employed the term, remarkably few pedagogues have taken the time to consider what teamwork refers to, let alone what it means to teach it. - Focus of study In this paper, we examine practitioners' constructions of teamwork. - Participants and setting Data were generated with seven physical education teachers (four male and three female) at a state-funded secondary school near Brisbane, Australia. The teachers ranged in experience from three months to more than 30 years. - Research design The investigation was a case study of one physical education department at a secondary school. - Data collection Three interviews were conducted with each of the teachers. The first was biographical in nature and covered themes such as education and sporting experiences. During the second interviews, teachers produced examples and statements on the topic of teamwork as it occurs within their lessons. The material from the second set of interviews was explored in the final set where the teachers were invited to elaborate on and explain comments from their previous interviews. - Analysis Data were considered from a discursive-constructionist perspective and attention was given to linguistic and grammatical features of the teachers' commentary as well as the cultural relevance of the utterances. The notion of ‘interpretive repertoires’ – essentially cultural explanations bounded by particular socio-linguistic features – provided the central unit of analysis. - Findings The teachers in the project made use of an array of discursive resources to make sense of teamwork. These constructions often bore little resemblance to one another or to existing theories of teamwork. In some cases, the teachers offered vague descriptions or drew on alternative concepts to make sense of teamwork. - Conclusions Without a certain level of agreement in their everyday usage, teachers' constructions of teamwork fail to be convincing or useful. We maintain that a more substantive conceptualisation of teamwork is needed in the field of sport pedagogy and offer suggestions on how this might be accomplished.

Photobiological studies of Baltic Sea phytoplankton

Phytoplankton ecology and productivity is one of the main branches of contemporary oceanographic research. Research groups in this branch have increasingly started to utilise bio-optical applications. My main research objective was to critically investigate the advantages and deficiencies of the fast repetition rate (FRR) fluorometry for studies of productivity of phytoplankton, and the responses of phytoplankton towards varying environmental stress. Second, I aimed to clarify the applicability of the FRR system to the optical environment of the Baltic Sea. The FRR system offers a highly dynamic tool for studies of phytoplankton photophysiology and productivity both in the field and in a controlled environment. The FRR metrics obtain high-frequency in situ determinations of the light-acclimative and photosynthetic parameters of intact phytoplankton communities. The measurement protocol is relatively easy to use without phases requiring analytical determinations. The most notable application of the FRR system lies in its potential for making primary productivity (PP) estimations. However, the realisation of this scheme is not straightforward. The FRR-PP, based on the photosynthetic electron flow (PEF) rate, are linearly related to the photosynthetic gas exchange (fixation of 14C) PP only in environments where the photosynthesis is light-limited. If the light limitation is not present, as is usually the case in the near-surface layers of the water column, the two PP approaches will deviate. The prompt response of the PEF rate to the short-term variability in the natural light field makes the field comparisons between the PEF-PP and the 14C-PP difficult to interpret, because this variability is averaged out in the 14C-incubations. Furthermore, the FRR based PP models are tuned to closely follow the vertical pattern of the underwater irradiance. Due to the photoacclimational plasticity of phytoplankton, this easily leads to overestimates of water column PP, if precautionary measures are not taken. Natural phytoplankton is subject to broad-waveband light. Active non-spectral bio-optical instruments, like the FRR fluorometer, emit light in a relatively narrow waveband, which by its nature does not represent the in situ light field. Thus, the spectrally-dependent parameters provided by the FRR system need to be spectrally scaled to the natural light field of the Baltic Sea. In general, the requirement of spectral scaling in the water bodies under terrestrial impact concerns all light-adaptive parameters provided by any active non-spectral bio-optical technique. The FRR system can be adopted to studies of all phytoplankton that possess efficient light harvesting in the waveband matching the bluish FRR excitation. Although these taxa cover the large bulk of all the phytoplankton taxa, one exception with a pronounced ecological significance is found in the Baltic Sea. The FRR system cannot be used to monitor the photophysiology of the cyanobacterial taxa harvesting light in the yellow-red waveband. These taxa include the ecologically-significant bloom-forming cyanobacterial taxa in the Baltic Sea.

Spectral Tuning and Adaptation to Different Light Environments of Mysid Visual Pigments

In the present thesis, questions of spectral tuning, the relation of spectral and thermal properties of visual pigments, and evolutionary adaptation to different light environments were addressed using a group of small crustaceans of the genus Mysis as a model. The study was based on microspectrophotometric measurements of visual pigment absorbance spectra, electrophysiological measurements of spectral sensitivities of dark-adapted eyes, and sequencing of the opsin gene retrieved through PCR. The spectral properties were related to the spectral transmission of the respective light environments, as well as to the phylogentic histories of the species. The photoactivation energy (Ea) was estimated from temperature effects on spectral sensitivity in the long-wavelength range, and calculations were made for optimal quantum catch and optimal signal-to-noise ratio in the different light environments. The opsin amino acid sequences of spectrally characterized individuals were compared to find candidate residues for spectral tuning. The general purpose was to clarify to what extent and on what time scale adaptive evolution has driven the functional properties of (mysid) visual pigments towards optimal performance in different light environments. An ultimate goal was to find the molecular mechanisms underlying the spectral tuning and to understand the balance between evolutionary adaptation and molecular constraints. The totally consistent segregation of absorption maxima (λmax) into (shorter-wavelength) marine and (longer-wavelength) freshwater populations suggests that truly adaptive evolution is involved in tuning the visual pigment for optimal performance, driven by selection for high absolute visual sensitivity. On the other hand, the similarity in λmax and opsin sequence between several populations of freshwater M. relicta in spectrally different lakes highlights the limits to adaptation set by evolutionary history and time. A strong inverse correlation between Ea and λmax was found among all visual pigments studied in these respects, including those of M. relicta and 10 species of vertebrate pigments, and this was used to infer thermal noise. The conceptual signal-to-noise ratios thus calculated for pigments with different λmax in the Baltic Sea and Lake Pääjärvi light environments supported the notion that spectral adaptation works towards maximizing the signal-to-noise ratio rather than quantum catch as such. Judged by the shape of absorbance spectra, the visual pigments of all populations of M. relicta and M. salemaai used exclusively the A2 chromophore (3, 4-dehydroretinal). A comparison of amino acid substitutions between M. relicta and M. salemaai indicated that mysid shrimps have a small number of readily available tuning sites to shift between a shorter - and a longer -wavelength opsin. However, phylogenetic history seems to have prevented marine M. relicta from converting back to the (presumably) ancestral opsin form, and thus the more recent reinvention of marine spectral sensitivity has been accomplished by some other novel mechanism, yet to be found

Redefine: Runtime Reconfigurable Polymorphic ASIC

Emerging embedded applications are based on evolving standards (e.g., MPEG2/4, H.264/265, IEEE802.11a/b/g/n). Since most of these applications run on handheld devices, there is an increasing need for a single chip solution that can dynamically interoperate between different standards and their derivatives. In order to achieve high resource utilization and low power dissipation, we propose REDEFINE, a polymorphic ASIC in which specialized hardware units are replaced with basic hardware units that can create the same functionality by runtime re-composition. It is a ``future-proof'' custom hardware solution for multiple applications and their derivatives in a domain. In this article, we describe a compiler framework and supporting hardware comprising compute, storage, and communication resources. Applications described in high-level language (e.g., C) are compiled into application substructures. For each application substructure, a set of compute elements on the hardware are interconnected during runtime to form a pattern that closely matches the communication pattern of that particular application. The advantage is that the bounded CEs are neither processor cores nor logic elements as in FPGAs. Hence, REDEFINE offers the power and performance advantage of an ASIC and the hardware reconfigurability and programmability of that of an FPGA/instruction set processor. In addition, the hardware supports custom instruction pipelining. Existing instruction-set extensible processors determine a sequence of instructions that repeatedly occur within the application to create custom instructions at design time to speed up the execution of this sequence. We extend this scheme further, where a kernel is compiled into custom instructions that bear strong producer-consumer relationship (and not limited to frequently occurring sequences of instructions). Custom instructions, realized as hardware compositions effected at runtime, allow several instances of the same to be active in parallel. A key distinguishing factor in majority of the emerging embedded applications is stream processing. To reduce the overheads of data transfer between custom instructions, direct communication paths are employed among custom instructions. In this article, we present the overview of the hardware-aware compiler framework, which determines the NoC-aware schedule of transports of the data exchanged between the custom instructions on the interconnect. The results for the FFT kernel indicate a 25% reduction in the number of loads/stores, and throughput improves by log(n) for n-point FFT when compared to sequential implementation. Overall, REDEFINE offers flexibility and a runtime reconfigurability at the expense of 1.16x in power and 8x in area when compared to an ASIC. REDEFINE implementation consumes 0.1x the power of an FPGA implementation. In addition, the configuration overhead of the FPGA implementation is 1,000x more than that of REDEFINE.

Robust THP Transceiver Designs for Multiuser MIMO Downlink with Imperfect CSIT

We present robust joint nonlinear transceiver designs for multiuser multiple-input multiple-output (MIMO) downlink in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas, and each user terminal is equipped with one or more receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for interuser interference precancellation at the transmitter. We consider robust transceiver designs that jointly optimize the transmit THP filters and receive filter for two models of CSIT errors. The first model is a stochastic error (SE) model, where the CSIT error is Gaussian-distributed. This model is applicable when the CSIT error is dominated by channel estimation error. In this case, the proposed robust transceiver design seeks to minimize a stochastic function of the sum mean square error (SMSE) under a constraint on the total BS transmit power. We propose an iterative algorithm to solve this problem. The other model we consider is a norm-bounded error (NBE) model, where the CSIT error can be specified by an uncertainty set. This model is applicable when the CSIT error is dominated by quantization errors. In this case, we consider a worst-case design. For this model, we consider robust (i) minimum SMSE, (ii) MSE-constrained, and (iii) MSE-balancing transceiver designs. We propose iterative algorithms to solve these problems, wherein each iteration involves a pair of semidefinite programs (SDPs). Further, we consider an extension of the proposed algorithm to the case with per-antenna power constraints. We evaluate the robustness of the proposed algorithms to imperfections in CSIT through simulation, and show that the proposed robust designs outperform nonrobust designs as well as robust linear transceiver designs reported in the recent literature.

Topology-based denoising of chaos

In this article, we propose a denoising algorithm to denoise a time series y(i) = x(i) + e(i), where {x(i)} is a time series obtained from a time- T map of a uniformly hyperbolic or Anosov flow, and {e(i)} a uniformly bounded sequence of independent and identically distributed (i.i.d.) random variables. Making use of observations up to time n, we create an estimate of x(i) for i<n. We show under typical limiting behaviours of the orbit and the recurrence properties of x(i), the estimation error converges to zero as n tends to infinity with probability 1.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Complex solitons in Bose-Einstein condensates with two- and three-body interactions

For the first time, we find the complex solitons for a quasi-one-dimensional Bose-Einstein condensate with two-and three-body interactions. These localized solutions are characterized by a power law behaviour. Both dark and right solitons can be excited in the experimentally allowed parameter domain, when two-and three-body interactions are,respectively, repulsive and attractive. The dark solitons travel with a constant speed, which is quite different from the Lieb mode, where profiles with different speeds, bounded above by sound velocity, can exist for specified interaction strengths. We also study the properties of these solitons in the presence of harmonic confinement with time-dependent nonlinearity and loss. The modulational instability and the Vakhitov-Kolokolov criterion of stability are also studied.

A characterization of domains in C 2 with noncompact automorphism group

Let D be a bounded domain in C 2 with a non-compact group of holomorphic automorphisms. Model domains for D are obtained under the hypotheses that at least one orbit accumulates at a boundary point near which the boundary is smooth, real analytic and of finite type.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Low correlation sequences over AM-PSK and QAM alphabets

A construction for a family of sequences over the 8-ary AM-PSK constellation that has maximum nontrivial correlation magnitude bounded as theta(max) less than or similar to root N is presented here. The famfly is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM with theta(max) less than or similar to root 2 root N. These families are constructed by interleaving sets of sequences. A construction for a famBy of low-correlation sequences over QAM alphabet of size 2(2m) is presented with maximum nontrivial normalized correlation parameter bounded above by less than or similar to a root N, where N is the period of the sequences in the family and where a ranges from 1.61 in the case of 16-QAM modulation to 2.76 for large m. When used in a CDMA setting, the family will permit each user to modulate the code sequence with 2m bits of data. Interestingly, the construction permits users on the reverse link of the CDMA channel to communicate using varying data rates by switching between sequence famflies; associated to different values of the parameter m. Other features of the sequence families are improved Euclidean distance between different data symbols in comparison with PSK signaling and compatibility of the QAM sequence families with sequences belonging to the large quaternary sequence families {S(p)}.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs

We study a fixed-point formalization of the well-known analysis of Bianchi. We provide a significant simplification and generalization of the analysis. In this more general framework, the fixed-point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any flow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large number of nodes, explicit formulas for the collision probability, the aggregate attempt rate, and the aggregate throughput are provided. The results from the analysis are compared with ns2 simulations and also with an exact Markov model of the backoff process. It is shown how the saturated network analysis can be used to obtain TCP transfer throughputs in some cases.