Patterns on a Roll: A Method for Continuous Feed Nanoprinting

Exploiting elastic instability in thin films has proven a robust method for creating complex patterns and structures across a wide range of lengthscales. Even the simplest of systems, an elastic membrane with a lattice of pores, under mechanical strain, generates complex patterns featuring long-range orientational order. When we promote this system to a curved surface, in particular, a cylindrical membrane, a novel set of features, patterns and broken symmetries appears. The newfound periodicity of the cylinder allows for a novel continuous method for nanoprinting.Comment: 4 pages, 4 figure

Improved Distributed Algorithms for Exact Shortest Paths

Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et al. [DISC'17] which deterministically computes $(1+o(1))$-approximate shortest paths in $\tilde O(D+\sqrt n)$ time, where $D$ is the hop-diameter of the graph. Up to logarithmic factors, this time complexity is optimal, matching the lower bound of Elkin [STOC'04]. The question of exact shortest paths however saw no algorithmic progress for decades, until the recent breakthrough of Elkin [STOC'17], which established a sublinear-time algorithm for exact single source shortest paths on undirected graphs. Shortly after, Huang et al. [FOCS'17] provided improved algorithms for exact all pairs shortest paths problem on directed graphs. In this paper, we present a new single-source shortest path algorithm with complexity $\tilde O(n^{3/4}D^{1/4})$. For polylogarithmic $D$, this improves on Elkin's $\tilde{O}(n^{5/6})$ bound and gets closer to the $\tilde{\Omega}(n^{1/2})$ lower bound of Elkin [STOC'04]. For larger values of $D$, we present an improved variant of our algorithm which achieves complexity $\tilde{O}\left( n^{3/4+o(1)}+ \min\{ n^{3/4}D^{1/6},n^{6/7}\}+D\right)$, and thus compares favorably with Elkin's bound of $\tilde{O}(n^{5/6} + n^{2/3}D^{1/3} + D )$ in essentially the entire range of parameters. This algorithm provides also a qualitative improvement, because it works for the more challenging case of directed graphs (i.e., graphs where the two directions of an edge can have different weights), constituting the first sublinear-time algorithm for directed graphs. Our algorithm also extends to the case of exact $\kappa$-source shortest paths...Comment: 26 page

F = Finance

This paper gives notification of changes approved by CRIR which will be included i

Joint Scheduling and Resource Allocation in CDMA Systems

Transactions on Information Theory. In this paper, the scheduling and resource allocation problem for the downlink in a CDMA-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the “optimal ” PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence. Index Terms Cellular network, channel-aware scheduling, code division multiple access (CDMA), convex optimization, resource allocation, utility maximization. I

One Loop Renormalizability of Spontaneously Broken Gauge Theory with a Product of Gauge Groups on Noncommutative Spacetime: the U(1) x U(1) Case

A generalization of the standard electroweak model to noncommutative spacetime would involve a product gauge group which is spontaneously broken. Gauge interactions in terms of physical gauge bosons are canonical with respect to massless gauge bosons as required by the exact gauge symmetry, but not so with respect to massive ones; and furthermore they are generally asymmetric in the two sets of gauge bosons. On noncommutative spacetime this already occurs for the simplest model of U(1) x U(1). We examine whether the above feature in gauge interactions can be perturbatively maintained in this model. We show by a complete one loop analysis that all ultraviolet divergences are removable with a few renormalization constants in a way consistent with the above structure.Comment: 24 pages, figures using axodraw; version 2: a new ref item [4] added to cite efforts to all orders, typos fixed and minor rewordin

Family Unification, Exotic States and Light Magnetic Monopoles

Models with fermions in bifundamental representations can lead naturally to family unification as opposed to family replication. Such models typically predict (exotic) color singlet states with fractional electric charge, and magnetic monopoles with multiple Dirac charge. The exotics may be at the TeV scale, and relatively light magnetic monopoles (greater than about 10^7 GeV) can be present in the galaxy with abundance near the Parker bound. We focus on three family SU(4)XSU(3)XSU(3) models.Comment: 37 page

Experimental Results on Heavy Quarks

This paper reviews the results presented at the 31st ICHEP on Heavy Quarks, with emphasis on those related to the determinationof the unitarity triangle parameters.Comment: Plenary talk given at 31st ICHEP, Amserdam, 24-31 July 200

Tunable magnetic exchange interactions in manganese-doped inverted core/shell ZnSe/CdSe nanocrystals

Magnetic doping of semiconductor nanostructures is actively pursued for applications in magnetic memory and spin-based electronics. Central to these efforts is a drive to control the interaction strength between carriers (electrons and holes) and the embedded magnetic atoms. In this respect, colloidal nanocrystal heterostructures provide great flexibility via growth-controlled `engineering' of electron and hole wavefunctions within individual nanocrystals. Here we demonstrate a widely tunable magnetic sp-d exchange interaction between electron-hole excitations (excitons) and paramagnetic manganese ions using `inverted' core-shell nanocrystals composed of Mn-doped ZnSe cores overcoated with undoped shells of narrower-gap CdSe. Magnetic circular dichroism studies reveal giant Zeeman spin splittings of the band-edge exciton that, surprisingly, are tunable in both magnitude and sign. Effective exciton g-factors are controllably tuned from -200 to +30 solely by increasing the CdSe shell thickness, demonstrating that strong quantum confinement and wavefunction engineering in heterostructured nanocrystal materials can be utilized to manipulate carrier-Mn wavefunction overlap and the sp-d exchange parameters themselves.Comment: To appear in Nature Materials; 18 pages, 4 figures + Supp. Inf

Holocentric Chromosomes of Luzula elegans Are Characterized by a Longitudinal Centromere Groove, Chromosome Bending, and a Terminal Nucleolus Organizer Region

The structure of holocentric chromosomes was analyzed in mitotic cells of Luzula elegans. Light and scanning electron microscopy observations provided evidence for the existence of a longitudinal groove along each sister chromatid. The centromere-specific histone H3 variant, CENH3, colocalized with this groove and with microtubule attachment sites. The terminal chromosomal regions were CENH3-negative. During metaphase to anaphase transition, L. elegans chromosomes typically curved to a sickle-like shape, a process that is likely to be influenced by the pulling forces of microtubules along the holocentric axis towards the corresponding microtubule organizing regions. A single pair of 45S rDNA sites, situated distal to Arabidopsis-telomere repeats, was observed at the terminal region of one chromosome pair. We suggest that the 45S rDNA position in distal centromere-free regions could be required to ensure chromosome stability. Copyright (C) 2011 S. Karger AG, Base

The development and use of the Assessment of Dementia Awareness and Person-centred Care Training (ADAPT) tool in long-term care

Policy and practice guidelines recommend person-centred care (PCC) to support people to live well with dementia in long-term care (LTC). Therefore, staff working in LTC settings need to be trained in dementia awareness and PCC. However, the access to, content of and reach of training across LTC settings can be varied. Data on current and ongoing access to PCC training can form and important component of data gathered on usual care (UC) in research studies, in particular clinical trials within LTC. However, no suitable assessment tools are available to measure dementia awareness and PCC training availability, content and reach. This paper describes the development of a training audit tool to meet this need for a UC measure of dementia awareness and PCC training. The ‘Assessment of Dementia Awareness and Person-centred care Training’ (ADAPT) tool was based on a review of published PCC literature and consultation with dementia and aged care experts. The ADAPT tool was piloted in 13 LTC facilities the UK and Australia, before being used to assess the content of dementia and PCC awareness training in 50 UK settings in a randomized controlled trial (RCT) as part of a UC recording. Following pilot testing, modifications to the ADAPT tool’s wording were made to enhance item clarity. When implemented in the RCT, pre-baseline training assessment data showed that the ADAPT tool was able to differentiate between LTC and identify settings where further dementia awareness training was required. ADAPT was then used as a method of recording data on dementia awareness and PCC training as part of UC data collection. The ADAPT tool is suitable for use by researchers to establish the availability, content and reach of dementia and PCC awareness training to staff within research studies