9,418 research outputs found

    Domain Walls on the Brane

    Get PDF
    We show that all branes admit worldvolume domain wall solutions. We find one class of solutions for which the tension of the brane changes discontinuously along the domain wall. These solutions are not supersymmetric. We argue that there is another class of domain wall solutions which is supersymmetric. A particular case concerns supersymmetric domain wall solutions on IIB D-5- and NS-5-branes.Comment: 18 pages, Tex, uses phyzz

    Counting Dyons in N=4 String Theory

    Get PDF
    We present a microscopic index formula for the degeneracy of dyons in four-dimensional N=4 string theory. This counting formula is manifestly symmetric under the duality group, and its asymptotic growth reproduces the macroscopic Bekenstein-Hawking entropy. We give a derivation of this result in terms of the type II five-brane compactified on K3, by assuming that its fluctuations are described by a closed string theory on its world-volume. We find that the degeneracies are given in terms of the denominator of a generalized super Kac-Moody algebra. We also discuss the correspondence of this result with the counting of D-brane states.Comment: 22 pages, latex, one epsf-figur

    Crossing Patterns in Nonplanar Road Networks

    Full text link
    We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross each other. In this paper, we study the sparsity properties of crossing graphs of real-world road networks. We show that, in large road networks (the Urban Road Network Dataset), the crossing graphs have connected components that are primarily trees, and that the remaining non-tree components are typically sparse (technically, that they have bounded degeneracy). We prove theoretically that when an embedded graph has a sparse crossing graph, it has other desirable properties that lead to fast algorithms for shortest paths and other algorithms important in geographic information systems. Notably, these graphs have polynomial expansion, meaning that they and all their subgraphs have small separators.Comment: 9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM SIGSPATIAL 2017

    Interstitial crime analysis

    Get PDF
    Crime on public transport can be very difficult to analyse. 'Stealth crimes' like pick-pocketing present a particular challenge because victims often have an imprecise knowledge of the location and time of the offence. In this scenario crime has typically been recorded as happening at the reporting station (often at the ‘end of line’) which skews any analysis of the collective crime locations. Interstitial crime analysis (ICA) is a technique which overcomes this problem and improves the estimation of the spatial distribution of crime on networks when the exact location of offences is unknown. Based on the aoristic analysis technique (devised to estimate the temporal distribution of crime when only a time period is known), ICA is used to estimate the location of crimes in the interstices – the intervening spaces - of a network when the location is unknown

    Integrated and adaptive traffic signal control for diamond interchange : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mechatronics Engineering at Massey University, Albany, New Zealand

    Get PDF
    New dynamic signal control methods such as fuzzy logic and artificial intelligence developed recently mainly focused on isolated intersection. Adaptive signal control based on fuzzy logic control (FLC) determines the duration and sequence that traffic signal should stay in a certain state, before switching to the next state (Trabia et al. 1999, Pham 2013). The amount of arriving and waiting vehicles are quantized into fuzzy variables and fuzzy rules are used to determine if the duration of the current state should be extended. The fuzzy logic controller showed to be more flexible than fixed controllers and vehicle actuated controllers, allowing traffic to flow more smoothly. The FLC does not possess the ability to handle various uncertainties especially in real world traffic control. Therefore it is not best suited for stochastic nature problems such as traffic signal timing optimization. However, probabilistic logic is the best choice to handle the uncertainties containing both stochastic and fuzzy features (Pappis and Mamdani 1977) Probabilistic fuzzy logic control is developed for the signalised control of a diamond interchange, where the signal phasing, green time extension and ramp metering are decided in response to real time traffic conditions, which aim at improving traffic flows on surface streets and highways. The probabilistic fuzzy logic for diamond interchange (PFLDI) comprises three modules: probabilistic fuzzy phase timing (PFPT) that controls the green time extension process of the current running phase, phase selection (PSL) which decides the next phase based on the pre-setup phase logic by the local transport authority and, probabilistic fuzzy ramp-metering (PFRM) that determines on-ramp metering rate based on traffic conditions of the arterial streets and highways. We used Advanced Interactive Microscopic Simulator for Urban and Non-Urban Network (AIMSUN) software for diamond interchange modeling and performance measure of effectiveness for the PFLDI algorithm. PFLDI was compared with actuated diamond interchange (ADI) control based on ALINEA algorithm and conventional fuzzy logic diamond interchange algorithm (FLDI). Simulation results show that the PFLDI surpasses the traffic actuated and conventional fuzzy models with lower System Total Travel Time, Average Delay and improvements in Downstream Average Speed and Downstream Average Delay. On the other hand, little attention has been given in recent years to the delays experienced by cyclists in urban transport networks. When planning changes to traffic signals or making other network changes, the value of time for cycling trips is rarely considered. The traditional approach to road management has been to only focus on improving the carrying capacity relating to vehicles, with an emphasis on maximising the speed and volume of motorised traffic moving around the network. The problem of cyclist delay has been compounded by the fact that the travel time for cyclists have been lower than those for vehicles, which affects benefit–cost ratios and effectively provides a disincentive to invest in cycling issues compared with other modes. The issue has also been influenced by the way in which traffic signals have been set up and operated. Because the primary stresses on an intersection tend to occur during vehicle (commuter) peaks in the morning and afternoon, intersections tend to be set up and coordinated to allow maximum flow during these peaks. The result is that during off-peak periods there is often spare capacity that is underutilised. Phasing and timings set up for peaks may not provide the optimum benefits during off-peak times. This is particularly important to cyclists during lunch-time peaks, when vehicle volumes are low and cyclist volumes are high. Cyclists can end up waiting long periods of time as a result of poor signal phasing, rather than due to the demands of other road users being placed on the network. The outcome of this study will not only reduce the traffic congestion during peak hours but also improve the cyclists’ safety at a typical diamond interchange
    corecore